npm - @vuu-ui/vuu-data-test - Versions diffs - 0.8.17-debug → 0.8.18-debug - Mend

@vuu-ui/vuu-data-test 0.8.17-debug → 0.8.18-debug

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (45) hide show

package/cjs/index.js.map CHANGED Viewed

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../../../node_modules/@thomaschaplin/isin-generator/country-codes.json", "../../../node_modules/@thomaschaplin/cusip-generator/src/convert-string-to-base-ten-number.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/is-odd.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-cusip-check-code.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/fixtures/alphabet.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/fixtures/base-ten-numbers.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/fixtures/alphanumeric-values.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-random-alphanumeric.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-random-string-of-alphanumeric-chars.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-random-base-ten-number.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-random-string-of-base-ten-chars.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-cusip-without-check-code.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-cusip.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/index.ts", "../../../node_modules/@thomaschaplin/isin-generator/index.js", "../../../packages/vuu-data-test/src/index.ts", "../../../packages/vuu-data-test/src/basket/basket-schemas.ts", "../../../packages/vuu-data-test/src/simul/simul-schemas.ts", "../../../packages/vuu-data-test/src/schemas.ts", "../../../packages/vuu-utils/src/array-utils.ts", "../../../packages/vuu-utils/src/filter-utils.ts", "../../../packages/vuu-utils/src/column-utils.ts", "../../../packages/vuu-utils/src/cookie-utils.ts", "../../../packages/vuu-utils/src/range-utils.ts", "../../../packages/vuu-utils/src/DataWindow.ts", "../../../packages/vuu-utils/src/date/formatter.ts", "../../../packages/vuu-utils/src/logging-utils.ts", "../../../packages/vuu-utils/src/debug-utils.ts", "../../../packages/vuu-utils/src/event-emitter.ts", "../../../packages/vuu-utils/src/round-decimal.ts", "../../../packages/vuu-utils/src/json-utils.ts", "../../../packages/vuu-utils/src/keyset.ts", "../../../packages/vuu-utils/src/nanoid/index.ts", "../../../packages/vuu-utils/src/perf-utils.ts", "../../../packages/vuu-utils/src/row-utils.ts", "../../../packages/vuu-utils/src/selection-utils.ts", "../../../node_modules/html-to-image/src/util.ts", "../../../packages/vuu-data/src/data-source.ts", "../../../packages/vuu-data/src/server-proxy/messages.ts", "../../../packages/vuu-data/src/vuuUIMessageTypes.ts", "../../../packages/vuu-data/src/inlined-worker.js", "../../../packages/vuu-data/src/connection-manager.ts", "../../../node_modules/@lezer/common/dist/index.js", "../../../node_modules/@lezer/lr/dist/index.js", "../../../packages/vuu-filter-parser/src/generated/filter-parser.js", "../../../packages/vuu-filter-parser/src/FilterTreeWalker.ts", "../../../packages/vuu-filter-parser/src/FilterParser.ts", "../../../packages/vuu-filter-parser/src/filter-evaluation-utils.ts", "../../../packages/vuu-data/src/array-data-source/aggregate-utils.ts", "../../../packages/vuu-data/src/array-data-source/group-utils.ts", "../../../packages/vuu-data/src/array-data-source/sort-utils.ts", "../../../packages/vuu-data/src/array-data-source/array-data-utils.ts", "../../../packages/vuu-data/src/array-data-source/array-data-source.ts", "../../../packages/vuu-data/src/json-data-source.ts", "../../../packages/vuu-data/src/remote-data-source.ts", "../../../packages/vuu-data-test/src/makeSuggestions.ts", "../../../packages/vuu-data-test/src/TickingArrayDataSource.ts", "../../../packages/vuu-data-test/src/vuu-row-generator.ts", "../../../packages/vuu-data-test/src/Table.ts", "../../../packages/vuu-data-test/src/data-utils.ts", "../../../packages/vuu-data-test/src/UpdateGenerator.ts", "../../../packages/vuu-data-test/src/basket/reference-data/ftse100.ts", "../../../packages/vuu-data-test/src/basket/reference-data/nasdaq100.ts", "../../../packages/vuu-data-test/src/basket/reference-data/sp500.ts", "../../../packages/vuu-data-test/src/basket/reference-data/hsi.ts", "../../../packages/vuu-data-test/src/basket/reference-data/constituents.ts", "../../../packages/vuu-data-test/src/basket/reference-data/prices.ts", "../../../packages/vuu-data-test/src/basket/basket-module.ts", "../../../packages/vuu-data-test/src/simul/reference-data/instruments.ts", "../../../packages/vuu-data-test/src/simul/reference-data/currencies.ts", "../../../packages/vuu-data-test/src/simul/reference-data/locations.ts", "../../../packages/vuu-data-test/src/simul/reference-data/lotsizes.ts", "../../../packages/vuu-data-test/src/simul/reference-data/instruments-extended.ts", "../../../packages/vuu-data-test/src/simul/reference-data/prices.ts", "../../../packages/vuu-data-test/src/simul/simul-module.ts", "../../../packages/vuu-data-test/src/vuu-modules.ts"],
-  "sourcesContent": ["[\r\n    \"AD\",\r\n    \"AE\",\r\n    \"AF\",\r\n    \"AG\",\r\n    \"AI\",\r\n    \"AL\",\r\n    \"AM\",\r\n    \"AO\",\r\n    \"AQ\",\r\n    \"AR\",\r\n    \"AS\",\r\n    \"AT\",\r\n    \"AU\",\r\n    \"AW\",\r\n    \"AX\",\r\n    \"AZ\",\r\n    \"BA\",\r\n    \"BB\",\r\n    \"BD\",\r\n    \"BE\",\r\n    \"BF\",\r\n    \"BG\",\r\n    \"BH\",\r\n    \"BI\",\r\n    \"BJ\",\r\n    \"BL\",\r\n    \"BM\",\r\n    \"BN\",\r\n    \"BO\",\r\n    \"BQ\",\r\n    \"BR\",\r\n    \"BS\",\r\n    \"BT\",\r\n    \"BV\",\r\n    \"BW\",\r\n    \"BY\",\r\n    \"BZ\",\r\n    \"CA\",\r\n    \"CC\",\r\n    \"CD\",\r\n    \"CF\",\r\n    \"CG\",\r\n    \"CH\",\r\n    \"CI\",\r\n    \"CK\",\r\n    \"CL\",\r\n    \"CM\",\r\n    \"CN\",\r\n    \"CO\",\r\n    \"CR\",\r\n    \"CU\",\r\n    \"CV\",\r\n    \"CW\",\r\n    \"CX\",\r\n    \"CY\",\r\n    \"CZ\",\r\n    \"DE\",\r\n    \"DJ\",\r\n    \"DK\",\r\n    \"DM\",\r\n    \"DO\",\r\n    \"DZ\",\r\n    \"EC\",\r\n    \"EE\",\r\n    \"EG\",\r\n    \"EH\",\r\n    \"ER\",\r\n    \"ES\",\r\n    \"ET\",\r\n    \"FI\",\r\n    \"FJ\",\r\n    \"FK\",\r\n    \"FM\",\r\n    \"FO\",\r\n    \"FR\",\r\n    \"GA\",\r\n    \"GB\",\r\n    \"GD\",\r\n    \"GE\",\r\n    \"GF\",\r\n    \"GG\",\r\n    \"GH\",\r\n    \"GI\",\r\n    \"GL\",\r\n    \"GM\",\r\n    \"GN\",\r\n    \"GP\",\r\n    \"GQ\",\r\n    \"GR\",\r\n    \"GS\",\r\n    \"GT\",\r\n    \"GU\",\r\n    \"GW\",\r\n    \"GY\",\r\n    \"HK\",\r\n    \"HM\",\r\n    \"HN\",\r\n    \"HR\",\r\n    \"HT\",\r\n    \"HU\",\r\n    \"ID\",\r\n    \"IE\",\r\n    \"IL\",\r\n    \"IM\",\r\n    \"IN\",\r\n    \"IO\",\r\n    \"IQ\",\r\n    \"IR\",\r\n    \"IS\",\r\n    \"IT\",\r\n    \"JE\",\r\n    \"JM\",\r\n    \"JO\",\r\n    \"JP\",\r\n    \"KE\",\r\n    \"KG\",\r\n    \"KH\",\r\n    \"KI\",\r\n    \"KM\",\r\n    \"KN\",\r\n    \"KP\",\r\n    \"KR\",\r\n    \"KW\",\r\n    \"KY\",\r\n    \"KZ\",\r\n    \"LA\",\r\n    \"LB\",\r\n    \"LC\",\r\n    \"LI\",\r\n    \"LK\",\r\n    \"LR\",\r\n    \"LS\",\r\n    \"LT\",\r\n    \"LU\",\r\n    \"LV\",\r\n    \"LY\",\r\n    \"MA\",\r\n    \"MC\",\r\n    \"MD\",\r\n    \"ME\",\r\n    \"MF\",\r\n    \"MG\",\r\n    \"MH\",\r\n    \"MK\",\r\n    \"ML\",\r\n    \"MM\",\r\n    \"MN\",\r\n    \"MO\",\r\n    \"MP\",\r\n    \"MQ\",\r\n    \"MR\",\r\n    \"MS\",\r\n    \"MT\",\r\n    \"MU\",\r\n    \"MV\",\r\n    \"MW\",\r\n    \"MX\",\r\n    \"MY\",\r\n    \"MZ\",\r\n    \"NA\",\r\n    \"NC\",\r\n    \"NE\",\r\n    \"NF\",\r\n    \"NG\",\r\n    \"NI\",\r\n    \"NL\",\r\n    \"NO\",\r\n    \"NP\",\r\n    \"NR\",\r\n    \"NU\",\r\n    \"NZ\",\r\n    \"OM\",\r\n    \"PA\",\r\n    \"PE\",\r\n    \"PF\",\r\n    \"PG\",\r\n    \"PH\",\r\n    \"PK\",\r\n    \"PL\",\r\n    \"PM\",\r\n    \"PN\",\r\n    \"PR\",\r\n    \"PS\",\r\n    \"PT\",\r\n    \"PW\",\r\n    \"PY\",\r\n    \"QA\",\r\n    \"RE\",\r\n    \"RO\",\r\n    \"RS\",\r\n    \"RU\",\r\n    \"RW\",\r\n    \"SA\",\r\n    \"SB\",\r\n    \"SC\",\r\n    \"SD\",\r\n    \"SE\",\r\n    \"SG\",\r\n    \"SH\",\r\n    \"SI\",\r\n    \"SJ\",\r\n    \"SK\",\r\n    \"SL\",\r\n    \"SM\",\r\n    \"SN\",\r\n    \"SO\",\r\n    \"SR\",\r\n    \"SS\",\r\n    \"ST\",\r\n    \"SV\",\r\n    \"SX\",\r\n    \"SY\",\r\n    \"SZ\",\r\n    \"TC\",\r\n    \"TD\",\r\n    \"TF\",\r\n    \"TG\",\r\n    \"TH\",\r\n    \"TJ\",\r\n    \"TK\",\r\n    \"TL\",\r\n    \"TM\",\r\n    \"TN\",\r\n    \"TO\",\r\n    \"TR\",\r\n    \"TT\",\r\n    \"TV\",\r\n    \"TW\",\r\n    \"TZ\",\r\n    \"UA\",\r\n    \"UG\",\r\n    \"UM\",\r\n    \"US\",\r\n    \"UY\",\r\n    \"UZ\",\r\n    \"VA\",\r\n    \"VC\",\r\n    \"VE\",\r\n    \"VG\",\r\n    \"VI\",\r\n    \"VN\",\r\n    \"VU\",\r\n    \"WF\",\r\n    \"WS\",\r\n    \"YE\",\r\n    \"YT\",\r\n    \"ZA\",\r\n    \"ZM\",\r\n    \"ZW\"\r\n]", null, null, null, null, null, null, null, null, null, null, null, null, null, "'use-strict'\r\n\r\nconst countryCodes = require('./country-codes.json')\r\nconst cusip = require('@thomaschaplin/cusip-generator').generateCusip()\r\n\r\n\r\nconst generateIsin = cusip => {\r\n    let code = countryCodes[Math.floor(Math.random() * countryCodes.length)]\r\n    let isin = code + cusip + generateIsinCheckDigit(code + cusip + '0')\r\n    return isin\r\n}\r\n\r\nconst generateIsinCheckDigit = isin => {\r\n    if (isin.length != 12) return false;\r\n    var v = [];\r\n    for (var i = isin.length - 2; i >= 0; i--) {\r\n        let c = isin.charAt(i);\r\n        if (isNaN(c)) {\r\n            var letterCode = isin.charCodeAt(i) - 55;\r\n            v.push(letterCode % 10);\r\n            if (letterCode > 9) {\r\n                v.push(Math.floor(letterCode / 10));\r\n            }\r\n        } else {\r\n            v.push(Number(c));\r\n        }\r\n    }\r\n    var sum = 0;\r\n    var l = v.length;\r\n    for (var i = 0; i < l; i++) {\r\n        if (i % 2 == 0) {\r\n            var d = v[i] * 2;\r\n            sum += Math.floor(d / 10)\r\n            sum += d % 10;\r\n        } else {\r\n            sum += v[i];\r\n        }\r\n    }\r\n    return (10 - (sum % 10)) % 10\r\n}\r\n\r\n\r\nexports.isinGenerator = function isinGenerator() {\r\n    return generateIsin(cusip)\r\n}", "export * from \"./schemas\";\nexport * from \"./TickingArrayDataSource\";\nexport * from \"./vuu-row-generator\";\nexport * from \"./vuu-modules\";\nexport { type BasketsTableName } from \"./basket/basket-schemas\";\nexport { createBasketTradingRow } from \"./basket/basket-module\";\nexport { type SimulTableName } from \"./simul/simul-schemas\";\n", "import { TableSchema } from \"@vuu-ui/vuu-data\";\n\nexport type BasketsTableName =\n  | \"algoType\"\n  | \"basket\"\n  | \"basketConstituent\"\n  | \"basketTrading\"\n  | \"basketTradingConstituent\"\n  | \"basketTradingConstituentJoin\"\n  | \"priceStrategyType\";\n\nexport const schemas: Readonly<\n  Record<BasketsTableName, Readonly<TableSchema>>\n> = {\n  algoType: {\n    columns: [\n      { name: \"algoType\", serverDataType: \"string\" },\n      { name: \"id\", serverDataType: \"int\" },\n    ],\n    key: \"id\",\n    table: { module: \"BASKET\", table: \"algoType\" },\n  },\n  basket: {\n    columns: [\n      { name: \"id\", serverDataType: \"string\" },\n      { name: \"name\", serverDataType: \"string\" },\n      { name: \"notionalValue\", serverDataType: \"double\" },\n      { name: \"notionalValueUsd\", serverDataType: \"double\" },\n    ],\n    key: \"id\",\n    table: { module: \"BASKET\", table: \"basket\" },\n  },\n  basketConstituent: {\n    columns: [\n      { name: \"basketId\", serverDataType: \"string\" },\n      { name: \"change\", serverDataType: \"string\" },\n      { name: \"description\", serverDataType: \"string\" },\n      { name: \"lastTrade\", serverDataType: \"string\" },\n      { name: \"ric\", serverDataType: \"string\" },\n      { name: \"ricBasketId\", serverDataType: \"string\" },\n      { name: \"side\", serverDataType: \"string\" },\n      { name: \"volume\", serverDataType: \"string\" },\n      { name: \"weighting\", serverDataType: \"double\" },\n    ],\n    key: \"ricBasketId\",\n    table: { module: \"BASKET\", table: \"basketConstituent\" },\n  },\n  basketTrading: {\n    columns: [\n      { name: \"basketId\", serverDataType: \"string\" },\n      { name: \"basketName\", serverDataType: \"string\" },\n      { name: \"filledPct\", serverDataType: \"double\" },\n      { name: \"fxRateToUsd\", serverDataType: \"double\" },\n      { name: \"instanceId\", serverDataType: \"string\" },\n      { name: \"side\", serverDataType: \"string\" },\n      { name: \"status\", serverDataType: \"string\" },\n      { name: \"totalNotional\", serverDataType: \"double\" },\n      { name: \"totalNotionalUsd\", serverDataType: \"double\" },\n      { name: \"units\", serverDataType: \"int\" },\n    ],\n    key: \"instanceId\",\n    table: { module: \"BASKET\", table: \"basketTrading\" },\n  },\n  basketTradingConstituent: {\n    columns: [\n      { name: \"algo\", serverDataType: \"string\" },\n      { name: \"algoParams\", serverDataType: \"string\" },\n      { name: \"basketId\", serverDataType: \"string\" },\n      { name: \"description\", serverDataType: \"string\" },\n      { name: \"instanceId\", serverDataType: \"string\" },\n      { name: \"instanceIdRic\", serverDataType: \"string\" },\n      { name: \"limitPrice\", serverDataType: \"double\" },\n      { name: \"notionalLocal\", serverDataType: \"double\" },\n      { name: \"notionalUsd\", serverDataType: \"double\" },\n      { name: \"pctFilled\", serverDataType: \"double\" },\n      { name: \"priceSpread\", serverDataType: \"int\" },\n      { name: \"priceStrategyId\", serverDataType: \"int\" },\n      { name: \"quantity\", serverDataType: \"long\" },\n      { name: \"ric\", serverDataType: \"string\" },\n      { name: \"side\", serverDataType: \"string\" },\n      { name: \"status\", serverDataType: \"string\" },\n      { name: \"venue\", serverDataType: \"string\" },\n      { name: \"weighting\", serverDataType: \"double\" },\n    ],\n    key: \"instanceIdRic\",\n    table: { module: \"BASKET\", table: \"basketTradingConstituent\" },\n  },\n\n  basketTradingConstituentJoin: {\n    columns: [\n      { name: \"algo\", serverDataType: \"string\" },\n      { name: \"algoParams\", serverDataType: \"string\" },\n      { name: \"ask\", serverDataType: \"double\" },\n      { name: \"askSize\", serverDataType: \"double\" },\n      { name: \"basketId\", serverDataType: \"string\" },\n      { name: \"bid\", serverDataType: \"double\" },\n      { name: \"bidSize\", serverDataType: \"double\" },\n      { name: \"close\", serverDataType: \"double\" },\n      { name: \"description\", serverDataType: \"string\" },\n      { name: \"instanceId\", serverDataType: \"string\" },\n      { name: \"instanceIdRic\", serverDataType: \"string\" },\n      { name: \"last\", serverDataType: \"double\" },\n      { name: \"limitPrice\", serverDataType: \"double\" },\n      { name: \"notionalLocal\", serverDataType: \"double\" },\n      { name: \"notionalUsd\", serverDataType: \"double\" },\n      { name: \"open\", serverDataType: \"double\" },\n      { name: \"pctFilled\", serverDataType: \"double\" },\n      { name: \"phase\", serverDataType: \"string\" },\n      { name: \"priceSpread\", serverDataType: \"int\" },\n      { name: \"priceStrategyId\", serverDataType: \"int\" },\n      { name: \"quantity\", serverDataType: \"long\" },\n      { name: \"ric\", serverDataType: \"string\" },\n      { name: \"scenario\", serverDataType: \"string\" },\n      { name: \"side\", serverDataType: \"string\" },\n      { name: \"status\", serverDataType: \"string\" },\n      { name: \"venue\", serverDataType: \"string\" },\n      { name: \"weighting\", serverDataType: \"double\" },\n    ],\n    key: \"instanceIdRic\",\n    table: { module: \"BASKET\", table: \"basketTradingConstituentJoin\" },\n  },\n  priceStrategyType: {\n    columns: [\n      { name: \"priceStrategy\", serverDataType: \"string\" },\n      { name: \"id\", serverDataType: \"int\" },\n    ],\n    key: \"\",\n    table: { module: \"BASKET\", table: \"priceStrategyType\" },\n  },\n};\n", "import type { TableSchema } from \"@vuu-ui/vuu-data\";\nimport type { ColumnDescriptor } from \"@vuu-ui/vuu-table-types\";\n\nexport type SimulTableName =\n  | \"instruments\"\n  | \"instrumentsExtended\"\n  | \"instrumentPrices\"\n  | \"orders\"\n  | \"childOrders\"\n  | \"parentOrders\"\n  | \"prices\";\n\n// These Schemas take the form of the schemas that we create\n// with TABLE_META returned by Vuu.\nexport const schemas: Readonly<Record<SimulTableName, Readonly<TableSchema>>> =\n  {\n    instruments: {\n      columns: [\n        { name: \"bbg\", serverDataType: \"string\" },\n        { name: \"currency\", serverDataType: \"string\" },\n        { name: \"description\", serverDataType: \"string\" },\n        { name: \"exchange\", serverDataType: \"string\" },\n        { name: \"isin\", serverDataType: \"string\" },\n        { name: \"lotSize\", serverDataType: \"int\" },\n        { name: \"ric\", serverDataType: \"string\" },\n      ],\n      key: \"ric\",\n      table: { module: \"SIMUL\", table: \"instruments\" },\n    },\n    instrumentsExtended: {\n      columns: [\n        { name: \"bbg\", serverDataType: \"string\" },\n        { name: \"currency\", serverDataType: \"string\" },\n        { name: \"description\", serverDataType: \"string\" },\n        { name: \"exchange\", serverDataType: \"string\" },\n        { name: \"isin\", serverDataType: \"string\" },\n        { name: \"lotSize\", serverDataType: \"int\" },\n        { name: \"ric\", serverDataType: \"string\" },\n        { name: \"supported\", serverDataType: \"boolean\" },\n        { name: \"wishlist\", serverDataType: \"boolean\" },\n      ],\n      key: \"ric\",\n      table: { module: \"SIMUL\", table: \"instruments\" },\n    },\n    instrumentPrices: {\n      columns: [\n        { name: \"ask\", serverDataType: \"double\" },\n        { name: \"askSize\", serverDataType: \"double\" }, // type: \"int\"\n        { name: \"bbg\", serverDataType: \"string\" },\n        { name: \"bid\", serverDataType: \"double\" },\n        { name: \"bidSize\", serverDataType: \"double\" },\n        { name: \"close\", serverDataType: \"double\" },\n        { name: \"currency\", serverDataType: \"string\" },\n        { name: \"description\", serverDataType: \"string\" },\n        { name: \"exchange\", serverDataType: \"string\" },\n        { name: \"isin\", serverDataType: \"string\" },\n        { name: \"last\", serverDataType: \"double\" },\n        { name: \"lotSize\", serverDataType: \"int\" },\n        { name: \"open\", serverDataType: \"double\" },\n        { name: \"phase\", serverDataType: \"string\" },\n        { name: \"ric\", serverDataType: \"string\" },\n        { name: \"scenario\", serverDataType: \"string\" },\n      ],\n      key: \"ric\",\n      table: { module: \"SIMUL\", table: \"instrumentPrices\" },\n    },\n    orders: {\n      columns: [\n        { name: \"ccy\", serverDataType: \"string\" },\n        { name: \"created\", serverDataType: \"long\" },\n        { name: \"filledQuantity\", serverDataType: \"double\" },\n        { name: \"lastUpdate\", serverDataType: \"long\" },\n        { name: \"orderId\", serverDataType: \"string\" },\n        { name: \"quantity\", serverDataType: \"double\" },\n        { name: \"ric\", serverDataType: \"string\" },\n        { name: \"side\", serverDataType: \"string\" },\n        { name: \"trader\", serverDataType: \"string\" },\n      ],\n      key: \"orderId\",\n      table: { module: \"SIMUL\", table: \"orders\" },\n    },\n    childOrders: {\n      columns: [\n        { name: \"account\", serverDataType: \"string\" },\n        { name: \"averagePrice\", serverDataType: \"double\" },\n        { name: \"ccy\", serverDataType: \"string\" },\n        { name: \"exchange\", serverDataType: \"string\" },\n        { name: \"filledQty\", serverDataType: \"double\" },\n        { name: \"id\", serverDataType: \"string\" },\n        { name: \"idAsInt\", serverDataType: \"int\" },\n        { name: \"lastUpdate\", serverDataType: \"long\" },\n        { name: \"openQty\", serverDataType: \"double\" },\n        { name: \"parentOrderId\", serverDataType: \"string\" },\n        { name: \"price\", serverDataType: \"double\" },\n        { name: \"quantity\", serverDataType: \"double\" },\n        { name: \"ric\", serverDataType: \"string\" },\n        { name: \"side\", serverDataType: \"string\" },\n        { name: \"status\", serverDataType: \"string\" },\n        { name: \"strategy\", serverDataType: \"string\" },\n        { name: \"volLimit\", serverDataType: \"int\" },\n      ],\n      key: \"id\",\n      table: { module: \"SIMUL\", table: \"childOrders\" },\n    },\n    parentOrders: {\n      columns: [\n        { name: \"account\", serverDataType: \"string\" },\n        { name: \"algo\", serverDataType: \"string\" },\n        { name: \"averagePrice\", serverDataType: \"double\" },\n        { name: \"ccy\", serverDataType: \"string\" },\n        { name: \"childCount\", serverDataType: \"int\" },\n        { name: \"exchange\", serverDataType: \"string\" },\n        { name: \"filledQty\", serverDataType: \"double\" },\n        { name: \"id\", serverDataType: \"string\" },\n        { name: \"idAsInt\", serverDataType: \"int\" },\n        { name: \"lastUpdate\", serverDataType: \"long\" },\n        { name: \"openQty\", serverDataType: \"double\" },\n        { name: \"price\", serverDataType: \"double\" },\n        { name: \"quantity\", serverDataType: \"double\" },\n        { name: \"ric\", serverDataType: \"string\" },\n        { name: \"side\", serverDataType: \"string\" },\n        { name: \"status\", serverDataType: \"string\" },\n        { name: \"volLimit\", serverDataType: \"int\" },\n      ],\n      key: \"id\",\n      table: { module: \"SIMUL\", table: \"parentOrders\" },\n    },\n    prices: {\n      columns: [\n        { name: \"ask\", serverDataType: \"double\" },\n        { name: \"askSize\", serverDataType: \"double\" }, // type: \"int\"\n        { name: \"bid\", serverDataType: \"double\" },\n        { name: \"bidSize\", serverDataType: \"double\" },\n        { name: \"close\", serverDataType: \"double\" },\n        { name: \"last\", serverDataType: \"double\" },\n        { name: \"open\", serverDataType: \"double\" },\n        { name: \"phase\", serverDataType: \"string\" },\n        { name: \"ric\", serverDataType: \"string\" },\n        { name: \"scenario\", serverDataType: \"string\" },\n      ],\n      key: \"ric\",\n      table: { module: \"SIMUL\", table: \"prices\" },\n    },\n  };\n\nexport type ColumnState = { [key: string]: TableSchema };\n\nexport interface ColumnActionUpdate {\n  type: \"updateColumn\";\n  column: ColumnDescriptor;\n}\n\nexport type ColumnAction = ColumnActionUpdate;\n", "import { TableSchema } from \"@vuu-ui/vuu-data\";\nimport {\n  type BasketsTableName,\n  schemas as basketSchemas,\n} from \"./basket/basket-schemas\";\nimport {\n  type SimulTableName,\n  schemas as simulSchemas,\n} from \"./simul/simul-schemas\";\n\nexport type VuuTableName = BasketsTableName | SimulTableName;\nexport const schemas: Record<VuuTableName, TableSchema> = {\n  ...basketSchemas,\n  ...simulSchemas,\n};\n\nconst allSchemas: Readonly<Record<VuuTableName, Readonly<TableSchema>>> = {\n  ...basketSchemas,\n  ...simulSchemas,\n};\n\nexport const getAllSchemas = () => schemas;\n\nexport const getSchema = (tableName: VuuTableName) => {\n  if (allSchemas[tableName]) {\n    return allSchemas[tableName];\n  }\n  throw Error(`getSchema no schema for table ${tableName}`);\n};\n", "export type PartitionTest<T> = (value: T, index: number) => boolean;\n\nexport function partition<T>(\n  array: T[],\n  test: PartitionTest<T>,\n  pass: T[] = [],\n  fail: T[] = []\n): [T[], T[]] {\n  for (let i = 0, len = array.length; i < len; i++) {\n    (test(array[i], i) ? pass : fail).push(array[i]);\n  }\n  return [pass, fail];\n}\n\n// Note order of items can be different between arrays\n// If an identityProperty is not defined, item identity is used\nexport function itemsChanged<T = unknown>(\n  currentItems: T[],\n  newItems: T[],\n  identityProperty?: string\n) {\n  if (currentItems.length !== newItems.length) {\n    return true;\n  }\n  if (identityProperty === undefined) {\n    return !currentItems.every((item) => newItems.includes(item));\n  } else {\n    return currentItems.some(\n      (currentItem) =>\n        newItems.findIndex(\n          (newItem) =>\n            (newItem as { [key: string]: unknown })[identityProperty] ===\n            (currentItem as { [key: string]: unknown })[identityProperty]\n        ) === -1\n    );\n  }\n}\n\nexport function itemsOrOrderChanged<T = unknown>(\n  currentItems: T[],\n  newItems: T[],\n  identityProperty?: string\n) {\n  if (currentItems.length !== newItems.length) {\n    return true;\n  }\n  if (identityProperty === undefined) {\n    return currentItems.some((item, index) => newItems[index] !== item);\n  } else {\n    return currentItems.some(\n      (currentItem, index) =>\n        (newItems[index] as { [key: string]: unknown })[identityProperty] !==\n        (currentItem as { [key: string]: unknown })[identityProperty]\n    );\n  }\n}\n\nexport const moveItemDeprecated = <T = unknown>(\n  items: T[],\n  item: T,\n  moveTo: number\n): T[] => {\n  const fromIndex = items.indexOf(item);\n  if (fromIndex === moveTo) {\n    return items;\n  }\n  const newItems = items.slice();\n  if (fromIndex === -1) {\n    throw Error(\"moveItem, item to be moved not found\");\n  }\n  newItems.splice(fromIndex, 1);\n  if (moveTo === -1) {\n    newItems.push(item);\n  } else {\n    const offset = moveTo > fromIndex ? 0 : 0;\n    newItems.splice(moveTo + offset, 0, item);\n  }\n  return newItems;\n};\n\nexport const moveItem = <T = unknown>(\n  items: T[],\n  fromIndex: number,\n  toIndex: number\n): T[] => {\n  if (fromIndex === toIndex) {\n    return items;\n  } else {\n    const newItems = items.slice();\n    const [item] = newItems.splice(fromIndex, 1);\n    if (toIndex === -1) {\n      return newItems.concat(item);\n    } else {\n      const offset = toIndex > fromIndex ? 0 : 0;\n      newItems.splice(toIndex + offset, 0, item);\n      return newItems;\n    }\n  }\n};\n\nexport const getAddedItems = <T>(values: undefined | T[], newValues: T[]) => {\n  const isNew = (v: T) => !values?.includes(v);\n  if (values === undefined) {\n    return newValues;\n  } else if (newValues.some(isNew)) {\n    return newValues.filter(isNew);\n  } else {\n    return [] as T[];\n  }\n};\n\nexport const getMissingItems = <T, I>(\n  sourceItems: T[],\n  items: I[],\n  identity: (s: T) => I\n) =>\n  items.filter((i) => sourceItems.findIndex((s) => identity(s) === i) === -1);\n", "//Note these are duplicated in vuu-filter, those should probably be removed.\n\nimport { RuntimeColumnDescriptor } from \"@vuu-ui/vuu-table-types\";\nimport {\n  AndFilter,\n  Filter,\n  FilterClauseOp,\n  FilterWithPartialClause,\n  MultiClauseFilter,\n  MultiValueFilterClause,\n  OrFilter,\n  SingleValueFilterClause,\n  SingleValueFilterClauseOp,\n} from \"@vuu-ui/vuu-filter-types\";\n\nconst singleValueFilterOps = new Set<SingleValueFilterClauseOp>([\n  \"=\",\n  \"!=\",\n  \">\",\n  \">=\",\n  \"<\",\n  \"<=\",\n  \"starts\",\n  \"ends\",\n]);\n\nexport const isValidFilterClauseOp = (op?: string): op is FilterClauseOp =>\n  op === \"in\" || singleValueFilterOps.has(op as SingleValueFilterClauseOp);\n\nexport const isNamedFilter = (f?: Filter) =>\n  f !== undefined && f.name !== undefined;\n\n// ... with type constraints\nexport const isSingleValueFilter = (\n  f?: Partial<Filter>\n): f is SingleValueFilterClause =>\n  f !== undefined &&\n  singleValueFilterOps.has(f.op as SingleValueFilterClauseOp);\n\nexport const isFilterClause = (\n  f?: Partial<Filter>\n): f is SingleValueFilterClause | MultiValueFilterClause =>\n  f !== undefined && (isSingleValueFilter(f) || isMultiValueFilter(f));\n\nexport const isMultiValueFilter = (\n  f?: Partial<Filter>\n): f is MultiValueFilterClause => f !== undefined && f.op === \"in\";\n\nexport const isInFilter = (f: Partial<Filter>): f is MultiValueFilterClause =>\n  f.op === \"in\";\nexport const isAndFilter = (f: Partial<Filter>): f is AndFilter =>\n  f.op === \"and\";\nexport const isOrFilter = (f: Partial<Filter>): f is OrFilter => f.op === \"or\";\n\nexport const isCompleteFilter = (filter: Partial<Filter>): filter is Filter =>\n  isSingleValueFilter(filter) &&\n  filter.column !== undefined &&\n  filter.op !== undefined &&\n  filter.value !== undefined;\n\nexport function isMultiClauseFilter(\n  f?: Partial<Filter> | FilterWithPartialClause\n): f is MultiClauseFilter {\n  return f !== undefined && (f.op === \"and\" || f.op === \"or\");\n}\n\nexport const filterValue = (value: string | number | boolean) =>\n  typeof value === \"string\" ? `\"${value}\"` : value;\n\nexport const quotedStrings = (value: string | number | boolean) =>\n  typeof value === \"string\" ? `\"${value}\"` : value;\n\nexport const filterAsQuery = (f: Filter): string => {\n  if (isMultiClauseFilter(f)) {\n    return f.filters.map((filter) => filterAsQuery(filter)).join(` ${f.op} `);\n  } else if (isMultiValueFilter(f)) {\n    return `${f.column} ${f.op} [${f.values.map(quotedStrings).join(\",\")}]`;\n  } else {\n    return `${f.column} ${f.op} ${filterValue(f.value)}`;\n  }\n};\n\nexport const removeColumnFromFilter = (\n  column: RuntimeColumnDescriptor,\n  filter: Filter\n): [Filter | undefined, string] => {\n  if (isMultiClauseFilter(filter)) {\n    const [clause1, clause2] = filter.filters;\n    if (clause1.column === column.name) {\n      return [clause2, filterAsQuery(clause2)];\n    }\n    if (clause2.column === column.name) {\n      return [clause1, filterAsQuery(clause1)];\n    }\n  }\n  return [undefined, \"\"];\n};\n", "import type { SchemaColumn, TableSchema } from \"@vuu-ui/vuu-data\";\nimport type { DataSourceFilter, DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport type {\n  ColumnAlignment,\n  ColumnDescriptor,\n  ColumnType,\n  ColumnTypeDescriptor,\n  ColumnTypeRendering,\n  ColumnTypeWithValidationRules,\n  GroupColumnDescriptor,\n  RuntimeColumnDescriptor,\n  MappedValueTypeRenderer,\n  PinLocation,\n  TableHeading,\n  TableHeadings,\n  ColumnTypeFormatting,\n  LookupRenderer,\n  ValueListRenderer,\n  DateTimeColumnTypeSimple,\n} from \"@vuu-ui/vuu-table-types\";\nimport type { Filter, MultiClauseFilter } from \"@vuu-ui/vuu-filter-types\";\nimport type {\n  VuuAggregation,\n  VuuAggType,\n  VuuColumnDataType,\n  VuuDataRow,\n  VuuGroupBy,\n  VuuRowRecord,\n  VuuSort,\n} from \"@vuu-ui/vuu-protocol-types\";\nimport { DefaultColumnConfiguration } from \"@vuu-ui/vuu-shell\";\nimport type { CSSProperties } from \"react\";\nimport { moveItem } from \"./array-utils\";\nimport { isFilterClause, isMultiClauseFilter } from \"./filter-utils\";\n\n/**\n * ColumnMap provides a lookup of the index position of a data item within a row\n * by column name.\n */\nexport interface ColumnMap {\n  [columnName: string]: number;\n}\n\nconst SORT_ASC = \"asc\";\nconst NO_HEADINGS: TableHeadings = [];\n\nexport type SortCriteriaItem = string | [string, \"asc\"]; // TODO where is 'desc'?\n\nexport const AggregationType: { [key: string]: VuuAggType } = {\n  Average: 2,\n  Count: 3,\n  Distinct: 6,\n  Sum: 1,\n  High: 4,\n  Low: 5,\n};\n\nexport function mapSortCriteria(\n  sortCriteria: SortCriteriaItem[],\n  columnMap: ColumnMap,\n  metadataOffset = 0\n): [number, \"asc\"][] {\n  return sortCriteria.map((s) => {\n    if (typeof s === \"string\") {\n      return [columnMap[s] + metadataOffset, \"asc\"];\n    } else if (Array.isArray(s)) {\n      const [columnName, sortDir] = s;\n      return [columnMap[columnName] + metadataOffset, sortDir || SORT_ASC];\n    } else {\n      throw Error(\"columnUtils.mapSortCriteria invalid input\");\n    }\n  });\n}\n\nconst numericTypes = [\"int\", \"long\", \"double\"];\nexport const getDefaultAlignment = (\n  serverDataType?: VuuColumnDataType\n): ColumnAlignment =>\n  serverDataType === undefined\n    ? \"left\"\n    : numericTypes.includes(serverDataType)\n    ? \"right\"\n    : \"left\";\n\nexport const isValidColumnAlignment = (v: string): v is ColumnAlignment =>\n  v === \"left\" || v === \"right\";\n\nexport const isValidPinLocation = (v: string): v is PinLocation =>\n  isValidColumnAlignment(v) || v === \"floating\" || v === \"\";\n\nexport const isKeyedColumn = (\n  column: ColumnDescriptor\n): column is RuntimeColumnDescriptor => {\n  return typeof (column as RuntimeColumnDescriptor).key === \"number\";\n};\n\nexport const fromServerDataType = (\n  serverDataType: VuuColumnDataType\n): ColumnTypeSimple => {\n  switch (serverDataType) {\n    case \"double\":\n    case \"int\":\n    case \"long\":\n      return \"number\";\n    case \"boolean\":\n      return \"boolean\";\n    default:\n      return \"string\";\n  }\n};\n\nexport const isNumericColumn = ({ serverDataType, type }: ColumnDescriptor) => {\n  if (\n    serverDataType === \"int\" ||\n    serverDataType === \"long\" ||\n    serverDataType === \"double\"\n  ) {\n    return true;\n  }\n  if (typeof type === \"string\") {\n    return type === \"number\";\n  }\n  if (typeof type?.name === \"string\") {\n    return type?.name === \"number\";\n  }\n\n  return false;\n};\n\ntype DateTimeColumnType =\n  | DateTimeColumnTypeSimple\n  | (Omit<ColumnTypeDescriptor, \"name\"> & { name: DateTimeColumnTypeSimple });\n\nexport type DateTimeColumnDescriptor = Omit<ColumnDescriptor, \"type\"> & {\n  type: DateTimeColumnType;\n};\n\nexport const isDateColumn = ({ type }: ColumnDescriptor) =>\n  (isTypeDescriptor(type) ? type.name : type) === \"date\";\nexport const isTimeColumn = ({ type }: ColumnDescriptor) =>\n  (isTypeDescriptor(type) ? type.name : type) === \"time\";\nexport const isDateTimeColumn = (\n  column: ColumnDescriptor\n): column is DateTimeColumnDescriptor =>\n  isDateColumn(column) || isTimeColumn(column);\n\nexport const isPinned = (column: ColumnDescriptor) =>\n  typeof column.pin === \"string\";\n\nexport const hasHeadings = (column: ColumnDescriptor) =>\n  Array.isArray(column.heading) && column.heading.length > 0;\n\nexport const isResizing = (column: RuntimeColumnDescriptor) => column.resizing;\n\nexport const isTextColumn = ({ serverDataType }: ColumnDescriptor) =>\n  serverDataType === undefined\n    ? false\n    : serverDataType === \"char\" || serverDataType === \"string\";\n\nexport const toColumnDescriptor = (name: string): ColumnDescriptor => ({\n  name,\n});\n\nexport const isSimpleColumnType = (value: unknown): value is ColumnTypeSimple =>\n  typeof value === \"string\" &&\n  [\"string\", \"number\", \"boolean\", \"json\", \"date\", \"time\", \"checkbox\"].includes(\n    value\n  );\n\nexport declare type ColumnTypeSimple =\n  | \"string\"\n  | \"number\"\n  | \"boolean\"\n  | \"json\"\n  | \"date\"\n  | \"time\"\n  | \"checkbox\";\n\n/**\n *\n */\nexport const isTypeDescriptor = (\n  type?: ColumnType\n): type is ColumnTypeDescriptor =>\n  typeof type !== \"undefined\" && typeof type !== \"string\";\n\nconst EMPTY_COLUMN_MAP = {} as const;\n\nexport const isColumnTypeRenderer = (\n  renderer?: unknown\n): renderer is ColumnTypeRendering =>\n  typeof (renderer as ColumnTypeRendering)?.name !== \"undefined\";\n\nexport const isLookupRenderer = (\n  renderer?: unknown\n): renderer is LookupRenderer =>\n  typeof (renderer as LookupRenderer)?.name !== \"undefined\" &&\n  \"lookup\" in (renderer as LookupRenderer);\n\nexport const isValueListRenderer = (\n  renderer?: unknown\n): renderer is ValueListRenderer =>\n  typeof (renderer as ValueListRenderer)?.name !== \"undefined\" &&\n  Array.isArray((renderer as ValueListRenderer).values);\n\nexport const hasValidationRules = (\n  type?: ColumnType\n): type is ColumnTypeWithValidationRules =>\n  isTypeDescriptor(type) &&\n  isColumnTypeRenderer(type.renderer) &&\n  Array.isArray(type.renderer.rules) &&\n  type.renderer.rules.length > 0;\n\nexport const isMappedValueTypeRenderer = (\n  renderer?: unknown\n): renderer is MappedValueTypeRenderer =>\n  renderer !== undefined &&\n  typeof (renderer as MappedValueTypeRenderer)?.map !== \"undefined\";\n\nexport function buildColumnMap(\n  columns?: (RuntimeColumnDescriptor | SchemaColumn | string)[]\n): ColumnMap {\n  const start = metadataKeys.count;\n  if (columns) {\n    return columns.reduce((map, column, i) => {\n      if (typeof column === \"string\") {\n        map[column] = start + i;\n      } else if (isKeyedColumn(column)) {\n        map[column.name] = column.key;\n      } else {\n        map[column.name] = start + i;\n      }\n      return map;\n    }, {} as ColumnMap);\n  } else {\n    return EMPTY_COLUMN_MAP;\n  }\n}\n\nexport function projectUpdates(updates: number[]): number[] {\n  const results: number[] = [];\n  const metadataOffset = metadataKeys.count - 2;\n  for (let i = 0; i < updates.length; i += 3) {\n    results[i] = updates[i] + metadataOffset;\n    results[i + 1] = updates[i + 1];\n    results[i + 2] = updates[i + 2];\n  }\n  return results;\n}\n\nexport const metadataKeys = {\n  IDX: 0,\n  RENDER_IDX: 1,\n  IS_LEAF: 2,\n  IS_EXPANDED: 3,\n  DEPTH: 4,\n  COUNT: 5,\n  KEY: 6,\n  SELECTED: 7,\n  count: 8,\n  // TODO following only used in datamodel\n  PARENT_IDX: \"parent_idx\",\n  IDX_POINTER: \"idx_pointer\",\n  FILTER_COUNT: \"filter_count\",\n  NEXT_FILTER_IDX: \"next_filter_idx\",\n} as const;\n\n// This method mutates the passed columns array\nconst insertColumn = (\n  columns: RuntimeColumnDescriptor[],\n  column: RuntimeColumnDescriptor\n) => {\n  const { originalIdx } = column;\n  if (typeof originalIdx === \"number\") {\n    for (let i = 0; i < columns.length; i++) {\n      const { originalIdx: colIdx = -1 } = columns[i];\n      if (colIdx > originalIdx) {\n        columns.splice(i, 0, column);\n        return columns;\n      }\n    }\n  }\n  columns.push(column);\n  return columns;\n};\n\nexport const flattenColumnGroup = (\n  columns: RuntimeColumnDescriptor[]\n): RuntimeColumnDescriptor[] => {\n  if (columns[0]?.isGroup) {\n    const [groupColumn, ...nonGroupedColumns] = columns as [\n      GroupColumnDescriptor,\n      ...RuntimeColumnDescriptor[]\n    ];\n    groupColumn.columns.forEach((groupColumn) => {\n      insertColumn(nonGroupedColumns, groupColumn);\n    });\n    return nonGroupedColumns;\n  } else {\n    return columns;\n  }\n};\n\nexport function extractGroupColumn(\n  columns: RuntimeColumnDescriptor[],\n  groupBy?: VuuGroupBy,\n  confirmed = true\n): [GroupColumnDescriptor | null, RuntimeColumnDescriptor[]] {\n  if (groupBy && groupBy.length > 0) {\n    const flattenedColumns = flattenColumnGroup(columns);\n    // Note: groupedColumns will be in column order, not groupBy order\n    const [groupedColumns, rest] = flattenedColumns.reduce(\n      (result, column, i) => {\n        const [g, r] = result;\n        if (groupBy.includes(column.name)) {\n          g.push({\n            ...column,\n            originalIdx: i,\n          });\n        } else {\n          r.push(column);\n        }\n\n        return result;\n      },\n      [[], []] as [RuntimeColumnDescriptor[], RuntimeColumnDescriptor[]]\n    );\n    if (groupedColumns.length !== groupBy.length) {\n      throw Error(\n        `extractGroupColumn: no column definition found for all groupBy cols ${JSON.stringify(\n          groupBy\n        )} `\n      );\n    }\n    const groupCount = groupBy.length;\n    const groupCols: RuntimeColumnDescriptor[] = groupBy.map((name, idx) => {\n      // Keep the cols in same order defined on groupBy\n      const column = groupedColumns.find(\n        (col) => col.name === name\n      ) as RuntimeColumnDescriptor;\n      return {\n        ...column,\n        groupLevel: groupCount - idx,\n      };\n    });\n\n    const groupCol = {\n      key: -1,\n      name: \"group-col\",\n      heading: [\"group-col\"],\n      isGroup: true,\n      columns: groupCols,\n      groupConfirmed: confirmed,\n      width: groupCols.map((c) => c.width).reduce((a, b) => a + b) + 100,\n    } as GroupColumnDescriptor;\n\n    return [groupCol, rest];\n  }\n  return [null, flattenColumnGroup(columns)];\n}\n\nexport const isGroupColumn = (\n  column: RuntimeColumnDescriptor\n): column is GroupColumnDescriptor => column.isGroup === true;\n\nexport const isJsonAttribute = (value: unknown) =>\n  typeof value === \"string\" && value.endsWith(\"+\");\n\nexport const isJsonGroup = (column: RuntimeColumnDescriptor, row: VuuDataRow) =>\n  (column.type as ColumnTypeDescriptor)?.name === \"json\" &&\n  isJsonAttribute(row[column.key]);\n\nexport const isJsonColumn = (column: RuntimeColumnDescriptor) =>\n  (column.type as ColumnTypeDescriptor)?.name === \"json\";\n\nexport const sortPinnedColumns = (\n  columns: RuntimeColumnDescriptor[]\n): RuntimeColumnDescriptor[] => {\n  const leftPinnedColumns: RuntimeColumnDescriptor[] = [];\n  const rightPinnedColumns: RuntimeColumnDescriptor[] = [];\n  const restColumns: RuntimeColumnDescriptor[] = [];\n  // let pinnedWidthLeft = 0;\n  let pinnedWidthLeft = 4;\n  for (const column of columns) {\n    // prettier-ignore\n    switch(column.pin){\n      case \"left\": {\n        leftPinnedColumns.push({\n          ...column,\n          endPin: undefined,\n          pinnedOffset: pinnedWidthLeft\n        });\n        pinnedWidthLeft += column.width;\n      }\n      break;\n    // store right pinned columns initially in reverse order\n      case \"right\": rightPinnedColumns.unshift(column); break;\n      default: restColumns.push(column)\n    }\n  }\n\n  if (leftPinnedColumns.length) {\n    leftPinnedColumns.push({\n      ...(leftPinnedColumns.pop() as RuntimeColumnDescriptor),\n      endPin: true,\n    });\n  }\n\n  const allColumns = leftPinnedColumns.length\n    ? leftPinnedColumns.concat(restColumns)\n    : restColumns;\n\n  if (rightPinnedColumns.length) {\n    const measuredRightPinnedColumns: RuntimeColumnDescriptor[] = [];\n    let pinnedWidthRight = 0;\n    for (const column of rightPinnedColumns) {\n      measuredRightPinnedColumns.unshift({\n        ...column,\n        pinnedOffset: pinnedWidthRight,\n      });\n      pinnedWidthRight += column.width;\n    }\n    measuredRightPinnedColumns[0].endPin = true;\n    return allColumns.concat(measuredRightPinnedColumns);\n  } else {\n    return allColumns;\n  }\n};\n\nexport const getTableHeadings = (\n  columns: RuntimeColumnDescriptor[]\n): TableHeadings => {\n  if (columns.some(hasHeadings)) {\n    const maxHeadingDepth = columns.reduce<number>(\n      (max, { heading }) => Math.max(max, heading?.length ?? 0),\n      0\n    );\n\n    let heading: TableHeading | undefined = undefined;\n    const tableHeadings: TableHeadings = [];\n    let tableHeadingsRow: TableHeading[];\n    for (let level = 0; level < maxHeadingDepth; level++) {\n      tableHeadingsRow = [];\n      columns.forEach(({ heading: columnHeading = NO_HEADINGS, width }) => {\n        const label = columnHeading[level] ?? \"\";\n        if (heading && heading.label === label) {\n          heading.width += width;\n        } else {\n          heading = { label, width } as TableHeading;\n          tableHeadingsRow.push(heading);\n        }\n      });\n      tableHeadings.push(tableHeadingsRow);\n    }\n\n    return tableHeadings;\n  }\n  return NO_HEADINGS;\n};\n\nexport const getColumnStyle = ({\n  pin,\n  pinnedOffset = pin === \"left\" ? 0 : 4,\n  width,\n}: RuntimeColumnDescriptor) =>\n  pin === \"left\"\n    ? ({\n        left: pinnedOffset,\n        width,\n        \"--pin-width\": `${pinnedOffset + width - 3}px`,\n      } as CSSProperties)\n    : pin === \"right\"\n    ? ({\n        right: pinnedOffset,\n        width,\n        \"--pin-width\": `${pinnedOffset + width}px`,\n      } as CSSProperties)\n    : { width };\n\nexport const setAggregations = (\n  aggregations: VuuAggregation[],\n  column: RuntimeColumnDescriptor,\n  aggType: VuuAggType\n) => {\n  return aggregations\n    .filter((agg) => agg.column !== column.name)\n    .concat({ column: column.name, aggType });\n};\n\nexport const extractFilterForColumn = (\n  filter: Filter | undefined,\n  columnName: string\n) => {\n  if (isMultiClauseFilter(filter)) {\n    return collectFiltersForColumn(filter, columnName);\n  }\n  if (isFilterClause(filter)) {\n    return filter.column === columnName ? filter : undefined;\n  }\n  return undefined;\n};\n\nconst collectFiltersForColumn = (\n  filter: MultiClauseFilter,\n  columnName: string\n) => {\n  const { filters, op } = filter;\n  const results: Filter[] = [];\n  filters.forEach((filter) => {\n    const ffc = extractFilterForColumn(filter, columnName);\n    if (ffc) {\n      results.push(ffc);\n    }\n  });\n  if (results.length === 0) {\n    return undefined;\n  } else if (results.length === 1) {\n    return results[0];\n  }\n  return {\n    op,\n    filters: results,\n  };\n};\n\nexport const applyGroupByToColumns = (\n  columns: RuntimeColumnDescriptor[],\n  groupBy: VuuGroupBy,\n  confirmed = true\n) => {\n  if (groupBy.length) {\n    const [groupColumn, nonGroupedColumns] = extractGroupColumn(\n      columns,\n      groupBy,\n      confirmed\n    );\n    if (groupColumn) {\n      return [groupColumn as RuntimeColumnDescriptor].concat(nonGroupedColumns);\n    }\n  } else if (columns[0]?.isGroup) {\n    return flattenColumnGroup(columns);\n  }\n  return columns;\n};\n\nexport const applySortToColumns = (\n  colunms: RuntimeColumnDescriptor[],\n  sort: VuuSort\n) =>\n  colunms.map((column) => {\n    const sorted = getSortType(column, sort);\n    if (sorted !== undefined) {\n      return {\n        ...column,\n        sorted,\n      };\n    } else if (column.sorted) {\n      return {\n        ...column,\n        sorted: undefined,\n      };\n    } else {\n      return column;\n    }\n  });\n\nexport const applyFilterToColumns = (\n  columns: RuntimeColumnDescriptor[],\n  { filterStruct }: DataSourceFilter\n) =>\n  columns.map((column) => {\n    // TODO this gives us a dependency on vuu-filters\n    const filter = extractFilterForColumn(filterStruct, column.name);\n    if (filter !== undefined) {\n      return {\n        ...column,\n        filter,\n      };\n    } else if (column.filter) {\n      return {\n        ...column,\n        filter: undefined,\n      };\n    } else {\n      return column;\n    }\n  });\n\nexport const isFilteredColumn = (column: RuntimeColumnDescriptor) =>\n  column.filter !== undefined;\n\nexport const stripFilterFromColumns = (columns: RuntimeColumnDescriptor[]) =>\n  columns.map((col) => {\n    const { filter, ...rest } = col;\n    return filter ? rest : col;\n  });\n\nconst getSortType = (column: ColumnDescriptor, { sortDefs }: VuuSort) => {\n  const sortDef = sortDefs.find((sortCol) => sortCol.column === column.name);\n  if (sortDef) {\n    return sortDefs.length > 1\n      ? (sortDefs.indexOf(sortDef) + 1) * (sortDef.sortType === \"A\" ? 1 : -1)\n      : sortDef.sortType;\n  }\n};\n\n// Calculated columns have the formal 'name:datatype:expression'\nexport const getColumnName = (name: string) => {\n  const pos = name.indexOf(\":\");\n  if (pos === -1) {\n    return name;\n  } else {\n    return name.slice(0, pos);\n  }\n};\n\nexport const getColumnLabel = (column: ColumnDescriptor) => {\n  if (column.label) {\n    return column.label;\n  } else if (isCalculatedColumn(column.name)) {\n    return getCalculatedColumnName(column);\n  } else {\n    return column.name;\n  }\n};\n\nexport const findColumn = (\n  columns: RuntimeColumnDescriptor[],\n  columnName: string\n): RuntimeColumnDescriptor | undefined => {\n  const column = columns.find((col) => col.name === columnName);\n  if (column) {\n    return column;\n  } else {\n    const groupColumn = columns.find(\n      (col) => col.isGroup\n    ) as GroupColumnDescriptor;\n    if (groupColumn) {\n      return findColumn(groupColumn.columns, columnName);\n    }\n  }\n};\n\nexport function updateColumn<T extends ColumnDescriptor>(\n  columns: T[],\n  column: T\n): T[];\nexport function updateColumn(\n  columns: RuntimeColumnDescriptor[],\n  column: string,\n  options: Partial<ColumnDescriptor>\n): RuntimeColumnDescriptor[];\nexport function updateColumn(\n  columns: RuntimeColumnDescriptor[],\n  column: string | RuntimeColumnDescriptor,\n  options?: Partial<ColumnDescriptor>\n) {\n  const targetColumn =\n    typeof column === \"string\"\n      ? columns.find((col) => col.name === column)\n      : column;\n  if (targetColumn) {\n    const replacementColumn = options\n      ? { ...targetColumn, ...options }\n      : targetColumn;\n    return columns.map((col) =>\n      col.name === replacementColumn.name ? replacementColumn : col\n    );\n  } else {\n    throw Error(\"column-utils.replaceColun, column not found\");\n  }\n}\n\nexport const toDataSourceColumns = (column: ColumnDescriptor) => column.name;\n\nexport const getRowRecord = (\n  row: DataSourceRow,\n  columnMap: ColumnMap\n): VuuRowRecord => {\n  return Object.entries(columnMap).reduce<VuuRowRecord>(\n    (map, [colName, key]) => {\n      map[colName] = row[key];\n      return map;\n    },\n    {}\n  );\n};\n\nexport const isDataLoading = (columns: RuntimeColumnDescriptor[]) => {\n  return isGroupColumn(columns[0]) && columns[0].groupConfirmed === false;\n};\n\nexport const getColumnsInViewport = (\n  columns: RuntimeColumnDescriptor[],\n  vpStart: number,\n  vpEnd: number\n): [RuntimeColumnDescriptor[], number] => {\n  const visibleColumns: RuntimeColumnDescriptor[] = [];\n  let preSpan = 0;\n\n  for (let offset = 0, i = 0; i < columns.length; i++) {\n    const column = columns[i];\n    // TODO we need to measure the pinned columns first\n    if (column.hidden) {\n      continue;\n    } else if (offset + column.width < vpStart) {\n      if (column.pin === \"left\") {\n        visibleColumns.push(column);\n      } else if (offset + column.width + columns[i + 1]?.width > vpStart) {\n        visibleColumns.push(column);\n      } else {\n        preSpan += column.width;\n      }\n    } else if (offset > vpEnd) {\n      visibleColumns.push(column);\n      break;\n    } else {\n      visibleColumns.push(column);\n    }\n    offset += column.width;\n  }\n\n  return [visibleColumns, preSpan];\n};\n\nexport const isNotHidden = (column: RuntimeColumnDescriptor) =>\n  column.hidden !== true;\n\nexport const visibleColumnAtIndex = (\n  columns: RuntimeColumnDescriptor[],\n  index: number\n) => {\n  if (columns.every(isNotHidden)) {\n    return columns[index];\n  } else {\n    return columns.filter(isNotHidden).at(index);\n  }\n};\n\nconst { DEPTH, IS_LEAF } = metadataKeys;\n// Get the value for a specific columns within a grouped column\nexport const getGroupValueAndOffset = (\n  columns: RuntimeColumnDescriptor[],\n  row: DataSourceRow\n): [unknown, number] => {\n  const { [DEPTH]: depth, [IS_LEAF]: isLeaf } = row;\n  // Depth can be greater tha group columns when we have just removed a column from groupby\n  // but new data has not yet been received.\n  if (isLeaf || depth > columns.length) {\n    return [null, depth === null ? 0 : Math.max(0, depth - 1)];\n  } else if (depth === 0) {\n    return [\"$root\", 0];\n  } else {\n    // offset 1 for now to allow for $root\n    const { key, valueFormatter } = columns[depth - 1];\n    const value = valueFormatter(row[key]);\n    return [value, depth - 1];\n  }\n};\n\nexport const getDefaultColumnType = (\n  serverDataType?: VuuColumnDataType\n): ColumnTypeSimple => {\n  switch (serverDataType) {\n    case \"int\":\n    case \"long\":\n    case \"double\":\n      return \"number\";\n    case \"boolean\":\n      return \"boolean\";\n    default:\n      return \"string\";\n  }\n};\n\nexport const updateColumnType = <T extends ColumnDescriptor = ColumnDescriptor>(\n  column: T,\n  formatting: ColumnTypeFormatting\n): T => {\n  const { serverDataType, type = getDefaultColumnType(serverDataType) } =\n    column;\n\n  if (typeof type === \"string\" || type === undefined) {\n    return {\n      ...column,\n      type: {\n        name: type,\n        formatting,\n      },\n    } as T;\n  } else {\n    return {\n      ...column,\n      type: {\n        ...type,\n        formatting,\n      },\n    } as T;\n  }\n};\n\nexport const updateColumnRenderProps = <\n  T extends ColumnDescriptor = ColumnDescriptor\n>(\n  column: T,\n  renderer: ColumnTypeRendering\n): T => {\n  const { serverDataType, type } = column;\n  if (type === undefined) {\n    return {\n      ...column,\n      type: {\n        name: getDefaultColumnType(serverDataType),\n        renderer,\n      },\n    };\n  } else if (isSimpleColumnType(type)) {\n    return {\n      ...column,\n      type: {\n        name: type,\n        renderer,\n      },\n    };\n  } else {\n    return {\n      ...column,\n      type: {\n        ...type,\n        // TODO do we need to preserve any existing attributes from renderer ?\n        renderer,\n      },\n    };\n  }\n};\n\nconst NO_TYPE_SETTINGS = {};\nexport const getTypeFormattingFromColumn = (\n  column: ColumnDescriptor\n): ColumnTypeFormatting => {\n  if (isTypeDescriptor(column.type)) {\n    return column.type.formatting ?? NO_TYPE_SETTINGS;\n  } else {\n    return NO_TYPE_SETTINGS;\n  }\n};\n\n/**\n *\n * return a filter predicate that will reject columns, names of which\n * are not in provided list.\n */\nexport const subscribedOnly =\n  (columnNames?: string[]) => (column: ColumnDescriptor) =>\n    columnNames?.includes(column.name);\n\nexport const addColumnToSubscribedColumns = (\n  subscribedColumns: ColumnDescriptor[],\n  availableColumns: SchemaColumn[],\n  columnName: string\n) => {\n  const byColName =\n    (n = columnName) =>\n    (column: { name: string }) =>\n      column.name === n;\n  if (subscribedColumns.findIndex(byColName()) !== -1) {\n    throw Error(\n      `column-utils, addColumnToSubscribedColumns column ${columnName} is already subscribed`\n    );\n  }\n  const indexOfAvailableColumn = availableColumns.findIndex(byColName());\n  if (indexOfAvailableColumn === -1) {\n    throw Error(\n      `column-utils, addColumnToSubscribedColumns column ${columnName} is not available`\n    );\n  }\n\n  const newColumn = {\n    ...availableColumns[indexOfAvailableColumn],\n  } as ColumnDescriptor;\n\n  // find the nearest preceding available column which is subscribed\n  let index = -1;\n  for (let i = indexOfAvailableColumn - 1; i >= 0; i--) {\n    const { name } = availableColumns[i];\n    index = subscribedColumns.findIndex(byColName(name));\n    if (index !== -1) {\n      break;\n    }\n  }\n\n  if (index === -1) {\n    return [newColumn].concat(subscribedColumns);\n  } else {\n    const results: ColumnDescriptor[] = [];\n    for (let i = 0; i < subscribedColumns.length; i++) {\n      results.push(subscribedColumns[i]);\n      if (i === index) {\n        results.push(newColumn);\n        index = Number.MAX_SAFE_INTEGER;\n      }\n    }\n    return results;\n  }\n};\n\nconst CalculatedColumnPattern = /.*:.*:.*/;\n\nexport const isCalculatedColumn = (columnName?: string) =>\n  columnName !== undefined && CalculatedColumnPattern.test(columnName);\n\nexport const getCalculatedColumnDetails = (column: ColumnDescriptor) => {\n  if (isCalculatedColumn(column.name)) {\n    return column.name.split(/:=?/);\n  } else {\n    throw Error(\n      `column-utils, getCalculatedColumnDetails column name ${column.name} is not valid calculated column`\n    );\n  }\n};\n\nexport const getCalculatedColumnName = (column: ColumnDescriptor) =>\n  getCalculatedColumnDetails(column)[0];\nexport const getCalculatedColumnType = (column: ColumnDescriptor) =>\n  getCalculatedColumnDetails(column)[1] as VuuColumnDataType;\nexport const getCalculatedColumnExpression = (column: ColumnDescriptor) =>\n  getCalculatedColumnDetails(column)[2];\n\nexport const setCalculatedColumnName = (\n  column: ColumnDescriptor,\n  name: string\n): ColumnDescriptor => {\n  const [, type, expression] = column.name.split(\":\");\n  return {\n    ...column,\n    name: `${name}:${type}:${expression}`,\n  };\n};\n\nexport const setCalculatedColumnType = (\n  column: ColumnDescriptor,\n  type: string\n): ColumnDescriptor => {\n  const [name, , expression] = column.name.split(\":\");\n  return {\n    ...column,\n    name: `${name}:${type}:${expression}`,\n  };\n};\n\n// TODO should we validate the expression here ?\nexport const setCalculatedColumnExpression = (\n  column: ColumnDescriptor,\n  expression: string\n): ColumnDescriptor => {\n  const [name, type] = column.name.split(\":\");\n  return {\n    ...column,\n    name: `${name}:${type}:=${expression}`,\n  };\n};\n\nexport const moveColumnTo = (\n  columns: ColumnDescriptor[],\n  column: ColumnDescriptor,\n  newIndex: number\n) => {\n  const index = columns.findIndex((col) => col.name === column.name);\n  return moveItem(columns, index, newIndex);\n};\n\nexport function replaceColumn<\n  C extends ColumnDescriptor = RuntimeColumnDescriptor\n>(columns: C[], column: C) {\n  return columns.map((col) => (col.name === column.name ? column : col));\n}\n\nexport const applyDefaultColumnConfig = (\n  { columns, table }: TableSchema,\n  getDefaultColumnConfig?: DefaultColumnConfiguration\n) => {\n  if (typeof getDefaultColumnConfig === \"function\") {\n    return columns.map((column) => {\n      const config = getDefaultColumnConfig(table.table, column.name);\n      if (config) {\n        return {\n          ...column,\n          ...config,\n        };\n      } else {\n        return column;\n      }\n    });\n  } else {\n    return columns;\n  }\n};\n", "export const getCookieValue = (name: string): string | number | undefined => {\n  if (globalThis.document?.cookie !== undefined) {\n    return globalThis.document.cookie\n      .split(\"; \")\n      .find((row) => row.startsWith(`${name}=`))\n      ?.split(\"=\")[1];\n  }\n};\n", "export interface VuuRange {\n  from: number;\n  to: number;\n  bufferSize?: number;\n  reset?: boolean;\n}\n\ninterface FromToRange {\n  from: number;\n  to: number;\n}\n\nexport const NULL_RANGE: VuuRange = { from: 0, to: 0 } as const;\n\nexport function getFullRange(\n  { from, to }: VuuRange,\n  bufferSize = 0,\n  rowCount: number = Number.MAX_SAFE_INTEGER\n): FromToRange {\n  if (bufferSize === 0) {\n    if (rowCount < from) {\n      return { from: 0, to: 0 };\n    } else {\n      return { from, to: Math.min(to, rowCount) };\n    }\n  } else if (from === 0) {\n    return { from, to: Math.min(to + bufferSize, rowCount) };\n  } else {\n    const rangeSize = to - from;\n    const buff = Math.round(bufferSize / 2);\n    const shortfallBefore = from - buff < 0;\n    const shortFallAfter = rowCount - (to + buff) < 0;\n\n    if (shortfallBefore && shortFallAfter) {\n      return { from: 0, to: rowCount };\n    } else if (shortfallBefore) {\n      return { from: 0, to: rangeSize + bufferSize };\n    } else if (shortFallAfter) {\n      return {\n        from: Math.max(0, rowCount - (rangeSize + bufferSize)),\n        to: rowCount,\n      };\n    } else {\n      return { from: from - buff, to: to + buff };\n    }\n  }\n}\n\nexport function resetRange({ from, to, bufferSize = 0 }: VuuRange): VuuRange {\n  return {\n    from: 0,\n    to: to - from,\n    bufferSize,\n    reset: true,\n  };\n}\n\nexport const withinRange = (value: number, { from, to }: VuuRange) =>\n  value >= from && value < to;\n\n// export const rangeOverlap = (\n//   { from: from1, to: to1 }: VuuRange,\n//   { from: from2, to: to2 }: VuuRange\n// ): VuuRange => {\n//   return from2 >= to1 || to2 < from1\n//     ? { from: 0, to: 0 }\n//     : { from: Math.max(from2, from1), to: Math.min(to2, to1) };\n// };\n\nexport const rangeNewItems = (\n  { from: from1, to: to1 }: VuuRange,\n  newRange: VuuRange\n): VuuRange => {\n  const { from: from2, to: to2 } = newRange;\n  const noOverlap = from2 >= to1 || to2 <= from1;\n  const newFullySubsumesOld = from2 < from1 && to2 > to1;\n  return noOverlap || newFullySubsumesOld\n    ? newRange\n    : to2 > to1\n    ? { from: to1, to: to2 }\n    : { from: from2, to: from1 };\n};\n\nexport class WindowRange {\n  public from: number;\n  public to: number;\n\n  constructor(from: number, to: number) {\n    this.from = from;\n    this.to = to;\n  }\n\n  public isWithin(index: number) {\n    return withinRange(index, this);\n  }\n\n  //find the overlap of this range and a new one\n  public overlap(from: number, to: number): [number, number] {\n    return from >= this.to || to < this.from\n      ? [0, 0]\n      : [Math.max(from, this.from), Math.min(to, this.to)];\n  }\n\n  public copy(): WindowRange {\n    return new WindowRange(this.from, this.to);\n  }\n}\n", "import { WindowRange } from \"./range-utils\";\nimport { metadataKeys } from \"./column-utils\";\n\nexport type DataItem = string | number | boolean;\nexport type DataRow = [\n  /** index */\n  number,\n  /** render index */\n  number,\n  /** isLeaf */\n  boolean,\n  /** isExpanded */\n  boolean,\n  /** depth  */\n  number,\n  /** child count */\n  number,\n  /** key  */\n  string,\n  /** selected */\n  number,\n  /** data values  */\n  ...DataItem[]\n];\nexport type RangeLike = { from: number; to: number };\n\nconst { KEY } = metadataKeys;\n\n// const log = (message: string) =>\n//   console.log(`%c[DataWindow] ${message}`, \"color: purple;font-weight: bold;\");\nexport class DataWindow {\n  private range: WindowRange;\n  public data: DataRow[];\n  public rowCount = 0;\n  constructor({ from, to }: RangeLike) {\n    this.range = new WindowRange(from, to);\n    //internal data is always 0 based, we add range.from to determine an offset\n    this.data = new Array(to - from);\n    // window.dataWindow = this.data;\n    // log(`constructor initial range ${from} - ${to}`);\n  }\n\n  setRowCount = (rowCount: number) => {\n    // log(`rowCount => ${rowCount}`);\n    if (rowCount < this.data.length) {\n      this.data.length = rowCount;\n    }\n    this.rowCount = rowCount;\n  };\n\n  // return true if existing row was updated\n  add(data: DataRow) {\n    const [index] = data;\n    if (this.isWithinRange(index)) {\n      const internalIndex = index - this.range.from;\n      const isUpdate = this.data[internalIndex] !== undefined;\n      this.data[internalIndex] = data;\n      return isUpdate;\n    } else {\n      return false;\n    }\n  }\n\n  getAtIndex(index: number) {\n    return this.range.isWithin(index) &&\n      this.data[index - this.range.from] != null\n      ? this.data[index - this.range.from]\n      : undefined;\n  }\n\n  getByKey(key: string) {\n    return this.data.find((row) => row[KEY] === key);\n  }\n\n  isWithinRange(index: number) {\n    return this.range.isWithin(index) && index <= this.rowCount;\n  }\n\n  setRange(from: number, to: number) {\n    // log(`setRange ${from} ${to}`);\n    if (from !== this.range.from || to !== this.range.to) {\n      const [overlapFrom, overlapTo] = this.range.overlap(from, to);\n      const newData = new Array(to - from);\n      for (let i = overlapFrom; i < overlapTo; i++) {\n        const data = this.getAtIndex(i);\n        if (data) {\n          const index = i - from;\n          newData[index] = data;\n        }\n      }\n      this.data = newData;\n      this.range.from = from;\n      this.range.to = to;\n    }\n  }\n\n  hasData(from: number, to: number) {\n    const offset = this.range.from;\n    const start = from - offset;\n    const end = Math.min(to - offset - 1, this.rowCount - 1);\n    return this.data[start] !== undefined && this.data[end] !== undefined;\n  }\n\n  getData(from: number, to: number): any[] {\n    const { from: clientFrom, to: clientTo } = this.range;\n    const startOffset = Math.max(0, from - clientFrom);\n    const endOffset = Math.min(to - clientFrom, this.rowCount ?? to);\n    return this.data.slice(startOffset, endOffset);\n  }\n}\n", "import { DatePattern, DateTimePattern, TimePattern } from \"./types\";\n\ntype DateTimeFormatConfig = {\n  locale?: string;\n  options: Intl.DateTimeFormatOptions;\n  postProcessor?: (s: string) => string;\n};\n\n// Time format config\nconst baseTimeFormatOptions: Intl.DateTimeFormatOptions = {\n  hour: \"2-digit\",\n  minute: \"2-digit\",\n  second: \"2-digit\",\n};\nconst formatConfigByTimePatterns: Record<TimePattern, DateTimeFormatConfig> = {\n  \"hh:mm:ss\": {\n    locale: \"en-GB\",\n    options: { ...baseTimeFormatOptions, hour12: false },\n  },\n  \"hh:mm:ss a\": {\n    locale: \"en-GB\",\n    options: { ...baseTimeFormatOptions, hour12: true },\n  },\n};\n\n// Date format config\nconst baseDateFormatOptions: Intl.DateTimeFormatOptions = {\n  day: \"2-digit\",\n  month: \"2-digit\",\n  year: \"numeric\",\n};\nconst formatConfigByDatePatterns: Record<DatePattern, DateTimeFormatConfig> = {\n  \"dd.mm.yyyy\": {\n    locale: \"en-GB\",\n    options: { ...baseDateFormatOptions },\n    postProcessor: (s) => s.replaceAll(\"/\", \".\"),\n  },\n  \"dd/mm/yyyy\": { locale: \"en-GB\", options: { ...baseDateFormatOptions } },\n  \"dd MMM yyyy\": {\n    locale: \"en-GB\",\n    options: { ...baseDateFormatOptions, month: \"short\" },\n  },\n  \"dd MMMM yyyy\": {\n    locale: \"en-GB\",\n    options: { ...baseDateFormatOptions, month: \"long\" },\n  },\n  \"mm/dd/yyyy\": { locale: \"en-US\", options: { ...baseDateFormatOptions } },\n  \"MMM dd, yyyy\": {\n    locale: \"en-US\",\n    options: { ...baseDateFormatOptions, month: \"short\" },\n  },\n  \"MMMM dd, yyyy\": {\n    locale: \"en-US\",\n    options: { ...baseDateFormatOptions, month: \"long\" },\n  },\n};\n\nconst formatConfigByDateTimePatterns: Record<\n  DateTimePattern,\n  DateTimeFormatConfig\n> = { ...formatConfigByDatePatterns, ...formatConfigByTimePatterns };\n\nexport function formatDate(pattern: DateTimePattern): (d: Date) => string {\n  const { locale, options, postProcessor } =\n    formatConfigByDateTimePatterns[pattern];\n  const dateTimeFormat = Intl.DateTimeFormat(locale, options);\n\n  return (d) => {\n    const dateStr = dateTimeFormat.format(d);\n    console.log({ dateStr });\n    return postProcessor ? postProcessor(dateStr) : dateStr;\n  };\n}\n", "import { getCookieValue } from \"./cookie-utils\";\n\ndeclare global {\n  const loggingSettings: loggingSettings;\n}\n\nexport interface LogFn {\n  (message?: unknown, ...optionalParams: unknown[]): void;\n}\nexport interface AssertLogFn {\n  (condition: boolean, message?: unknown, errorMessaage?: unknown): void;\n}\n\nexport interface TableLogFn {\n  (properties?: object): void;\n}\n\ntype loggingSettings = {\n  loggingLevel: LogLevel;\n};\n\nexport interface Logger {\n  warn: LogFn;\n  error: LogFn;\n  debug: LogFn;\n  info: LogFn;\n}\n\nexport type LogLevel = keyof Logger;\n\nconst logLevels = [\"error\", \"warn\", \"info\", \"debug\"];\nconst isValidLogLevel = (value: unknown): value is LogLevel =>\n  typeof value === \"string\" && logLevels.includes(value);\n\nconst DEFAULT_LOG_LEVEL: LogLevel = \"error\";\n\nexport type BuildEnv = \"production\" | \"development\";\n\nconst NO_OP = () => undefined;\n\nconst DEFAULT_DEBUG_LEVEL: LogLevel =\n  process.env.NODE_ENV === \"production\" ? \"error\" : \"info\";\n\nconst { loggingLevel = DEFAULT_DEBUG_LEVEL } = getLoggingSettings();\n// typeof loggingSettings !== \"undefined\" ? loggingSettings : {};\n// const { loggingLevel = DEFAULT_DEBUG_LEVEL } =\n//   typeof loggingSettings !== \"undefined\" ? loggingSettings : {};\n\nexport const logger = (category: string) => {\n  const debugEnabled = loggingLevel === \"debug\";\n  const infoEnabled = debugEnabled || loggingLevel === \"info\";\n  const warnEnabled = infoEnabled || loggingLevel === \"warn\";\n  const errorEnabled = warnEnabled || loggingLevel === \"error\";\n\n  const info = infoEnabled\n    ? (message: string) => console.info(`[${category}] ${message}`)\n    : NO_OP;\n  const warn = warnEnabled\n    ? (message: string) => console.warn(`[${category}] ${message}`)\n    : NO_OP;\n  const debug = debugEnabled\n    ? (message: string) => console.debug(`[${category}] ${message}`)\n    : NO_OP;\n  const error = errorEnabled\n    ? (message: string) => console.error(`[${category}] ${message}`)\n    : NO_OP;\n\n  if (process.env.NODE_ENV === \"production\") {\n    return {\n      errorEnabled,\n      error,\n    };\n  } else {\n    return {\n      debugEnabled,\n      infoEnabled,\n      warnEnabled,\n      errorEnabled,\n      info,\n      warn,\n      debug,\n      error,\n    };\n  }\n};\n\nfunction getLoggingSettings() {\n  if (typeof loggingSettings !== \"undefined\") {\n    return loggingSettings;\n  } else {\n    return {\n      loggingLevel: getLoggingLevelFromCookie(),\n    };\n  }\n}\n\nfunction getLoggingLevelFromCookie(): LogLevel {\n  const value = getCookieValue(\"vuu-logging-level\");\n  if (isValidLogLevel(value)) {\n    return value;\n  } else {\n    return DEFAULT_LOG_LEVEL;\n  }\n}\n\nexport const getLoggingConfigForWorker = () => {\n  return `const loggingSettings = { loggingLevel: \"${getLoggingLevelFromCookie()}\"};`;\n};\n", "import { VuuRange } from \"@vuu-ui/vuu-protocol-types\";\nimport { logger } from \"./logging-utils\";\n\nconst { debug, debugEnabled } = logger(\"range-monitor\");\n\nexport class RangeMonitor {\n  public range: VuuRange = { from: 0, to: 0 };\n  public timestamp = 0;\n\n  constructor(private source: string) {}\n\n  isSet() {\n    return this.timestamp !== 0;\n  }\n  set({ from, to }: VuuRange) {\n    const { timestamp } = this;\n    this.range.from = from;\n    this.range.to = to;\n    this.timestamp = performance.now();\n    if (timestamp) {\n      debugEnabled &&\n        debug(\n          `<${this.source}> [${from}-${to}], ${(\n            this.timestamp - timestamp\n          ).toFixed(0)} ms elapsed`\n        );\n    } else {\n      return 0;\n    }\n  }\n}\n", "type Listener = (...args: any[]) => void;\nexport type EmittedEvents = Record<string, Listener>;\n\nfunction isArrayOfListeners(\n  listeners: EventListener | EventListener[]\n): listeners is EventListener[] {\n  return Array.isArray(listeners);\n}\n\nfunction isOnlyListener(\n  listeners: EventListener | EventListener[]\n): listeners is EventListener {\n  return !Array.isArray(listeners);\n}\n\nexport class EventEmitter<Events extends EmittedEvents> {\n  #events: Map<keyof Events, Listener | Listener[]> = new Map();\n\n  addListener<E extends keyof Events>(event: E, listener: Events[E]) {\n    const listeners = this.#events.get(event);\n\n    if (!listeners) {\n      this.#events.set(event, listener);\n    } else if (isArrayOfListeners(listeners)) {\n      listeners.push(listener);\n    } else if (isOnlyListener(listeners)) {\n      this.#events.set(event, [listeners, listener]);\n    }\n  }\n\n  removeListener<E extends keyof Events>(event: E, listener: Events[E]) {\n    if (!this.#events.has(event)) {\n      return;\n    }\n\n    const listenerOrListeners = this.#events.get(event);\n    let position = -1;\n\n    if (listenerOrListeners === listener) {\n      this.#events.delete(event);\n    } else if (Array.isArray(listenerOrListeners)) {\n      for (let i = length; i-- > 0; ) {\n        if (listenerOrListeners[i] === listener) {\n          position = i;\n          break;\n        }\n      }\n\n      if (position < 0) {\n        return;\n      }\n\n      if (listenerOrListeners.length === 1) {\n        listenerOrListeners.length = 0;\n        this.#events.delete(event);\n      } else {\n        listenerOrListeners.splice(position, 1);\n      }\n    }\n  }\n\n  removeAllListeners<E extends keyof Events>(event?: E) {\n    if (event && this.#events.has(event)) {\n      this.#events.delete(event);\n    } else if (event === undefined) {\n      this.#events.clear();\n    }\n  }\n\n  emit<E extends keyof Events>(event: E, ...args: Parameters<Events[E]>) {\n    if (this.#events) {\n      const handler = this.#events.get(event);\n      if (handler) {\n        this.invokeHandler(handler, args);\n      }\n    }\n  }\n\n  once<E extends keyof Events>(event: E, listener: Events[E]) {\n    const handler = ((...args) => {\n      this.removeListener(event, handler);\n      listener(...args);\n    }) as Events[E];\n\n    this.on(event, handler);\n  }\n\n  on<E extends keyof Events>(event: E, listener: Events[E]) {\n    this.addListener(event, listener);\n  }\n\n  hasListener<E extends keyof Events>(event: E, listener: Events[E]) {\n    const listeners = this.#events.get(event);\n    if (Array.isArray(listeners)) {\n      return listeners.includes(listener);\n    } else {\n      return listeners === listener;\n    }\n  }\n\n  private invokeHandler(handler: Listener | Array<Listener>, args: unknown[]) {\n    if (isArrayOfListeners(handler)) {\n      handler.slice().forEach((listener) => this.invokeHandler(listener, args));\n    } else {\n      switch (args.length) {\n        case 0:\n          handler();\n          break;\n        case 1:\n          handler(args[0]);\n          break;\n        case 2:\n          handler(args[0], args[1]);\n          break;\n        // slower\n        default:\n          handler.call(null, ...args);\n      }\n    }\n  }\n}\n", "const PUNCTUATION_STR = String.fromCharCode(8200);\nconst DIGIT_STR = String.fromCharCode(8199);\nconst DECIMALS_AUTO = -1;\n\ntype PadMap = {\n  DIGIT: string;\n  TWO_DIGITS: string;\n  THREE_DIGITS: string;\n  FULL_PADDING: [null, string, string, string, string];\n};\n\nconst Space: PadMap = {\n  DIGIT: DIGIT_STR,\n  TWO_DIGITS: DIGIT_STR + DIGIT_STR,\n  THREE_DIGITS: DIGIT_STR + DIGIT_STR + DIGIT_STR,\n  FULL_PADDING: [\n    null,\n    PUNCTUATION_STR + DIGIT_STR,\n    PUNCTUATION_STR + DIGIT_STR + DIGIT_STR,\n    PUNCTUATION_STR + DIGIT_STR + DIGIT_STR + DIGIT_STR,\n    PUNCTUATION_STR + DIGIT_STR + DIGIT_STR + DIGIT_STR + DIGIT_STR,\n  ],\n};\n\nconst Zero: PadMap = {\n  DIGIT: \"0\",\n  TWO_DIGITS: \"00\",\n  THREE_DIGITS: \"000\",\n  FULL_PADDING: [null, \"0\", \"00\", \"000\", \"0000\"],\n};\n\nfunction padLeft(value: string, maxLength = 6) {\n  return (LEADING_FILL + value).slice(-maxLength);\n}\n\nconst LEADING_FILL =\n  DIGIT_STR +\n  DIGIT_STR +\n  DIGIT_STR +\n  DIGIT_STR +\n  DIGIT_STR +\n  DIGIT_STR +\n  DIGIT_STR +\n  DIGIT_STR +\n  DIGIT_STR;\n\nconst Align = {\n  Right: \"right\",\n  Center: \"center\",\n  Left: \"left\",\n};\n\nfunction pad(n: string, dp: number, Pad: PadMap): string {\n  let len = n.length;\n  const diff = dp - len;\n\n  if (diff > 0) {\n    if (diff === 1) {\n      n = n + Pad.DIGIT;\n    } else if (diff === 2) {\n      n = n + Pad.TWO_DIGITS;\n    } else if (diff === 3) {\n      n = n + Pad.THREE_DIGITS;\n    }\n  } else {\n    if (diff < 0) {\n      n = n.slice(0, dp);\n      len = dp;\n    }\n\n    if (Pad === Space && n.charAt(len - 1) === \"0\") {\n      n = n.replace(/0+$/, \"\");\n      return pad(n, dp, Pad);\n    }\n  }\n  return n;\n}\n\nexport function roundDecimal(\n  value?: number,\n  align = Align.Right,\n  decimals = 4,\n  zeroPad?: boolean,\n  alignOnDecimals?: boolean\n) {\n  if (value === undefined || typeof value !== \"number\" || isNaN(value)) {\n    return \"\";\n  }\n  let integral, fraction, Pad;\n\n  const [part1, part2 = \"\"] = value.toString().split(\".\");\n  const actualDecimals = part2.length;\n\n  integral = parseFloat(part1).toLocaleString();\n\n  if (align === Align.Left && alignOnDecimals) {\n    integral = padLeft(integral);\n  }\n\n  if (decimals === DECIMALS_AUTO || actualDecimals === decimals) {\n    fraction = part2;\n  } else if (actualDecimals > decimals) {\n    fraction = parseFloat(\"0.\" + part2)\n      .toFixed(decimals)\n      .slice(2);\n  } else {\n    /* eslint-disable no-cond-assign */\n    if (\n      (Pad = zeroPad\n        ? Zero\n        : alignOnDecimals && align !== Align.Left\n        ? Space\n        : null)\n    ) {\n      if (actualDecimals === 0) {\n        fraction = Pad.FULL_PADDING[decimals];\n      } else {\n        fraction = pad(part2, decimals, Pad);\n      }\n    } else {\n      fraction = part2;\n    }\n  }\n\n  return integral + (fraction ? \".\" + fraction : \"\");\n}\n", "import { DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport {\n  ColumnDescriptor,\n  ColumnTypeDescriptor,\n} from \"@vuu-ui/vuu-table-types\";\nimport { VuuRowDataItemType } from \"@vuu-ui/vuu-protocol-types\";\nimport { metadataKeys } from \"./column-utils\";\n\nconst { COUNT } = metadataKeys;\n\nexport type JsonData =\n  | {\n      [key: string]: unknown;\n    }\n  | JsonData[];\n\ntype Index = { value: number };\n\ntype CellValue = {\n  attribute: string;\n  attributeValue: JsonData | VuuRowDataItemType | null;\n  type: \"json\" | \"number\" | \"string\" | \"boolean\";\n};\n\nconst isJsonData = (value: unknown): value is JsonData =>\n  typeof value === \"object\" && value !== null;\n\nconst vuuRowDataItemTypes = [\"boolean\", \"number\", \"string\"];\nconst isVuuRowDataItem = (value: unknown): value is VuuRowDataItemType =>\n  vuuRowDataItemTypes.includes(typeof value);\nconst typeofVuuDataItem = (value: VuuRowDataItemType) =>\n  typeof value === \"boolean\"\n    ? \"boolean\"\n    : typeof value === \"number\"\n    ? \"number\"\n    : \"string\";\n\nconst getCellValue = (\n  attribute: string,\n  attributeValue: unknown\n): CellValue => {\n  if (isJsonData(attributeValue)) {\n    return { attribute: `${attribute}+`, attributeValue: \"\", type: \"json\" };\n  } else if (attributeValue === undefined) {\n    return {\n      attribute,\n      attributeValue: \"undefined\",\n      type: \"string\",\n    };\n  } else if (isVuuRowDataItem(attributeValue)) {\n    return {\n      attribute,\n      attributeValue,\n      type: typeofVuuDataItem(attributeValue),\n    };\n  } else {\n    throw Error(`unsupported type ${typeof attributeValue} in JSON`);\n  }\n};\n\nconst jsonColumnType: ColumnTypeDescriptor = {\n  name: \"json\",\n  renderer: {\n    name: \"json\",\n  },\n};\n\nexport const jsonToDataSourceRows = (\n  json: JsonData\n): [ColumnDescriptor[], DataSourceRow[]] => {\n  const cols: ColumnDescriptor[] = [];\n\n  cols.push(\n    {\n      name: \"col 1\",\n      type: jsonColumnType,\n    },\n    {\n      name: \"col 2\",\n      type: jsonColumnType,\n    }\n  );\n\n  const rows: DataSourceRow[] = [];\n\n  addChildValues(rows, json, cols);\n  return [cols, rows];\n};\n\nconst addChildValues = (\n  rows: DataSourceRow[],\n  json: JsonData,\n  cols: ColumnDescriptor[],\n  index: Index = { value: 0 },\n  keyBase = \"$root\",\n  depth = 0\n): [number, number] => {\n  let leafCount = 0;\n  let rowCount = 0;\n  if (depth === cols.length - 1) {\n    cols.push({\n      name: `col ${cols.length + 1}`,\n      hidden: true,\n      type: jsonColumnType,\n    });\n  }\n  const columnEntries = Object.entries(json);\n  for (let i = 0; i < columnEntries.length; i++, index.value += 1) {\n    const [key, value] = columnEntries[i];\n    const { attribute, attributeValue, type } = getCellValue(key, value);\n    const isLeaf = type !== \"json\";\n    const blanks = Array(depth).fill(\"\");\n    const fullKey = `${keyBase}|${key}`;\n    // prettier-ignore\n    const row = [index.value, index.value, isLeaf,false,depth,0,fullKey,0, ...blanks, attribute, attributeValue ] as DataSourceRow\n    rows.push(row);\n    rowCount += 1;\n\n    if (isJsonData(value)) {\n      const [nestedLeafCount, nestedRowCount] = addChildValues(\n        rows,\n        value,\n        cols,\n        { value: index.value + 1 },\n        fullKey,\n        depth + 1\n      );\n      row[COUNT] = nestedLeafCount;\n      leafCount += nestedLeafCount;\n      rowCount += nestedRowCount;\n      index.value += nestedRowCount;\n    } else {\n      leafCount += 1;\n    }\n  }\n\n  return [leafCount, rowCount];\n};\n", "import { VuuRange } from \"@vuu-ui/vuu-protocol-types\";\n\nexport class KeySet {\n  private keys: Map<number, number>;\n  private free: number[];\n  private nextKeyValue: number;\n\n  constructor(range: VuuRange) {\n    this.keys = new Map<number, number>();\n    this.free = [];\n    this.nextKeyValue = 0;\n    this.reset(range);\n  }\n\n  public next(): number {\n    if (this.free.length > 0) {\n      return this.free.pop() as number;\n    } else {\n      return this.nextKeyValue++;\n    }\n  }\n\n  public reset({ from, to }: VuuRange) {\n    this.keys.forEach((keyValue, rowIndex) => {\n      if (rowIndex < from || rowIndex >= to) {\n        this.free.push(keyValue);\n        this.keys.delete(rowIndex);\n      }\n    });\n\n    const size = to - from;\n    if (this.keys.size + this.free.length > size) {\n      this.free.length = Math.max(0, size - this.keys.size);\n    }\n\n    for (let rowIndex = from; rowIndex < to; rowIndex++) {\n      if (!this.keys.has(rowIndex)) {\n        const nextKeyValue = this.next();\n        this.keys.set(rowIndex, nextKeyValue);\n      }\n    }\n\n    if (this.nextKeyValue > this.keys.size) {\n      this.nextKeyValue = this.keys.size;\n    }\n  }\n\n  public keyFor(rowIndex: number): number {\n    const key = this.keys.get(rowIndex);\n    if (key === undefined) {\n      console.log(`key not found\n        keys: ${this.toDebugString()}\n        free : ${this.free.join(\",\")}  \n      `);\n      throw Error(`KeySet, no key found for rowIndex ${rowIndex}`);\n    }\n    return key;\n  }\n\n  public toDebugString() {\n    return Array.from(this.keys.entries())\n      .map<string>((k, v) => `${k}=>${v}`)\n      .join(\",\");\n  }\n}\n", "// This is the index.browser.js file from nanoid\n// couldn't get original code to work as npm import without crypro warnings -\n// seemed to be picking up node version, not browser version\n\nexport const uuid = (size: number = 21): string => {\n  let id: string = '';\n  let bytes = crypto.getRandomValues(new Uint8Array(size));\n\n  // A compact alternative for `for (var i = 0; i < step; i++)`.\n  while (size--) {\n    // It is incorrect to use bytes exceeding the alphabet size.\n    // The following mask reduces the random byte in the 0-255 value\n    // range to the 0-63 value range. Therefore, adding hacks, such\n    // as empty string fallback or magic numbers, is unneccessary because\n    // the bitmask trims bytes down to the alphabet size.\n    let byte = bytes[size] & 63;\n    if (byte < 36) {\n      // `0-9a-z`\n      id += byte.toString(36);\n    } else if (byte < 62) {\n      // `A-Z`\n      id += (byte - 26).toString(36).toUpperCase();\n    } else if (byte < 63) {\n      id += '_';\n    } else {\n      id += '-';\n    }\n  }\n  return id;\n};\n", "type VoidFunction = (...args: any) => void;\nexport type PerfFunction<T extends VoidFunction> = (\n  ...args: Parameters<T>\n) => void;\n\nexport function debounce<T extends VoidFunction>(\n  callback: T,\n  timeInterval: number\n): PerfFunction<T> {\n  let timeout: number | undefined;\n  return (...args: unknown[]) => {\n    clearTimeout(timeout);\n    timeout = window.setTimeout(() => callback(...args), timeInterval);\n  };\n}\n\nexport function throttle<T extends VoidFunction>(\n  callback: T,\n  limit: number\n): PerfFunction<T> {\n  let wait = false;\n  let lastArgs: unknown[] | undefined = undefined;\n\n  function checkLastArgs() {\n    if (lastArgs == undefined) {\n      wait = false;\n    } else {\n      callback(...lastArgs);\n      lastArgs = undefined;\n      setTimeout(checkLastArgs, limit);\n    }\n  }\n\n  return (...args: unknown[]) => {\n    if (wait) {\n      lastArgs = args;\n    } else {\n      callback(...args);\n      wait = true;\n      setTimeout(checkLastArgs, limit);\n    }\n  };\n}\n", "import { DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport { metadataKeys } from \"@vuu-ui/vuu-utils\";\nimport { MutableRefObject } from \"react\";\n\nconst { IDX } = metadataKeys;\n\nexport type RowOffsetFunc = (\n  row: DataSourceRow,\n  pctScrollTop?: number\n) => number;\nexport type RowAtPositionFunc = (position: number) => number;\n\nexport type RowPositioning = [RowOffsetFunc, RowAtPositionFunc];\n\nexport const actualRowPositioning = (rowHeight: number): RowPositioning => [\n  (row) => row[IDX] * rowHeight,\n  (position) => Math.floor(position / rowHeight),\n];\n\nexport const virtualRowPositioning = (\n  rowHeight: number,\n  additionalPixelsNeeded: number,\n  pctScrollTop: MutableRefObject<number>\n): RowPositioning => [\n  (row) => {\n    const rowOffset = pctScrollTop.current * additionalPixelsNeeded;\n    return row[IDX] * rowHeight - rowOffset;\n  },\n  (position) => {\n    const rowOffset = pctScrollTop.current * additionalPixelsNeeded;\n    const result = Math.floor((position + rowOffset) / rowHeight);\n    return result;\n  },\n];\n", "import { DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport {\n  RangeTuple,\n  Selection,\n  SelectionItem,\n  TableSelectionModel,\n} from \"@vuu-ui/vuu-table-types\";\nimport { metadataKeys } from \"./column-utils\";\n\nconst NO_SELECTION: number[] = [];\n\nconst { SELECTED } = metadataKeys;\n\nexport const RowSelected = {\n  False: 0,\n  True: 1,\n  First: 2,\n  Last: 4,\n};\n\nexport const isRowSelected = (row: DataSourceRow): boolean =>\n  (row[SELECTED] & RowSelected.True) === RowSelected.True;\nexport const isRowSelectedLast = (row?: DataSourceRow): boolean =>\n  row !== undefined && (row[SELECTED] & RowSelected.Last) === RowSelected.Last;\n\nconst inAscendingOrder = (item1: SelectionItem, item2: SelectionItem) => {\n  const n1: number = typeof item1 === \"number\" ? item1 : item1[0];\n  const n2: number = typeof item2 === \"number\" ? item2 : item2[0];\n  return n1 - n2;\n};\n\nexport const deselectItem = (\n  selectionModel: TableSelectionModel,\n  selected: Selection,\n  itemIndex: number,\n  rangeSelect: boolean,\n  keepExistingSelection = false\n): Selection => {\n  const singleSelect = selectionModel === \"single\";\n  const multiSelect =\n    selectionModel === \"extended\" || selectionModel === \"checkbox\";\n  const actsLikeSingleSelect =\n    singleSelect || (multiSelect && !keepExistingSelection && !rangeSelect);\n\n  if (actsLikeSingleSelect || (!rangeSelect && !keepExistingSelection)) {\n    return NO_SELECTION;\n  } else if (!rangeSelect && keepExistingSelection) {\n    return removeSelectedItem(selected, itemIndex);\n  }\n  return NO_SELECTION;\n};\n\nconst newSelectedFillsGapOrExtends = (\n  selection: Selection,\n  itemIndex: number\n): boolean => {\n  for (let i = 0; i < selection.length; i++) {\n    const item = selection[i];\n    if (typeof item === \"number\") {\n      if (item === itemIndex - 1) {\n        return true;\n      } else if (item > itemIndex) {\n        return false;\n      }\n    } else if (item[0] === itemIndex + 1 || item[1] === itemIndex - 1) {\n      return true;\n    } else if (item[0] > itemIndex) {\n      return false;\n    }\n  }\n  return false;\n};\n\nconst fillGapOrExtendSelection = (\n  selection: Selection,\n  itemIndex: number\n): Selection => {\n  for (let i = 0; i < selection.length; i++) {\n    const item = selection[i];\n    if (typeof item === \"number\") {\n      if (item === itemIndex - 1) {\n        const nextSelectionItem = selection[i + 1];\n        if (nextSelectionItem === itemIndex + 1) {\n          const newRange: SelectionItem = [item, nextSelectionItem];\n          return selection\n            .slice(0, i)\n            .concat([newRange])\n            .concat(selection.slice(i + 2));\n        } else {\n          const newRange: SelectionItem = [item, itemIndex];\n          return selection\n            .slice(0, i)\n            .concat([newRange])\n            .concat(selection.slice(i + 1));\n        }\n      } else if (item > itemIndex) {\n        break;\n      }\n    } else if (item[0] === itemIndex + 1) {\n      const newRange: SelectionItem = [itemIndex, item[1]];\n      return selection\n        .slice(0, i)\n        .concat([newRange])\n        .concat(selection.slice(i + 1));\n    } else if (item[1] === itemIndex - 1) {\n      // check to see whether another contiguous range follows\n      const nextItem = selection[i + 1];\n      if (Array.isArray(nextItem) && nextItem[0] === itemIndex + 1) {\n        const newRange: SelectionItem = [item[0], nextItem[1]];\n        return selection\n          .slice(0, i)\n          .concat([newRange])\n          .concat(selection.slice(i + 2));\n      } else if (typeof nextItem === \"number\" && nextItem === itemIndex + 1) {\n        const newRange: SelectionItem = [item[0], nextItem];\n        return selection\n          .slice(0, i)\n          .concat([newRange])\n          .concat(selection.slice(i + 2));\n      } else {\n        const newRange: SelectionItem = [item[0], itemIndex];\n        return selection\n          .slice(0, i)\n          .concat([newRange])\n          .concat(selection.slice(i + 1));\n      }\n    }\n  }\n\n  return selection;\n};\n\nexport const selectItem = (\n  selectionModel: TableSelectionModel,\n  selected: Selection,\n  itemIndex: number,\n  rangeSelect: boolean,\n  keepExistingSelection = false,\n  activeItemIndex = -1\n): Selection => {\n  const singleSelect = selectionModel === \"single\";\n  const multiSelect =\n    selectionModel === \"extended\" || selectionModel === \"checkbox\";\n  const actsLikeSingleSelect =\n    singleSelect || (multiSelect && !keepExistingSelection && !rangeSelect);\n\n  if (selectionModel === \"none\") {\n    return NO_SELECTION;\n  } else if (actsLikeSingleSelect) {\n    return [itemIndex];\n  } else if (rangeSelect) {\n    if (selected.length === 0) {\n      return [itemIndex];\n    } else {\n      const range: RangeTuple =\n        itemIndex > activeItemIndex\n          ? [activeItemIndex, itemIndex]\n          : [itemIndex, activeItemIndex];\n      return insertRange(selected, range);\n    }\n  } else if (!rangeSelect) {\n    // what if we now have a range because we just filled  agap between 2\n    if (newSelectedFillsGapOrExtends(selected, itemIndex)) {\n      return fillGapOrExtendSelection(selected, itemIndex);\n    } else {\n      return selected?.concat(itemIndex).sort(inAscendingOrder);\n    }\n  } else if (multiSelect) {\n    // const [from, to] = idx > active ? [active, idx] : [idx, active];\n    // newSelected = selected?.slice();\n    // for (let i = from; i <= to; i++) {\n    //   if (!selected?.includes(i)) {\n    //     newSelected.push(i);\n    //   }\n    // }\n  }\n  return NO_SELECTION;\n};\n\nfunction removeSelectedItem(selected: Selection, itemIndex: number) {\n  if (selected.includes(itemIndex)) {\n    return selected.filter((selectedItem) => selectedItem !== itemIndex);\n  } else {\n    const newSelected: Selection = [];\n    for (const selectedItem of selected) {\n      if (Array.isArray(selectedItem)) {\n        if (rangeIncludes(selectedItem, itemIndex)) {\n          newSelected.push(...splitRange(selectedItem, itemIndex));\n        } else {\n          newSelected.push(selectedItem);\n        }\n      } else {\n        newSelected.push(selectedItem);\n      }\n    }\n    return newSelected;\n  }\n}\n\nfunction insertRange(selected: Selection, range: RangeTuple): Selection {\n  const [from, to] = range;\n  return selected.reduce<Selection>((newSelected, selectedItem) => {\n    if (typeof selectedItem === \"number\") {\n      if (selectedItem < from || selectedItem > to) {\n        newSelected.push(selectedItem);\n      } else if (!includedInRange(newSelected.at(-1), selectedItem)) {\n        newSelected.push(range);\n      }\n    } else if (overlappingRange(selectedItem, range)) {\n      newSelected.push(mergeRanges(selectedItem, range));\n    } else {\n      if (range[1] < selectedItem[0]) {\n        newSelected.push(range);\n      }\n      newSelected.push(selectedItem);\n    }\n\n    return newSelected;\n  }, []);\n}\n\nconst overlappingRange = (r1: RangeTuple, r2: RangeTuple) =>\n  (r1[1] >= r2[0] && r1[1] <= r2[1]) || (r1[0] >= r2[0] && r1[0] <= r2[1]);\nconst mergeRanges = (r1: RangeTuple, r2: RangeTuple): RangeTuple => [\n  Math.min(r1[0], r2[0]),\n  Math.max(r1[1], r2[1]),\n];\n\nconst includedInRange = (\n  selectedItem: SelectionItem | undefined,\n  index: number\n) => {\n  if (typeof selectedItem === \"undefined\" || typeof selectedItem === \"number\") {\n    return false;\n  } else return rangeIncludes(selectedItem, index);\n};\n\nconst rangeIncludes = (range: RangeTuple, index: number) =>\n  index >= range[0] && index <= range[1];\n\nconst SINGLE_SELECTED_ROW =\n  RowSelected.True + RowSelected.First + RowSelected.Last;\nconst FIRST_SELECTED_ROW_OF_BLOCK = RowSelected.True + RowSelected.First;\nconst LAST_SELECTED_ROW_OF_BLOCK = RowSelected.True + RowSelected.Last;\n\n/**\n *  Determine the value for selected. We use a bitmap to represent a number of selection states\n * a row might exhibit. selected/not-selected is the fundamental value. We also identify first\n * row of a selected block, last row of a selected block;\n */\nexport const getSelectionStatus = (\n  selected: Selection,\n  itemIndex: number\n): number => {\n  for (const item of selected) {\n    if (typeof item === \"number\") {\n      if (item === itemIndex) {\n        return SINGLE_SELECTED_ROW;\n      }\n    } else if (rangeIncludes(item, itemIndex)) {\n      if (itemIndex === item[0]) {\n        return FIRST_SELECTED_ROW_OF_BLOCK;\n      } else if (itemIndex === item[1]) {\n        return LAST_SELECTED_ROW_OF_BLOCK;\n      } else {\n        return RowSelected.True;\n      }\n    }\n  }\n  return RowSelected.False;\n};\n\nexport const isSelected = (selected: Selection, itemIndex: number) => {\n  for (const item of selected) {\n    if (typeof item === \"number\") {\n      if (item === itemIndex) {\n        return true;\n      } else if (item > itemIndex) {\n        return false;\n      }\n    } else if (rangeIncludes(item, itemIndex)) {\n      return true;\n    } else if (item[0] > itemIndex) {\n      return false;\n    }\n  }\n\n  return false;\n};\n/**\n * Vuu server expects a full list if indexes of selected rows. Client represents selection in a more\n * efficient structure. This converts client structure to full server format.\n */\nexport const expandSelection = (selected: Selection): number[] => {\n  if (selected.every((selectedItem) => typeof selectedItem === \"number\")) {\n    return selected as number[];\n  }\n  const expandedSelected = [];\n  for (const selectedItem of selected) {\n    if (typeof selectedItem === \"number\") {\n      expandedSelected.push(selectedItem);\n    } else {\n      for (let i = selectedItem[0]; i <= selectedItem[1]; i++) {\n        expandedSelected.push(i);\n      }\n    }\n  }\n  return expandedSelected;\n};\n\nfunction splitRange([from, to]: RangeTuple, itemIndex: number): Selection {\n  if (itemIndex === from) {\n    return [[from + 1, to]];\n  } else if (itemIndex === to) {\n    return [[from, to - 1]];\n  } else if (to - from === 2) {\n    return [from, to];\n  } else if (itemIndex === to - 1) {\n    return [[from, to - 2], to];\n  } else {\n    return [\n      [from, itemIndex - 1],\n      [itemIndex + 1, to],\n    ];\n  }\n}\n\nexport type SelectionDiff = {\n  added: SelectionItem[];\n  removed: SelectionItem[];\n};\n", "import type { Options } from './types'\n\nexport function resolveUrl(url: string, baseUrl: string | null): string {\n  // url is absolute already\n  if (url.match(/^[a-z]+:\\/\\//i)) {\n    return url\n  }\n\n  // url is absolute already, without protocol\n  if (url.match(/^\\/\\//)) {\n    return window.location.protocol + url\n  }\n\n  // dataURI, mailto:, tel:, etc.\n  if (url.match(/^[a-z]+:/i)) {\n    return url\n  }\n\n  const doc = document.implementation.createHTMLDocument()\n  const base = doc.createElement('base')\n  const a = doc.createElement('a')\n\n  doc.head.appendChild(base)\n  doc.body.appendChild(a)\n\n  if (baseUrl) {\n    base.href = baseUrl\n  }\n\n  a.href = url\n\n  return a.href\n}\n\nexport const uuid = (() => {\n  // generate uuid for className of pseudo elements.\n  // We should not use GUIDs, otherwise pseudo elements sometimes cannot be captured.\n  let counter = 0\n\n  // ref: http://stackoverflow.com/a/6248722/2519373\n  const random = () =>\n    // eslint-disable-next-line no-bitwise\n    `0000${((Math.random() * 36 ** 4) << 0).toString(36)}`.slice(-4)\n\n  return () => {\n    counter += 1\n    return `u${random()}${counter}`\n  }\n})()\n\nexport function delay<T>(ms: number) {\n  return (args: T) =>\n    new Promise<T>((resolve) => {\n      setTimeout(() => resolve(args), ms)\n    })\n}\n\nexport function toArray<T>(arrayLike: any): T[] {\n  const arr: T[] = []\n\n  for (let i = 0, l = arrayLike.length; i < l; i++) {\n    arr.push(arrayLike[i])\n  }\n\n  return arr\n}\n\nfunction px(node: HTMLElement, styleProperty: string) {\n  const win = node.ownerDocument.defaultView || window\n  const val = win.getComputedStyle(node).getPropertyValue(styleProperty)\n  return val ? parseFloat(val.replace('px', '')) : 0\n}\n\nfunction getNodeWidth(node: HTMLElement) {\n  const leftBorder = px(node, 'border-left-width')\n  const rightBorder = px(node, 'border-right-width')\n  return node.clientWidth + leftBorder + rightBorder\n}\n\nfunction getNodeHeight(node: HTMLElement) {\n  const topBorder = px(node, 'border-top-width')\n  const bottomBorder = px(node, 'border-bottom-width')\n  return node.clientHeight + topBorder + bottomBorder\n}\n\nexport function getImageSize(targetNode: HTMLElement, options: Options = {}) {\n  const width = options.width || getNodeWidth(targetNode)\n  const height = options.height || getNodeHeight(targetNode)\n\n  return { width, height }\n}\n\nexport function getPixelRatio() {\n  let ratio\n\n  let FINAL_PROCESS\n  try {\n    FINAL_PROCESS = process\n  } catch (e) {\n    // pass\n  }\n\n  const val =\n    FINAL_PROCESS && FINAL_PROCESS.env\n      ? FINAL_PROCESS.env.devicePixelRatio\n      : null\n  if (val) {\n    ratio = parseInt(val, 10)\n    if (Number.isNaN(ratio)) {\n      ratio = 1\n    }\n  }\n  return ratio || window.devicePixelRatio || 1\n}\n\n// @see https://developer.mozilla.org/en-US/docs/Web/HTML/Element/canvas#maximum_canvas_size\nconst canvasDimensionLimit = 16384\n\nexport function checkCanvasDimensions(canvas: HTMLCanvasElement) {\n  if (\n    canvas.width > canvasDimensionLimit ||\n    canvas.height > canvasDimensionLimit\n  ) {\n    if (\n      canvas.width > canvasDimensionLimit &&\n      canvas.height > canvasDimensionLimit\n    ) {\n      if (canvas.width > canvas.height) {\n        canvas.height *= canvasDimensionLimit / canvas.width\n        canvas.width = canvasDimensionLimit\n      } else {\n        canvas.width *= canvasDimensionLimit / canvas.height\n        canvas.height = canvasDimensionLimit\n      }\n    } else if (canvas.width > canvasDimensionLimit) {\n      canvas.height *= canvasDimensionLimit / canvas.width\n      canvas.width = canvasDimensionLimit\n    } else {\n      canvas.width *= canvasDimensionLimit / canvas.height\n      canvas.height = canvasDimensionLimit\n    }\n  }\n}\n\nexport function canvasToBlob(\n  canvas: HTMLCanvasElement,\n  options: Options = {},\n): Promise<Blob | null> {\n  if (canvas.toBlob) {\n    return new Promise((resolve) => {\n      canvas.toBlob(\n        resolve,\n        options.type ? options.type : 'image/png',\n        options.quality ? options.quality : 1,\n      )\n    })\n  }\n\n  return new Promise((resolve) => {\n    const binaryString = window.atob(\n      canvas\n        .toDataURL(\n          options.type ? options.type : undefined,\n          options.quality ? options.quality : undefined,\n        )\n        .split(',')[1],\n    )\n    const len = binaryString.length\n    const binaryArray = new Uint8Array(len)\n\n    for (let i = 0; i < len; i += 1) {\n      binaryArray[i] = binaryString.charCodeAt(i)\n    }\n\n    resolve(\n      new Blob([binaryArray], {\n        type: options.type ? options.type : 'image/png',\n      }),\n    )\n  })\n}\n\nexport function createImage(url: string): Promise<HTMLImageElement> {\n  return new Promise((resolve, reject) => {\n    const img = new Image()\n    img.decode = () => resolve(img) as any\n    img.onload = () => resolve(img)\n    img.onerror = reject\n    img.crossOrigin = 'anonymous'\n    img.decoding = 'async'\n    img.src = url\n  })\n}\n\nexport async function svgToDataURL(svg: SVGElement): Promise<string> {\n  return Promise.resolve()\n    .then(() => new XMLSerializer().serializeToString(svg))\n    .then(encodeURIComponent)\n    .then((html) => `data:image/svg+xml;charset=utf-8,${html}`)\n}\n\nexport async function nodeToDataURL(\n  node: HTMLElement,\n  width: number,\n  height: number,\n): Promise<string> {\n  const xmlns = 'http://www.w3.org/2000/svg'\n  const svg = document.createElementNS(xmlns, 'svg')\n  const foreignObject = document.createElementNS(xmlns, 'foreignObject')\n\n  svg.setAttribute('width', `${width}`)\n  svg.setAttribute('height', `${height}`)\n  svg.setAttribute('viewBox', `0 0 ${width} ${height}`)\n\n  foreignObject.setAttribute('width', '100%')\n  foreignObject.setAttribute('height', '100%')\n  foreignObject.setAttribute('x', '0')\n  foreignObject.setAttribute('y', '0')\n  foreignObject.setAttribute('externalResourcesRequired', 'true')\n\n  svg.appendChild(foreignObject)\n  foreignObject.appendChild(node)\n  return svgToDataURL(svg)\n}\n\nexport const isInstanceOfElement = <\n  T extends typeof Element | typeof HTMLElement | typeof SVGImageElement,\n>(\n  node: Element | HTMLElement | SVGImageElement,\n  instance: T,\n): node is T['prototype'] => {\n  if (node instanceof instance) return true\n\n  const nodePrototype = Object.getPrototypeOf(node)\n\n  if (nodePrototype === null) return false\n\n  return (\n    nodePrototype.constructor.name === instance.name ||\n    isInstanceOfElement(nodePrototype, instance)\n  )\n}\n", "import { DataSourceFilter, DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport {\n  ColumnDescriptor,\n  SelectionChangeHandler,\n} from \"@vuu-ui/vuu-table-types\";\nimport {\n  ClientToServerEditRpc,\n  ClientToServerMenuRPC,\n  ClientToServerViewportRpcCall,\n  LinkDescriptorWithLabel,\n  VuuAggregation,\n  VuuColumns,\n  VuuDataRowDto,\n  VuuFilter,\n  VuuGroupBy,\n  VuuLinkDescriptor,\n  VuuMenu,\n  VuuRange,\n  VuuRowDataItemType,\n  VuuSort,\n  VuuTable,\n} from \"@vuu-ui/vuu-protocol-types\";\nimport { EventEmitter } from \"@vuu-ui/vuu-utils\";\nimport { TableSchema } from \"./message-utils\";\nimport {\n  MenuRpcResponse,\n  ViewportRpcResponse,\n  VuuUIMessageInRPCEditReject,\n  VuuUIMessageInRPCEditResponse,\n} from \"./vuuUIMessageTypes\";\n\nexport interface MessageWithClientViewportId {\n  clientViewportId: string;\n}\n// GridModelActions\nexport interface DataSourceAggregateMessage\n  extends MessageWithClientViewportId {\n  aggregations: VuuAggregation[];\n  type: \"aggregate\";\n}\n\nexport type DataUpdateMode = \"batch\" | \"update\" | \"size-only\";\nexport interface DataSourceDataMessage extends MessageWithClientViewportId {\n  mode: DataUpdateMode;\n  rows?: DataSourceRow[];\n  size?: number;\n  type: \"viewport-update\";\n}\n\nexport interface DataSourceDataSizeMessage extends MessageWithClientViewportId {\n  mode: \"size-only\";\n  size: number;\n  type: \"viewport-update\";\n}\n\nexport interface DataSourceDebounceRequest extends MessageWithClientViewportId {\n  type: \"debounce-begin\";\n}\n\nexport const isSizeOnly = (\n  message: DataSourceCallbackMessage\n): message is DataSourceDataSizeMessage =>\n  message.type === \"viewport-update\" && message.mode === \"size-only\";\n\nexport interface DataSourceDisabledMessage extends MessageWithClientViewportId {\n  type: \"disabled\";\n}\n\nexport interface DataSourceEnabledMessage extends MessageWithClientViewportId {\n  type: \"enabled\";\n}\n\nexport interface DataSourceColumnsMessage extends MessageWithClientViewportId {\n  type: \"columns\";\n  columns: VuuColumns;\n}\nexport interface DataSourceFilterMessage extends MessageWithClientViewportId {\n  type: \"filter\";\n  filter: DataSourceFilter;\n}\nexport interface DataSourceGroupByMessage extends MessageWithClientViewportId {\n  type: \"groupBy\";\n  groupBy: VuuGroupBy | undefined;\n}\nexport interface DataSourceSetConfigMessage\n  extends MessageWithClientViewportId {\n  type: \"config\";\n  config: WithFullConfig;\n}\n\nexport interface DataSourceMenusMessage extends MessageWithClientViewportId {\n  type: \"vuu-menu\";\n  menu: VuuMenu;\n}\n\nexport interface DataSourceSortMessage extends MessageWithClientViewportId {\n  type: \"sort\";\n  sort: VuuSort;\n}\n\nexport type DataSourceConfigMessage =\n  | DataSourceAggregateMessage\n  | DataSourceColumnsMessage\n  | DataSourceFilterMessage\n  | DataSourceGroupByMessage\n  | DataSourceSortMessage\n  | DataSourceSetConfigMessage;\n\nexport const toDataSourceConfig = (\n  message: DataSourceConfigMessage\n): DataSourceConfig => {\n  switch (message.type) {\n    case \"aggregate\":\n      return { aggregations: message.aggregations };\n    case \"columns\":\n      return { columns: message.columns };\n    case \"filter\":\n      return { filter: message.filter };\n    case \"groupBy\":\n      return { groupBy: message.groupBy };\n    case \"sort\":\n      return { sort: message.sort };\n    case \"config\":\n      return message.config;\n  }\n};\n\nconst exactlyTheSame = (a: unknown, b: unknown) => {\n  if (a === b) {\n    return true;\n  } else if (a === undefined && b === undefined) {\n    return true;\n  } else {\n    return false;\n  }\n};\n\ntype DataConfigPredicate = (\n  config: DataSourceConfig,\n  newConfig: DataSourceConfig\n) => boolean;\n\nconst equivalentFilter: DataConfigPredicate = (\n  { filter: f1 },\n  { filter: f2 }\n) =>\n  (f1 === undefined && f2?.filter === \"\") ||\n  (f2 === undefined && f1?.filter === \"\");\n\nexport const filterChanged: DataConfigPredicate = (c1, c2) => {\n  if (equivalentFilter(c1, c2)) {\n    return false;\n  } else {\n    return c1.filter?.filter !== c2.filter?.filter;\n  }\n};\n\nconst equivalentSort: DataConfigPredicate = ({ sort: s1 }, { sort: s2 }) =>\n  (s1 === undefined && s2?.sortDefs.length === 0) ||\n  (s2 === undefined && s1?.sortDefs.length === 0);\n\nconst sortChanged: DataConfigPredicate = (config, newConfig) => {\n  const { sort: s1 } = config;\n  const { sort: s2 } = newConfig;\n  if (exactlyTheSame(s1, s2) || equivalentSort(config, newConfig)) {\n    return false;\n  } else if (s1 === undefined || s2 === undefined) {\n    return true;\n  } else if (s1?.sortDefs.length !== s2?.sortDefs.length) {\n    return true;\n  }\n  return s1.sortDefs.some(\n    ({ column, sortType }, i) =>\n      column !== s2.sortDefs[i].column || sortType !== s2.sortDefs[i].sortType\n  );\n};\n\nexport const hasGroupBy = (config?: DataSourceConfig): config is WithGroupBy =>\n  config !== undefined &&\n  config.groupBy !== undefined &&\n  config.groupBy.length > 0;\n\nexport const hasFilter = (config?: DataSourceConfig): config is WithFilter =>\n  config?.filter !== undefined && config.filter.filter.length > 0;\n\nexport const hasSort = (config?: DataSourceConfig): config is WithSort =>\n  config?.sort !== undefined &&\n  Array.isArray(config.sort?.sortDefs) &&\n  config.sort.sortDefs.length > 0;\n\nconst equivalentGroupBy: DataConfigPredicate = (\n  { groupBy: val1 },\n  { groupBy: val2 }\n) =>\n  (val1 === undefined && val2?.length === 0) ||\n  (val2 === undefined && val1?.length === 0);\n\nexport const groupByChanged: DataConfigPredicate = (config, newConfig) => {\n  const { groupBy: g1 } = config;\n  const { groupBy: g2 } = newConfig;\n  if (exactlyTheSame(g1, g2) || equivalentGroupBy(config, newConfig)) {\n    return false;\n  } else if (g1 === undefined || g2 === undefined) {\n    return true;\n  } else if (g1?.length !== g2?.length) {\n    return true;\n  }\n  return g1.some((column, i) => column !== g2?.[i]);\n};\n\nconst equivalentColumns: DataConfigPredicate = (\n  { columns: cols1 },\n  { columns: cols2 }\n) =>\n  (cols1 === undefined && cols2?.length === 0) ||\n  (cols2 === undefined && cols1?.length === 0);\n\nexport const columnsChanged: DataConfigPredicate = (config, newConfig) => {\n  const { columns: cols1 } = config;\n  const { columns: cols2 } = newConfig;\n\n  if (exactlyTheSame(cols1, cols2) || equivalentColumns(config, newConfig)) {\n    return false;\n  } else if (cols1 === undefined || cols2 === undefined) {\n    return true;\n  } else if (cols1?.length !== cols2?.length) {\n    return true;\n  }\n  return cols1.some((column, i) => column !== cols2?.[i]);\n};\n\nconst equivalentAggregations: DataConfigPredicate = (\n  { aggregations: agg1 },\n  { aggregations: agg2 }\n) =>\n  (agg1 === undefined && agg2?.length === 0) ||\n  (agg2 === undefined && agg1?.length === 0);\n\nconst aggregationsChanged: DataConfigPredicate = (config, newConfig) => {\n  const { aggregations: agg1 } = config;\n  const { aggregations: agg2 } = newConfig;\n  if (exactlyTheSame(agg1, agg2) || equivalentAggregations(config, newConfig)) {\n    return false;\n  } else if (agg1 === undefined || agg2 === undefined) {\n    return true;\n  } else if (agg1.length !== agg2.length) {\n    return true;\n  }\n  return agg1.some(\n    ({ column, aggType }, i) =>\n      column !== agg2[i].column || aggType !== agg2[i].aggType\n  );\n};\nconst visualLinkChanged: DataConfigPredicate = () => {\n  // TODO\n  return false;\n};\n\nexport const configChanged = (\n  config: DataSourceConfig | undefined,\n  newConfig: DataSourceConfig | undefined\n) => {\n  if (exactlyTheSame(config, newConfig)) {\n    return false;\n  }\n\n  if (config === undefined || newConfig === undefined) {\n    return true;\n  }\n\n  return (\n    columnsChanged(config, newConfig) ||\n    filterChanged(config, newConfig) ||\n    sortChanged(config, newConfig) ||\n    groupByChanged(config, newConfig) ||\n    aggregationsChanged(config, newConfig) ||\n    visualLinkChanged(config, newConfig)\n  );\n};\n\nexport interface DataSourceSubscribedMessage\n  extends MessageWithClientViewportId,\n    MessageWithClientViewportId {\n  aggregations: VuuAggregation[];\n  columns: VuuColumns;\n  filter: DataSourceFilter;\n  groupBy: VuuGroupBy;\n  range: VuuRange;\n  sort: VuuSort;\n  tableSchema: Readonly<TableSchema>;\n  type: \"subscribed\";\n}\n\nexport interface DataSourceVisualLinkCreatedMessage\n  extends MessageWithClientViewportId {\n  colName: string;\n  parentViewportId: string;\n  parentColName: string;\n  type: \"vuu-link-created\";\n}\n\nexport interface DataSourceVisualLinkRemovedMessage\n  extends MessageWithClientViewportId {\n  type: \"vuu-link-removed\";\n}\n\nexport interface DataSourceVisualLinksMessage\n  extends MessageWithClientViewportId {\n  type: \"vuu-links\";\n  links: VuuLinkDescriptor[];\n}\n\nexport type VuuFeatureMessage =\n  | DataSourceMenusMessage\n  | DataSourceVisualLinksMessage;\n\nexport type VuuFeatureInvocationMessage =\n  | DataSourceVisualLinkCreatedMessage\n  | DataSourceVisualLinkRemovedMessage;\n\nexport type DataSourceCallbackMessage =\n  | DataSourceConfigMessage\n  | DataSourceColumnsMessage\n  | DataSourceDataMessage\n  | DataSourceDebounceRequest\n  | DataSourceDisabledMessage\n  | DataSourceEnabledMessage\n  | DataSourceMenusMessage\n  | DataSourceSubscribedMessage\n  | DataSourceVisualLinkCreatedMessage\n  | DataSourceVisualLinkRemovedMessage\n  | DataSourceVisualLinksMessage;\n\nconst datasourceMessages = [\n  \"config\",\n  \"aggregate\",\n  \"viewport-update\",\n  \"columns\",\n  \"debounce-begin\",\n  \"disabled\",\n  \"enabled\",\n  \"filter\",\n  \"groupBy\",\n  \"vuu-link-created\",\n  \"vuu-link-removed\",\n  \"vuu-links\",\n  \"vuu-menu\",\n  \"sort\",\n  \"subscribed\",\n];\n\nexport type ConfigChangeColumnsMessage = {\n  type: \"columns\";\n  columns?: ColumnDescriptor[];\n};\n\nexport type ConfigChangeMessage =\n  | ConfigChangeColumnsMessage\n  | DataSourceAggregateMessage\n  | DataSourceFilterMessage\n  | DataSourceGroupByMessage\n  | DataSourceSortMessage\n  | DataSourceVisualLinkCreatedMessage\n  | DataSourceVisualLinkRemovedMessage;\n\nexport type ConfigChangeHandler = (msg: ConfigChangeMessage) => void;\n\nexport const shouldMessageBeRoutedToDataSource = (\n  message: unknown\n): message is DataSourceCallbackMessage => {\n  const type = (message as DataSourceCallbackMessage).type;\n  return datasourceMessages.includes(type);\n};\n\nexport const isDataSourceConfigMessage = (\n  message: DataSourceCallbackMessage\n): message is DataSourceConfigMessage =>\n  [\"config\", \"aggregate\", \"columns\", \"filter\", \"groupBy\", \"sort\"].includes(\n    message.type\n  );\n\n/**\n * Described the configuration values that should typically be\n * persisted across sessions.\n */\nexport interface WithFullConfig {\n  readonly aggregations: VuuAggregation[];\n  readonly columns: string[];\n  readonly filter: DataSourceFilter;\n  readonly groupBy: VuuGroupBy;\n  readonly sort: VuuSort;\n  readonly visualLink?: LinkDescriptorWithLabel;\n}\n\nexport const NoFilter: VuuFilter = { filter: \"\" };\nexport const NoSort: VuuSort = { sortDefs: [] };\n\nexport const vanillaConfig: WithFullConfig = {\n  aggregations: [],\n  columns: [],\n  filter: NoFilter,\n  groupBy: [],\n  sort: NoSort,\n};\n\nexport const withConfigDefaults = (\n  config: DataSourceConfig\n): WithFullConfig & { visualLink?: LinkDescriptorWithLabel } => {\n  if (\n    config.aggregations &&\n    config.columns &&\n    config.filter &&\n    config.groupBy &&\n    config.sort\n  ) {\n    return config as WithFullConfig;\n  } else {\n    const {\n      aggregations = [],\n      columns = [],\n      filter = { filter: \"\" },\n      groupBy = [],\n      sort = { sortDefs: [] },\n      visualLink,\n    } = config;\n\n    return {\n      aggregations,\n      columns,\n      filter,\n      groupBy,\n      sort,\n      visualLink,\n    };\n  }\n};\n\nexport interface DataSourceConfig extends Partial<WithFullConfig> {\n  visualLink?: LinkDescriptorWithLabel;\n}\n\nexport interface WithGroupBy extends DataSourceConfig {\n  groupBy: VuuGroupBy;\n}\nexport interface WithFilter extends DataSourceConfig {\n  filter: DataSourceFilter;\n}\nexport interface WithSort extends DataSourceConfig {\n  sort: VuuSort;\n}\n\nexport interface DataSourceConstructorProps extends DataSourceConfig {\n  bufferSize?: number;\n  table: VuuTable;\n  title?: string;\n  viewport?: string;\n}\n\nexport interface SubscribeProps {\n  viewport?: string;\n  columns?: string[];\n  aggregations?: VuuAggregation[];\n  range?: VuuRange;\n  sort?: VuuSort;\n  groupBy?: VuuGroupBy;\n  filter?: DataSourceFilter;\n  title?: string;\n}\n\nexport type SubscribeCallback = (message: DataSourceCallbackMessage) => void;\nexport type OptimizeStrategy = \"none\" | \"throttle\" | \"debounce\";\n\nexport type DataSourceEvents = {\n  config: (config: DataSourceConfig | undefined, confirmed?: boolean) => void;\n  optimize: (optimize: OptimizeStrategy) => void;\n  range: (range: VuuRange) => void;\n  resize: (size: number) => void;\n};\n\n/**\n * return Promise<true> indicates success\n * return Promise<errorMessage> indicates failure\n */\nexport type DataSourceEditHandler = (\n  row: DataSourceRow,\n  columnName: string,\n  value: VuuRowDataItemType\n) => Promise<true | string>;\n\nexport type DataSourceDeleteHandler = (key: string) => Promise<true | string>;\nexport type DataSourceInsertHandler = (\n  key: string,\n  data: VuuDataRowDto\n) => Promise<true | string>;\n\nexport type RpcResponse =\n  | MenuRpcResponse\n  | VuuUIMessageInRPCEditReject\n  | VuuUIMessageInRPCEditResponse\n  | ViewportRpcResponse;\n\nexport type RpcResponseHandler = (response: RpcResponse) => boolean;\n\nexport type RowSearchPredicate = (row: DataSourceRow) => boolean;\n\nexport type DataSourceStatus =\n  | \"disabled\"\n  | \"disabling\"\n  | \"enabled\"\n  | \"enabling\"\n  | \"initialising\"\n  | \"subscribing\"\n  | \"subscribed\"\n  | \"suspended\"\n  | \"unsubscribed\";\n\nexport interface TypeaheadSuggestionProvider {\n  getTypeaheadSuggestions: (\n    columnName: string,\n    pattern?: string\n  ) => Promise<string[]>;\n}\n\nexport const isTypeaheadSuggestionProvider = (\n  source: unknown\n): source is TypeaheadSuggestionProvider =>\n  typeof (source as TypeaheadSuggestionProvider)[\"getTypeaheadSuggestions\"] ===\n  \"function\";\n\nexport interface DataSource\n  extends EventEmitter<DataSourceEvents>,\n    Partial<TypeaheadSuggestionProvider> {\n  aggregations: VuuAggregation[];\n  applyEdit: DataSourceEditHandler;\n  /**\n   * set config without triggering config event. Use this method when initialising\n   * a dataSource that has been restored from session state. The dataSource will\n   * not yet be subscribed. Triggering the config event is unnecessary and might\n   * cause a React exception if the event were to cause a render.\n   * @param config DataSourceConfig\n   * @returns true if config has been applied (will not be if existig config is same)\n   */\n  applyConfig: (config: DataSourceConfig) => true | undefined;\n  closeTreeNode: (key: string, cascade?: boolean) => void;\n  columns: string[];\n  config: DataSourceConfig;\n  status: DataSourceStatus;\n  /**\n   *\n   * Similar to disable but intended for pauses of very short duration (default is 3 seconds). Although\n   * the dataSource will stop sending messages until resumed, it will not disconnect from a  remote server.\n   * It will preserve subscription to the remote server and continue to apply updates to cached data. It\n   * just won't send updates through to the UI thread (until resumed). Useful in edge cases such as where a\n   * component is dragged to a new location. When dropped, the component will be unmounted and very quickly\n   * remounted by React. For the duration of this operation, we suspend updates . Updating an unmounted\n   * React component would cause a React error.\n   * If an suspend is requested and not resumed within 3 seconds, it will automatically be promoted to a disable.,\n   */\n  suspend?: () => void;\n  resume?: () => void;\n\n  deleteRow?: DataSourceDeleteHandler;\n\n  /**\n   * For a dataSource that has been previously disabled and is currently in disabled state , this will restore\n   * the subscription to active status. Fresh data will be dispatched to client. The enable call optionally\n   * accepts the same subscribe callback as subscribe. This allows a completely new instance of a component to\n   * assume ownership of a subscription and receive all messages.\n   */\n  enable?: (callback?: SubscribeCallback) => void;\n  /**\n   * Disables this subscription. A datasource will send no further messages until re-enabled. Example usage\n   * might be for a component displayed within a set of Tabs. If user switches to another tab, the dataSource\n   * of the component that is no longer visible can be disabled until it is made visible again.\n   */\n  disable?: () => void;\n  filter: DataSourceFilter;\n  groupBy: VuuGroupBy;\n  insertRow?: DataSourceInsertHandler;\n  links?: LinkDescriptorWithLabel[];\n  menu?: VuuMenu;\n  menuRpcCall: (\n    rpcRequest: Omit<ClientToServerMenuRPC, \"vpId\"> | ClientToServerEditRpc\n  ) => Promise<RpcResponse | undefined>;\n  rpcCall?: <T extends RpcResponse = RpcResponse>(\n    message: Omit<ClientToServerViewportRpcCall, \"vpId\">\n  ) => Promise<T | undefined>;\n  openTreeNode: (key: string) => void;\n  range: VuuRange;\n  select: SelectionChangeHandler;\n  readonly selectedRowsCount: number;\n  readonly size: number;\n  sort: VuuSort;\n  subscribe: (\n    props: SubscribeProps,\n    callback: SubscribeCallback\n  ) => Promise<void>;\n  table?: VuuTable;\n  readonly tableSchema?: TableSchema;\n  title?: string;\n  unsubscribe: () => void;\n  viewport?: string;\n  visualLink?: LinkDescriptorWithLabel;\n}\n", "export const CHANGE_VP_SUCCESS = \"CHANGE_VP_SUCCESS\";\nexport const CHANGE_VP_RANGE_SUCCESS = \"CHANGE_VP_RANGE_SUCCESS\";\nexport const CLOSE_TREE_NODE = \"CLOSE_TREE_NODE\";\nexport const CLOSE_TREE_SUCCESS = \"CLOSE_TREE_SUCCESS\";\nexport const CLOSE_TREE_REJECT = \"CLOSE_TREE_REJECT\";\nexport const CREATE_VISUAL_LINK = \"CREATE_VISUAL_LINK\";\nexport const CREATE_VP = \"CREATE_VP\";\nexport const DISABLE_VP = \"DISABLE_VP\";\nexport const DISABLE_VP_SUCCESS = \"DISABLE_VP_SUCCESS\";\nexport const DISABLE_VP_REJECT = \"DISABLE_VP_REJECT\";\nexport const ENABLE_VP = \"ENABLE_VP\";\nexport const ENABLE_VP_SUCCESS = \"ENABLE_VP_SUCCESS\";\nexport const ENABLE_VP_REJECT = \"ENABLE_VP_REJECT\";\nexport const GET_TABLE_META = \"GET_TABLE_META\";\nexport const GET_VP_VISUAL_LINKS = \"GET_VP_VISUAL_LINKS\";\nexport const GET_VIEW_PORT_MENUS = \"GET_VIEW_PORT_MENUS\";\nexport const VIEW_PORT_MENUS_SELECT_RPC = \"VIEW_PORT_MENUS_SELECT_RPC\";\nexport const VIEW_PORT_MENU_CELL_RPC = \"VIEW_PORT_MENU_CELL_RPC\";\nexport const VIEW_PORT_MENU_TABLE_RPC = \"VIEW_PORT_MENU_TABLE_RPC\";\nexport const VIEW_PORT_MENU_ROW_RPC = \"VIEW_PORT_MENU_ROW_RPC\";\nexport const VIEW_PORT_MENU_RESP = \"VIEW_PORT_MENU_RESP\";\nexport const VIEW_PORT_MENU_REJ = \"VIEW_PORT_MENU_REJ\";\nexport const HB = \"HB\";\nexport const HB_RESP = \"HB_RESP\";\nexport const LOGIN = \"LOGIN\";\nexport const OPEN_TREE_NODE = \"OPEN_TREE_NODE\";\nexport const OPEN_TREE_SUCCESS = \"OPEN_TREE_SUCCESS\";\nexport const OPEN_TREE_REJECT = \"OPEN_TREE_REJECT\";\nexport const REMOVE_VP = \"REMOVE_VP\";\nexport const REMOVE_VP_REJECT = \"REMOVE_VP_REJECT\";\nexport const RPC_CALL = \"RPC_CALL\";\nexport const RPC_RESP = \"RPC_RESP\";\nexport const MENU_RPC_RESP = \"MENU_RPC_RESP\";\nexport const SET_SELECTION = \"SET_SELECTION\";\nexport const SET_SELECTION_SUCCESS = \"SET_SELECTION_SUCCESS\";\n\nexport const TABLE_ROW = \"TABLE_ROW\";\nexport const SIZE = \"SIZE\";\nexport const UPDATE = \"U\";\n", "import {\n  ClientToServerTableList,\n  ClientToServerTableMeta,\n  LinkDescriptorWithLabel,\n  ServerToClientBody,\n  ServerToClientMenuSessionTableAction,\n  ServerToClientViewportRpcResponse,\n  TypeAheadMethod,\n  VuuAggregation,\n  VuuColumns,\n  VuuGroupBy,\n  VuuRange,\n  VuuSort,\n  VuuTable,\n} from \"@vuu-ui/vuu-protocol-types\";\nimport { DataSourceFilter } from \"@vuu-ui/vuu-data-types\";\nimport { TableSchema, WithRequestId } from \"./message-utils\";\nimport {\n  DataSourceMenusMessage,\n  DataSourceVisualLinkCreatedMessage,\n  DataSourceVisualLinkRemovedMessage,\n  DataSourceVisualLinksMessage,\n  RpcResponse,\n  VuuFeatureInvocationMessage,\n  VuuFeatureMessage,\n  WithFullConfig,\n} from \"./data-source\";\nimport { GridAction, Selection } from \"@vuu-ui/vuu-table-types\";\nimport { WebSocketProtocol } from \"./websocket-connection\";\n\nexport interface OpenDialogAction {\n  type: \"OPEN_DIALOG_ACTION\";\n  tableSchema?: TableSchema;\n  table?: VuuTable;\n}\nexport interface NoAction {\n  type: \"NO_ACTION\";\n}\n\nexport declare type MenuRpcAction = OpenDialogAction | NoAction;\n\nexport type ConnectionStatus =\n  | \"connecting\"\n  | \"connection-open-awaiting-session\"\n  | \"connected\"\n  | \"disconnected\"\n  | \"reconnected\";\n\nexport interface ConnectionStatusMessage {\n  type: \"connection-status\";\n  reason?: string;\n  retry?: boolean;\n  status: ConnectionStatus;\n}\n\nexport const isConnectionStatusMessage = (\n  msg: object | ConnectionStatusMessage\n): msg is ConnectionStatusMessage =>\n  (msg as ConnectionStatusMessage).type === \"connection-status\";\n\nexport interface ConnectionQualityMetrics {\n  type: \"connection-metrics\";\n  messagesLength: number;\n}\n\nexport const isConnectionQualityMetrics = (\n  msg: object\n): msg is ConnectionQualityMetrics =>\n  (msg as ConnectionQualityMetrics).type === \"connection-metrics\";\n\nexport interface ServerProxySubscribeMessage {\n  aggregations: VuuAggregation[];\n  bufferSize?: number;\n  columns: VuuColumns;\n  filter: DataSourceFilter;\n  groupBy: VuuGroupBy;\n  range: VuuRange;\n  sort: VuuSort;\n  table: VuuTable;\n  title?: string;\n  viewport: string;\n  visualLink?: LinkDescriptorWithLabel;\n}\n\n// export type VuuUIMessageInConnectionStatus = {\n//   type: 'connection-status';\n// };\n\nexport type VuuUIMessageInConnected = {\n  type: \"connected\";\n};\n\nexport type VuuUIMessageInWorkerReady = {\n  type: \"ready\";\n};\n\nexport interface ViewportMessageIn {\n  clientViewportId: string;\n}\n\n// TODO use generic to type result\nexport interface VuuUIMessageInRPC {\n  method: string;\n  result: unknown;\n  requestId: string;\n  type: \"RPC_RESP\";\n}\n\nexport interface VuuUIMessageInRPCEditReject {\n  error: string;\n  requestId?: string;\n  type: \"VP_EDIT_RPC_REJECT\";\n}\n\nexport interface VuuUIMessageInRPCEditResponse {\n  action: unknown;\n  requestId: string;\n  rpcName: string;\n  type: \"VP_EDIT_RPC_RESPONSE\";\n}\n\nexport const messageHasResult = (msg: object): msg is VuuUIMessageInRPC =>\n  typeof (msg as VuuUIMessageInRPC).result !== \"undefined\";\n\nexport const isTableSchema = (\n  message: VuuUIMessageIn\n): message is VuuUIMessageInTableMeta => message.type === \"TABLE_META_RESP\";\n\nexport interface VuuUIMessageInTableList {\n  requestId: string;\n  type: \"TABLE_LIST_RESP\";\n  tables: VuuTable[];\n}\nexport interface VuuUIMessageInTableMeta {\n  requestId: string;\n  tableSchema: TableSchema;\n  type: \"TABLE_META_RESP\";\n}\nexport interface MenuRpcResponse {\n  action: MenuRpcAction;\n  error?: string;\n  requestId: string;\n  rpcName?: string;\n  tableAlreadyOpen?: boolean;\n  type: \"VIEW_PORT_MENU_RESP\";\n}\nexport interface ViewportRpcResponse {\n  action: ServerToClientViewportRpcResponse[\"action\"];\n  requestId: string;\n  rpcName?: string;\n  type: \"VIEW_PORT_RPC_RESPONSE\";\n}\nexport interface MenuRpcReject extends ViewportMessageIn {\n  error?: string;\n  requestId: string;\n  rpcName?: string;\n  type: \"VIEW_PORT_MENU_REJ\";\n}\n\nexport interface VuuUIMessageInMenuRej {\n  error: string;\n  requestId: string;\n  rpcName: string;\n  type: \"VIEW_PORT_MENU_REJ\";\n}\n\nexport type VuuUIMessageIn =\n  | VuuUIMessageInConnected\n  | VuuUIMessageInWorkerReady\n  | VuuUIMessageInRPC\n  | ViewportRpcResponse\n  | MenuRpcResponse\n  | MenuRpcReject\n  | VuuUIMessageInTableList\n  | VuuUIMessageInTableMeta\n  | VuuUIMessageInRPCEditReject\n  | VuuUIMessageInRPCEditResponse;\n\nexport const isErrorResponse = (\n  response?: RpcResponse\n): response is VuuUIMessageInRPCEditReject =>\n  response !== undefined && \"error\" in response;\n\nexport const hasAction = (\n  response?: RpcResponse\n): response is MenuRpcResponse | VuuUIMessageInRPCEditResponse =>\n  response != undefined && \"action\" in response;\n\nexport interface VuuUIMessageOutConnect {\n  protocol: WebSocketProtocol;\n  type: \"connect\";\n  token: string;\n  url: string;\n  username?: string;\n  retryLimitDisconnect?: number;\n  retryLimitStartup?: number;\n}\n\nexport interface VuuUIMessageOutSubscribe extends ServerProxySubscribeMessage {\n  type: \"subscribe\";\n}\n\nexport interface VuuUIMessageOutUnsubscribe {\n  type: \"unsubscribe\";\n  viewport: string;\n}\nexport interface VuuUIMessageOutSuspend {\n  type: \"suspend\";\n  viewport: string;\n}\nexport interface VuuUIMessageOutResume {\n  type: \"resume\";\n  viewport: string;\n}\n\nexport interface ViewportMessageOut {\n  viewport: string;\n}\n\nexport interface RequestMessage {\n  requestId: string;\n}\n\nexport interface VuuUIMessageOutColumns extends ViewportMessageOut {\n  type: \"setColumns\";\n  columns: string[];\n}\nexport interface VuuUIMessageOutViewRange extends ViewportMessageOut {\n  type: \"setViewRange\";\n  range: {\n    from: number;\n    to: number;\n  };\n}\nexport interface VuuUIMessageOutAggregate extends ViewportMessageOut {\n  aggregations: VuuAggregation[];\n  type: \"aggregate\";\n}\nexport interface VuuUIMessageOutCloseTreeNode extends ViewportMessageOut {\n  key: string;\n  type: \"closeTreeNode\";\n}\nexport interface VuuUIMessageOutCreateLink extends ViewportMessageOut {\n  childColumnName: string;\n  parentColumnName: string;\n  parentClientVpId: string;\n  type: \"createLink\";\n}\nexport interface VuuUIMessageOutRemoveLink extends ViewportMessageOut {\n  type: \"removeLink\";\n}\nexport interface VuuUIMessageOutSetTitle extends ViewportMessageOut {\n  title: string;\n  type: \"setTitle\";\n}\n\nexport interface VuuUIMessageOutDisable extends ViewportMessageOut {\n  type: \"disable\";\n}\nexport interface VuuUIMessageOutEnable extends ViewportMessageOut {\n  type: \"enable\";\n}\nexport interface VuuUIMessageOutOpenTreeNode extends ViewportMessageOut {\n  key: string;\n  type: \"openTreeNode\";\n}\nexport interface VuuUIMessageOutResume extends ViewportMessageOut {\n  type: \"resume\";\n}\n\nexport interface VuuUIMessageOutSelect extends ViewportMessageOut {\n  selected: Selection;\n  type: \"select\";\n}\nexport interface VuuUIMessageOutSelectAll extends ViewportMessageOut {\n  type: \"selectAll\";\n}\nexport interface VuuUIMessageOutSelectNone extends ViewportMessageOut {\n  type: \"selectNone\";\n}\n\nexport interface VuuUIMessageOutSort extends ViewportMessageOut {\n  sort: VuuSort;\n  type: \"sort\";\n}\nexport interface VuuUIMessageOutSuspend extends ViewportMessageOut {\n  type: \"suspend\";\n}\n\nexport interface VuuUIMessageOutFilter extends ViewportMessageOut {\n  filter: DataSourceFilter;\n  type: \"filter\";\n}\nexport interface VuuUIMessageOutGroupby extends ViewportMessageOut {\n  groupBy: VuuGroupBy;\n  type: \"groupBy\";\n}\n\nexport interface VuuUIMessageOutConfig extends ViewportMessageOut {\n  config: WithFullConfig;\n  type: \"config\";\n}\n\nexport type VuuUIMessageOutViewport =\n  | VuuUIMessageOutAggregate\n  | VuuUIMessageOutCloseTreeNode\n  | VuuUIMessageOutColumns\n  | VuuUIMessageOutConfig\n  | VuuUIMessageOutCreateLink\n  | VuuUIMessageOutFilter\n  | VuuUIMessageOutDisable\n  | VuuUIMessageOutEnable\n  | VuuUIMessageOutGroupby\n  | VuuUIMessageOutOpenTreeNode\n  | VuuUIMessageOutRemoveLink\n  | VuuUIMessageOutResume\n  | VuuUIMessageOutSelect\n  | VuuUIMessageOutSelectAll\n  | VuuUIMessageOutSelectNone\n  | VuuUIMessageOutSetTitle\n  | VuuUIMessageOutSuspend\n  | VuuUIMessageOutSort\n  | VuuUIMessageOutViewRange;\n\nexport const isViewporttMessage = (\n  msg: object\n): msg is VuuUIMessageOutViewport => \"viewport\" in msg;\n\nexport interface TypeAheadRpcRequest {\n  method: TypeAheadMethod;\n  params: [VuuTable, ...string[]];\n  type: \"RPC_CALL\";\n}\n\nexport type VuuUIMessageOut =\n  | VuuUIMessageOutConnect\n  | VuuUIMessageOutSubscribe\n  | VuuUIMessageOutUnsubscribe\n  | VuuUIMessageOutViewport\n  | WithRequestId<ClientToServerTableList>\n  | WithRequestId<ClientToServerTableMeta>;\n\nexport const isSessionTableActionMessage = (\n  messageBody: ServerToClientBody\n): messageBody is ServerToClientMenuSessionTableAction =>\n  messageBody.type === \"VIEW_PORT_MENU_RESP\" &&\n  messageBody.action !== null &&\n  isSessionTable(messageBody.action.table);\n\nexport const isSessionTable = (table?: unknown) => {\n  if (\n    table !== null &&\n    typeof table === \"object\" &&\n    \"table\" in table &&\n    \"module\" in table\n  ) {\n    return (table as VuuTable).table.startsWith(\"session\");\n  }\n  return false;\n};\n\nexport const isVisualLinksAction = (\n  action: GridAction\n): action is DataSourceVisualLinksMessage => action.type === \"vuu-links\";\n\nexport const isVisualLinkCreatedAction = (\n  action: GridAction\n): action is DataSourceVisualLinkCreatedMessage =>\n  action.type === \"vuu-link-created\";\n\nexport const isVisualLinkRemovedAction = (\n  action: GridAction\n): action is DataSourceVisualLinkRemovedMessage =>\n  action.type === \"vuu-link-removed\";\n\nexport const isViewportMenusAction = (\n  action: GridAction\n): action is DataSourceMenusMessage => action.type === \"vuu-menu\";\n\nexport const isVuuFeatureAction = (\n  action: GridAction\n): action is VuuFeatureMessage =>\n  isViewportMenusAction(action) || isVisualLinksAction(action);\n\nexport const isVuuFeatureInvocation = (\n  action: GridAction\n): action is VuuFeatureInvocationMessage =>\n  action.type === \"vuu-link-created\" || action.type === \"vuu-link-removed\";\n", "export const workerSourceCode = `\nvar de=(s,e,t)=>{if(!e.has(s))throw TypeError(\"Cannot \"+t)};var d=(s,e,t)=>(de(s,e,\"read from private field\"),t?t.call(s):e.get(s)),k=(s,e,t)=>{if(e.has(s))throw TypeError(\"Cannot add the same private member more than once\");e instanceof WeakSet?e.add(s):e.set(s,t)},ge=(s,e,t,n)=>(de(s,e,\"write to private field\"),n?n.call(s,t):e.set(s,t),t);function fe(s,e,t=[],n=[]){for(let r=0,o=s.length;r<o;r++)(e(s[r],r)?t:n).push(s[r]);return[t,n]}var V={IDX:0,RENDER_IDX:1,IS_LEAF:2,IS_EXPANDED:3,DEPTH:4,COUNT:5,KEY:6,SELECTED:7,count:8,PARENT_IDX:\"parent_idx\",IDX_POINTER:\"idx_pointer\",FILTER_COUNT:\"filter_count\",NEXT_FILTER_IDX:\"next_filter_idx\"};var{DEPTH:sn,IS_LEAF:on}=V;var me=s=>{var e,t;if(((e=globalThis.document)==null?void 0:e.cookie)!==void 0)return(t=globalThis.document.cookie.split(\"; \").find(n=>n.startsWith(\\`\\${s}=\\`)))==null?void 0:t.split(\"=\")[1]};function K({from:s,to:e},t=0,n=Number.MAX_SAFE_INTEGER){if(t===0)return n<s?{from:0,to:0}:{from:s,to:Math.min(e,n)};if(s===0)return{from:s,to:Math.min(e+t,n)};{let r=e-s,o=Math.round(t/2),i=s-o<0,u=n-(e+o)<0;return i&&u?{from:0,to:n}:i?{from:0,to:r+t}:u?{from:Math.max(0,n-(r+t)),to:n}:{from:s-o,to:e+o}}}var it=(s,{from:e,to:t})=>s>=e&&s<t;var v=class{constructor(e,t){this.from=e,this.to=t}isWithin(e){return it(e,this)}overlap(e,t){return e>=this.to||t<this.from?[0,0]:[Math.max(e,this.from),Math.min(t,this.to)]}copy(){return new v(this.from,this.to)}};var{KEY:mn}=V;var Ce={hour:\"2-digit\",minute:\"2-digit\",second:\"2-digit\"},at={\"hh:mm:ss\":{locale:\"en-GB\",options:{...Ce,hour12:!1}},\"hh:mm:ss a\":{locale:\"en-GB\",options:{...Ce,hour12:!0}}},I={day:\"2-digit\",month:\"2-digit\",year:\"numeric\"},ut={\"dd.mm.yyyy\":{locale:\"en-GB\",options:{...I},postProcessor:s=>s.replaceAll(\"/\",\".\")},\"dd/mm/yyyy\":{locale:\"en-GB\",options:{...I}},\"dd MMM yyyy\":{locale:\"en-GB\",options:{...I,month:\"short\"}},\"dd MMMM yyyy\":{locale:\"en-GB\",options:{...I,month:\"long\"}},\"mm/dd/yyyy\":{locale:\"en-US\",options:{...I}},\"MMM dd, yyyy\":{locale:\"en-US\",options:{...I,month:\"short\"}},\"MMMM dd, yyyy\":{locale:\"en-US\",options:{...I,month:\"long\"}}},Rn={...ut,...at};var ct=[\"error\",\"warn\",\"info\",\"debug\"],pt=s=>typeof s==\"string\"&&ct.includes(s),dt=\"error\",A=()=>{},gt=\"error\",{loggingLevel:U=gt}=ft(),w=s=>{let e=U===\"debug\",t=e||U===\"info\",n=t||U===\"warn\",r=n||U===\"error\",o=t?p=>console.info(\\`[\\${s}] \\${p}\\`):A,i=n?p=>console.warn(\\`[\\${s}] \\${p}\\`):A,u=e?p=>console.debug(\\`[\\${s}] \\${p}\\`):A;return{errorEnabled:r,error:r?p=>console.error(\\`[\\${s}] \\${p}\\`):A}};function ft(){return typeof loggingSettings<\"u\"?loggingSettings:{loggingLevel:mt()}}function mt(){let s=me(\"vuu-logging-level\");return pt(s)?s:dt}var{debug:ht,debugEnabled:Ct}=w(\"range-monitor\"),F=class{constructor(e){this.source=e;this.range={from:0,to:0};this.timestamp=0}isSet(){return this.timestamp!==0}set({from:e,to:t}){let{timestamp:n}=this;if(this.range.from=e,this.range.to=t,this.timestamp=performance.now(),n)Ct&&ht(\\`<\\${this.source}> [\\${e}-\\${t}], \\${(this.timestamp-n).toFixed(0)} ms elapsed\\`);else return 0}};function be(s){return Array.isArray(s)}function bt(s){return!Array.isArray(s)}var R,Re=class{constructor(){k(this,R,new Map)}addListener(e,t){let n=d(this,R).get(e);n?be(n)?n.push(t):bt(n)&&d(this,R).set(e,[n,t]):d(this,R).set(e,t)}removeListener(e,t){if(!d(this,R).has(e))return;let n=d(this,R).get(e),r=-1;if(n===t)d(this,R).delete(e);else if(Array.isArray(n)){for(let o=length;o-- >0;)if(n[o]===t){r=o;break}if(r<0)return;n.length===1?(n.length=0,d(this,R).delete(e)):n.splice(r,1)}}removeAllListeners(e){e&&d(this,R).has(e)?d(this,R).delete(e):e===void 0&&d(this,R).clear()}emit(e,...t){if(d(this,R)){let n=d(this,R).get(e);n&&this.invokeHandler(n,t)}}once(e,t){let n=(...r)=>{this.removeListener(e,n),t(...r)};this.on(e,n)}on(e,t){this.addListener(e,t)}hasListener(e,t){let n=d(this,R).get(e);return Array.isArray(n)?n.includes(t):n===t}invokeHandler(e,t){if(be(e))e.slice().forEach(n=>this.invokeHandler(n,t));else switch(t.length){case 0:e();break;case 1:e(t[0]);break;case 2:e(t[0],t[1]);break;default:e.call(null,...t)}}};R=new WeakMap;var N=String.fromCharCode(8200),f=String.fromCharCode(8199);var Ln={DIGIT:f,TWO_DIGITS:f+f,THREE_DIGITS:f+f+f,FULL_PADDING:[null,N+f,N+f+f,N+f+f+f,N+f+f+f+f]};var _n=f+f+f+f+f+f+f+f+f;var{COUNT:rr}=V;var W=class{constructor(e){this.keys=new Map,this.free=[],this.nextKeyValue=0,this.reset(e)}next(){return this.free.length>0?this.free.pop():this.nextKeyValue++}reset({from:e,to:t}){this.keys.forEach((r,o)=>{(o<e||o>=t)&&(this.free.push(r),this.keys.delete(o))});let n=t-e;this.keys.size+this.free.length>n&&(this.free.length=Math.max(0,n-this.keys.size));for(let r=e;r<t;r++)if(!this.keys.has(r)){let o=this.next();this.keys.set(r,o)}this.nextKeyValue>this.keys.size&&(this.nextKeyValue=this.keys.size)}keyFor(e){let t=this.keys.get(e);if(t===void 0)throw console.log(\\`key not found\n        keys: \\${this.toDebugString()}\n        free : \\${this.free.join(\",\")}  \n      \\`),Error(\\`KeySet, no key found for rowIndex \\${e}\\`);return t}toDebugString(){return Array.from(this.keys.entries()).map((e,t)=>\\`\\${e}=>\\${t}\\`).join(\",\")}};var{IDX:pr}=V;var{SELECTED:fr}=V,M={False:0,True:1,First:2,Last:4};var Rt=(s,e)=>e>=s[0]&&e<=s[1],Tt=M.True+M.First+M.Last,yt=M.True+M.First,St=M.True+M.Last,Q=(s,e)=>{for(let t of s)if(typeof t==\"number\"){if(t===e)return Tt}else if(Rt(t,e))return e===t[0]?yt:e===t[1]?St:M.True;return M.False};var Te=s=>{if(s.every(t=>typeof t==\"number\"))return s;let e=[];for(let t of s)if(typeof t==\"number\")e.push(t);else for(let n=t[0];n<=t[1];n++)e.push(n);return e};var wt=(()=>{let s=0,e=()=>\\`0000\\${(Math.random()*36**4<<0).toString(36)}\\`.slice(-4);return()=>(s+=1,\\`u\\${e()}\\${s}\\`)})();var{debug:Ks,debugEnabled:Qs,error:we,info:E,infoEnabled:vt,warn:P}=w(\"websocket-connection\"),Ee=\"ws\",It=s=>s.startsWith(Ee+\"://\")||s.startsWith(Ee+\"s://\"),xe={},Z=Symbol(\"setWebsocket\"),q=Symbol(\"connectionCallback\");async function ve(s,e,t,n=10,r=5){return xe[s]={status:\"connecting\",connect:{allowed:r,remaining:r},reconnect:{allowed:n,remaining:n}},Ie(s,e,t)}async function Y(s){throw Error(\"connection broken\")}async function Ie(s,e,t,n){let{status:r,connect:o,reconnect:i}=xe[s],u=r===\"connecting\"?o:i;try{t({type:\"connection-status\",status:\"connecting\"});let c=typeof n<\"u\",p=await Pt(s,e);console.info(\"%c\\u26A1 %cconnected\",\"font-size: 24px;color: green;font-weight: bold;\",\"color:green; font-size: 14px;\"),n!==void 0&&n[Z](p);let a=n!=null?n:new ee(p,s,e,t),l=c?\"reconnected\":\"connection-open-awaiting-session\";return t({type:\"connection-status\",status:l}),a.status=l,u.remaining=u.allowed,a}catch{let p=--u.remaining>0;if(t({type:\"connection-status\",status:\"disconnected\",reason:\"failed to connect\",retry:p}),p)return Dt(s,e,t,n,2e3);throw Error(\"Failed to establish connection\")}}var Dt=(s,e,t,n,r)=>new Promise(o=>{setTimeout(()=>{o(Ie(s,e,t,n))},r)}),Pt=(s,e)=>new Promise((t,n)=>{let r=It(s)?s:\\`wss://\\${s}\\`;vt&&e!==void 0&&E(\\`WebSocket Protocol \\${e==null?void 0:e.toString()}\\`);let o=new WebSocket(r,e);o.onopen=()=>t(o),o.onerror=i=>n(i)}),Ve=()=>{P==null||P(\"Connection cannot be closed, socket not yet opened\")},Me=s=>{P==null||P(\\`Message cannot be sent, socket closed \\${s.body.type}\\`)},Lt=s=>{try{return JSON.parse(s)}catch{throw Error(\\`Error parsing JSON response from server \\${s}\\`)}},ee=class{constructor(e,t,n,r){this.close=Ve;this.requiresLogin=!0;this.send=Me;this.status=\"ready\";this.messagesCount=0;this.connectionMetricsInterval=null;this.handleWebsocketMessage=e=>{let t=Lt(e.data);this.messagesCount+=1,this[q](t)};this.url=t,this.protocol=n,this[q]=r,this[Z](e)}reconnect(){Y(this)}[(q,Z)](e){let t=this[q];e.onmessage=o=>{this.status=\"connected\",e.onmessage=this.handleWebsocketMessage,this.handleWebsocketMessage(o)},this.connectionMetricsInterval=setInterval(()=>{t({type:\"connection-metrics\",messagesLength:this.messagesCount}),this.messagesCount=0},2e3),e.onerror=()=>{we(\"\\u26A1 connection error\"),t({type:\"connection-status\",status:\"disconnected\",reason:\"error\"}),this.connectionMetricsInterval&&(clearInterval(this.connectionMetricsInterval),this.connectionMetricsInterval=null),this.status===\"connection-open-awaiting-session\"?we(\"Websocket connection lost before Vuu session established, check websocket configuration\"):this.status!==\"closed\"&&(Y(this),this.send=r)},e.onclose=()=>{E==null||E(\"\\u26A1 connection close\"),t({type:\"connection-status\",status:\"disconnected\",reason:\"close\"}),this.connectionMetricsInterval&&(clearInterval(this.connectionMetricsInterval),this.connectionMetricsInterval=null),this.status!==\"closed\"&&(Y(this),this.send=r)};let n=o=>{e.send(JSON.stringify(o))},r=o=>{E==null||E(\\`TODO queue message until websocket reconnected \\${o.body.type}\\`)};this.send=n,this.close=()=>{this.status=\"closed\",e.close(),this.close=Ve,this.send=Me,E==null||E(\"close websocket\")}}};var _t=[\"VIEW_PORT_MENUS_SELECT_RPC\",\"VIEW_PORT_MENU_TABLE_RPC\",\"VIEW_PORT_MENU_ROW_RPC\",\"VIEW_PORT_MENU_CELL_RPC\",\"VP_EDIT_CELL_RPC\",\"VP_EDIT_ROW_RPC\",\"VP_EDIT_ADD_ROW_RPC\",\"VP_EDIT_DELETE_CELL_RPC\",\"VP_EDIT_DELETE_ROW_RPC\",\"VP_EDIT_SUBMIT_FORM_RPC\"],De=s=>_t.includes(s.type),Pe=s=>s.type===\"VIEW_PORT_RPC_CALL\",\\$=({requestId:s,...e})=>[s,e],Le=s=>{let e=s.at(0);if(e.updateType===\"SIZE\"){if(s.length===1)return s;e=s.at(1)}let t=s.at(-1);return[e,t]},_e=s=>{let e={};for(let t of s)(e[t.viewPortId]||(e[t.viewPortId]=[])).push(t);return e};var te=({columns:s,dataTypes:e,key:t,table:n})=>({table:n,columns:s.map((r,o)=>({name:r,serverDataType:e[o]})),key:t});var Oe=s=>s.type===\"connection-status\",ke=s=>s.type===\"connection-metrics\";var Ae=s=>\"viewport\"in s,Ue=s=>s.type===\"VIEW_PORT_MENU_RESP\"&&s.action!==null&&G(s.action.table),G=s=>s!==null&&typeof s==\"object\"&&\"table\"in s&&\"module\"in s?s.table.startsWith(\"session\"):!1;var Fe=\"CHANGE_VP_SUCCESS\";var Ne=\"CLOSE_TREE_NODE\",We=\"CLOSE_TREE_SUCCESS\";var qe=\"CREATE_VP\",\\$e=\"DISABLE_VP\",Ge=\"DISABLE_VP_SUCCESS\";var Be=\"ENABLE_VP\",He=\"ENABLE_VP_SUCCESS\";var ne=\"GET_VP_VISUAL_LINKS\",je=\"GET_VIEW_PORT_MENUS\";var ze=\"HB\",Je=\"HB_RESP\",Ke=\"LOGIN\",Qe=\"OPEN_TREE_NODE\",Xe=\"OPEN_TREE_SUCCESS\";var Ye=\"REMOVE_VP\";var Ze=\"SET_SELECTION_SUCCESS\";var tt=s=>{switch(s){case\"TypeAheadRpcHandler\":return\"TYPEAHEAD\";default:return\"SIMUL\"}};var nt=[],T=w(\"array-backed-moving-window\");function Ot(s,e){if(!e||e.data.length!==s.data.length||e.sel!==s.sel)return!1;for(let t=0;t<e.data.length;t++)if(e.data[t]!==s.data[t])return!1;return!0}var h,B=class{constructor({from:e,to:t},{from:n,to:r},o){k(this,h,void 0);this.setRowCount=e=>{var t;if((t=T.info)==null||t.call(T,\\`setRowCount \\${e}\\`),e<this.internalData.length&&(this.internalData.length=e),e<this.rowCount){this.rowsWithinRange=0;let n=Math.min(e,this.clientRange.to);for(let r=this.clientRange.from;r<n;r++){let o=r-d(this,h).from;this.internalData[o]!==void 0&&(this.rowsWithinRange+=1)}}this.rowCount=e};this.bufferBreakout=(e,t)=>{let n=this.bufferSize*.25;return d(this,h).to-t<n?!0:d(this,h).from>0&&e-d(this,h).from<n};this.bufferSize=o,this.clientRange=new v(e,t),ge(this,h,new v(n,r)),this.internalData=new Array(o),this.rowsWithinRange=0,this.rowCount=0}get range(){return d(this,h)}get hasAllRowsWithinRange(){return this.rowsWithinRange===this.clientRange.to-this.clientRange.from||this.rowCount>0&&this.clientRange.from+this.rowsWithinRange===this.rowCount}outOfRange(e,t){let{from:n,to:r}=this.range;if(t<n||e>=r)return!0}setAtIndex(e){let{rowIndex:t}=e,n=t-d(this,h).from;if(Ot(e,this.internalData[n]))return!1;let r=this.isWithinClientRange(t);return(r||this.isWithinRange(t))&&(!this.internalData[n]&&r&&(this.rowsWithinRange+=1),this.internalData[n]=e),r}getAtIndex(e){return d(this,h).isWithin(e)&&this.internalData[e-d(this,h).from]!=null?this.internalData[e-d(this,h).from]:void 0}isWithinRange(e){return d(this,h).isWithin(e)}isWithinClientRange(e){return this.clientRange.isWithin(e)}setClientRange(e,t){var p;(p=T.debug)==null||p.call(T,\\`setClientRange \\${e} - \\${t}\\`);let n=this.clientRange.from,r=Math.min(this.clientRange.to,this.rowCount);if(e===n&&t===r)return[!1,nt];let o=this.clientRange.copy();this.clientRange.from=e,this.clientRange.to=t,this.rowsWithinRange=0;for(let a=e;a<t;a++){let l=a-d(this,h).from;this.internalData[l]&&(this.rowsWithinRange+=1)}let i=nt,u=d(this,h).from;if(this.hasAllRowsWithinRange)if(t>o.to){let a=Math.max(e,o.to);i=this.internalData.slice(a-u,t-u)}else{let a=Math.min(o.from,t);i=this.internalData.slice(e-u,a-u)}return[this.bufferBreakout(e,t),i]}setRange(e,t){var n,r;if(e!==d(this,h).from||t!==d(this,h).to){(n=T.debug)==null||n.call(T,\\`setRange \\${e} - \\${t}\\`);let[o,i]=d(this,h).overlap(e,t),u=new Array(t-e);this.rowsWithinRange=0;for(let c=o;c<i;c++){let p=this.getAtIndex(c);if(p){let a=c-e;u[a]=p,this.isWithinClientRange(c)&&(this.rowsWithinRange+=1)}}this.internalData=u,d(this,h).from=e,d(this,h).to=t}else(r=T.debug)==null||r.call(T,\\`setRange \\${e} - \\${t} IGNORED because not changed\\`)}get data(){return this.internalData}getData(){var u;let{from:e,to:t}=d(this,h),{from:n,to:r}=this.clientRange,o=Math.max(0,n-e),i=Math.min(t-e,t,r-e,(u=this.rowCount)!=null?u:t);return this.internalData.slice(o,i)}clear(){var e;(e=T.debug)==null||e.call(T,\"clear\"),this.internalData.length=0,this.rowsWithinRange=0,this.setRowCount(0)}getCurrentDataRange(){let e=this.internalData,t=e.length,[n]=this.internalData,r=this.internalData[t-1];if(n&&r)return[n.rowIndex,r.rowIndex];for(let o=0;o<t;o++)if(e[o]!==void 0){n=e[o];break}for(let o=t-1;o>=0;o--)if(e[o]!==void 0){r=e[o];break}return n&&r?[n.rowIndex,r.rowIndex]:[-1,-1]}};h=new WeakMap;var kt=[],{debug:C,debugEnabled:H,error:At,info:g,infoEnabled:Ut,warn:L}=w(\"viewport\"),Ft=({rowKey:s,updateType:e})=>e===\"U\"&&!s.startsWith(\"\\$root\"),j=[void 0,void 0],Nt={count:0,mode:void 0,size:0,ts:0},z=class{constructor({aggregations:e,bufferSize:t=50,columns:n,filter:r,groupBy:o=[],table:i,range:u,sort:c,title:p,viewport:a,visualLink:l},m){this.batchMode=!0;this.hasUpdates=!1;this.pendingUpdates=[];this.pendingOperations=new Map;this.pendingRangeRequests=[];this.rowCountChanged=!1;this.selectedRows=[];this.useBatchMode=!0;this.lastUpdateStatus=Nt;this.updateThrottleTimer=void 0;this.rangeMonitor=new F(\"ViewPort\");this.disabled=!1;this.isTree=!1;this.status=\"\";this.suspended=!1;this.suspendTimer=null;this.setLastSizeOnlyUpdateSize=e=>{this.lastUpdateStatus.size=e};this.setLastUpdate=e=>{let{ts:t,mode:n}=this.lastUpdateStatus,r=0;if(n===e){let o=Date.now();this.lastUpdateStatus.count+=1,this.lastUpdateStatus.ts=o,r=t===0?0:o-t}else this.lastUpdateStatus.count=1,this.lastUpdateStatus.ts=0,r=0;return this.lastUpdateStatus.mode=e,r};this.rangeRequestAlreadyPending=e=>{let{bufferSize:t}=this,n=t*.25,{from:r}=e;for(let{from:o,to:i}of this.pendingRangeRequests)if(r>=o&&r<i){if(e.to+n<=i)return!0;r=i}return!1};this.sendThrottledSizeMessage=()=>{this.updateThrottleTimer=void 0,this.lastUpdateStatus.count=3,this.postMessageToClient({clientViewportId:this.clientViewportId,mode:\"size-only\",size:this.lastUpdateStatus.size,type:\"viewport-update\"})};this.shouldThrottleMessage=e=>{let t=this.setLastUpdate(e);return e===\"size-only\"&&t>0&&t<500&&this.lastUpdateStatus.count>3};this.throttleMessage=e=>this.shouldThrottleMessage(e)?(g==null||g(\"throttling updates setTimeout to 2000\"),this.updateThrottleTimer===void 0&&(this.updateThrottleTimer=setTimeout(this.sendThrottledSizeMessage,2e3)),!0):(this.updateThrottleTimer!==void 0&&(clearTimeout(this.updateThrottleTimer),this.updateThrottleTimer=void 0),!1);this.getNewRowCount=()=>{if(this.rowCountChanged&&this.dataWindow)return this.rowCountChanged=!1,this.dataWindow.rowCount};this.aggregations=e,this.bufferSize=t,this.clientRange=u,this.clientViewportId=a,this.columns=n,this.filter=r,this.groupBy=o,this.keys=new W(u),this.pendingLinkedParent=l,this.table=i,this.sort=c,this.title=p,Ut&&(g==null||g(\\`constructor #\\${a} \\${i.table} bufferSize=\\${t}\\`)),this.dataWindow=new B(this.clientRange,u,this.bufferSize),this.postMessageToClient=m}get hasUpdatesToProcess(){return this.suspended?!1:this.rowCountChanged||this.hasUpdates}get size(){var e;return(e=this.dataWindow.rowCount)!=null?e:0}subscribe(){let{filter:e}=this.filter;return this.status=this.status===\"subscribed\"?\"resubscribing\":\"subscribing\",{type:qe,table:this.table,range:K(this.clientRange,this.bufferSize),aggregations:this.aggregations,columns:this.columns,sort:this.sort,groupBy:this.groupBy,filterSpec:{filter:e}}}handleSubscribed({viewPortId:e,aggregations:t,columns:n,filterSpec:r,range:o,sort:i,groupBy:u},c){return this.serverViewportId=e,this.status=\"subscribed\",this.aggregations=t,this.columns=n,this.groupBy=u,this.isTree=u&&u.length>0,this.dataWindow.setRange(o.from,o.to),{aggregations:t,type:\"subscribed\",clientViewportId:this.clientViewportId,columns:n,filter:r,groupBy:u,range:o,sort:i,tableSchema:c}}awaitOperation(e,t){this.pendingOperations.set(e,t)}completeOperation(e,...t){var u;let{clientViewportId:n,pendingOperations:r}=this,o=r.get(e);if(!o){At(\\`no matching operation found to complete for requestId \\${e}\\`);return}let{type:i}=o;if(g==null||g(\\`completeOperation \\${i}\\`),r.delete(e),i===\"CHANGE_VP_RANGE\"){let[c,p]=t;(u=this.dataWindow)==null||u.setRange(c,p);for(let a=this.pendingRangeRequests.length-1;a>=0;a--){let l=this.pendingRangeRequests[a];if(l.requestId===e){l.acked=!0;break}else L==null||L(\"range requests sent faster than they are being ACKed\")}}else if(i===\"config\"){let{aggregations:c,columns:p,filter:a,groupBy:l,sort:m}=o.data;return this.aggregations=c,this.columns=p,this.filter=a,this.groupBy=l,this.sort=m,l.length>0?this.isTree=!0:this.isTree&&(this.isTree=!1),C==null||C(\\`config change confirmed, isTree : \\${this.isTree}\\`),{clientViewportId:n,type:i,config:o.data}}else{if(i===\"groupBy\")return this.isTree=o.data.length>0,this.groupBy=o.data,C==null||C(\\`groupBy change confirmed, isTree : \\${this.isTree}\\`),{clientViewportId:n,type:i,groupBy:o.data};if(i===\"columns\")return this.columns=o.data,{clientViewportId:n,type:i,columns:o.data};if(i===\"filter\")return this.filter=o.data,{clientViewportId:n,type:i,filter:o.data};if(i===\"aggregate\")return this.aggregations=o.data,{clientViewportId:n,type:\"aggregate\",aggregations:this.aggregations};if(i===\"sort\")return this.sort=o.data,{clientViewportId:n,type:i,sort:this.sort};if(i!==\"selection\"){if(i===\"disable\")return this.disabled=!0,{type:\"disabled\",clientViewportId:n};if(i===\"enable\")return this.disabled=!1,{type:\"enabled\",clientViewportId:n};if(i===\"CREATE_VISUAL_LINK\"){let[c,p,a]=t;return this.linkedParent={colName:c,parentViewportId:p,parentColName:a},this.pendingLinkedParent=void 0,{type:\"vuu-link-created\",clientViewportId:n,colName:c,parentViewportId:p,parentColName:a}}else if(i===\"REMOVE_VISUAL_LINK\")return this.linkedParent=void 0,{type:\"vuu-link-removed\",clientViewportId:n}}}}rangeRequest(e,t){H&&this.rangeMonitor.set(t);let n=\"CHANGE_VP_RANGE\";if(this.dataWindow){let[r,o]=this.dataWindow.setClientRange(t.from,t.to),i,u=this.dataWindow.rowCount||void 0,c=r&&!this.rangeRequestAlreadyPending(t)?{type:n,viewPortId:this.serverViewportId,...K(t,this.bufferSize,u)}:null;if(c){H&&(C==null||C(\\`create CHANGE_VP_RANGE: [\\${c.from} - \\${c.to}]\\`)),this.awaitOperation(e,{type:n});let a=this.pendingRangeRequests.at(-1);if(a)if(a.acked)console.warn(\"Range Request before previous request is filled\");else{let{from:l,to:m}=a;this.dataWindow.outOfRange(l,m)?i={clientViewportId:this.clientViewportId,type:\"debounce-begin\"}:L==null||L(\"Range Request before previous request is acked\")}this.pendingRangeRequests.push({...c,requestId:e}),this.useBatchMode&&(this.batchMode=!0)}else o.length>0&&(this.batchMode=!1);this.keys.reset(this.dataWindow.clientRange);let p=this.isTree?se:re;return o.length?[c,o.map(a=>p(a,this.keys,this.selectedRows))]:i?[c,void 0,i]:[c]}else return[null]}setLinks(e){return this.links=e,[{type:\"vuu-links\",links:e,clientViewportId:this.clientViewportId},this.pendingLinkedParent]}setMenu(e){return{type:\"vuu-menu\",menu:e,clientViewportId:this.clientViewportId}}openTreeNode(e,t){return this.useBatchMode&&(this.batchMode=!0),{type:Qe,vpId:this.serverViewportId,treeKey:t.key}}closeTreeNode(e,t){return this.useBatchMode&&(this.batchMode=!0),{type:Ne,vpId:this.serverViewportId,treeKey:t.key}}createLink(e,t,n,r){let o={type:\"CREATE_VISUAL_LINK\",parentVpId:n,childVpId:this.serverViewportId,parentColumnName:r,childColumnName:t};return this.awaitOperation(e,o),this.useBatchMode&&(this.batchMode=!0),o}removeLink(e){let t={type:\"REMOVE_VISUAL_LINK\",childVpId:this.serverViewportId};return this.awaitOperation(e,t),t}suspend(){this.suspended=!0,g==null||g(\"suspend\")}resume(){return this.suspended=!1,H&&(C==null||C(\\`resume: \\${this.currentData()}\\`)),[this.size,this.currentData()]}currentData(){let e=[];if(this.dataWindow){let t=this.dataWindow.getData(),{keys:n}=this,r=this.isTree?se:re;for(let o of t)o&&e.push(r(o,n,this.selectedRows))}return e}enable(e){return this.awaitOperation(e,{type:\"enable\"}),g==null||g(\\`enable: \\${this.serverViewportId}\\`),{type:Be,viewPortId:this.serverViewportId}}disable(e){return this.awaitOperation(e,{type:\"disable\"}),g==null||g(\\`disable: \\${this.serverViewportId}\\`),this.suspended=!1,{type:\\$e,viewPortId:this.serverViewportId}}columnRequest(e,t){return this.awaitOperation(e,{type:\"columns\",data:t}),C==null||C(\\`columnRequest: \\${t}\\`),this.createRequest({columns:t})}filterRequest(e,t){this.awaitOperation(e,{type:\"filter\",data:t}),this.useBatchMode&&(this.batchMode=!0);let{filter:n}=t;return g==null||g(\\`filterRequest: \\${n}\\`),this.createRequest({filterSpec:{filter:n}})}setConfig(e,t){this.awaitOperation(e,{type:\"config\",data:t});let{filter:n,...r}=t;return this.useBatchMode&&(this.batchMode=!0),H?C==null||C(\\`setConfig \\${JSON.stringify(t)}\\`):g==null||g(\"setConfig\"),this.createRequest({...r,filterSpec:typeof(n==null?void 0:n.filter)==\"string\"?{filter:n.filter}:{filter:\"\"}},!0)}aggregateRequest(e,t){return this.awaitOperation(e,{type:\"aggregate\",data:t}),g==null||g(\\`aggregateRequest: \\${t}\\`),this.createRequest({aggregations:t})}sortRequest(e,t){return this.awaitOperation(e,{type:\"sort\",data:t}),g==null||g(\\`sortRequest: \\${JSON.stringify(t.sortDefs)}\\`),this.createRequest({sort:t})}groupByRequest(e,t=kt){var n;return this.awaitOperation(e,{type:\"groupBy\",data:t}),this.useBatchMode&&(this.batchMode=!0),this.isTree||(n=this.dataWindow)==null||n.clear(),this.createRequest({groupBy:t})}selectRequest(e,t){return this.selectedRows=t,this.awaitOperation(e,{type:\"selection\",data:t}),g==null||g(\\`selectRequest: \\${t}\\`),{type:\"SET_SELECTION\",vpId:this.serverViewportId,selection:Te(t)}}removePendingRangeRequest(e,t){for(let n=this.pendingRangeRequests.length-1;n>=0;n--){let{from:r,to:o}=this.pendingRangeRequests[n],i=!0;if(e>=r&&e<o||t>r&&t<o){i||console.warn(\"removePendingRangeRequest TABLE_ROWS are not for latest request\"),this.pendingRangeRequests.splice(n,1);break}else i=!1}}updateRows(e){var r,o,i;let[t,n]=Le(e);if(t&&n&&this.removePendingRangeRequest(t.rowIndex,n.rowIndex),e.length===1)if(t.vpSize===0&&this.disabled){C==null||C(\\`ignore a SIZE=0 message on disabled viewport (\\${e.length} rows)\\`);return}else t.updateType===\"SIZE\"&&this.setLastSizeOnlyUpdateSize(t.vpSize);for(let u of e)this.isTree&&Ft(u)||((u.updateType===\"SIZE\"||((r=this.dataWindow)==null?void 0:r.rowCount)!==u.vpSize)&&((o=this.dataWindow)==null||o.setRowCount(u.vpSize),this.rowCountChanged=!0),u.updateType===\"U\"&&(i=this.dataWindow)!=null&&i.setAtIndex(u)&&(this.hasUpdates=!0,this.batchMode||this.pendingUpdates.push(u)))}getClientRows(){let e,t=\"size-only\";if(!this.hasUpdates&&!this.rowCountChanged)return j;if(this.hasUpdates){let{keys:n,selectedRows:r}=this,o=this.isTree?se:re;if(this.updateThrottleTimer&&(self.clearTimeout(this.updateThrottleTimer),this.updateThrottleTimer=void 0),this.pendingUpdates.length>0){e=[],t=\"update\";for(let i of this.pendingUpdates)e.push(o(i,n,r));this.pendingUpdates.length=0}else{let i=this.dataWindow.getData();if(this.dataWindow.hasAllRowsWithinRange){e=[],t=\"batch\";for(let u of i)e.push(o(u,n,r));this.batchMode=!1}}this.hasUpdates=!1}return this.throttleMessage(t)?j:[e,t]}createRequest(e,t=!1){return t?{type:\"CHANGE_VP\",viewPortId:this.serverViewportId,...e}:{type:\"CHANGE_VP\",viewPortId:this.serverViewportId,aggregations:this.aggregations,columns:this.columns,sort:this.sort,groupBy:this.groupBy,filterSpec:{filter:this.filter.filter},...e}}},re=({rowIndex:s,rowKey:e,sel:t,data:n},r,o)=>[s,r.keyFor(s),!0,!1,0,0,e,t?Q(o,s):0].concat(n),se=({rowIndex:s,rowKey:e,sel:t,data:n},r,o)=>{let[i,u,,c,,p,...a]=n;return[s,r.keyFor(s),c,u,i,p,e,t?Q(o,s):0].concat(a)};var rt=1;var{debug:x,debugEnabled:oe,error:_,info:S,infoEnabled:Wt,warn:ie}=w(\"server-proxy\"),b=()=>\\`\\${rt++}\\`,qt={},\\$t=s=>s.disabled!==!0&&s.suspended!==!0,Gt={type:\"NO_ACTION\"},Bt=(s,e,t)=>s.map(n=>n.parentVpId===e?{...n,label:t}:n);function Ht(s,e){return s.map(t=>{let{parentVpId:n}=t,r=e.get(n);if(r)return{...t,parentClientVpId:r.clientViewportId,label:r.title};throw Error(\"addLabelsToLinks viewport not found\")})}var J=class{constructor(e,t){this.authToken=\"\";this.user=\"user\";this.pendingRequests=new Map;this.queuedRequests=[];this.cachedTableMetaRequests=new Map;this.cachedTableSchemas=new Map;this.connection=e,this.postMessageToClient=t,this.viewports=new Map,this.mapClientToServerViewport=new Map}async reconnect(){await this.login(this.authToken);let[e,t]=fe(Array.from(this.viewports.values()),\\$t);this.viewports.clear(),this.mapClientToServerViewport.clear();let n=r=>{r.forEach(o=>{let{clientViewportId:i}=o;this.viewports.set(i,o),this.sendMessageToServer(o.subscribe(),i)})};n(e),setTimeout(()=>{n(t)},2e3)}async login(e,t=\"user\"){if(e)return this.authToken=e,this.user=t,new Promise((n,r)=>{this.sendMessageToServer({type:Ke,token:this.authToken,user:t},\"\"),this.pendingLogin={resolve:n,reject:r}});this.authToken===\"\"&&_(\"login, cannot login until auth token has been obtained\")}subscribe(e){if(this.mapClientToServerViewport.has(e.viewport))_(\\`spurious subscribe call \\${e.viewport}\\`);else{let t=this.getTableMeta(e.table),n=new z(e,this.postMessageToClient);this.viewports.set(e.viewport,n);let r=this.awaitResponseToMessage(n.subscribe(),e.viewport);Promise.all([r,t]).then(([i,u])=>{let{viewPortId:c}=i,{status:p}=n;e.viewport!==c&&(this.viewports.delete(e.viewport),this.viewports.set(c,n)),this.mapClientToServerViewport.set(e.viewport,c);let a=n.handleSubscribed(i,u);a&&(this.postMessageToClient(a),oe&&x(\\`post DataSourceSubscribedMessage to client: \\${JSON.stringify(a)}\\`)),n.disabled&&this.disableViewport(n),this.queuedRequests.length>0&&this.processQueuedRequests(),p===\"subscribing\"&&!G(n.table)&&(this.sendMessageToServer({type:ne,vpId:c}),this.sendMessageToServer({type:je,vpId:c}),Array.from(this.viewports.entries()).filter(([l,{disabled:m}])=>l!==c&&!m).forEach(([l])=>{this.sendMessageToServer({type:ne,vpId:l})}))})}}processQueuedRequests(){let e={};for(;this.queuedRequests.length;){let t=this.queuedRequests.pop();if(t){let{clientViewportId:n,message:r,requestId:o}=t;if(r.type===\"CHANGE_VP_RANGE\"){if(e.CHANGE_VP_RANGE)continue;e.CHANGE_VP_RANGE=!0;let i=this.mapClientToServerViewport.get(n);i&&this.sendMessageToServer({...r,viewPortId:i},o)}}}}unsubscribe(e){let t=this.mapClientToServerViewport.get(e);t?(S==null||S(\\`Unsubscribe Message (Client to Server):\n        \\${t}\\`),this.sendMessageToServer({type:Ye,viewPortId:t})):_(\\`failed to unsubscribe client viewport \\${e}, viewport not found\\`)}getViewportForClient(e,t=!0){let n=this.mapClientToServerViewport.get(e);if(n){let r=this.viewports.get(n);if(r)return r;if(t)throw Error(\\`Viewport not found for client viewport \\${e}\\`);return null}else{if(this.viewports.has(e))return this.viewports.get(e);if(t)throw Error(\\`Viewport server id not found for client viewport \\${e}\\`);return null}}setViewRange(e,t){let n=b(),[r,o,i]=e.rangeRequest(n,t.range);S==null||S(\\`setViewRange \\${t.range.from} - \\${t.range.to}\\`),r&&(this.sendIfReady(r,n,e.status===\"subscribed\")||this.queuedRequests.push({clientViewportId:t.viewport,message:r,requestId:n})),o?(S==null||S(\\`setViewRange \\${o.length} rows returned from cache\\`),this.postMessageToClient({mode:\"batch\",type:\"viewport-update\",clientViewportId:e.clientViewportId,rows:o})):i&&this.postMessageToClient(i)}setConfig(e,t){let n=b(),r=e.setConfig(n,t.config);this.sendIfReady(r,n,e.status===\"subscribed\")}aggregate(e,t){let n=b(),r=e.aggregateRequest(n,t.aggregations);this.sendIfReady(r,n,e.status===\"subscribed\")}sort(e,t){let n=b(),r=e.sortRequest(n,t.sort);this.sendIfReady(r,n,e.status===\"subscribed\")}groupBy(e,t){let n=b(),r=e.groupByRequest(n,t.groupBy);this.sendIfReady(r,n,e.status===\"subscribed\")}filter(e,t){let n=b(),{filter:r}=t,o=e.filterRequest(n,r);this.sendIfReady(o,n,e.status===\"subscribed\")}setColumns(e,t){let n=b(),{columns:r}=t,o=e.columnRequest(n,r);this.sendIfReady(o,n,e.status===\"subscribed\")}setTitle(e,t){e&&(e.title=t.title,this.updateTitleOnVisualLinks(e))}select(e,t){let n=b(),{selected:r}=t,o=e.selectRequest(n,r);this.sendIfReady(o,n,e.status===\"subscribed\")}disableViewport(e){let t=b(),n=e.disable(t);this.sendIfReady(n,t,e.status===\"subscribed\")}enableViewport(e){if(e.disabled){let t=b(),n=e.enable(t);this.sendIfReady(n,t,e.status===\"subscribed\")}}suspendViewport(e){e.suspend(),e.suspendTimer=setTimeout(()=>{S==null||S(\"suspendTimer expired, escalate suspend to disable\"),this.disableViewport(e)},3e3)}resumeViewport(e){e.suspendTimer&&(x==null||x(\"clear suspend timer\"),clearTimeout(e.suspendTimer),e.suspendTimer=null);let[t,n]=e.resume();x==null||x(\\`resumeViewport size \\${t}, \\${n.length} rows sent to client\\`),this.postMessageToClient({clientViewportId:e.clientViewportId,mode:\"batch\",rows:n,size:t,type:\"viewport-update\"})}openTreeNode(e,t){if(e.serverViewportId){let n=b();this.sendIfReady(e.openTreeNode(n,t),n,e.status===\"subscribed\")}}closeTreeNode(e,t){if(e.serverViewportId){let n=b();this.sendIfReady(e.closeTreeNode(n,t),n,e.status===\"subscribed\")}}createLink(e,t){let{parentClientVpId:n,parentColumnName:r,childColumnName:o}=t,i=b(),u=this.mapClientToServerViewport.get(n);if(u){let c=e.createLink(i,o,u,r);this.sendMessageToServer(c,i)}else _(\"ServerProxy unable to create link, viewport not found\")}removeLink(e){let t=b(),n=e.removeLink(t);this.sendMessageToServer(n,t)}updateTitleOnVisualLinks(e){var r;let{serverViewportId:t,title:n}=e;for(let o of this.viewports.values())if(o!==e&&o.links&&t&&n&&(r=o.links)!=null&&r.some(i=>i.parentVpId===t)){let[i]=o.setLinks(Bt(o.links,t,n));this.postMessageToClient(i)}}removeViewportFromVisualLinks(e){var t;for(let n of this.viewports.values())if((t=n.links)!=null&&t.some(({parentVpId:r})=>r===e)){let[r]=n.setLinks(n.links.filter(({parentVpId:o})=>o!==e));this.postMessageToClient(r)}}menuRpcCall(e){let t=this.getViewportForClient(e.vpId,!1);if(t!=null&&t.serverViewportId){let[n,r]=\\$(e);this.sendMessageToServer({...r,vpId:t.serverViewportId},n)}}viewportRpcCall(e){let t=this.getViewportForClient(e.vpId,!1);if(t!=null&&t.serverViewportId){let[n,r]=\\$(e);this.sendMessageToServer({...r,vpId:t.serverViewportId,namedParams:{}},n)}}rpcCall(e){let[t,n]=\\$(e),r=tt(n.service);this.sendMessageToServer(n,t,{module:r})}handleMessageFromClient(e){var t;if(Ae(e))if(e.type===\"disable\"){let n=this.getViewportForClient(e.viewport,!1);return n!==null?this.disableViewport(n):void 0}else{let n=this.getViewportForClient(e.viewport);switch(e.type){case\"setViewRange\":return this.setViewRange(n,e);case\"config\":return this.setConfig(n,e);case\"aggregate\":return this.aggregate(n,e);case\"sort\":return this.sort(n,e);case\"groupBy\":return this.groupBy(n,e);case\"filter\":return this.filter(n,e);case\"select\":return this.select(n,e);case\"suspend\":return this.suspendViewport(n);case\"resume\":return this.resumeViewport(n);case\"enable\":return this.enableViewport(n);case\"openTreeNode\":return this.openTreeNode(n,e);case\"closeTreeNode\":return this.closeTreeNode(n,e);case\"createLink\":return this.createLink(n,e);case\"removeLink\":return this.removeLink(n);case\"setColumns\":return this.setColumns(n,e);case\"setTitle\":return this.setTitle(n,e);default:}}else{if(Pe(e))return this.viewportRpcCall(e);if(De(e))return this.menuRpcCall(e);{let{type:n,requestId:r}=e;switch(n){case\"GET_TABLE_LIST\":{(t=this.tableList)!=null||(this.tableList=this.awaitResponseToMessage({type:n},r)),this.tableList.then(o=>{this.postMessageToClient({type:\"TABLE_LIST_RESP\",tables:o.tables,requestId:r})});return}case\"GET_TABLE_META\":{this.getTableMeta(e.table,r).then(o=>{o&&this.postMessageToClient({type:\"TABLE_META_RESP\",tableSchema:o,requestId:r})});return}case\"RPC_CALL\":return this.rpcCall(e);default:}}}_(\\`Vuu ServerProxy Unexpected message from client \\${JSON.stringify(e)}\\`)}getTableMeta(e,t=b()){if(G(e))return Promise.resolve(void 0);let n=\\`\\${e.module}:\\${e.table}\\`,r=this.cachedTableMetaRequests.get(n);return r||(r=this.awaitResponseToMessage({type:\"GET_TABLE_META\",table:e},t),this.cachedTableMetaRequests.set(n,r)),r==null?void 0:r.then(o=>this.cacheTableMeta(o))}awaitResponseToMessage(e,t=b()){return new Promise((n,r)=>{this.sendMessageToServer(e,t),this.pendingRequests.set(t,{reject:r,resolve:n})})}sendIfReady(e,t,n=!0){return n&&this.sendMessageToServer(e,t),n}sendMessageToServer(e,t=\\`\\${rt++}\\`,n=qt){let{module:r=\"CORE\"}=n;this.authToken&&this.connection.send({requestId:t,sessionId:this.sessionId,token:this.authToken,user:this.user,module:r,body:e})}handleMessageFromServer(e){var u;let{body:t,requestId:n,sessionId:r}=e,o=this.pendingRequests.get(n);if(o){let{resolve:a}=o;this.pendingRequests.delete(n),a(t);return}let{viewports:i}=this;switch(t.type){case ze:this.sendMessageToServer({type:Je,ts:+new Date},\"NA\");break;case\"LOGIN_SUCCESS\":if(r)this.sessionId=r,(u=this.pendingLogin)==null||u.resolve(r),this.pendingLogin=void 0;else throw Error(\"LOGIN_SUCCESS did not provide sessionId\");break;case\"REMOVE_VP_SUCCESS\":{let a=i.get(t.viewPortId);a&&(this.mapClientToServerViewport.delete(a.clientViewportId),i.delete(t.viewPortId),this.removeViewportFromVisualLinks(t.viewPortId))}break;case Ze:{let a=this.viewports.get(t.vpId);a&&a.completeOperation(n)}break;case Fe:case Ge:if(i.has(t.viewPortId)){let a=this.viewports.get(t.viewPortId);if(a){let l=a.completeOperation(n);l!==void 0&&(this.postMessageToClient(l),oe&&x(\\`postMessageToClient \\${JSON.stringify(l)}\\`))}}break;case He:{let a=this.viewports.get(t.viewPortId);if(a){let l=a.completeOperation(n);if(l){this.postMessageToClient(l);let[m,y]=a.resume();this.postMessageToClient({clientViewportId:a.clientViewportId,mode:\"batch\",rows:y,size:m,type:\"viewport-update\"})}}}break;case\"TABLE_ROW\":{let a=_e(t.rows);for(let[l,m]of Object.entries(a)){let y=i.get(l);y?y.updateRows(m):ie==null||ie(\\`TABLE_ROW message received for non registered viewport \\${l}\\`)}this.processUpdates()}break;case\"CHANGE_VP_RANGE_SUCCESS\":{let a=this.viewports.get(t.viewPortId);if(a){let{from:l,to:m}=t;a.completeOperation(n,l,m)}}break;case Xe:case We:break;case\"CREATE_VISUAL_LINK_SUCCESS\":{let a=this.viewports.get(t.childVpId),l=this.viewports.get(t.parentVpId);if(a&&l){let{childColumnName:m,parentColumnName:y}=t,O=a.completeOperation(n,m,l.clientViewportId,y);O&&this.postMessageToClient(O)}}break;case\"REMOVE_VISUAL_LINK_SUCCESS\":{let a=this.viewports.get(t.childVpId);if(a){let l=a.completeOperation(n);l&&this.postMessageToClient(l)}}break;case\"VP_VISUAL_LINKS_RESP\":{let a=this.getActiveLinks(t.links),l=this.viewports.get(t.vpId);if(a.length&&l){let m=Ht(a,this.viewports),[y,O]=l.setLinks(m);if(this.postMessageToClient(y),O){let{link:le,parentClientVpId:st}=O,ce=b(),pe=this.mapClientToServerViewport.get(st);if(pe){let ot=l.createLink(ce,le.fromColumn,pe,le.toColumn);this.sendMessageToServer(ot,ce)}}}}break;case\"VIEW_PORT_MENUS_RESP\":if(t.menu.name){let a=this.viewports.get(t.vpId);if(a){let l=a.setMenu(t.menu);this.postMessageToClient(l)}}break;case\"VP_EDIT_RPC_RESPONSE\":this.postMessageToClient({action:t.action,requestId:n,rpcName:t.rpcName,type:\"VP_EDIT_RPC_RESPONSE\"});break;case\"VP_EDIT_RPC_REJECT\":this.viewports.get(t.vpId)&&this.postMessageToClient({requestId:n,type:\"VP_EDIT_RPC_REJECT\",error:t.error});break;case\"VIEW_PORT_MENU_REJ\":{console.log(\"send menu error back to client\");let{error:a,rpcName:l,vpId:m}=t,y=this.viewports.get(m);y&&this.postMessageToClient({clientViewportId:y.clientViewportId,error:a,rpcName:l,type:\"VIEW_PORT_MENU_REJ\",requestId:n});break}case\"VIEW_PORT_MENU_RESP\":if(Ue(t)){let{action:a,rpcName:l}=t;this.awaitResponseToMessage({type:\"GET_TABLE_META\",table:a.table}).then(m=>{let y=te(m);this.postMessageToClient({rpcName:l,type:\"VIEW_PORT_MENU_RESP\",action:{...a,tableSchema:y},tableAlreadyOpen:this.isTableOpen(a.table),requestId:n})})}else{let{action:a}=t;this.postMessageToClient({type:\"VIEW_PORT_MENU_RESP\",action:a||Gt,tableAlreadyOpen:a!==null&&this.isTableOpen(a.table),requestId:n})}break;case\"RPC_RESP\":{let{method:a,result:l}=t;this.postMessageToClient({type:\"RPC_RESP\",method:a,result:l,requestId:n})}break;case\"VIEW_PORT_RPC_REPONSE\":{let{method:a,action:l}=t;this.postMessageToClient({type:\"VIEW_PORT_RPC_RESPONSE\",rpcName:a,action:l,requestId:n})}break;case\"ERROR\":_(t.msg);break;default:Wt&&S(\\`handleMessageFromServer \\${t.type}.\\`)}}cacheTableMeta(e){let{module:t,table:n}=e.table,r=\\`\\${t}:\\${n}\\`,o=this.cachedTableSchemas.get(r);return o||(o=te(e),this.cachedTableSchemas.set(r,o)),o}isTableOpen(e){if(e){let t=e.table;for(let n of this.viewports.values())if(!n.suspended&&n.table.table===t)return!0}}getActiveLinks(e){return e.filter(t=>{let n=this.viewports.get(t.parentVpId);return n&&!n.suspended})}processUpdates(){this.viewports.forEach(e=>{var t;if(e.hasUpdatesToProcess){let n=e.getClientRows();if(n!==j){let[r,o]=n,i=e.getNewRowCount();(i!==void 0||r&&r.length>0)&&(oe&&x(\\`postMessageToClient #\\${e.clientViewportId} viewport-update \\${o}, \\${(t=r==null?void 0:r.length)!=null?t:\"no\"} rows, size \\${i}\\`),o&&this.postMessageToClient({clientViewportId:e.clientViewportId,mode:o,rows:r,size:i,type:\"viewport-update\"}))}}})}};var D,{info:ae,infoEnabled:ue}=w(\"worker\");async function jt(s,e,t,n,r,o,i){let u=await ve(s,e,c=>{ke(c)?postMessage({type:\"connection-metrics\",messages:c}):Oe(c)?(r(c),c.status===\"reconnected\"&&D.reconnect()):D.handleMessageFromServer(c)},o,i);D=new J(u,c=>zt(c)),u.requiresLogin&&await D.login(t,n)}function zt(s){postMessage(s)}var Jt=async({data:s})=>{switch(s.type){case\"connect\":await jt(s.url,s.protocol,s.token,s.username,postMessage,s.retryLimitDisconnect,s.retryLimitStartup),postMessage({type:\"connected\"});break;case\"subscribe\":ue&&ae(\\`client subscribe: \\${JSON.stringify(s)}\\`),D.subscribe(s);break;case\"unsubscribe\":ue&&ae(\\`client unsubscribe: \\${JSON.stringify(s)}\\`),D.unsubscribe(s.viewport);break;default:ue&&ae(\\`client message: \\${JSON.stringify(s)}\\`),D.handleMessageFromClient(s)}};self.addEventListener(\"message\",Jt);postMessage({type:\"ready\"});\n\n`;", "import {\n  ClientToServerMenuRPC,\n  ClientToServerTableList,\n  ClientToServerTableMeta,\n  ClientToServerViewportRpcCall,\n  VuuRpcRequest,\n  VuuTable,\n  VuuTableList,\n} from \"@vuu-ui/vuu-protocol-types\";\nimport {\n  EventEmitter,\n  getLoggingConfigForWorker,\n  uuid,\n} from \"@vuu-ui/vuu-utils\";\nimport {\n  DataSourceCallbackMessage,\n  shouldMessageBeRoutedToDataSource as messageShouldBeRoutedToDataSource,\n} from \"./data-source\";\nimport * as Message from \"./server-proxy/messages\";\nimport {\n  ConnectionStatusMessage,\n  isConnectionQualityMetrics,\n  isConnectionStatusMessage,\n  isTableSchema,\n  messageHasResult,\n  ServerProxySubscribeMessage,\n  VuuUIMessageIn,\n  VuuUIMessageInRPC,\n  VuuUIMessageInTableList,\n  VuuUIMessageInTableMeta,\n  VuuUIMessageOut,\n} from \"./vuuUIMessageTypes\";\n\n// Note: inlined-worker is a generated file, it must be built\nimport { workerSourceCode } from \"./inlined-worker\";\nimport { ConnectionQualityMetrics } from \"./vuuUIMessageTypes\";\nimport { WebSocketProtocol } from \"./websocket-connection\";\nimport { TableSchema } from \"./message-utils\";\n\nconst workerBlob = new Blob([getLoggingConfigForWorker() + workerSourceCode], {\n  type: \"text/javascript\",\n});\nconst workerBlobUrl = URL.createObjectURL(workerBlob);\n\ntype WorkerResolver = {\n  resolve: (value: Worker | PromiseLike<Worker>) => void;\n};\n\nlet worker: Worker;\nlet pendingWorker: Promise<Worker>;\nconst pendingWorkerNoToken: WorkerResolver[] = [];\n\nlet resolveServer: (server: ServerAPI) => void;\nlet rejectServer: (err: unknown) => void;\n\nconst serverAPI = new Promise<ServerAPI>((resolve, reject) => {\n  resolveServer = resolve;\n  rejectServer = reject;\n});\n\nexport const getServerAPI = () => serverAPI;\n\nexport type PostMessageToClientCallback = (\n  msg: DataSourceCallbackMessage\n) => void;\n\nconst viewports = new Map<\n  string,\n  {\n    postMessageToClientDataSource: PostMessageToClientCallback;\n    request: ServerProxySubscribeMessage;\n    status: \"subscribing\";\n  }\n>();\nconst pendingRequests = new Map();\n\ntype WorkerOptions = {\n  protocol: WebSocketProtocol;\n  retryLimitDisconnect?: number;\n  retryLimitStartup?: number;\n  url: string;\n  token?: string;\n  username: string | undefined;\n  handleConnectionStatusChange: (msg: {\n    data: ConnectionStatusMessage;\n  }) => void;\n};\n\n// We do not resolve the worker until we have a connection, but we will get\n// connection status messages before that, so we forward them to caller\n// while they wait for worker.\nconst getWorker = async ({\n  handleConnectionStatusChange,\n  protocol,\n  retryLimitDisconnect,\n  retryLimitStartup,\n  token = \"\",\n  username,\n  url,\n}: WorkerOptions) => {\n  if (token === \"\" && pendingWorker === undefined) {\n    return new Promise<Worker>((resolve) => {\n      pendingWorkerNoToken.push({ resolve });\n    });\n  }\n  //FIXME If we have a pending request already and a new request arrives with a DIFFERENT\n  // token, this would cause us to ignore the new request and ultimately resolve it with\n  // the original request.\n  return (\n    pendingWorker ||\n    // we get this far when we receive the first request with auth token\n    (pendingWorker = new Promise((resolve) => {\n      const worker = new Worker(workerBlobUrl);\n\n      const timer: number | null = window.setTimeout(() => {\n        console.error(\"timed out waiting for worker to load\");\n      }, 1000);\n\n      // This is the inial message handler only, it processes messages whilst we are\n      // establishing a connection. When we resolve the worker, a runtime message\n      // handler will replace this (see below)\n      worker.onmessage = (msg: MessageEvent<VuuUIMessageIn>) => {\n        const { data: message } = msg;\n        if (message.type === \"ready\") {\n          window.clearTimeout(timer);\n          worker.postMessage({\n            protocol,\n            retryLimitDisconnect,\n            retryLimitStartup,\n            token,\n            type: \"connect\",\n            url,\n            username,\n          });\n        } else if (message.type === \"connected\") {\n          worker.onmessage = handleMessageFromWorker;\n          resolve(worker);\n          for (const pendingWorkerRequest of pendingWorkerNoToken) {\n            pendingWorkerRequest.resolve(worker);\n          }\n          pendingWorkerNoToken.length = 0;\n        } else if (isConnectionStatusMessage(message)) {\n          handleConnectionStatusChange({ data: message });\n        } else {\n          console.warn(\"ConnectionManager: Unexpected message from the worker\");\n        }\n      };\n      // TODO handle error\n    }))\n  );\n};\n\nfunction handleMessageFromWorker({\n  data: message,\n}: MessageEvent<VuuUIMessageIn | DataSourceCallbackMessage>) {\n  if (messageShouldBeRoutedToDataSource(message)) {\n    const viewport = viewports.get(message.clientViewportId);\n    if (viewport) {\n      viewport.postMessageToClientDataSource(message);\n    } else {\n      console.error(\n        `[ConnectionManager] ${message.type} message received, viewport not found`\n      );\n    }\n  } else if (isConnectionStatusMessage(message)) {\n    ConnectionManager.emit(\"connection-status\", message);\n  } else if (isConnectionQualityMetrics(message)) {\n    ConnectionManager.emit(\"connection-metrics\", message);\n  } else {\n    const requestId = (message as VuuUIMessageInRPC).requestId;\n    if (pendingRequests.has(requestId)) {\n      const { resolve } = pendingRequests.get(requestId);\n      pendingRequests.delete(requestId);\n      const {\n        type: _1,\n        requestId: _2,\n        ...rest\n      } = message as\n        | VuuUIMessageInRPC\n        | VuuUIMessageInTableList\n        | VuuUIMessageInTableMeta;\n\n      if (messageHasResult(message)) {\n        resolve(message.result);\n      } else if (\n        message.type === \"VP_EDIT_RPC_RESPONSE\" ||\n        message.type === \"VP_EDIT_RPC_REJECT\"\n      ) {\n        resolve(message);\n      } else if (isTableSchema(message)) {\n        resolve(message.tableSchema);\n      } else {\n        resolve(rest);\n      }\n    } else {\n      console.warn(\n        \"%cConnectionManager Unexpected message from the worker\",\n        \"color:red;font-weight:bold;\"\n      );\n    }\n  }\n}\n\nconst asyncRequest = <T = unknown>(\n  msg:\n    | VuuRpcRequest\n    | ClientToServerMenuRPC\n    | ClientToServerTableList\n    | ClientToServerTableMeta\n    | ClientToServerViewportRpcCall\n): Promise<T> => {\n  const requestId = uuid();\n  worker.postMessage({\n    requestId,\n    ...msg,\n  });\n  return new Promise((resolve, reject) => {\n    pendingRequests.set(requestId, { resolve, reject });\n  });\n};\n\nexport interface ServerAPI {\n  destroy: (viewportId?: string) => void;\n  getTableSchema: (table: VuuTable) => Promise<TableSchema>;\n  getTableList: () => Promise<VuuTableList>;\n  rpcCall: <T = unknown>(\n    msg: VuuRpcRequest | ClientToServerMenuRPC | ClientToServerViewportRpcCall\n  ) => Promise<T>;\n  send: (message: VuuUIMessageOut) => void;\n  subscribe: (\n    message: ServerProxySubscribeMessage,\n    callback: PostMessageToClientCallback\n  ) => void;\n  unsubscribe: (viewport: string) => void;\n}\n\nconst connectedServerAPI: ServerAPI = {\n  subscribe: (message, callback) => {\n    if (viewports.get(message.viewport)) {\n      throw Error(\n        `ConnectionManager attempting to subscribe with an existing viewport id`\n      );\n    }\n    // TODO we never use this status\n    viewports.set(message.viewport, {\n      status: \"subscribing\",\n      request: message,\n      postMessageToClientDataSource: callback,\n    });\n    worker.postMessage({ type: \"subscribe\", ...message });\n  },\n\n  unsubscribe: (viewport) => {\n    worker.postMessage({ type: \"unsubscribe\", viewport });\n  },\n\n  send: (message) => {\n    worker.postMessage(message);\n  },\n\n  destroy: (viewportId?: string) => {\n    if (viewportId && viewports.has(viewportId)) {\n      viewports.delete(viewportId);\n    }\n  },\n\n  rpcCall: async <T = unknown>(\n    message:\n      | VuuRpcRequest\n      | ClientToServerMenuRPC\n      | ClientToServerViewportRpcCall\n  ) => asyncRequest<T>(message),\n\n  getTableList: async () =>\n    asyncRequest<VuuTableList>({ type: \"GET_TABLE_LIST\" }),\n\n  getTableSchema: async (table) =>\n    asyncRequest<TableSchema>({\n      type: Message.GET_TABLE_META,\n      table,\n    }),\n};\n\nexport type ConnectionEvents = {\n  \"connection-status\": (message: ConnectionStatusMessage) => void;\n  \"connection-metrics\": (message: ConnectionQualityMetrics) => void;\n};\n\nexport type ConnectOptions = {\n  url: string;\n  authToken?: string;\n  username?: string;\n  protocol?: WebSocketProtocol;\n  /** Max number of reconnect attempts in the event of unsuccessful websocket connection at startup */\n  retryLimitStartup?: number;\n  /** Max number of reconnect attempts in the event of a disconnected websocket connection */\n  retryLimitDisconnect?: number;\n};\n\nclass _ConnectionManager extends EventEmitter<ConnectionEvents> {\n  // The first request must have the token. We can change this to block others until\n  // the request with token is received.\n  async connect({\n    url,\n    authToken,\n    username,\n    protocol,\n    retryLimitDisconnect,\n    retryLimitStartup,\n  }: ConnectOptions): Promise<ServerAPI> {\n    // By passing handleMessageFromWorker here, we can get connection status\n    //messages while we wait for worker to resolve.\n    worker = await getWorker({\n      protocol,\n      url,\n      token: authToken,\n      username,\n      retryLimitDisconnect,\n      retryLimitStartup,\n      // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n      // @ts-ignore\n      handleConnectionStatusChange: handleMessageFromWorker,\n    });\n    return connectedServerAPI;\n  }\n\n  destroy() {\n    worker.terminate();\n  }\n}\n\nexport const ConnectionManager = new _ConnectionManager();\n\n/**\n * Open a connection to the VuuServer. This method opens the websocket connection\n * and logs in. It can be called from whichever client code has access to the auth\n * token (eg. the login page, or just a hardcoded login script in a sample).\n * This will unblock any DataSources which may have already tried to subscribe to data,\n * but lacked access to the auth token.\n *\n * @param serverUrl\n * @param token\n */\nexport const connectToServer = async ({\n  url,\n  protocol = undefined,\n  authToken,\n  username,\n  retryLimitDisconnect,\n  retryLimitStartup,\n}: ConnectOptions) => {\n  try {\n    const serverAPI = await ConnectionManager.connect({\n      protocol,\n      url,\n      authToken,\n      username,\n      retryLimitDisconnect,\n      retryLimitStartup,\n    });\n    resolveServer(serverAPI);\n  } catch (err: unknown) {\n    console.error(\"Connection Error\", err);\n    rejectServer(err);\n  }\n};\n\nexport const makeRpcCall = async <T = unknown>(rpcRequest: VuuRpcRequest) => {\n  try {\n    return (await serverAPI).rpcCall<T>(rpcRequest);\n  } catch (err) {\n    throw Error(\"Error accessing server api\");\n  }\n};\n", "// FIXME profile adding a per-Tree TreeNode cache, validating it by\n// parent pointer\n/// The default maximum length of a `TreeBuffer` node.\nconst DefaultBufferLength = 1024;\nlet nextPropID = 0;\nclass Range {\n    constructor(from, to) {\n        this.from = from;\n        this.to = to;\n    }\n}\n/// Each [node type](#common.NodeType) or [individual tree](#common.Tree)\n/// can have metadata associated with it in props. Instances of this\n/// class represent prop names.\nclass NodeProp {\n    /// Create a new node prop type.\n    constructor(config = {}) {\n        this.id = nextPropID++;\n        this.perNode = !!config.perNode;\n        this.deserialize = config.deserialize || (() => {\n            throw new Error(\"This node type doesn't define a deserialize function\");\n        });\n    }\n    /// This is meant to be used with\n    /// [`NodeSet.extend`](#common.NodeSet.extend) or\n    /// [`LRParser.configure`](#lr.ParserConfig.props) to compute\n    /// prop values for each node type in the set. Takes a [match\n    /// object](#common.NodeType^match) or function that returns undefined\n    /// if the node type doesn't get this prop, and the prop's value if\n    /// it does.\n    add(match) {\n        if (this.perNode)\n            throw new RangeError(\"Can't add per-node props to node types\");\n        if (typeof match != \"function\")\n            match = NodeType.match(match);\n        return (type) => {\n            let result = match(type);\n            return result === undefined ? null : [this, result];\n        };\n    }\n}\n/// Prop that is used to describe matching delimiters. For opening\n/// delimiters, this holds an array of node names (written as a\n/// space-separated string when declaring this prop in a grammar)\n/// for the node types of closing delimiters that match it.\nNodeProp.closedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/// The inverse of [`closedBy`](#common.NodeProp^closedBy). This is\n/// attached to closing delimiters, holding an array of node names\n/// of types of matching opening delimiters.\nNodeProp.openedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/// Used to assign node types to groups (for example, all node\n/// types that represent an expression could be tagged with an\n/// `\"Expression\"` group).\nNodeProp.group = new NodeProp({ deserialize: str => str.split(\" \") });\n/// The hash of the [context](#lr.ContextTracker.constructor)\n/// that the node was parsed in, if any. Used to limit reuse of\n/// contextual nodes.\nNodeProp.contextHash = new NodeProp({ perNode: true });\n/// The distance beyond the end of the node that the tokenizer\n/// looked ahead for any of the tokens inside the node. (The LR\n/// parser only stores this when it is larger than 25, for\n/// efficiency reasons.)\nNodeProp.lookAhead = new NodeProp({ perNode: true });\n/// This per-node prop is used to replace a given node, or part of a\n/// node, with another tree. This is useful to include trees from\n/// different languages in mixed-language parsers.\nNodeProp.mounted = new NodeProp({ perNode: true });\n/// A mounted tree, which can be [stored](#common.NodeProp^mounted) on\n/// a tree node to indicate that parts of its content are\n/// represented by another tree.\nclass MountedTree {\n    constructor(\n    /// The inner tree.\n    tree, \n    /// If this is null, this tree replaces the entire node (it will\n    /// be included in the regular iteration instead of its host\n    /// node). If not, only the given ranges are considered to be\n    /// covered by this tree. This is used for trees that are mixed in\n    /// a way that isn't strictly hierarchical. Such mounted trees are\n    /// only entered by [`resolveInner`](#common.Tree.resolveInner)\n    /// and [`enter`](#common.SyntaxNode.enter).\n    overlay, \n    /// The parser used to create this subtree.\n    parser) {\n        this.tree = tree;\n        this.overlay = overlay;\n        this.parser = parser;\n    }\n}\nconst noProps = Object.create(null);\n/// Each node in a syntax tree has a node type associated with it.\nclass NodeType {\n    /// @internal\n    constructor(\n    /// The name of the node type. Not necessarily unique, but if the\n    /// grammar was written properly, different node types with the\n    /// same name within a node set should play the same semantic\n    /// role.\n    name, \n    /// @internal\n    props, \n    /// The id of this node in its set. Corresponds to the term ids\n    /// used in the parser.\n    id, \n    /// @internal\n    flags = 0) {\n        this.name = name;\n        this.props = props;\n        this.id = id;\n        this.flags = flags;\n    }\n    /// Define a node type.\n    static define(spec) {\n        let props = spec.props && spec.props.length ? Object.create(null) : noProps;\n        let flags = (spec.top ? 1 /* NodeFlag.Top */ : 0) | (spec.skipped ? 2 /* NodeFlag.Skipped */ : 0) |\n            (spec.error ? 4 /* NodeFlag.Error */ : 0) | (spec.name == null ? 8 /* NodeFlag.Anonymous */ : 0);\n        let type = new NodeType(spec.name || \"\", props, spec.id, flags);\n        if (spec.props)\n            for (let src of spec.props) {\n                if (!Array.isArray(src))\n                    src = src(type);\n                if (src) {\n                    if (src[0].perNode)\n                        throw new RangeError(\"Can't store a per-node prop on a node type\");\n                    props[src[0].id] = src[1];\n                }\n            }\n        return type;\n    }\n    /// Retrieves a node prop for this type. Will return `undefined` if\n    /// the prop isn't present on this node.\n    prop(prop) { return this.props[prop.id]; }\n    /// True when this is the top node of a grammar.\n    get isTop() { return (this.flags & 1 /* NodeFlag.Top */) > 0; }\n    /// True when this node is produced by a skip rule.\n    get isSkipped() { return (this.flags & 2 /* NodeFlag.Skipped */) > 0; }\n    /// Indicates whether this is an error node.\n    get isError() { return (this.flags & 4 /* NodeFlag.Error */) > 0; }\n    /// When true, this node type doesn't correspond to a user-declared\n    /// named node, for example because it is used to cache repetition.\n    get isAnonymous() { return (this.flags & 8 /* NodeFlag.Anonymous */) > 0; }\n    /// Returns true when this node's name or one of its\n    /// [groups](#common.NodeProp^group) matches the given string.\n    is(name) {\n        if (typeof name == 'string') {\n            if (this.name == name)\n                return true;\n            let group = this.prop(NodeProp.group);\n            return group ? group.indexOf(name) > -1 : false;\n        }\n        return this.id == name;\n    }\n    /// Create a function from node types to arbitrary values by\n    /// specifying an object whose property names are node or\n    /// [group](#common.NodeProp^group) names. Often useful with\n    /// [`NodeProp.add`](#common.NodeProp.add). You can put multiple\n    /// names, separated by spaces, in a single property name to map\n    /// multiple node names to a single value.\n    static match(map) {\n        let direct = Object.create(null);\n        for (let prop in map)\n            for (let name of prop.split(\" \"))\n                direct[name] = map[prop];\n        return (node) => {\n            for (let groups = node.prop(NodeProp.group), i = -1; i < (groups ? groups.length : 0); i++) {\n                let found = direct[i < 0 ? node.name : groups[i]];\n                if (found)\n                    return found;\n            }\n        };\n    }\n}\n/// An empty dummy node type to use when no actual type is available.\nNodeType.none = new NodeType(\"\", Object.create(null), 0, 8 /* NodeFlag.Anonymous */);\n/// A node set holds a collection of node types. It is used to\n/// compactly represent trees by storing their type ids, rather than a\n/// full pointer to the type object, in a numeric array. Each parser\n/// [has](#lr.LRParser.nodeSet) a node set, and [tree\n/// buffers](#common.TreeBuffer) can only store collections of nodes\n/// from the same set. A set can have a maximum of 2**16 (65536) node\n/// types in it, so that the ids fit into 16-bit typed array slots.\nclass NodeSet {\n    /// Create a set with the given types. The `id` property of each\n    /// type should correspond to its position within the array.\n    constructor(\n    /// The node types in this set, by id.\n    types) {\n        this.types = types;\n        for (let i = 0; i < types.length; i++)\n            if (types[i].id != i)\n                throw new RangeError(\"Node type ids should correspond to array positions when creating a node set\");\n    }\n    /// Create a copy of this set with some node properties added. The\n    /// arguments to this method can be created with\n    /// [`NodeProp.add`](#common.NodeProp.add).\n    extend(...props) {\n        let newTypes = [];\n        for (let type of this.types) {\n            let newProps = null;\n            for (let source of props) {\n                let add = source(type);\n                if (add) {\n                    if (!newProps)\n                        newProps = Object.assign({}, type.props);\n                    newProps[add[0].id] = add[1];\n                }\n            }\n            newTypes.push(newProps ? new NodeType(type.name, newProps, type.id, type.flags) : type);\n        }\n        return new NodeSet(newTypes);\n    }\n}\nconst CachedNode = new WeakMap(), CachedInnerNode = new WeakMap();\n/// Options that control iteration. Can be combined with the `|`\n/// operator to enable multiple ones.\nvar IterMode;\n(function (IterMode) {\n    /// When enabled, iteration will only visit [`Tree`](#common.Tree)\n    /// objects, not nodes packed into\n    /// [`TreeBuffer`](#common.TreeBuffer)s.\n    IterMode[IterMode[\"ExcludeBuffers\"] = 1] = \"ExcludeBuffers\";\n    /// Enable this to make iteration include anonymous nodes (such as\n    /// the nodes that wrap repeated grammar constructs into a balanced\n    /// tree).\n    IterMode[IterMode[\"IncludeAnonymous\"] = 2] = \"IncludeAnonymous\";\n    /// By default, regular [mounted](#common.NodeProp^mounted) nodes\n    /// replace their base node in iteration. Enable this to ignore them\n    /// instead.\n    IterMode[IterMode[\"IgnoreMounts\"] = 4] = \"IgnoreMounts\";\n    /// This option only applies in\n    /// [`enter`](#common.SyntaxNode.enter)-style methods. It tells the\n    /// library to not enter mounted overlays if one covers the given\n    /// position.\n    IterMode[IterMode[\"IgnoreOverlays\"] = 8] = \"IgnoreOverlays\";\n})(IterMode || (IterMode = {}));\n/// A piece of syntax tree. There are two ways to approach these\n/// trees: the way they are actually stored in memory, and the\n/// convenient way.\n///\n/// Syntax trees are stored as a tree of `Tree` and `TreeBuffer`\n/// objects. By packing detail information into `TreeBuffer` leaf\n/// nodes, the representation is made a lot more memory-efficient.\n///\n/// However, when you want to actually work with tree nodes, this\n/// representation is very awkward, so most client code will want to\n/// use the [`TreeCursor`](#common.TreeCursor) or\n/// [`SyntaxNode`](#common.SyntaxNode) interface instead, which provides\n/// a view on some part of this data structure, and can be used to\n/// move around to adjacent nodes.\nclass Tree {\n    /// Construct a new tree. See also [`Tree.build`](#common.Tree^build).\n    constructor(\n    /// The type of the top node.\n    type, \n    /// This node's child nodes.\n    children, \n    /// The positions (offsets relative to the start of this tree) of\n    /// the children.\n    positions, \n    /// The total length of this tree\n    length, \n    /// Per-node [node props](#common.NodeProp) to associate with this node.\n    props) {\n        this.type = type;\n        this.children = children;\n        this.positions = positions;\n        this.length = length;\n        /// @internal\n        this.props = null;\n        if (props && props.length) {\n            this.props = Object.create(null);\n            for (let [prop, value] of props)\n                this.props[typeof prop == \"number\" ? prop : prop.id] = value;\n        }\n    }\n    /// @internal\n    toString() {\n        let mounted = this.prop(NodeProp.mounted);\n        if (mounted && !mounted.overlay)\n            return mounted.tree.toString();\n        let children = \"\";\n        for (let ch of this.children) {\n            let str = ch.toString();\n            if (str) {\n                if (children)\n                    children += \",\";\n                children += str;\n            }\n        }\n        return !this.type.name ? children :\n            (/\\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) +\n                (children.length ? \"(\" + children + \")\" : \"\");\n    }\n    /// Get a [tree cursor](#common.TreeCursor) positioned at the top of\n    /// the tree. Mode can be used to [control](#common.IterMode) which\n    /// nodes the cursor visits.\n    cursor(mode = 0) {\n        return new TreeCursor(this.topNode, mode);\n    }\n    /// Get a [tree cursor](#common.TreeCursor) pointing into this tree\n    /// at the given position and side (see\n    /// [`moveTo`](#common.TreeCursor.moveTo).\n    cursorAt(pos, side = 0, mode = 0) {\n        let scope = CachedNode.get(this) || this.topNode;\n        let cursor = new TreeCursor(scope);\n        cursor.moveTo(pos, side);\n        CachedNode.set(this, cursor._tree);\n        return cursor;\n    }\n    /// Get a [syntax node](#common.SyntaxNode) object for the top of the\n    /// tree.\n    get topNode() {\n        return new TreeNode(this, 0, 0, null);\n    }\n    /// Get the [syntax node](#common.SyntaxNode) at the given position.\n    /// If `side` is -1, this will move into nodes that end at the\n    /// position. If 1, it'll move into nodes that start at the\n    /// position. With 0, it'll only enter nodes that cover the position\n    /// from both sides.\n    ///\n    /// Note that this will not enter\n    /// [overlays](#common.MountedTree.overlay), and you often want\n    /// [`resolveInner`](#common.Tree.resolveInner) instead.\n    resolve(pos, side = 0) {\n        let node = resolveNode(CachedNode.get(this) || this.topNode, pos, side, false);\n        CachedNode.set(this, node);\n        return node;\n    }\n    /// Like [`resolve`](#common.Tree.resolve), but will enter\n    /// [overlaid](#common.MountedTree.overlay) nodes, producing a syntax node\n    /// pointing into the innermost overlaid tree at the given position\n    /// (with parent links going through all parent structure, including\n    /// the host trees).\n    resolveInner(pos, side = 0) {\n        let node = resolveNode(CachedInnerNode.get(this) || this.topNode, pos, side, true);\n        CachedInnerNode.set(this, node);\n        return node;\n    }\n    /// Iterate over the tree and its children, calling `enter` for any\n    /// node that touches the `from`/`to` region (if given) before\n    /// running over such a node's children, and `leave` (if given) when\n    /// leaving the node. When `enter` returns `false`, that node will\n    /// not have its children iterated over (or `leave` called).\n    iterate(spec) {\n        let { enter, leave, from = 0, to = this.length } = spec;\n        let mode = spec.mode || 0, anon = (mode & IterMode.IncludeAnonymous) > 0;\n        for (let c = this.cursor(mode | IterMode.IncludeAnonymous);;) {\n            let entered = false;\n            if (c.from <= to && c.to >= from && (!anon && c.type.isAnonymous || enter(c) !== false)) {\n                if (c.firstChild())\n                    continue;\n                entered = true;\n            }\n            for (;;) {\n                if (entered && leave && (anon || !c.type.isAnonymous))\n                    leave(c);\n                if (c.nextSibling())\n                    break;\n                if (!c.parent())\n                    return;\n                entered = true;\n            }\n        }\n    }\n    /// Get the value of the given [node prop](#common.NodeProp) for this\n    /// node. Works with both per-node and per-type props.\n    prop(prop) {\n        return !prop.perNode ? this.type.prop(prop) : this.props ? this.props[prop.id] : undefined;\n    }\n    /// Returns the node's [per-node props](#common.NodeProp.perNode) in a\n    /// format that can be passed to the [`Tree`](#common.Tree)\n    /// constructor.\n    get propValues() {\n        let result = [];\n        if (this.props)\n            for (let id in this.props)\n                result.push([+id, this.props[id]]);\n        return result;\n    }\n    /// Balance the direct children of this tree, producing a copy of\n    /// which may have children grouped into subtrees with type\n    /// [`NodeType.none`](#common.NodeType^none).\n    balance(config = {}) {\n        return this.children.length <= 8 /* Balance.BranchFactor */ ? this :\n            balanceRange(NodeType.none, this.children, this.positions, 0, this.children.length, 0, this.length, (children, positions, length) => new Tree(this.type, children, positions, length, this.propValues), config.makeTree || ((children, positions, length) => new Tree(NodeType.none, children, positions, length)));\n    }\n    /// Build a tree from a postfix-ordered buffer of node information,\n    /// or a cursor over such a buffer.\n    static build(data) { return buildTree(data); }\n}\n/// The empty tree\nTree.empty = new Tree(NodeType.none, [], [], 0);\nclass FlatBufferCursor {\n    constructor(buffer, index) {\n        this.buffer = buffer;\n        this.index = index;\n    }\n    get id() { return this.buffer[this.index - 4]; }\n    get start() { return this.buffer[this.index - 3]; }\n    get end() { return this.buffer[this.index - 2]; }\n    get size() { return this.buffer[this.index - 1]; }\n    get pos() { return this.index; }\n    next() { this.index -= 4; }\n    fork() { return new FlatBufferCursor(this.buffer, this.index); }\n}\n/// Tree buffers contain (type, start, end, endIndex) quads for each\n/// node. In such a buffer, nodes are stored in prefix order (parents\n/// before children, with the endIndex of the parent indicating which\n/// children belong to it).\nclass TreeBuffer {\n    /// Create a tree buffer.\n    constructor(\n    /// The buffer's content.\n    buffer, \n    /// The total length of the group of nodes in the buffer.\n    length, \n    /// The node set used in this buffer.\n    set) {\n        this.buffer = buffer;\n        this.length = length;\n        this.set = set;\n    }\n    /// @internal\n    get type() { return NodeType.none; }\n    /// @internal\n    toString() {\n        let result = [];\n        for (let index = 0; index < this.buffer.length;) {\n            result.push(this.childString(index));\n            index = this.buffer[index + 3];\n        }\n        return result.join(\",\");\n    }\n    /// @internal\n    childString(index) {\n        let id = this.buffer[index], endIndex = this.buffer[index + 3];\n        let type = this.set.types[id], result = type.name;\n        if (/\\W/.test(result) && !type.isError)\n            result = JSON.stringify(result);\n        index += 4;\n        if (endIndex == index)\n            return result;\n        let children = [];\n        while (index < endIndex) {\n            children.push(this.childString(index));\n            index = this.buffer[index + 3];\n        }\n        return result + \"(\" + children.join(\",\") + \")\";\n    }\n    /// @internal\n    findChild(startIndex, endIndex, dir, pos, side) {\n        let { buffer } = this, pick = -1;\n        for (let i = startIndex; i != endIndex; i = buffer[i + 3]) {\n            if (checkSide(side, pos, buffer[i + 1], buffer[i + 2])) {\n                pick = i;\n                if (dir > 0)\n                    break;\n            }\n        }\n        return pick;\n    }\n    /// @internal\n    slice(startI, endI, from) {\n        let b = this.buffer;\n        let copy = new Uint16Array(endI - startI), len = 0;\n        for (let i = startI, j = 0; i < endI;) {\n            copy[j++] = b[i++];\n            copy[j++] = b[i++] - from;\n            let to = copy[j++] = b[i++] - from;\n            copy[j++] = b[i++] - startI;\n            len = Math.max(len, to);\n        }\n        return new TreeBuffer(copy, len, this.set);\n    }\n}\nfunction checkSide(side, pos, from, to) {\n    switch (side) {\n        case -2 /* Side.Before */: return from < pos;\n        case -1 /* Side.AtOrBefore */: return to >= pos && from < pos;\n        case 0 /* Side.Around */: return from < pos && to > pos;\n        case 1 /* Side.AtOrAfter */: return from <= pos && to > pos;\n        case 2 /* Side.After */: return to > pos;\n        case 4 /* Side.DontCare */: return true;\n    }\n}\nfunction enterUnfinishedNodesBefore(node, pos) {\n    let scan = node.childBefore(pos);\n    while (scan) {\n        let last = scan.lastChild;\n        if (!last || last.to != scan.to)\n            break;\n        if (last.type.isError && last.from == last.to) {\n            node = scan;\n            scan = last.prevSibling;\n        }\n        else {\n            scan = last;\n        }\n    }\n    return node;\n}\nfunction resolveNode(node, pos, side, overlays) {\n    var _a;\n    // Move up to a node that actually holds the position, if possible\n    while (node.from == node.to ||\n        (side < 1 ? node.from >= pos : node.from > pos) ||\n        (side > -1 ? node.to <= pos : node.to < pos)) {\n        let parent = !overlays && node instanceof TreeNode && node.index < 0 ? null : node.parent;\n        if (!parent)\n            return node;\n        node = parent;\n    }\n    let mode = overlays ? 0 : IterMode.IgnoreOverlays;\n    // Must go up out of overlays when those do not overlap with pos\n    if (overlays)\n        for (let scan = node, parent = scan.parent; parent; scan = parent, parent = scan.parent) {\n            if (scan instanceof TreeNode && scan.index < 0 && ((_a = parent.enter(pos, side, mode)) === null || _a === void 0 ? void 0 : _a.from) != scan.from)\n                node = parent;\n        }\n    for (;;) {\n        let inner = node.enter(pos, side, mode);\n        if (!inner)\n            return node;\n        node = inner;\n    }\n}\nclass TreeNode {\n    constructor(_tree, from, \n    // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay)\n    index, _parent) {\n        this._tree = _tree;\n        this.from = from;\n        this.index = index;\n        this._parent = _parent;\n    }\n    get type() { return this._tree.type; }\n    get name() { return this._tree.type.name; }\n    get to() { return this.from + this._tree.length; }\n    nextChild(i, dir, pos, side, mode = 0) {\n        for (let parent = this;;) {\n            for (let { children, positions } = parent._tree, e = dir > 0 ? children.length : -1; i != e; i += dir) {\n                let next = children[i], start = positions[i] + parent.from;\n                if (!checkSide(side, pos, start, start + next.length))\n                    continue;\n                if (next instanceof TreeBuffer) {\n                    if (mode & IterMode.ExcludeBuffers)\n                        continue;\n                    let index = next.findChild(0, next.buffer.length, dir, pos - start, side);\n                    if (index > -1)\n                        return new BufferNode(new BufferContext(parent, next, i, start), null, index);\n                }\n                else if ((mode & IterMode.IncludeAnonymous) || (!next.type.isAnonymous || hasChild(next))) {\n                    let mounted;\n                    if (!(mode & IterMode.IgnoreMounts) &&\n                        next.props && (mounted = next.prop(NodeProp.mounted)) && !mounted.overlay)\n                        return new TreeNode(mounted.tree, start, i, parent);\n                    let inner = new TreeNode(next, start, i, parent);\n                    return (mode & IterMode.IncludeAnonymous) || !inner.type.isAnonymous ? inner\n                        : inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side);\n                }\n            }\n            if ((mode & IterMode.IncludeAnonymous) || !parent.type.isAnonymous)\n                return null;\n            if (parent.index >= 0)\n                i = parent.index + dir;\n            else\n                i = dir < 0 ? -1 : parent._parent._tree.children.length;\n            parent = parent._parent;\n            if (!parent)\n                return null;\n        }\n    }\n    get firstChild() { return this.nextChild(0, 1, 0, 4 /* Side.DontCare */); }\n    get lastChild() { return this.nextChild(this._tree.children.length - 1, -1, 0, 4 /* Side.DontCare */); }\n    childAfter(pos) { return this.nextChild(0, 1, pos, 2 /* Side.After */); }\n    childBefore(pos) { return this.nextChild(this._tree.children.length - 1, -1, pos, -2 /* Side.Before */); }\n    enter(pos, side, mode = 0) {\n        let mounted;\n        if (!(mode & IterMode.IgnoreOverlays) && (mounted = this._tree.prop(NodeProp.mounted)) && mounted.overlay) {\n            let rPos = pos - this.from;\n            for (let { from, to } of mounted.overlay) {\n                if ((side > 0 ? from <= rPos : from < rPos) &&\n                    (side < 0 ? to >= rPos : to > rPos))\n                    return new TreeNode(mounted.tree, mounted.overlay[0].from + this.from, -1, this);\n            }\n        }\n        return this.nextChild(0, 1, pos, side, mode);\n    }\n    nextSignificantParent() {\n        let val = this;\n        while (val.type.isAnonymous && val._parent)\n            val = val._parent;\n        return val;\n    }\n    get parent() {\n        return this._parent ? this._parent.nextSignificantParent() : null;\n    }\n    get nextSibling() {\n        return this._parent && this.index >= 0 ? this._parent.nextChild(this.index + 1, 1, 0, 4 /* Side.DontCare */) : null;\n    }\n    get prevSibling() {\n        return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4 /* Side.DontCare */) : null;\n    }\n    cursor(mode = 0) { return new TreeCursor(this, mode); }\n    get tree() { return this._tree; }\n    toTree() { return this._tree; }\n    resolve(pos, side = 0) {\n        return resolveNode(this, pos, side, false);\n    }\n    resolveInner(pos, side = 0) {\n        return resolveNode(this, pos, side, true);\n    }\n    enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); }\n    getChild(type, before = null, after = null) {\n        let r = getChildren(this, type, before, after);\n        return r.length ? r[0] : null;\n    }\n    getChildren(type, before = null, after = null) {\n        return getChildren(this, type, before, after);\n    }\n    /// @internal\n    toString() { return this._tree.toString(); }\n    get node() { return this; }\n    matchContext(context) { return matchNodeContext(this, context); }\n}\nfunction getChildren(node, type, before, after) {\n    let cur = node.cursor(), result = [];\n    if (!cur.firstChild())\n        return result;\n    if (before != null)\n        while (!cur.type.is(before))\n            if (!cur.nextSibling())\n                return result;\n    for (;;) {\n        if (after != null && cur.type.is(after))\n            return result;\n        if (cur.type.is(type))\n            result.push(cur.node);\n        if (!cur.nextSibling())\n            return after == null ? result : [];\n    }\n}\nfunction matchNodeContext(node, context, i = context.length - 1) {\n    for (let p = node.parent; i >= 0; p = p.parent) {\n        if (!p)\n            return false;\n        if (!p.type.isAnonymous) {\n            if (context[i] && context[i] != p.name)\n                return false;\n            i--;\n        }\n    }\n    return true;\n}\nclass BufferContext {\n    constructor(parent, buffer, index, start) {\n        this.parent = parent;\n        this.buffer = buffer;\n        this.index = index;\n        this.start = start;\n    }\n}\nclass BufferNode {\n    get name() { return this.type.name; }\n    get from() { return this.context.start + this.context.buffer.buffer[this.index + 1]; }\n    get to() { return this.context.start + this.context.buffer.buffer[this.index + 2]; }\n    constructor(context, _parent, index) {\n        this.context = context;\n        this._parent = _parent;\n        this.index = index;\n        this.type = context.buffer.set.types[context.buffer.buffer[index]];\n    }\n    child(dir, pos, side) {\n        let { buffer } = this.context;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.context.start, side);\n        return index < 0 ? null : new BufferNode(this.context, this, index);\n    }\n    get firstChild() { return this.child(1, 0, 4 /* Side.DontCare */); }\n    get lastChild() { return this.child(-1, 0, 4 /* Side.DontCare */); }\n    childAfter(pos) { return this.child(1, pos, 2 /* Side.After */); }\n    childBefore(pos) { return this.child(-1, pos, -2 /* Side.Before */); }\n    enter(pos, side, mode = 0) {\n        if (mode & IterMode.ExcludeBuffers)\n            return null;\n        let { buffer } = this.context;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], side > 0 ? 1 : -1, pos - this.context.start, side);\n        return index < 0 ? null : new BufferNode(this.context, this, index);\n    }\n    get parent() {\n        return this._parent || this.context.parent.nextSignificantParent();\n    }\n    externalSibling(dir) {\n        return this._parent ? null : this.context.parent.nextChild(this.context.index + dir, dir, 0, 4 /* Side.DontCare */);\n    }\n    get nextSibling() {\n        let { buffer } = this.context;\n        let after = buffer.buffer[this.index + 3];\n        if (after < (this._parent ? buffer.buffer[this._parent.index + 3] : buffer.buffer.length))\n            return new BufferNode(this.context, this._parent, after);\n        return this.externalSibling(1);\n    }\n    get prevSibling() {\n        let { buffer } = this.context;\n        let parentStart = this._parent ? this._parent.index + 4 : 0;\n        if (this.index == parentStart)\n            return this.externalSibling(-1);\n        return new BufferNode(this.context, this._parent, buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n    }\n    cursor(mode = 0) { return new TreeCursor(this, mode); }\n    get tree() { return null; }\n    toTree() {\n        let children = [], positions = [];\n        let { buffer } = this.context;\n        let startI = this.index + 4, endI = buffer.buffer[this.index + 3];\n        if (endI > startI) {\n            let from = buffer.buffer[this.index + 1];\n            children.push(buffer.slice(startI, endI, from));\n            positions.push(0);\n        }\n        return new Tree(this.type, children, positions, this.to - this.from);\n    }\n    resolve(pos, side = 0) {\n        return resolveNode(this, pos, side, false);\n    }\n    resolveInner(pos, side = 0) {\n        return resolveNode(this, pos, side, true);\n    }\n    enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); }\n    /// @internal\n    toString() { return this.context.buffer.childString(this.index); }\n    getChild(type, before = null, after = null) {\n        let r = getChildren(this, type, before, after);\n        return r.length ? r[0] : null;\n    }\n    getChildren(type, before = null, after = null) {\n        return getChildren(this, type, before, after);\n    }\n    get node() { return this; }\n    matchContext(context) { return matchNodeContext(this, context); }\n}\n/// A tree cursor object focuses on a given node in a syntax tree, and\n/// allows you to move to adjacent nodes.\nclass TreeCursor {\n    /// Shorthand for `.type.name`.\n    get name() { return this.type.name; }\n    /// @internal\n    constructor(node, \n    /// @internal\n    mode = 0) {\n        this.mode = mode;\n        /// @internal\n        this.buffer = null;\n        this.stack = [];\n        /// @internal\n        this.index = 0;\n        this.bufferNode = null;\n        if (node instanceof TreeNode) {\n            this.yieldNode(node);\n        }\n        else {\n            this._tree = node.context.parent;\n            this.buffer = node.context;\n            for (let n = node._parent; n; n = n._parent)\n                this.stack.unshift(n.index);\n            this.bufferNode = node;\n            this.yieldBuf(node.index);\n        }\n    }\n    yieldNode(node) {\n        if (!node)\n            return false;\n        this._tree = node;\n        this.type = node.type;\n        this.from = node.from;\n        this.to = node.to;\n        return true;\n    }\n    yieldBuf(index, type) {\n        this.index = index;\n        let { start, buffer } = this.buffer;\n        this.type = type || buffer.set.types[buffer.buffer[index]];\n        this.from = start + buffer.buffer[index + 1];\n        this.to = start + buffer.buffer[index + 2];\n        return true;\n    }\n    yield(node) {\n        if (!node)\n            return false;\n        if (node instanceof TreeNode) {\n            this.buffer = null;\n            return this.yieldNode(node);\n        }\n        this.buffer = node.context;\n        return this.yieldBuf(node.index, node.type);\n    }\n    /// @internal\n    toString() {\n        return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();\n    }\n    /// @internal\n    enterChild(dir, pos, side) {\n        if (!this.buffer)\n            return this.yield(this._tree.nextChild(dir < 0 ? this._tree._tree.children.length - 1 : 0, dir, pos, side, this.mode));\n        let { buffer } = this.buffer;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.buffer.start, side);\n        if (index < 0)\n            return false;\n        this.stack.push(this.index);\n        return this.yieldBuf(index);\n    }\n    /// Move the cursor to this node's first child. When this returns\n    /// false, the node has no child, and the cursor has not been moved.\n    firstChild() { return this.enterChild(1, 0, 4 /* Side.DontCare */); }\n    /// Move the cursor to this node's last child.\n    lastChild() { return this.enterChild(-1, 0, 4 /* Side.DontCare */); }\n    /// Move the cursor to the first child that ends after `pos`.\n    childAfter(pos) { return this.enterChild(1, pos, 2 /* Side.After */); }\n    /// Move to the last child that starts before `pos`.\n    childBefore(pos) { return this.enterChild(-1, pos, -2 /* Side.Before */); }\n    /// Move the cursor to the child around `pos`. If side is -1 the\n    /// child may end at that position, when 1 it may start there. This\n    /// will also enter [overlaid](#common.MountedTree.overlay)\n    /// [mounted](#common.NodeProp^mounted) trees unless `overlays` is\n    /// set to false.\n    enter(pos, side, mode = this.mode) {\n        if (!this.buffer)\n            return this.yield(this._tree.enter(pos, side, mode));\n        return mode & IterMode.ExcludeBuffers ? false : this.enterChild(1, pos, side);\n    }\n    /// Move to the node's parent node, if this isn't the top node.\n    parent() {\n        if (!this.buffer)\n            return this.yieldNode((this.mode & IterMode.IncludeAnonymous) ? this._tree._parent : this._tree.parent);\n        if (this.stack.length)\n            return this.yieldBuf(this.stack.pop());\n        let parent = (this.mode & IterMode.IncludeAnonymous) ? this.buffer.parent : this.buffer.parent.nextSignificantParent();\n        this.buffer = null;\n        return this.yieldNode(parent);\n    }\n    /// @internal\n    sibling(dir) {\n        if (!this.buffer)\n            return !this._tree._parent ? false\n                : this.yield(this._tree.index < 0 ? null\n                    : this._tree._parent.nextChild(this._tree.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode));\n        let { buffer } = this.buffer, d = this.stack.length - 1;\n        if (dir < 0) {\n            let parentStart = d < 0 ? 0 : this.stack[d] + 4;\n            if (this.index != parentStart)\n                return this.yieldBuf(buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n        }\n        else {\n            let after = buffer.buffer[this.index + 3];\n            if (after < (d < 0 ? buffer.buffer.length : buffer.buffer[this.stack[d] + 3]))\n                return this.yieldBuf(after);\n        }\n        return d < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode)) : false;\n    }\n    /// Move to this node's next sibling, if any.\n    nextSibling() { return this.sibling(1); }\n    /// Move to this node's previous sibling, if any.\n    prevSibling() { return this.sibling(-1); }\n    atLastNode(dir) {\n        let index, parent, { buffer } = this;\n        if (buffer) {\n            if (dir > 0) {\n                if (this.index < buffer.buffer.buffer.length)\n                    return false;\n            }\n            else {\n                for (let i = 0; i < this.index; i++)\n                    if (buffer.buffer.buffer[i + 3] < this.index)\n                        return false;\n            }\n            ({ index, parent } = buffer);\n        }\n        else {\n            ({ index, _parent: parent } = this._tree);\n        }\n        for (; parent; { index, _parent: parent } = parent) {\n            if (index > -1)\n                for (let i = index + dir, e = dir < 0 ? -1 : parent._tree.children.length; i != e; i += dir) {\n                    let child = parent._tree.children[i];\n                    if ((this.mode & IterMode.IncludeAnonymous) ||\n                        child instanceof TreeBuffer ||\n                        !child.type.isAnonymous ||\n                        hasChild(child))\n                        return false;\n                }\n        }\n        return true;\n    }\n    move(dir, enter) {\n        if (enter && this.enterChild(dir, 0, 4 /* Side.DontCare */))\n            return true;\n        for (;;) {\n            if (this.sibling(dir))\n                return true;\n            if (this.atLastNode(dir) || !this.parent())\n                return false;\n        }\n    }\n    /// Move to the next node in a\n    /// [pre-order](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order,_NLR)\n    /// traversal, going from a node to its first child or, if the\n    /// current node is empty or `enter` is false, its next sibling or\n    /// the next sibling of the first parent node that has one.\n    next(enter = true) { return this.move(1, enter); }\n    /// Move to the next node in a last-to-first pre-order traveral. A\n    /// node is followed by its last child or, if it has none, its\n    /// previous sibling or the previous sibling of the first parent\n    /// node that has one.\n    prev(enter = true) { return this.move(-1, enter); }\n    /// Move the cursor to the innermost node that covers `pos`. If\n    /// `side` is -1, it will enter nodes that end at `pos`. If it is 1,\n    /// it will enter nodes that start at `pos`.\n    moveTo(pos, side = 0) {\n        // Move up to a node that actually holds the position, if possible\n        while (this.from == this.to ||\n            (side < 1 ? this.from >= pos : this.from > pos) ||\n            (side > -1 ? this.to <= pos : this.to < pos))\n            if (!this.parent())\n                break;\n        // Then scan down into child nodes as far as possible\n        while (this.enterChild(1, pos, side)) { }\n        return this;\n    }\n    /// Get a [syntax node](#common.SyntaxNode) at the cursor's current\n    /// position.\n    get node() {\n        if (!this.buffer)\n            return this._tree;\n        let cache = this.bufferNode, result = null, depth = 0;\n        if (cache && cache.context == this.buffer) {\n            scan: for (let index = this.index, d = this.stack.length; d >= 0;) {\n                for (let c = cache; c; c = c._parent)\n                    if (c.index == index) {\n                        if (index == this.index)\n                            return c;\n                        result = c;\n                        depth = d + 1;\n                        break scan;\n                    }\n                index = this.stack[--d];\n            }\n        }\n        for (let i = depth; i < this.stack.length; i++)\n            result = new BufferNode(this.buffer, result, this.stack[i]);\n        return this.bufferNode = new BufferNode(this.buffer, result, this.index);\n    }\n    /// Get the [tree](#common.Tree) that represents the current node, if\n    /// any. Will return null when the node is in a [tree\n    /// buffer](#common.TreeBuffer).\n    get tree() {\n        return this.buffer ? null : this._tree._tree;\n    }\n    /// Iterate over the current node and all its descendants, calling\n    /// `enter` when entering a node and `leave`, if given, when leaving\n    /// one. When `enter` returns `false`, any children of that node are\n    /// skipped, and `leave` isn't called for it.\n    iterate(enter, leave) {\n        for (let depth = 0;;) {\n            let mustLeave = false;\n            if (this.type.isAnonymous || enter(this) !== false) {\n                if (this.firstChild()) {\n                    depth++;\n                    continue;\n                }\n                if (!this.type.isAnonymous)\n                    mustLeave = true;\n            }\n            for (;;) {\n                if (mustLeave && leave)\n                    leave(this);\n                mustLeave = this.type.isAnonymous;\n                if (this.nextSibling())\n                    break;\n                if (!depth)\n                    return;\n                this.parent();\n                depth--;\n                mustLeave = true;\n            }\n        }\n    }\n    /// Test whether the current node matches a given context\u2014a sequence\n    /// of direct parent node names. Empty strings in the context array\n    /// are treated as wildcards.\n    matchContext(context) {\n        if (!this.buffer)\n            return matchNodeContext(this.node, context);\n        let { buffer } = this.buffer, { types } = buffer.set;\n        for (let i = context.length - 1, d = this.stack.length - 1; i >= 0; d--) {\n            if (d < 0)\n                return matchNodeContext(this.node, context, i);\n            let type = types[buffer.buffer[this.stack[d]]];\n            if (!type.isAnonymous) {\n                if (context[i] && context[i] != type.name)\n                    return false;\n                i--;\n            }\n        }\n        return true;\n    }\n}\nfunction hasChild(tree) {\n    return tree.children.some(ch => ch instanceof TreeBuffer || !ch.type.isAnonymous || hasChild(ch));\n}\nfunction buildTree(data) {\n    var _a;\n    let { buffer, nodeSet, maxBufferLength = DefaultBufferLength, reused = [], minRepeatType = nodeSet.types.length } = data;\n    let cursor = Array.isArray(buffer) ? new FlatBufferCursor(buffer, buffer.length) : buffer;\n    let types = nodeSet.types;\n    let contextHash = 0, lookAhead = 0;\n    function takeNode(parentStart, minPos, children, positions, inRepeat) {\n        let { id, start, end, size } = cursor;\n        let lookAheadAtStart = lookAhead;\n        while (size < 0) {\n            cursor.next();\n            if (size == -1 /* SpecialRecord.Reuse */) {\n                let node = reused[id];\n                children.push(node);\n                positions.push(start - parentStart);\n                return;\n            }\n            else if (size == -3 /* SpecialRecord.ContextChange */) { // Context change\n                contextHash = id;\n                return;\n            }\n            else if (size == -4 /* SpecialRecord.LookAhead */) {\n                lookAhead = id;\n                return;\n            }\n            else {\n                throw new RangeError(`Unrecognized record size: ${size}`);\n            }\n        }\n        let type = types[id], node, buffer;\n        let startPos = start - parentStart;\n        if (end - start <= maxBufferLength && (buffer = findBufferSize(cursor.pos - minPos, inRepeat))) {\n            // Small enough for a buffer, and no reused nodes inside\n            let data = new Uint16Array(buffer.size - buffer.skip);\n            let endPos = cursor.pos - buffer.size, index = data.length;\n            while (cursor.pos > endPos)\n                index = copyToBuffer(buffer.start, data, index);\n            node = new TreeBuffer(data, end - buffer.start, nodeSet);\n            startPos = buffer.start - parentStart;\n        }\n        else { // Make it a node\n            let endPos = cursor.pos - size;\n            cursor.next();\n            let localChildren = [], localPositions = [];\n            let localInRepeat = id >= minRepeatType ? id : -1;\n            let lastGroup = 0, lastEnd = end;\n            while (cursor.pos > endPos) {\n                if (localInRepeat >= 0 && cursor.id == localInRepeat && cursor.size >= 0) {\n                    if (cursor.end <= lastEnd - maxBufferLength) {\n                        makeRepeatLeaf(localChildren, localPositions, start, lastGroup, cursor.end, lastEnd, localInRepeat, lookAheadAtStart);\n                        lastGroup = localChildren.length;\n                        lastEnd = cursor.end;\n                    }\n                    cursor.next();\n                }\n                else {\n                    takeNode(start, endPos, localChildren, localPositions, localInRepeat);\n                }\n            }\n            if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length)\n                makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart);\n            localChildren.reverse();\n            localPositions.reverse();\n            if (localInRepeat > -1 && lastGroup > 0) {\n                let make = makeBalanced(type);\n                node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);\n            }\n            else {\n                node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end);\n            }\n        }\n        children.push(node);\n        positions.push(startPos);\n    }\n    function makeBalanced(type) {\n        return (children, positions, length) => {\n            let lookAhead = 0, lastI = children.length - 1, last, lookAheadProp;\n            if (lastI >= 0 && (last = children[lastI]) instanceof Tree) {\n                if (!lastI && last.type == type && last.length == length)\n                    return last;\n                if (lookAheadProp = last.prop(NodeProp.lookAhead))\n                    lookAhead = positions[lastI] + last.length + lookAheadProp;\n            }\n            return makeTree(type, children, positions, length, lookAhead);\n        };\n    }\n    function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead) {\n        let localChildren = [], localPositions = [];\n        while (children.length > i) {\n            localChildren.push(children.pop());\n            localPositions.push(positions.pop() + base - from);\n        }\n        children.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead - to));\n        positions.push(from - base);\n    }\n    function makeTree(type, children, positions, length, lookAhead = 0, props) {\n        if (contextHash) {\n            let pair = [NodeProp.contextHash, contextHash];\n            props = props ? [pair].concat(props) : [pair];\n        }\n        if (lookAhead > 25) {\n            let pair = [NodeProp.lookAhead, lookAhead];\n            props = props ? [pair].concat(props) : [pair];\n        }\n        return new Tree(type, children, positions, length, props);\n    }\n    function findBufferSize(maxSize, inRepeat) {\n        // Scan through the buffer to find previous siblings that fit\n        // together in a TreeBuffer, and don't contain any reused nodes\n        // (which can't be stored in a buffer).\n        // If `inRepeat` is > -1, ignore node boundaries of that type for\n        // nesting, but make sure the end falls either at the start\n        // (`maxSize`) or before such a node.\n        let fork = cursor.fork();\n        let size = 0, start = 0, skip = 0, minStart = fork.end - maxBufferLength;\n        let result = { size: 0, start: 0, skip: 0 };\n        scan: for (let minPos = fork.pos - maxSize; fork.pos > minPos;) {\n            let nodeSize = fork.size;\n            // Pretend nested repeat nodes of the same type don't exist\n            if (fork.id == inRepeat && nodeSize >= 0) {\n                // Except that we store the current state as a valid return\n                // value.\n                result.size = size;\n                result.start = start;\n                result.skip = skip;\n                skip += 4;\n                size += 4;\n                fork.next();\n                continue;\n            }\n            let startPos = fork.pos - nodeSize;\n            if (nodeSize < 0 || startPos < minPos || fork.start < minStart)\n                break;\n            let localSkipped = fork.id >= minRepeatType ? 4 : 0;\n            let nodeStart = fork.start;\n            fork.next();\n            while (fork.pos > startPos) {\n                if (fork.size < 0) {\n                    if (fork.size == -3 /* SpecialRecord.ContextChange */)\n                        localSkipped += 4;\n                    else\n                        break scan;\n                }\n                else if (fork.id >= minRepeatType) {\n                    localSkipped += 4;\n                }\n                fork.next();\n            }\n            start = nodeStart;\n            size += nodeSize;\n            skip += localSkipped;\n        }\n        if (inRepeat < 0 || size == maxSize) {\n            result.size = size;\n            result.start = start;\n            result.skip = skip;\n        }\n        return result.size > 4 ? result : undefined;\n    }\n    function copyToBuffer(bufferStart, buffer, index) {\n        let { id, start, end, size } = cursor;\n        cursor.next();\n        if (size >= 0 && id < minRepeatType) {\n            let startIndex = index;\n            if (size > 4) {\n                let endPos = cursor.pos - (size - 4);\n                while (cursor.pos > endPos)\n                    index = copyToBuffer(bufferStart, buffer, index);\n            }\n            buffer[--index] = startIndex;\n            buffer[--index] = end - bufferStart;\n            buffer[--index] = start - bufferStart;\n            buffer[--index] = id;\n        }\n        else if (size == -3 /* SpecialRecord.ContextChange */) {\n            contextHash = id;\n        }\n        else if (size == -4 /* SpecialRecord.LookAhead */) {\n            lookAhead = id;\n        }\n        return index;\n    }\n    let children = [], positions = [];\n    while (cursor.pos > 0)\n        takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1);\n    let length = (_a = data.length) !== null && _a !== void 0 ? _a : (children.length ? positions[0] + children[0].length : 0);\n    return new Tree(types[data.topID], children.reverse(), positions.reverse(), length);\n}\nconst nodeSizeCache = new WeakMap;\nfunction nodeSize(balanceType, node) {\n    if (!balanceType.isAnonymous || node instanceof TreeBuffer || node.type != balanceType)\n        return 1;\n    let size = nodeSizeCache.get(node);\n    if (size == null) {\n        size = 1;\n        for (let child of node.children) {\n            if (child.type != balanceType || !(child instanceof Tree)) {\n                size = 1;\n                break;\n            }\n            size += nodeSize(balanceType, child);\n        }\n        nodeSizeCache.set(node, size);\n    }\n    return size;\n}\nfunction balanceRange(\n// The type the balanced tree's inner nodes.\nbalanceType, \n// The direct children and their positions\nchildren, positions, \n// The index range in children/positions to use\nfrom, to, \n// The start position of the nodes, relative to their parent.\nstart, \n// Length of the outer node\nlength, \n// Function to build the top node of the balanced tree\nmkTop, \n// Function to build internal nodes for the balanced tree\nmkTree) {\n    let total = 0;\n    for (let i = from; i < to; i++)\n        total += nodeSize(balanceType, children[i]);\n    let maxChild = Math.ceil((total * 1.5) / 8 /* Balance.BranchFactor */);\n    let localChildren = [], localPositions = [];\n    function divide(children, positions, from, to, offset) {\n        for (let i = from; i < to;) {\n            let groupFrom = i, groupStart = positions[i], groupSize = nodeSize(balanceType, children[i]);\n            i++;\n            for (; i < to; i++) {\n                let nextSize = nodeSize(balanceType, children[i]);\n                if (groupSize + nextSize >= maxChild)\n                    break;\n                groupSize += nextSize;\n            }\n            if (i == groupFrom + 1) {\n                if (groupSize > maxChild) {\n                    let only = children[groupFrom]; // Only trees can have a size > 1\n                    divide(only.children, only.positions, 0, only.children.length, positions[groupFrom] + offset);\n                    continue;\n                }\n                localChildren.push(children[groupFrom]);\n            }\n            else {\n                let length = positions[i - 1] + children[i - 1].length - groupStart;\n                localChildren.push(balanceRange(balanceType, children, positions, groupFrom, i, groupStart, length, null, mkTree));\n            }\n            localPositions.push(groupStart + offset - start);\n        }\n    }\n    divide(children, positions, from, to, 0);\n    return (mkTop || mkTree)(localChildren, localPositions, length);\n}\n/// Provides a way to associate values with pieces of trees. As long\n/// as that part of the tree is reused, the associated values can be\n/// retrieved from an updated tree.\nclass NodeWeakMap {\n    constructor() {\n        this.map = new WeakMap();\n    }\n    setBuffer(buffer, index, value) {\n        let inner = this.map.get(buffer);\n        if (!inner)\n            this.map.set(buffer, inner = new Map);\n        inner.set(index, value);\n    }\n    getBuffer(buffer, index) {\n        let inner = this.map.get(buffer);\n        return inner && inner.get(index);\n    }\n    /// Set the value for this syntax node.\n    set(node, value) {\n        if (node instanceof BufferNode)\n            this.setBuffer(node.context.buffer, node.index, value);\n        else if (node instanceof TreeNode)\n            this.map.set(node.tree, value);\n    }\n    /// Retrieve value for this syntax node, if it exists in the map.\n    get(node) {\n        return node instanceof BufferNode ? this.getBuffer(node.context.buffer, node.index)\n            : node instanceof TreeNode ? this.map.get(node.tree) : undefined;\n    }\n    /// Set the value for the node that a cursor currently points to.\n    cursorSet(cursor, value) {\n        if (cursor.buffer)\n            this.setBuffer(cursor.buffer.buffer, cursor.index, value);\n        else\n            this.map.set(cursor.tree, value);\n    }\n    /// Retrieve the value for the node that a cursor currently points\n    /// to.\n    cursorGet(cursor) {\n        return cursor.buffer ? this.getBuffer(cursor.buffer.buffer, cursor.index) : this.map.get(cursor.tree);\n    }\n}\n\n/// Tree fragments are used during [incremental\n/// parsing](#common.Parser.startParse) to track parts of old trees\n/// that can be reused in a new parse. An array of fragments is used\n/// to track regions of an old tree whose nodes might be reused in new\n/// parses. Use the static\n/// [`applyChanges`](#common.TreeFragment^applyChanges) method to\n/// update fragments for document changes.\nclass TreeFragment {\n    /// Construct a tree fragment. You'll usually want to use\n    /// [`addTree`](#common.TreeFragment^addTree) and\n    /// [`applyChanges`](#common.TreeFragment^applyChanges) instead of\n    /// calling this directly.\n    constructor(\n    /// The start of the unchanged range pointed to by this fragment.\n    /// This refers to an offset in the _updated_ document (as opposed\n    /// to the original tree).\n    from, \n    /// The end of the unchanged range.\n    to, \n    /// The tree that this fragment is based on.\n    tree, \n    /// The offset between the fragment's tree and the document that\n    /// this fragment can be used against. Add this when going from\n    /// document to tree positions, subtract it to go from tree to\n    /// document positions.\n    offset, openStart = false, openEnd = false) {\n        this.from = from;\n        this.to = to;\n        this.tree = tree;\n        this.offset = offset;\n        this.open = (openStart ? 1 /* Open.Start */ : 0) | (openEnd ? 2 /* Open.End */ : 0);\n    }\n    /// Whether the start of the fragment represents the start of a\n    /// parse, or the end of a change. (In the second case, it may not\n    /// be safe to reuse some nodes at the start, depending on the\n    /// parsing algorithm.)\n    get openStart() { return (this.open & 1 /* Open.Start */) > 0; }\n    /// Whether the end of the fragment represents the end of a\n    /// full-document parse, or the start of a change.\n    get openEnd() { return (this.open & 2 /* Open.End */) > 0; }\n    /// Create a set of fragments from a freshly parsed tree, or update\n    /// an existing set of fragments by replacing the ones that overlap\n    /// with a tree with content from the new tree. When `partial` is\n    /// true, the parse is treated as incomplete, and the resulting\n    /// fragment has [`openEnd`](#common.TreeFragment.openEnd) set to\n    /// true.\n    static addTree(tree, fragments = [], partial = false) {\n        let result = [new TreeFragment(0, tree.length, tree, 0, false, partial)];\n        for (let f of fragments)\n            if (f.to > tree.length)\n                result.push(f);\n        return result;\n    }\n    /// Apply a set of edits to an array of fragments, removing or\n    /// splitting fragments as necessary to remove edited ranges, and\n    /// adjusting offsets for fragments that moved.\n    static applyChanges(fragments, changes, minGap = 128) {\n        if (!changes.length)\n            return fragments;\n        let result = [];\n        let fI = 1, nextF = fragments.length ? fragments[0] : null;\n        for (let cI = 0, pos = 0, off = 0;; cI++) {\n            let nextC = cI < changes.length ? changes[cI] : null;\n            let nextPos = nextC ? nextC.fromA : 1e9;\n            if (nextPos - pos >= minGap)\n                while (nextF && nextF.from < nextPos) {\n                    let cut = nextF;\n                    if (pos >= cut.from || nextPos <= cut.to || off) {\n                        let fFrom = Math.max(cut.from, pos) - off, fTo = Math.min(cut.to, nextPos) - off;\n                        cut = fFrom >= fTo ? null : new TreeFragment(fFrom, fTo, cut.tree, cut.offset + off, cI > 0, !!nextC);\n                    }\n                    if (cut)\n                        result.push(cut);\n                    if (nextF.to > nextPos)\n                        break;\n                    nextF = fI < fragments.length ? fragments[fI++] : null;\n                }\n            if (!nextC)\n                break;\n            pos = nextC.toA;\n            off = nextC.toA - nextC.toB;\n        }\n        return result;\n    }\n}\n/// A superclass that parsers should extend.\nclass Parser {\n    /// Start a parse, returning a [partial parse](#common.PartialParse)\n    /// object. [`fragments`](#common.TreeFragment) can be passed in to\n    /// make the parse incremental.\n    ///\n    /// By default, the entire input is parsed. You can pass `ranges`,\n    /// which should be a sorted array of non-empty, non-overlapping\n    /// ranges, to parse only those ranges. The tree returned in that\n    /// case will start at `ranges[0].from`.\n    startParse(input, fragments, ranges) {\n        if (typeof input == \"string\")\n            input = new StringInput(input);\n        ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map(r => new Range(r.from, r.to)) : [new Range(0, 0)];\n        return this.createParse(input, fragments || [], ranges);\n    }\n    /// Run a full parse, returning the resulting tree.\n    parse(input, fragments, ranges) {\n        let parse = this.startParse(input, fragments, ranges);\n        for (;;) {\n            let done = parse.advance();\n            if (done)\n                return done;\n        }\n    }\n}\nclass StringInput {\n    constructor(string) {\n        this.string = string;\n    }\n    get length() { return this.string.length; }\n    chunk(from) { return this.string.slice(from); }\n    get lineChunks() { return false; }\n    read(from, to) { return this.string.slice(from, to); }\n}\n\n/// Create a parse wrapper that, after the inner parse completes,\n/// scans its tree for mixed language regions with the `nest`\n/// function, runs the resulting [inner parses](#common.NestedParse),\n/// and then [mounts](#common.NodeProp^mounted) their results onto the\n/// tree.\nfunction parseMixed(nest) {\n    return (parse, input, fragments, ranges) => new MixedParse(parse, nest, input, fragments, ranges);\n}\nclass InnerParse {\n    constructor(parser, parse, overlay, target, ranges) {\n        this.parser = parser;\n        this.parse = parse;\n        this.overlay = overlay;\n        this.target = target;\n        this.ranges = ranges;\n        if (!ranges.length || ranges.some(r => r.from >= r.to))\n            throw new RangeError(\"Invalid inner parse ranges given: \" + JSON.stringify(ranges));\n    }\n}\nclass ActiveOverlay {\n    constructor(parser, predicate, mounts, index, start, target, prev) {\n        this.parser = parser;\n        this.predicate = predicate;\n        this.mounts = mounts;\n        this.index = index;\n        this.start = start;\n        this.target = target;\n        this.prev = prev;\n        this.depth = 0;\n        this.ranges = [];\n    }\n}\nconst stoppedInner = new NodeProp({ perNode: true });\nclass MixedParse {\n    constructor(base, nest, input, fragments, ranges) {\n        this.nest = nest;\n        this.input = input;\n        this.fragments = fragments;\n        this.ranges = ranges;\n        this.inner = [];\n        this.innerDone = 0;\n        this.baseTree = null;\n        this.stoppedAt = null;\n        this.baseParse = base;\n    }\n    advance() {\n        if (this.baseParse) {\n            let done = this.baseParse.advance();\n            if (!done)\n                return null;\n            this.baseParse = null;\n            this.baseTree = done;\n            this.startInner();\n            if (this.stoppedAt != null)\n                for (let inner of this.inner)\n                    inner.parse.stopAt(this.stoppedAt);\n        }\n        if (this.innerDone == this.inner.length) {\n            let result = this.baseTree;\n            if (this.stoppedAt != null)\n                result = new Tree(result.type, result.children, result.positions, result.length, result.propValues.concat([[stoppedInner, this.stoppedAt]]));\n            return result;\n        }\n        let inner = this.inner[this.innerDone], done = inner.parse.advance();\n        if (done) {\n            this.innerDone++;\n            // This is a somewhat dodgy but super helpful hack where we\n            // patch up nodes created by the inner parse (and thus\n            // presumably not aliased anywhere else) to hold the information\n            // about the inner parse.\n            let props = Object.assign(Object.create(null), inner.target.props);\n            props[NodeProp.mounted.id] = new MountedTree(done, inner.overlay, inner.parser);\n            inner.target.props = props;\n        }\n        return null;\n    }\n    get parsedPos() {\n        if (this.baseParse)\n            return 0;\n        let pos = this.input.length;\n        for (let i = this.innerDone; i < this.inner.length; i++) {\n            if (this.inner[i].ranges[0].from < pos)\n                pos = Math.min(pos, this.inner[i].parse.parsedPos);\n        }\n        return pos;\n    }\n    stopAt(pos) {\n        this.stoppedAt = pos;\n        if (this.baseParse)\n            this.baseParse.stopAt(pos);\n        else\n            for (let i = this.innerDone; i < this.inner.length; i++)\n                this.inner[i].parse.stopAt(pos);\n    }\n    startInner() {\n        let fragmentCursor = new FragmentCursor(this.fragments);\n        let overlay = null;\n        let covered = null;\n        let cursor = new TreeCursor(new TreeNode(this.baseTree, this.ranges[0].from, 0, null), IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n        scan: for (let nest, isCovered; this.stoppedAt == null || cursor.from < this.stoppedAt;) {\n            let enter = true, range;\n            if (fragmentCursor.hasNode(cursor)) {\n                if (overlay) {\n                    let match = overlay.mounts.find(m => m.frag.from <= cursor.from && m.frag.to >= cursor.to && m.mount.overlay);\n                    if (match)\n                        for (let r of match.mount.overlay) {\n                            let from = r.from + match.pos, to = r.to + match.pos;\n                            if (from >= cursor.from && to <= cursor.to && !overlay.ranges.some(r => r.from < to && r.to > from))\n                                overlay.ranges.push({ from, to });\n                        }\n                }\n                enter = false;\n            }\n            else if (covered && (isCovered = checkCover(covered.ranges, cursor.from, cursor.to))) {\n                enter = isCovered != 2 /* Cover.Full */;\n            }\n            else if (!cursor.type.isAnonymous && cursor.from < cursor.to && (nest = this.nest(cursor, this.input))) {\n                if (!cursor.tree)\n                    materialize(cursor);\n                let oldMounts = fragmentCursor.findMounts(cursor.from, nest.parser);\n                if (typeof nest.overlay == \"function\") {\n                    overlay = new ActiveOverlay(nest.parser, nest.overlay, oldMounts, this.inner.length, cursor.from, cursor.tree, overlay);\n                }\n                else {\n                    let ranges = punchRanges(this.ranges, nest.overlay || [new Range(cursor.from, cursor.to)]);\n                    if (ranges.length)\n                        this.inner.push(new InnerParse(nest.parser, nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, cursor.tree, ranges));\n                    if (!nest.overlay)\n                        enter = false;\n                    else if (ranges.length)\n                        covered = { ranges, depth: 0, prev: covered };\n                }\n            }\n            else if (overlay && (range = overlay.predicate(cursor))) {\n                if (range === true)\n                    range = new Range(cursor.from, cursor.to);\n                if (range.from < range.to)\n                    overlay.ranges.push(range);\n            }\n            if (enter && cursor.firstChild()) {\n                if (overlay)\n                    overlay.depth++;\n                if (covered)\n                    covered.depth++;\n            }\n            else {\n                for (;;) {\n                    if (cursor.nextSibling())\n                        break;\n                    if (!cursor.parent())\n                        break scan;\n                    if (overlay && !--overlay.depth) {\n                        let ranges = punchRanges(this.ranges, overlay.ranges);\n                        if (ranges.length)\n                            this.inner.splice(overlay.index, 0, new InnerParse(overlay.parser, overlay.parser.startParse(this.input, enterFragments(overlay.mounts, ranges), ranges), overlay.ranges.map(r => new Range(r.from - overlay.start, r.to - overlay.start)), overlay.target, ranges));\n                        overlay = overlay.prev;\n                    }\n                    if (covered && !--covered.depth)\n                        covered = covered.prev;\n                }\n            }\n        }\n    }\n}\nfunction checkCover(covered, from, to) {\n    for (let range of covered) {\n        if (range.from >= to)\n            break;\n        if (range.to > from)\n            return range.from <= from && range.to >= to ? 2 /* Cover.Full */ : 1 /* Cover.Partial */;\n    }\n    return 0 /* Cover.None */;\n}\n// Take a piece of buffer and convert it into a stand-alone\n// TreeBuffer.\nfunction sliceBuf(buf, startI, endI, nodes, positions, off) {\n    if (startI < endI) {\n        let from = buf.buffer[startI + 1];\n        nodes.push(buf.slice(startI, endI, from));\n        positions.push(from - off);\n    }\n}\n// This function takes a node that's in a buffer, and converts it, and\n// its parent buffer nodes, into a Tree. This is again acting on the\n// assumption that the trees and buffers have been constructed by the\n// parse that was ran via the mix parser, and thus aren't shared with\n// any other code, making violations of the immutability safe.\nfunction materialize(cursor) {\n    let { node } = cursor, depth = 0;\n    // Scan up to the nearest tree\n    do {\n        cursor.parent();\n        depth++;\n    } while (!cursor.tree);\n    // Find the index of the buffer in that tree\n    let i = 0, base = cursor.tree, off = 0;\n    for (;; i++) {\n        off = base.positions[i] + cursor.from;\n        if (off <= node.from && off + base.children[i].length >= node.to)\n            break;\n    }\n    let buf = base.children[i], b = buf.buffer;\n    // Split a level in the buffer, putting the nodes before and after\n    // the child that contains `node` into new buffers.\n    function split(startI, endI, type, innerOffset, length) {\n        let i = startI;\n        while (b[i + 2] + off <= node.from)\n            i = b[i + 3];\n        let children = [], positions = [];\n        sliceBuf(buf, startI, i, children, positions, innerOffset);\n        let from = b[i + 1], to = b[i + 2];\n        let isTarget = from + off == node.from && to + off == node.to && b[i] == node.type.id;\n        children.push(isTarget ? node.toTree() : split(i + 4, b[i + 3], buf.set.types[b[i]], from, to - from));\n        positions.push(from - innerOffset);\n        sliceBuf(buf, b[i + 3], endI, children, positions, innerOffset);\n        return new Tree(type, children, positions, length);\n    }\n    base.children[i] = split(0, b.length, NodeType.none, 0, buf.length);\n    // Move the cursor back to the target node\n    for (let d = 0; d <= depth; d++)\n        cursor.childAfter(node.from);\n}\nclass StructureCursor {\n    constructor(root, offset) {\n        this.offset = offset;\n        this.done = false;\n        this.cursor = root.cursor(IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n    }\n    // Move to the first node (in pre-order) that starts at or after `pos`.\n    moveTo(pos) {\n        let { cursor } = this, p = pos - this.offset;\n        while (!this.done && cursor.from < p) {\n            if (cursor.to >= pos && cursor.enter(p, 1, IterMode.IgnoreOverlays | IterMode.ExcludeBuffers)) ;\n            else if (!cursor.next(false))\n                this.done = true;\n        }\n    }\n    hasNode(cursor) {\n        this.moveTo(cursor.from);\n        if (!this.done && this.cursor.from + this.offset == cursor.from && this.cursor.tree) {\n            for (let tree = this.cursor.tree;;) {\n                if (tree == cursor.tree)\n                    return true;\n                if (tree.children.length && tree.positions[0] == 0 && tree.children[0] instanceof Tree)\n                    tree = tree.children[0];\n                else\n                    break;\n            }\n        }\n        return false;\n    }\n}\nclass FragmentCursor {\n    constructor(fragments) {\n        var _a;\n        this.fragments = fragments;\n        this.curTo = 0;\n        this.fragI = 0;\n        if (fragments.length) {\n            let first = this.curFrag = fragments[0];\n            this.curTo = (_a = first.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : first.to;\n            this.inner = new StructureCursor(first.tree, -first.offset);\n        }\n        else {\n            this.curFrag = this.inner = null;\n        }\n    }\n    hasNode(node) {\n        while (this.curFrag && node.from >= this.curTo)\n            this.nextFrag();\n        return this.curFrag && this.curFrag.from <= node.from && this.curTo >= node.to && this.inner.hasNode(node);\n    }\n    nextFrag() {\n        var _a;\n        this.fragI++;\n        if (this.fragI == this.fragments.length) {\n            this.curFrag = this.inner = null;\n        }\n        else {\n            let frag = this.curFrag = this.fragments[this.fragI];\n            this.curTo = (_a = frag.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : frag.to;\n            this.inner = new StructureCursor(frag.tree, -frag.offset);\n        }\n    }\n    findMounts(pos, parser) {\n        var _a;\n        let result = [];\n        if (this.inner) {\n            this.inner.cursor.moveTo(pos, 1);\n            for (let pos = this.inner.cursor.node; pos; pos = pos.parent) {\n                let mount = (_a = pos.tree) === null || _a === void 0 ? void 0 : _a.prop(NodeProp.mounted);\n                if (mount && mount.parser == parser) {\n                    for (let i = this.fragI; i < this.fragments.length; i++) {\n                        let frag = this.fragments[i];\n                        if (frag.from >= pos.to)\n                            break;\n                        if (frag.tree == this.curFrag.tree)\n                            result.push({\n                                frag,\n                                pos: pos.from - frag.offset,\n                                mount\n                            });\n                    }\n                }\n            }\n        }\n        return result;\n    }\n}\nfunction punchRanges(outer, ranges) {\n    let copy = null, current = ranges;\n    for (let i = 1, j = 0; i < outer.length; i++) {\n        let gapFrom = outer[i - 1].to, gapTo = outer[i].from;\n        for (; j < current.length; j++) {\n            let r = current[j];\n            if (r.from >= gapTo)\n                break;\n            if (r.to <= gapFrom)\n                continue;\n            if (!copy)\n                current = copy = ranges.slice();\n            if (r.from < gapFrom) {\n                copy[j] = new Range(r.from, gapFrom);\n                if (r.to > gapTo)\n                    copy.splice(j + 1, 0, new Range(gapTo, r.to));\n            }\n            else if (r.to > gapTo) {\n                copy[j--] = new Range(gapTo, r.to);\n            }\n            else {\n                copy.splice(j--, 1);\n            }\n        }\n    }\n    return current;\n}\nfunction findCoverChanges(a, b, from, to) {\n    let iA = 0, iB = 0, inA = false, inB = false, pos = -1e9;\n    let result = [];\n    for (;;) {\n        let nextA = iA == a.length ? 1e9 : inA ? a[iA].to : a[iA].from;\n        let nextB = iB == b.length ? 1e9 : inB ? b[iB].to : b[iB].from;\n        if (inA != inB) {\n            let start = Math.max(pos, from), end = Math.min(nextA, nextB, to);\n            if (start < end)\n                result.push(new Range(start, end));\n        }\n        pos = Math.min(nextA, nextB);\n        if (pos == 1e9)\n            break;\n        if (nextA == pos) {\n            if (!inA)\n                inA = true;\n            else {\n                inA = false;\n                iA++;\n            }\n        }\n        if (nextB == pos) {\n            if (!inB)\n                inB = true;\n            else {\n                inB = false;\n                iB++;\n            }\n        }\n    }\n    return result;\n}\n// Given a number of fragments for the outer tree, and a set of ranges\n// to parse, find fragments for inner trees mounted around those\n// ranges, if any.\nfunction enterFragments(mounts, ranges) {\n    let result = [];\n    for (let { pos, mount, frag } of mounts) {\n        let startPos = pos + (mount.overlay ? mount.overlay[0].from : 0), endPos = startPos + mount.tree.length;\n        let from = Math.max(frag.from, startPos), to = Math.min(frag.to, endPos);\n        if (mount.overlay) {\n            let overlay = mount.overlay.map(r => new Range(r.from + pos, r.to + pos));\n            let changes = findCoverChanges(ranges, overlay, from, to);\n            for (let i = 0, pos = from;; i++) {\n                let last = i == changes.length, end = last ? to : changes[i].from;\n                if (end > pos)\n                    result.push(new TreeFragment(pos, end, mount.tree, -startPos, frag.from >= pos || frag.openStart, frag.to <= end || frag.openEnd));\n                if (last)\n                    break;\n                pos = changes[i].to;\n            }\n        }\n        else {\n            result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos || frag.openStart, frag.to <= endPos || frag.openEnd));\n        }\n    }\n    return result;\n}\n\nexport { DefaultBufferLength, IterMode, MountedTree, NodeProp, NodeSet, NodeType, NodeWeakMap, Parser, Tree, TreeBuffer, TreeCursor, TreeFragment, parseMixed };\n", "import { Parser, NodeProp, NodeSet, NodeType, DefaultBufferLength, Tree, IterMode } from '@lezer/common';\n\n/// A parse stack. These are used internally by the parser to track\n/// parsing progress. They also provide some properties and methods\n/// that external code such as a tokenizer can use to get information\n/// about the parse state.\nclass Stack {\n    /// @internal\n    constructor(\n    /// The parse that this stack is part of @internal\n    p, \n    /// Holds state, input pos, buffer index triplets for all but the\n    /// top state @internal\n    stack, \n    /// The current parse state @internal\n    state, \n    // The position at which the next reduce should take place. This\n    // can be less than `this.pos` when skipped expressions have been\n    // added to the stack (which should be moved outside of the next\n    // reduction)\n    /// @internal\n    reducePos, \n    /// The input position up to which this stack has parsed.\n    pos, \n    /// The dynamic score of the stack, including dynamic precedence\n    /// and error-recovery penalties\n    /// @internal\n    score, \n    // The output buffer. Holds (type, start, end, size) quads\n    // representing nodes created by the parser, where `size` is\n    // amount of buffer array entries covered by this node.\n    /// @internal\n    buffer, \n    // The base offset of the buffer. When stacks are split, the split\n    // instance shared the buffer history with its parent up to\n    // `bufferBase`, which is the absolute offset (including the\n    // offset of previous splits) into the buffer at which this stack\n    // starts writing.\n    /// @internal\n    bufferBase, \n    /// @internal\n    curContext, \n    /// @internal\n    lookAhead = 0, \n    // A parent stack from which this was split off, if any. This is\n    // set up so that it always points to a stack that has some\n    // additional buffer content, never to a stack with an equal\n    // `bufferBase`.\n    /// @internal\n    parent) {\n        this.p = p;\n        this.stack = stack;\n        this.state = state;\n        this.reducePos = reducePos;\n        this.pos = pos;\n        this.score = score;\n        this.buffer = buffer;\n        this.bufferBase = bufferBase;\n        this.curContext = curContext;\n        this.lookAhead = lookAhead;\n        this.parent = parent;\n    }\n    /// @internal\n    toString() {\n        return `[${this.stack.filter((_, i) => i % 3 == 0).concat(this.state)}]@${this.pos}${this.score ? \"!\" + this.score : \"\"}`;\n    }\n    // Start an empty stack\n    /// @internal\n    static start(p, state, pos = 0) {\n        let cx = p.parser.context;\n        return new Stack(p, [], state, pos, pos, 0, [], 0, cx ? new StackContext(cx, cx.start) : null, 0, null);\n    }\n    /// The stack's current [context](#lr.ContextTracker) value, if\n    /// any. Its type will depend on the context tracker's type\n    /// parameter, or it will be `null` if there is no context\n    /// tracker.\n    get context() { return this.curContext ? this.curContext.context : null; }\n    // Push a state onto the stack, tracking its start position as well\n    // as the buffer base at that point.\n    /// @internal\n    pushState(state, start) {\n        this.stack.push(this.state, start, this.bufferBase + this.buffer.length);\n        this.state = state;\n    }\n    // Apply a reduce action\n    /// @internal\n    reduce(action) {\n        var _a;\n        let depth = action >> 19 /* Action.ReduceDepthShift */, type = action & 65535 /* Action.ValueMask */;\n        let { parser } = this.p;\n        let dPrec = parser.dynamicPrecedence(type);\n        if (dPrec)\n            this.score += dPrec;\n        if (depth == 0) {\n            this.pushState(parser.getGoto(this.state, type, true), this.reducePos);\n            // Zero-depth reductions are a special case\u2014they add stuff to\n            // the stack without popping anything off.\n            if (type < parser.minRepeatTerm)\n                this.storeNode(type, this.reducePos, this.reducePos, 4, true);\n            this.reduceContext(type, this.reducePos);\n            return;\n        }\n        // Find the base index into `this.stack`, content after which will\n        // be dropped. Note that with `StayFlag` reductions we need to\n        // consume two extra frames (the dummy parent node for the skipped\n        // expression and the state that we'll be staying in, which should\n        // be moved to `this.state`).\n        let base = this.stack.length - ((depth - 1) * 3) - (action & 262144 /* Action.StayFlag */ ? 6 : 0);\n        let start = base ? this.stack[base - 2] : this.p.ranges[0].from, size = this.reducePos - start;\n        // This is a kludge to try and detect overly deep left-associative\n        // trees, which will not increase the parse stack depth and thus\n        // won't be caught by the regular stack-depth limit check.\n        if (size >= 2000 /* Recover.MinBigReduction */ && !((_a = this.p.parser.nodeSet.types[type]) === null || _a === void 0 ? void 0 : _a.isAnonymous)) {\n            if (start == this.p.lastBigReductionStart) {\n                this.p.bigReductionCount++;\n                this.p.lastBigReductionSize = size;\n            }\n            else if (this.p.lastBigReductionSize < size) {\n                this.p.bigReductionCount = 1;\n                this.p.lastBigReductionStart = start;\n                this.p.lastBigReductionSize = size;\n            }\n        }\n        let bufferBase = base ? this.stack[base - 1] : 0, count = this.bufferBase + this.buffer.length - bufferBase;\n        // Store normal terms or `R -> R R` repeat reductions\n        if (type < parser.minRepeatTerm || (action & 131072 /* Action.RepeatFlag */)) {\n            let pos = parser.stateFlag(this.state, 1 /* StateFlag.Skipped */) ? this.pos : this.reducePos;\n            this.storeNode(type, start, pos, count + 4, true);\n        }\n        if (action & 262144 /* Action.StayFlag */) {\n            this.state = this.stack[base];\n        }\n        else {\n            let baseStateID = this.stack[base - 3];\n            this.state = parser.getGoto(baseStateID, type, true);\n        }\n        while (this.stack.length > base)\n            this.stack.pop();\n        this.reduceContext(type, start);\n    }\n    // Shift a value into the buffer\n    /// @internal\n    storeNode(term, start, end, size = 4, isReduce = false) {\n        if (term == 0 /* Term.Err */ &&\n            (!this.stack.length || this.stack[this.stack.length - 1] < this.buffer.length + this.bufferBase)) {\n            // Try to omit/merge adjacent error nodes\n            let cur = this, top = this.buffer.length;\n            if (top == 0 && cur.parent) {\n                top = cur.bufferBase - cur.parent.bufferBase;\n                cur = cur.parent;\n            }\n            if (top > 0 && cur.buffer[top - 4] == 0 /* Term.Err */ && cur.buffer[top - 1] > -1) {\n                if (start == end)\n                    return;\n                if (cur.buffer[top - 2] >= start) {\n                    cur.buffer[top - 2] = end;\n                    return;\n                }\n            }\n        }\n        if (!isReduce || this.pos == end) { // Simple case, just append\n            this.buffer.push(term, start, end, size);\n        }\n        else { // There may be skipped nodes that have to be moved forward\n            let index = this.buffer.length;\n            if (index > 0 && this.buffer[index - 4] != 0 /* Term.Err */)\n                while (index > 0 && this.buffer[index - 2] > end) {\n                    // Move this record forward\n                    this.buffer[index] = this.buffer[index - 4];\n                    this.buffer[index + 1] = this.buffer[index - 3];\n                    this.buffer[index + 2] = this.buffer[index - 2];\n                    this.buffer[index + 3] = this.buffer[index - 1];\n                    index -= 4;\n                    if (size > 4)\n                        size -= 4;\n                }\n            this.buffer[index] = term;\n            this.buffer[index + 1] = start;\n            this.buffer[index + 2] = end;\n            this.buffer[index + 3] = size;\n        }\n    }\n    // Apply a shift action\n    /// @internal\n    shift(action, next, nextEnd) {\n        let start = this.pos;\n        if (action & 131072 /* Action.GotoFlag */) {\n            this.pushState(action & 65535 /* Action.ValueMask */, this.pos);\n        }\n        else if ((action & 262144 /* Action.StayFlag */) == 0) { // Regular shift\n            let nextState = action, { parser } = this.p;\n            if (nextEnd > this.pos || next <= parser.maxNode) {\n                this.pos = nextEnd;\n                if (!parser.stateFlag(nextState, 1 /* StateFlag.Skipped */))\n                    this.reducePos = nextEnd;\n            }\n            this.pushState(nextState, start);\n            this.shiftContext(next, start);\n            if (next <= parser.maxNode)\n                this.buffer.push(next, start, nextEnd, 4);\n        }\n        else { // Shift-and-stay, which means this is a skipped token\n            this.pos = nextEnd;\n            this.shiftContext(next, start);\n            if (next <= this.p.parser.maxNode)\n                this.buffer.push(next, start, nextEnd, 4);\n        }\n    }\n    // Apply an action\n    /// @internal\n    apply(action, next, nextEnd) {\n        if (action & 65536 /* Action.ReduceFlag */)\n            this.reduce(action);\n        else\n            this.shift(action, next, nextEnd);\n    }\n    // Add a prebuilt (reused) node into the buffer.\n    /// @internal\n    useNode(value, next) {\n        let index = this.p.reused.length - 1;\n        if (index < 0 || this.p.reused[index] != value) {\n            this.p.reused.push(value);\n            index++;\n        }\n        let start = this.pos;\n        this.reducePos = this.pos = start + value.length;\n        this.pushState(next, start);\n        this.buffer.push(index, start, this.reducePos, -1 /* size == -1 means this is a reused value */);\n        if (this.curContext)\n            this.updateContext(this.curContext.tracker.reuse(this.curContext.context, value, this, this.p.stream.reset(this.pos - value.length)));\n    }\n    // Split the stack. Due to the buffer sharing and the fact\n    // that `this.stack` tends to stay quite shallow, this isn't very\n    // expensive.\n    /// @internal\n    split() {\n        let parent = this;\n        let off = parent.buffer.length;\n        // Because the top of the buffer (after this.pos) may be mutated\n        // to reorder reductions and skipped tokens, and shared buffers\n        // should be immutable, this copies any outstanding skipped tokens\n        // to the new buffer, and puts the base pointer before them.\n        while (off > 0 && parent.buffer[off - 2] > parent.reducePos)\n            off -= 4;\n        let buffer = parent.buffer.slice(off), base = parent.bufferBase + off;\n        // Make sure parent points to an actual parent with content, if there is such a parent.\n        while (parent && base == parent.bufferBase)\n            parent = parent.parent;\n        return new Stack(this.p, this.stack.slice(), this.state, this.reducePos, this.pos, this.score, buffer, base, this.curContext, this.lookAhead, parent);\n    }\n    // Try to recover from an error by 'deleting' (ignoring) one token.\n    /// @internal\n    recoverByDelete(next, nextEnd) {\n        let isNode = next <= this.p.parser.maxNode;\n        if (isNode)\n            this.storeNode(next, this.pos, nextEnd, 4);\n        this.storeNode(0 /* Term.Err */, this.pos, nextEnd, isNode ? 8 : 4);\n        this.pos = this.reducePos = nextEnd;\n        this.score -= 190 /* Recover.Delete */;\n    }\n    /// Check if the given term would be able to be shifted (optionally\n    /// after some reductions) on this stack. This can be useful for\n    /// external tokenizers that want to make sure they only provide a\n    /// given token when it applies.\n    canShift(term) {\n        for (let sim = new SimulatedStack(this);;) {\n            let action = this.p.parser.stateSlot(sim.state, 4 /* ParseState.DefaultReduce */) || this.p.parser.hasAction(sim.state, term);\n            if (action == 0)\n                return false;\n            if ((action & 65536 /* Action.ReduceFlag */) == 0)\n                return true;\n            sim.reduce(action);\n        }\n    }\n    // Apply up to Recover.MaxNext recovery actions that conceptually\n    // inserts some missing token or rule.\n    /// @internal\n    recoverByInsert(next) {\n        if (this.stack.length >= 300 /* Recover.MaxInsertStackDepth */)\n            return [];\n        let nextStates = this.p.parser.nextStates(this.state);\n        if (nextStates.length > 4 /* Recover.MaxNext */ << 1 || this.stack.length >= 120 /* Recover.DampenInsertStackDepth */) {\n            let best = [];\n            for (let i = 0, s; i < nextStates.length; i += 2) {\n                if ((s = nextStates[i + 1]) != this.state && this.p.parser.hasAction(s, next))\n                    best.push(nextStates[i], s);\n            }\n            if (this.stack.length < 120 /* Recover.DampenInsertStackDepth */)\n                for (let i = 0; best.length < 4 /* Recover.MaxNext */ << 1 && i < nextStates.length; i += 2) {\n                    let s = nextStates[i + 1];\n                    if (!best.some((v, i) => (i & 1) && v == s))\n                        best.push(nextStates[i], s);\n                }\n            nextStates = best;\n        }\n        let result = [];\n        for (let i = 0; i < nextStates.length && result.length < 4 /* Recover.MaxNext */; i += 2) {\n            let s = nextStates[i + 1];\n            if (s == this.state)\n                continue;\n            let stack = this.split();\n            stack.pushState(s, this.pos);\n            stack.storeNode(0 /* Term.Err */, stack.pos, stack.pos, 4, true);\n            stack.shiftContext(nextStates[i], this.pos);\n            stack.score -= 200 /* Recover.Insert */;\n            result.push(stack);\n        }\n        return result;\n    }\n    // Force a reduce, if possible. Return false if that can't\n    // be done.\n    /// @internal\n    forceReduce() {\n        let { parser } = this.p;\n        let reduce = parser.stateSlot(this.state, 5 /* ParseState.ForcedReduce */);\n        if ((reduce & 65536 /* Action.ReduceFlag */) == 0)\n            return false;\n        if (!parser.validAction(this.state, reduce)) {\n            let depth = reduce >> 19 /* Action.ReduceDepthShift */, term = reduce & 65535 /* Action.ValueMask */;\n            let target = this.stack.length - depth * 3;\n            if (target < 0 || parser.getGoto(this.stack[target], term, false) < 0) {\n                let backup = this.findForcedReduction();\n                if (backup == null)\n                    return false;\n                reduce = backup;\n            }\n            this.storeNode(0 /* Term.Err */, this.pos, this.pos, 4, true);\n            this.score -= 100 /* Recover.Reduce */;\n        }\n        this.reducePos = this.pos;\n        this.reduce(reduce);\n        return true;\n    }\n    /// Try to scan through the automaton to find some kind of reduction\n    /// that can be applied. Used when the regular ForcedReduce field\n    /// isn't a valid action. @internal\n    findForcedReduction() {\n        let { parser } = this.p, seen = [];\n        let explore = (state, depth) => {\n            if (seen.includes(state))\n                return;\n            seen.push(state);\n            return parser.allActions(state, (action) => {\n                if (action & (262144 /* Action.StayFlag */ | 131072 /* Action.GotoFlag */)) ;\n                else if (action & 65536 /* Action.ReduceFlag */) {\n                    let rDepth = (action >> 19 /* Action.ReduceDepthShift */) - depth;\n                    if (rDepth > 1) {\n                        let term = action & 65535 /* Action.ValueMask */, target = this.stack.length - rDepth * 3;\n                        if (target >= 0 && parser.getGoto(this.stack[target], term, false) >= 0)\n                            return (rDepth << 19 /* Action.ReduceDepthShift */) | 65536 /* Action.ReduceFlag */ | term;\n                    }\n                }\n                else {\n                    let found = explore(action, depth + 1);\n                    if (found != null)\n                        return found;\n                }\n            });\n        };\n        return explore(this.state, 0);\n    }\n    /// @internal\n    forceAll() {\n        while (!this.p.parser.stateFlag(this.state, 2 /* StateFlag.Accepting */)) {\n            if (!this.forceReduce()) {\n                this.storeNode(0 /* Term.Err */, this.pos, this.pos, 4, true);\n                break;\n            }\n        }\n        return this;\n    }\n    /// Check whether this state has no further actions (assumed to be a direct descendant of the\n    /// top state, since any other states must be able to continue\n    /// somehow). @internal\n    get deadEnd() {\n        if (this.stack.length != 3)\n            return false;\n        let { parser } = this.p;\n        return parser.data[parser.stateSlot(this.state, 1 /* ParseState.Actions */)] == 65535 /* Seq.End */ &&\n            !parser.stateSlot(this.state, 4 /* ParseState.DefaultReduce */);\n    }\n    /// Restart the stack (put it back in its start state). Only safe\n    /// when this.stack.length == 3 (state is directly below the top\n    /// state). @internal\n    restart() {\n        this.state = this.stack[0];\n        this.stack.length = 0;\n    }\n    /// @internal\n    sameState(other) {\n        if (this.state != other.state || this.stack.length != other.stack.length)\n            return false;\n        for (let i = 0; i < this.stack.length; i += 3)\n            if (this.stack[i] != other.stack[i])\n                return false;\n        return true;\n    }\n    /// Get the parser used by this stack.\n    get parser() { return this.p.parser; }\n    /// Test whether a given dialect (by numeric ID, as exported from\n    /// the terms file) is enabled.\n    dialectEnabled(dialectID) { return this.p.parser.dialect.flags[dialectID]; }\n    shiftContext(term, start) {\n        if (this.curContext)\n            this.updateContext(this.curContext.tracker.shift(this.curContext.context, term, this, this.p.stream.reset(start)));\n    }\n    reduceContext(term, start) {\n        if (this.curContext)\n            this.updateContext(this.curContext.tracker.reduce(this.curContext.context, term, this, this.p.stream.reset(start)));\n    }\n    /// @internal\n    emitContext() {\n        let last = this.buffer.length - 1;\n        if (last < 0 || this.buffer[last] != -3)\n            this.buffer.push(this.curContext.hash, this.pos, this.pos, -3);\n    }\n    /// @internal\n    emitLookAhead() {\n        let last = this.buffer.length - 1;\n        if (last < 0 || this.buffer[last] != -4)\n            this.buffer.push(this.lookAhead, this.pos, this.pos, -4);\n    }\n    updateContext(context) {\n        if (context != this.curContext.context) {\n            let newCx = new StackContext(this.curContext.tracker, context);\n            if (newCx.hash != this.curContext.hash)\n                this.emitContext();\n            this.curContext = newCx;\n        }\n    }\n    /// @internal\n    setLookAhead(lookAhead) {\n        if (lookAhead > this.lookAhead) {\n            this.emitLookAhead();\n            this.lookAhead = lookAhead;\n        }\n    }\n    /// @internal\n    close() {\n        if (this.curContext && this.curContext.tracker.strict)\n            this.emitContext();\n        if (this.lookAhead > 0)\n            this.emitLookAhead();\n    }\n}\nclass StackContext {\n    constructor(tracker, context) {\n        this.tracker = tracker;\n        this.context = context;\n        this.hash = tracker.strict ? tracker.hash(context) : 0;\n    }\n}\nvar Recover;\n(function (Recover) {\n    Recover[Recover[\"Insert\"] = 200] = \"Insert\";\n    Recover[Recover[\"Delete\"] = 190] = \"Delete\";\n    Recover[Recover[\"Reduce\"] = 100] = \"Reduce\";\n    Recover[Recover[\"MaxNext\"] = 4] = \"MaxNext\";\n    Recover[Recover[\"MaxInsertStackDepth\"] = 300] = \"MaxInsertStackDepth\";\n    Recover[Recover[\"DampenInsertStackDepth\"] = 120] = \"DampenInsertStackDepth\";\n    Recover[Recover[\"MinBigReduction\"] = 2000] = \"MinBigReduction\";\n})(Recover || (Recover = {}));\n// Used to cheaply run some reductions to scan ahead without mutating\n// an entire stack\nclass SimulatedStack {\n    constructor(start) {\n        this.start = start;\n        this.state = start.state;\n        this.stack = start.stack;\n        this.base = this.stack.length;\n    }\n    reduce(action) {\n        let term = action & 65535 /* Action.ValueMask */, depth = action >> 19 /* Action.ReduceDepthShift */;\n        if (depth == 0) {\n            if (this.stack == this.start.stack)\n                this.stack = this.stack.slice();\n            this.stack.push(this.state, 0, 0);\n            this.base += 3;\n        }\n        else {\n            this.base -= (depth - 1) * 3;\n        }\n        let goto = this.start.p.parser.getGoto(this.stack[this.base - 3], term, true);\n        this.state = goto;\n    }\n}\n// This is given to `Tree.build` to build a buffer, and encapsulates\n// the parent-stack-walking necessary to read the nodes.\nclass StackBufferCursor {\n    constructor(stack, pos, index) {\n        this.stack = stack;\n        this.pos = pos;\n        this.index = index;\n        this.buffer = stack.buffer;\n        if (this.index == 0)\n            this.maybeNext();\n    }\n    static create(stack, pos = stack.bufferBase + stack.buffer.length) {\n        return new StackBufferCursor(stack, pos, pos - stack.bufferBase);\n    }\n    maybeNext() {\n        let next = this.stack.parent;\n        if (next != null) {\n            this.index = this.stack.bufferBase - next.bufferBase;\n            this.stack = next;\n            this.buffer = next.buffer;\n        }\n    }\n    get id() { return this.buffer[this.index - 4]; }\n    get start() { return this.buffer[this.index - 3]; }\n    get end() { return this.buffer[this.index - 2]; }\n    get size() { return this.buffer[this.index - 1]; }\n    next() {\n        this.index -= 4;\n        this.pos -= 4;\n        if (this.index == 0)\n            this.maybeNext();\n    }\n    fork() {\n        return new StackBufferCursor(this.stack, this.pos, this.index);\n    }\n}\n\n// See lezer-generator/src/encode.ts for comments about the encoding\n// used here\nfunction decodeArray(input, Type = Uint16Array) {\n    if (typeof input != \"string\")\n        return input;\n    let array = null;\n    for (let pos = 0, out = 0; pos < input.length;) {\n        let value = 0;\n        for (;;) {\n            let next = input.charCodeAt(pos++), stop = false;\n            if (next == 126 /* Encode.BigValCode */) {\n                value = 65535 /* Encode.BigVal */;\n                break;\n            }\n            if (next >= 92 /* Encode.Gap2 */)\n                next--;\n            if (next >= 34 /* Encode.Gap1 */)\n                next--;\n            let digit = next - 32 /* Encode.Start */;\n            if (digit >= 46 /* Encode.Base */) {\n                digit -= 46 /* Encode.Base */;\n                stop = true;\n            }\n            value += digit;\n            if (stop)\n                break;\n            value *= 46 /* Encode.Base */;\n        }\n        if (array)\n            array[out++] = value;\n        else\n            array = new Type(value);\n    }\n    return array;\n}\n\nclass CachedToken {\n    constructor() {\n        this.start = -1;\n        this.value = -1;\n        this.end = -1;\n        this.extended = -1;\n        this.lookAhead = 0;\n        this.mask = 0;\n        this.context = 0;\n    }\n}\nconst nullToken = new CachedToken;\n/// [Tokenizers](#lr.ExternalTokenizer) interact with the input\n/// through this interface. It presents the input as a stream of\n/// characters, tracking lookahead and hiding the complexity of\n/// [ranges](#common.Parser.parse^ranges) from tokenizer code.\nclass InputStream {\n    /// @internal\n    constructor(\n    /// @internal\n    input, \n    /// @internal\n    ranges) {\n        this.input = input;\n        this.ranges = ranges;\n        /// @internal\n        this.chunk = \"\";\n        /// @internal\n        this.chunkOff = 0;\n        /// Backup chunk\n        this.chunk2 = \"\";\n        this.chunk2Pos = 0;\n        /// The character code of the next code unit in the input, or -1\n        /// when the stream is at the end of the input.\n        this.next = -1;\n        /// @internal\n        this.token = nullToken;\n        this.rangeIndex = 0;\n        this.pos = this.chunkPos = ranges[0].from;\n        this.range = ranges[0];\n        this.end = ranges[ranges.length - 1].to;\n        this.readNext();\n    }\n    /// @internal\n    resolveOffset(offset, assoc) {\n        let range = this.range, index = this.rangeIndex;\n        let pos = this.pos + offset;\n        while (pos < range.from) {\n            if (!index)\n                return null;\n            let next = this.ranges[--index];\n            pos -= range.from - next.to;\n            range = next;\n        }\n        while (assoc < 0 ? pos > range.to : pos >= range.to) {\n            if (index == this.ranges.length - 1)\n                return null;\n            let next = this.ranges[++index];\n            pos += next.from - range.to;\n            range = next;\n        }\n        return pos;\n    }\n    /// @internal\n    clipPos(pos) {\n        if (pos >= this.range.from && pos < this.range.to)\n            return pos;\n        for (let range of this.ranges)\n            if (range.to > pos)\n                return Math.max(pos, range.from);\n        return this.end;\n    }\n    /// Look at a code unit near the stream position. `.peek(0)` equals\n    /// `.next`, `.peek(-1)` gives you the previous character, and so\n    /// on.\n    ///\n    /// Note that looking around during tokenizing creates dependencies\n    /// on potentially far-away content, which may reduce the\n    /// effectiveness incremental parsing\u2014when looking forward\u2014or even\n    /// cause invalid reparses when looking backward more than 25 code\n    /// units, since the library does not track lookbehind.\n    peek(offset) {\n        let idx = this.chunkOff + offset, pos, result;\n        if (idx >= 0 && idx < this.chunk.length) {\n            pos = this.pos + offset;\n            result = this.chunk.charCodeAt(idx);\n        }\n        else {\n            let resolved = this.resolveOffset(offset, 1);\n            if (resolved == null)\n                return -1;\n            pos = resolved;\n            if (pos >= this.chunk2Pos && pos < this.chunk2Pos + this.chunk2.length) {\n                result = this.chunk2.charCodeAt(pos - this.chunk2Pos);\n            }\n            else {\n                let i = this.rangeIndex, range = this.range;\n                while (range.to <= pos)\n                    range = this.ranges[++i];\n                this.chunk2 = this.input.chunk(this.chunk2Pos = pos);\n                if (pos + this.chunk2.length > range.to)\n                    this.chunk2 = this.chunk2.slice(0, range.to - pos);\n                result = this.chunk2.charCodeAt(0);\n            }\n        }\n        if (pos >= this.token.lookAhead)\n            this.token.lookAhead = pos + 1;\n        return result;\n    }\n    /// Accept a token. By default, the end of the token is set to the\n    /// current stream position, but you can pass an offset (relative to\n    /// the stream position) to change that.\n    acceptToken(token, endOffset = 0) {\n        let end = endOffset ? this.resolveOffset(endOffset, -1) : this.pos;\n        if (end == null || end < this.token.start)\n            throw new RangeError(\"Token end out of bounds\");\n        this.token.value = token;\n        this.token.end = end;\n    }\n    getChunk() {\n        if (this.pos >= this.chunk2Pos && this.pos < this.chunk2Pos + this.chunk2.length) {\n            let { chunk, chunkPos } = this;\n            this.chunk = this.chunk2;\n            this.chunkPos = this.chunk2Pos;\n            this.chunk2 = chunk;\n            this.chunk2Pos = chunkPos;\n            this.chunkOff = this.pos - this.chunkPos;\n        }\n        else {\n            this.chunk2 = this.chunk;\n            this.chunk2Pos = this.chunkPos;\n            let nextChunk = this.input.chunk(this.pos);\n            let end = this.pos + nextChunk.length;\n            this.chunk = end > this.range.to ? nextChunk.slice(0, this.range.to - this.pos) : nextChunk;\n            this.chunkPos = this.pos;\n            this.chunkOff = 0;\n        }\n    }\n    readNext() {\n        if (this.chunkOff >= this.chunk.length) {\n            this.getChunk();\n            if (this.chunkOff == this.chunk.length)\n                return this.next = -1;\n        }\n        return this.next = this.chunk.charCodeAt(this.chunkOff);\n    }\n    /// Move the stream forward N (defaults to 1) code units. Returns\n    /// the new value of [`next`](#lr.InputStream.next).\n    advance(n = 1) {\n        this.chunkOff += n;\n        while (this.pos + n >= this.range.to) {\n            if (this.rangeIndex == this.ranges.length - 1)\n                return this.setDone();\n            n -= this.range.to - this.pos;\n            this.range = this.ranges[++this.rangeIndex];\n            this.pos = this.range.from;\n        }\n        this.pos += n;\n        if (this.pos >= this.token.lookAhead)\n            this.token.lookAhead = this.pos + 1;\n        return this.readNext();\n    }\n    setDone() {\n        this.pos = this.chunkPos = this.end;\n        this.range = this.ranges[this.rangeIndex = this.ranges.length - 1];\n        this.chunk = \"\";\n        return this.next = -1;\n    }\n    /// @internal\n    reset(pos, token) {\n        if (token) {\n            this.token = token;\n            token.start = pos;\n            token.lookAhead = pos + 1;\n            token.value = token.extended = -1;\n        }\n        else {\n            this.token = nullToken;\n        }\n        if (this.pos != pos) {\n            this.pos = pos;\n            if (pos == this.end) {\n                this.setDone();\n                return this;\n            }\n            while (pos < this.range.from)\n                this.range = this.ranges[--this.rangeIndex];\n            while (pos >= this.range.to)\n                this.range = this.ranges[++this.rangeIndex];\n            if (pos >= this.chunkPos && pos < this.chunkPos + this.chunk.length) {\n                this.chunkOff = pos - this.chunkPos;\n            }\n            else {\n                this.chunk = \"\";\n                this.chunkOff = 0;\n            }\n            this.readNext();\n        }\n        return this;\n    }\n    /// @internal\n    read(from, to) {\n        if (from >= this.chunkPos && to <= this.chunkPos + this.chunk.length)\n            return this.chunk.slice(from - this.chunkPos, to - this.chunkPos);\n        if (from >= this.chunk2Pos && to <= this.chunk2Pos + this.chunk2.length)\n            return this.chunk2.slice(from - this.chunk2Pos, to - this.chunk2Pos);\n        if (from >= this.range.from && to <= this.range.to)\n            return this.input.read(from, to);\n        let result = \"\";\n        for (let r of this.ranges) {\n            if (r.from >= to)\n                break;\n            if (r.to > from)\n                result += this.input.read(Math.max(r.from, from), Math.min(r.to, to));\n        }\n        return result;\n    }\n}\n/// @internal\nclass TokenGroup {\n    constructor(data, id) {\n        this.data = data;\n        this.id = id;\n    }\n    token(input, stack) {\n        let { parser } = stack.p;\n        readToken(this.data, input, stack, this.id, parser.data, parser.tokenPrecTable);\n    }\n}\nTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;\n/// @hide\nclass LocalTokenGroup {\n    constructor(data, precTable, elseToken) {\n        this.precTable = precTable;\n        this.elseToken = elseToken;\n        this.data = typeof data == \"string\" ? decodeArray(data) : data;\n    }\n    token(input, stack) {\n        let start = input.pos, skipped = 0;\n        for (;;) {\n            let atEof = input.next < 0, nextPos = input.resolveOffset(1, 1);\n            readToken(this.data, input, stack, 0, this.data, this.precTable);\n            if (input.token.value > -1)\n                break;\n            if (this.elseToken == null)\n                return;\n            if (!atEof)\n                skipped++;\n            if (nextPos == null)\n                break;\n            input.reset(nextPos, input.token);\n        }\n        if (skipped) {\n            input.reset(start, input.token);\n            input.acceptToken(this.elseToken, skipped);\n        }\n    }\n}\nLocalTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;\n/// `@external tokens` declarations in the grammar should resolve to\n/// an instance of this class.\nclass ExternalTokenizer {\n    /// Create a tokenizer. The first argument is the function that,\n    /// given an input stream, scans for the types of tokens it\n    /// recognizes at the stream's position, and calls\n    /// [`acceptToken`](#lr.InputStream.acceptToken) when it finds\n    /// one.\n    constructor(\n    /// @internal\n    token, options = {}) {\n        this.token = token;\n        this.contextual = !!options.contextual;\n        this.fallback = !!options.fallback;\n        this.extend = !!options.extend;\n    }\n}\n// Tokenizer data is stored a big uint16 array containing, for each\n// state:\n//\n//  - A group bitmask, indicating what token groups are reachable from\n//    this state, so that paths that can only lead to tokens not in\n//    any of the current groups can be cut off early.\n//\n//  - The position of the end of the state's sequence of accepting\n//    tokens\n//\n//  - The number of outgoing edges for the state\n//\n//  - The accepting tokens, as (token id, group mask) pairs\n//\n//  - The outgoing edges, as (start character, end character, state\n//    index) triples, with end character being exclusive\n//\n// This function interprets that data, running through a stream as\n// long as new states with the a matching group mask can be reached,\n// and updating `input.token` when it matches a token.\nfunction readToken(data, input, stack, group, precTable, precOffset) {\n    let state = 0, groupMask = 1 << group, { dialect } = stack.p.parser;\n    scan: for (;;) {\n        if ((groupMask & data[state]) == 0)\n            break;\n        let accEnd = data[state + 1];\n        // Check whether this state can lead to a token in the current group\n        // Accept tokens in this state, possibly overwriting\n        // lower-precedence / shorter tokens\n        for (let i = state + 3; i < accEnd; i += 2)\n            if ((data[i + 1] & groupMask) > 0) {\n                let term = data[i];\n                if (dialect.allows(term) &&\n                    (input.token.value == -1 || input.token.value == term ||\n                        overrides(term, input.token.value, precTable, precOffset))) {\n                    input.acceptToken(term);\n                    break;\n                }\n            }\n        let next = input.next, low = 0, high = data[state + 2];\n        // Special case for EOF\n        if (input.next < 0 && high > low && data[accEnd + high * 3 - 3] == 65535 /* Seq.End */ && data[accEnd + high * 3 - 3] == 65535 /* Seq.End */) {\n            state = data[accEnd + high * 3 - 1];\n            continue scan;\n        }\n        // Do a binary search on the state's edges\n        for (; low < high;) {\n            let mid = (low + high) >> 1;\n            let index = accEnd + mid + (mid << 1);\n            let from = data[index], to = data[index + 1] || 0x10000;\n            if (next < from)\n                high = mid;\n            else if (next >= to)\n                low = mid + 1;\n            else {\n                state = data[index + 2];\n                input.advance();\n                continue scan;\n            }\n        }\n        break;\n    }\n}\nfunction findOffset(data, start, term) {\n    for (let i = start, next; (next = data[i]) != 65535 /* Seq.End */; i++)\n        if (next == term)\n            return i - start;\n    return -1;\n}\nfunction overrides(token, prev, tableData, tableOffset) {\n    let iPrev = findOffset(tableData, tableOffset, prev);\n    return iPrev < 0 || findOffset(tableData, tableOffset, token) < iPrev;\n}\n\n// Environment variable used to control console output\nconst verbose = typeof process != \"undefined\" && process.env && /\\bparse\\b/.test(process.env.LOG);\nlet stackIDs = null;\nvar Safety;\n(function (Safety) {\n    Safety[Safety[\"Margin\"] = 25] = \"Margin\";\n})(Safety || (Safety = {}));\nfunction cutAt(tree, pos, side) {\n    let cursor = tree.cursor(IterMode.IncludeAnonymous);\n    cursor.moveTo(pos);\n    for (;;) {\n        if (!(side < 0 ? cursor.childBefore(pos) : cursor.childAfter(pos)))\n            for (;;) {\n                if ((side < 0 ? cursor.to < pos : cursor.from > pos) && !cursor.type.isError)\n                    return side < 0 ? Math.max(0, Math.min(cursor.to - 1, pos - 25 /* Safety.Margin */))\n                        : Math.min(tree.length, Math.max(cursor.from + 1, pos + 25 /* Safety.Margin */));\n                if (side < 0 ? cursor.prevSibling() : cursor.nextSibling())\n                    break;\n                if (!cursor.parent())\n                    return side < 0 ? 0 : tree.length;\n            }\n    }\n}\nclass FragmentCursor {\n    constructor(fragments, nodeSet) {\n        this.fragments = fragments;\n        this.nodeSet = nodeSet;\n        this.i = 0;\n        this.fragment = null;\n        this.safeFrom = -1;\n        this.safeTo = -1;\n        this.trees = [];\n        this.start = [];\n        this.index = [];\n        this.nextFragment();\n    }\n    nextFragment() {\n        let fr = this.fragment = this.i == this.fragments.length ? null : this.fragments[this.i++];\n        if (fr) {\n            this.safeFrom = fr.openStart ? cutAt(fr.tree, fr.from + fr.offset, 1) - fr.offset : fr.from;\n            this.safeTo = fr.openEnd ? cutAt(fr.tree, fr.to + fr.offset, -1) - fr.offset : fr.to;\n            while (this.trees.length) {\n                this.trees.pop();\n                this.start.pop();\n                this.index.pop();\n            }\n            this.trees.push(fr.tree);\n            this.start.push(-fr.offset);\n            this.index.push(0);\n            this.nextStart = this.safeFrom;\n        }\n        else {\n            this.nextStart = 1e9;\n        }\n    }\n    // `pos` must be >= any previously given `pos` for this cursor\n    nodeAt(pos) {\n        if (pos < this.nextStart)\n            return null;\n        while (this.fragment && this.safeTo <= pos)\n            this.nextFragment();\n        if (!this.fragment)\n            return null;\n        for (;;) {\n            let last = this.trees.length - 1;\n            if (last < 0) { // End of tree\n                this.nextFragment();\n                return null;\n            }\n            let top = this.trees[last], index = this.index[last];\n            if (index == top.children.length) {\n                this.trees.pop();\n                this.start.pop();\n                this.index.pop();\n                continue;\n            }\n            let next = top.children[index];\n            let start = this.start[last] + top.positions[index];\n            if (start > pos) {\n                this.nextStart = start;\n                return null;\n            }\n            if (next instanceof Tree) {\n                if (start == pos) {\n                    if (start < this.safeFrom)\n                        return null;\n                    let end = start + next.length;\n                    if (end <= this.safeTo) {\n                        let lookAhead = next.prop(NodeProp.lookAhead);\n                        if (!lookAhead || end + lookAhead < this.fragment.to)\n                            return next;\n                    }\n                }\n                this.index[last]++;\n                if (start + next.length >= Math.max(this.safeFrom, pos)) { // Enter this node\n                    this.trees.push(next);\n                    this.start.push(start);\n                    this.index.push(0);\n                }\n            }\n            else {\n                this.index[last]++;\n                this.nextStart = start + next.length;\n            }\n        }\n    }\n}\nclass TokenCache {\n    constructor(parser, stream) {\n        this.stream = stream;\n        this.tokens = [];\n        this.mainToken = null;\n        this.actions = [];\n        this.tokens = parser.tokenizers.map(_ => new CachedToken);\n    }\n    getActions(stack) {\n        let actionIndex = 0;\n        let main = null;\n        let { parser } = stack.p, { tokenizers } = parser;\n        let mask = parser.stateSlot(stack.state, 3 /* ParseState.TokenizerMask */);\n        let context = stack.curContext ? stack.curContext.hash : 0;\n        let lookAhead = 0;\n        for (let i = 0; i < tokenizers.length; i++) {\n            if (((1 << i) & mask) == 0)\n                continue;\n            let tokenizer = tokenizers[i], token = this.tokens[i];\n            if (main && !tokenizer.fallback)\n                continue;\n            if (tokenizer.contextual || token.start != stack.pos || token.mask != mask || token.context != context) {\n                this.updateCachedToken(token, tokenizer, stack);\n                token.mask = mask;\n                token.context = context;\n            }\n            if (token.lookAhead > token.end + 25 /* Safety.Margin */)\n                lookAhead = Math.max(token.lookAhead, lookAhead);\n            if (token.value != 0 /* Term.Err */) {\n                let startIndex = actionIndex;\n                if (token.extended > -1)\n                    actionIndex = this.addActions(stack, token.extended, token.end, actionIndex);\n                actionIndex = this.addActions(stack, token.value, token.end, actionIndex);\n                if (!tokenizer.extend) {\n                    main = token;\n                    if (actionIndex > startIndex)\n                        break;\n                }\n            }\n        }\n        while (this.actions.length > actionIndex)\n            this.actions.pop();\n        if (lookAhead)\n            stack.setLookAhead(lookAhead);\n        if (!main && stack.pos == this.stream.end) {\n            main = new CachedToken;\n            main.value = stack.p.parser.eofTerm;\n            main.start = main.end = stack.pos;\n            actionIndex = this.addActions(stack, main.value, main.end, actionIndex);\n        }\n        this.mainToken = main;\n        return this.actions;\n    }\n    getMainToken(stack) {\n        if (this.mainToken)\n            return this.mainToken;\n        let main = new CachedToken, { pos, p } = stack;\n        main.start = pos;\n        main.end = Math.min(pos + 1, p.stream.end);\n        main.value = pos == p.stream.end ? p.parser.eofTerm : 0 /* Term.Err */;\n        return main;\n    }\n    updateCachedToken(token, tokenizer, stack) {\n        let start = this.stream.clipPos(stack.pos);\n        tokenizer.token(this.stream.reset(start, token), stack);\n        if (token.value > -1) {\n            let { parser } = stack.p;\n            for (let i = 0; i < parser.specialized.length; i++)\n                if (parser.specialized[i] == token.value) {\n                    let result = parser.specializers[i](this.stream.read(token.start, token.end), stack);\n                    if (result >= 0 && stack.p.parser.dialect.allows(result >> 1)) {\n                        if ((result & 1) == 0 /* Specialize.Specialize */)\n                            token.value = result >> 1;\n                        else\n                            token.extended = result >> 1;\n                        break;\n                    }\n                }\n        }\n        else {\n            token.value = 0 /* Term.Err */;\n            token.end = this.stream.clipPos(start + 1);\n        }\n    }\n    putAction(action, token, end, index) {\n        // Don't add duplicate actions\n        for (let i = 0; i < index; i += 3)\n            if (this.actions[i] == action)\n                return index;\n        this.actions[index++] = action;\n        this.actions[index++] = token;\n        this.actions[index++] = end;\n        return index;\n    }\n    addActions(stack, token, end, index) {\n        let { state } = stack, { parser } = stack.p, { data } = parser;\n        for (let set = 0; set < 2; set++) {\n            for (let i = parser.stateSlot(state, set ? 2 /* ParseState.Skip */ : 1 /* ParseState.Actions */);; i += 3) {\n                if (data[i] == 65535 /* Seq.End */) {\n                    if (data[i + 1] == 1 /* Seq.Next */) {\n                        i = pair(data, i + 2);\n                    }\n                    else {\n                        if (index == 0 && data[i + 1] == 2 /* Seq.Other */)\n                            index = this.putAction(pair(data, i + 2), token, end, index);\n                        break;\n                    }\n                }\n                if (data[i] == token)\n                    index = this.putAction(pair(data, i + 1), token, end, index);\n            }\n        }\n        return index;\n    }\n}\nvar Rec;\n(function (Rec) {\n    Rec[Rec[\"Distance\"] = 5] = \"Distance\";\n    Rec[Rec[\"MaxRemainingPerStep\"] = 3] = \"MaxRemainingPerStep\";\n    // When two stacks have been running independently long enough to\n    // add this many elements to their buffers, prune one.\n    Rec[Rec[\"MinBufferLengthPrune\"] = 500] = \"MinBufferLengthPrune\";\n    Rec[Rec[\"ForceReduceLimit\"] = 10] = \"ForceReduceLimit\";\n    // Once a stack reaches this depth (in .stack.length) force-reduce\n    // it back to CutTo to avoid creating trees that overflow the stack\n    // on recursive traversal.\n    Rec[Rec[\"CutDepth\"] = 15000] = \"CutDepth\";\n    Rec[Rec[\"CutTo\"] = 9000] = \"CutTo\";\n    Rec[Rec[\"MaxLeftAssociativeReductionCount\"] = 300] = \"MaxLeftAssociativeReductionCount\";\n    // The maximum number of non-recovering stacks to explore (to avoid\n    // getting bogged down with exponentially multiplying stacks in\n    // ambiguous content)\n    Rec[Rec[\"MaxStackCount\"] = 12] = \"MaxStackCount\";\n})(Rec || (Rec = {}));\nclass Parse {\n    constructor(parser, input, fragments, ranges) {\n        this.parser = parser;\n        this.input = input;\n        this.ranges = ranges;\n        this.recovering = 0;\n        this.nextStackID = 0x2654; // \u2654, \u2655, \u2656, \u2657, \u2658, \u2659, \u2660, \u2661, \u2662, \u2663, \u2664, \u2665, \u2666, \u2667\n        this.minStackPos = 0;\n        this.reused = [];\n        this.stoppedAt = null;\n        this.lastBigReductionStart = -1;\n        this.lastBigReductionSize = 0;\n        this.bigReductionCount = 0;\n        this.stream = new InputStream(input, ranges);\n        this.tokens = new TokenCache(parser, this.stream);\n        this.topTerm = parser.top[1];\n        let { from } = ranges[0];\n        this.stacks = [Stack.start(this, parser.top[0], from)];\n        this.fragments = fragments.length && this.stream.end - from > parser.bufferLength * 4\n            ? new FragmentCursor(fragments, parser.nodeSet) : null;\n    }\n    get parsedPos() {\n        return this.minStackPos;\n    }\n    // Move the parser forward. This will process all parse stacks at\n    // `this.pos` and try to advance them to a further position. If no\n    // stack for such a position is found, it'll start error-recovery.\n    //\n    // When the parse is finished, this will return a syntax tree. When\n    // not, it returns `null`.\n    advance() {\n        let stacks = this.stacks, pos = this.minStackPos;\n        // This will hold stacks beyond `pos`.\n        let newStacks = this.stacks = [];\n        let stopped, stoppedTokens;\n        // If a large amount of reductions happened with the same start\n        // position, force the stack out of that production in order to\n        // avoid creating a tree too deep to recurse through.\n        // (This is an ugly kludge, because unfortunately there is no\n        // straightforward, cheap way to check for this happening, due to\n        // the history of reductions only being available in an\n        // expensive-to-access format in the stack buffers.)\n        if (this.bigReductionCount > 300 /* Rec.MaxLeftAssociativeReductionCount */ && stacks.length == 1) {\n            let [s] = stacks;\n            while (s.forceReduce() && s.stack.length && s.stack[s.stack.length - 2] >= this.lastBigReductionStart) { }\n            this.bigReductionCount = this.lastBigReductionSize = 0;\n        }\n        // Keep advancing any stacks at `pos` until they either move\n        // forward or can't be advanced. Gather stacks that can't be\n        // advanced further in `stopped`.\n        for (let i = 0; i < stacks.length; i++) {\n            let stack = stacks[i];\n            for (;;) {\n                this.tokens.mainToken = null;\n                if (stack.pos > pos) {\n                    newStacks.push(stack);\n                }\n                else if (this.advanceStack(stack, newStacks, stacks)) {\n                    continue;\n                }\n                else {\n                    if (!stopped) {\n                        stopped = [];\n                        stoppedTokens = [];\n                    }\n                    stopped.push(stack);\n                    let tok = this.tokens.getMainToken(stack);\n                    stoppedTokens.push(tok.value, tok.end);\n                }\n                break;\n            }\n        }\n        if (!newStacks.length) {\n            let finished = stopped && findFinished(stopped);\n            if (finished)\n                return this.stackToTree(finished);\n            if (this.parser.strict) {\n                if (verbose && stopped)\n                    console.log(\"Stuck with token \" + (this.tokens.mainToken ? this.parser.getName(this.tokens.mainToken.value) : \"none\"));\n                throw new SyntaxError(\"No parse at \" + pos);\n            }\n            if (!this.recovering)\n                this.recovering = 5 /* Rec.Distance */;\n        }\n        if (this.recovering && stopped) {\n            let finished = this.stoppedAt != null && stopped[0].pos > this.stoppedAt ? stopped[0]\n                : this.runRecovery(stopped, stoppedTokens, newStacks);\n            if (finished)\n                return this.stackToTree(finished.forceAll());\n        }\n        if (this.recovering) {\n            let maxRemaining = this.recovering == 1 ? 1 : this.recovering * 3 /* Rec.MaxRemainingPerStep */;\n            if (newStacks.length > maxRemaining) {\n                newStacks.sort((a, b) => b.score - a.score);\n                while (newStacks.length > maxRemaining)\n                    newStacks.pop();\n            }\n            if (newStacks.some(s => s.reducePos > pos))\n                this.recovering--;\n        }\n        else if (newStacks.length > 1) {\n            // Prune stacks that are in the same state, or that have been\n            // running without splitting for a while, to avoid getting stuck\n            // with multiple successful stacks running endlessly on.\n            outer: for (let i = 0; i < newStacks.length - 1; i++) {\n                let stack = newStacks[i];\n                for (let j = i + 1; j < newStacks.length; j++) {\n                    let other = newStacks[j];\n                    if (stack.sameState(other) ||\n                        stack.buffer.length > 500 /* Rec.MinBufferLengthPrune */ && other.buffer.length > 500 /* Rec.MinBufferLengthPrune */) {\n                        if (((stack.score - other.score) || (stack.buffer.length - other.buffer.length)) > 0) {\n                            newStacks.splice(j--, 1);\n                        }\n                        else {\n                            newStacks.splice(i--, 1);\n                            continue outer;\n                        }\n                    }\n                }\n            }\n            if (newStacks.length > 12 /* Rec.MaxStackCount */)\n                newStacks.splice(12 /* Rec.MaxStackCount */, newStacks.length - 12 /* Rec.MaxStackCount */);\n        }\n        this.minStackPos = newStacks[0].pos;\n        for (let i = 1; i < newStacks.length; i++)\n            if (newStacks[i].pos < this.minStackPos)\n                this.minStackPos = newStacks[i].pos;\n        return null;\n    }\n    stopAt(pos) {\n        if (this.stoppedAt != null && this.stoppedAt < pos)\n            throw new RangeError(\"Can't move stoppedAt forward\");\n        this.stoppedAt = pos;\n    }\n    // Returns an updated version of the given stack, or null if the\n    // stack can't advance normally. When `split` and `stacks` are\n    // given, stacks split off by ambiguous operations will be pushed to\n    // `split`, or added to `stacks` if they move `pos` forward.\n    advanceStack(stack, stacks, split) {\n        let start = stack.pos, { parser } = this;\n        let base = verbose ? this.stackID(stack) + \" -> \" : \"\";\n        if (this.stoppedAt != null && start > this.stoppedAt)\n            return stack.forceReduce() ? stack : null;\n        if (this.fragments) {\n            let strictCx = stack.curContext && stack.curContext.tracker.strict, cxHash = strictCx ? stack.curContext.hash : 0;\n            for (let cached = this.fragments.nodeAt(start); cached;) {\n                let match = this.parser.nodeSet.types[cached.type.id] == cached.type ? parser.getGoto(stack.state, cached.type.id) : -1;\n                if (match > -1 && cached.length && (!strictCx || (cached.prop(NodeProp.contextHash) || 0) == cxHash)) {\n                    stack.useNode(cached, match);\n                    if (verbose)\n                        console.log(base + this.stackID(stack) + ` (via reuse of ${parser.getName(cached.type.id)})`);\n                    return true;\n                }\n                if (!(cached instanceof Tree) || cached.children.length == 0 || cached.positions[0] > 0)\n                    break;\n                let inner = cached.children[0];\n                if (inner instanceof Tree && cached.positions[0] == 0)\n                    cached = inner;\n                else\n                    break;\n            }\n        }\n        let defaultReduce = parser.stateSlot(stack.state, 4 /* ParseState.DefaultReduce */);\n        if (defaultReduce > 0) {\n            stack.reduce(defaultReduce);\n            if (verbose)\n                console.log(base + this.stackID(stack) + ` (via always-reduce ${parser.getName(defaultReduce & 65535 /* Action.ValueMask */)})`);\n            return true;\n        }\n        if (stack.stack.length >= 15000 /* Rec.CutDepth */) {\n            while (stack.stack.length > 9000 /* Rec.CutTo */ && stack.forceReduce()) { }\n        }\n        let actions = this.tokens.getActions(stack);\n        for (let i = 0; i < actions.length;) {\n            let action = actions[i++], term = actions[i++], end = actions[i++];\n            let last = i == actions.length || !split;\n            let localStack = last ? stack : stack.split();\n            localStack.apply(action, term, end);\n            if (verbose)\n                console.log(base + this.stackID(localStack) + ` (via ${(action & 65536 /* Action.ReduceFlag */) == 0 ? \"shift\"\n                    : `reduce of ${parser.getName(action & 65535 /* Action.ValueMask */)}`} for ${parser.getName(term)} @ ${start}${localStack == stack ? \"\" : \", split\"})`);\n            if (last)\n                return true;\n            else if (localStack.pos > start)\n                stacks.push(localStack);\n            else\n                split.push(localStack);\n        }\n        return false;\n    }\n    // Advance a given stack forward as far as it will go. Returns the\n    // (possibly updated) stack if it got stuck, or null if it moved\n    // forward and was given to `pushStackDedup`.\n    advanceFully(stack, newStacks) {\n        let pos = stack.pos;\n        for (;;) {\n            if (!this.advanceStack(stack, null, null))\n                return false;\n            if (stack.pos > pos) {\n                pushStackDedup(stack, newStacks);\n                return true;\n            }\n        }\n    }\n    runRecovery(stacks, tokens, newStacks) {\n        let finished = null, restarted = false;\n        for (let i = 0; i < stacks.length; i++) {\n            let stack = stacks[i], token = tokens[i << 1], tokenEnd = tokens[(i << 1) + 1];\n            let base = verbose ? this.stackID(stack) + \" -> \" : \"\";\n            if (stack.deadEnd) {\n                if (restarted)\n                    continue;\n                restarted = true;\n                stack.restart();\n                if (verbose)\n                    console.log(base + this.stackID(stack) + \" (restarted)\");\n                let done = this.advanceFully(stack, newStacks);\n                if (done)\n                    continue;\n            }\n            let force = stack.split(), forceBase = base;\n            for (let j = 0; force.forceReduce() && j < 10 /* Rec.ForceReduceLimit */; j++) {\n                if (verbose)\n                    console.log(forceBase + this.stackID(force) + \" (via force-reduce)\");\n                let done = this.advanceFully(force, newStacks);\n                if (done)\n                    break;\n                if (verbose)\n                    forceBase = this.stackID(force) + \" -> \";\n            }\n            for (let insert of stack.recoverByInsert(token)) {\n                if (verbose)\n                    console.log(base + this.stackID(insert) + \" (via recover-insert)\");\n                this.advanceFully(insert, newStacks);\n            }\n            if (this.stream.end > stack.pos) {\n                if (tokenEnd == stack.pos) {\n                    tokenEnd++;\n                    token = 0 /* Term.Err */;\n                }\n                stack.recoverByDelete(token, tokenEnd);\n                if (verbose)\n                    console.log(base + this.stackID(stack) + ` (via recover-delete ${this.parser.getName(token)})`);\n                pushStackDedup(stack, newStacks);\n            }\n            else if (!finished || finished.score < stack.score) {\n                finished = stack;\n            }\n        }\n        return finished;\n    }\n    // Convert the stack's buffer to a syntax tree.\n    stackToTree(stack) {\n        stack.close();\n        return Tree.build({ buffer: StackBufferCursor.create(stack),\n            nodeSet: this.parser.nodeSet,\n            topID: this.topTerm,\n            maxBufferLength: this.parser.bufferLength,\n            reused: this.reused,\n            start: this.ranges[0].from,\n            length: stack.pos - this.ranges[0].from,\n            minRepeatType: this.parser.minRepeatTerm });\n    }\n    stackID(stack) {\n        let id = (stackIDs || (stackIDs = new WeakMap)).get(stack);\n        if (!id)\n            stackIDs.set(stack, id = String.fromCodePoint(this.nextStackID++));\n        return id + stack;\n    }\n}\nfunction pushStackDedup(stack, newStacks) {\n    for (let i = 0; i < newStacks.length; i++) {\n        let other = newStacks[i];\n        if (other.pos == stack.pos && other.sameState(stack)) {\n            if (newStacks[i].score < stack.score)\n                newStacks[i] = stack;\n            return;\n        }\n    }\n    newStacks.push(stack);\n}\nclass Dialect {\n    constructor(source, flags, disabled) {\n        this.source = source;\n        this.flags = flags;\n        this.disabled = disabled;\n    }\n    allows(term) { return !this.disabled || this.disabled[term] == 0; }\n}\nconst id = x => x;\n/// Context trackers are used to track stateful context (such as\n/// indentation in the Python grammar, or parent elements in the XML\n/// grammar) needed by external tokenizers. You declare them in a\n/// grammar file as `@context exportName from \"module\"`.\n///\n/// Context values should be immutable, and can be updated (replaced)\n/// on shift or reduce actions.\n///\n/// The export used in a `@context` declaration should be of this\n/// type.\nclass ContextTracker {\n    /// Define a context tracker.\n    constructor(spec) {\n        this.start = spec.start;\n        this.shift = spec.shift || id;\n        this.reduce = spec.reduce || id;\n        this.reuse = spec.reuse || id;\n        this.hash = spec.hash || (() => 0);\n        this.strict = spec.strict !== false;\n    }\n}\n/// Holds the parse tables for a given grammar, as generated by\n/// `lezer-generator`, and provides [methods](#common.Parser) to parse\n/// content with.\nclass LRParser extends Parser {\n    /// @internal\n    constructor(spec) {\n        super();\n        /// @internal\n        this.wrappers = [];\n        if (spec.version != 14 /* File.Version */)\n            throw new RangeError(`Parser version (${spec.version}) doesn't match runtime version (${14 /* File.Version */})`);\n        let nodeNames = spec.nodeNames.split(\" \");\n        this.minRepeatTerm = nodeNames.length;\n        for (let i = 0; i < spec.repeatNodeCount; i++)\n            nodeNames.push(\"\");\n        let topTerms = Object.keys(spec.topRules).map(r => spec.topRules[r][1]);\n        let nodeProps = [];\n        for (let i = 0; i < nodeNames.length; i++)\n            nodeProps.push([]);\n        function setProp(nodeID, prop, value) {\n            nodeProps[nodeID].push([prop, prop.deserialize(String(value))]);\n        }\n        if (spec.nodeProps)\n            for (let propSpec of spec.nodeProps) {\n                let prop = propSpec[0];\n                if (typeof prop == \"string\")\n                    prop = NodeProp[prop];\n                for (let i = 1; i < propSpec.length;) {\n                    let next = propSpec[i++];\n                    if (next >= 0) {\n                        setProp(next, prop, propSpec[i++]);\n                    }\n                    else {\n                        let value = propSpec[i + -next];\n                        for (let j = -next; j > 0; j--)\n                            setProp(propSpec[i++], prop, value);\n                        i++;\n                    }\n                }\n            }\n        this.nodeSet = new NodeSet(nodeNames.map((name, i) => NodeType.define({\n            name: i >= this.minRepeatTerm ? undefined : name,\n            id: i,\n            props: nodeProps[i],\n            top: topTerms.indexOf(i) > -1,\n            error: i == 0,\n            skipped: spec.skippedNodes && spec.skippedNodes.indexOf(i) > -1\n        })));\n        if (spec.propSources)\n            this.nodeSet = this.nodeSet.extend(...spec.propSources);\n        this.strict = false;\n        this.bufferLength = DefaultBufferLength;\n        let tokenArray = decodeArray(spec.tokenData);\n        this.context = spec.context;\n        this.specializerSpecs = spec.specialized || [];\n        this.specialized = new Uint16Array(this.specializerSpecs.length);\n        for (let i = 0; i < this.specializerSpecs.length; i++)\n            this.specialized[i] = this.specializerSpecs[i].term;\n        this.specializers = this.specializerSpecs.map(getSpecializer);\n        this.states = decodeArray(spec.states, Uint32Array);\n        this.data = decodeArray(spec.stateData);\n        this.goto = decodeArray(spec.goto);\n        this.maxTerm = spec.maxTerm;\n        this.tokenizers = spec.tokenizers.map(value => typeof value == \"number\" ? new TokenGroup(tokenArray, value) : value);\n        this.topRules = spec.topRules;\n        this.dialects = spec.dialects || {};\n        this.dynamicPrecedences = spec.dynamicPrecedences || null;\n        this.tokenPrecTable = spec.tokenPrec;\n        this.termNames = spec.termNames || null;\n        this.maxNode = this.nodeSet.types.length - 1;\n        this.dialect = this.parseDialect();\n        this.top = this.topRules[Object.keys(this.topRules)[0]];\n    }\n    createParse(input, fragments, ranges) {\n        let parse = new Parse(this, input, fragments, ranges);\n        for (let w of this.wrappers)\n            parse = w(parse, input, fragments, ranges);\n        return parse;\n    }\n    /// Get a goto table entry @internal\n    getGoto(state, term, loose = false) {\n        let table = this.goto;\n        if (term >= table[0])\n            return -1;\n        for (let pos = table[term + 1];;) {\n            let groupTag = table[pos++], last = groupTag & 1;\n            let target = table[pos++];\n            if (last && loose)\n                return target;\n            for (let end = pos + (groupTag >> 1); pos < end; pos++)\n                if (table[pos] == state)\n                    return target;\n            if (last)\n                return -1;\n        }\n    }\n    /// Check if this state has an action for a given terminal @internal\n    hasAction(state, terminal) {\n        let data = this.data;\n        for (let set = 0; set < 2; set++) {\n            for (let i = this.stateSlot(state, set ? 2 /* ParseState.Skip */ : 1 /* ParseState.Actions */), next;; i += 3) {\n                if ((next = data[i]) == 65535 /* Seq.End */) {\n                    if (data[i + 1] == 1 /* Seq.Next */)\n                        next = data[i = pair(data, i + 2)];\n                    else if (data[i + 1] == 2 /* Seq.Other */)\n                        return pair(data, i + 2);\n                    else\n                        break;\n                }\n                if (next == terminal || next == 0 /* Term.Err */)\n                    return pair(data, i + 1);\n            }\n        }\n        return 0;\n    }\n    /// @internal\n    stateSlot(state, slot) {\n        return this.states[(state * 6 /* ParseState.Size */) + slot];\n    }\n    /// @internal\n    stateFlag(state, flag) {\n        return (this.stateSlot(state, 0 /* ParseState.Flags */) & flag) > 0;\n    }\n    /// @internal\n    validAction(state, action) {\n        return !!this.allActions(state, a => a == action ? true : null);\n    }\n    /// @internal\n    allActions(state, action) {\n        let deflt = this.stateSlot(state, 4 /* ParseState.DefaultReduce */);\n        let result = deflt ? action(deflt) : undefined;\n        for (let i = this.stateSlot(state, 1 /* ParseState.Actions */); result == null; i += 3) {\n            if (this.data[i] == 65535 /* Seq.End */) {\n                if (this.data[i + 1] == 1 /* Seq.Next */)\n                    i = pair(this.data, i + 2);\n                else\n                    break;\n            }\n            result = action(pair(this.data, i + 1));\n        }\n        return result;\n    }\n    /// Get the states that can follow this one through shift actions or\n    /// goto jumps. @internal\n    nextStates(state) {\n        let result = [];\n        for (let i = this.stateSlot(state, 1 /* ParseState.Actions */);; i += 3) {\n            if (this.data[i] == 65535 /* Seq.End */) {\n                if (this.data[i + 1] == 1 /* Seq.Next */)\n                    i = pair(this.data, i + 2);\n                else\n                    break;\n            }\n            if ((this.data[i + 2] & (65536 /* Action.ReduceFlag */ >> 16)) == 0) {\n                let value = this.data[i + 1];\n                if (!result.some((v, i) => (i & 1) && v == value))\n                    result.push(this.data[i], value);\n            }\n        }\n        return result;\n    }\n    /// Configure the parser. Returns a new parser instance that has the\n    /// given settings modified. Settings not provided in `config` are\n    /// kept from the original parser.\n    configure(config) {\n        // Hideous reflection-based kludge to make it easy to create a\n        // slightly modified copy of a parser.\n        let copy = Object.assign(Object.create(LRParser.prototype), this);\n        if (config.props)\n            copy.nodeSet = this.nodeSet.extend(...config.props);\n        if (config.top) {\n            let info = this.topRules[config.top];\n            if (!info)\n                throw new RangeError(`Invalid top rule name ${config.top}`);\n            copy.top = info;\n        }\n        if (config.tokenizers)\n            copy.tokenizers = this.tokenizers.map(t => {\n                let found = config.tokenizers.find(r => r.from == t);\n                return found ? found.to : t;\n            });\n        if (config.specializers) {\n            copy.specializers = this.specializers.slice();\n            copy.specializerSpecs = this.specializerSpecs.map((s, i) => {\n                let found = config.specializers.find(r => r.from == s.external);\n                if (!found)\n                    return s;\n                let spec = Object.assign(Object.assign({}, s), { external: found.to });\n                copy.specializers[i] = getSpecializer(spec);\n                return spec;\n            });\n        }\n        if (config.contextTracker)\n            copy.context = config.contextTracker;\n        if (config.dialect)\n            copy.dialect = this.parseDialect(config.dialect);\n        if (config.strict != null)\n            copy.strict = config.strict;\n        if (config.wrap)\n            copy.wrappers = copy.wrappers.concat(config.wrap);\n        if (config.bufferLength != null)\n            copy.bufferLength = config.bufferLength;\n        return copy;\n    }\n    /// Tells you whether any [parse wrappers](#lr.ParserConfig.wrap)\n    /// are registered for this parser.\n    hasWrappers() {\n        return this.wrappers.length > 0;\n    }\n    /// Returns the name associated with a given term. This will only\n    /// work for all terms when the parser was generated with the\n    /// `--names` option. By default, only the names of tagged terms are\n    /// stored.\n    getName(term) {\n        return this.termNames ? this.termNames[term] : String(term <= this.maxNode && this.nodeSet.types[term].name || term);\n    }\n    /// The eof term id is always allocated directly after the node\n    /// types. @internal\n    get eofTerm() { return this.maxNode + 1; }\n    /// The type of top node produced by the parser.\n    get topNode() { return this.nodeSet.types[this.top[1]]; }\n    /// @internal\n    dynamicPrecedence(term) {\n        let prec = this.dynamicPrecedences;\n        return prec == null ? 0 : prec[term] || 0;\n    }\n    /// @internal\n    parseDialect(dialect) {\n        let values = Object.keys(this.dialects), flags = values.map(() => false);\n        if (dialect)\n            for (let part of dialect.split(\" \")) {\n                let id = values.indexOf(part);\n                if (id >= 0)\n                    flags[id] = true;\n            }\n        let disabled = null;\n        for (let i = 0; i < values.length; i++)\n            if (!flags[i]) {\n                for (let j = this.dialects[values[i]], id; (id = this.data[j++]) != 65535 /* Seq.End */;)\n                    (disabled || (disabled = new Uint8Array(this.maxTerm + 1)))[id] = 1;\n            }\n        return new Dialect(dialect, flags, disabled);\n    }\n    /// Used by the output of the parser generator. Not available to\n    /// user code. @hide\n    static deserialize(spec) {\n        return new LRParser(spec);\n    }\n}\nfunction pair(data, off) { return data[off] | (data[off + 1] << 16); }\nfunction findFinished(stacks) {\n    let best = null;\n    for (let stack of stacks) {\n        let stopped = stack.p.stoppedAt;\n        if ((stack.pos == stack.p.stream.end || stopped != null && stack.pos > stopped) &&\n            stack.p.parser.stateFlag(stack.state, 2 /* StateFlag.Accepting */) &&\n            (!best || best.score < stack.score))\n            best = stack;\n    }\n    return best;\n}\nfunction getSpecializer(spec) {\n    if (spec.external) {\n        let mask = spec.extend ? 1 /* Specialize.Extend */ : 0 /* Specialize.Specialize */;\n        return (value, stack) => (spec.external(value, stack) << 1) | mask;\n    }\n    return spec.get;\n}\n\nexport { ContextTracker, ExternalTokenizer, InputStream, LRParser, LocalTokenGroup, Stack };\n", "// This file was generated by lezer-generator. You probably shouldn't edit it.\nimport { LRParser } from \"@lezer/lr\";\nexport const parser = LRParser.deserialize({\n  version: 14,\n  states: \"%QOVQPOOOOQO'#C_'#C_O_QQO'#C^OOQO'#DO'#DOOvQQO'#C|OOQO'#DR'#DROVQPO'#CuOOQO'#C}'#C}QOQPOOOOQO'#C`'#C`O!UQQO,58xO!dQPO,59VOVQPO,59]OVQPO,59_O!iQPO,59hO!nQQO,59aOOQO'#DQ'#DQOOQO1G.d1G.dO!UQQO1G.qO!yQQO1G.wOOQO1G.y1G.yOOQO'#Cw'#CwOOQO1G/S1G/SOOQO1G.{1G.{O#[QPO'#CnO#dQPO7+$]O!UQQO'#CxO#iQPO,59YOOQO<<Gw<<GwOOQO,59d,59dOOQO-E6v-E6v\",\n  stateData: \"#q~OoOS~OsPOvUO~OTXOUXOVXOWXOXXOYXO`ZO~Of[Oh]Oj^OmpX~OZ`O[`O]`O^`O~OabO~OseO~Of[Oh]OwgO~Oh]Ofeijeimeiwei~OcjOdbX~OdlO~OcjOdba~O\",\n  goto: \"#YvPPw}!TPPPPPPPPPPwPP!WPP!ZP!ZP!aP!g!jPPP!p!s!aP#P!aXROU[]XQOU[]RYQRibXTOU[]XVOU[]Rf^QkhRnkRWOQSOQ_UQc[Rd]QaYQhbRmj\",\n  nodeNames: \"\u26A0 Filter ColumnValueExpression Column Operator Eq NotEq Gt Lt Starts Ends Number String True False ColumnSetExpression In LBrack Values Comma RBrack AndExpression And OrExpression Or ParenthesizedExpression As FilterName\",\n  maxTerm: 39,\n  skippedNodes: [0],\n  repeatNodeCount: 1,\n  tokenData: \"6p~RnXY#PYZ#P]^#Ppq#Pqr#brs#mxy$eyz$j|}$o!O!P$t!Q![%S!^!_%_!_!`%d!`!a%i!c!}%n!}#O&V#P#Q&[#R#S%n#T#U&a#U#X%n#X#Y(w#Y#Z+]#Z#]%n#]#^.]#^#c%n#c#d/e#d#g%n#g#h0m#h#i4[#i#o%n~#USo~XY#PYZ#P]^#Ppq#P~#eP!_!`#h~#mOU~~#pWOX#mZ]#m^r#mrs$Ys#O#m#P;'S#m;'S;=`$_<%lO#m~$_O[~~$bP;=`<%l#m~$jOv~~$oOw~~$tOc~~$wP!Q![$z~%PPZ~!Q![$z~%XQZ~!O!P$t!Q![%S~%dOW~~%iOT~~%nOV~P%sUsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%n~&[Oa~~&aOd~R&fYsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c'U#c#g%n#g#h(^#h#o%nR'ZWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#W%n#W#X's#X#o%nR'zUfQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR(eUjQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR(|WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c)f#c#o%nR)kWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#W%n#W#X*T#X#o%nR*YWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h*r#h#o%nR*yUYQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR+bVsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#U+w#U#o%nR+|WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#`%n#`#a,f#a#o%nR,kWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h-T#h#o%nR-YWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#X%n#X#Y-r#Y#o%nR-yU^QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR.bWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c.z#c#o%nR/RU`QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR/jWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g0S#g#o%nR0ZUhQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR0rWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#h%n#h#i1[#i#o%nR1aVsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#U1v#U#o%nR1{WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g2e#g#o%nR2jWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#h%n#h#i3S#i#o%nR3XWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h3q#h#o%nR3xUXQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR4aWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g4y#g#o%nR5OWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#i%n#i#j5h#j#o%nR5mWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#X%n#X#Y6V#Y#o%nR6^U]QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%n\",\n  tokenizers: [0, 1],\n  topRules: {\"Filter\":[0,1]},\n  tokenPrec: 0\n})\n", "import { Tree } from \"@lezer/common\";\nimport {\n  Filter,\n  FilterCombinatorOp,\n  MultipleValueFilterClauseOp,\n  SingleValueFilterClauseOp,\n} from \"@vuu-ui/vuu-filter-types\";\nimport {\n  isMultiClauseFilter,\n  isMultiValueFilter,\n  isSingleValueFilter,\n} from \"@vuu-ui/vuu-utils\";\n\nclass FilterExpression {\n  public name: string | undefined;\n  #filter: Partial<Filter> | undefined = undefined;\n\n  setFilterCombinatorOp(op: string, filter = this.#filter) {\n    if (isMultiClauseFilter(filter) && filter.op === op) {\n      return;\n    } else {\n      this.#filter = {\n        op: op as FilterCombinatorOp,\n        filters: [this.#filter as Filter],\n      };\n    }\n  }\n\n  add(filter: Partial<Filter>) {\n    if (this.#filter === undefined) {\n      this.#filter = filter;\n    } else if (isMultiClauseFilter(this.#filter)) {\n      this.#filter.filters.push(filter as Filter);\n    } else {\n      throw Error(`Invalid filter passed to FilterExpression`);\n    }\n  }\n\n  setColumn(column: string, filter = this.#filter) {\n    if (isMultiClauseFilter(filter)) {\n      const target = filter.filters.at(-1);\n      if (target) {\n        this.setColumn(column, target);\n      }\n    } else if (filter) {\n      filter.column = column;\n    }\n  }\n  setOp(value: string, filter = this.#filter) {\n    if (isMultiClauseFilter(filter)) {\n      const target = filter.filters.at(-1);\n      if (target) {\n        this.setOp(value, target);\n      }\n    } else if (filter) {\n      filter.op = value as\n        | SingleValueFilterClauseOp\n        | MultipleValueFilterClauseOp;\n    }\n  }\n  setValue(value: string | number | boolean, filter = this.#filter) {\n    if (isMultiClauseFilter(filter)) {\n      const target = filter.filters.at(-1);\n      if (target) {\n        this.setValue(value, target);\n      }\n    } else if (isMultiValueFilter(filter)) {\n      filter.values ??= [];\n      // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n      // @ts-ignore\n      filter.values.push(value);\n    } else if (isSingleValueFilter(filter)) {\n      filter.value = value;\n    }\n  }\n\n  toJSON(filter = this.#filter) {\n    if (this.name) {\n      return {\n        ...filter,\n        name: this.name,\n      };\n    } else {\n      return filter;\n    }\n  }\n}\n\nexport const walkTree = (tree: Tree, source: string) => {\n  const filterExpression = new FilterExpression();\n  const cursor = tree.cursor();\n  do {\n    const { name, from, to } = cursor;\n    switch (name) {\n      case \"ColumnValueExpression\":\n        filterExpression.add({});\n        break;\n      case \"ColumnSetExpression\":\n        filterExpression.add({ op: \"in\" });\n        break;\n\n      case \"Or\":\n      case \"And\":\n        filterExpression.setFilterCombinatorOp(source.substring(from, to));\n        break;\n\n      case \"Column\":\n        filterExpression.setColumn(source.substring(from, to));\n        break;\n\n      case \"Operator\":\n        filterExpression.setOp(source.substring(from, to));\n        break;\n\n      case \"String\":\n        filterExpression.setValue(source.substring(from + 1, to - 1));\n        break;\n\n      case \"Number\":\n        filterExpression.setValue(parseFloat(source.substring(from, to)));\n        break;\n\n      case \"True\":\n        filterExpression.setValue(true);\n        break;\n\n      case \"False\":\n        filterExpression.setValue(false);\n        break;\n\n      case \"FilterName\":\n        filterExpression.name = source.substring(from, to);\n        break;\n\n      default:\n    }\n  } while (cursor.next());\n\n  return filterExpression.toJSON();\n};\n", "import { Filter } from \"@vuu-ui/vuu-filter-types\";\nimport { parser } from \"./generated/filter-parser\";\nimport { walkTree } from \"./FilterTreeWalker\";\n\nconst strictParser = parser.configure({ strict: true });\n\nexport const parseFilter = (filterQuery: string): Filter => {\n  const parseTree = strictParser.parse(filterQuery);\n  const filter = walkTree(parseTree, filterQuery) as Filter;\n  return filter;\n};\n", "import { DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport {\n  AndFilter,\n  Filter,\n  MultiValueFilterClause,\n  OrFilter,\n  SingleValueFilterClause,\n} from \"@vuu-ui/vuu-filter-types\";\nimport { ColumnMap } from \"@vuu-ui/vuu-utils\";\nimport { parseFilter } from \"./FilterParser\";\n\nconst filterPredicateMap = new Map<string, FilterPredicate>();\nconst filterReject = () => false;\n\nexport const getFilterPredicate = (\n  columnMap: ColumnMap,\n  filterQuery: string\n): FilterPredicate => {\n  let predicate = filterPredicateMap.get(filterQuery);\n  if (predicate) {\n    return predicate;\n  }\n  // TODO we need to clear cache if columns change. How do we identify this :\n  try {\n    const filter = parseFilter(filterQuery);\n    predicate = filterPredicate(columnMap, filter);\n    filterPredicateMap.set(filterQuery, predicate);\n    return predicate;\n  } catch (err) {\n    console.warn(\n      `filter-evaluation-utils, failed to parse filter \"${filterQuery}\"`\n    );\n    return filterReject;\n  }\n};\n\nexport function filterPredicate(\n  columnMap: ColumnMap,\n  filter: Filter\n): FilterPredicate {\n  //TODO convert filter to include colIdx ratherthan colName, so we don't have to pass cols\n  switch (filter.op) {\n    case \"in\":\n      return testInclude(columnMap, filter);\n    case \"=\":\n      return testEQ(columnMap, filter);\n    case \">\":\n      return testGT(columnMap, filter);\n    case \">=\":\n      return testGE(columnMap, filter);\n    case \"<\":\n      return testLT(columnMap, filter);\n    case \"<=\":\n      return testLE(columnMap, filter);\n    case \"starts\":\n      return testSW(columnMap, filter);\n    case \"and\":\n      return testAND(columnMap, filter as AndFilter);\n    case \"or\":\n      return testOR(columnMap, filter as OrFilter);\n    default:\n      console.log(`unrecognized filter type ${filter.op}`);\n      return () => true;\n  }\n}\n\nexport type FilterPredicate = (row: DataSourceRow) => boolean;\n\nconst testInclude = (\n  columnMap: ColumnMap,\n  filter: MultiValueFilterClause\n): FilterPredicate => {\n  return (row) =>\n    (filter.values as unknown[]).indexOf(row[columnMap[filter.column]]) !== -1;\n};\n\nconst testEQ = (\n  columnMap: ColumnMap,\n  filter: SingleValueFilterClause\n): FilterPredicate => {\n  return (row) => row[columnMap[filter.column]] === filter.value;\n};\n\nconst testGT = (\n  columnMap: ColumnMap,\n  filter: SingleValueFilterClause\n): FilterPredicate => {\n  return (row) => row[columnMap[filter.column]] > filter.value;\n};\nconst testGE = (\n  columnMap: ColumnMap,\n  filter: SingleValueFilterClause\n): FilterPredicate => {\n  return (row) => row[columnMap[filter.column]] >= filter.value;\n};\n\nconst testLT = (\n  columnMap: ColumnMap,\n  filter: SingleValueFilterClause\n): FilterPredicate => {\n  return (row) => row[columnMap[filter.column]] < filter.value;\n};\nconst testLE = (\n  columnMap: ColumnMap,\n  filter: SingleValueFilterClause\n): FilterPredicate => {\n  return (row) => row[columnMap[filter.column]] <= filter.value;\n};\n\nconst testSW = (\n  columnMap: ColumnMap,\n  filter: SingleValueFilterClause\n): FilterPredicate => {\n  const filterValue = filter.value as string;\n  if (typeof filterValue !== \"string\") {\n    throw Error(\"string filter applied to value of wrong type\");\n  }\n  return (row) => {\n    const rowValue = row[columnMap[filter.column]];\n    if (typeof rowValue !== \"string\") {\n      throw Error(\"string filter applied to value of wrong type\");\n    }\n    return rowValue.toLowerCase().startsWith(filterValue.toLowerCase());\n  };\n};\n\nconst testAND = (columnMap: ColumnMap, filter: AndFilter): FilterPredicate => {\n  const filters = filter.filters.map((f1) => filterPredicate(columnMap, f1));\n  return (row) => filters.every((fn) => fn(row));\n};\n\nfunction testOR(columnMap: ColumnMap, filter: OrFilter): FilterPredicate {\n  const filters = filter.filters.map((f1) => filterPredicate(columnMap, f1));\n  return (row) => filters.some((fn) => fn(row));\n}\n", "import { DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport { VuuAggregation, VuuGroupBy } from \"@vuu-ui/vuu-protocol-types\";\nimport { ColumnMap } from \"@vuu-ui/vuu-utils\";\nimport { GroupMap, KeyList } from \"./group-utils\";\n\nexport const count = (arr: any[]) => arr.length;\n\nexport const aggregateData = (\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupBy: VuuGroupBy,\n  leafData: readonly DataSourceRow[],\n  columnMap: ColumnMap,\n  groupMap: GroupMap\n) => {\n  const aggColumn = getAggColumn(columnMap, aggregations);\n  const aggType = aggregations[aggregations.length - 1].aggType;\n  const groupIndices = groupBy.map<number>((column) => columnMap[column]);\n\n  switch (aggType) {\n    case 1:\n      return aggregateSum(\n        groupMap,\n        leafData,\n        columnMap,\n        aggregations,\n        targetData,\n        groupIndices\n      );\n    case 2:\n      return aggregateAverage(\n        groupMap,\n        leafData,\n        columnMap,\n        aggregations,\n        targetData,\n        groupIndices\n      );\n    case 3:\n      return aggregateCount(\n        groupMap,\n        columnMap,\n        aggregations,\n        targetData,\n        groupIndices\n      );\n    case 4:\n      return aggregateHigh(\n        groupMap,\n        leafData,\n        columnMap,\n        aggregations,\n        targetData,\n        groupIndices\n      );\n    case 5:\n      return aggregateLow(\n        groupMap,\n        leafData,\n        columnMap,\n        aggregations,\n        targetData,\n        groupIndices\n      );\n    case 6:\n      return aggregateDistinct(\n        groupMap,\n        leafData,\n        columnMap,\n        aggregations,\n        targetData,\n        groupIndices\n      );\n  }\n};\n\nfunction aggregateCount(\n  groupMap: GroupMap,\n  columnMap: ColumnMap,\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupIndices: number[]\n): { [key: string]: number } {\n  const counts: { [key: string]: number } = {};\n  const aggColumn = getAggColumn(columnMap, aggregations);\n\n  function countRecursive(map: GroupMap | KeyList) {\n    if (Array.isArray(map)) {\n      return map.length;\n    } else {\n      let count = 0;\n      for (const key in map) {\n        count += 1 + countRecursive(map[key]);\n      }\n      return count;\n    }\n  }\n\n  for (const key in groupMap) {\n    const count = countRecursive(groupMap[key]);\n    counts[key] = count;\n  }\n\n  for (let index = 0; index < targetData.length; index++) {\n    for (const key in counts) {\n      if (targetData[index][groupIndices[0]] === key) {\n        targetData[index][aggColumn] = counts[key];\n      }\n    }\n  }\n\n  console.log(\"!!!! targetData\", targetData);\n  console.log(\"!!!! counts\", counts);\n  return counts;\n}\n\nfunction getAggColumn(columnMap: ColumnMap, aggregations: VuuAggregation[]) {\n  console.log(\"!!!! aggregation length\", aggregations.length);\n  const columnName = aggregations[aggregations.length - 1].column;\n  const columnNumber = columnMap[columnName];\n  return columnNumber;\n}\n\nfunction aggregateSum(\n  groupMap: GroupMap,\n  leafData: readonly DataSourceRow[],\n  columnMap: ColumnMap,\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupIndices: number[]\n): { [key: string]: number } {\n  const sums: { [key: string]: number } = {};\n  const aggColumn = getAggColumn(columnMap, aggregations);\n\n  function sumRecursive(\n    map: GroupMap | KeyList,\n    leafData: readonly DataSourceRow[],\n    aggColumn: number\n  ) {\n    if (Array.isArray(map)) {\n      let sum = 0;\n      for (const key of map) {\n        sum += Number(leafData[key][aggColumn]);\n      }\n      return sum;\n    } else {\n      let sum = 0;\n      for (const key in map) {\n        sum += sumRecursive(map[key], leafData, aggColumn);\n      }\n      return sum;\n    }\n  }\n\n  for (const key in groupMap) {\n    console.log(key);\n    const sum = Number(sumRecursive(groupMap[key], leafData, aggColumn));\n    sums[key] = sum;\n  }\n\n  for (let index = 0; index < targetData.length; index++) {\n    for (const key in sums) {\n      if (targetData[index][groupIndices[0]] === key) {\n        targetData[index][aggColumn] = sums[key];\n      }\n    }\n  }\n\n  console.log(\"!!!! targetData\", targetData);\n  console.log(\"!!!! sums\", sums);\n  return sums;\n}\n\nfunction aggregateAverage(\n  groupMap: GroupMap,\n  leafData: readonly DataSourceRow[],\n  columnMap: ColumnMap,\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupIndices: number[]\n): { [key: string]: number } {\n  const averages: { [key: string]: number } = {};\n  const aggColumn = getAggColumn(columnMap, aggregations);\n\n  const count = aggregateCount(\n    groupMap,\n    columnMap,\n    aggregations,\n    targetData,\n    groupIndices\n  );\n  const sum = aggregateSum(\n    groupMap,\n    leafData,\n    columnMap,\n    aggregations,\n    targetData,\n    groupIndices\n  );\n\n  for (const key in count) {\n    let average = 0;\n    average = sum[key] / count[key];\n    averages[key] = average;\n  }\n\n  for (let index = 0; index < targetData.length; index++) {\n    for (const key in averages) {\n      if (targetData[index][groupIndices[0]] === key) {\n        targetData[index][aggColumn] = averages[key];\n      }\n    }\n  }\n\n  console.log(\"!!!! targetData\", targetData);\n  console.log(\"!!!! averages\", averages);\n  return averages;\n}\n\nfunction getLeafColumnData(\n  map: GroupMap | KeyList,\n  leafData: readonly DataSourceRow[],\n  aggColumn: number\n): number[] {\n  const data: number[] = [];\n\n  if (Array.isArray(map)) {\n    for (const key of map) {\n      data.push(leafData[key][aggColumn] as number);\n    }\n  } else {\n    for (const key in map) {\n      data.push(...getLeafColumnData(map[key], leafData, aggColumn));\n    }\n  }\n\n  return data;\n}\n\nfunction aggregateDistinct(\n  groupMap: GroupMap,\n  leafData: readonly DataSourceRow[],\n  columnMap: ColumnMap,\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupIndices: number[]\n): { [key: string]: number } {\n  const distincts: { [key: string]: number } = {};\n  const aggColumn = getAggColumn(columnMap, aggregations);\n\n  for (const key in groupMap) {\n    const leafColumnData = getLeafColumnData(\n      groupMap[key],\n      leafData,\n      aggColumn\n    );\n    const distinct: any = [...new Set(leafColumnData)];\n\n    distincts[key] = distinct;\n  }\n\n  for (let index = 0; index < targetData.length; index++) {\n    for (const key in distincts) {\n      if (targetData[index][groupIndices[0]] === key) {\n        targetData[index][aggColumn] = distincts[key];\n      }\n    }\n  }\n\n  return distincts;\n}\n\nfunction aggregateHigh(\n  groupMap: GroupMap,\n  leafData: readonly DataSourceRow[],\n  columnMap: ColumnMap,\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupIndices: number[]\n): { [key: string]: number } {\n  const highs: { [key: string]: number } = {};\n  const aggColumn = getAggColumn(columnMap, aggregations);\n\n  for (const key in groupMap) {\n    const leafColumnData = getLeafColumnData(\n      groupMap[key],\n      leafData,\n      aggColumn\n    );\n    const maxNumber = Math.max(...leafColumnData);\n\n    highs[key] = maxNumber;\n  }\n  for (let index = 0; index < targetData.length; index++) {\n    for (const key in highs) {\n      if (targetData[index][groupIndices[0]] === key) {\n        targetData[index][aggColumn] = highs[key];\n      }\n    }\n  }\n\n  return highs;\n}\n\nfunction aggregateLow(\n  groupMap: GroupMap,\n  leafData: readonly DataSourceRow[],\n  columnMap: ColumnMap,\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupIndices: number[]\n): { [key: string]: number } {\n  const mins: { [key: string]: number } = {};\n  const aggColumn = getAggColumn(columnMap, aggregations);\n\n  for (const key in groupMap) {\n    const leafColumnData = getLeafColumnData(\n      groupMap[key],\n      leafData,\n      aggColumn\n    );\n    const minNumber = Math.min(...leafColumnData);\n    mins[key] = minNumber;\n  }\n\n  for (let index = 0; index < targetData.length; index++) {\n    for (const key in mins) {\n      if (targetData[index][groupIndices[0]] === key) {\n        targetData[index][aggColumn] = mins[key];\n      }\n    }\n  }\n\n  return mins;\n}\n", "import { DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport { VuuGroupBy } from \"@vuu-ui/vuu-protocol-types\";\nimport { ColumnMap, metadataKeys } from \"@vuu-ui/vuu-utils\";\n\nexport type KeyList = number[];\nexport type GroupMap = { [key: string]: GroupMap | KeyList };\n\nconst { DEPTH, IS_EXPANDED, KEY } = metadataKeys;\n\nexport const collapseGroup = (\n  key: string,\n  groupedRows: readonly DataSourceRow[]\n): DataSourceRow[] => {\n  const rows: DataSourceRow[] = [];\n\n  for (\n    let i = 0, idx = 0, collapsed = false, len = groupedRows.length;\n    i < len;\n    i++\n  ) {\n    const row = groupedRows[i];\n    const { [DEPTH]: depth, [KEY]: rowKey } = row;\n    if (rowKey === key) {\n      const collapsedRow = row.slice() as DataSourceRow;\n      collapsedRow[IS_EXPANDED] = false;\n      rows.push(collapsedRow);\n      idx += 1;\n      collapsed = true;\n      while (i < len - 1 && groupedRows[i + 1][DEPTH] > depth) {\n        i += 1;\n      }\n    } else if (collapsed) {\n      const newRow = row.slice() as DataSourceRow;\n      newRow[0] = idx;\n      newRow[1] = idx;\n      rows.push(newRow);\n      idx += 1;\n    } else {\n      rows.push(row);\n      idx += 1;\n    }\n  }\n\n  return rows;\n};\n\nexport const expandGroup = (\n  keys: string[],\n  sourceRows: readonly DataSourceRow[],\n  groupBy: VuuGroupBy,\n  columnMap: ColumnMap,\n  groupMap: GroupMap,\n  processedData: readonly DataSourceRow[]\n): DataSourceRow[] => {\n  const groupIndices = groupBy.map<number>((column) => columnMap[column]);\n  return dataRowsFromGroups2(\n    groupMap,\n    groupIndices,\n    keys,\n    sourceRows,\n    undefined,\n    undefined,\n    undefined,\n    processedData\n  );\n};\n\nconst dataRowsFromGroups2 = (\n  groupMap: GroupMap,\n  groupIndices: number[],\n  openKeys: string[],\n  sourceRows: readonly DataSourceRow[] = [],\n  root = \"$root\",\n  depth = 1,\n  rows: DataSourceRow[] = [],\n  processedData: readonly DataSourceRow[]\n) => {\n  console.log(`dataRowsFromGroups2 1)`);\n  const keys = Object.keys(groupMap).sort();\n  for (const key of keys) {\n    const idx = rows.length;\n    const groupKey = `${root}|${key}`;\n    const row: DataSourceRow = [idx, idx, false, false, depth, 0, groupKey, 0];\n    // TODO whats this\n    row[groupIndices[depth - 1]] = key;\n    rows.push(row);\n\n    if (openKeys.includes(groupKey)) {\n      row[IS_EXPANDED] = true;\n      if (Array.isArray(groupMap[key])) {\n        pushChildren(\n          rows,\n          groupMap[key] as KeyList,\n          sourceRows,\n          groupKey,\n          depth + 1\n        );\n      } else {\n        dataRowsFromGroups2(\n          groupMap[key] as GroupMap,\n          groupIndices,\n          openKeys,\n          sourceRows,\n          groupKey,\n          depth + 1,\n          rows,\n          processedData\n        );\n      }\n    }\n  }\n  console.log(`dataRowsFromGroups2 2)`);\n\n  for (const key in rows) {\n    for (const index in rows) {\n      if (rows[key][2] === false && processedData[index] != undefined) {\n        if (\n          rows[key][groupIndices[0]] === processedData[index][groupIndices[0]]\n        ) {\n          rows[key] = rows[key].splice(0, 8).concat(\n            processedData[index].slice(\n              8, // groupIndices[0] + 1,\n              processedData[index].length\n            )\n          ) as DataSourceRow;\n          break;\n        }\n      }\n    }\n  }\n  console.log(`dataRowsFromGroups2 3)`);\n\n  return rows;\n};\n\nconst pushChildren = (\n  rows: DataSourceRow[],\n  tree: KeyList,\n  sourceRows: readonly DataSourceRow[],\n  parentKey: string,\n  depth: number\n) => {\n  for (const rowIdx of tree) {\n    const idx = rows.length;\n    const sourceRow = sourceRows[rowIdx].slice() as DataSourceRow;\n    sourceRow[0] = idx;\n    sourceRow[1] = idx;\n    sourceRow[DEPTH] = depth;\n    sourceRow[KEY] = `${parentKey}|${sourceRow[KEY]}`;\n    rows.push(sourceRow);\n  }\n};\n\nexport const groupRows = (\n  rows: readonly DataSourceRow[],\n  groupBy: VuuGroupBy,\n  columnMap: ColumnMap\n): [DataSourceRow[], GroupMap] => {\n  const groupIndices = groupBy.map<number>((column) => columnMap[column]);\n  const groupTree = groupLeafRows(rows, groupIndices);\n  const groupedDataRows = dataRowsFromGroups(groupTree, groupIndices);\n  // 2) collapse int groups\n\n  return [groupedDataRows, groupTree];\n};\n\nconst dataRowsFromGroups = (groupTree: GroupMap, groupIndices: number[]) => {\n  const depth = 0;\n  const rows: DataSourceRow[] = [];\n  let idx = 0;\n  const keys = Object.keys(groupTree).sort();\n  for (const key of keys) {\n    const row: DataSourceRow = [\n      idx,\n      idx,\n      false,\n      false,\n      1,\n      0,\n      `$root|${key}`,\n      0,\n    ];\n    row[groupIndices[depth]] = key;\n    rows.push(row);\n    idx += 1;\n  }\n  return rows;\n};\n\nfunction groupLeafRows(leafRows: readonly DataSourceRow[], groupby: number[]) {\n  const groups: GroupMap = {};\n  const levels = groupby.length;\n  const lastLevel = levels - 1;\n  for (let i = 0, len = leafRows.length; i < len; i++) {\n    const leafRow = leafRows[i];\n    let target: GroupMap | KeyList = groups;\n    let targetNode;\n    let key;\n    for (let level = 0; level < levels; level++) {\n      const colIdx = groupby[level];\n      key = leafRow[colIdx].toString();\n      targetNode = (target as GroupMap)[key];\n      if (targetNode && level === lastLevel) {\n        // we're at leaf level, targetNode can only be a KeyList\n        (targetNode as KeyList).push(i);\n      } else if (targetNode) {\n        target = targetNode;\n      } else if (!targetNode && level < lastLevel) {\n        // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n        // @ts-ignore\n        target = target[key] = {};\n      } else if (!targetNode) {\n        (target as GroupMap)[key] = [i];\n      }\n    }\n  }\n  console.log(\"!! groups\", groups);\n  return groups;\n}\n", "import { DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport { VuuSort, VuuSortType } from \"@vuu-ui/vuu-protocol-types\";\nimport { ColumnMap } from \"@vuu-ui/vuu-utils\";\n\ntype SortDef = [number, VuuSortType];\ntype SortPredicate = (\n  r1: DataSourceRow,\n  r2: DataSourceRow,\n  sortDefDef: SortDef\n) => SortCompareResult;\ntype SortCompareResult = 0 | 1 | -1;\ntype RowSortComparatorFactory = (\n  sortDefs: SortDef[],\n  test?: SortPredicate\n) => RowSortComparator;\ntype RowSortComparator = (\n  item1: DataSourceRow,\n  item2: DataSourceRow\n) => SortCompareResult;\n\nconst defaultSortPredicate: SortPredicate = (r1, r2, [i, direction]) => {\n  const val1 = direction === \"D\" ? r2[i] : r1[i];\n  const val2 = direction === \"D\" ? r1[i] : r2[i];\n  if (val1 === val2) {\n    return 0;\n  } else if (val2 === null || val1 > val2) {\n    return 1;\n  } else {\n    return -1;\n  }\n};\n\nconst sortComparator = (sortDefs: SortDef[]): RowSortComparator => {\n  if (sortDefs.length === 1) {\n    return singleColComparator(sortDefs);\n  } else if (sortDefs.length === 2) {\n    return twoColComparator(sortDefs);\n  } else {\n    return multiColComparator(sortDefs);\n  }\n};\n\nconst singleColComparator: RowSortComparatorFactory =\n  ([[i, direction]]) =>\n  (r1, r2) => {\n    const v1 = direction === \"D\" ? r2[i] : r1[i];\n    const v2 = direction === \"D\" ? r1[i] : r2[i];\n    return v1 > v2 ? 1 : v2 > v1 ? -1 : 0;\n  };\n\nconst twoColComparator: RowSortComparatorFactory =\n  ([[idx1, direction1], [idx2, direction2]]) =>\n  (r1, r2) => {\n    const v1 = direction1 === \"D\" ? r2[idx1] : r1[idx1];\n    const v2 = direction1 === \"D\" ? r1[idx1] : r2[idx1];\n    const v3 = direction2 === \"D\" ? r2[idx2] : r1[idx2];\n    const v4 = direction2 === \"D\" ? r1[idx2] : r2[idx2];\n    return v1 > v2 ? 1 : v2 > v1 ? -1 : v3 > v4 ? 1 : v4 > v3 ? -1 : 0;\n  };\n\nconst multiColComparator: RowSortComparatorFactory =\n  (sortDefs, test = defaultSortPredicate) =>\n  (r1, r2) => {\n    for (const sortDef of sortDefs) {\n      const result = test(r1, r2, sortDef);\n      if (result !== 0) {\n        return result;\n      }\n    }\n    return 0;\n  };\n\nexport const sortRows = (\n  rows: readonly DataSourceRow[],\n  { sortDefs }: VuuSort,\n  columnMap: ColumnMap\n) => {\n  const indexedSortDefs = sortDefs.map<SortDef>(({ column, sortType }) => [\n    columnMap[column],\n    sortType,\n  ]);\n  const comparator = sortComparator(indexedSortDefs);\n  return rows.slice().sort(comparator);\n};\n", "import { DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport { Selection } from \"@vuu-ui/vuu-table-types\";\nimport {\n  ColumnMap,\n  getSelectionStatus,\n  KeySet,\n  metadataKeys,\n} from \"@vuu-ui/vuu-utils\";\n\nconst { RENDER_IDX, SELECTED } = metadataKeys;\n\nexport const toClientRow = (\n  row: DataSourceRow,\n  keys: KeySet,\n  selection: Selection,\n  dataIndices?: number[]\n) => {\n  const [rowIndex] = row;\n  let clientRow;\n  if (dataIndices) {\n    // If client has specified a different ordering of columns from the way they are\n    // ordered inn the underlying data, this is where we effect the ordering.\n    const { count } = metadataKeys;\n    clientRow = row\n      .slice(0, count)\n      .concat(dataIndices.map((idx) => row[idx])) as DataSourceRow;\n  } else {\n    clientRow = row.slice() as DataSourceRow;\n  }\n  clientRow[RENDER_IDX] = keys.keyFor(rowIndex);\n  clientRow[SELECTED] = getSelectionStatus(selection, rowIndex);\n  return clientRow;\n};\n\nconst divergentMaps = (columnMap: ColumnMap, dataMap?: ColumnMap) => {\n  if (dataMap) {\n    const { count: mapOffset } = metadataKeys;\n    for (const [columnName, index] of Object.entries(columnMap)) {\n      const dataIdx = dataMap[columnName];\n      if (dataIdx === undefined) {\n        throw Error(\n          `ArrayDataSource column ${columnName} is not in underlying data set`\n        );\n      } else if (dataIdx !== index - mapOffset) {\n        return true;\n      }\n    }\n  }\n  return false;\n};\n\nconst getDataIndices = (columnMap: ColumnMap, dataMap: ColumnMap) => {\n  const { count: mapOffset } = metadataKeys;\n  const result: number[] = [];\n  Object.entries(columnMap).forEach(([columnName]) => {\n    result.push(dataMap[columnName] + mapOffset);\n  });\n  return result;\n};\n\nexport const buildDataToClientMap = (\n  columnMap: ColumnMap,\n  dataMap?: ColumnMap\n): number[] | undefined => {\n  if (dataMap && divergentMaps(columnMap, dataMap)) {\n    return getDataIndices(columnMap, dataMap);\n  }\n  return undefined;\n};\n", "import { DataSourceFilter, DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport { ColumnDescriptor, Selection } from \"@vuu-ui/vuu-table-types\";\nimport { filterPredicate, parseFilter } from \"@vuu-ui/vuu-filter-parser\";\nimport {\n  ClientToServerEditRpc,\n  ClientToServerMenuRPC,\n  LinkDescriptorWithLabel,\n  VuuAggregation,\n  VuuGroupBy,\n  VuuMenu,\n  VuuRange,\n  VuuRowDataItemType,\n  VuuSort,\n} from \"@vuu-ui/vuu-protocol-types\";\nimport {\n  buildColumnMap,\n  ColumnMap,\n  EventEmitter,\n  getAddedItems,\n  getMissingItems,\n  KeySet,\n  logger,\n  metadataKeys,\n  NULL_RANGE,\n  rangeNewItems,\n  resetRange,\n  uuid,\n} from \"@vuu-ui/vuu-utils\";\nimport {\n  configChanged,\n  DataSource,\n  DataSourceConfig,\n  DataSourceConstructorProps,\n  DataSourceEvents,\n  DataSourceStatus,\n  groupByChanged,\n  hasFilter,\n  hasGroupBy,\n  hasSort,\n  SubscribeCallback,\n  SubscribeProps,\n  vanillaConfig,\n  withConfigDefaults,\n  WithFullConfig,\n} from \"../data-source\";\nimport { TableSchema } from \"../message-utils\";\nimport {\n  MenuRpcResponse,\n  VuuUIMessageInRPCEditReject,\n  VuuUIMessageInRPCEditResponse,\n} from \"../vuuUIMessageTypes\";\nimport { aggregateData } from \"./aggregate-utils\";\nimport { collapseGroup, expandGroup, GroupMap, groupRows } from \"./group-utils\";\nimport { sortRows } from \"./sort-utils\";\nimport { buildDataToClientMap, toClientRow } from \"./array-data-utils\";\n\nconst { KEY } = metadataKeys;\n\nexport interface ArrayDataSourceConstructorProps\n  extends Omit<DataSourceConstructorProps, \"bufferSize\" | \"table\"> {\n  columnDescriptors: ColumnDescriptor[];\n  data: Array<VuuRowDataItemType[]>;\n  dataMap?: ColumnMap;\n  keyColumn?: string;\n  rangeChangeRowset?: \"delta\" | \"full\";\n}\nconst { debug } = logger(\"ArrayDataSource\");\n\nconst toDataSourceRow =\n  (key: number) =>\n  (data: VuuRowDataItemType[], index: number): DataSourceRow => {\n    return [index, index, true, false, 1, 0, String(data[key]), 0, ...data];\n  };\n\nconst buildTableSchema = (\n  columns: ColumnDescriptor[],\n  keyColumn?: string\n): TableSchema => {\n  const schema: TableSchema = {\n    columns: columns.map(({ name, serverDataType = \"string\" }) => ({\n      name,\n      serverDataType,\n    })),\n    key: keyColumn ?? columns[0].name,\n    table: { module: \"\", table: \"Array\" },\n  };\n\n  return schema;\n};\n\nexport class ArrayDataSource\n  extends EventEmitter<DataSourceEvents>\n  implements DataSource\n{\n  private clientCallback: SubscribeCallback | undefined;\n  private columnDescriptors: ColumnDescriptor[];\n  /** sorted offsets of data within raw data, reflecting sort order\n   * of columns specified by client.\n   */\n  private dataIndices: number[] | undefined;\n  /** Map reflecting positions of data items in raw data */\n  private dataMap: ColumnMap | undefined;\n  private groupMap: undefined | GroupMap;\n  /** the index of key field within raw data row */\n  private key: number;\n  private lastRangeServed: VuuRange = { from: 0, to: 0 };\n  private rangeChangeRowset: \"delta\" | \"full\";\n  private openTreeNodes: string[] = [];\n\n  /** Map reflecting positions of columns in client data sent to user */\n  #columnMap: ColumnMap;\n  #config: WithFullConfig = vanillaConfig;\n  #data: DataSourceRow[];\n  #links: LinkDescriptorWithLabel[] | undefined;\n  #range: VuuRange = NULL_RANGE;\n  #selectedRowsCount = 0;\n  #size = 0;\n  #status: DataSourceStatus = \"initialising\";\n  #title: string | undefined;\n\n  protected _menu: VuuMenu | undefined;\n  protected selectedRows: Selection = [];\n\n  public tableSchema: TableSchema;\n  public viewport: string;\n\n  private keys = new KeySet(this.#range);\n  protected processedData: DataSourceRow[] | undefined = undefined;\n\n  constructor({\n    aggregations,\n    // different from RemoteDataSource\n    columnDescriptors,\n    data,\n    dataMap,\n    filter,\n    groupBy,\n    keyColumn,\n    rangeChangeRowset = \"delta\",\n    sort,\n    title,\n    viewport,\n  }: ArrayDataSourceConstructorProps) {\n    super();\n\n    if (!data || !columnDescriptors) {\n      throw Error(\n        \"ArrayDataSource constructor called without data or without columnDescriptors\"\n      );\n    }\n\n    this.columnDescriptors = columnDescriptors;\n    this.dataMap = dataMap;\n    this.key = keyColumn\n      ? this.columnDescriptors.findIndex((col) => col.name === keyColumn)\n      : 0;\n    this.rangeChangeRowset = rangeChangeRowset;\n    this.tableSchema = buildTableSchema(columnDescriptors, keyColumn);\n    this.viewport = viewport || uuid();\n    this.#size = data.length;\n    this.#title = title;\n\n    const columns = columnDescriptors.map((col) => col.name);\n    this.#columnMap = buildColumnMap(columns);\n    this.dataIndices = buildDataToClientMap(this.#columnMap, this.dataMap);\n    this.#data = data.map<DataSourceRow>(toDataSourceRow(this.key));\n\n    this.config = {\n      ...this.#config,\n      aggregations: aggregations || this.#config.aggregations,\n      columns,\n      filter: filter || this.#config.filter,\n      groupBy: groupBy || this.#config.groupBy,\n      sort: sort || this.#config.sort,\n    };\n\n    debug?.(`columnMap: ${JSON.stringify(this.#columnMap)}`);\n  }\n\n  async subscribe(\n    {\n      viewport = this.viewport ?? uuid(),\n      columns,\n      aggregations,\n      range,\n      sort,\n      groupBy,\n      filter,\n    }: SubscribeProps,\n    callback: SubscribeCallback\n  ) {\n    this.clientCallback = callback;\n    this.viewport = viewport;\n    this.#status = \"subscribed\";\n    this.lastRangeServed = { from: 0, to: 0 };\n\n    let config = this.#config;\n\n    const hasConfigProps = aggregations || columns || filter || groupBy || sort;\n    if (hasConfigProps) {\n      if (range) {\n        this.#range = range;\n      }\n      config = {\n        ...config,\n        aggregations: aggregations || this.#config.aggregations,\n        columns: columns || this.#config.columns,\n        filter: filter || this.#config.filter,\n        groupBy: groupBy || this.#config.groupBy,\n        sort: sort || this.#config.sort,\n      };\n    }\n\n    this.clientCallback?.({\n      ...config,\n      type: \"subscribed\",\n      clientViewportId: this.viewport,\n      range: this.#range,\n      tableSchema: this.tableSchema,\n    });\n\n    if (hasConfigProps) {\n      // invoke setter to action config\n      this.config = config;\n    } else {\n      this.clientCallback({\n        clientViewportId: this.viewport,\n        mode: \"size-only\",\n        type: \"viewport-update\",\n        size: this.#data.length,\n      });\n      if (range) {\n        // set range and trigger dispatch of initial rows\n        this.range = range;\n      } else if (this.#range !== NULL_RANGE) {\n        this.sendRowsToClient();\n      }\n    }\n  }\n\n  unsubscribe() {\n    console.log(\"unsubscribe noop\");\n  }\n\n  suspend() {\n    console.log(\"noop\");\n    return this;\n  }\n\n  resume() {\n    console.log(\"resume noop\");\n    return this;\n  }\n\n  disable() {\n    console.log(\"disable noop\");\n    return this;\n  }\n\n  enable() {\n    console.log(\"enable noop\");\n    return this;\n  }\n\n  select(selected: Selection) {\n    this.#selectedRowsCount = selected.length;\n    debug?.(`select ${JSON.stringify(selected)}`);\n    this.selectedRows = selected;\n    this.setRange(resetRange(this.#range), true);\n  }\n\n  openTreeNode(key: string) {\n    this.openTreeNodes.push(key);\n    this.processedData = expandGroup(\n      this.openTreeNodes,\n      this.#data,\n      this.#config.groupBy,\n      this.#columnMap,\n      this.groupMap as GroupMap,\n      this.processedData as DataSourceRow[]\n    );\n    this.setRange(resetRange(this.#range), true);\n  }\n\n  closeTreeNode(key: string) {\n    this.openTreeNodes = this.openTreeNodes.filter((value) => value !== key);\n    if (this.processedData) {\n      this.processedData = collapseGroup(key, this.processedData);\n      this.setRange(resetRange(this.#range), true);\n    }\n  }\n\n  get links() {\n    return this.#links;\n  }\n\n  get menu() {\n    return this._menu;\n  }\n\n  get status() {\n    return this.#status;\n  }\n\n  get data() {\n    return this.#data;\n  }\n\n  // Only used by the UpdateGenerator\n  get currentData() {\n    return this.processedData ?? this.#data;\n  }\n\n  get table() {\n    return this.tableSchema.table;\n  }\n\n  get config() {\n    return this.#config;\n  }\n\n  set config(config: DataSourceConfig) {\n    if (this.applyConfig(config)) {\n      if (config) {\n        const originalConfig = this.#config;\n        const newConfig: DataSourceConfig =\n          config?.filter?.filter && config?.filter.filterStruct === undefined\n            ? {\n                ...config,\n                filter: {\n                  filter: config.filter.filter,\n                  filterStruct: parseFilter(config.filter.filter),\n                },\n              }\n            : config;\n\n        this.#config = withConfigDefaults(newConfig);\n\n        let processedData: DataSourceRow[] | undefined;\n\n        if (hasFilter(config)) {\n          const { filter, filterStruct = parseFilter(filter) } = config.filter;\n          if (filterStruct) {\n            const fn = filterPredicate(this.#columnMap, filterStruct);\n            processedData = this.#data.filter(fn);\n          } else {\n            throw Error(\"filter must include filterStruct\");\n          }\n        }\n\n        if (hasSort(config)) {\n          processedData = sortRows(\n            processedData ?? this.#data,\n            config.sort,\n            this.#columnMap\n          );\n        }\n\n        if (\n          this.openTreeNodes.length > 0 &&\n          groupByChanged(originalConfig, config)\n        ) {\n          if (this.#config.groupBy.length === 0) {\n            this.openTreeNodes.length = 0;\n          } else {\n            //TODO purge any openTreeNodes for a no-longer-present groupBy col\n            console.log(\"adjust the openTReeNodes groupBy changed \", {\n              originalGroupBy: originalConfig.groupBy,\n              newGroupBy: newConfig.groupBy,\n            });\n          }\n        }\n\n        if (hasGroupBy(config)) {\n          const [groupedData, groupMap] = groupRows(\n            processedData ?? this.#data,\n            config.groupBy,\n            this.#columnMap\n          );\n          this.groupMap = groupMap;\n          processedData = groupedData;\n\n          if (this.openTreeNodes.length > 0) {\n            processedData = expandGroup(\n              this.openTreeNodes,\n              this.#data,\n              this.#config.groupBy,\n              this.#columnMap,\n              this.groupMap as GroupMap,\n              processedData as DataSourceRow[]\n            );\n          }\n        }\n\n        this.processedData = processedData?.map((row, i) => {\n          const dolly = row.slice() as DataSourceRow;\n          dolly[0] = i;\n          dolly[1] = i;\n          return dolly;\n        });\n      }\n\n      this.setRange(resetRange(this.#range), true);\n\n      this.emit(\"config\", this.#config);\n    }\n  }\n\n  applyConfig(config: DataSourceConfig) {\n    if (configChanged(this.#config, config)) {\n      if (config) {\n        const newConfig: DataSourceConfig =\n          config?.filter?.filter && config?.filter.filterStruct === undefined\n            ? {\n                ...config,\n                filter: {\n                  filter: config.filter.filter,\n                  filterStruct: parseFilter(config.filter.filter),\n                },\n              }\n            : config;\n        this.#config = withConfigDefaults(newConfig);\n        return true;\n      }\n    }\n  }\n\n  get selectedRowsCount() {\n    return this.#selectedRowsCount;\n  }\n\n  get size() {\n    // return this.#size;\n    return this.processedData?.length ?? this.#data.length;\n  }\n\n  get range() {\n    return this.#range;\n  }\n\n  set range(range: VuuRange) {\n    if (range.from !== this.#range.from || range.to !== this.#range.to) {\n      this.setRange(range);\n    }\n  }\n\n  protected delete(row: VuuRowDataItemType[]) {\n    console.log(`delete row ${row.join(\",\")}`);\n  }\n\n  protected insert = (row: VuuRowDataItemType[]) => {\n    // TODO take sorting, filtering. grouping into account\n    const dataSourceRow = toDataSourceRow(this.key)(row, this.size);\n    (this.#data as DataSourceRow[]).push(dataSourceRow);\n    const { from, to } = this.#range;\n    const [rowIdx] = dataSourceRow;\n    if (rowIdx >= from && rowIdx < to) {\n      this.sendRowsToClient();\n    }\n  };\n\n  protected update = (row: VuuRowDataItemType[], columnName: string) => {\n    // TODO take sorting, filtering. grouping into account\n    const keyValue = row[this.key];\n    const colIndex = this.#columnMap[columnName];\n    const dataColIndex = this.dataMap?.[columnName];\n    const dataIndex = this.#data.findIndex((row) => row[KEY] === keyValue);\n    if (dataIndex !== -1 && dataColIndex !== undefined) {\n      const dataSourceRow = this.#data[dataIndex];\n      dataSourceRow[colIndex] = row[dataColIndex];\n      const { from, to } = this.#range;\n      const [rowIdx] = dataSourceRow;\n      if (rowIdx >= from && rowIdx < to) {\n        this.sendRowsToClient(false, dataSourceRow);\n      }\n    }\n  };\n\n  protected updateRow = (row: VuuRowDataItemType[]) => {\n    // TODO take sorting, filtering. grouping into account\n    const keyValue = row[this.key];\n    const dataIndex = this.#data.findIndex((row) => row[KEY] === keyValue);\n    if (dataIndex !== -1) {\n      const dataSourceRow = toDataSourceRow(this.key)(row, dataIndex);\n      // maybe update this in place\n      this.#data[dataIndex] = dataSourceRow;\n      const { from, to } = this.#range;\n      if (dataIndex >= from && dataIndex < to) {\n        this.sendRowsToClient(false, dataSourceRow);\n      }\n    }\n  };\n\n  private setRange(range: VuuRange, forceFullRefresh = false) {\n    this.#range = range;\n    this.keys.reset(range);\n    this.sendRowsToClient(forceFullRefresh);\n  }\n\n  sendRowsToClient(forceFullRefresh = false, row?: DataSourceRow) {\n    if (row) {\n      this.clientCallback?.({\n        clientViewportId: this.viewport,\n        mode: \"update\",\n        rows: [\n          toClientRow(row, this.keys, this.selectedRows, this.dataIndices),\n        ],\n        type: \"viewport-update\",\n      });\n    } else {\n      const rowRange =\n        this.rangeChangeRowset === \"delta\" && !forceFullRefresh\n          ? rangeNewItems(this.lastRangeServed, this.#range)\n          : this.#range;\n      const data = this.processedData ?? this.#data;\n\n      const rowsWithinViewport = data\n        .slice(rowRange.from, rowRange.to)\n        .map((row) =>\n          toClientRow(row, this.keys, this.selectedRows, this.dataIndices)\n        );\n\n      this.clientCallback?.({\n        clientViewportId: this.viewport,\n        mode: \"batch\",\n        rows: rowsWithinViewport,\n        size: data.length,\n        type: \"viewport-update\",\n      });\n      this.lastRangeServed = {\n        from: this.#range.from,\n        to: Math.min(\n          this.#range.to,\n          this.#range.from + rowsWithinViewport.length\n        ),\n      };\n    }\n  }\n\n  get columns() {\n    return this.#config.columns;\n  }\n\n  set columns(columns: string[]) {\n    const addedColumns = getAddedItems(this.config.columns, columns);\n    if (addedColumns.length > 0) {\n      const columnsWithoutDescriptors = getMissingItems(\n        this.columnDescriptors,\n        addedColumns,\n        (col) => col.name\n      );\n      console.log(`columnsWithoutDescriptors`, {\n        columnsWithoutDescriptors,\n      });\n    }\n    this.#columnMap = buildColumnMap(columns);\n    this.dataIndices = buildDataToClientMap(this.#columnMap, this.dataMap);\n\n    this.config = {\n      ...this.#config,\n      columns,\n    };\n  }\n\n  get aggregations() {\n    return this.#config.aggregations;\n  }\n\n  set aggregations(aggregations: VuuAggregation[]) {\n    this.#config = {\n      ...this.#config,\n      aggregations,\n    };\n\n    const targetData = this.processedData ?? this.#data;\n    const leafData = this.#data;\n\n    aggregateData(\n      aggregations,\n      targetData,\n      this.#config.groupBy,\n      leafData,\n      this.#columnMap,\n      this.groupMap as GroupMap\n    );\n    this.setRange(resetRange(this.#range), true);\n\n    this.emit(\"config\", this.#config);\n  }\n\n  get sort() {\n    return this.#config.sort;\n  }\n\n  set sort(sort: VuuSort) {\n    debug?.(`sort ${JSON.stringify(sort)}`);\n    this.config = {\n      ...this.#config,\n      sort,\n    };\n  }\n\n  get filter() {\n    return this.#config.filter;\n  }\n\n  set filter(filter: DataSourceFilter) {\n    debug?.(`filter ${JSON.stringify(filter)}`);\n    // TODO check that filter has changed\n    this.config = {\n      ...this.#config,\n      filter,\n    };\n  }\n\n  get groupBy() {\n    return this.#config.groupBy;\n  }\n\n  set groupBy(groupBy: VuuGroupBy) {\n    this.config = {\n      ...this.#config,\n      groupBy,\n    };\n  }\n\n  get title() {\n    return this.#title;\n  }\n\n  set title(title: string | undefined) {\n    this.#title = title;\n  }\n\n  get _clientCallback() {\n    return this.clientCallback;\n  }\n\n  createLink({\n    parentVpId,\n    link: { fromColumn, toColumn },\n  }: LinkDescriptorWithLabel) {\n    console.log(\"create link\", {\n      parentVpId,\n      fromColumn,\n      toColumn,\n    });\n  }\n\n  removeLink() {\n    console.log(\"remove link\");\n  }\n\n  private findRow(rowKey: number) {\n    const row = this.#data[rowKey];\n    if (row) {\n      return row;\n    } else {\n      throw `no row found for key ${rowKey}`;\n    }\n  }\n\n  applyEdit(\n    row: DataSourceRow,\n    columnName: string,\n    value: VuuRowDataItemType\n  ): Promise<true> {\n    console.log(`ArrayDataSource applyEdit ${row[0]} ${columnName} ${value}`);\n    return Promise.resolve(true);\n  }\n\n  async menuRpcCall(\n    rpcRequest: Omit<ClientToServerMenuRPC, \"vpId\"> | ClientToServerEditRpc\n  ): Promise<\n    | MenuRpcResponse\n    | VuuUIMessageInRPCEditReject\n    | VuuUIMessageInRPCEditResponse\n    | undefined\n  > {\n    return new Promise((resolve) => {\n      const { type } = rpcRequest;\n      switch (type) {\n        case \"VP_EDIT_CELL_RPC\":\n          {\n            // TODO\n            // const { rowKey, field, value } = rpcRequest;\n            // try {\n            //   this.update(rowKey, field, value);\n            //   resolve(undefined);\n            // } catch (error) {\n            //   resolve({ error: String(error), type: \"VP_EDIT_RPC_REJECT\" });\n            // }\n          }\n\n          break;\n        default:\n          resolve(undefined);\n      }\n    });\n  }\n}\n", "import { ColumnDescriptor, Selection } from \"@vuu-ui/vuu-table-types\";\nimport {\n  LinkDescriptorWithLabel,\n  VuuGroupBy,\n  VuuAggregation,\n  VuuRange,\n  VuuSort,\n  ClientToServerMenuRPC,\n  ClientToServerEditRpc,\n  VuuRowDataItemType,\n} from \"@vuu-ui/vuu-protocol-types\";\nimport { DataSourceFilter, DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport {\n  EventEmitter,\n  isSelected,\n  JsonData,\n  jsonToDataSourceRows,\n  KeySet,\n  metadataKeys,\n  uuid,\n} from \"@vuu-ui/vuu-utils\";\nimport type {\n  DataSource,\n  DataSourceConstructorProps,\n  DataSourceEvents,\n  DataSourceStatus,\n  SubscribeCallback,\n  SubscribeProps,\n  WithFullConfig,\n} from \"./data-source\";\nimport { vanillaConfig } from \"./data-source\";\nimport {\n  MenuRpcResponse,\n  VuuUIMessageInRPCEditReject,\n  VuuUIMessageInRPCEditResponse,\n} from \"./vuuUIMessageTypes\";\n\nconst NULL_SCHEMA = { columns: [], key: \"\", table: { module: \"\", table: \"\" } };\n\nexport interface JsonDataSourceConstructorProps\n  extends Omit<DataSourceConstructorProps, \"bufferSize\" | \"table\"> {\n  data: JsonData;\n}\n\nconst { DEPTH, IDX, IS_EXPANDED, IS_LEAF, KEY, SELECTED } = metadataKeys;\n\nconst toClientRow = (row: DataSourceRow, keys: KeySet) => {\n  const [rowIndex] = row;\n  const clientRow = row.slice() as DataSourceRow;\n  clientRow[1] = keys.keyFor(rowIndex);\n  return clientRow;\n};\n\nexport class JsonDataSource\n  extends EventEmitter<DataSourceEvents>\n  implements DataSource\n{\n  public columnDescriptors: ColumnDescriptor[];\n  private clientCallback: SubscribeCallback | undefined;\n  private expandedRows = new Set<string>();\n  private visibleRows: DataSourceRow[] = [];\n\n  #aggregations: VuuAggregation[] = [];\n  #config: WithFullConfig = vanillaConfig;\n  #data: DataSourceRow[];\n  #filter: DataSourceFilter = { filter: \"\" };\n  #groupBy: VuuGroupBy = [];\n  #range: VuuRange = { from: 0, to: 0 };\n  #selectedRowsCount = 0;\n  #size = 0;\n  #sort: VuuSort = { sortDefs: [] };\n  #status: DataSourceStatus = \"initialising\";\n  #title: string | undefined;\n\n  public rowCount: number | undefined;\n  public viewport: string;\n\n  private keys = new KeySet(this.#range);\n\n  constructor({\n    aggregations,\n    data,\n    filter,\n    groupBy,\n    sort,\n    title,\n    viewport,\n  }: JsonDataSourceConstructorProps) {\n    super();\n\n    if (!data) {\n      throw Error(\"JsonDataSource constructor called without data\");\n    }\n\n    [this.columnDescriptors, this.#data] = jsonToDataSourceRows(data);\n\n    this.visibleRows = this.#data\n      .filter((row) => row[DEPTH] === 0)\n      .map((row, index) =>\n        ([index, index] as Partial<DataSourceRow>).concat(row.slice(2))\n      ) as DataSourceRow[];\n    this.viewport = viewport || uuid();\n    if (aggregations) {\n      this.#aggregations = aggregations;\n    }\n    if (this.columnDescriptors) {\n      this.#config = {\n        ...this.#config,\n        columns: this.columnDescriptors.map((c) => c.name),\n      };\n    }\n    if (filter) {\n      this.#filter = filter;\n    }\n    if (groupBy) {\n      this.#groupBy = groupBy;\n    }\n    if (sort) {\n      this.#sort = sort;\n    }\n    this.#title = title;\n  }\n\n  async subscribe(\n    {\n      viewport = this.viewport ?? uuid(),\n      columns,\n      aggregations,\n      range,\n      sort,\n      groupBy,\n      filter,\n    }: SubscribeProps,\n    callback: SubscribeCallback\n  ) {\n    this.clientCallback = callback;\n\n    if (aggregations) {\n      this.#aggregations = aggregations;\n    }\n    if (columns) {\n      this.#config = {\n        ...this.#config,\n        columns,\n      };\n    }\n    if (filter) {\n      this.#filter = filter;\n    }\n    if (groupBy) {\n      this.#groupBy = groupBy;\n    }\n    if (range) {\n      this.#range = range;\n    }\n    if (sort) {\n      this.#sort = sort;\n    }\n\n    if (this.#status !== \"initialising\") {\n      //TODO check if subscription details are still the same\n      return;\n    }\n\n    this.viewport = viewport;\n\n    this.#status = \"subscribed\";\n\n    this.clientCallback?.({\n      aggregations: this.#aggregations,\n      type: \"subscribed\",\n      clientViewportId: this.viewport,\n      columns: this.#config.columns,\n      filter: this.#filter,\n      groupBy: this.#groupBy,\n      range: this.#range,\n      sort: this.#sort,\n      tableSchema: NULL_SCHEMA,\n    });\n\n    this.clientCallback({\n      clientViewportId: this.viewport,\n      mode: \"size-only\",\n      type: \"viewport-update\",\n      size: this.visibleRows.length,\n    });\n  }\n\n  unsubscribe() {\n    console.log(\"noop\");\n  }\n\n  suspend() {\n    console.log(\"noop\");\n    return this;\n  }\n\n  resume() {\n    console.log(\"noop\");\n    return this;\n  }\n\n  disable() {\n    console.log(\"noop\");\n    return this;\n  }\n\n  enable() {\n    console.log(\"noop\");\n    return this;\n  }\n  set data(data: JsonData) {\n    console.log(`set JsonDataSource data`);\n    [this.columnDescriptors, this.#data] = jsonToDataSourceRows(data);\n    this.visibleRows = this.#data\n      .filter((row) => row[DEPTH] === 0)\n      .map((row, index) =>\n        ([index, index] as Partial<DataSourceRow>).concat(row.slice(2))\n      ) as DataSourceRow[];\n\n    requestAnimationFrame(() => {\n      this.sendRowsToClient();\n    });\n  }\n\n  select(selected: Selection) {\n    const updatedRows: DataSourceRow[] = [];\n    for (const row of this.#data) {\n      const { [IDX]: rowIndex, [SELECTED]: sel } = row;\n      const wasSelected = sel === 1;\n      const nowSelected = isSelected(selected, rowIndex);\n      if (nowSelected !== wasSelected) {\n        const selectedRow = row.slice() as DataSourceRow;\n        selectedRow[SELECTED] = nowSelected ? 1 : 0;\n        this.#data[rowIndex] = selectedRow;\n        updatedRows.push(selectedRow);\n      }\n    }\n\n    if (updatedRows.length > 0) {\n      this.clientCallback?.({\n        clientViewportId: this.viewport,\n        mode: \"update\",\n        type: \"viewport-update\",\n        rows: updatedRows,\n      });\n    }\n  }\n\n  openTreeNode(key: string) {\n    this.expandedRows.add(key);\n    this.visibleRows = getVisibleRows(this.#data, this.expandedRows);\n    const { from, to } = this.#range;\n    this.clientCallback?.({\n      clientViewportId: this.viewport,\n\n      mode: \"batch\",\n      rows: this.visibleRows\n        .slice(from, to)\n        .map((row) => toClientRow(row, this.keys)),\n      size: this.visibleRows.length,\n      type: \"viewport-update\",\n    });\n  }\n\n  closeTreeNode(key: string, cascade = false) {\n    this.expandedRows.delete(key);\n    if (cascade) {\n      for (const rowKey of this.expandedRows.keys()) {\n        if (rowKey.startsWith(key)) {\n          this.expandedRows.delete(rowKey);\n        }\n      }\n    }\n    this.visibleRows = getVisibleRows(this.#data, this.expandedRows);\n    this.sendRowsToClient();\n  }\n\n  get status() {\n    return this.#status;\n  }\n\n  get config() {\n    return this.#config;\n  }\n\n  applyConfig() {\n    return true as const;\n  }\n\n  get selectedRowsCount() {\n    return this.#selectedRowsCount;\n  }\n\n  get size() {\n    return this.#size;\n  }\n\n  get range() {\n    return this.#range;\n  }\n\n  set range(range: VuuRange) {\n    this.#range = range;\n    this.keys.reset(range);\n    requestAnimationFrame(() => {\n      this.sendRowsToClient();\n    });\n  }\n\n  private sendRowsToClient() {\n    const { from, to } = this.#range;\n    this.clientCallback?.({\n      clientViewportId: this.viewport,\n      mode: \"batch\",\n      rows: this.visibleRows\n        .slice(from, to)\n        .map((row) => toClientRow(row, this.keys)),\n      size: this.visibleRows.length,\n      type: \"viewport-update\",\n    });\n  }\n\n  get columns() {\n    return this.#config.columns;\n  }\n\n  set columns(columns: string[]) {\n    // TODO use setter\n    this.#config = {\n      ...this.#config,\n      columns,\n    };\n  }\n\n  get aggregations() {\n    return this.#aggregations;\n  }\n\n  set aggregations(aggregations: VuuAggregation[]) {\n    this.#aggregations = aggregations;\n  }\n\n  get sort() {\n    return this.#sort;\n  }\n\n  set sort(sort: VuuSort) {\n    // TODO should we wait until server ACK before we assign #sort ?\n    this.#sort = sort;\n  }\n\n  get filter() {\n    return this.#filter;\n  }\n\n  set filter(filter: DataSourceFilter) {\n    // TODO should we wait until server ACK before we assign #sort ?\n    this.#filter = filter;\n  }\n\n  get groupBy() {\n    return this.#groupBy;\n  }\n\n  set groupBy(groupBy: VuuGroupBy) {\n    this.#groupBy = groupBy;\n  }\n\n  get title() {\n    return this.#title;\n  }\n\n  set title(title: string | undefined) {\n    this.#title = title;\n  }\n\n  createLink({\n    parentVpId,\n    link: { fromColumn, toColumn },\n  }: LinkDescriptorWithLabel) {\n    console.log(\"create link\", {\n      parentVpId,\n      fromColumn,\n      toColumn,\n    });\n  }\n\n  removeLink() {\n    console.log(\"remove link\");\n  }\n\n  async menuRpcCall(\n    rpcRequest: Omit<ClientToServerMenuRPC, \"vpId\"> | ClientToServerEditRpc\n  ): Promise<\n    | MenuRpcResponse\n    | VuuUIMessageInRPCEditReject\n    | VuuUIMessageInRPCEditResponse\n    | undefined\n  > {\n    console.log(\"rmenuRpcCall\", {\n      rpcRequest,\n    });\n    return undefined;\n  }\n\n  applyEdit(\n    row: DataSourceRow,\n    columnName: string,\n    value: VuuRowDataItemType\n  ): Promise<true> {\n    console.log(\n      `ArrayDataSource applyEdit ${row.join(\",\")} ${columnName} ${value}`\n    );\n    return Promise.resolve(true);\n  }\n\n  getChildRows(rowKey: string) {\n    const parentRow = this.#data.find((row) => row[KEY] === rowKey);\n    if (parentRow) {\n      const { [IDX]: parentIdx, [DEPTH]: parentDepth } = parentRow;\n      let rowIdx = parentIdx + 1;\n      const childRows = [];\n      do {\n        const { [DEPTH]: depth } = this.#data[rowIdx];\n        if (depth === parentDepth + 1) {\n          childRows.push(this.#data[rowIdx]);\n        } else if (depth <= parentDepth) {\n          break;\n        }\n        rowIdx += 1;\n      } while (rowIdx < this.#data.length);\n      return childRows;\n    } else {\n      console.warn(\n        `JsonDataSource getChildRows row not found for key ${rowKey}`\n      );\n    }\n\n    return [];\n  }\n\n  getRowsAtDepth(depth: number, visibleOnly = true) {\n    const rows = visibleOnly ? this.visibleRows : this.#data;\n    return rows.filter((row) => row[DEPTH] === depth);\n  }\n}\n\ntype Index = {\n  value: number;\n};\n\nfunction getVisibleRows(rows: DataSourceRow[], expandedKeys: Set<string>) {\n  const visibleRows: DataSourceRow[] = [];\n  const index: Index = { value: 0 };\n  for (let i = 0; i < rows.length; i++) {\n    const row = rows[i];\n    const { [DEPTH]: depth, [KEY]: key, [IS_LEAF]: isLeaf } = row;\n    const isExpanded = expandedKeys.has(key);\n    visibleRows.push(cloneRow(row, index, isExpanded));\n    if (!isLeaf && !isExpanded) {\n      do {\n        i += 1;\n      } while (i < rows.length - 1 && rows[i + 1][DEPTH] > depth);\n    }\n  }\n  return visibleRows;\n}\n\nconst cloneRow = (\n  row: DataSourceRow,\n  index: Index,\n  isExpanded: boolean\n): DataSourceRow => {\n  const dolly = row.slice() as DataSourceRow;\n  dolly[0] = index.value;\n  dolly[1] = index.value;\n  if (isExpanded) {\n    dolly[IS_EXPANDED] = true;\n  }\n  index.value += 1;\n  return dolly;\n};\n", "import { DataSourceFilter, DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport { Selection } from \"@vuu-ui/vuu-table-types\";\nimport {\n  ClientToServerEditRpc,\n  ClientToServerMenuRPC,\n  ClientToServerViewportRpcCall,\n  LinkDescriptorWithLabel,\n  VuuAggregation,\n  VuuDataRowDto,\n  VuuGroupBy,\n  VuuMenu,\n  VuuRange,\n  VuuRowDataItemType,\n  VuuSort,\n  VuuTable,\n} from \"@vuu-ui/vuu-protocol-types\";\n\nimport { parseFilter } from \"@vuu-ui/vuu-filter-parser\";\nimport {\n  debounce,\n  EventEmitter,\n  itemsOrOrderChanged,\n  logger,\n  metadataKeys,\n  throttle,\n  uuid,\n} from \"@vuu-ui/vuu-utils\";\nimport { getServerAPI, ServerAPI } from \"./connection-manager\";\nimport {\n  configChanged,\n  DataSource,\n  DataSourceCallbackMessage,\n  DataSourceConfig,\n  DataSourceConstructorProps,\n  DataSourceEvents,\n  DataSourceStatus,\n  isDataSourceConfigMessage,\n  OptimizeStrategy,\n  RpcResponse,\n  SubscribeCallback,\n  SubscribeProps,\n  vanillaConfig,\n  withConfigDefaults,\n  WithFullConfig,\n} from \"./data-source\";\n\nimport {\n  isViewportMenusAction,\n  isVisualLinksAction,\n  MenuRpcResponse,\n} from \"./vuuUIMessageTypes\";\nimport { TableSchema } from \"./message-utils\";\n\ntype RangeRequest = (range: VuuRange) => void;\n\nconst { info } = logger(\"RemoteDataSource\");\n\nconst { KEY } = metadataKeys;\n\n/*-----------------------------------------------------------------\n A RemoteDataSource manages a single subscription via the ServerProxy\n  ----------------------------------------------------------------*/\nexport class RemoteDataSource\n  extends EventEmitter<DataSourceEvents>\n  implements DataSource\n{\n  private bufferSize: number;\n  private server: ServerAPI | null = null;\n  private clientCallback: SubscribeCallback | undefined;\n  private configChangePending: DataSourceConfig | undefined;\n  private rangeRequest: RangeRequest;\n\n  #config: WithFullConfig = vanillaConfig;\n  #groupBy: VuuGroupBy = [];\n  #links: LinkDescriptorWithLabel[] | undefined;\n  #menu: VuuMenu | undefined;\n  #optimize: OptimizeStrategy = \"throttle\";\n  #range: VuuRange = { from: 0, to: 0 };\n  #selectedRowsCount = 0;\n  #size = 0;\n  #status: DataSourceStatus = \"initialising\";\n\n  #title: string | undefined;\n\n  public table: VuuTable;\n  public tableSchema: TableSchema | undefined;\n  public viewport: string | undefined;\n\n  constructor({\n    bufferSize = 100,\n    aggregations,\n    columns,\n    filter,\n    groupBy,\n    sort,\n    table,\n    title,\n    viewport,\n    visualLink,\n  }: DataSourceConstructorProps) {\n    super();\n\n    if (!table)\n      throw Error(\"RemoteDataSource constructor called without table\");\n\n    this.bufferSize = bufferSize;\n    this.table = table;\n    this.viewport = viewport;\n\n    this.#config = {\n      ...this.#config,\n      aggregations: aggregations || this.#config.aggregations,\n      columns: columns || this.#config.columns,\n      filter: filter || this.#config.filter,\n      groupBy: groupBy || this.#config.groupBy,\n      sort: sort || this.#config.sort,\n      visualLink: visualLink || this.#config.visualLink,\n    };\n\n    this.#title = title;\n    this.rangeRequest = this.throttleRangeRequest;\n  }\n\n  async subscribe(\n    {\n      viewport = this.viewport ?? (this.viewport = uuid()),\n      columns,\n      aggregations,\n      range,\n      sort,\n      groupBy,\n      filter,\n    }: SubscribeProps,\n    callback: SubscribeCallback\n  ) {\n    if (this.#status === \"disabled\" || this.#status === \"disabling\") {\n      this.enable(callback);\n      return;\n    }\n    this.clientCallback = callback;\n    if (aggregations || columns || filter || groupBy || sort) {\n      this.#config = {\n        ...this.#config,\n        aggregations: aggregations || this.#config.aggregations,\n        columns: columns || this.#config.columns,\n        filter: filter || this.#config.filter,\n        groupBy: groupBy || this.#config.groupBy,\n        sort: sort || this.#config.sort,\n      };\n    }\n\n    // store the range before we await the server. It's is possible the\n    // range will be updated from the client before we have been able to\n    // subscribe. This ensures we will subscribe with latest value.\n    if (range) {\n      this.#range = range;\n    }\n\n    if (\n      this.#status !== \"initialising\" &&\n      this.#status !== \"unsubscribed\"\n      // We can subscribe to a disabled dataSource. No request will be\n      // sent to server to create a new VP, just to enable the existing one.\n      // The current subscribing client becomes the subscription owner\n    ) {\n      return;\n    }\n\n    this.#status = \"subscribing\";\n    this.viewport = viewport;\n\n    this.server = await getServerAPI();\n\n    const { bufferSize } = this;\n\n    this.server?.subscribe(\n      {\n        ...this.#config,\n        bufferSize,\n        viewport,\n        table: this.table,\n        range: this.#range,\n        title: this.#title,\n      },\n      this.handleMessageFromServer\n    );\n  }\n\n  handleMessageFromServer = (message: DataSourceCallbackMessage) => {\n    if (message.type === \"subscribed\") {\n      this.#status = \"subscribed\";\n      if (message.tableSchema) {\n        this.tableSchema = message.tableSchema;\n      }\n      this.clientCallback?.(message);\n    } else if (message.type === \"disabled\") {\n      this.#status = \"disabled\";\n    } else if (message.type === \"enabled\") {\n      this.#status = \"enabled\";\n    } else if (isDataSourceConfigMessage(message)) {\n      // This is an ACK for a CHANGE_VP message. Nothing to do here. We need\n      // to wait for data to be returned before we can consider the change\n      // to be in effect.\n      return;\n    } else if (message.type === \"debounce-begin\") {\n      this.optimize = \"debounce\";\n    } else {\n      if (\n        message.type === \"viewport-update\" &&\n        message.size !== undefined &&\n        message.size !== this.#size\n      ) {\n        this.#size = message.size;\n        this.emit(\"resize\", message.size);\n      }\n      // This is used to remove any progress indication from the UI. We wait for actual data rather than\n      // just the CHANGE_VP_SUCCESS ack as there is often a delay between receiving the ack and the data.\n      // It may be a SIZE only message, eg in the case of removing a groupBy column from a multi-column\n      // groupby, where no tree nodes are expanded.\n      if (this.configChangePending) {\n        this.setConfigPending();\n      }\n\n      if (isViewportMenusAction(message)) {\n        this.#menu = message.menu;\n      } else if (isVisualLinksAction(message)) {\n        this.#links = message.links as LinkDescriptorWithLabel[];\n      } else {\n        this.clientCallback?.(message);\n      }\n\n      if (this.optimize === \"debounce\") {\n        this.revertDebounce();\n      }\n    }\n  };\n\n  unsubscribe() {\n    console.log(`unsubscribe #${this.viewport}`);\n    info?.(`unsubscribe #${this.viewport}`);\n    if (this.viewport) {\n      this.server?.unsubscribe(this.viewport);\n    }\n    this.server?.destroy(this.viewport);\n    this.server = null;\n    this.removeAllListeners();\n    this.#status = \"unsubscribed\";\n    this.viewport = undefined;\n    this.range = { from: 0, to: 0 };\n  }\n\n  suspend() {\n    console.log(`suspend #${this.viewport}, current status ${this.#status}`);\n    info?.(`suspend #${this.viewport}, current status ${this.#status}`);\n    if (this.viewport) {\n      this.#status = \"suspended\";\n      this.server?.send({\n        type: \"suspend\",\n        viewport: this.viewport,\n      });\n    }\n    return this;\n  }\n\n  resume() {\n    console.log(`resume #${this.viewport}, current status ${this.#status}`);\n\n    const isDisabled = this.#status.startsWith(\"disabl\");\n    const isSuspended = this.#status === \"suspended\";\n    info?.(`resume #${this.viewport}, current status ${this.#status}`);\n    if (this.viewport) {\n      if (isDisabled) {\n        this.enable();\n      } else if (isSuspended) {\n        this.server?.send({\n          type: \"resume\",\n          viewport: this.viewport,\n        });\n        this.#status = \"subscribed\";\n      }\n    }\n    return this;\n  }\n\n  disable() {\n    info?.(`disable #${this.viewport}, current status ${this.#status}`);\n    if (this.viewport) {\n      this.#status = \"disabling\";\n      this.server?.send({\n        viewport: this.viewport,\n        type: \"disable\",\n      });\n    }\n    return this;\n  }\n\n  enable(callback?: SubscribeCallback) {\n    info?.(`enable #${this.viewport}, current status ${this.#status}`);\n    if (\n      this.viewport &&\n      (this.#status === \"disabled\" || this.#status === \"disabling\")\n    ) {\n      this.#status = \"enabling\";\n      if (callback) {\n        this.clientCallback = callback;\n      }\n      this.server?.send({\n        viewport: this.viewport,\n        type: \"enable\",\n      });\n    }\n    return this;\n  }\n\n  select(selected: Selection) {\n    //TODO this isn't always going to be correct - need to count\n    // selection block items\n    this.#selectedRowsCount = selected.length;\n    if (this.viewport) {\n      this.server?.send({\n        viewport: this.viewport,\n        type: \"select\",\n        selected,\n      });\n    }\n  }\n\n  openTreeNode(key: string) {\n    if (this.viewport) {\n      this.server?.send({\n        viewport: this.viewport,\n        type: \"openTreeNode\",\n        key,\n      });\n    }\n  }\n\n  closeTreeNode(key: string) {\n    if (this.viewport) {\n      this.server?.send({\n        viewport: this.viewport,\n        type: \"closeTreeNode\",\n        key,\n      });\n    }\n  }\n\n  get links() {\n    return this.#links;\n  }\n\n  get menu() {\n    return this.#menu;\n  }\n\n  get status() {\n    return this.#status;\n  }\n\n  get optimize() {\n    return this.#optimize;\n  }\n\n  set optimize(optimize: OptimizeStrategy) {\n    if (optimize !== this.#optimize) {\n      this.#optimize = optimize;\n      switch (optimize) {\n        case \"none\":\n          this.rangeRequest = this.rawRangeRequest;\n          break;\n        case \"debounce\":\n          this.rangeRequest = this.debounceRangeRequest;\n          break;\n        case \"throttle\":\n          this.rangeRequest = this.throttleRangeRequest;\n          break;\n      }\n      this.emit(\"optimize\", optimize);\n    }\n  }\n\n  private revertDebounce = debounce(() => {\n    this.optimize = \"throttle\";\n  }, 100);\n\n  get selectedRowsCount() {\n    return this.#selectedRowsCount;\n  }\n\n  get size() {\n    return this.#size;\n  }\n\n  get range() {\n    return this.#range;\n  }\n\n  set range(range: VuuRange) {\n    if (range.from !== this.#range.from || range.to !== this.#range.to) {\n      this.#range = range;\n      this.rangeRequest(range);\n    }\n  }\n\n  private rawRangeRequest: RangeRequest = (range) => {\n    if (this.viewport && this.server) {\n      this.server.send({\n        viewport: this.viewport,\n        type: \"setViewRange\",\n        range,\n      });\n    }\n  };\n\n  private debounceRangeRequest: RangeRequest = debounce((range: VuuRange) => {\n    if (this.viewport && this.server) {\n      this.server.send({\n        viewport: this.viewport,\n        type: \"setViewRange\",\n        range,\n      });\n    }\n  }, 50);\n\n  private throttleRangeRequest: RangeRequest = throttle((range: VuuRange) => {\n    if (this.viewport && this.server) {\n      this.server.send({\n        viewport: this.viewport,\n        type: \"setViewRange\",\n        range,\n      });\n    }\n  }, 80);\n\n  get config() {\n    return this.#config;\n  }\n\n  set config(config: DataSourceConfig) {\n    if (this.applyConfig(config)) {\n      if (this.#config && this.viewport && this.server) {\n        if (config) {\n          this.server?.send({\n            viewport: this.viewport,\n            type: \"config\",\n            config: this.#config,\n          });\n        }\n      }\n      this.emit(\"config\", this.#config);\n    }\n  }\n\n  applyConfig(config: DataSourceConfig) {\n    if (configChanged(this.#config, config)) {\n      if (config) {\n        const newConfig: DataSourceConfig =\n          config?.filter?.filter && config?.filter.filterStruct === undefined\n            ? {\n                ...config,\n                filter: {\n                  filter: config.filter.filter,\n                  filterStruct: parseFilter(config.filter.filter),\n                },\n              }\n            : config;\n        this.#config = withConfigDefaults(newConfig);\n        return true;\n      }\n    }\n  }\n\n  //TODO replace all these individual server calls with calls to setConfig\n  get columns() {\n    return this.#config.columns;\n  }\n\n  set columns(columns: string[]) {\n    this.#config = {\n      ...this.#config,\n      columns,\n    };\n    if (this.viewport) {\n      const message = {\n        viewport: this.viewport,\n        type: \"setColumns\",\n        columns,\n      } as const;\n      if (this.server) {\n        this.server.send(message);\n      }\n    }\n    this.emit(\"config\", this.#config);\n  }\n\n  get aggregations() {\n    return this.#config.aggregations;\n  }\n\n  set aggregations(aggregations: VuuAggregation[]) {\n    this.#config = {\n      ...this.#config,\n      aggregations,\n    };\n    if (this.viewport) {\n      this.server?.send({\n        viewport: this.viewport,\n        type: \"aggregate\",\n        aggregations,\n      });\n    }\n    this.emit(\"config\", this.#config);\n  }\n\n  get sort() {\n    return this.#config.sort;\n  }\n\n  set sort(sort: VuuSort) {\n    // TODO should we wait until server ACK before we assign #sort ?\n    this.#config = {\n      ...this.#config,\n      sort,\n    };\n    if (this.viewport) {\n      const message = {\n        viewport: this.viewport,\n        type: \"sort\",\n        sort,\n      } as const;\n      if (this.server) {\n        this.server.send(message);\n      }\n    }\n    this.emit(\"config\", this.#config);\n  }\n\n  get filter() {\n    return this.#config.filter;\n  }\n\n  set filter(filter: DataSourceFilter) {\n    // TODO should we wait until server ACK before we assign #sort ?\n    this.#config = {\n      ...this.#config,\n      filter,\n    };\n    if (this.viewport) {\n      const message = {\n        viewport: this.viewport,\n        type: \"filter\",\n        filter,\n      } as const;\n      if (this.server) {\n        this.server.send(message);\n      }\n    }\n    this.emit(\"config\", this.#config);\n  }\n\n  get groupBy() {\n    return this.#config.groupBy;\n  }\n\n  set groupBy(groupBy: VuuGroupBy) {\n    if (itemsOrOrderChanged(this.groupBy, groupBy)) {\n      const wasGrouped = this.#groupBy.length > 0;\n      this.#config = {\n        ...this.#config,\n        groupBy,\n      };\n      if (this.viewport) {\n        const message = {\n          viewport: this.viewport,\n          type: \"groupBy\",\n          groupBy: this.#config.groupBy,\n        } as const;\n\n        if (this.server) {\n          this.server.send(message);\n        }\n      }\n      if (!wasGrouped && groupBy.length > 0 && this.viewport) {\n        this.clientCallback?.({\n          clientViewportId: this.viewport,\n          mode: \"batch\",\n          type: \"viewport-update\",\n          size: 0,\n          rows: [],\n        });\n      }\n      this.emit(\"config\", this.#config);\n      this.setConfigPending({ groupBy });\n    }\n  }\n\n  get title() {\n    return this.#title;\n  }\n\n  set title(title: string | undefined) {\n    this.#title = title;\n    if (this.viewport && title) {\n      this.server?.send({\n        type: \"setTitle\",\n        title,\n        viewport: this.viewport,\n      });\n    }\n  }\n\n  get visualLink() {\n    return this.#config.visualLink;\n  }\n\n  set visualLink(visualLink: LinkDescriptorWithLabel | undefined) {\n    this.#config = {\n      ...this.#config,\n      visualLink,\n    };\n\n    if (visualLink) {\n      const {\n        parentClientVpId,\n        link: { fromColumn, toColumn },\n      } = visualLink;\n\n      if (this.viewport) {\n        this.server?.send({\n          viewport: this.viewport,\n          type: \"createLink\",\n          parentClientVpId,\n          parentColumnName: toColumn,\n          childColumnName: fromColumn,\n        });\n      }\n    } else {\n      if (this.viewport) {\n        this.server?.send({\n          type: \"removeLink\",\n          viewport: this.viewport,\n        });\n      }\n    }\n    this.emit(\"config\", this.#config);\n  }\n\n  private setConfigPending(config?: DataSourceConfig) {\n    const pendingConfig = this.configChangePending;\n    this.configChangePending = config;\n\n    if (config !== undefined) {\n      this.emit(\"config\", config, false);\n    } else {\n      this.emit(\"config\", pendingConfig, true);\n    }\n  }\n\n  async rpcCall<T extends RpcResponse = RpcResponse>(\n    rpcRequest: Omit<ClientToServerViewportRpcCall, \"vpId\">\n  ) {\n    if (this.viewport) {\n      return this.server?.rpcCall<T>({\n        vpId: this.viewport,\n        ...rpcRequest,\n      } as ClientToServerViewportRpcCall);\n    }\n  }\n\n  async menuRpcCall(\n    rpcRequest: Omit<ClientToServerMenuRPC, \"vpId\"> | ClientToServerEditRpc\n  ) {\n    if (this.viewport) {\n      return this.server?.rpcCall<MenuRpcResponse>({\n        vpId: this.viewport,\n        ...rpcRequest,\n      } as ClientToServerMenuRPC);\n    }\n  }\n\n  applyEdit(row: DataSourceRow, columnName: string, value: VuuRowDataItemType) {\n    return this.menuRpcCall({\n      rowKey: row[KEY],\n      field: columnName,\n      value: value,\n      type: \"VP_EDIT_CELL_RPC\",\n    }).then((response) => {\n      if (response?.error) {\n        return response.error;\n      } else {\n        return true;\n      }\n    });\n  }\n\n  insertRow(key: string, data: VuuDataRowDto) {\n    return this.menuRpcCall({\n      rowKey: key,\n      data,\n      type: \"VP_EDIT_ADD_ROW_RPC\",\n    }).then((response) => {\n      if (response?.error) {\n        return response.error;\n      } else {\n        return true;\n      }\n    });\n  }\n  deleteRow(rowKey: string) {\n    return this.menuRpcCall({\n      rowKey,\n      type: \"VP_EDIT_DELETE_ROW_RPC\",\n    }).then((response) => {\n      if (response?.error) {\n        return response.error;\n      } else {\n        return true;\n      }\n    });\n  }\n}\n", "import { DataItem } from \"@vuu-ui/vuu-utils\";\nimport { Table } from \"./Table\";\n\nconst cachedValues = new Map<Table, Map<string, DataItem[]>>();\n\nconst getUniqueValues = (table: Table, column: string, pattern = \"\") => {\n  let uniqueValues;\n  const cachedEntry = cachedValues.get(table);\n  if (cachedEntry && cachedEntry.has(column)) {\n    uniqueValues = cachedEntry.get(column) as DataItem[];\n  } else {\n    const { data, map } = table;\n    const key = map[column];\n    uniqueValues = [];\n    const set = new Set();\n    for (const row of data) {\n      const value = row[key];\n      if (!set.has(value)) {\n        set.add(value);\n        uniqueValues.push(value);\n      }\n    }\n    uniqueValues.sort();\n    if (cachedEntry) {\n      cachedEntry.set(column, uniqueValues);\n    } else {\n      cachedValues.set(table, new Map([[column, uniqueValues]]));\n    }\n  }\n  return pattern\n    ? uniqueValues.filter((value) => value.toString().startsWith(pattern))\n    : uniqueValues;\n};\n\n// export const makeSuggestions = (\n//   table: Table,\n//   column: string,\n//   pattern?: string\n// ) => {\n//   const uniqueValues = getUniqueValues(table, column, pattern);\n//   if (uniqueValues.length > 20) {\n//     return uniqueValues?.slice(0, 20).map((v) => v.toString());\n//   } else {\n//     return uniqueValues.map((v) => v.toString());\n//   }\n// };\nexport const makeSuggestions = (\n  table: Table,\n  column: string,\n  pattern?: string\n): Promise<string[]> =>\n  new Promise((resolve) => {\n    const uniqueValues = getUniqueValues(table, column, pattern);\n    const result =\n      uniqueValues.length > 20\n        ? uniqueValues?.slice(0, 20).map((v) => v.toString())\n        : uniqueValues.map((v) => v.toString());\n    setTimeout(() => resolve(result), 100);\n  });\n", "import {\n  ArrayDataSource,\n  ArrayDataSourceConstructorProps,\n  MenuRpcResponse,\n  RpcResponse,\n  SubscribeCallback,\n  SubscribeProps,\n  VuuUIMessageInRPCEditReject,\n  VuuUIMessageInRPCEditResponse,\n} from \"@vuu-ui/vuu-data\";\nimport { DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport {\n  ClientToServerEditRpc,\n  ClientToServerMenuRPC,\n  ClientToServerViewportRpcCall,\n  VuuMenu,\n  VuuRange,\n  VuuRowDataItemType,\n} from \"@vuu-ui/vuu-protocol-types\";\nimport { SelectionItem } from \"@vuu-ui/vuu-table-types\";\nimport { metadataKeys } from \"@vuu-ui/vuu-utils\";\nimport { makeSuggestions } from \"./makeSuggestions\";\nimport { Table } from \"./Table\";\n\nexport type RpcService = {\n  rpcName: string;\n  service: (rpcRequest: any) => Promise<any>;\n};\n\nexport interface TickingArrayDataSourceConstructorProps\n  extends Omit<ArrayDataSourceConstructorProps, \"data\"> {\n  data?: Array<VuuRowDataItemType[]>;\n  menu?: VuuMenu;\n  menuRpcServices?: RpcService[];\n  rpcServices?: RpcService[];\n  table?: Table;\n}\n\nexport class TickingArrayDataSource extends ArrayDataSource {\n  #menuRpcServices: RpcService[] | undefined;\n  #rpcServices: RpcService[] | undefined;\n  #table?: Table;\n\n  constructor({\n    data,\n    menuRpcServices,\n    rpcServices,\n    table,\n    menu,\n    ...arrayDataSourceProps\n  }: TickingArrayDataSourceConstructorProps) {\n    if (data === undefined && table === undefined) {\n      throw Error(\"TickingArrayDataSource must be constructed with data\");\n    }\n    super({\n      ...arrayDataSourceProps,\n      data: data ?? table?.data ?? [],\n    });\n    this._menu = menu;\n    this.#menuRpcServices = menuRpcServices;\n    this.#rpcServices = rpcServices;\n    this.#table = table;\n\n    if (table) {\n      table.on(\"insert\", this.insert);\n      table.on(\"update\", this.updateRow);\n    }\n  }\n\n  async subscribe(subscribeProps: SubscribeProps, callback: SubscribeCallback) {\n    const subscription = super.subscribe(subscribeProps, callback);\n    // if (subscribeProps.range) {\n    //   this.#updateGenerator?.setRange(subscribeProps.range);\n    // }\n    return subscription;\n  }\n\n  set range(range: VuuRange) {\n    super.range = range;\n    // this.#updateGenerator?.setRange(range);\n  }\n  get range() {\n    return super.range;\n  }\n\n  private getSelectedRows() {\n    return this.selectedRows.reduce<DataSourceRow[]>(\n      (rows: DataSourceRow[], selected: SelectionItem) => {\n        if (Array.isArray(selected)) {\n          selected.forEach((sel) => {\n            const row = this.data[sel];\n            if (row) {\n              rows.push(row);\n            }\n          });\n        } else {\n          const row = this.data[selected];\n          if (row) {\n            rows.push(row);\n          }\n        }\n        return rows;\n      },\n      []\n    );\n  }\n\n  applyEdit(\n    row: DataSourceRow,\n    columnName: string,\n    value: VuuRowDataItemType\n  ): Promise<true> {\n    const key = row[metadataKeys.KEY];\n    this.#table?.update(key, columnName, value);\n    return Promise.resolve(true);\n  }\n\n  async rpcCall<T extends RpcResponse = RpcResponse>(\n    rpcRequest: Omit<ClientToServerViewportRpcCall, \"vpId\">\n  ): Promise<T | undefined> {\n    const rpcService = this.#rpcServices?.find(\n      (service) =>\n        service.rpcName ===\n        (rpcRequest as ClientToServerViewportRpcCall).rpcName\n    );\n    if (rpcService) {\n      return rpcService.service({\n        ...rpcRequest,\n      });\n    } else {\n      console.log(`no implementation for PRC service ${rpcRequest.rpcName}`);\n    }\n  }\n\n  async menuRpcCall(\n    rpcRequest: Omit<ClientToServerMenuRPC, \"vpId\"> | ClientToServerEditRpc\n  ): Promise<\n    | MenuRpcResponse\n    | VuuUIMessageInRPCEditReject\n    | VuuUIMessageInRPCEditResponse\n    | undefined\n  > {\n    const rpcService = this.#rpcServices?.find(\n      (service) =>\n        service.rpcName === (rpcRequest as ClientToServerMenuRPC).rpcName\n    );\n\n    if (rpcService) {\n      switch (rpcRequest.type) {\n        case \"VIEW_PORT_MENUS_SELECT_RPC\": {\n          const selectedRows = this.getSelectedRows();\n          return rpcService.service({\n            ...rpcRequest,\n            selectedRows,\n          });\n        }\n\n        default:\n      }\n    }\n    return super.menuRpcCall(rpcRequest);\n  }\n\n  getTypeaheadSuggestions(column: string, pattern?: string): Promise<string[]> {\n    if (this.#table) {\n      return makeSuggestions(this.#table, column, pattern);\n    } else {\n      throw Error(\n        \"cannot call getTypeaheadSuggestions on TickingDataSOurce if table has not been provided\"\n      );\n    }\n  }\n}\n", "import { ColumnDescriptor } from \"@vuu-ui/vuu-table-types\";\nimport { VuuRowDataItemType, VuuTable } from \"@vuu-ui/vuu-protocol-types\";\nimport { UpdateGenerator } from \"./rowUpdates\";\n\ntype RowAtIndexFunc<T = unknown> = (index: number) => T | undefined;\n\nexport const VuuColumnGenerator = (columnCount: number): string[] =>\n  [\"Row No\"].concat(\n    Array(columnCount)\n      .fill(\"\")\n      .map((_, i) => `Column ${i + 1}`)\n  );\n\nexport type RowGeneratorFactory<T = VuuRowDataItemType> = (\n  columns: string[]\n) => RowAtIndexFunc<T[]>;\n\nexport type ColumnGeneratorFn = (\n  columns?: number | string[],\n  columnConfig?: { [key: string]: Partial<ColumnDescriptor> }\n) => ColumnDescriptor[];\n\nexport const DefaultRowGenerator: RowGeneratorFactory<string> =\n  (columns: string[]) => (index) => {\n    return [`row ${index + 1}`].concat(\n      Array(columns.length)\n        .fill(true)\n        .map((v, j) => `value ${j + 1} @ ${index + 1}`)\n    );\n  };\n\nexport const DefaultColumnGenerator: ColumnGeneratorFn = (\n  columns,\n  columnConfig = {}\n) => {\n  if (typeof columns === \"number\") {\n    return [{ name: \"row number\", width: 150 }].concat(\n      Array(columns)\n        .fill(true)\n        .map((_, i) => {\n          const name = `column ${i + 1}`;\n          return { name, width: 100, ...columnConfig[name] };\n        })\n    );\n  } else {\n    throw Error(\"DefaultColumnGenerator must be passed columns (number)\");\n  }\n};\n\nconst defaultGenerators = {\n  ColumnGenerator: DefaultColumnGenerator,\n  RowGenerator: DefaultRowGenerator,\n};\n\nexport const getColumnAndRowGenerator = (\n  table?: VuuTable\n):\n  | [ColumnGeneratorFn, RowGeneratorFactory]\n  | [ColumnGeneratorFn, RowGeneratorFactory, () => UpdateGenerator] => {\n  const tableName = table?.table ?? \"\";\n  // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n  // @ts-ignore\n  switch (table?.module) {\n    case \"SIMUL\": {\n      const { ColumnGenerator, RowGenerator, createUpdateGenerator } =\n        // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n        // @ts-ignore\n        simulDataGenerators[tableName] ?? defaultGenerators;\n      return [ColumnGenerator, RowGenerator, createUpdateGenerator];\n    }\n\n    case \"BASKET\": {\n      const { ColumnGenerator, RowGenerator, createUpdateGenerator } =\n        // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n        // @ts-ignore\n        basketDataGenerators[tableName] ?? defaultGenerators;\n      return [ColumnGenerator, RowGenerator, createUpdateGenerator];\n    }\n    case undefined: {\n      const { ColumnGenerator, RowGenerator } = defaultGenerators;\n      return [ColumnGenerator, RowGenerator];\n    }\n    default:\n      throw Error(\n        `vuu-row-gererator table ${table?.table} was requested but no generator is registered`\n      );\n  }\n};\n\nexport const populateArray = (\n  count: number,\n  colGen: ColumnGeneratorFn,\n  rowGen: RowGeneratorFactory,\n  columns?: number | string[]\n) => {\n  const columnDescriptors = colGen(columns);\n  const generateRow = rowGen(columnDescriptors.map((col) => col.name));\n  const data: Array<VuuRowDataItemType[]> = [];\n  for (let i = 0; i < count; i++) {\n    const row = generateRow(i);\n    if (row) {\n      data[i] = row;\n    } else {\n      break;\n    }\n  }\n  return data;\n};\n", "import { SchemaColumn, TableSchema } from \"@vuu-ui/vuu-data\";\nimport { VuuRowDataItemType, VuuTable } from \"@vuu-ui/vuu-protocol-types\";\nimport { ColumnMap, EventEmitter } from \"@vuu-ui/vuu-utils\";\nimport { UpdateGenerator } from \"./rowUpdates\";\n\nexport type TableEvents = {\n  delete: (row: VuuRowDataItemType[]) => void;\n  insert: (row: VuuRowDataItemType[]) => void;\n  update: (row: VuuRowDataItemType[], columnName?: string) => void;\n};\n\nexport class Table extends EventEmitter<TableEvents> {\n  #data: VuuRowDataItemType[][];\n  #dataMap: ColumnMap;\n  #indexOfKey: number;\n  #index = new Map<string, number>();\n  #schema: TableSchema;\n\n  constructor(\n    schema: TableSchema,\n    data: VuuRowDataItemType[][],\n    dataMap: ColumnMap,\n    updateGenerator?: UpdateGenerator\n  ) {\n    super();\n    this.#data = data;\n    this.#dataMap = dataMap;\n    this.#schema = schema;\n    this.#indexOfKey = dataMap[schema.key];\n    this.buildIndex();\n    updateGenerator?.setTable(this);\n    updateGenerator?.setRange({ from: 0, to: 100 });\n  }\n\n  private buildIndex() {\n    for (let i = 0; i < this.#data.length; i++) {\n      const key = this.#data[i][this.#indexOfKey] as string;\n      this.#index.set(key, i);\n    }\n  }\n\n  get data() {\n    return this.#data;\n  }\n\n  get map() {\n    return this.#dataMap;\n  }\n\n  get schema() {\n    return this.#schema;\n  }\n\n  insert(row: VuuRowDataItemType[]) {\n    const index = this.#data.length;\n    this.#data.push(row);\n    const key = row[this.#indexOfKey] as string;\n    this.#index.set(key, index);\n    this.emit(\"insert\", row);\n  }\n\n  findByKey(key: string) {\n    const index = this.#index.get(key) ?? -1;\n    return this.#data[index];\n  }\n\n  update(key: string, columnName: string, value: VuuRowDataItemType) {\n    const rowIndex = this.#data.findIndex(\n      (row) => row[this.#indexOfKey] === key\n    );\n    const colIndex = this.#dataMap[columnName];\n    if (rowIndex !== -1) {\n      const row = this.#data[rowIndex];\n      const newRow = row.slice();\n      newRow[colIndex] = value;\n      this.#data[rowIndex] = newRow;\n      this.emit(\"update\", newRow, columnName);\n    }\n  }\n  updateRow(row: VuuRowDataItemType[]) {\n    const key = row[this.#indexOfKey];\n    const rowIndex = this.#data.findIndex(\n      (row) => row[this.#indexOfKey] === key\n    );\n    if (rowIndex !== -1) {\n      this.#data[rowIndex] = row;\n      this.emit(\"update\", row);\n    }\n  }\n}\n\nexport const buildDataColumnMap = (schema: TableSchema) =>\n  Object.values(schema.columns).reduce<ColumnMap>((map, col, index) => {\n    map[col.name] = index;\n    return map;\n  }, {});\n\nconst getServerDataType = (\n  columnName: string,\n  { columns: cols1, table: t1 }: TableSchema,\n  { columns: cols2, table: t2 }: TableSchema\n) => {\n  const col1 = cols1.find((col) => col.name === columnName);\n  const col2 = cols2.find((col) => col.name === columnName);\n  if (col1 && col2) {\n    if (col1.serverDataType === col2.serverDataType) {\n      return col1.serverDataType;\n    } else {\n      throw Error(\n        `both tables ${t1.table} and ${t2.table} implement column ${columnName}, but with types differ`\n      );\n    }\n  } else if (col1) {\n    return col1.serverDataType;\n  } else if (col2) {\n    return col2.serverDataType;\n  } else {\n    throw Error(`WTF how is this possible`);\n  }\n};\n\n// Just copies source tables, then registers update listeners.\n// Not terribly efficient, but good enough for showcase\nexport const joinTables = (\n  joinTable: VuuTable,\n  table1: Table,\n  table2: Table,\n  joinColumn: string\n) => {\n  const { map: m1, schema: schema1 } = table1;\n  const { map: m2, schema: schema2 } = table2;\n  const k1 = m1[joinColumn];\n  const k2 = m2[joinColumn];\n\n  const combinedColumns = new Set(\n    [...schema1.columns, ...schema2.columns].map((col) => col.name).sort()\n  );\n\n  const combinedSchema: TableSchema = {\n    key: joinColumn,\n    table: joinTable,\n    columns: Array.from(combinedColumns).map<SchemaColumn>((columnName) => ({\n      name: columnName,\n      serverDataType: getServerDataType(columnName, schema1, schema2),\n    })),\n  };\n\n  const data: VuuRowDataItemType[][] = [];\n  const combinedColumnMap = buildDataColumnMap(combinedSchema);\n  // const start = performance.now();\n  for (const row of table1.data) {\n    const row2 = table2.findByKey(String(row[k1]));\n    if (row2) {\n      const out = [];\n      for (const column of table1.schema.columns) {\n        const value = row[m1[column.name]];\n        out[combinedColumnMap[column.name]] = value;\n      }\n      for (const column of table2.schema.columns) {\n        const value = row2[m2[column.name]];\n        out[combinedColumnMap[column.name]] = value;\n      }\n\n      data.push(out);\n    }\n  }\n  // const end = performance.now();\n  // console.log(`took ${end - start} ms to create join table ${joinTable.table}`);\n\n  const newTable = new Table(combinedSchema, data, combinedColumnMap);\n\n  table1.on(\"insert\", (row) => {\n    const row2 = table2.findByKey(String(row[k1]));\n    if (row2) {\n      const out = [];\n      for (const column of table1.schema.columns) {\n        const value = row[m1[column.name]];\n        out[combinedColumnMap[column.name]] = value;\n      }\n      for (const column of table2.schema.columns) {\n        const value = row2[m2[column.name]];\n        out[combinedColumnMap[column.name]] = value;\n      }\n      newTable.insert(out);\n    }\n  });\n\n  table2.on(\"update\", (row) => {\n    const keyValue = row[k2] as string;\n    const targetRow = newTable.findByKey(keyValue);\n    if (targetRow) {\n      const updatedRow = targetRow.slice();\n      for (const { name } of table2.schema.columns) {\n        if (row[m2[name]] !== updatedRow[combinedColumnMap[name]]) {\n          updatedRow[combinedColumnMap[name]] = row[m2[name]];\n        }\n      }\n      newTable.updateRow(updatedRow);\n    }\n  });\n\n  return newTable;\n};\n", "export function random(min: number, max: number) {\n  min = Math.ceil(min);\n  max = Math.floor(max);\n  return Math.floor(Math.random() * (max - min + 1)) + min;\n}\n\nexport function randomPercentage(value: number) {\n  const dec = random(2, 99);\n  const percentage = dec / 100;\n  return value * percentage;\n}\nexport type PriceGenerator = (min: number, max: number) => number;\n\nexport const nextRandomDouble: PriceGenerator = (min, max) =>\n  min + (max - min) * Math.random();\n\nexport const initBidAsk = (\n  priceMaxDelta: number,\n  nextRandomDouble: PriceGenerator\n) => {\n  const mid = nextRandomDouble(0, 1000);\n  const tempBid = nextRandomDouble(mid - priceMaxDelta, mid - 1);\n  const ask = nextRandomDouble(mid + 1, mid + priceMaxDelta);\n  const bid = tempBid < 0 ? mid : tempBid;\n  const newBid = Math.round(bid * 100) / 100.0;\n  const newAsk = Math.round(ask * 100) / 100.0;\n  return [newBid, newAsk];\n};\n\nconst maxAsk = (\n  bid: number,\n  ask: number,\n  spreadMultipler: number,\n  priceMaxDelta: number\n) => {\n  const spread = ask - bid;\n  return Math.min(\n    ask + spreadMultipler * spread,\n    spread / 2 + bid + priceMaxDelta\n  );\n};\n\nconst minAsk = (\n  bid: number,\n  ask: number,\n  spreadMultipler: number,\n  priceMaxDelta: number\n) => {\n  return Math.max(bid + 1, (ask - bid) / 2 + bid);\n};\n\nconst maxBid = (\n  bid: number,\n  ask: number,\n  spreadMultipler: number,\n  priceMaxDelta: number\n) => {\n  const result = Math.min(ask - 1, (ask - bid) / 2 + bid);\n  return result < 1 ? bid + 1 : result;\n};\n\nconst minBid = (\n  bid: number,\n  ask: number,\n  spreadMultipler: number,\n  priceMaxDelta: number\n) => {\n  const spread = ask - bid;\n  const mid = spread / 2 + bid;\n  const result = Math.max(\n    bid - Math.min(spreadMultipler * spread, 10),\n    mid - priceMaxDelta\n  );\n  return result < 0 ? bid : result;\n};\n\nexport const generateNextBidAsk = (\n  bid: number,\n  ask: number,\n  spreadMultipler: number,\n  priceMaxDelta: number,\n  nextRandomDouble: PriceGenerator\n) => {\n  let tempAsk = ask;\n  if (Math.abs(bid - ask) <= 1) tempAsk = ask + 1;\n  const minBidValue = minBid(bid, tempAsk, spreadMultipler, priceMaxDelta);\n  const maxBidValue = maxBid(bid, tempAsk, spreadMultipler, priceMaxDelta);\n  const minAskValue = minAsk(bid, tempAsk, spreadMultipler, priceMaxDelta);\n  const maxAskValue = maxAsk(bid, tempAsk, spreadMultipler, priceMaxDelta);\n  const newBid =\n    Math.round(nextRandomDouble(minBidValue, maxBidValue) * 100) / 100.0;\n  const newAsk =\n    Math.round(nextRandomDouble(minAskValue, maxAskValue) * 100) / 100.0;\n  return [newBid, newAsk];\n};\n", "import { VuuRange } from \"@vuu-ui/vuu-protocol-types\";\nimport { generateNextBidAsk, nextRandomDouble, random } from \"./data-utils\";\nimport type { UpdateGenerator } from \"./rowUpdates\";\nimport { Table } from \"./Table\";\n\nconst getNewValue = (value: number) => {\n  const multiplier = random(0, 100) / 1000;\n  const direction = random(0, 10) >= 5 ? 1 : -1;\n  return value + value * multiplier * direction;\n};\n\nexport class BaseUpdateGenerator implements UpdateGenerator {\n  private table: Table | undefined;\n  private range: VuuRange | undefined;\n  private updating = false;\n  private timer: number | undefined;\n  private tickingColumns: { [key: string]: number };\n\n  constructor(tickingColumns: { [key: string]: number }) {\n    this.tickingColumns = tickingColumns;\n  }\n\n  setRange(range: VuuRange) {\n    this.range = range;\n    if (!this.updating && this.table) {\n      this.startUpdating();\n    }\n  }\n\n  setTable(table: Table) {\n    this.table = table;\n  }\n\n  private startUpdating() {\n    this.updating = true;\n    this.update();\n  }\n\n  private stopUpdating() {\n    this.updating = false;\n    if (this.timer) {\n      window.clearTimeout(this.timer);\n      this.timer = undefined;\n    }\n  }\n\n  update = () => {\n    if (this.range && this.table) {\n      const data = this.table?.data;\n      const { bid, ask, last, ...rest } = this.tickingColumns;\n      if (data && data?.length > 0) {\n        const maxRange = Math.min(this.range.to, data.length);\n        for (let rowIndex = this.range.from; rowIndex < maxRange; rowIndex++) {\n          let updateCount = 0;\n          const shallUpdateRow = random(0, 10) < 2;\n          if (shallUpdateRow) {\n            // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n            // @ts-ignore\n            const rowUpdates = this.table.data[rowIndex];\n            const row = data[rowIndex];\n\n            if (bid !== undefined && ask !== undefined) {\n              const { [bid]: currentBid, [ask]: currentAsk } = row as number[];\n              const [newBid, newAsk] = generateNextBidAsk(\n                currentBid,\n                currentAsk,\n                10,\n                5,\n                nextRandomDouble\n              );\n              rowUpdates[ask] = newAsk;\n              rowUpdates[bid] = newBid;\n              if (last !== undefined) {\n                const newLast =\n                  Math.round((currentAsk + (newAsk - currentAsk) / 2) * 100) /\n                  100.0;\n                rowUpdates[last] = newLast;\n              }\n            }\n\n            for (const colIdx of Object.values(rest)) {\n              const shallUpdateColumn = random(0, 10) < 5;\n              if (shallUpdateColumn) {\n                updateCount += 1;\n                const newValue = getNewValue(row[colIdx] as number);\n                if (this.table) {\n                  rowUpdates[colIdx] = newValue;\n                }\n              }\n            }\n            if (this.table && updateCount > 0) {\n              this.table.updateRow(rowUpdates);\n            }\n          }\n        }\n      }\n    }\n\n    if (this.updating) {\n      this.timer = window.setTimeout(this.update, 500);\n    }\n  };\n}\n", "// Symbol,Name,Last Trade,Change,Volume\n// prettier-ignore\nexport default [\n    [\"AAL.L\",\"Anglo American  PLC\",\"436.35 13:13\",\"5.35 (1.24%)\",\"5,799,089\"],\n    [\"ABF.L\",\"Associated British Foods  PLC\",\"3,435.60 13:12\",\"7.40 (0.21%)\",\"86,808\"],\n    [\"ADM.L\",\"Admiral Group  PLC\",\"1,627.00 13:13\",\"\"],\n    [\"ADN.L\",\"Aberdeen Asset Management  PLC\",\"334.00 13:13\",\"2.50 (0.75%)\",\"806,880\"],\n    [\"AHT.L\",\"Ashtead Group  PLC\",\"1,027.00 13:13\",\"6.00 (0.59%)\",\"331,255\"],\n    [\"ANTO.L\",\"Antofagasta  PLC\",\"484.10 13:13\",\"11.70 (2.48%)\",\"1,753,976\"],\n    [\"ARM.L\",\"ARM Holdings  PLC\",\"1,058.00 13:13\",\"3.00 (0.28%)\",\"475,927\"],\n    [\"AV.L\",\"Aviva  PLC\",\"493.97 13:13\",\"2.23 (0.45%)\",\"2,226,835\"],\n    [\"AZN.L\",\"AstraZeneca  PLC\",\"4,399.50 13:13\",\"2.50 (0.06%)\",\"815,133\"],\n    [\"BA.L\",\"BAE Systems  PLC\",\"478.10 13:13\",\"4.30 (0.91%)\",\"2,039,934\"],\n    [\"BAB.L\",\"Babcock International Group  PLC\",\"988.00 13:13\",\"9.50 (0.97%)\",\"209,614\"],\n    [\"BARC.L\",\"Barclays  PLC\",\"226.30 13:13\", \"1.15 (0.51%)\",\"6,575,664\"],\n    [\"BATS.L\",\"British American Tobacco  PLC\",\"3,803.50 13:13\", \"8.50 (0.22%)\",\"465,110\"],\n    [\"BDEV.L\",\"Barratt Developments  PLC\",\"576.00 13:13\", \"0.50 (0.09%)\",\"1,044,365\"],\n    [\"BG.L\",\"BG Group  PLC\",\"1,013.50 13:13\", \"5.50 (0.55%)\",\"1,507,332\"],\n    [\"BKG.L\",\"Berkeley Group Holdings (The)  PLC\",\"3,126.00 13:13\", \"15.00 (0.48%)\",\"95,071\"],\n    [\"BLND.L\",\"British Land Co  PLC\",\"828.06 13:12\", \"10.44 (1.25%)\",\"1,802,548\"],\n    [\"BLT.L\",\"BHP Billiton  PLC\",\"881.40 13:13\", \"4.30 (0.49%)\",\"4,947,287\"],\n    [\"BNZL.L\",\"Bunzl  PLC\",\"1,875.40 13:05\", \"4.60 (0.24%)\",\"104,541\"],\n    [\"BP.L\",\"BP  PLC\",\"381.50 13:13\", \"2.95 (0.78%)\",\"10,493,561\"],\n    [\"BRBY.L\",\"Burberry Group  PLC\",\"1,269.00 13:13\", \"7.00 (0.55%)\",\"295,647\"],\n    [\"BT-A\",\"L,BT Group  PLC\",\"489.20 13:13\", \"3.70 (0.75%)\",\"3,914,982\"],\n    [\"CCL.L\",\"Carnival  PLC\",\"3,426.00 13:12\", \"22.00 (0.64%)\",\"86,257\"],\n    [\"CNA.L\",\"Centrica  PLC\",\"212.80 13:13\", \"0.60 (0.28%)\",\"2,144,540\"],\n    [\"CPG.L\",\"Compass Group  PLC\",\"1,054.00 13:08\", \"5.00 (0.48%)\",\"1,001,167\"],\n    [\"CPI.L\",\"Capita  PLC\",\"1,235.00 13:11\", \"1.00 (0.08%)\",\"244,591\"],\n    [\"CRH.L\",\"CRH  PLC\",\"1,783.20 13:12\", \"17.80 (0.99%)\",\"897,325\"],\n    [\"DC.L\",\"DIXONS CARPHONE\",\"462.10 13:11\",\"\"],\n    [\"DGE.L\",\"Diageo  PLC\",\"1,881.50 13:13\", \"6.50 (0.34%)\",\"756,906\"],\n    [\"DLG.L\",\"Direct Line Insurance Group  PLC\",\"403.80 13:13\", \"0.40 (0.10%)\",\"1,095,340\"],\n    [\"EXPN.L\",\"Experian  PLC\",\"1,191.00 13:12\", \"2.00 (0.17%)\",\"467,283\"],\n    [\"EZJ.L\",\"easyJet  PLC\",\"1,682.00 13:12\", \"28.00 (1.64%)\",\"1,191,230\"],\n    [\"FRES.L\",\"Fresnillo  PLC\",\"678.50 13:12\", \"6.50 (0.97%)\",\"381,871\"],\n    [\"GFS.L\",\"G4S  PLC\",\"232.30 13:03\", \"2.00 (0.85%)\",\"1,096,551\"],\n    [\"GKN.L\",\"GKN  PLC\",\"294.80 13:12\", \"2.50 (0.86%)\",\"792,247\"],\n    [\"GLEN.L\",\"Glencore  PLC\",\"90.48 13:13\", \"1.65 (1.86%)\",\"41,631,528\"],\n    [\"GSK.L\",\"GlaxoSmithKline  PLC\",\"1,345.00 13:13\", \"0.50 (0.04%)\",\"1,767,356\"],\n    [\"HIK.L\",\"Hikma Pharmaceuticals  PLC\",\"2,010.00 13:04\", \"57.00 (2.92%)\",\"261,511\"],\n    [\"HL.L\",\"Hargreaves Lansdown  PLC\",\"1,488.03 13:12\", \"9.97 (0.67%)\",\"372,261\"],\n    [\"HMSO.L\",\"Hammerson  PLC\",\"597.50 13:11\", \"3.50 (0.58%)\",\"478,301\"],\n    [\"HSBA.L\",\"HSBC Holdings  PLC\",\"519.70 13:13\", \"0.50 (0.10%)\",\"7,415,629\"],\n    [\"IAG.L\",\"International Consolidated Airlines Group SA\",\"575.40 13:12\", \"16.10 (2.72%)\",\"4,311,514\"],\n    [\"IHG.L\",\"InterContinental Hotels Group  PLC\",\"2,481.00 13:12\", \"19.00 (0.76%)\",\"219,918\"],\n    [\"III.L\",\"3i Group  PLC\",\"487.30 13:11\", \"4.50 (0.92%)\",\"189,987\"],\n    [\"IMT.L\",\"Imperial Tobacco Group  PLC\",\"3,571.00 13:13\", \"29.00 (0.81%)\",\"926,816\"],\n    [\"INTU.L\",\"intu properties  PLC\",\"319.90 13:09\", \"4.60 (1.42%)\",\"514,821\"],\n    [\"ISAT.L\",\"Inmarsat  PLC\",\"1,054.44 13:13\", \"3.44 (0.33%)\",\"988,089\"],\n    [\"ITRK.L\",\"Intertek Group  PLC\",\"2,643.00 13:14\", \"3.00 (0.11%)\",\"45,868\"],\n    [\"ITV.L\",\"ITV  PLC\",\"267.30 13:14\", \"2.60 (0.96%)\",\"3,453,208\"],\n    [\"JMAT.L\",\"Johnson Matthey  PLC\",\"2,445.00 13:14\", \"29.00 (1.20%)\",\"276,397\"],\n    [\"KGF.L\",\"Kingfisher  PLC\",\"346.20 13:14\", \"4.30 (1.23%)\",\"1,021,408\"],\n    [\"LAND.L\",\"Land Securities Group  PLC\",\"1,239.00 13:13\", \"7.00 (0.56%)\",\"384,973\"],\n    [\"LGEN.L\",\"Legal & General Group  PLC\",\"266.00 13:14\", \"1.60 (0.60%)\",\"1,998,399\"],\n    [\"LLOY.L\",\"Lloyds Banking Group  PLC\",\"73.86 13:14\", \"0.02 (0.03%)\",\"18,907,878\"],\n    [\"LSE.L\",\"London Stock Exchange Group  PLC\",\"2,544.00 13:11\", \"6.00 (0.24%)\",\"129,657\"],\n    [\"MGGT.L\",\"Meggitt  PLC\",\"386.00 13:15\", \"3.20 (0.84%)\",\"611,044\"],\n    [\"MKS.L\",\"Marks & Spencer Group  PLC\",\"514.75 13:12\", \"3.25 (0.63%)\",\"920,128\"],\n    [\"MNDI.L\",\"Mondi  PLC\",\"1,463.00 13:14\", \"7.00 (0.48%)\",\"383,546\"],\n    [\"MRW.L\",\"Morrison (Wm) Supermarkets  PLC\",\"155.20 13:14\",\"\"],\n    [\"NG.L\",\"National Grid  PLC\",\"926.40 13:14\", \"1.10 (0.12%)\",\"1,659,592\"],\n    [\"NXT.L\",\"Next  PLC\",\"7,765.00 13:11\", \"95.00 (1.21%)\",\"114,062\"],\n    [\"OML.L\",\"Old Mutual  PLC\",\"198.50 13:14\", \"0.40 (0.20%)\",\"2,040,849\"],\n    [\"PRU.L\",\"Prudential  PLC\",\"1,499.50 13:15\", \"14.00 (0.93%)\",\"580,870\"],\n    [\"PSON.L\",\"Pearson  PLC\",\"794.00 13:09\", \"5.00 (0.63%)\",\"1,177,953\"],\n    [\"RB.L\",\"Reckitt Benckiser Group  PLC\",\"6,293.00 13:14\", \"34.00 (0.54%)\",\"281,172\"],\n    [\"RBS.L\",\"Royal Bank of Scotland Group  PLC\",\"313.40 13:14\", \"2.40 (0.77%)\",\"2,100,058\"],\n    [\"RDSA.L\",\"Royal Dutch Shell  PLC\",\"1,636.00 13:14\", \"18.00 (1.11%)\",\"2,467,461\"],\n    [\"RDSB.L\",\"Royal Dutch Shell  PLC\",\"1,652.00 13:15\", \"14.50 (0.89%)\",\"1,457,434\"],\n    [\"REL.L\",\"Reed Elsevier  PLC\",\"1,170.00 13:14\",\"0.00 (0.00%)\",\"908,802\"],\n    [\"RIO.L\",\"Rio Tinto  PLC\",\"2,235.00 13:15\", \"21.00 (0.95%)\",\"2,190,722\"],\n    [\"RMG.L\",\"Royal Mail  PLC\",\"453.50 13:14\", \"1.20 (0.26%)\",\"995,316\"],\n    [\"RR.L\",\"Rolls-Royce Group  PLC\",\"546.63 13:14\", \"8.38 (1.51%)\",\"2,792,915\"],\n    [\"RRS.L\",\"Randgold Resources Ltd\",\"3,929.00 13:14\",\"0.00 (0.00%)\",\"135,524\"],\n    [\"RSA.L\",\"RSA Insurance Group  PLC\",\"437.10 13:14\", \"0.10 (0.02%)\",\"395,477\"],\n    [\"SAB.L\",\"SABMiller  PLC\",\"4,011.00 13:15\", \"1.00 (0.02%)\",\"892,451\"],\n    [\"SBRY.L\",\"Sainsbury (J)  PLC\",\"255.80 13:14\", \"7.40 (2.98%)\",\"2,395,670\"],\n    [\"SDR.L\",\"Schroders  PLC\",\"2,930.00 13:09\", \"12.00 (0.41%)\",\"44,674\"],\n    [\"SGE.L\",\"Sage Group (The)  PLC\",\"545.50 13:13\", \"0.50 (0.09%)\",\"539,717\"],\n    [\"SHP.L\",\"Shire  PLC\",\"4,685.00 13:14\", \"22.00 (0.47%)\",\"221,318\"],\n    [\"SKY.L\",\"SKY\",\"1,095.00 13:12\", \"4.00 (0.37%)\",\"925,016\"],\n    [\"SL.L\",\"Standard Life  PLC\",\"399.90 13:14\", \"3.20 (0.79%)\",\"861,636\"],\n    [\"SMIN.L\",\"Smiths Group  PLC\",\"992.50 13:14\", \"27.50 (2.70%)\",\"640,309\"],\n    [\"SN.L\",\"Smith & Nephew  PLC\",\"1,110.00 13:14\", \"9.00 (0.82%)\",\"480,018\"],\n    [\"SPD.L\",\"Sports Direct International  PLC\",\"694.50 13:11\", \"1.50 (0.22%)\",\"157,981\"],\n    [\"SSE.L\",\"SSE  PLC\",\"1,463.00 13:13\", \"2.00 (0.14%)\",\"562,454\"],\n    [\"STAN.L\",\"Standard Chartered  PLC\",\"583.00 13:14\", \"0.60 (0.10%)\",\"2,018,697\"],\n    [\"STJ.L\",\"St James's Place  PLC\",\"964.00 13:14\", \"11.00 (1.13%)\",\"418,480\"],\n    [\"SVT.L\",\"Severn Trent  PLC\",\"2,199.00 13:12\", \"1.00 (0.05%)\",\"95,342\"],\n    [\"TPK.L\",\"Travis Perkins  PLC\",\"1,945.00 13:13\", \"4.00 (0.21%)\",\"92,916\"],\n    [\"TSCO.L\",\"Tesco  PLC\",\"171.54 13:14\", \"2.54 (1.50%)\",\"9,831,136\"],\n    [\"TUI.L\",\"TUI AG\",\"1,115.00 13:10\", \"5.00 (0.45%)\",\"458,970\"],\n    [\"TW.L\",\"Taylor Wimpey  PLC\",\"183.90 13:15\", \"1.10 (0.59%)\",\"3,180,729\"],\n    [\"ULVR.L\",\"Unilever  PLC\",\"2,791.00 13:14\", \"29.00 (1.03%)\",\"824,827\"],\n    [\"UU.L\",\"United Utilities Group  PLC\",\"959.00 13:10\", \"2.50 (0.26%)\",\"436,911\"],\n    [\"VOD.L\",\"Vodafone Group  PLC\",\"224.25 13:15\", \"1.30 (0.58%)\",\"17,572,036\"],\n    [\"WOS.L\",\"Wolseley  PLC\",\"3,657.00 13:14\", \"4.00 (0.11%)\",\"179,536\"],\n    [\"WPP.L\",\"WPP  PLC\",\"1,502.00 13:15\", \"12.00 (0.79%)\",\"857,887\"],\n    [\"WTB.L\",\"Whitbread  PLC\",\"4,484.00 13:16\", \"60.00 (1.32%)\",\"141,036\"]\n]\n", "//Name,Symbol,Weight,Last Trade,Chg,% Chg\n// prettier-ignore\nexport default [\n  [\"Apple Inc\", \"AAPL\", 11.007,174.94,0.15, \"(0.09%)\"],\n  [\"Microsoft Corp\", \"MSFT\", 9.61,316.98,-0.03, \"(-0.01%)\"],\n  [\"Amazon.com Inc\", \"AMZN\", 5.401,129.31,0.19, \"(0.14%)\"],\n  [\"NVIDIA Corp\", \"NVDA\", 4.101,415.74,-0.36, \"(-0.09%)\"],\n  [\"Meta Platforms Inc\", \"META\", 3.729,299.42,0.34, \"(0.11%)\"],\n  [\"Tesla Inc\", \"TSLA\", 3.285,244.13,-0.75, \"(-0.31%)\"],\n  [\"Alphabet Inc\", \"GOOGL\", 3.133,130.49,0.24, \"(0.18%)\"],\n  [\"Alphabet Inc\", \"GOOG\", 3.085,131.49,0.24, \"(0.18%)\"],\n  [\"Broadcom Inc\", \"AVGO\", 2.896,833.04,3.96, \"(0.48%)\"],\n  [\"Costco Wholesale Corp\", \"COST\", 2.137,557.85,-0.74, \"(-0.13%)\"],\n  [\"PepsiCo Inc\", \"PEP\", 2.096,174.84,-0.43, \"(-0.25%)\"],\n  [\"Adobe Inc\", \"ADBE\", 2.033,511.42,-1.48, \"(-0.29%)\"],\n  [\"Cisco Systems Inc\", \"CSCO\", 1.887,53.68,0.11, \"(0.20%)\"],\n  [\"Comcast Corp\", \"CMCSA\", 1.633,45.30,-0.01, \"(-0.01%)\"],\n  [\"Netflix Inc\", \"NFLX\", 1.478,379.89,0.08, \"(0.02%)\"],\n  [\"T-Mobile US Inc\", \"TMUS\", 1.43,140.18,0.83, \"(0.60%)\"],\n  [\"Advanced Micro Devices Inc\", \"AMD\", 1.348,96.09,-0.11, \"(-0.12%)\"],\n  [\"Texas Instruments Inc\", \"TXN\", 1.264,161.00,0.69, \"(0.43%)\"],\n  [\"Intel Corp\", \"INTC\", 1.26,34.19,0.01, \"(0.01%)\"],\n  [\"Amgen Inc\", \"AMGN\", 1.251,271.18,3.48, \"(1.30%)\"],\n  [\"Intuit Inc\", \"INTU\", 1.226,509.00,0.43, \"(0.08%)\"],\n  [\"Honeywell International Inc\", \"HON\", 1.103,188.67,-1.12, \"(-0.59%)\"],\n  [\"QUALCOMM Inc\", \"QCOM\", 1.046,107.53,-0.16, \"(-0.14%)\"],\n  [\"Applied Materials Inc\", \"AMAT\", 0.982,136.32,0.15, \"(0.11%)\"],\n  [\"Booking Holdings Inc\", \"BKNG\", 0.941,3, 19.20,-43.30, \"(-1.42%)\"],\n  [\"Starbucks Corp\", \"SBUX\", 0.926,93.80,0.12, \"(0.12%)\"],\n  [\"Intuitive Surgical Inc\", \"ISRG\", 0.867,288.50,0.30, \"(0.10%)\"],\n  [\"Automatic Data Processing Inc\", \"ADP\", 0.854,239.45,0.10, \"(0.04%)\"],\n  [\"Mondelez International Inc\", \"MDLZ\", 0.835,71.25,0.82, \"(1.16%)\"],\n  [\"Gilead Sciences Inc\", \"GILD\", 0.814,75.47,0.46, \"(0.61%)\"],\n  [\"Vertex Pharmaceuticals Inc\", \"VRTX\", 0.794,353.67,4.14, \"(1.18%)\"],\n  [\"Regeneron Pharmaceuticals Inc\", \"REGN\", 0.763,828.09,3.25, \"(0.39%)\"],\n  [\"Analog Devices Inc\", \"ADI\", 0.752,176.82,1.34, \"(0.76%)\"],\n  [\"Lam Research Corp\", \"LRCX\", 0.702,620.00,0.89, \"(0.14%)\"],\n  [\"Micron Technology Inc\", \"MU\", 0.646,68.90,0.02, \"(0.03%)\"],\n  [\"Palo Alto Networks Inc\", \"PANW\", 0.604,228.70,0.19, \"(0.08%)\"],\n  [\"Synopsys Inc\", \"SNPS\", 0.587,447.12,0.27, \"(0.06%)\"],\n  [\"Charter Communications Inc\", \"CHTR\", 0.581,441.88,-3.33, \"(-0.75%)\"],\n  [\"MercadoLibre Inc\", \"MELI\", 0.562,1,275.50,-1.47, \"(-0.11%)\"],\n  [\"PayPal Holdings Inc\", \"PYPL\", 0.559,57.90,0.02, \"(0.03%)\"],\n  [\"CSX Corp\", \"CSX\", 0.54,31.23,0.03, \"(0.09%)\"],\n  [\"Cadence Design Systems Inc\", \"CDNS\", 0.539,230.83,0.17, \"(0.07%)\"],\n  [\"KLA Corp\", \"KLAC\", 0.53,456.11,4.29, \"(0.95%)\"],\n  [\"PDD Holdings Inc ADR\", \"PDD\", 0.521,95.93,-0.01, \"(-0.01%)\"],\n  [\"Marriott International Inc/MD\", \"MAR\", 0.505,193.90,-0.46, \"(-0.23%)\"],\n  [\"Monster Beverage Corp\", \"MNST\", 0.498,54.48,-0.04, \"(-0.08%)\"],\n  [\"Airbnb Inc\", \"ABNB\", 0.491,132.09,-0.11, \"(-0.08%)\"],\n  [\"O'Reilly Automotive Inc\", \"ORLY\", 0.485,936.67,0.65, \"(0.07%)\"],\n  [\"Cintas Corp\", \"CTAS\", 0.446,505.27,0.52, \"(0.10%)\"],\n  [\"ASML Holding NV\", \"ASML\", 0.438,585.00,-2.10, \"(-0.36%)\"],\n  [\"NXP Semiconductors NV\", \"NXPI\", 0.434,196.76,-0.04, \"(-0.02%)\"],\n  [\"Workday Inc\", \"WDAY\", 0.414,235.55,4.73, \"(2.05%)\"],\n  [\"Lululemon Athletica Inc\", \"LULU\", 0.405,386.36,-1.69, \"(-0.44%)\"],\n  [\"Keurig Dr Pepper Inc,KDP\", 0.404,33.25,0.13, \"(0.39%)\"],\n  [\"Fortinet Inc\", \"FTNT\", 0.401,58.29,0.05, \"(0.09%)\"],\n  [\"Marvell Technology Inc\", \"MRVL\", 0.388,52.38,0.08, \"(0.14%)\"],\n  [\"PACCAR Inc\", \"PCAR\", 0.38,84.97,0.04, \"(0.04%)\"],\n  [\"Old Dominion Freight Line Inc\", \"ODFL\", 0.38,401.01,0.35, \"(0.09%)\"],\n  [\"Autodesk Inc\", \"ADSK\", 0.379,204.07,0.03, \"(0.01%)\"],\n  [\"Kraft Heinz Co/The\", \"KHC\", 0.368,34.27,0.11, \"(0.31%)\"],\n  [\"Microchip Technology Inc\", \"MCHP\", 0.36,77.00,-0.08, \"(-0.10%)\"],\n  [\"Copart Inc\", \"CPRT\", 0.358,43.26,0.10, \"(0.22%)\"],\n  [\"American Electric Power Co Inc\", \"AEP\", 0.357,79.23,0.06, \"(0.08%)\"],\n  [\"Paychex Inc\", \"PAYX\", 0.355,113.01,0.06, \"(0.06%)\"],\n  [\"Exelon Corp\", \"EXC\", 0.35,40.28,0.07, \"(0.16%)\"],\n  [\"ON Semiconductor Corp\", \"ON\", 0.341,93.87,0.06, \"(0.06%)\"],\n  [\"AstraZeneca PLC ADR\", \"AZN\", 0.339,67.35,-0.49, \"(-0.72%)\"],\n  [\"Seagen Inc\", \"SGEN\", 0.336,212.18,-1.52, \"(-0.71%)\"],\n  [\"Ross Stores Inc\", \"ROST\", 0.335,111.71,0.05, \"(0.04%)\"],\n  [\"Moderna Inc\", \"MRNA\", 0.331,100.32,0.33, \"(0.33%)\"],\n  [\"Biogen Inc\", \"BIIB\", 0.326,257.93,0.25, \"(0.10%)\"],\n  [\"Crowdstrike Holdings Inc\", \"CRWD\", 0.319,162.85,0.28, \"(0.17%)\"],\n  [\"IDEXX Laboratories Inc\", \"IDXX\", 0.316,439.41,3.72, \"(0.85%)\"],\n  [\"Baker Hughes Co\", \"BKR\", 0.307,35.44,0.04, \"(0.10%)\"],\n  [\"Constellation Energy Corp\", \"CEG\",0.307,110.41,0.05, \"(0.04%)\"],\n  [\"Cognizant Technology Solutions Corp\",\"CTSH\",0.303,70.19,0.58,\"(0.83%)\"],\n  [\"Verisk Analytics Inc\", \"VRSK\", 0.303,242.05,0.10, \"(0.04%)\"],\n  [\"Dexcom Inc\", \"DXCM\", 0.3,88.30,0.80, \"(0.92%)\"],\n  [\"Trade Desk Inc/The\", \"TTD\", 0.293,76.38,0.03, \"(0.03%)\"],\n  [\"Xcel Energy Inc\", \"XEL\", 0.284,59.76,0.03, \"(0.04%)\"],\n  [\"Electronic Arts Inc\", \"EA\", 0.279,118.38,-0.63, \"(-0.53%)\"],\n  [\"CoStar Group Inc\", \"CSGP\", 0.277,78.18,0.12, \"(0.15%)\"],\n  [\"GLOBALFOUNDRIES Inc\", \"GFS\", 0.273,57.21,0.38, \"(0.67%)\"],\n  [\"Fastenal Co\", \"FAST\", 0.268,54.32,0.11, \"(0.20%)\"],\n  [\"Atlassian Corp\", \"TEAM\", 0.253,196.01,0.55, \"(0.28%)\"],\n  [\"GE HealthCare Technologies Inc\", \"GEHC\", 0.252,63.78,-0.56, \"(-0.86%)\"],\n  [\"Warner Bros Discovery Inc\", \"WBD\", 0.244,11.09,-0.02, \"(-0.14%)\"],\n  [\"Diamondback Energy Inc\", \"FANG\", 0.235,150.70,0.13, \"(0.09%)\"],\n  [\"Datadog Inc\", \"DDOG\", 0.23,88.81,0.05, \"(0.06%)\"],\n  [\"ANSYS Inc\", \"ANSS\", 0.227,300.60,-2.31, \"(-0.76%)\"],\n  [\"eBay Inc\", \"EBAY\", 0.203,43.22,0.09, \"(0.20%)\"],\n  [\"Dollar Tree Inc\", \"DLTR\", 0.201,104.77,0.27, \"(0.25%)\"],\n  [\"Align Technology Inc\", \"ALGN\", 0.2,297.25,-1.31, \"(-0.44%)\"],\n  [\"Zscaler Inc\", \"ZS\", 0.188,151.80,0.09, \"(0.06%)\"],\n  [\"Illumina Inc\", \"ILMN\", 0.183,132.31,-0.13, \"(-0.10%)\"],\n  [\"Walgreens Boots Alliance Inc\", \"WBA\", 0.161,21.18,0.06, \"(0.28%)\"],\n  [\"Zoom Video Communications Inc\", \"ZM\", 0.151,68.57,-0.29, \"(-0.41%)\"],\n  [\"Enphase Energy Inc\", \"ENPH\", 0.148,120.41,0.49, \"(0.41%)\"],\n  [\"Sirius XM Holdings Inc\", \"SIRI\", 0.137,4.05,0.02, \"(0.50%)\"],\n  [\"JD.com Inc ADR\", \"JD\", 0.117,30.43,0.02, \"(0.05%)\"],\n  [\"Lucid Group Inc\", \"LCID\", 0.102,5.14,0.03, \"(0.49%)\"],\n];\n", "//Name,Symbol,Weight,Price,Change,Change %\nexport default [\n  [\"Apple Inc\", \"AAPL\", 6.992488, 171.9, 1.47, \"(0.86%)\"],\n  [\"Microsoft Corp\", \"MSFT\", 6.487978, 314.55, 1.76, \"(0.56%)\"],\n  [\"Amazon.com Inc\", \"AMZN\", 3.193379, 126.25, 0.27, \"(0.22%)\"],\n  [\"Nvidia Corp\", \"NVDA\", 2.928461, 433.11, 8.43, \"(1.99%)\"],\n  [\"Alphabet Inc Cl A\", \"GOOGL\", 2.162218, 132.93, 2.39, \"(1.83%)\"],\n  [\"Tesla Inc\", \"TSLA\", 1.854311, 246.56, 6.06, \"(2.52%)\"],\n  [\"Alphabet Inc Cl C\", \"GOOG\", 1.85251, 133.81, 2.35, \"(1.78%)\"],\n  [\"Meta Platforms Inc Class A\", \"META\", 1.847731, 305.93, 8.19, \"(2.75%)\"],\n  [\"Berkshire Hathaway Inc Cl B\", \"BRK.B\", 1.82184, 358.67, 0.89, \"(0.25%)\"],\n  [\"Exxon Mobil Corp\", \"XOM\", 1.343563, 118.97, -1.23, \"(-1.03%)\"],\n  [\"Unitedhealth Group Inc\", \"UNH\", 1.302884, 510.04, 6.31, \"(1.25%)\"],\n  [\"Eli Lilly & Co\", \"LLY\", 1.224046, 546.65, -3.11, \"(-0.57%)\"],\n  [\"Jpmorgan Chase & Co\", \"JPM\", 1.182918, 148.23, 2.45, \"(1.68%)\"],\n  [\"Johnson & Johnson W/d\", \"JNJ\", 1.056344, 156.83, -0.28, \"(-0.18%)\"],\n  [\"Visa Inc Class a Shares\", \"V\", 1.029636, 231.97, 2.47, \"(1.08%)\"],\n  [\"Procter & Gamble Co\", \"PG\", 0.969793, 145.75, -1.59, \"(-1.08%)\"],\n  [\"Broadcom Inc\", \"AVGO\", 0.941177, 835.33, 18.52, \"(2.27%)\"],\n  [\"Mastercard Inc A\", \"MA\", 0.918779, 400.65, 5.17, \"(1.31%)\"],\n  [\"Chevron Corp\", \"CVX\", 0.847353, 170.55, -0.49, \"(-0.28%)\"],\n  [\"Home Depot Inc\", \"HD\", 0.847289, 304.35, 2.53, \"(0.84%)\"],\n  [\"Abbvie Inc\", \"BBV\", 0.754672, 152.14, -0.99, \"(-0.65%)\"],\n  [\"Merck & Co. Inc.\", \"MRK\", 0.736434, 104.2, 0.26, \"(0.25%)\"],\n  [\"Costco Wholesale Corp\", \"COST\", 0.697258, 569.05, 5.52, \"(0.98%)\"],\n  [\"Pepsico Inc\", \"PEP\", 0.651768, 168.92, -0.65, \"(-0.38%)\"],\n  [\"Walmart Inc\", \"WMT\", 0.644449, 161.87, 0.15, \"(0.09%)\"],\n  [\"Adobe Inc\", \"ADBE\", 0.639652, 507.17, 4.57, \"(0.91%)\"],\n  [\"Coca Cola Co\", \"KO\", 0.60801, 55.82, -0.13, \"(-0.23%)\"],\n  [\"Cisco Systems Inc\", \"CSCO\", 0.605326, 53.97, 0.77, \"(1.44%)\"],\n  [\"Accenture Plc Cl A\", \"ACN\", 0.55372, 298.5, -15.9, \"(-5.05%)\"],\n  [\"Salesforce Inc\", \"CRM\", 0.551342, 204.46, 1.73, \"(0.85%)\"],\n  [\"Thermo Fisher Scientific Inc\", \"TMO\", 0.536951, 503.47, 5.18, \"(1.04%)\"],\n  [\"Mcdonald S Corp\", \"MCD\", 0.536457, 265.83, 2.19, \"(0.83%)\"],\n  [\"Bank of America Corp\", \"BAC\", 0.526405, 27.51, 0.24, \"(0.86%)\"],\n  [\"Comcast Corp Class A\", \"CMCSA\", 0.512537, 45.17, 0.57, \"(1.27%)\"],\n  [\"Linde Plc\", \"LIN\", 0.506835, 375.48, 3.47, \"(0.93%)\"],\n  [\"Pfizer Inc\", \"PFE\", 0.506043, 32.09, -0.02, \"(-0.05%)\"],\n  [\"Netflix Inc\", \"NFLX\", 0.467192, 377.77, 0.18, \"(0.05%)\"],\n  [\"Abbott Laboratories\", \"ABT\", 0.462893, 97.52, 1.99, \"(2.08%)\"],\n  [\"Oracle Corp\", \"ORCL\", 0.459877, 106.29, 1.67, \"(1.60%)\"],\n];\n\n/*\n41,Danaher Corp,DHR,0.454026,248.24,0.80,(0.32%)\n42,Advanced Micro Devices,AMD,0.442473,103.74,5.67,(5.78%)\n43,Wells Fargo & Co,WFC,0.417428,41.04,0.18,(0.43%)\n44,Conocophillips,COP,0.411569,123.32,0.23,(0.18%)\n45,Walt Disney Co,DIS,0.408438,80.35,0.45,(0.56%)\n46,Intel Corp,INTC,0.404462,35.50,0.89,(2.56%)\n47,Amgen Inc,AMGN,0.401904,270.91,1.93,(0.72%)\n48,Texas Instruments Inc,TXN,0.400931,160.98,2.84,(1.80%)\n49,Intuit Inc,INTU,0.397406,515.11,6.87,(1.35%)\n50,Philip Morris International,PM,0.39143,92.66,2.34,(2.59%)\n51,Caterpillar Inc,CAT,0.388444,276.34,3.63,(1.33%)\n52,Verizon Communications Inc,VZ,0.380327,32.56,0.16,(0.48%)\n53,Intl Business Machines Corp,IBM,0.364246,140.89,-2.28,(-1.59%)\n54,Honeywell International Inc,HON,0.348317,188.68,0.80,(0.43%)\n55,Union Pacific Corp,UNP,0.344419,203.88,1.48,(0.73%)\n56,Qualcomm Inc,QCOM,0.340195,111.55,2.36,(2.16%)\n57,Nextera Energy Inc,NEE,0.338809,57.64,-2.32,(-3.88%)\n58,Lowe S Cos Inc,LOW,0.338613,209.52,2.56,(1.24%)\n59,Bristol Myers Squibb Co,BMY,0.337683,58.30,0.41,(0.70%)\n60,General Electric Co,GE,0.336989,112.43,1.54,(1.39%)\n61,S&p Global Inc,SPGI,0.32985,369.21,6.15,(1.69%)\n62,Applied Materials Inc,AMAT,0.316678,139.15,4.09,(3.03%)\n63,Servicenow Inc,NOW,0.3112,552.84,6.46,(1.18%)\n64,Boeing Co,BA,0.309673,193.12,-2.34,(-1.20%)\n65,United Parcel Service Cl B,UPS,0.307795,154.29,1.88,(1.23%)\n66,Booking Holdings Inc,BKNG,0.307126,3,086.26,3.60,(0.12%)\n67,Nike Inc Cl B,NKE,0.305871,89.63,0.21,(0.24%)\n68,At&t Inc,T,0.296603,14.94,0.07,(0.44%)\n69,Goldman Sachs Group Inc,GS,0.296356,325.72,3.77,(1.17%)\n70,Rtx Corp,RTX,0.296189,72.54,-0.34,(-0.46%)\n71,Elevance Health Inc,ELV,0.292632,448.99,4.23,(0.95%)\n72,Deere & Co,DE,0.291602,388.36,4.00,(1.04%)\n73,Starbucks Corp,SBUX,0.291579,91.21,0.04,(0.04%)\n74,Morgan Stanley,MS,0.29087,82.34,0.69,(0.84%)\n75,Medtronic Plc,MDT,0.290688,78.77,0.55,(0.71%)\n76,Prologis Inc,PLD,0.286912,112.30,1.05,(0.94%)\n77,Intuitive Surgical Inc,ISRG,0.285764,296.31,4.88,(1.67%)\n78,Tjx Companies Inc,TJX,0.282733,89.27,1.16,(1.32%)\n79,Automatic Data Processing,ADP,0.279113,243.79,1.16,(0.48%)\n80,Marsh & Mclennan Cos,MMC,0.266169,193.53,0.55,(0.29%)\n81,Mondelez International Inc A,MDLZ,0.26425,69.44,-0.56,(-0.79%)\n82,Gilead Sciences Inc,GILD,0.26285,75.96,0.41,(0.54%)\n83,Lockheed Martin Corp,LMT,0.255775,410.40,1.68,(0.41%)\n84,Blackrock Inc,BLK,0.252096,645.37,1.98,(0.31%)\n85,Vertex Pharmaceuticals Inc,VRTX,0.251521,353.91,4.26,(1.22%)\n86,Stryker Corp,SYK,0.250789,273.07,6.53,(2.45%)\n87,Cvs Health Corp,CVS,0.250255,70.11,0.33,(0.47%)\n88,Regeneron Pharmaceuticals,REGN,0.2481,835.67,3.11,(0.37%)\n89,American Express Co,AXP,0.243515,150.42,0.52,(0.34%)\n90,Chubb Ltd,CB,0.242706,212.92,1.29,(0.61%)\n91,Analog Devices Inc,ADI,0.241943,177.01,4.20,(2.43%)\n92,Schlumberger Ltd,SLB,0.241232,61.02,0.22,(0.36%)\n93,Eaton Corp Plc,ETN,0.238556,216.42,2.06,(0.96%)\n94,The Cigna Group,CI,0.238517,291.43,2.82,(0.98%)\n95,Progressive Corp,PGR,0.229854,140.76,0.14,(0.10%)\n96,Lam Research Corp,LRCX,0.228483,627.46,13.54,(2.20%)\n97,Schwab (Charles) Corp,SCHW,0.225784,54.57,0.19,(0.35%)\n98,Zoetis Inc,ZTS,0.224522,174.68,-0.00,(-0.00%)\n99,Citigroup Inc,C,0.217552,41.24,0.78,(1.92%)\n100,Boston Scientific Corp,BSX,0.213003,53.30,1.20,(2.31%)\n101,Blackstone Inc,BX,0.211158,108.88,2.33,(2.19%)\n102,Eog Resources Inc,EOG,0.21104,130.56,0.75,(0.57%)\n103,Becton Dickinson and Co,BDX,0.209627,262.60,3.80,(1.47%)\n104,Micron Technology Inc,MU,0.208276,66.25,-1.96,(-2.87%)\n105,American Tower Corp,AMT,0.207727,160.73,1.04,(0.65%)\n106,Altria Group Inc,MO,0.207666,42.11,0.20,(0.47%)\n107,T Mobile Us Inc,TMUS,0.20192,140.30,0.60,(0.43%)\n108,Cme Group Inc,CME,0.201368,200.22,-0.14,(-0.07%)\n109,Southern Co,SO,0.20116,65.04,-1.10,(-1.67%)\n110,Palo Alto Networks Inc,PANW,0.198047,236.42,4.52,(1.95%)\n111,Duke Energy Corp,DUK,0.193827,88.87,-1.23,(-1.36%)\n112,Fiserv Inc,FI,0.192662,113.67,0.48,(0.42%)\n113,Synopsys Inc,SNPS,0.189768,458.88,12.17,(2.72%)\n114,Activision Blizzard Inc,ATVI,0.18717,93.71,-0.22,(-0.23%)\n115,Aon Plc Class A,AON,0.186896,330.04,0.12,(0.04%)\n116,Equinix Inc,EQIX,0.184757,715.84,8.74,(1.24%)\n117,Illinois Tool Works,ITW,0.177501,233.17,0.77,(0.33%)\n118,Air Products & Chemicals Inc,APD,0.17678,289.15,3.89,(1.36%)\n119,Paypal Holdings Inc,PYPL,0.175802,58.30,0.96,(1.67%)\n120,Cadence Design Sys Inc,CDNS,0.175052,235.09,4.44,(1.93%)\n121,Northrop Grumman Corp,NOC,0.173654,441.30,4.06,(0.93%)\n122,Intercontinental Exchange In,ICE,0.172998,109.93,1.66,(1.53%)\n123,Humana Inc,HUM,0.170476,495.73,2.16,(0.44%)\n124,Marathon Petroleum Corp,MPC,0.170186,155.28,2.85,(1.87%)\n125,Kla Corp,KLAC,0.170079,459.61,14.05,(3.15%)\n126,Fedex Corp,FDX,0.169747,266.99,4.28,(1.63%)\n127,Csx Corp,CSX,0.169632,30.62,0.34,(1.14%)\n128,Mckesson Corp,MCK,0.167376,445.58,1.20,(0.27%)\n129,Sherwin Williams Co,SHW,0.165389,254.95,4.33,(1.73%)\n130,Colgate Palmolive Co,CL,0.164,71.11,0.06,(0.08%)\n131,Airbnb Inc Class A,ABNB,0.159553,137.66,3.63,(2.70%)\n132,Waste Management Inc,WM,0.15893,154.17,-0.25,(-0.16%)\n133,Emerson Electric Co,EMR,0.154857,97.31,0.45,(0.47%)\n134,O Reilly Automotive Inc,ORLY,0.154194,918.15,3.98,(0.44%)\n135,Pioneer Natural Resources Co,PXD,0.1524,234.43,0.34,(0.14%)\n136,Phillips 66,PSX,0.150197,122.81,2.01,(1.66%)\n137,Freeport Mcmoran Inc,FCX,0.146185,37.34,0.79,(2.17%)\n138,3m Co W/d,MMM,0.144312,93.48,0.02,(0.02%)\n139,Roper Technologies Inc,ROP,0.144165,486.61,-0.02,(-0.00%)\n140,Valero Energy Corp,VLO,0.141937,147.59,3.64,(2.53%)\n141,Nxp Semiconductors Nv,NXPI,0.141583,202.19,5.49,(2.79%)\n142,Target Corp,TGT,0.141106,109.31,-0.44,(-0.40%)\n143,Parker Hannifin Corp,PH,0.140358,396.29,5.18,(1.32%)\n144,Us Bancorp,USB,0.139291,32.59,0.07,(0.20%)\n145,General Dynamics Corp,GD,0.139193,223.44,2.44,(1.10%)\n146,Chipotle Mexican Grill Inc,CMG,0.139055,1,828.59,22.51,(1.25%)\n147,Hca Healthcare Inc,HCA,0.138966,251.59,4.33,(1.75%)\n148,Arthur J Gallagher & Co,AJG,0.138231,231.77,1.44,(0.62%)\n149,Moody S Corp,MCO,0.138162,319.07,4.56,(1.45%)\n150,Amphenol Corp Cl A,APH,0.136941,84.40,2.04,(2.47%)\n151,Ford Motor Co,F,0.1362,12.58,0.19,(1.49%)\n152,Marriott International Cl A,MAR,0.135619,199.53,5.65,(2.92%)\n153,Pnc Financial Services Group,PNC,0.135457,123.09,1.28,(1.05%)\n154,Transdigm Group Inc,TDG,0.131273,860.46,8.64,(1.01%)\n155,Carrier Global Corp,CARR,0.129065,56.83,1.75,(3.17%)\n156,Autozone Inc,AZO,0.128857,2,556.17,15.27,(0.60%)\n157,Trane Technologies Plc,TT,0.12759,207.07,7.01,(3.50%)\n158,Motorola Solutions Inc,MSI,0.127284,275.18,2.20,(0.81%)\n159,Arista Networks Inc,ANET,0.12715,184.23,2.63,(1.45%)\n160,Norfolk Southern Corp,NSC,0.124378,197.30,1.08,(0.55%)\n161,General Motors Co,GM,0.124282,33.25,0.90,(2.77%)\n162,Paccar Inc,PCAR,0.123613,86.12,1.31,(1.54%)\n163,Charter Communications Inc A,CHTR,0.123199,442.28,8.86,(2.04%)\n164,Hess Corp,HES,0.121942,157.30,-0.74,(-0.47%)\n165,Sempra,SRE,0.121909,68.15,-1.26,(-1.81%)\n166,Occidental Petroleum Corp,OXY,0.121531,66.03,0.43,(0.66%)\n167,American International Group,AIG,0.121272,61.73,0.72,(1.18%)\n168,Autodesk Inc,ADSK,0.120711,208.03,5.75,(2.84%)\n169,Edwards Lifesciences Corp,EW,0.119074,69.68,-0.43,(-0.62%)\n170,Ecolab Inc,ECL,0.118911,169.50,1.63,(0.97%)\n171,Public Storage,PSA,0.117206,266.58,1.60,(0.60%)\n172,Microchip Technology Inc,MCHP,0.116275,78.91,2.41,(3.15%)\n173,Aflac Inc,AFL,0.11627,77.65,0.62,(0.81%)\n174,Cintas Corp,CTAS,0.116227,486.83,5.75,(1.19%)\n175,Welltower Inc,WELL,0.116157,81.07,0.87,(1.08%)\n176,Williams Cos Inc,WMB,0.115685,34.65,0.55,(1.61%)\n177,Kimberly Clark Corp,KMB,0.114902,121.11,-0.55,(-0.45%)\n178,Archer Daniels Midland Co,ADM,0.114307,76.74,0.38,(0.50%)\n179,Msci Inc,MSCI,0.113047,518.97,7.03,(1.37%)\n180,Constellation Brands Inc A,STZ,0.112869,251.62,1.03,(0.41%)\n181,On Semiconductor,ON,0.111009,95.12,3.07,(3.33%)\n182,Metlife Inc,MET,0.110772,63.06,0.26,(0.41%)\n183,Monster Beverage Corp,MNST,0.110311,53.31,0.19,(0.35%)\n184,Hilton Worldwide Holdings In,HLT,0.109054,153.24,3.88,(2.60%)\n185,American Electric Power,AEP,0.108899,74.71,-1.15,(-1.51%)\n186,Crown Castle Inc,CCI,0.108512,91.35,1.65,(1.83%)\n187,Exelon Corp,EXC,0.107894,38.11,-0.69,(-1.78%)\n188,Nucor Corp,NUE,0.107787,158.31,2.60,(1.67%)\n189,Travelers Cos Inc,TRV,0.107342,167.42,-0.51,(-0.30%)\n190,Dominion Energy Inc,D,0.106001,44.61,-0.86,(-1.88%)\n191,Te Connectivity Ltd,TEL,0.105581,123.84,3.40,(2.82%)\n192,Halliburton Co,HAL,0.105449,42.18,0.15,(0.37%)\n193,Centene Corp,CNC,0.105443,69.87,0.13,(0.18%)\n194,Fortinet Inc,FTNT,0.105315,59.07,0.93,(1.59%)\n195,Oneok Inc,OKE,0.104854,64.86,0.35,(0.53%)\n196,General Mills Inc,GIS,0.104655,63.79,-0.26,(-0.40%)\n197,Copart Inc,CPRT,0.104453,43.66,0.61,(1.41%)\n198,Paychex Inc,PAYX,0.104412,117.40,0.89,(0.76%)\n199,Biogen Inc,BIIB,0.103916,258.95,1.43,(0.55%)\n200,Truist Financial Corp,TFC,0.103679,28.15,0.18,(0.63%)\n201,Ross Stores Inc,ROST,0.10361,111.18,2.26,(2.07%)\n202,Johnson Controls Internation,JCI,0.103601,53.69,-0.85,(-1.55%)\n203,Iqvia Holdings Inc,IQV,0.103397,200.11,-2.10,(-1.04%)\n204,Capital One Financial Corp,COF,0.101688,96.63,1.14,(1.20%)\n205,Baker Hughes Co,BKR,0.101425,36.62,0.37,(1.02%)\n206,Idexx Laboratories Inc,IDXX,0.101263,439.37,2.51,(0.57%)\n207,Corteva Inc,CTVA,0.100577,50.77,0.02,(0.05%)\n208,Dow Inc,DOW,0.100258,50.87,-0.13,(-0.26%)\n209,Old Dominion Freight Line,ODFL,0.100037,406.82,6.93,(1.73%)\n210,Constellation Energy,CEG,0.099445,109.94,-0.81,(-0.73%)\n211,Dexcom Inc,DXCM,0.099384,95.68,3.59,(3.90%)\n212,Simon Property Group Inc,SPG,0.098977,108.45,0.26,(0.24%)\n213,Digital Realty Trust Inc,DLR,0.098757,117.60,0.76,(0.65%)\n214,Realty Income Corp,O,0.098278,49.83,0.17,(0.33%)\n215,Kenvue Inc W/i,KVUE,0.097359,20.20,-0.02,(-0.12%)\n216,Verisk Analytics Inc,VRSK,0.097203,241.97,2.34,(0.98%)\n217,Cognizant Tech Solutions A,CTSH,0.096172,68.15,-0.05,(-0.07%)\n218,P G & E Corp,PCG,0.095995,16.36,-0.09,(-0.52%)\n219,Prudential Financial Inc,PRU,0.095804,94.93,0.41,(0.43%)\n220,Ametek Inc,AME,0.09567,150.03,1.17,(0.79%)\n221,Yum Brands Inc,YUM,0.095443,123.55,1.57,(1.29%)\n222,Dupont De Nemours Inc,DD,0.094185,74.58,1.11,(1.51%)\n223,Ameriprise Financial Inc,AMP,0.093691,332.11,5.16,(1.58%)\n224,L3harris Technologies Inc,LHX,0.092512,173.16,-2.04,(-1.16%)\n225,Fidelity National Info Serv,FIS,0.09207,56.06,0.52,(0.94%)\n226,Sysco Corp,SYY,0.091968,65.99,0.78,(1.20%)\n227,Moderna Inc,MRNA,0.091789,100.61,1.17,(1.18%)\n228,Bank of New York Mellon Corp,BK,0.091699,42.76,0.59,(1.39%)\n229,Agilent Technologies Inc,A,0.091382,111.91,1.41,(1.28%)\n230,Otis Worldwide Corp,OTIS,0.091228,80.55,1.20,(1.51%)\n231,Rockwell Automation Inc,ROK,0.091103,288.26,3.46,(1.21%)\n232,Dr Horton Inc,DHI,0.090974,108.96,1.95,(1.82%)\n233,Cummins Inc,CMI,0.090916,232.98,3.03,(1.32%)\n234,Estee Lauder Companies Cl A,EL,0.090788,139.94,-0.10,(-0.07%)\n235,Kinder Morgan Inc,KMI,0.090175,16.71,0.05,(0.27%)\n236,Keurig Dr Pepper Inc,KDP,0.088358,31.51,-0.16,(-0.51%)\n237,Fastenal Co,FAST,0.087952,55.72,0.66,(1.21%)\n238,Xcel Energy Inc,XEL,0.087474,56.50,-0.71,(-1.25%)\n239,Devon Energy Corp,DVN,0.087359,48.84,0.00,(0.01%)\n240,Ww Grainger Inc,GWW,0.086956,704.07,3.96,(0.57%)\n241,Costar Group Inc,CSGP,0.086756,77.10,0.75,(0.99%)\n242,Cencora Inc,COR,0.086188,183.99,-1.17,(-0.63%)\n243,United Rentals Inc,URI,0.085093,454.44,8.22,(1.84%)\n244,Hershey Co,HSY,0.084755,201.01,-1.55,(-0.76%)\n245,Arch Capital Group Ltd,ACGL,0.083799,81.62,0.54,(0.67%)\n246,Ppg Industries Inc,PPG,0.083787,130.49,2.46,(1.92%)\n247,Global Payments Inc,GPN,0.083671,116.72,1.47,(1.28%)\n248,Consolidated Edison Inc,ED,0.083432,85.06,-1.57,(-1.81%)\n249,Newmont Corp,NEM,0.082799,36.78,-0.50,(-1.34%)\n250,Republic Services Inc,RSG,0.082765,145.01,0.28,(0.19%)\n251,Allstate Corp,ALL,0.08254,112.77,-0.25,(-0.22%)\n252,Electronic Arts Inc,EA,0.081213,119.76,1.79,(1.51%)\n253,Vici Properties Inc,VICI,0.081127,29.28,0.40,(1.37%)\n254,Kroger Co,KR,0.080998,44.96,0.48,(1.07%)\n255,Public Service Enterprise Gp,PEG,0.080723,56.88,-1.02,(-1.75%)\n256,Lennar Corp A,LEN,0.078759,113.41,1.71,(1.53%)\n257,Diamondback Energy Inc,FANG,0.078498,158.01,0.78,(0.50%)\n258,West Pharmaceutical Services,WST,0.077362,377.15,1.97,(0.52%)\n259,Quanta Services Inc,PWR,0.077074,190.82,0.70,(0.37%)\n260,Gartner Inc,IT,0.076911,347.78,-1.41,(-0.40%)\n261,Aptiv Plc,APTV,0.0757,99.21,3.35,(3.50%)\n262,Vulcan Materials Co,VMC,0.075604,207.60,4.00,(1.97%)\n263,Kraft Heinz Co,KHC,0.075468,33.72,-0.31,(-0.90%)\n264,Ge Healthcare Technology,GEHC,0.074734,69.81,1.53,(2.24%)\n265,Cdw Corp/de,CDW,0.074375,202.53,3.84,(1.93%)\n266,Fortive Corp,FTV,0.072323,74.75,1.16,(1.58%)\n267,Ingersoll Rand Inc,IR,0.071683,64.52,1.25,(1.97%)\n268,Ansys Inc,ANSS,0.071343,299.19,4.85,(1.65%)\n269,Extra Space Storage Inc,EXR,0.071269,120.75,0.24,(0.20%)\n270,Wec Energy Group Inc,WEC,0.071007,79.67,-0.91,(-1.12%)\n271,Martin Marietta Materials,MLM,0.070759,418.00,8.05,(1.96%)\n272,Edison International,EIX,0.068887,63.92,-1.38,(-2.11%)\n273,American Water Works Co Inc,AWK,0.068233,123.27,-3.07,(-2.43%)\n274,Warner Bros Discovery Inc,WBD,0.068207,10.89,-0.15,(-1.31%)\n275,Lyondellbasell Indu Cl A,LYB,0.067294,94.86,-0.11,(-0.11%)\n276,Mettler Toledo International,MTD,0.067028,1,112.26,14.48,(1.32%)\n277,Avalonbay Communities Inc,AVB,0.066762,171.85,-0.60,(-0.35%)\n278,Delta Air Lines Inc,DAL,0.065781,37.32,0.66,(1.79%)\n279,T Rowe Price Group Inc,TROW,0.064996,104.73,1.19,(1.15%)\n280,Keysight Technologies In,KEYS,0.064934,133.51,3.11,(2.38%)\n281,Zimmer Biomet Holdings Inc,ZBH,0.064476,112.14,1.38,(1.24%)\n282,Dollar General Corp,DG,0.064042,105.04,0.70,(0.67%)\n283,Corning Inc,GLW,0.064037,30.35,0.29,(0.98%)\n284,Ebay Inc,EBAY,0.063728,43.45,0.56,(1.31%)\n285,Cbre Group Inc A,CBRE,0.063578,73.84,0.35,(0.48%)\n286,Weyerhaeuser Co,WY,0.063312,30.40,-0.64,(-2.05%)\n287,Church & Dwight Co Inc,CHD,0.062765,91.68,-0.29,(-0.31%)\n288,Cardinal Health Inc,CAH,0.062583,88.18,0.14,(0.16%)\n289,Hp Inc,HPQ,0.062013,25.73,0.09,(0.36%)\n290,Equifax Inc,EFX,0.061821,185.40,4.68,(2.59%)\n291,Tractor Supply Company,TSCO,0.061683,205.07,2.06,(1.02%)\n292,Willis Towers Watson Plc,WTW,0.06168,211.96,0.35,(0.17%)\n293,Hewlett Packard Enterprise,HPE,0.061499,17.70,0.63,(3.66%)\n294,Fair Isaac Corp,FICO,0.061481,890.19,4.58,(0.52%)\n295,Dollar Tree Inc,DLTR,0.061287,106.46,1.11,(1.05%)\n296,Hartford Financial Svcs Grp,HIG,0.061236,72.24,0.53,(0.73%)\n297,Resmed Inc,RMD,0.060853,149.81,1.16,(0.78%)\n298,Take Two Interactive Softwre,TTWO,0.060753,139.63,1.85,(1.34%)\n299,Royal Caribbean Cruises Ltd,RCL,0.060515,94.38,2.42,(2.64%)\n300,Xylem Inc,XYL,0.060192,91.40,1.09,(1.20%)\n301,Align Technology Inc,ALGN,0.060095,309.06,7.38,(2.45%)\n302,Steris Plc,STE,0.060013,221.57,3.67,(1.69%)\n303,Broadridge Financial Solutio,BR,0.059572,181.18,-0.04,(-0.02%)\n304,Discover Financial Services,DFS,0.059507,86.35,1.09,(1.28%)\n305,State Street Corp,STT,0.059411,67.81,1.03,(1.54%)\n306,Sba Communications Corp,SBAC,0.059216,198.11,2.05,(1.05%)\n307,Monolithic Power Systems Inc,MPWR,0.058699,457.69,16.51,(3.74%)\n308,Illumina Inc,ILMN,0.058584,133.02,-0.28,(-0.21%)\n309,Dte Energy Company,DTE,0.058057,98.82,-1.72,(-1.71%)\n310,M & T Bank Corp,MTB,0.057846,126.63,2.09,(1.68%)\n311,Coterra Energy Inc,CTRA,0.057589,27.48,0.34,(1.23%)\n312,Eversource Energy,ES,0.057281,57.54,-1.23,(-2.09%)\n313,Genuine Parts Co,GPC,0.055796,142.94,0.63,(0.45%)\n314,Equity Residential,EQR,0.055712,58.67,0.23,(0.40%)\n315,Entergy Corp,ETR,0.055241,92.23,-1.02,(-1.10%)\n316,Dover Corp,DOV,0.055103,141.68,1.09,(0.77%)\n317,Ameren Corporation,AEE,0.054981,74.60,-1.51,(-1.98%)\n318,Ulta Beauty Inc,ULTA,0.054585,398.17,5.73,(1.46%)\n319,Teledyne Technologies Inc,TDY,0.054228,414.36,0.92,(0.22%)\n320,Nvr Inc,NVR,0.054188,6,027.42,86.42,(1.45%)\n321,Targa Resources Corp,TRGP,0.05408,87.52,0.93,(1.08%)\n322,Molina Healthcare Inc,MOH,0.053618,333.09,2.03,(0.61%)\n323,Wabtec Corp,WAB,0.053425,108.18,1.35,(1.26%)\n324,Fleetcor Technologies Inc,FLT,0.053345,260.14,1.28,(0.49%)\n325,Albemarle Corp,ALB,0.053229,172.99,10.36,(6.37%)\n326,Baxter International Inc,BAX,0.05272,37.54,0.21,(0.57%)\n327,Raymond James Financial Inc,RJF,0.052247,101.39,1.84,(1.85%)\n328,Mccormick & Co Non Vtg Shrs,MKC,0.051871,74.55,0.46,(0.63%)\n329,Invitation Homes Inc,INVH,0.051153,31.73,0.03,(0.11%)\n330,Firstenergy Corp,FE,0.050777,34.56,-0.69,(-1.94%)\n331,Laboratory Crp of Amer Hldgs,LH,0.05072,204.23,-0.62,(-0.30%)\n332,Howmet Aerospace Inc,HWM,0.050386,46.99,0.91,(1.97%)\n333,Verisign Inc,VRSN,0.050215,202.93,2.46,(1.23%)\n334,Ppl Corp,PPL,0.04902,23.56,-0.39,(-1.61%)\n335,Iron Mountain Inc,IRM,0.047985,59.55,0.56,(0.94%)\n336,Jacobs Solutions Inc,J,0.047882,136.45,0.27,(0.20%)\n337,Intl Flavors & Fragrances,IFF,0.047868,67.84,0.64,(0.95%)\n338,Centerpoint Energy Inc,CNP,0.047827,26.68,-0.48,(-1.75%)\n339,Darden Restaurants Inc,DRI,0.047736,143.44,2.01,(1.42%)\n340,Hologic Inc,HOLX,0.047358,69.99,0.75,(1.08%)\n341,First Solar Inc,FSLR,0.047324,161.90,3.29,(2.07%)\n342,Expeditors Intl Wash Inc,EXPD,0.046936,114.74,1.08,(0.95%)\n343,Brown & Brown Inc,BRO,0.046675,71.15,0.19,(0.26%)\n344,Factset Research Systems Inc,FDS,0.046601,443.66,8.47,(1.95%)\n345,Fifth Third Bancorp,FITB,0.046598,25.05,0.19,(0.74%)\n346,Ventas Inc,VTR,0.046351,42.18,0.77,(1.85%)\n347,Marathon Oil Corp,MRO,0.046321,27.51,0.12,(0.45%)\n348,Steel Dynamics Inc,STLD,0.046096,106.96,0.52,(0.48%)\n349,Bunge Ltd,BG,0.046038,110.67,1.10,(1.00%)\n350,Ptc Inc,PTC,0.045951,140.25,1.78,(1.28%)\n351,Everest Group Ltd,EG,0.04587,381.30,-0.42,(-0.11%)\n352,Cincinnati Financial Corp,CINF,0.045852,104.40,-0.30,(-0.29%)\n353,Enphase Energy Inc,ENPH,0.045679,121.39,1.28,(1.07%)\n354,Nasdaq Inc,NDAQ,0.04562,49.07,0.74,(1.52%)\n355,Akamai Technologies Inc,AKAM,0.045578,107.75,0.79,(0.74%)\n356,Cboe Global Markets Inc,CBOE,0.045525,155.28,0.51,(0.33%)\n357,Cf Industries Holdings Inc,CF,0.04496,84.93,1.48,(1.78%)\n358,Waters Corp,WAT,0.044936,274.46,2.12,(0.78%)\n359,Pultegroup Inc,PHM,0.044848,74.85,1.65,(2.25%)\n360,Tyler Technologies Inc,TYL,0.044831,387.74,2.43,(0.63%)\n361,Principal Financial Group,PFG,0.044705,72.74,0.74,(1.02%)\n362,Clorox Company,CLX,0.04465,128.98,-0.17,(-0.13%)\n363,Southwest Airlines Co,LUV,0.044478,27.30,0.49,(1.81%)\n364,Regions Financial Corp,RF,0.044397,17.16,0.22,(1.27%)\n365,Garmin Ltd,GRMN,0.044336,104.65,1.42,(1.38%)\n366,Atmos Energy Corp,ATO,0.044128,106.32,-0.14,(-0.13%)\n367,Netapp Inc,NTAP,0.044116,76.49,1.54,(2.05%)\n368,Textron Inc,TXT,0.043659,79.27,0.33,(0.41%)\n369,Cooper Cos Inc,COO,0.04361,318.15,2.23,(0.71%)\n370,Kellogg Co,K,0.043517,58.90,-0.22,(-0.38%)\n371,Idex Corp,IEX,0.043484,210.72,3.28,(1.58%)\n372,Cms Energy Corp,CMS,0.043476,52.78,-0.57,(-1.07%)\n373,Skyworks Solutions Inc,SWKS,0.042974,98.55,2.25,(2.33%)\n374,Alexandria Real Estate Equit,ARE,0.042466,99.48,0.59,(0.60%)\n375,Hunt (Jb) Transprt Svcs Inc,JBHT,0.042319,186.54,0.95,(0.51%)\n376,Las Vegas Sands Corp,LVS,0.042222,45.63,-0.53,(-1.15%)\n377,Ball Corp,BALL,0.042202,48.27,0.04,(0.08%)\n378,Walgreens Boots Alliance Inc,WBA,0.04215,20.97,-0.06,(-0.26%)\n379,Teradyne Inc,TER,0.041494,100.04,3.56,(3.68%)\n380,Mid America Apartment Comm,MAA,0.041385,128.55,0.48,(0.37%)\n381,Epam Systems Inc,EPAM,0.041006,257.76,0.96,(0.37%)\n382,Avery Dennison Corp,AVY,0.040961,183.42,1.39,(0.76%)\n383,Omnicom Group,OMC,0.040483,74.60,1.21,(1.65%)\n384,Huntington Bancshares Inc,HBAN,0.040444,10.25,0.13,(1.24%)\n385,Eqt Corp,EQT,0.040251,40.00,0.39,(0.99%)\n386,Tyson Foods Inc Cl A,TSN,0.040042,49.74,-0.37,(-0.74%)\n387,Western Digital Corp,WDC,0.039814,45.50,0.94,(2.11%)\n388,Northern Trust Corp,NTRS,0.039557,69.29,0.84,(1.23%)\n389,Carnival Corp,CCL,0.039206,14.52,0.54,(3.88%)\n390,Expedia Group Inc,EXPE,0.038585,102.75,2.50,(2.49%)\n391,United Airlines Holdings Inc,UAL,0.038383,42.84,0.81,(1.94%)\n392,Quest Diagnostics Inc,DGX,0.038331,123.71,0.31,(0.25%)\n393,Axon Enterprise Inc,AXON,0.03828,195.69,1.04,(0.53%)\n394,Packaging Corp of America,PKG,0.038236,152.79,0.90,(0.59%)\n395,Revvity Inc,RVTY,0.0378,110.55,1.50,(1.38%)\n396,Snap on Inc,SNA,0.037774,257.97,4.00,(1.58%)\n397,Pool Corp,POOL,0.037475,353.56,9.86,(2.87%)\n398,Essex Property Trust Inc,ESS,0.03733,210.81,0.07,(0.03%)\n399,Domino S Pizza Inc,DPZ,0.037258,382.39,2.18,(0.57%)\n400,Amcor Plc,AMCR,0.037101,9.09,0.06,(0.61%)\n401,Best Buy Co Inc,BBY,0.037071,68.66,0.29,(0.43%)\n402,Apa Corp,APA,0.03662,42.49,0.11,(0.27%)\n403,Lamb Weston Holdings Inc,LW,0.036553,91.47,0.09,(0.10%)\n404,Wr Berkley Corp,WRB,0.036551,65.21,0.86,(1.33%)\n405,Conagra Brands Inc,CAG,0.036484,27.44,-0.10,(-0.35%)\n406,Lkq Corp,LKQ,0.036449,49.51,0.72,(1.47%)\n407,Jm Smucker Co,SJM,0.035767,124.48,-0.96,(-0.77%)\n408,Stanley Black & Decker Inc,SWK,0.035567,83.87,0.97,(1.17%)\n409,Synchrony Financial,SYF,0.035241,30.73,0.55,(1.84%)\n410,Carmax Inc,KMX,0.035202,71.64,-8.05,(-10.10%)\n411,Leidos Holdings Inc,LDOS,0.034943,92.20,0.21,(0.23%)\n412,Seagate Technology Holdings,STX,0.034918,65.71,1.42,(2.20%)\n413,Paycom Software Inc,PAYC,0.034914,259.42,2.34,(0.91%)\n414,Celanese Corp,CE,0.034212,127.11,3.81,(3.09%)\n415,Trimble Inc,TRMB,0.034136,52.22,3.01,(6.12%)\n416,Alliant Energy Corp,LNT,0.03411,48.06,-0.49,(-1.02%)\n417,Citizens Financial Group,CFG,0.033972,26.28,0.52,(2.00%)\n418,International Paper Co,IP,0.033961,35.10,0.15,(0.41%)\n419,Masco Corp,MAS,0.033414,54.58,1.37,(2.58%)\n420,Nordson Corp,NDSN,0.033057,223.81,3.73,(1.69%)\n421,Loews Corp,L,0.032942,64.16,0.36,(0.56%)\n422,Evergy Inc,EVRG,0.032792,50.48,-0.58,(-1.13%)\n423,Mosaic Co,MOS,0.03266,35.63,0.43,(1.22%)\n424,Molson Coors Beverage Co B,TAP,0.032624,62.29,-0.12,(-0.19%)\n425,Zebra Technologies Corp Cl A,ZBRA,0.03257,236.95,11.04,(4.89%)\n426,Viatris Inc,VTRS,0.032115,9.80,0.21,(2.14%)\n427,Live Nation Entertainment In,LYV,0.032035,83.73,2.71,(3.34%)\n428,Host Hotels & Resorts Inc,HST,0.03173,16.38,0.34,(2.11%)\n429,Insulet Corp,PODD,0.031493,166.19,4.49,(2.77%)\n430,Match Group Inc,MTCH,0.031269,40.07,0.09,(0.23%)\n431,Interpublic Group of Cos Inc,IPG,0.031184,29.12,0.39,(1.35%)\n432,Hormel Foods Corp,HRL,0.030887,38.15,-0.19,(-0.48%)\n433,Incyte Corp,INCY,0.03067,58.93,-0.18,(-0.30%)\n434,Udr Inc,UDR,0.030252,35.67,0.28,(0.79%)\n435,Jack Henry & Associates Inc,JKHY,0.030211,150.61,2.17,(1.46%)\n436,Kimco Realty Corp,KIM,0.029862,17.73,0.24,(1.34%)\n437,Aes Corp,AES,0.029775,15.29,-0.65,(-4.05%)\n438,Bio Techne Corp,TECH,0.029742,67.67,0.10,(0.15%)\n439,Pentair Plc,PNR,0.029592,65.59,0.87,(1.34%)\n440,Rollins Inc,ROL,0.029276,37.64,0.20,(0.52%)\n441,Mgm Resorts International,MGM,0.028601,36.76,0.27,(0.74%)\n442,Ceridian Hcm Holding Inc,CDAY,0.028589,67.38,0.35,(0.52%)\n443,Brown Forman Corp Class B,BF.B,0.028542,56.78,0.14,(0.25%)\n444,Nisource Inc,NI,0.028365,24.84,-0.35,(-1.37%)\n445,Gen Digital Inc,GEN,0.028124,17.83,-0.07,(-0.37%)\n446,C.H. Robinson Worldwide Inc,CHRW,0.028048,86.31,0.02,(0.02%)\n447,Camden Property Trust,CPT,0.027984,94.56,-0.32,(-0.34%)\n448,Charles River Laboratories,CRL,0.027736,195.69,0.75,(0.38%)\n449,Healthpeak Properties Inc,PEAK,0.027617,18.15,0.10,(0.58%)\n450,Caesars Entertainment Inc,CZR,0.027217,47.52,1.54,(3.36%)\n451,Regency Centers Corp,REG,0.027131,59.98,0.85,(1.43%)\n452,Keycorp,KEY,0.0269,10.52,0.22,(2.09%)\n453,Henry Schein Inc,HSIC,0.026715,73.88,0.62,(0.84%)\n454,Globe Life Inc,GL,0.026574,110.04,0.61,(0.56%)\n455,Borgwarner Inc,BWA,0.026416,40.72,0.92,(2.31%)\n456,F5 Inc,FFIV,0.026087,160.33,2.74,(1.74%)\n457,Qorvo Inc,QRVO,0.025849,96.39,1.83,(1.93%)\n458,Teleflex Inc,TFX,0.025796,199.42,2.91,(1.48%)\n459,Allegion Plc,ALLE,0.025545,104.97,1.68,(1.63%)\n460,Westrock Co,WRK,0.025292,35.98,0.23,(0.64%)\n461,Eastman Chemical Co,EMN,0.025003,76.99,2.35,(3.15%)\n462,Wynn Resorts Ltd,WYNN,0.024938,92.21,-0.00,(-0.00%)\n463,Nrg Energy Inc,NRG,0.024681,38.55,-0.03,(-0.08%)\n464,Juniper Networks Inc,JNPR,0.024655,27.92,0.42,(1.52%)\n465,Pinnacle West Capital,PNW,0.02321,73.45,-0.71,(-0.95%)\n466,Hasbro Inc,HAS,0.02308,65.23,0.24,(0.37%)\n467,Catalent Inc,CTLT,0.023069,45.85,0.07,(0.15%)\n468,American Airlines Group Inc,AAL,0.02296,13.00,0.39,(3.05%)\n469,Fmc Corp,FMC,0.022942,66.03,0.02,(0.03%)\n470,Campbell Soup Co,CPB,0.022776,41.15,-0.31,(-0.76%)\n471,Smith (a.O.) Corp,AOS,0.022769,66.99,1.54,(2.35%)\n472,Boston Properties Inc,BXP,0.02269,59.66,0.79,(1.34%)\n473,Huntington Ingalls Industrie,HII,0.022502,204.41,1.22,(0.60%)\n474,Fox Corp Class A,FOXA,0.021902,31.47,0.55,(1.76%)\n475,Robert Half Inc,RHI,0.021872,73.78,0.64,(0.87%)\n476,Assurant Inc,AIZ,0.021618,145.63,-0.13,(-0.09%)\n477,Universal Health Services B,UHS,0.021551,127.00,2.80,(2.25%)\n478,Etsy Inc,ETSY,0.021257,63.53,1.64,(2.65%)\n479,Marketaxess Holdings Inc,MKTX,0.021132,205.89,4.11,(2.04%)\n480,News Corp Class A,NWSA,0.0209,20.00,0.35,(1.76%)\n481,Bio Rad Laboratories A,BIO,0.020548,356.10,3.63,(1.03%)\n482,Bath & Body Works Inc,BBWI,0.020412,33.19,1.04,(3.23%)\n483,Dentsply Sirona Inc,XRAY,0.020079,33.94,-0.17,(-0.51%)\n484,Solaredge Technologies Inc,SEDG,0.020026,132.35,4.34,(3.39%)\n485,Whirlpool Corp,WHR,0.019812,131.66,1.03,(0.79%)\n486,Franklin Resources Inc,BEN,0.019128,24.55,0.28,(1.14%)\n487,Generac Holdings Inc,GNRC,0.018958,110.73,1.84,(1.69%)\n488,Norwegian Cruise Line Holdin,NCLH,0.018812,16.96,0.67,(4.08%)\n489,Federal Realty Invs Trust,FRT,0.018475,91.45,1.05,(1.16%)\n490,Tapestry Inc,TPR,0.01809,28.18,0.23,(0.84%)\n491,Invesco Ltd,IVZ,0.017835,14.31,0.22,(1.53%)\n492,Paramount Global Class B,PARA,0.017208,12.89,0.11,(0.89%)\n493,Vf Corp,VFC,0.015631,16.59,-0.32,(-1.89%)\n494,Comerica Inc,CMA,0.014638,41.07,1.12,(2.81%)\n495,Davita Inc,DVA,0.014395,95.75,0.01,(0.01%)\n496,Zions Bancorp Na,ZION,0.013918,33.96,0.79,(2.39%)\n497,Ralph Lauren Corp,RL,0.013127,115.52,0.26,(0.22%)\n498,Sealed Air Corp,SEE,0.012794,32.20,0.46,(1.46%)\n499,Alaska Air Group Inc,ALK,0.012574,37.04,0.63,(1.73%)\n500,Mohawk Industries Inc,MHK,0.011998,85.15,1.23,(1.46%)\n501,Organon & Co,OGN,0.011665,16.93,0.34,(2.02%)\n502,Dxc Technology Co,DXC,0.011658,20.64,0.29,(1.40%)\n503,Fox Corp Class B,FOX,0.010545,29.16,0.53,(1.85%)\n504,News Corp Class B,NWS,0.006575,20.75,0.36,(1.74%)\n*/\n", "//     Name,Symbol,Last,Change,Change %\",Volume,Turn.,P/E,P/B\",Yield,Market Cap\n\n// prettier-ignore\nexport default [\n    [\"CKH HOLDINGS\",\"00001.HK\",41.900,+1.150,\"+2.822%\",\"5.15M\",\"215.13M\",4.38,0.31,\"6.98%\",\"160.48B\"],\n    [\"CLP HOLDINGS\",\"00002.HK\",57.950,-0.100,\"-0.172%\",\"3.32M\",\"193.19M\",156.62,1.39,\"5.35%\",\"146.41B\"],\n    [\"HK & CHINA GAS\",\"00003.HK\",5.460,+0.130,\"+2.439%\",\"16.16M\",\"88.00M\",19.43,1.66,\"6.41%\",\"101.88B\"],\n    [\"HSBC HOLDINGS,00005.HK\",61.700,+1.100,\"+1.815%\",\"22.19M\",\"1.37B\",10.54,0.86,\"4.05%\",1,\"227.60B\"],\n    [\"POWER ASSETS\",\"00006.HK\",37.900,-0.250,\"-0.655%\",\"4.23M\",\"160.75M\",14.30,0.93,\"7.44%\",\"80.77B\"],\n    [\"HANG SENG BANK\",\"00011.HK\",97.450,+2.950,\"+3.122%\",\"2.54M\",\"247.44M\",19.69,1.01,\"4.21%\",\"186.31B\"],\n    [\"HENDERSON LAND\",\"00012.HK\",20.650,+0.850,\"+4.293%\",\"5.07M\",\"103.70M\",10.81,0.31,\"8.72%\",\"99.97B\"],\n    [\"SHK PPT\",\"00016.HK\",83.800,+3.250,\"+4.035%\",\"8.25M\",\"685.41M\",10.16,0.40,\"5.91%\",\"242.83B\"],\n    [\"NEW WORLD DEV\",\"00017.HK\",15.240,+0.800,\"+5.540%\",\"12.95M\",\"196.19M\",30.48,0.18,\"13.52%\",\"38.35B\"],\n    [\"GALAXY ENT\",\"00027.HK\",47.150,+1.900,\"+4.199%\",\"11.97M\",\"560.21M\",\"No Profit\",3.22,\"0.00%\",\"206.21B\"],\n    [\"MTR CORPORATION\",\"00066.HK\",31.000,+0.800,\"+2.649%\",\"4.68M\",\"144.86M\",19.50,1.07,\"4.23%\",\"192.64B\"],\n    [\"HANG LUNG PPT\",\"00101.HK\",10.720,+0.560,\"+5.512%\",\"7.68M\",\"81.99M\",12.61,0.36,\"7.28%\",\"48.23B\"],\n    [\"GEELY AUTO\",\"00175.HK\",9.240,+0.170,\"+1.874%\",\"18.77M\",\"173.30M\",16.06,1.15,\"2.27%\",\"92.99B\"],\n    [\"ALI HEALTH\",\"00241.HK\",4.880,+0.470,\"+10.658%\",\"53.62M\",\"257.82M\",108.09,3.81,\"0.00%\",\"66.04B\"],\n    [\"CITIC\",\"00267.HK\",7.200,+0.200,\"+2.857%\",\"11.54M\",\"82.96M\",2.78,0.28,\"9.04%\",\"209.45B\"],\n    [\"WH GROUP\",\"00288.HK\",4.110,+0.080,\"+1.985%\",\"18.94M\",\"77.65M\",4.93,0.70,\"7.30%\",\"52.73B\"],\n    [\"CHINA RES BEER\",\"00291.HK\",42.950,+1.200,\"+2.874%\",\"4.83M\",\"207.98M\",28.41,4.57,\"1.41%\",\"139.34B\"],\n    [\"OOIL\",\"00316.HK\",104.500,-0.400,\"-0.381%\",\"296.54K\",\"30.98M\",0.89,0.66,\"78.90%\",\"69.01B\"],\n    [\"TINGYI\",\"00322.HK\",10.940,+0.180,\"+1.673%\",\"2.91M\",\"31.81M\",20.75,4.09,\"9.39%\",\"61.64B\"],\n    [\"SINOPEC CORP\",\"00386.HK\",4.280,-0.010,\"-0.233%\",\"92.43M\",\"396.61M\",6.94,0.58,\"9.36%\",\"105.92B\"],\n    [\"HKEX\",\"00388.HK\",292.600,+9.000,\"+3.173%\",\"4.61M\",\"1.34B\",36.76,7.46,\"2.44%\",\"370.97B\"],\n    [\"TECHTRONIC IND\",\"00669.HK\",76.000,+1.350,\"+1.808%\",\"5.47M\",\"414.78M\",16.54,3.43,\"2.43%\",\"139.45B\"],\n    [\"CHINA OVERSEAS\",\"00688.HK\",16.240,+0.520,\"+3.308%\",\"13.15M\",\"212.60M\",6.76,0.44,\"4.93%\",\"177.74B\"],\n    [\"TENCENT\",\"00700.HK\",306.200,+8.800,\"+2.959%\",\"11.25M\",\"3.43B\",13.74,3.60,\"0.78%\",2,\"926.16B\"],\n    [\"CHINA UNICOM\",\"00762.HK\",5.680,-0.050,\"-0.873%\",\"9.23M\",\"52.77M\",9.16,0.45,\"5.44%\",\"173.80B\"],\n    [\"LINK REIT\",\"00823.HK\",38.400,+1.450,\"+3.924%\",\"12.04M\",\"460.96M\",5.42,0.52,\"7.03%\",\"98.38B\"],\n    [\"CHINA RES POWER\",\"00836.HK\",14.940,+0.320,\"+2.189%\",\"9.91M\",\"147.81M\",10.23,0.87,\"3.92%\",\"71.87B\"],\n    [\"PETROCHINA\",\"00857.HK\",5.900,0.000,\"0.000%\",\"64.23M\",\"380.44M\",6.38,0.70,\"8.08%\",\"124.48B\"],\n    [\"XINYI GLASS\",\"00868.HK\",10.140,+0.170,\"+1.705%\",\"3.75M\",\"38.02M\",8.01,1.30,\"6.11%\",\"42.22B\"],\n    [\"ZHONGSHENG HLDG\",\"00881.HK\",22.050,+1.450,\"+7.039%\",\"6.76M\",\"147.71M\",7.08,1.07,\"4.94%\",\"52.72B\"],\n    [\"CNOOC\",\"00883.HK\",13.780,-0.020,\"-0.145%\",\"26.37M\",\"365.08M\",4.03,0.97,\"19.09%\",\"655.47B\"],\n    [\"CCB\",\"00939.HK\",4.420,+0.060,\"+1.376%\",\"233.61M\",\"1.03B\",3.06,0.35,\"9.93%\",1,\"062.64B\"],\n    [\"CHINA MOBILE\",\"00941.HK\",65.700,+0.250,\"+0.382%\",\"7.82M\",\"516.10M\",9.91,0.96,\"6.71%\",1,\"404.46B\"],\n    [\"LONGFOR GROUP\",\"00960.HK\",14.080,+0.900,\"+6.829%\",\"10.88M\",\"150.68M\",3.06,0.55,\"9.05%\",\"92.81B\"],\n    [\"XINYI SOLAR\",\"00968.HK\",5.860,+0.280,\"+5.018%\",\"15.99M\",\"92.88M\",13.64,1.75,\"3.41%\",\"52.17B\"],\n    [\"SMIC\",\"00981.HK\",20.050,+0.250,\"+1.263%\",\"13.10M\",\"264.32M\",11.17,1.06,\"0.00%\",\"159.31B\"],\n    [\"LENOVO GROUP\",\"00992.HK\",8.070,+0.250,\"+3.197%\",\"33.60M\",\"270.50M\",7.61,2.23,\"4.71%\",\"97.87B\"],\n    [\"CKI HOLDINGS\",\"01038.HK\",37.050,-0.200,\"-0.537%\",\"1.44M\",\"53.73M\",12.03,0.78,\"6.83%\",\"93.35B\"],\n    [\"HENGAN INT'L\",\"01044.HK\",24.950,+0.200,\"+0.808%\",\"2.62M\",\"64.97M\",13.35,1.32,\"6.33%\",\"28.99B\"],\n    [\"CHINA SHENHUA\",\"01088.HK\",25.400,+0.350,\"+1.397%\",\"7.98M\",\"203.11M\",6.14,1.13,\"11.33%\",\"85.79B\"],\n    [\"CSPC PHARMA\",\"01093.HK\",5.740,+0.050,\"+0.879%\",\"29.29M\",\"167.41M\",9.96,2.01,\"3.66%\",\"68.32B\"],\n    [\"SINOPHARM\",\"01099.HK\",22.700,+0.200,\"+0.889%\",\"2.07M\",\"46.80M\",7.37,0.92,\"4.08%\",\"30.46B\"],\n    [\"CHINA RES LAND\",\"01109.HK\",31.200,+1.000,\"+3.311%\",\"9.88M\",\"305.88M\",7.02,0.81,\"5.07%\",\"222.49B\"],\n    [\"CK ASSET\",\"01113.HK\",41.250,+1.250,\"+3.125%\",\"8.57M\",\"352.44M\",6.90,0.39,\"5.53%\",\"146.47B\"],\n    [\"SINO BIOPHARM\",\"01177.HK\",2.830,+0.020,\"+0.712%\",\"26.30M\",\"74.09M\",18.37,1.59,\"4.24%\",\"53.21B\"],\n    [\"CHINA RES MIXC\",\"01209.HK\",31.600,+1.600,\"+5.333%\",\"3.07M\",\"96.42M\",28.97,4.48,\"2.87%\",\"72.13B\"],\n    [\"BYD COMPANY\",\"01211.HK\",242.000,+7.000,\"+2.979%\",\"3.90M\",\"938.50M\",37.57,5.63,\"0.53%\",\"265.72B\"],\n    [\"AIA\",\"01299.HK\",63.850,+0.950,\"+1.510%\",\"38.75M\",\"2.48B\",408.88,2.53,\"2.41%\",\"735.40B\"],\n    [\"CHINAHONGQIAO\",\"01378.HK\",7.670,+0.280,\"+3.789%\",\"13.05M\",\"99.58M\",7.27,0.76,\"6.65%\",\"72.68B\"],\n    [\"ICBC\",\"01398.HK\",3.770,+0.070,\"+1.892%\",\"233.48M\",\"881.67M\",3.45,0.36,\"9.08%\",\"327.21B\"],\n    [\"XIAOMI-W\",\"01810.HK\",12.340,+0.620,\"+5.290%\",\"78.53M\",\"960.98M\",109.39,1.90,\"0.00%\",\"308.83B\"],\n    [\"BUD APAC\",\"01876.HK\",15.460,+0.160,\"+1.046%\",\"16.17M\",\"250.45M\",28.65,2.44,\"1.91%\",\"204.74B\"],\n    [\"SANDS CHINA LTD\",\"01928.HK\",24.000,+0.950,\"+4.121%\",\"19.98M\",\"475.93M\",\"No Profit\",\"N/A\",\"0.00%\",\"194.24B\"],\n    [\"CHOW TAI FOOK\",\"01929.HK\",11.800,+0.280,\"+2.431%\",\"4.88M\",\"57.68M\",21.93,3.64,\"10.34%\",\"118.00B\"],\n    [\"WHARF REIC\",\"01997.HK\",30.250,+1.400,\"+4.853%\",\"4.23M\",\"127.31M\",\"No Profit\",0.48,\"4.33%\",\"91.85B\"],\n    [\"ANTA SPORTS\",\"02020.HK\",88.150,+4.400,\"+5.254%\",\"4.82M\",\"422.51M\",27.71,6.16,\"1.52%\",\"249.70B\"],\n    [\"WUXI BIO\",\"02269.HK\",45.650,+1.550,\"+3.515%\",\"17.91M\",\"811.49M\",38.18,4.88,\"0.00%\",\"194.01B\"],\n    [\"SHENZHOU INTL\",\"02313.HK\",75.000,+4.600,\"+6.534%\",\"5.52M\",\"410.68M\",21.87,3.25,\"2.55%\",\"112.74B\"],\n    [\"PING AN\",\"02318.HK\",44.850,+0.850,\"+1.932%\",\"23.05M\",\"1.03B\",8.28,0.85,\"6.09%\",\"334.02B\"],\n    [\"MENGNIU DAIRY\",\"02319.HK\",26.250,+1.500,\"+6.061%\",\"8.58M\",\"223.15M\",17.34,2.30,\"1.73%\",\"103.42B\"],\n    [\"LI NING\",\"02331.HK\",32.950,+1.500,\"+4.769%\",\"22.54M\",\"738.37M\",18.80,3.16,\"1.58%\",\"86.86B\"],\n    [\"SUNNY OPTICAL\",\"02382.HK\",54.700,+1.050,\"+1.957%\",\"5.62M\",\"308.60M\",22.01,2.44,\"0.91%\",\"60.00B\"],\n    [\"BOC HONG KONG\",\"02388.HK\",21.450,+0.300,\"+1.418%\",\"6.53M\",\"140.32M\",8.38,0.75,\"6.33%\",\"226.79B\"],\n    [\"CHINA LIFE\",\"02628.HK\",12.200,+0.240,\"+2.007%\",\"13.53M\",\"165.07M\",9.49,0.70,\"4.53%\",\"90.78B\"],\n    [\"ENN ENERGY\",\"02688.HK\",65.000,+1.150,\"+1.801%\",\"3.06M\",\"198.69M\",11.08,1.67,\"4.48%\",\"73.53B\"],\n    [\"ZIJIN MINING\",\"02899.HK\",11.980,+0.160,\"+1.354%\",\"16.20M\",\"194.50M\",13.97,3.14,\"1.88%\",\"68.73B\"],\n    [\"MEITUAN-W\",\"03690.HK\",114.600,+3.800,\"+3.430%\",\"19.17M\",\"2.19B\",\"No Profit\",4.89,\"0.00%\",\"715.43B\"],\n    [\"HANSOH PHARMA\",\"03692.HK\",10.660,+0.160,\"+1.524%\",\"17.56M\",\"187.72M\",21.48,2.47,\"0.94%\",\"63.25B\"],\n    [\"CM BANK\",\"03968.HK\",32.700,+0.100,\"+0.307%\",\"11.13M\",\"363.99M\",5.51,0.86,\"6.00%\",\"150.12B\"],\n    [\"BANK OF CHINA\",\"03988.HK\",2.740,+0.050,\"+1.859%\",\"275.47M\",\"754.54M\",3.33,0.33,\"9.55%\",\"229.13B\"],\n    [\"CG SERVICES\",\"06098.HK\",8.080,+0.250,\"+3.193%\",\"16.08M\",\"128.87M\",12.42,0.65,\"5.20%\",\"27.01B\"],\n    [\"JD HEALTH\",\"06618.HK\",40.600,+2.950,\"+7.835%\",\"7.75M\",\"312.36M\",299.91,2.56,\"0.00%\",\"129.12B\"],\n    [\"HAIER SMARTHOME\",\"06690.HK\",24.650,+1.150,\"+4.894%\",\"7.24M\",\"178.37M\",13.83,2.21,\"2.59%\",\"70.46B\"],\n    [\"HAIDILAO\",\"06862.HK\",21.000,+0.600,\"+2.941%\",\"6.86M\",\"143.79M\",74.46,13.94,\"0.55%\",\"117.05B\"],\n    [\"JD-SW\",\"09618.HK\",115.100,+4.000,\"+3.600%\",\"7.43M\",\"852.28M\",30.73,1.50,\"6.38%\",\"360.24B\"],\n    [\"NONGFU SPRING\",\"09633.HK\",45.000,+1.500,\"+3.448%\",\"3.69M\",\"165.62M\",52.49,18.63,\"1.71%\",\"226.56B\"],\n    [\"BIDU-SW\",\"09888.HK\",133.400,+4.600,\"+3.571%\",\"5.82M\",\"772.73M\",47.30,1.50,\"0.00%\",\"377.37B\"],\n    [\"TRIP.COM-S\",\"09961.HK\",279.200,+7.000,\"+2.572%\",\"1.25M\",\"349.59M\",114.05,1.40,\"0.00%\",\"176.65B\"],\n    [\"BABA-SW\",\"09988.HK\",85.600,+2.600,\"+3.133%\",\"34.61M\",\"2.96B\",21.65,1.62,\"0.00%\",1,\"837.13B\"],\n    [\"NTES-S\",\"09999.HK\",159.500,+8.300,\"+5.489%\",\"5.02M\",\"797.10M\",22.70,4.63,\"1.36%\",\"546.99B\"],\n]\n", "import ftse from \"./ftse100\";\nimport nasdaq from \"./nasdaq100\";\nimport sp500 from \"./sp500\";\nimport hsi from \"./hsi\";\nimport { VuuRowDataItemType } from \"packages/vuu-protocol-types\";\n\nconst basketConstituentData = [];\nfor (const row of ftse) {\n  // prettier-ignore\n  const [ric, name, lastTrade, change, volume] = row;\n  const basketId = \".FTSE100\";\n  const side = \"BUY\";\n  const weighting = 1;\n  // prettier-ignore\n  basketConstituentData.push([ basketId, change, name, lastTrade, ric, `${ric}-${basketId}`, side, volume, weighting ]);\n}\n\nfor (const row of hsi) {\n  // prettier-ignore\n  const [name, ric, lastTrade, change, , volume] = row;\n  const basketId = \".HSI\";\n  const side = \"BUY\";\n  const weighting = 1;\n  // prettier-ignore\n  basketConstituentData.push([basketId,change,name, lastTrade,ric,`${ric}-${basketId}`,side,volume,weighting ]);\n}\n\nfor (const row of nasdaq) {\n  // prettier-ignore\n  const [name, ric, weighting, lastTrade, change] = row;\n  const basketId = \".NASDAQ100\";\n  const side = \"BUY\";\n  const volume = 1000;\n  // prettier-ignore\n  basketConstituentData.push([ basketId, change, name, lastTrade, ric, `${ric}-${basketId}`, side, volume, weighting ]);\n}\n\nfor (const row of sp500) {\n  // prettier-ignore\n  const [name, ric, weighting,,change] = row;\n  const basketId = \".SP500\";\n  const side = \"BUY\";\n  const volume = 1000;\n  const lastTrade = 0;\n  // prettier-ignore\n  basketConstituentData.push([ basketId, change, name, lastTrade, ric, `${ric}-${basketId}`, side, volume, weighting ]);\n}\n\nexport default basketConstituentData as VuuRowDataItemType[][];\n", "import { buildDataColumnMap, Table } from \"../../Table\";\nimport { BaseUpdateGenerator } from \"../../UpdateGenerator\";\nimport { schemas } from \"../../simul/simul-schemas\";\nimport basketConstituentData from \"./constituents\";\nimport { initBidAsk, nextRandomDouble, random } from \"../../data-utils\";\n\nexport type ask = number;\nexport type askSize = number;\nexport type bid = number;\nexport type bidSize = number;\nexport type close = number;\nexport type last = number;\nexport type open = number;\nexport type phase = \"C\";\nexport type ric = string;\nexport type scenario = \"close\";\n\nexport type PricesDataRow = [\n  ask,\n  askSize,\n  bid,\n  bidSize,\n  close,\n  last,\n  open,\n  phase,\n  ric,\n  scenario\n];\n\nconst { bid, bidSize, ask, askSize, last } = buildDataColumnMap(schemas.prices);\nconst pricesUpdateGenerator = new BaseUpdateGenerator({\n  bid,\n  bidSize,\n  ask,\n  askSize,\n  last,\n});\n\nconst prices: PricesDataRow[] = [];\n\n// prettier-ignore\nfor (const [,,,lastTrade,ric] of basketConstituentData) {\n  const priceSeed = parseFloat(String(lastTrade));\n  if (!isNaN(priceSeed)){\n  const [bid, ask] = initBidAsk(5,nextRandomDouble)\n  const askSize = random(1000, 3000);\n  const bidSize = random(1000, 3000);\n  const close = priceSeed + random(0, 1) / 10;\n  const last = priceSeed + random(0, 1) / 10;\n  const open = priceSeed + random(0, 1) / 10;\n  const phase = \"C\";\n  const scenario = \"close\";\n  prices.push([\n    ask,\n    askSize,\n    bid,\n    bidSize,\n    close,\n    last,\n    open,\n    phase,\n    ric as string,\n    scenario,\n  ]);\n\n  }\n}\n\nconst pricesTable = new Table(\n  schemas.prices,\n  prices,\n  buildDataColumnMap(schemas.prices),\n  pricesUpdateGenerator\n);\n\nexport default pricesTable;\n", "import {\n  ClientToServerViewportRpcCall,\n  VuuMenu,\n  VuuRowDataItemType,\n} from \"@vuu-ui/vuu-protocol-types\";\nimport { ColumnMap } from \"@vuu-ui/vuu-utils\";\nimport pricesTable from \"./reference-data/prices\";\nimport { joinTables, Table } from \"../Table\";\nimport { TickingArrayDataSource } from \"../TickingArrayDataSource\";\nimport { VuuModule } from \"../vuu-modules\";\nimport { BasketsTableName, schemas } from \"./basket-schemas\";\nimport basketConstituentData from \"./reference-data/constituents\";\n\n// This is a 'local' columnMap\nconst buildDataColumnMap = (tableName: BasketsTableName) =>\n  Object.values(schemas[tableName].columns).reduce<ColumnMap>(\n    (map, col, index) => {\n      map[col.name] = index;\n      return map;\n    },\n    {}\n  );\n\nconst tableMaps: Record<BasketsTableName, ColumnMap> = {\n  algoType: buildDataColumnMap(\"algoType\"),\n  basket: buildDataColumnMap(\"basket\"),\n  basketTrading: buildDataColumnMap(\"basketTrading\"),\n  basketTradingConstituent: buildDataColumnMap(\"basketTradingConstituent\"),\n  basketConstituent: buildDataColumnMap(\"basketConstituent\"),\n  basketTradingConstituentJoin: buildDataColumnMap(\n    \"basketTradingConstituentJoin\"\n  ),\n  priceStrategyType: buildDataColumnMap(\"priceStrategyType\"),\n};\n\n/**\n * BasketConstituent\n */\n\nconst basketConstituent = new Table(\n  schemas.basketConstituent,\n  basketConstituentData,\n  tableMaps.basketConstituent\n);\n\n/**\n * BasketTrading\n */\nconst basketTrading = new Table(\n  schemas.basketTrading,\n  [],\n  tableMaps.basketTrading\n);\n\nlet basketIncrement = 1;\n/**\n * BasketTradingConstituent\n */\nconst basketTradingConstituent = new Table(\n  schemas.basketTradingConstituent,\n  [],\n  tableMaps.basketTradingConstituent\n);\n\n// export as convenience for showcase examples\nexport const createBasketTradingRow = (\n  basketId: string,\n  basketName: string,\n  side = \"BUY\",\n  status = \"OFF MARKET\"\n) => [\n  basketId,\n  basketName,\n  0,\n  1.25,\n  `steve-${basketIncrement++}`,\n  side,\n  status,\n  1_000_000,\n  1_250_000,\n  100,\n];\n\nfunction createTradingBasket(basketId: string, basketName: string) {\n  const basketTradingRow = createBasketTradingRow(basketId, basketName);\n\n  basketTrading.insert(basketTradingRow);\n\n  const { basketId: key } = buildDataColumnMap(\"basketConstituent\");\n  const constituents = basketConstituent.data.filter(\n    (c) => c[key] === basketId\n  );\n\n  constituents.forEach(([, , description, , ric, , , quantity, weighting]) => {\n    const algo = \"\";\n    const algoParams = \"\";\n    const limitPrice = 95;\n    const notionalLocal = 0;\n    const notionalUsd = 0;\n    const pctFilled = 0;\n    const priceSpread = 0;\n    const priceStrategyId = \"\";\n    const side = \"BUY\";\n    const venue = \"venue\";\n\n    const { instanceId } = tableMaps.basketTrading;\n    const basketInstanceId = basketTradingRow[instanceId];\n    const basketTradingConstituentRow: VuuRowDataItemType[] = [\n      algo,\n      algoParams,\n      basketId,\n      description,\n      basketInstanceId,\n      `${basketInstanceId}-${ric}`,\n      limitPrice,\n      notionalLocal,\n      notionalUsd,\n      pctFilled,\n      priceSpread,\n      priceStrategyId,\n      quantity,\n      ric,\n      side,\n      venue,\n      weighting,\n    ];\n    basketTradingConstituent.insert(basketTradingConstituentRow);\n  });\n}\n\nasync function addConstituent(rpcRequest: ClientToServerViewportRpcCall) {\n  console.log(`RPC call erceived ${rpcRequest.rpcName}`);\n}\nasync function sendToMarket(rpcRequest: ClientToServerViewportRpcCall) {\n  const [basketInstanceId] = rpcRequest.params;\n  console.log(`RPC call erceived ${rpcRequest.rpcName} ${basketInstanceId}`);\n}\nasync function takeOffMarket(rpcRequest: ClientToServerViewportRpcCall) {\n  console.log(`RPC call erceived ${rpcRequest.rpcName}`);\n}\n\nasync function createNewBasket(rpcRequest: ClientToServerViewportRpcCall) {\n  const {\n    params: [basketId, basketName],\n  } = rpcRequest;\n  createTradingBasket(basketId, basketName);\n}\n\n//-------------------\n\nexport const tables: Record<BasketsTableName, Table> = {\n  algoType: new Table(\n    schemas.algoType,\n    [\n      [\"Sniper\", 0],\n      [\"Dark Liquidity\", 1],\n      [\"VWAP\", 2],\n      [\"POV\", 3],\n      [\"Dynamic Close\", 4],\n    ],\n    tableMaps.algoType\n  ),\n  basket: new Table(\n    schemas.basket,\n    [\n      [\".NASDAQ100\", \".NASDAQ100\", 0, 0],\n      [\".HSI\", \".HSI\", 0, 0],\n      [\".FTSE100\", \".FTSE100\", 0, 0],\n      [\".SP500\", \".SP500\", 0, 0],\n    ],\n    tableMaps.basket\n  ),\n  basketConstituent,\n  basketTrading,\n  basketTradingConstituent,\n  basketTradingConstituentJoin: joinTables(\n    { module: \"BASKET\", table: \"basketTradingConstituentJoin\" },\n    basketTradingConstituent,\n    pricesTable,\n    \"ric\"\n  ),\n  priceStrategyType: new Table(\n    schemas.priceStrategyType,\n    [\n      [\"Peg to Near Touch\", 0],\n      [\"Far Touch\", 1],\n      [\"Limit\", 2],\n      [\"Algo\", 3],\n    ],\n    tableMaps.priceStrategyType\n  ),\n};\n\nconst menus: Record<BasketsTableName, VuuMenu | undefined> = {\n  algoType: undefined,\n  basket: {\n    name: \"ROOT\",\n    menus: [\n      {\n        context: \"selected-rows\",\n        filter: \"\",\n        name: \"Add Basket\",\n        rpcName: \"CREATE_NEW_BASKET\",\n      },\n    ],\n  },\n  basketConstituent: undefined,\n  basketTrading: undefined,\n  basketTradingConstituent: undefined,\n  basketTradingConstituentJoin: undefined,\n  priceStrategyType: undefined,\n};\n\ntype RpcService = {\n  rpcName: string;\n  service: (rpcRequest: any) => Promise<unknown>;\n};\n\nconst services: Record<BasketsTableName, RpcService[] | undefined> = {\n  algoType: undefined,\n  basket: [\n    {\n      rpcName: \"createBasket\",\n      service: createNewBasket,\n    },\n  ],\n  basketConstituent: undefined,\n  basketTrading: [\n    {\n      rpcName: \"sendToMarket\",\n      service: sendToMarket,\n    },\n    {\n      rpcName: \"takeOffMarket\",\n      service: takeOffMarket,\n    },\n  ],\n  basketTradingConstituent: undefined,\n  basketTradingConstituentJoin: [\n    {\n      rpcName: \"addConstituent\",\n      service: addConstituent,\n    },\n  ],\n  priceStrategyType: undefined,\n};\n\nconst getColumnDescriptors = (tableName: BasketsTableName) => {\n  const schema = schemas[tableName];\n  return schema.columns;\n};\n\nconst createDataSource = (tableName: BasketsTableName) => {\n  const columnDescriptors = getColumnDescriptors(tableName);\n  const { key } = schemas[tableName];\n  return new TickingArrayDataSource({\n    columnDescriptors,\n    dataMap: tableMaps[tableName],\n    keyColumn: key,\n    menu: menus[tableName],\n    rpcServices: services[tableName],\n    table: tables[tableName],\n    // updateGenerator: createUpdateGenerator?.(),\n  });\n};\n\nconst nullTypeaheadHook = async () => [];\n\nconst basketModule: VuuModule<BasketsTableName> = {\n  createDataSource,\n  typeaheadHook: () => nullTypeaheadHook,\n};\n\nexport default basketModule;\n", "import { isinGenerator } from \"@thomaschaplin/isin-generator\";\nimport { currencies } from \"./currencies\";\nimport { locations, suffixes } from \"./locations\";\nimport { lotsizes } from \"./lotsizes\";\nimport { random } from \"../../data-utils\";\nimport { buildDataColumnMap, Table } from \"../../Table\";\nimport { schemas } from \"../simul-schemas\";\n\nexport type bbg = string;\nexport type currency = string;\nexport type ric = string;\nexport type description = string;\nexport type exchange = string;\n// seed for price generation\nexport type price = number;\n\nexport type InstrumentsDataRow = [\n  bbg,\n  currency,\n  description,\n  exchange,\n  string,\n  number,\n  ric,\n  price\n];\n\nexport const InstrumentColumnMap = {\n  bbg: 0,\n  currency: 1,\n  description: 2,\n  exchange: 3,\n  string: 4,\n  number: 5,\n  ric: 6,\n  price: 7,\n} as const;\n\nconst instrumentsData: InstrumentsDataRow[] = [];\n\nconst chars = Array.from(\"ABCEFGHKMNOPQRTUVWYZ\");\n\nconst randomPrice = () => {\n  const price = random(0, 10000);\n  const multiplier = random(1, 10);\n  return price / multiplier;\n};\n\nconst start = performance.now();\n// Create 10_000 Instruments\nfor (const char of chars) {\n  for (let i = 0; i < 10_000; i++) {\n    const char2 = chars[random(0, chars.length - 1)];\n    const char3 = chars[random(0, chars.length - 1)];\n    const char4 = chars[random(0, chars.length - 1)];\n\n    const suffix = suffixes[random(0, suffixes.length - 1)];\n    const ric = char + char2 + char3 + char4 + \".\" + suffix;\n    const bbg = char + char2 + char3 + char4 + \" \" + suffix;\n    const description = `${ric} description`;\n    const currency = currencies[random(0, 4)];\n    const isin = isinGenerator();\n    const lotSize = lotsizes[random(0, lotsizes.length - 1)];\n\n    const exchange = locations[suffix][1];\n    const price = randomPrice();\n\n    instrumentsData.push([\n      bbg,\n      currency,\n      description,\n      exchange,\n      String(isin),\n      lotSize,\n      ric,\n      price,\n    ]);\n  }\n}\nconst end = performance.now();\nconsole.log(`generating 10,000 instruments took ${end - start} ms`);\n\nconst instrumentsTable = new Table(\n  schemas.instruments,\n  instrumentsData,\n  buildDataColumnMap(schemas.instruments)\n);\n\nexport { instrumentsData };\nexport default instrumentsTable;\n", "export const currencies = [\"CAD\", \"GBX\", \"USD\", \"EUR\", \"GBP\"];\n", "export const locations: { [key: string]: string[] } = {\n  L: [\"London PLC\", \"XLON/LSE-SETS\"],\n  N: [\"Corporation\", \"XNGS/NAS-GSM\"],\n  AS: [\"B.V.\", \"XAMS/ENA-MAIN\"],\n  OQ: [\"Co.\", \"XNYS/NYS-MAIN\"],\n  PA: [\"Paris\", \"PAR/EUR_FR\"],\n  MI: [\"Milan\", \"MIL/EUR_IT\"],\n  FR: [\"Frankfurt\", \"FR/EUR_DE\"],\n  AT: [\"Athens\", \"AT/EUR_GR\"],\n};\nexport const suffixes = [\"L\", \"N\", \"OQ\", \"AS\", \"PA\", \"MI\", \"FR\", \"AT\"];\n", "export const lotsizes = [\n  1, 2, 5, 10, 50, 50, 70, 100, 100, 100, 120, 150, 150, 200, 500, 700, 1000,\n  2000, 2500, 5000, 10000,\n];\n", "import { VuuRowDataItemType } from \"@vuu-ui/vuu-protocol-types\";\nimport { random } from \"../../data-utils\";\nimport { buildDataColumnMap, Table } from \"../../Table\";\nimport { schemas } from \"../simul-schemas\";\nimport { instrumentsData } from \"./instruments\";\n\nconst instrumentsExtendedData = instrumentsData.map((row) =>\n  (row as VuuRowDataItemType[])\n    .slice(0, -1)\n    .concat([random(0, 1) === 1, random(0, 1) === 1])\n);\n\nconst instrumentsExtendedTable = new Table(\n  schemas.instrumentsExtended,\n  instrumentsExtendedData,\n  buildDataColumnMap(schemas.instrumentsExtended)\n);\n\nexport default instrumentsExtendedTable;\n", "import { buildDataColumnMap, Table } from \"../../Table\";\nimport { BaseUpdateGenerator } from \"../../UpdateGenerator\";\nimport { schemas } from \"../simul-schemas\";\nimport { instrumentsData, InstrumentColumnMap } from \"./instruments\";\nimport { random } from \"../../data-utils\";\nimport basketConstituentData from \"../../basket/reference-data/constituents\";\n\nexport type ask = number;\nexport type askSize = number;\nexport type bid = number;\nexport type bidSize = number;\nexport type close = number;\nexport type last = number;\nexport type open = number;\nexport type phase = \"C\";\nexport type ric = string;\nexport type scenario = \"close\";\n\nexport type PricesDataRow = [\n  ask,\n  askSize,\n  bid,\n  bidSize,\n  close,\n  last,\n  open,\n  phase,\n  ric,\n  scenario\n];\n\nconst { bid, bidSize, ask, askSize } = buildDataColumnMap(schemas.prices);\nconst pricesUpdateGenerator = new BaseUpdateGenerator({\n  bid,\n  bidSize,\n  ask,\n  askSize,\n});\n\n// const start = performance.now();\n// Create 100_000 Instruments\nconst requiredInstrumentFields = [\"ric\", \"price\"] as const;\nconst pricesData: Array<PricesDataRow> = instrumentsData.map((instrument) => {\n  const { ric, price: priceSeed } = requiredInstrumentFields.reduce(\n    (obj, f) => ({ ...obj, [f]: instrument[InstrumentColumnMap[f]] }),\n    {} as { ric: string; price: number }\n  );\n  const spread = random(0, 10);\n\n  const ask = priceSeed + spread / 2;\n  const askSize = random(1000, 3000);\n  const bid = priceSeed - spread / 2;\n  const bidSize = random(1000, 3000);\n  const close = priceSeed + random(0, 1) / 10;\n  const last = priceSeed + random(0, 1) / 10;\n  const open = priceSeed + random(0, 1) / 10;\n  const phase = \"C\";\n  const scenario = \"close\";\n  return [ask, askSize, bid, bidSize, close, last, open, phase, ric, scenario];\n});\n\n// prettier-ignore\nfor (const [,,,lastTrade,ric] of basketConstituentData) {\n  const priceSeed = parseFloat(String(lastTrade));\n  if (!isNaN(priceSeed)) {\n    const spread = random(0, 10);\n    const ask = priceSeed + spread / 2;\n    const askSize = random(1000, 3000);\n    const bid = priceSeed - spread / 2;\n    const bidSize = random(1000, 3000);\n    const close = priceSeed + random(0, 1) / 10;\n    const last = priceSeed + random(0, 1) / 10;\n    const open = priceSeed + random(0, 1) / 10;\n    const phase = \"C\";\n    const scenario = \"close\";\n    pricesData.push([\n      ask,\n      askSize,\n      bid,\n      bidSize,\n      close,\n      last,\n      open,\n      phase,\n      ric as string,\n      scenario,\n    ]);\n  }\n}\n\n// const end = performance.now();\n// console.log(`generating 100,000 prices took ${end - start} ms`);\n\nconst pricesTable = new Table(\n  schemas.prices,\n  pricesData,\n  buildDataColumnMap(schemas.prices),\n  pricesUpdateGenerator\n);\n\nexport { pricesData };\nexport default pricesTable;\n", "import { TickingArrayDataSource } from \"../TickingArrayDataSource\";\nimport { VuuModule } from \"../vuu-modules\";\nimport instrumentsTable from \"./reference-data/instruments\";\nimport instrumentsExtendedTable from \"./reference-data/instruments-extended\";\nimport pricesTable from \"./reference-data/prices\";\nimport { schemas, SimulTableName } from \"./simul-schemas\";\nimport { buildDataColumnMap, joinTables, Table } from \"../Table\";\nimport { TypeaheadParams } from \"@vuu-ui/vuu-protocol-types\";\nimport { SuggestionFetcher } from \"@vuu-ui/vuu-data-react\";\nimport { makeSuggestions } from \"../makeSuggestions\";\n\nconst tables: Record<SimulTableName, Table> = {\n  childOrders: new Table(\n    schemas.childOrders,\n    [],\n    buildDataColumnMap(schemas.childOrders)\n  ),\n  instruments: instrumentsTable,\n  instrumentsExtended: instrumentsExtendedTable,\n  instrumentPrices: joinTables(\n    { module: \"SIMUL\", table: \"instrumentPrices\" },\n    instrumentsTable,\n    pricesTable,\n    \"ric\"\n  ),\n  orders: new Table(schemas.orders, [], buildDataColumnMap(schemas.orders)),\n  parentOrders: new Table(\n    schemas.parentOrders,\n    [],\n    buildDataColumnMap(schemas.parentOrders)\n  ),\n  prices: pricesTable,\n};\n\nconst getColumnDescriptors = (tableName: SimulTableName) => {\n  const schema = schemas[tableName];\n  if (schema) {\n    return schema.columns;\n  } else {\n    throw Error(`simul-module no schema found for table SIMUL ${tableName}`);\n  }\n};\n\nconst createDataSource = (tableName: SimulTableName) => {\n  const columnDescriptors = getColumnDescriptors(tableName);\n  return new TickingArrayDataSource({\n    columnDescriptors,\n    keyColumn: schemas[tableName].key,\n    table: tables[tableName],\n    // menu: menus[tableName],\n    // rpcServices: services[tableName],\n  });\n};\n\nconst suggestionFetcher: SuggestionFetcher = ([\n  vuuTable,\n  column,\n  pattern,\n]: TypeaheadParams) => {\n  const table = tables[vuuTable.table as SimulTableName];\n  if (table) {\n    return makeSuggestions(table, column, pattern);\n  } else {\n    throw Error(\n      `SIMUL suggestionFetcher, unknown table ${vuuTable.module} ${vuuTable.table}`\n    );\n  }\n};\n\nconst simulModule: VuuModule<SimulTableName> = {\n  createDataSource,\n  typeaheadHook: () => suggestionFetcher,\n};\n\nexport default simulModule;\n", "import { DataSource } from \"@vuu-ui/vuu-data\";\nimport { SuggestionFetcher } from \"packages/vuu-data-react/src\";\nimport basketModule from \"./basket/basket-module\";\nimport { BasketsTableName } from \"./basket/basket-schemas\";\nimport simulModule from \"./simul/simul-module\";\nimport { SimulTableName } from \"./simul/simul-schemas\";\n\nexport type VuuModuleName = \"BASKET\" | \"SIMUL\";\n\nexport interface VuuModule<T extends string = string> {\n  createDataSource: (tableName: T) => DataSource;\n  typeaheadHook: () => SuggestionFetcher;\n}\n\nconst vuuModules: Record<\n  VuuModuleName,\n  VuuModule<BasketsTableName> | VuuModule<SimulTableName>\n> = {\n  BASKET: basketModule,\n  SIMUL: simulModule,\n};\n\nexport const vuuModule = <T extends string = string>(\n  moduleName: VuuModuleName\n) => vuuModules[moduleName] as VuuModule<T>;\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA,iFAAAA,SAAA;AAAA,IAAAA,QAAA;AAAA,MACI;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACJ;AAAA;AAAA;;;;;;;;AC1PO,QAAM,+BAA+B,SAAC,OAAa;AACxD,aAAA,SAAS,OAAO,EAAE;IAAlB;AADW,YAAA,+BAA4B;;;;;;;;;;ACAlC,QAAM,QAAQ,SAAC,OAAa;AAAc,aAAA,QAAQ,MAAM;IAAd;AAApC,YAAA,QAAK;;;;;;;;;;ACAlB,QAAA,sCAAA;AACA,QAAA,WAAA;AAEO,QAAM,yBAAyB,SAAC,OAAa;AAClD,UAAM,cAAc,MAAM;AAC1B,UAAI;AACJ,UAAI,QAAQ;AACZ,UAAI;AAEJ,eAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,uBAAe,MAAM,CAAC;AAEtB,YAAM,0BAAyB,GAAA,oCAAA,8BAA6B,YAAY;AAExE,YAAI,0BAA0B,MAAM,sBAAsB,IACtD,aAAa,WAAW,CAAC,IAAI,IAAI,WAAW,CAAC,IAAI,KACjD;AAEJ,aAAI,GAAA,SAAA,OAAM,CAAC,GAAG;AACZ,oCAA0B,0BAA0B;;AAGtD,gBAAQ,QAAQ,KAAK,MAAM,0BAA0B,EAAE,IACpD,0BAA0B;;AAE/B,eAAS,KAAM,QAAQ,MAAO;AAC9B,aAAO;IACT;AAxBa,YAAA,yBAAsB;;;;;;;;;;ACHtB,YAAA,WAAW;MACtB;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;;;;;;;;;;;ACxBW,YAAA,iBAAiB;MAC5B;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACVF,QAAA,aAAA;AACA,QAAA,qBAAA;AAEa,YAAA,eAAY,cAAA,cAAA,CAAA,GAAA,OAAO,WAAA,QAAQ,GAAA,KAAA,GAAA,OAAK,mBAAA,cAAc,GAAA,KAAA;;;;;;;;;;ACH3D,QAAA,wBAAA;AAEO,QAAM,6BAA6B,WAAA;AACxC,aAAA,sBAAA,aAAa,KAAK,MAAM,KAAK,OAAM,IAAK,sBAAA,aAAa,MAAM,CAAC;IAA5D;AADW,YAAA,6BAA0B;;;;;;;;;;ACFvC,QAAA,iCAAA;AAEO,QAAM,0CAA0C,WAAA;AACrD,UAAI,SAAS;AACb,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,iBAAS,UAAS,GAAA,+BAAA,4BAA0B;;AAE9C,aAAO;IACT;AANa,YAAA,0CAAuC;;;;;;;;;;ACF7C,QAAM,8BAA8B,WAAA;AACzC,aAAA,KAAK,MAAM,KAAK,OAAM,IAAK,EAAE;IAA7B;AADW,YAAA,8BAA2B;;;;;;;;;;ACAxC,QAAA,oCAAA;AAEO,QAAM,qCAAqC,WAAA;AAChD,UAAI,SAAS;AACb,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,iBAAS,UAAS,GAAA,kCAAA,6BAA2B;;AAE/C,aAAO;IACT;AANa,YAAA,qCAAkC;;;;;;;;;;ACF/C,QAAA,iDAAA;AACA,QAAA,6CAAA;AAEO,QAAM,gCAAgC,WAAA;AAC3C,UAAM,uBAAsB,GAAA,2CAAA,oCAAkC;AAC9D,UAAM,4BAA2B,GAAA,+CAAA,yCAAuC;AACxE,aAAO,sBAAsB;IAC/B;AAJa,YAAA,gCAA6B;;;;;;;;;;ACH1C,QAAA,8BAAA;AACA,QAAA,sCAAA;AAEO,QAAM,gBAAgB,WAAA;AAC3B,UAAM,SAAQ,GAAA,oCAAA,+BAA6B;AAC3C,UAAM,SAAQ,GAAA,4BAAA,wBAAuB,KAAK;AAE1C,aAAO,QAAQ;IACjB;AALa,YAAA,gBAAa;;;;;;;;;;ACH1B,QAAA,mBAAA;AAAS,WAAA,eAAA,SAAA,iBAAA,EAAA,YAAA,MAAA,KAAA,WAAA;AAAA,aAAA,iBAAA;IAAa,EAAA,CAAA;;;;;ACAtB;AAAA;AAAA;AAEA,QAAM,eAAe;AACrB,QAAM,QAAQ,gBAA0C,cAAc;AAGtE,QAAM,eAAe,CAAAC,WAAS;AAC1B,UAAI,OAAO,aAAa,KAAK,MAAM,KAAK,OAAO,IAAI,aAAa,MAAM,CAAC;AACvE,UAAI,OAAO,OAAOA,SAAQ,uBAAuB,OAAOA,SAAQ,GAAG;AACnE,aAAO;AAAA,IACX;AAEA,QAAM,yBAAyB,UAAQ;AACnC,UAAI,KAAK,UAAU;AAAI,eAAO;AAC9B,UAAI,IAAI,CAAC;AACT,eAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACvC,YAAI,IAAI,KAAK,OAAO,CAAC;AACrB,YAAI,MAAM,CAAC,GAAG;AACV,cAAI,aAAa,KAAK,WAAW,CAAC,IAAI;AACtC,YAAE,KAAK,aAAa,EAAE;AACtB,cAAI,aAAa,GAAG;AAChB,cAAE,KAAK,KAAK,MAAM,aAAa,EAAE,CAAC;AAAA,UACtC;AAAA,QACJ,OAAO;AACH,YAAE,KAAK,OAAO,CAAC,CAAC;AAAA,QACpB;AAAA,MACJ;AACA,UAAI,MAAM;AACV,UAAI,IAAI,EAAE;AACV,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,YAAI,IAAI,KAAK,GAAG;AACZ,cAAI,IAAI,EAAE,CAAC,IAAI;AACf,iBAAO,KAAK,MAAM,IAAI,EAAE;AACxB,iBAAO,IAAI;AAAA,QACf,OAAO;AACH,iBAAO,EAAE,CAAC;AAAA,QACd;AAAA,MACJ;AACA,cAAQ,KAAM,MAAM,MAAO;AAAA,IAC/B;AAGA,YAAQ,gBAAgB,SAASC,iBAAgB;AAC7C,aAAO,aAAa,KAAK;AAAA,IAC7B;AAAA;AAAA;;;AC5CA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAAAC;AAAA,EAAA;AAAA;AAAA;;;ACWO,IAAM,UAET;AAAA,EACF,UAAU;AAAA,IACR,SAAS;AAAA,MACP,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,MAAM,gBAAgB,MAAM;AAAA,IACtC;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,WAAW;AAAA,EAC/C;AAAA,EACA,QAAQ;AAAA,IACN,SAAS;AAAA,MACP,EAAE,MAAM,MAAM,gBAAgB,SAAS;AAAA,MACvC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,oBAAoB,gBAAgB,SAAS;AAAA,IACvD;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,SAAS;AAAA,EAC7C;AAAA,EACA,mBAAmB;AAAA,IACjB,SAAS;AAAA,MACP,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,MAC9C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,IAChD;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,oBAAoB;AAAA,EACxD;AAAA,EACA,eAAe;AAAA,IACb,SAAS;AAAA,MACP,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,MAC9C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,oBAAoB,gBAAgB,SAAS;AAAA,MACrD,EAAE,MAAM,SAAS,gBAAgB,MAAM;AAAA,IACzC;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,gBAAgB;AAAA,EACpD;AAAA,EACA,0BAA0B;AAAA,IACxB,SAAS;AAAA,MACP,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,MAC9C,EAAE,MAAM,eAAe,gBAAgB,MAAM;AAAA,MAC7C,EAAE,MAAM,mBAAmB,gBAAgB,MAAM;AAAA,MACjD,EAAE,MAAM,YAAY,gBAAgB,OAAO;AAAA,MAC3C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,IAChD;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,2BAA2B;AAAA,EAC/D;AAAA,EAEA,8BAA8B;AAAA,IAC5B,SAAS;AAAA,MACP,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,MAC9C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,eAAe,gBAAgB,MAAM;AAAA,MAC7C,EAAE,MAAM,mBAAmB,gBAAgB,MAAM;AAAA,MACjD,EAAE,MAAM,YAAY,gBAAgB,OAAO;AAAA,MAC3C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,IAChD;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,+BAA+B;AAAA,EACnE;AAAA,EACA,mBAAmB;AAAA,IACjB,SAAS;AAAA,MACP,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,MAAM,gBAAgB,MAAM;AAAA,IACtC;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,oBAAoB;AAAA,EACxD;AACF;;;ACnHO,IAAMC,WACX;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,MACP,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,WAAW,gBAAgB,MAAM;AAAA,MACzC,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,IAC1C;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,cAAc;AAAA,EACjD;AAAA,EACA,qBAAqB;AAAA,IACnB,SAAS;AAAA,MACP,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,WAAW,gBAAgB,MAAM;AAAA,MACzC,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,aAAa,gBAAgB,UAAU;AAAA,MAC/C,EAAE,MAAM,YAAY,gBAAgB,UAAU;AAAA,IAChD;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,cAAc;AAAA,EACjD;AAAA,EACA,kBAAkB;AAAA,IAChB,SAAS;AAAA,MACP,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA;AAAA,MAC5C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,WAAW,gBAAgB,MAAM;AAAA,MACzC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,IAC/C;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,mBAAmB;AAAA,EACtD;AAAA,EACA,QAAQ;AAAA,IACN,SAAS;AAAA,MACP,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,OAAO;AAAA,MAC1C,EAAE,MAAM,kBAAkB,gBAAgB,SAAS;AAAA,MACnD,EAAE,MAAM,cAAc,gBAAgB,OAAO;AAAA,MAC7C,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,IAC7C;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,SAAS;AAAA,EAC5C;AAAA,EACA,aAAa;AAAA,IACX,SAAS;AAAA,MACP,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,gBAAgB,gBAAgB,SAAS;AAAA,MACjD,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,MAC9C,EAAE,MAAM,MAAM,gBAAgB,SAAS;AAAA,MACvC,EAAE,MAAM,WAAW,gBAAgB,MAAM;AAAA,MACzC,EAAE,MAAM,cAAc,gBAAgB,OAAO;AAAA,MAC7C,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,YAAY,gBAAgB,MAAM;AAAA,IAC5C;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,cAAc;AAAA,EACjD;AAAA,EACA,cAAc;AAAA,IACZ,SAAS;AAAA,MACP,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,gBAAgB,gBAAgB,SAAS;AAAA,MACjD,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,cAAc,gBAAgB,MAAM;AAAA,MAC5C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,MAC9C,EAAE,MAAM,MAAM,gBAAgB,SAAS;AAAA,MACvC,EAAE,MAAM,WAAW,gBAAgB,MAAM;AAAA,MACzC,EAAE,MAAM,cAAc,gBAAgB,OAAO;AAAA,MAC7C,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,YAAY,gBAAgB,MAAM;AAAA,IAC5C;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,eAAe;AAAA,EAClD;AAAA,EACA,QAAQ;AAAA,IACN,SAAS;AAAA,MACP,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA;AAAA,MAC5C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,IAC/C;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,SAAS;AAAA,EAC5C;AACF;;;ACpIK,IAAMC,WAA6C;AAAA,EACxD,GAAG;AAAA,EACH,GAAGA;AACL;AAEA,IAAM,aAAoE;AAAA,EACxE,GAAG;AAAA,EACH,GAAGA;AACL;AAEO,IAAM,gBAAgB,MAAMA;AAE5B,IAAM,YAAY,CAAC,cAA4B;AACpD,MAAI,WAAW,SAAS,GAAG;AACzB,WAAO,WAAW,SAAS;AAAA,EAC7B;AACA,QAAM,MAAM,iCAAiC,WAAW;AAC1D;;;ACUO,SAAS,oBACd,cACA,UACA,kBACA;AACA,MAAI,aAAa,WAAW,SAAS,QAAQ;AAC3C,WAAO;AAAA,EACT;AACA,MAAI,qBAAqB,QAAW;AAClC,WAAO,aAAa,KAAK,CAAC,MAAM,UAAU,SAAS,KAAK,MAAM,IAAI;AAAA,EACpE,OAAO;AACL,WAAO,aAAa;AAAA,MAClB,CAAC,aAAa,UACX,SAAS,KAAK,EAAiC,gBAAgB,MAC/D,YAA2C,gBAAgB;AAAA,IAChE;AAAA,EACF;AACF;AA6CO,IAAM,gBAAgB,CAAI,QAAyB,cAAmB;AAC3E,QAAM,QAAQ,CAAC,MAAS,EAAC,iCAAQ,SAAS;AAC1C,MAAI,WAAW,QAAW;AACxB,WAAO;AAAA,EACT,WAAW,UAAU,KAAK,KAAK,GAAG;AAChC,WAAO,UAAU,OAAO,KAAK;AAAA,EAC/B,OAAO;AACL,WAAO,CAAC;AAAA,EACV;AACF;AAEO,IAAM,kBAAkB,CAC7B,aACA,OACA,aAEA,MAAM,OAAO,CAAC,MAAM,YAAY,UAAU,CAAC,MAAM,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE;;;ACrG5E,IAAM,uBAAuB,oBAAI,IAA+B;AAAA,EAC9D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AASM,IAAM,sBAAsB,CACjC,MAEA,MAAM,UACN,qBAAqB,IAAI,EAAE,EAA+B;AAOrD,IAAM,qBAAqB,CAChC,MACgC,MAAM,UAAa,EAAE,OAAO;AAcvD,SAAS,oBACd,GACwB;AACxB,SAAO,MAAM,WAAc,EAAE,OAAO,SAAS,EAAE,OAAO;AACxD;;;AC0BO,IAAM,gBAAgB,CAC3B,WACsC;AACtC,SAAO,OAAQ,OAAmC,QAAQ;AAC5D;AA4FA,IAAM,mBAAmB,CAAC;AAiCnB,SAAS,eACd,SACW;AACX,QAAMC,SAAQ,aAAa;AAC3B,MAAI,SAAS;AACX,WAAO,QAAQ,OAAO,CAAC,KAAK,QAAQ,MAAM;AACxC,UAAI,OAAO,WAAW,UAAU;AAC9B,YAAI,MAAM,IAAIA,SAAQ;AAAA,MACxB,WAAW,cAAc,MAAM,GAAG;AAChC,YAAI,OAAO,IAAI,IAAI,OAAO;AAAA,MAC5B,OAAO;AACL,YAAI,OAAO,IAAI,IAAIA,SAAQ;AAAA,MAC7B;AACA,aAAO;AAAA,IACT,GAAG,CAAC,CAAc;AAAA,EACpB,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAaO,IAAM,eAAe;AAAA,EAC1B,KAAK;AAAA,EACL,YAAY;AAAA,EACZ,SAAS;AAAA,EACT,aAAa;AAAA,EACb,OAAO;AAAA,EACP,OAAO;AAAA,EACP,KAAK;AAAA,EACL,UAAU;AAAA,EACV,OAAO;AAAA;AAAA,EAEP,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,cAAc;AAAA,EACd,iBAAiB;AACnB;AA0dA,IAAM,EAAE,OAAO,QAAQ,IAAI;;;ACnuBpB,IAAM,iBAAiB,CAAC,SAA8C;AAA7E;AACE,QAAI,gBAAW,aAAX,mBAAqB,YAAW,QAAW;AAC7C,YAAO,gBAAW,SAAS,OACxB,MAAM,IAAI,EACV,KAAK,CAAC,QAAQ,IAAI,WAAW,GAAG,OAAO,CAAC,MAFpC,mBAGH,MAAM,KAAK;AAAA,EACjB;AACF;;;ACKO,IAAM,aAAuB,EAAE,MAAM,GAAG,IAAI,EAAE;AAoC9C,SAAS,WAAW,EAAE,MAAM,IAAI,aAAa,EAAE,GAAuB;AAC3E,SAAO;AAAA,IACL,MAAM;AAAA,IACN,IAAI,KAAK;AAAA,IACT;AAAA,IACA,OAAO;AAAA,EACT;AACF;AAcO,IAAM,gBAAgB,CAC3B,EAAE,MAAM,OAAO,IAAI,IAAI,GACvB,aACa;AACb,QAAM,EAAE,MAAM,OAAO,IAAI,IAAI,IAAI;AACjC,QAAM,YAAY,SAAS,OAAO,OAAO;AACzC,QAAM,sBAAsB,QAAQ,SAAS,MAAM;AACnD,SAAO,aAAa,sBAChB,WACA,MAAM,MACN,EAAE,MAAM,KAAK,IAAI,IAAI,IACrB,EAAE,MAAM,OAAO,IAAI,MAAM;AAC/B;;;ACvDA,IAAM,EAAE,IAAI,IAAI;;;ACjBhB,IAAM,wBAAoD;AAAA,EACxD,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,QAAQ;AACV;AACA,IAAM,6BAAwE;AAAA,EAC5E,YAAY;AAAA,IACV,QAAQ;AAAA,IACR,SAAS,EAAE,GAAG,uBAAuB,QAAQ,MAAM;AAAA,EACrD;AAAA,EACA,cAAc;AAAA,IACZ,QAAQ;AAAA,IACR,SAAS,EAAE,GAAG,uBAAuB,QAAQ,KAAK;AAAA,EACpD;AACF;AAGA,IAAM,wBAAoD;AAAA,EACxD,KAAK;AAAA,EACL,OAAO;AAAA,EACP,MAAM;AACR;AACA,IAAM,6BAAwE;AAAA,EAC5E,cAAc;AAAA,IACZ,QAAQ;AAAA,IACR,SAAS,EAAE,GAAG,sBAAsB;AAAA,IACpC,eAAe,CAAC,MAAM,EAAE,WAAW,KAAK,GAAG;AAAA,EAC7C;AAAA,EACA,cAAc,EAAE,QAAQ,SAAS,SAAS,EAAE,GAAG,sBAAsB,EAAE;AAAA,EACvE,eAAe;AAAA,IACb,QAAQ;AAAA,IACR,SAAS,EAAE,GAAG,uBAAuB,OAAO,QAAQ;AAAA,EACtD;AAAA,EACA,gBAAgB;AAAA,IACd,QAAQ;AAAA,IACR,SAAS,EAAE,GAAG,uBAAuB,OAAO,OAAO;AAAA,EACrD;AAAA,EACA,cAAc,EAAE,QAAQ,SAAS,SAAS,EAAE,GAAG,sBAAsB,EAAE;AAAA,EACvE,gBAAgB;AAAA,IACd,QAAQ;AAAA,IACR,SAAS,EAAE,GAAG,uBAAuB,OAAO,QAAQ;AAAA,EACtD;AAAA,EACA,iBAAiB;AAAA,IACf,QAAQ;AAAA,IACR,SAAS,EAAE,GAAG,uBAAuB,OAAO,OAAO;AAAA,EACrD;AACF;AAEA,IAAM,iCAGF,EAAE,GAAG,4BAA4B,GAAG,2BAA2B;;;AC9BnE,IAAM,YAAY,CAAC,SAAS,QAAQ,QAAQ,OAAO;AACnD,IAAM,kBAAkB,CAAC,UACvB,OAAO,UAAU,YAAY,UAAU,SAAS,KAAK;AAEvD,IAAM,oBAA8B;AAIpC,IAAM,QAAQ,MAAM;AAEpB,IAAM,sBACJ,QAAwC,UAAU;AAEpD,IAAM,EAAE,eAAe,oBAAoB,IAAI,mBAAmB;AAK3D,IAAM,SAAS,CAAC,aAAqB;AAC1C,QAAMC,gBAAe,iBAAiB;AACtC,QAAM,cAAcA,iBAAgB,iBAAiB;AACrD,QAAM,cAAc,eAAe,iBAAiB;AACpD,QAAM,eAAe,eAAe,iBAAiB;AAErD,QAAMC,QAAO,cACT,CAAC,YAAoB,QAAQ,KAAK,IAAI,aAAa,SAAS,IAC5D;AACJ,QAAM,OAAO,cACT,CAAC,YAAoB,QAAQ,KAAK,IAAI,aAAa,SAAS,IAC5D;AACJ,QAAMC,SAAQF,gBACV,CAAC,YAAoB,QAAQ,MAAM,IAAI,aAAa,SAAS,IAC7D;AACJ,QAAM,QAAQ,eACV,CAAC,YAAoB,QAAQ,MAAM,IAAI,aAAa,SAAS,IAC7D;AAEJ,MAAI,OAAuC;AACzC,WAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF,OAAO;AACL,WAAO;AAAA,MACL,cAAAA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,MAAAC;AAAA,MACA;AAAA,MACA,OAAAC;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,qBAAqB;AAC5B,MAAI,OAAO,oBAAoB,aAAa;AAC1C,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,MACL,cAAc,0BAA0B;AAAA,IAC1C;AAAA,EACF;AACF;AAEA,SAAS,4BAAsC;AAC7C,QAAM,QAAQ,eAAe,mBAAmB;AAChD,MAAI,gBAAgB,KAAK,GAAG;AAC1B,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAEO,IAAM,4BAA4B,MAAM;AAC7C,SAAO,4CAA4C,0BAA0B;AAC/E;;;ACxGA,IAAM,EAAE,OAAO,aAAa,IAAI,OAAO,eAAe;;;ACAtD,SAAS,mBACP,WAC8B;AAC9B,SAAO,MAAM,QAAQ,SAAS;AAChC;AAEA,SAAS,eACP,WAC4B;AAC5B,SAAO,CAAC,MAAM,QAAQ,SAAS;AACjC;AAbA;AAeO,IAAM,eAAN,MAAiD;AAAA,EAAjD;AACL,gCAAoD,oBAAI,IAAI;AAAA;AAAA,EAE5D,YAAoC,OAAU,UAAqB;AACjE,UAAM,YAAY,mBAAK,SAAQ,IAAI,KAAK;AAExC,QAAI,CAAC,WAAW;AACd,yBAAK,SAAQ,IAAI,OAAO,QAAQ;AAAA,IAClC,WAAW,mBAAmB,SAAS,GAAG;AACxC,gBAAU,KAAK,QAAQ;AAAA,IACzB,WAAW,eAAe,SAAS,GAAG;AACpC,yBAAK,SAAQ,IAAI,OAAO,CAAC,WAAW,QAAQ,CAAC;AAAA,IAC/C;AAAA,EACF;AAAA,EAEA,eAAuC,OAAU,UAAqB;AACpE,QAAI,CAAC,mBAAK,SAAQ,IAAI,KAAK,GAAG;AAC5B;AAAA,IACF;AAEA,UAAM,sBAAsB,mBAAK,SAAQ,IAAI,KAAK;AAClD,QAAI,WAAW;AAEf,QAAI,wBAAwB,UAAU;AACpC,yBAAK,SAAQ,OAAO,KAAK;AAAA,IAC3B,WAAW,MAAM,QAAQ,mBAAmB,GAAG;AAC7C,eAAS,IAAI,QAAQ,MAAM,KAAK;AAC9B,YAAI,oBAAoB,CAAC,MAAM,UAAU;AACvC,qBAAW;AACX;AAAA,QACF;AAAA,MACF;AAEA,UAAI,WAAW,GAAG;AAChB;AAAA,MACF;AAEA,UAAI,oBAAoB,WAAW,GAAG;AACpC,4BAAoB,SAAS;AAC7B,2BAAK,SAAQ,OAAO,KAAK;AAAA,MAC3B,OAAO;AACL,4BAAoB,OAAO,UAAU,CAAC;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,mBAA2C,OAAW;AACpD,QAAI,SAAS,mBAAK,SAAQ,IAAI,KAAK,GAAG;AACpC,yBAAK,SAAQ,OAAO,KAAK;AAAA,IAC3B,WAAW,UAAU,QAAW;AAC9B,yBAAK,SAAQ,MAAM;AAAA,IACrB;AAAA,EACF;AAAA,EAEA,KAA6B,UAAa,MAA6B;AACrE,QAAI,mBAAK,UAAS;AAChB,YAAM,UAAU,mBAAK,SAAQ,IAAI,KAAK;AACtC,UAAI,SAAS;AACX,aAAK,cAAc,SAAS,IAAI;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,KAA6B,OAAU,UAAqB;AAC1D,UAAM,UAAW,IAAI,SAAS;AAC5B,WAAK,eAAe,OAAO,OAAO;AAClC,eAAS,GAAG,IAAI;AAAA,IAClB;AAEA,SAAK,GAAG,OAAO,OAAO;AAAA,EACxB;AAAA,EAEA,GAA2B,OAAU,UAAqB;AACxD,SAAK,YAAY,OAAO,QAAQ;AAAA,EAClC;AAAA,EAEA,YAAoC,OAAU,UAAqB;AACjE,UAAM,YAAY,mBAAK,SAAQ,IAAI,KAAK;AACxC,QAAI,MAAM,QAAQ,SAAS,GAAG;AAC5B,aAAO,UAAU,SAAS,QAAQ;AAAA,IACpC,OAAO;AACL,aAAO,cAAc;AAAA,IACvB;AAAA,EACF;AAAA,EAEQ,cAAc,SAAqC,MAAiB;AAC1E,QAAI,mBAAmB,OAAO,GAAG;AAC/B,cAAQ,MAAM,EAAE,QAAQ,CAAC,aAAa,KAAK,cAAc,UAAU,IAAI,CAAC;AAAA,IAC1E,OAAO;AACL,cAAQ,KAAK,QAAQ;AAAA,QACnB,KAAK;AACH,kBAAQ;AACR;AAAA,QACF,KAAK;AACH,kBAAQ,KAAK,CAAC,CAAC;AACf;AAAA,QACF,KAAK;AACH,kBAAQ,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AACxB;AAAA,QAEF;AACE,kBAAQ,KAAK,MAAM,GAAG,IAAI;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AACF;AAxGE;;;AChBF,IAAM,kBAAkB,OAAO,aAAa,IAAI;AAChD,IAAM,YAAY,OAAO,aAAa,IAAI;AAU1C,IAAM,QAAgB;AAAA,EACpB,OAAO;AAAA,EACP,YAAY,YAAY;AAAA,EACxB,cAAc,YAAY,YAAY;AAAA,EACtC,cAAc;AAAA,IACZ;AAAA,IACA,kBAAkB;AAAA,IAClB,kBAAkB,YAAY;AAAA,IAC9B,kBAAkB,YAAY,YAAY;AAAA,IAC1C,kBAAkB,YAAY,YAAY,YAAY;AAAA,EACxD;AACF;AAaA,IAAM,eACJ,YACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA;;;ACpCF,IAAM,EAAE,MAAM,IAAI;AAgBlB,IAAM,aAAa,CAAC,UAClB,OAAO,UAAU,YAAY,UAAU;AAEzC,IAAM,sBAAsB,CAAC,WAAW,UAAU,QAAQ;AAC1D,IAAM,mBAAmB,CAAC,UACxB,oBAAoB,SAAS,OAAO,KAAK;AAC3C,IAAM,oBAAoB,CAAC,UACzB,OAAO,UAAU,YACb,YACA,OAAO,UAAU,WACjB,WACA;AAEN,IAAM,eAAe,CACnB,WACA,mBACc;AACd,MAAI,WAAW,cAAc,GAAG;AAC9B,WAAO,EAAE,WAAW,GAAG,cAAc,gBAAgB,IAAI,MAAM,OAAO;AAAA,EACxE,WAAW,mBAAmB,QAAW;AACvC,WAAO;AAAA,MACL;AAAA,MACA,gBAAgB;AAAA,MAChB,MAAM;AAAA,IACR;AAAA,EACF,WAAW,iBAAiB,cAAc,GAAG;AAC3C,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,MAAM,kBAAkB,cAAc;AAAA,IACxC;AAAA,EACF,OAAO;AACL,UAAM,MAAM,oBAAoB,OAAO,wBAAwB;AAAA,EACjE;AACF;AAEA,IAAM,iBAAuC;AAAA,EAC3C,MAAM;AAAA,EACN,UAAU;AAAA,IACR,MAAM;AAAA,EACR;AACF;AAEO,IAAM,uBAAuB,CAClC,SAC0C;AAC1C,QAAM,OAA2B,CAAC;AAElC,OAAK;AAAA,IACH;AAAA,MACE,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,IACA;AAAA,MACE,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAEA,QAAM,OAAwB,CAAC;AAE/B,iBAAe,MAAM,MAAM,IAAI;AAC/B,SAAO,CAAC,MAAM,IAAI;AACpB;AAEA,IAAM,iBAAiB,CACrB,MACA,MACA,MACA,QAAe,EAAE,OAAO,EAAE,GAC1B,UAAU,SACV,QAAQ,MACa;AACrB,MAAI,YAAY;AAChB,MAAI,WAAW;AACf,MAAI,UAAU,KAAK,SAAS,GAAG;AAC7B,SAAK,KAAK;AAAA,MACR,MAAM,OAAO,KAAK,SAAS;AAAA,MAC3B,QAAQ;AAAA,MACR,MAAM;AAAA,IACR,CAAC;AAAA,EACH;AACA,QAAM,gBAAgB,OAAO,QAAQ,IAAI;AACzC,WAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK,MAAM,SAAS,GAAG;AAC/D,UAAM,CAAC,KAAK,KAAK,IAAI,cAAc,CAAC;AACpC,UAAM,EAAE,WAAW,gBAAgB,KAAK,IAAI,aAAa,KAAK,KAAK;AACnE,UAAM,SAAS,SAAS;AACxB,UAAM,SAAS,MAAM,KAAK,EAAE,KAAK,EAAE;AACnC,UAAM,UAAU,GAAG,WAAW;AAE9B,UAAM,MAAM,CAAC,MAAM,OAAO,MAAM,OAAO,QAAO,OAAM,OAAM,GAAE,SAAQ,GAAG,GAAG,QAAQ,WAAW,cAAe;AAC5G,SAAK,KAAK,GAAG;AACb,gBAAY;AAEZ,QAAI,WAAW,KAAK,GAAG;AACrB,YAAM,CAAC,iBAAiB,cAAc,IAAI;AAAA,QACxC;AAAA,QACA;AAAA,QACA;AAAA,QACA,EAAE,OAAO,MAAM,QAAQ,EAAE;AAAA,QACzB;AAAA,QACA,QAAQ;AAAA,MACV;AACA,UAAI,KAAK,IAAI;AACb,mBAAa;AACb,kBAAY;AACZ,YAAM,SAAS;AAAA,IACjB,OAAO;AACL,mBAAa;AAAA,IACf;AAAA,EACF;AAEA,SAAO,CAAC,WAAW,QAAQ;AAC7B;;;ACvIO,IAAM,SAAN,MAAa;AAAA,EAKlB,YAAY,OAAiB;AAC3B,SAAK,OAAO,oBAAI,IAAoB;AACpC,SAAK,OAAO,CAAC;AACb,SAAK,eAAe;AACpB,SAAK,MAAM,KAAK;AAAA,EAClB;AAAA,EAEO,OAAe;AACpB,QAAI,KAAK,KAAK,SAAS,GAAG;AACxB,aAAO,KAAK,KAAK,IAAI;AAAA,IACvB,OAAO;AACL,aAAO,KAAK;AAAA,IACd;AAAA,EACF;AAAA,EAEO,MAAM,EAAE,MAAM,GAAG,GAAa;AACnC,SAAK,KAAK,QAAQ,CAAC,UAAU,aAAa;AACxC,UAAI,WAAW,QAAQ,YAAY,IAAI;AACrC,aAAK,KAAK,KAAK,QAAQ;AACvB,aAAK,KAAK,OAAO,QAAQ;AAAA,MAC3B;AAAA,IACF,CAAC;AAED,UAAM,OAAO,KAAK;AAClB,QAAI,KAAK,KAAK,OAAO,KAAK,KAAK,SAAS,MAAM;AAC5C,WAAK,KAAK,SAAS,KAAK,IAAI,GAAG,OAAO,KAAK,KAAK,IAAI;AAAA,IACtD;AAEA,aAAS,WAAW,MAAM,WAAW,IAAI,YAAY;AACnD,UAAI,CAAC,KAAK,KAAK,IAAI,QAAQ,GAAG;AAC5B,cAAM,eAAe,KAAK,KAAK;AAC/B,aAAK,KAAK,IAAI,UAAU,YAAY;AAAA,MACtC;AAAA,IACF;AAEA,QAAI,KAAK,eAAe,KAAK,KAAK,MAAM;AACtC,WAAK,eAAe,KAAK,KAAK;AAAA,IAChC;AAAA,EACF;AAAA,EAEO,OAAO,UAA0B;AACtC,UAAM,MAAM,KAAK,KAAK,IAAI,QAAQ;AAClC,QAAI,QAAQ,QAAW;AACrB,cAAQ,IAAI;AAAA,gBACF,KAAK,cAAc;AAAA,iBAClB,KAAK,KAAK,KAAK,GAAG;AAAA,OAC5B;AACD,YAAM,MAAM,qCAAqC,UAAU;AAAA,IAC7D;AACA,WAAO;AAAA,EACT;AAAA,EAEO,gBAAgB;AACrB,WAAO,MAAM,KAAK,KAAK,KAAK,QAAQ,CAAC,EAClC,IAAY,CAAC,GAAG,MAAM,GAAG,MAAM,GAAG,EAClC,KAAK,GAAG;AAAA,EACb;AACF;;;AC5DO,IAAM,OAAO,CAAC,OAAe,OAAe;AACjD,MAAI,KAAa;AACjB,MAAI,QAAQ,OAAO,gBAAgB,IAAI,WAAW,IAAI,CAAC;AAGvD,SAAO,QAAQ;AAMb,QAAI,OAAO,MAAM,IAAI,IAAI;AACzB,QAAI,OAAO,IAAI;AAEb,YAAM,KAAK,SAAS,EAAE;AAAA,IACxB,WAAW,OAAO,IAAI;AAEpB,aAAO,OAAO,IAAI,SAAS,EAAE,EAAE,YAAY;AAAA,IAC7C,WAAW,OAAO,IAAI;AACpB,YAAM;AAAA,IACR,OAAO;AACL,YAAM;AAAA,IACR;AAAA,EACF;AACA,SAAO;AACT;;;ACxBO,SAAS,SACd,UACA,cACiB;AACjB,MAAI;AACJ,SAAO,IAAI,SAAoB;AAC7B,iBAAa,OAAO;AACpB,cAAU,OAAO,WAAW,MAAM,SAAS,GAAG,IAAI,GAAG,YAAY;AAAA,EACnE;AACF;AAEO,SAAS,SACd,UACA,OACiB;AACjB,MAAI,OAAO;AACX,MAAI,WAAkC;AAEtC,WAAS,gBAAgB;AACvB,QAAI,YAAY,QAAW;AACzB,aAAO;AAAA,IACT,OAAO;AACL,eAAS,GAAG,QAAQ;AACpB,iBAAW;AACX,iBAAW,eAAe,KAAK;AAAA,IACjC;AAAA,EACF;AAEA,SAAO,IAAI,SAAoB;AAC7B,QAAI,MAAM;AACR,iBAAW;AAAA,IACb,OAAO;AACL,eAAS,GAAG,IAAI;AAChB,aAAO;AACP,iBAAW,eAAe,KAAK;AAAA,IACjC;AAAA,EACF;AACF;;;ACtCA,IAAM,EAAE,IAAI,IAAI;;;ACOhB,IAAM,EAAE,SAAS,IAAI;AAEd,IAAM,cAAc;AAAA,EACzB,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AAAA,EACP,MAAM;AACR;AA2NA,IAAM,gBAAgB,CAAC,OAAmB,UACxC,SAAS,MAAM,CAAC,KAAK,SAAS,MAAM,CAAC;AAEvC,IAAM,sBACJ,YAAY,OAAO,YAAY,QAAQ,YAAY;AACrD,IAAM,8BAA8B,YAAY,OAAO,YAAY;AACnE,IAAM,6BAA6B,YAAY,OAAO,YAAY;AAO3D,IAAM,qBAAqB,CAChC,UACA,cACW;AACX,aAAW,QAAQ,UAAU;AAC3B,QAAI,OAAO,SAAS,UAAU;AAC5B,UAAI,SAAS,WAAW;AACtB,eAAO;AAAA,MACT;AAAA,IACF,WAAW,cAAc,MAAM,SAAS,GAAG;AACzC,UAAI,cAAc,KAAK,CAAC,GAAG;AACzB,eAAO;AAAA,MACT,WAAW,cAAc,KAAK,CAAC,GAAG;AAChC,eAAO;AAAA,MACT,OAAO;AACL,eAAO,YAAY;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AACA,SAAO,YAAY;AACrB;AAEO,IAAM,aAAa,CAAC,UAAqB,cAAsB;AACpE,aAAW,QAAQ,UAAU;AAC3B,QAAI,OAAO,SAAS,UAAU;AAC5B,UAAI,SAAS,WAAW;AACtB,eAAO;AAAA,MACT,WAAW,OAAO,WAAW;AAC3B,eAAO;AAAA,MACT;AAAA,IACF,WAAW,cAAc,MAAM,SAAS,GAAG;AACzC,aAAO;AAAA,IACT,WAAW,KAAK,CAAC,IAAI,WAAW;AAC9B,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;;;AC9PO,IAAMC,SAAQ,MAAK;AAGxB,MAAI,UAAU;AAGd,QAAMC,UAAS;;IAEb,QAAS,KAAK,OAAM,IAAK,MAAM,KAAM,GAAG,SAAS,EAAE,IAAI,MAAM,EAAE;;AAEjE,SAAO,MAAK;AACV,eAAW;AACX,WAAO,IAAIA,QAAM,IAAK;EACxB;AACF,GAAE;;;AC+EF,IAAM,iBAAiB,CAAC,GAAY,MAAe;AACjD,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT,WAAW,MAAM,UAAa,MAAM,QAAW;AAC7C,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAOA,IAAM,mBAAwC,CAC5C,EAAE,QAAQ,GAAG,GACb,EAAE,QAAQ,GAAG,MAEZ,OAAO,WAAa,yBAAI,YAAW,MACnC,OAAO,WAAa,yBAAI,YAAW;AAE/B,IAAM,gBAAqC,CAAC,IAAI,OAAO;AArJ9D;AAsJE,MAAI,iBAAiB,IAAI,EAAE,GAAG;AAC5B,WAAO;AAAA,EACT,OAAO;AACL,aAAO,QAAG,WAAH,mBAAW,cAAW,QAAG,WAAH,mBAAW;AAAA,EAC1C;AACF;AAEA,IAAM,iBAAsC,CAAC,EAAE,MAAM,GAAG,GAAG,EAAE,MAAM,GAAG,MACnE,OAAO,WAAa,yBAAI,SAAS,YAAW,KAC5C,OAAO,WAAa,yBAAI,SAAS,YAAW;AAE/C,IAAM,cAAmC,CAAC,QAAQ,cAAc;AAC9D,QAAM,EAAE,MAAM,GAAG,IAAI;AACrB,QAAM,EAAE,MAAM,GAAG,IAAI;AACrB,MAAI,eAAe,IAAI,EAAE,KAAK,eAAe,QAAQ,SAAS,GAAG;AAC/D,WAAO;AAAA,EACT,WAAW,OAAO,UAAa,OAAO,QAAW;AAC/C,WAAO;AAAA,EACT,YAAW,yBAAI,SAAS,aAAW,yBAAI,SAAS,SAAQ;AACtD,WAAO;AAAA,EACT;AACA,SAAO,GAAG,SAAS;AAAA,IACjB,CAAC,EAAE,QAAQ,SAAS,GAAG,MACrB,WAAW,GAAG,SAAS,CAAC,EAAE,UAAU,aAAa,GAAG,SAAS,CAAC,EAAE;AAAA,EACpE;AACF;AAEO,IAAM,aAAa,CAAC,WACzB,WAAW,UACX,OAAO,YAAY,UACnB,OAAO,QAAQ,SAAS;AAEnB,IAAM,YAAY,CAAC,YACxB,iCAAQ,YAAW,UAAa,OAAO,OAAO,OAAO,SAAS;AAEzD,IAAM,UAAU,CAAC,WAA+C;AAzLvE;AA0LE,2CAAQ,UAAS,UACjB,MAAM,SAAQ,YAAO,SAAP,mBAAa,QAAQ,KACnC,OAAO,KAAK,SAAS,SAAS;AAAA;AAEhC,IAAM,oBAAyC,CAC7C,EAAE,SAAS,KAAK,GAChB,EAAE,SAAS,KAAK,MAEf,SAAS,WAAa,6BAAM,YAAW,KACvC,SAAS,WAAa,6BAAM,YAAW;AAEnC,IAAM,iBAAsC,CAAC,QAAQ,cAAc;AACxE,QAAM,EAAE,SAAS,GAAG,IAAI;AACxB,QAAM,EAAE,SAAS,GAAG,IAAI;AACxB,MAAI,eAAe,IAAI,EAAE,KAAK,kBAAkB,QAAQ,SAAS,GAAG;AAClE,WAAO;AAAA,EACT,WAAW,OAAO,UAAa,OAAO,QAAW;AAC/C,WAAO;AAAA,EACT,YAAW,yBAAI,aAAW,yBAAI,SAAQ;AACpC,WAAO;AAAA,EACT;AACA,SAAO,GAAG,KAAK,CAAC,QAAQ,MAAM,YAAW,yBAAK,GAAE;AAClD;AAEA,IAAM,oBAAyC,CAC7C,EAAE,SAAS,MAAM,GACjB,EAAE,SAAS,MAAM,MAEhB,UAAU,WAAa,+BAAO,YAAW,KACzC,UAAU,WAAa,+BAAO,YAAW;AAErC,IAAM,iBAAsC,CAAC,QAAQ,cAAc;AACxE,QAAM,EAAE,SAAS,MAAM,IAAI;AAC3B,QAAM,EAAE,SAAS,MAAM,IAAI;AAE3B,MAAI,eAAe,OAAO,KAAK,KAAK,kBAAkB,QAAQ,SAAS,GAAG;AACxE,WAAO;AAAA,EACT,WAAW,UAAU,UAAa,UAAU,QAAW;AACrD,WAAO;AAAA,EACT,YAAW,+BAAO,aAAW,+BAAO,SAAQ;AAC1C,WAAO;AAAA,EACT;AACA,SAAO,MAAM,KAAK,CAAC,QAAQ,MAAM,YAAW,+BAAQ,GAAE;AACxD;AAEA,IAAM,yBAA8C,CAClD,EAAE,cAAc,KAAK,GACrB,EAAE,cAAc,KAAK,MAEpB,SAAS,WAAa,6BAAM,YAAW,KACvC,SAAS,WAAa,6BAAM,YAAW;AAE1C,IAAM,sBAA2C,CAAC,QAAQ,cAAc;AACtE,QAAM,EAAE,cAAc,KAAK,IAAI;AAC/B,QAAM,EAAE,cAAc,KAAK,IAAI;AAC/B,MAAI,eAAe,MAAM,IAAI,KAAK,uBAAuB,QAAQ,SAAS,GAAG;AAC3E,WAAO;AAAA,EACT,WAAW,SAAS,UAAa,SAAS,QAAW;AACnD,WAAO;AAAA,EACT,WAAW,KAAK,WAAW,KAAK,QAAQ;AACtC,WAAO;AAAA,EACT;AACA,SAAO,KAAK;AAAA,IACV,CAAC,EAAE,QAAQ,QAAQ,GAAG,MACpB,WAAW,KAAK,CAAC,EAAE,UAAU,YAAY,KAAK,CAAC,EAAE;AAAA,EACrD;AACF;AACA,IAAM,oBAAyC,MAAM;AAEnD,SAAO;AACT;AAEO,IAAM,gBAAgB,CAC3B,QACA,cACG;AACH,MAAI,eAAe,QAAQ,SAAS,GAAG;AACrC,WAAO;AAAA,EACT;AAEA,MAAI,WAAW,UAAa,cAAc,QAAW;AACnD,WAAO;AAAA,EACT;AAEA,SACE,eAAe,QAAQ,SAAS,KAChC,cAAc,QAAQ,SAAS,KAC/B,YAAY,QAAQ,SAAS,KAC7B,eAAe,QAAQ,SAAS,KAChC,oBAAoB,QAAQ,SAAS,KACrC,kBAAkB,QAAQ,SAAS;AAEvC;AAuDA,IAAM,qBAAqB;AAAA,EACzB;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;AAkBO,IAAM,oCAAoC,CAC/C,YACyC;AACzC,QAAM,OAAQ,QAAsC;AACpD,SAAO,mBAAmB,SAAS,IAAI;AACzC;AAEO,IAAM,4BAA4B,CACvC,YAEA,CAAC,UAAU,aAAa,WAAW,UAAU,WAAW,MAAM,EAAE;AAAA,EAC9D,QAAQ;AACV;AAeK,IAAM,WAAsB,EAAE,QAAQ,GAAG;AACzC,IAAM,SAAkB,EAAE,UAAU,CAAC,EAAE;AAEvC,IAAM,gBAAgC;AAAA,EAC3C,cAAc,CAAC;AAAA,EACf,SAAS,CAAC;AAAA,EACV,QAAQ;AAAA,EACR,SAAS,CAAC;AAAA,EACV,MAAM;AACR;AAEO,IAAM,qBAAqB,CAChC,WAC8D;AAC9D,MACE,OAAO,gBACP,OAAO,WACP,OAAO,UACP,OAAO,WACP,OAAO,MACP;AACA,WAAO;AAAA,EACT,OAAO;AACL,UAAM;AAAA,MACJ,eAAe,CAAC;AAAA,MAChB,UAAU,CAAC;AAAA,MACX,SAAS,EAAE,QAAQ,GAAG;AAAA,MACtB,UAAU,CAAC;AAAA,MACX,OAAO,EAAE,UAAU,CAAC,EAAE;AAAA,MACtB;AAAA,IACF,IAAI;AAEJ,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;ACtaO,IAAM,iBAAiB;;;AC0CvB,IAAM,4BAA4B,CACvC,QAEC,IAAgC,SAAS;AAOrC,IAAM,6BAA6B,CACxC,QAEC,IAAiC,SAAS;AAqDtC,IAAM,mBAAmB,CAAC,QAC/B,OAAQ,IAA0B,WAAW;AAExC,IAAM,gBAAgB,CAC3B,YACuC,QAAQ,SAAS;AA2OnD,IAAM,sBAAsB,CACjC,WAC2C,OAAO,SAAS;AAYtD,IAAM,wBAAwB,CACnC,WACqC,OAAO,SAAS;;;ACzXhD,IAAM,mBAAmB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACuChC,IAAM,aAAa,IAAI,KAAK,CAAC,0BAA0B,IAAI,gBAAgB,GAAG;AAAA,EAC5E,MAAM;AACR,CAAC;AACD,IAAM,gBAAgB,IAAI,gBAAgB,UAAU;AAMpD,IAAI;AACJ,IAAI;AACJ,IAAM,uBAAyC,CAAC;AAEhD,IAAI;AACJ,IAAI;AAEJ,IAAM,YAAY,IAAI,QAAmB,CAAC,SAAS,WAAW;AAC5D,kBAAgB;AAChB,iBAAe;AACjB,CAAC;AAEM,IAAM,eAAe,MAAM;AAMlC,IAAM,YAAY,oBAAI,IAOpB;AACF,IAAM,kBAAkB,oBAAI,IAAI;AAiBhC,IAAM,YAAY,OAAO;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,QAAQ;AAAA,EACR;AAAA,EACA;AACF,MAAqB;AACnB,MAAI,UAAU,MAAM,kBAAkB,QAAW;AAC/C,WAAO,IAAI,QAAgB,CAAC,YAAY;AACtC,2BAAqB,KAAK,EAAE,QAAQ,CAAC;AAAA,IACvC,CAAC;AAAA,EACH;AAIA,SACE;AAAA,GAEC,gBAAgB,IAAI,QAAQ,CAAC,YAAY;AACxC,UAAMC,UAAS,IAAI,OAAO,aAAa;AAEvC,UAAM,QAAuB,OAAO,WAAW,MAAM;AACnD,cAAQ,MAAM,sCAAsC;AAAA,IACtD,GAAG,GAAI;AAKP,IAAAA,QAAO,YAAY,CAAC,QAAsC;AACxD,YAAM,EAAE,MAAM,QAAQ,IAAI;AAC1B,UAAI,QAAQ,SAAS,SAAS;AAC5B,eAAO,aAAa,KAAK;AACzB,QAAAA,QAAO,YAAY;AAAA,UACjB;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,MAAM;AAAA,UACN;AAAA,UACA;AAAA,QACF,CAAC;AAAA,MACH,WAAW,QAAQ,SAAS,aAAa;AACvC,QAAAA,QAAO,YAAY;AACnB,gBAAQA,OAAM;AACd,mBAAW,wBAAwB,sBAAsB;AACvD,+BAAqB,QAAQA,OAAM;AAAA,QACrC;AACA,6BAAqB,SAAS;AAAA,MAChC,WAAW,0BAA0B,OAAO,GAAG;AAC7C,qCAA6B,EAAE,MAAM,QAAQ,CAAC;AAAA,MAChD,OAAO;AACL,gBAAQ,KAAK,uDAAuD;AAAA,MACtE;AAAA,IACF;AAAA,EAEF,CAAC;AAEL;AAEA,SAAS,wBAAwB;AAAA,EAC/B,MAAM;AACR,GAA6D;AAC3D,MAAI,kCAAkC,OAAO,GAAG;AAC9C,UAAM,WAAW,UAAU,IAAI,QAAQ,gBAAgB;AACvD,QAAI,UAAU;AACZ,eAAS,8BAA8B,OAAO;AAAA,IAChD,OAAO;AACL,cAAQ;AAAA,QACN,uBAAuB,QAAQ;AAAA,MACjC;AAAA,IACF;AAAA,EACF,WAAW,0BAA0B,OAAO,GAAG;AAC7C,sBAAkB,KAAK,qBAAqB,OAAO;AAAA,EACrD,WAAW,2BAA2B,OAAO,GAAG;AAC9C,sBAAkB,KAAK,sBAAsB,OAAO;AAAA,EACtD,OAAO;AACL,UAAM,YAAa,QAA8B;AACjD,QAAI,gBAAgB,IAAI,SAAS,GAAG;AAClC,YAAM,EAAE,QAAQ,IAAI,gBAAgB,IAAI,SAAS;AACjD,sBAAgB,OAAO,SAAS;AAChC,YAAM;AAAA,QACJ,MAAM;AAAA,QACN,WAAW;AAAA,QACX,GAAG;AAAA,MACL,IAAI;AAKJ,UAAI,iBAAiB,OAAO,GAAG;AAC7B,gBAAQ,QAAQ,MAAM;AAAA,MACxB,WACE,QAAQ,SAAS,0BACjB,QAAQ,SAAS,sBACjB;AACA,gBAAQ,OAAO;AAAA,MACjB,WAAW,cAAc,OAAO,GAAG;AACjC,gBAAQ,QAAQ,WAAW;AAAA,MAC7B,OAAO;AACL,gBAAQ,IAAI;AAAA,MACd;AAAA,IACF,OAAO;AACL,cAAQ;AAAA,QACN;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAEA,IAAM,eAAe,CACnB,QAMe;AACf,QAAM,YAAY,KAAK;AACvB,SAAO,YAAY;AAAA,IACjB;AAAA,IACA,GAAG;AAAA,EACL,CAAC;AACD,SAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtC,oBAAgB,IAAI,WAAW,EAAE,SAAS,OAAO,CAAC;AAAA,EACpD,CAAC;AACH;AAiBA,IAAM,qBAAgC;AAAA,EACpC,WAAW,CAAC,SAAS,aAAa;AAChC,QAAI,UAAU,IAAI,QAAQ,QAAQ,GAAG;AACnC,YAAM;AAAA,QACJ;AAAA,MACF;AAAA,IACF;AAEA,cAAU,IAAI,QAAQ,UAAU;AAAA,MAC9B,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,+BAA+B;AAAA,IACjC,CAAC;AACD,WAAO,YAAY,EAAE,MAAM,aAAa,GAAG,QAAQ,CAAC;AAAA,EACtD;AAAA,EAEA,aAAa,CAAC,aAAa;AACzB,WAAO,YAAY,EAAE,MAAM,eAAe,SAAS,CAAC;AAAA,EACtD;AAAA,EAEA,MAAM,CAAC,YAAY;AACjB,WAAO,YAAY,OAAO;AAAA,EAC5B;AAAA,EAEA,SAAS,CAAC,eAAwB;AAChC,QAAI,cAAc,UAAU,IAAI,UAAU,GAAG;AAC3C,gBAAU,OAAO,UAAU;AAAA,IAC7B;AAAA,EACF;AAAA,EAEA,SAAS,OACP,YAIG,aAAgB,OAAO;AAAA,EAE5B,cAAc,YACZ,aAA2B,EAAE,MAAM,iBAAiB,CAAC;AAAA,EAEvD,gBAAgB,OAAO,UACrB,aAA0B;AAAA,IACxB,MAAc;AAAA,IACd;AAAA,EACF,CAAC;AACL;AAkBA,IAAM,qBAAN,cAAiC,aAA+B;AAAA;AAAA;AAAA,EAG9D,MAAM,QAAQ;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,GAAuC;AAGrC,aAAS,MAAM,UAAU;AAAA,MACvB;AAAA,MACA;AAAA,MACA,OAAO;AAAA,MACP;AAAA,MACA;AAAA,MACA;AAAA;AAAA;AAAA,MAGA,8BAA8B;AAAA,IAChC,CAAC;AACD,WAAO;AAAA,EACT;AAAA,EAEA,UAAU;AACR,WAAO,UAAU;AAAA,EACnB;AACF;AAEO,IAAM,oBAAoB,IAAI,mBAAmB;;;ACxUxD,IAAM,sBAAsB;AAC5B,IAAI,aAAa;AACjB,IAAM,QAAN,MAAY;AAAA,EACR,YAAY,MAAM,IAAI;AAClB,SAAK,OAAO;AACZ,SAAK,KAAK;AAAA,EACd;AACJ;AAIA,IAAM,WAAN,MAAe;AAAA;AAAA,EAEX,YAAY,SAAS,CAAC,GAAG;AACrB,SAAK,KAAK;AACV,SAAK,UAAU,CAAC,CAAC,OAAO;AACxB,SAAK,cAAc,OAAO,gBAAgB,MAAM;AAC5C,YAAM,IAAI,MAAM,sDAAsD;AAAA,IAC1E;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,OAAO;AACP,QAAI,KAAK;AACL,YAAM,IAAI,WAAW,wCAAwC;AACjE,QAAI,OAAO,SAAS;AAChB,cAAQ,SAAS,MAAM,KAAK;AAChC,WAAO,CAAC,SAAS;AACb,UAAI,SAAS,MAAM,IAAI;AACvB,aAAO,WAAW,SAAY,OAAO,CAAC,MAAM,MAAM;AAAA,IACtD;AAAA,EACJ;AACJ;AAKA,SAAS,WAAW,IAAI,SAAS,EAAE,aAAa,SAAO,IAAI,MAAM,GAAG,EAAE,CAAC;AAIvE,SAAS,WAAW,IAAI,SAAS,EAAE,aAAa,SAAO,IAAI,MAAM,GAAG,EAAE,CAAC;AAIvE,SAAS,QAAQ,IAAI,SAAS,EAAE,aAAa,SAAO,IAAI,MAAM,GAAG,EAAE,CAAC;AAIpE,SAAS,cAAc,IAAI,SAAS,EAAE,SAAS,KAAK,CAAC;AAKrD,SAAS,YAAY,IAAI,SAAS,EAAE,SAAS,KAAK,CAAC;AAInD,SAAS,UAAU,IAAI,SAAS,EAAE,SAAS,KAAK,CAAC;AAuBjD,IAAM,UAAU,uBAAO,OAAO,IAAI;AAElC,IAAM,WAAN,MAAe;AAAA;AAAA,EAEX,YAKA,MAEA,OAGA,IAEA,QAAQ,GAAG;AACP,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,KAAK;AACV,SAAK,QAAQ;AAAA,EACjB;AAAA;AAAA,EAEA,OAAO,OAAO,MAAM;AAChB,QAAI,QAAQ,KAAK,SAAS,KAAK,MAAM,SAAS,uBAAO,OAAO,IAAI,IAAI;AACpE,QAAI,SAAS,KAAK,MAAM,IAAuB,MAAM,KAAK,UAAU,IAA2B,MAC1F,KAAK,QAAQ,IAAyB,MAAM,KAAK,QAAQ,OAAO,IAA6B;AAClG,QAAI,OAAO,IAAI,SAAS,KAAK,QAAQ,IAAI,OAAO,KAAK,IAAI,KAAK;AAC9D,QAAI,KAAK;AACL,eAAS,OAAO,KAAK,OAAO;AACxB,YAAI,CAAC,MAAM,QAAQ,GAAG;AAClB,gBAAM,IAAI,IAAI;AAClB,YAAI,KAAK;AACL,cAAI,IAAI,CAAC,EAAE;AACP,kBAAM,IAAI,WAAW,4CAA4C;AACrE,gBAAM,IAAI,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC;AAAA,QAC5B;AAAA,MACJ;AACJ,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAGA,KAAK,MAAM;AAAE,WAAO,KAAK,MAAM,KAAK,EAAE;AAAA,EAAG;AAAA;AAAA,EAEzC,IAAI,QAAQ;AAAE,YAAQ,KAAK,QAAQ,KAAwB;AAAA,EAAG;AAAA;AAAA,EAE9D,IAAI,YAAY;AAAE,YAAQ,KAAK,QAAQ,KAA4B;AAAA,EAAG;AAAA;AAAA,EAEtE,IAAI,UAAU;AAAE,YAAQ,KAAK,QAAQ,KAA0B;AAAA,EAAG;AAAA;AAAA;AAAA,EAGlE,IAAI,cAAc;AAAE,YAAQ,KAAK,QAAQ,KAA8B;AAAA,EAAG;AAAA;AAAA;AAAA,EAG1E,GAAG,MAAM;AACL,QAAI,OAAO,QAAQ,UAAU;AACzB,UAAI,KAAK,QAAQ;AACb,eAAO;AACX,UAAI,QAAQ,KAAK,KAAK,SAAS,KAAK;AACpC,aAAO,QAAQ,MAAM,QAAQ,IAAI,IAAI,KAAK;AAAA,IAC9C;AACA,WAAO,KAAK,MAAM;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,MAAM,KAAK;AACd,QAAI,SAAS,uBAAO,OAAO,IAAI;AAC/B,aAAS,QAAQ;AACb,eAAS,QAAQ,KAAK,MAAM,GAAG;AAC3B,eAAO,IAAI,IAAI,IAAI,IAAI;AAC/B,WAAO,CAAC,SAAS;AACb,eAAS,SAAS,KAAK,KAAK,SAAS,KAAK,GAAG,IAAI,IAAI,KAAK,SAAS,OAAO,SAAS,IAAI,KAAK;AACxF,YAAI,QAAQ,OAAO,IAAI,IAAI,KAAK,OAAO,OAAO,CAAC,CAAC;AAChD,YAAI;AACA,iBAAO;AAAA,MACf;AAAA,IACJ;AAAA,EACJ;AACJ;AAEA,SAAS,OAAO,IAAI;AAAA,EAAS;AAAA,EAAI,uBAAO,OAAO,IAAI;AAAA,EAAG;AAAA,EAAG;AAAA;AAA0B;AAQnF,IAAM,UAAN,MAAc;AAAA;AAAA;AAAA,EAGV,YAEA,OAAO;AACH,SAAK,QAAQ;AACb,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ;AAC9B,UAAI,MAAM,CAAC,EAAE,MAAM;AACf,cAAM,IAAI,WAAW,6EAA6E;AAAA,EAC9G;AAAA;AAAA;AAAA;AAAA,EAIA,UAAU,OAAO;AACb,QAAI,WAAW,CAAC;AAChB,aAAS,QAAQ,KAAK,OAAO;AACzB,UAAI,WAAW;AACf,eAAS,UAAU,OAAO;AACtB,YAAI,MAAM,OAAO,IAAI;AACrB,YAAI,KAAK;AACL,cAAI,CAAC;AACD,uBAAW,OAAO,OAAO,CAAC,GAAG,KAAK,KAAK;AAC3C,mBAAS,IAAI,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC;AAAA,QAC/B;AAAA,MACJ;AACA,eAAS,KAAK,WAAW,IAAI,SAAS,KAAK,MAAM,UAAU,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI;AAAA,IAC1F;AACA,WAAO,IAAI,QAAQ,QAAQ;AAAA,EAC/B;AACJ;AACA,IAAM,aAAa,oBAAI,QAAQ;AAA/B,IAAkC,kBAAkB,oBAAI,QAAQ;AAGhE,IAAI;AAAA,CACH,SAAUC,WAAU;AAIjB,EAAAA,UAASA,UAAS,gBAAgB,IAAI,CAAC,IAAI;AAI3C,EAAAA,UAASA,UAAS,kBAAkB,IAAI,CAAC,IAAI;AAI7C,EAAAA,UAASA,UAAS,cAAc,IAAI,CAAC,IAAI;AAKzC,EAAAA,UAASA,UAAS,gBAAgB,IAAI,CAAC,IAAI;AAC/C,GAAG,aAAa,WAAW,CAAC,EAAE;AAe9B,IAAM,OAAN,MAAW;AAAA;AAAA,EAEP,YAEA,MAEA,UAGA,WAEAC,SAEA,OAAO;AACH,SAAK,OAAO;AACZ,SAAK,WAAW;AAChB,SAAK,YAAY;AACjB,SAAK,SAASA;AAEd,SAAK,QAAQ;AACb,QAAI,SAAS,MAAM,QAAQ;AACvB,WAAK,QAAQ,uBAAO,OAAO,IAAI;AAC/B,eAAS,CAAC,MAAM,KAAK,KAAK;AACtB,aAAK,MAAM,OAAO,QAAQ,WAAW,OAAO,KAAK,EAAE,IAAI;AAAA,IAC/D;AAAA,EACJ;AAAA;AAAA,EAEA,WAAW;AACP,QAAI,UAAU,KAAK,KAAK,SAAS,OAAO;AACxC,QAAI,WAAW,CAAC,QAAQ;AACpB,aAAO,QAAQ,KAAK,SAAS;AACjC,QAAI,WAAW;AACf,aAAS,MAAM,KAAK,UAAU;AAC1B,UAAI,MAAM,GAAG,SAAS;AACtB,UAAI,KAAK;AACL,YAAI;AACA,sBAAY;AAChB,oBAAY;AAAA,MAChB;AAAA,IACJ;AACA,WAAO,CAAC,KAAK,KAAK,OAAO,YACpB,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,KAAK,KAAK,UAAU,KAAK,UAAU,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SACzF,SAAS,SAAS,MAAM,WAAW,MAAM;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA,EAIA,OAAO,OAAO,GAAG;AACb,WAAO,IAAI,WAAW,KAAK,SAAS,IAAI;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAIA,SAAS,KAAK,OAAO,GAAG,OAAO,GAAG;AAC9B,QAAI,QAAQ,WAAW,IAAI,IAAI,KAAK,KAAK;AACzC,QAAI,SAAS,IAAI,WAAW,KAAK;AACjC,WAAO,OAAO,KAAK,IAAI;AACvB,eAAW,IAAI,MAAM,OAAO,KAAK;AACjC,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAGA,IAAI,UAAU;AACV,WAAO,IAAI,SAAS,MAAM,GAAG,GAAG,IAAI;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAQ,KAAK,OAAO,GAAG;AACnB,QAAI,OAAO,YAAY,WAAW,IAAI,IAAI,KAAK,KAAK,SAAS,KAAK,MAAM,KAAK;AAC7E,eAAW,IAAI,MAAM,IAAI;AACzB,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAa,KAAK,OAAO,GAAG;AACxB,QAAI,OAAO,YAAY,gBAAgB,IAAI,IAAI,KAAK,KAAK,SAAS,KAAK,MAAM,IAAI;AACjF,oBAAgB,IAAI,MAAM,IAAI;AAC9B,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,MAAM;AACV,QAAI,EAAE,OAAO,OAAO,OAAO,GAAG,KAAK,KAAK,OAAO,IAAI;AACnD,QAAI,OAAO,KAAK,QAAQ,GAAG,QAAQ,OAAO,SAAS,oBAAoB;AACvE,aAAS,IAAI,KAAK,OAAO,OAAO,SAAS,gBAAgB,OAAK;AAC1D,UAAI,UAAU;AACd,UAAI,EAAE,QAAQ,MAAM,EAAE,MAAM,SAAS,CAAC,QAAQ,EAAE,KAAK,eAAe,MAAM,CAAC,MAAM,QAAQ;AACrF,YAAI,EAAE,WAAW;AACb;AACJ,kBAAU;AAAA,MACd;AACA,iBAAS;AACL,YAAI,WAAW,UAAU,QAAQ,CAAC,EAAE,KAAK;AACrC,gBAAM,CAAC;AACX,YAAI,EAAE,YAAY;AACd;AACJ,YAAI,CAAC,EAAE,OAAO;AACV;AACJ,kBAAU;AAAA,MACd;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA,EAGA,KAAK,MAAM;AACP,WAAO,CAAC,KAAK,UAAU,KAAK,KAAK,KAAK,IAAI,IAAI,KAAK,QAAQ,KAAK,MAAM,KAAK,EAAE,IAAI;AAAA,EACrF;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,aAAa;AACb,QAAI,SAAS,CAAC;AACd,QAAI,KAAK;AACL,eAAS,MAAM,KAAK;AAChB,eAAO,KAAK,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC,CAAC;AACzC,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,QAAQ,SAAS,CAAC,GAAG;AACjB,WAAO,KAAK,SAAS,UAAU,IAA+B,OAC1D,aAAa,SAAS,MAAM,KAAK,UAAU,KAAK,WAAW,GAAG,KAAK,SAAS,QAAQ,GAAG,KAAK,QAAQ,CAAC,UAAU,WAAWA,YAAW,IAAI,KAAK,KAAK,MAAM,UAAU,WAAWA,SAAQ,KAAK,UAAU,GAAG,OAAO,aAAa,CAAC,UAAU,WAAWA,YAAW,IAAI,KAAK,SAAS,MAAM,UAAU,WAAWA,OAAM,EAAE;AAAA,EAC1T;AAAA;AAAA;AAAA,EAGA,OAAO,MAAM,MAAM;AAAE,WAAO,UAAU,IAAI;AAAA,EAAG;AACjD;AAEA,KAAK,QAAQ,IAAI,KAAK,SAAS,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;AAC9C,IAAM,mBAAN,MAAuB;AAAA,EACnB,YAAY,QAAQ,OAAO;AACvB,SAAK,SAAS;AACd,SAAK,QAAQ;AAAA,EACjB;AAAA,EACA,IAAI,KAAK;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EAC/C,IAAI,QAAQ;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EAClD,IAAI,MAAM;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EAChD,IAAI,OAAO;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EACjD,IAAI,MAAM;AAAE,WAAO,KAAK;AAAA,EAAO;AAAA,EAC/B,OAAO;AAAE,SAAK,SAAS;AAAA,EAAG;AAAA,EAC1B,OAAO;AAAE,WAAO,IAAI,iBAAiB,KAAK,QAAQ,KAAK,KAAK;AAAA,EAAG;AACnE;AAKA,IAAM,aAAN,MAAiB;AAAA;AAAA,EAEb,YAEA,QAEAA,SAEA,KAAK;AACD,SAAK,SAAS;AACd,SAAK,SAASA;AACd,SAAK,MAAM;AAAA,EACf;AAAA;AAAA,EAEA,IAAI,OAAO;AAAE,WAAO,SAAS;AAAA,EAAM;AAAA;AAAA,EAEnC,WAAW;AACP,QAAI,SAAS,CAAC;AACd,aAAS,QAAQ,GAAG,QAAQ,KAAK,OAAO,UAAS;AAC7C,aAAO,KAAK,KAAK,YAAY,KAAK,CAAC;AACnC,cAAQ,KAAK,OAAO,QAAQ,CAAC;AAAA,IACjC;AACA,WAAO,OAAO,KAAK,GAAG;AAAA,EAC1B;AAAA;AAAA,EAEA,YAAY,OAAO;AACf,QAAI,KAAK,KAAK,OAAO,KAAK,GAAG,WAAW,KAAK,OAAO,QAAQ,CAAC;AAC7D,QAAI,OAAO,KAAK,IAAI,MAAM,EAAE,GAAG,SAAS,KAAK;AAC7C,QAAI,KAAK,KAAK,MAAM,KAAK,CAAC,KAAK;AAC3B,eAAS,KAAK,UAAU,MAAM;AAClC,aAAS;AACT,QAAI,YAAY;AACZ,aAAO;AACX,QAAI,WAAW,CAAC;AAChB,WAAO,QAAQ,UAAU;AACrB,eAAS,KAAK,KAAK,YAAY,KAAK,CAAC;AACrC,cAAQ,KAAK,OAAO,QAAQ,CAAC;AAAA,IACjC;AACA,WAAO,SAAS,MAAM,SAAS,KAAK,GAAG,IAAI;AAAA,EAC/C;AAAA;AAAA,EAEA,UAAU,YAAY,UAAU,KAAK,KAAK,MAAM;AAC5C,QAAI,EAAE,OAAO,IAAI,MAAM,OAAO;AAC9B,aAAS,IAAI,YAAY,KAAK,UAAU,IAAI,OAAO,IAAI,CAAC,GAAG;AACvD,UAAI,UAAU,MAAM,KAAK,OAAO,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,GAAG;AACpD,eAAO;AACP,YAAI,MAAM;AACN;AAAA,MACR;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,MAAM,QAAQ,MAAM,MAAM;AACtB,QAAI,IAAI,KAAK;AACb,QAAI,OAAO,IAAI,YAAY,OAAO,MAAM,GAAG,MAAM;AACjD,aAAS,IAAI,QAAQ,IAAI,GAAG,IAAI,QAAO;AACnC,WAAK,GAAG,IAAI,EAAE,GAAG;AACjB,WAAK,GAAG,IAAI,EAAE,GAAG,IAAI;AACrB,UAAI,KAAK,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI;AAC9B,WAAK,GAAG,IAAI,EAAE,GAAG,IAAI;AACrB,YAAM,KAAK,IAAI,KAAK,EAAE;AAAA,IAC1B;AACA,WAAO,IAAI,WAAW,MAAM,KAAK,KAAK,GAAG;AAAA,EAC7C;AACJ;AACA,SAAS,UAAU,MAAM,KAAK,MAAM,IAAI;AACpC,UAAQ,MAAM;AAAA,IACV,KAAK;AAAsB,aAAO,OAAO;AAAA,IACzC,KAAK;AAA0B,aAAO,MAAM,OAAO,OAAO;AAAA,IAC1D,KAAK;AAAqB,aAAO,OAAO,OAAO,KAAK;AAAA,IACpD,KAAK;AAAwB,aAAO,QAAQ,OAAO,KAAK;AAAA,IACxD,KAAK;AAAoB,aAAO,KAAK;AAAA,IACrC,KAAK;AAAuB,aAAO;AAAA,EACvC;AACJ;AACA,SAAS,2BAA2B,MAAM,KAAK;AAC3C,MAAI,OAAO,KAAK,YAAY,GAAG;AAC/B,SAAO,MAAM;AACT,QAAIC,QAAO,KAAK;AAChB,QAAI,CAACA,SAAQA,MAAK,MAAM,KAAK;AACzB;AACJ,QAAIA,MAAK,KAAK,WAAWA,MAAK,QAAQA,MAAK,IAAI;AAC3C,aAAO;AACP,aAAOA,MAAK;AAAA,IAChB,OACK;AACD,aAAOA;AAAA,IACX;AAAA,EACJ;AACA,SAAO;AACX;AACA,SAAS,YAAY,MAAM,KAAK,MAAM,UAAU;AAC5C,MAAI;AAEJ,SAAO,KAAK,QAAQ,KAAK,OACpB,OAAO,IAAI,KAAK,QAAQ,MAAM,KAAK,OAAO,SAC1C,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM;AAC9C,QAAI,SAAS,CAAC,YAAY,gBAAgB,YAAY,KAAK,QAAQ,IAAI,OAAO,KAAK;AACnF,QAAI,CAAC;AACD,aAAO;AACX,WAAO;AAAA,EACX;AACA,MAAI,OAAO,WAAW,IAAI,SAAS;AAEnC,MAAI;AACA,aAAS,OAAO,MAAM,SAAS,KAAK,QAAQ,QAAQ,OAAO,QAAQ,SAAS,KAAK,QAAQ;AACrF,UAAI,gBAAgB,YAAY,KAAK,QAAQ,OAAO,KAAK,OAAO,MAAM,KAAK,MAAM,IAAI,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,SAAS,KAAK;AAC1I,eAAO;AAAA,IACf;AACJ,aAAS;AACL,QAAI,QAAQ,KAAK,MAAM,KAAK,MAAM,IAAI;AACtC,QAAI,CAAC;AACD,aAAO;AACX,WAAO;AAAA,EACX;AACJ;AACA,IAAM,WAAN,MAAe;AAAA,EACX,YAAY,OAAO,MAEnB,OAAO,SAAS;AACZ,SAAK,QAAQ;AACb,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,UAAU;AAAA,EACnB;AAAA,EACA,IAAI,OAAO;AAAE,WAAO,KAAK,MAAM;AAAA,EAAM;AAAA,EACrC,IAAI,OAAO;AAAE,WAAO,KAAK,MAAM,KAAK;AAAA,EAAM;AAAA,EAC1C,IAAI,KAAK;AAAE,WAAO,KAAK,OAAO,KAAK,MAAM;AAAA,EAAQ;AAAA,EACjD,UAAU,GAAG,KAAK,KAAK,MAAM,OAAO,GAAG;AACnC,aAAS,SAAS,UAAQ;AACtB,eAAS,EAAE,UAAU,UAAU,IAAI,OAAO,OAAO,IAAI,MAAM,IAAI,SAAS,SAAS,IAAI,KAAK,GAAG,KAAK,KAAK;AACnG,YAAI,OAAO,SAAS,CAAC,GAAGC,SAAQ,UAAU,CAAC,IAAI,OAAO;AACtD,YAAI,CAAC,UAAU,MAAM,KAAKA,QAAOA,SAAQ,KAAK,MAAM;AAChD;AACJ,YAAI,gBAAgB,YAAY;AAC5B,cAAI,OAAO,SAAS;AAChB;AACJ,cAAI,QAAQ,KAAK,UAAU,GAAG,KAAK,OAAO,QAAQ,KAAK,MAAMA,QAAO,IAAI;AACxE,cAAI,QAAQ;AACR,mBAAO,IAAI,WAAW,IAAI,cAAc,QAAQ,MAAM,GAAGA,MAAK,GAAG,MAAM,KAAK;AAAA,QACpF,WACU,OAAO,SAAS,qBAAsB,CAAC,KAAK,KAAK,eAAe,SAAS,IAAI,IAAI;AACvF,cAAI;AACJ,cAAI,EAAE,OAAO,SAAS,iBAClB,KAAK,UAAU,UAAU,KAAK,KAAK,SAAS,OAAO,MAAM,CAAC,QAAQ;AAClE,mBAAO,IAAI,SAAS,QAAQ,MAAMA,QAAO,GAAG,MAAM;AACtD,cAAI,QAAQ,IAAI,SAAS,MAAMA,QAAO,GAAG,MAAM;AAC/C,iBAAQ,OAAO,SAAS,oBAAqB,CAAC,MAAM,KAAK,cAAc,QACjE,MAAM,UAAU,MAAM,IAAI,KAAK,SAAS,SAAS,IAAI,GAAG,KAAK,KAAK,IAAI;AAAA,QAChF;AAAA,MACJ;AACA,UAAK,OAAO,SAAS,oBAAqB,CAAC,OAAO,KAAK;AACnD,eAAO;AACX,UAAI,OAAO,SAAS;AAChB,YAAI,OAAO,QAAQ;AAAA;AAEnB,YAAI,MAAM,IAAI,KAAK,OAAO,QAAQ,MAAM,SAAS;AACrD,eAAS,OAAO;AAChB,UAAI,CAAC;AACD,eAAO;AAAA,IACf;AAAA,EACJ;AAAA,EACA,IAAI,aAAa;AAAE,WAAO,KAAK;AAAA,MAAU;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EAAG;AAAA,EAC1E,IAAI,YAAY;AAAE,WAAO,KAAK;AAAA,MAAU,KAAK,MAAM,SAAS,SAAS;AAAA,MAAG;AAAA,MAAI;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EAAG;AAAA,EACvG,WAAW,KAAK;AAAE,WAAO,KAAK;AAAA,MAAU;AAAA,MAAG;AAAA,MAAG;AAAA,MAAK;AAAA;AAAA,IAAkB;AAAA,EAAG;AAAA,EACxE,YAAY,KAAK;AAAE,WAAO,KAAK;AAAA,MAAU,KAAK,MAAM,SAAS,SAAS;AAAA,MAAG;AAAA,MAAI;AAAA,MAAK;AAAA;AAAA,IAAoB;AAAA,EAAG;AAAA,EACzG,MAAM,KAAK,MAAM,OAAO,GAAG;AACvB,QAAI;AACJ,QAAI,EAAE,OAAO,SAAS,oBAAoB,UAAU,KAAK,MAAM,KAAK,SAAS,OAAO,MAAM,QAAQ,SAAS;AACvG,UAAI,OAAO,MAAM,KAAK;AACtB,eAAS,EAAE,MAAM,GAAG,KAAK,QAAQ,SAAS;AACtC,aAAK,OAAO,IAAI,QAAQ,OAAO,OAAO,UACjC,OAAO,IAAI,MAAM,OAAO,KAAK;AAC9B,iBAAO,IAAI,SAAS,QAAQ,MAAM,QAAQ,QAAQ,CAAC,EAAE,OAAO,KAAK,MAAM,IAAI,IAAI;AAAA,MACvF;AAAA,IACJ;AACA,WAAO,KAAK,UAAU,GAAG,GAAG,KAAK,MAAM,IAAI;AAAA,EAC/C;AAAA,EACA,wBAAwB;AACpB,QAAI,MAAM;AACV,WAAO,IAAI,KAAK,eAAe,IAAI;AAC/B,YAAM,IAAI;AACd,WAAO;AAAA,EACX;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK,UAAU,KAAK,QAAQ,sBAAsB,IAAI;AAAA,EACjE;AAAA,EACA,IAAI,cAAc;AACd,WAAO,KAAK,WAAW,KAAK,SAAS,IAAI,KAAK,QAAQ;AAAA,MAAU,KAAK,QAAQ;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA;AAAA,IAAqB,IAAI;AAAA,EACnH;AAAA,EACA,IAAI,cAAc;AACd,WAAO,KAAK,WAAW,KAAK,SAAS,IAAI,KAAK,QAAQ;AAAA,MAAU,KAAK,QAAQ;AAAA,MAAG;AAAA,MAAI;AAAA,MAAG;AAAA;AAAA,IAAqB,IAAI;AAAA,EACpH;AAAA,EACA,OAAO,OAAO,GAAG;AAAE,WAAO,IAAI,WAAW,MAAM,IAAI;AAAA,EAAG;AAAA,EACtD,IAAI,OAAO;AAAE,WAAO,KAAK;AAAA,EAAO;AAAA,EAChC,SAAS;AAAE,WAAO,KAAK;AAAA,EAAO;AAAA,EAC9B,QAAQ,KAAK,OAAO,GAAG;AACnB,WAAO,YAAY,MAAM,KAAK,MAAM,KAAK;AAAA,EAC7C;AAAA,EACA,aAAa,KAAK,OAAO,GAAG;AACxB,WAAO,YAAY,MAAM,KAAK,MAAM,IAAI;AAAA,EAC5C;AAAA,EACA,2BAA2B,KAAK;AAAE,WAAO,2BAA2B,MAAM,GAAG;AAAA,EAAG;AAAA,EAChF,SAAS,MAAM,SAAS,MAAM,QAAQ,MAAM;AACxC,QAAI,IAAI,YAAY,MAAM,MAAM,QAAQ,KAAK;AAC7C,WAAO,EAAE,SAAS,EAAE,CAAC,IAAI;AAAA,EAC7B;AAAA,EACA,YAAY,MAAM,SAAS,MAAM,QAAQ,MAAM;AAC3C,WAAO,YAAY,MAAM,MAAM,QAAQ,KAAK;AAAA,EAChD;AAAA;AAAA,EAEA,WAAW;AAAE,WAAO,KAAK,MAAM,SAAS;AAAA,EAAG;AAAA,EAC3C,IAAI,OAAO;AAAE,WAAO;AAAA,EAAM;AAAA,EAC1B,aAAa,SAAS;AAAE,WAAO,iBAAiB,MAAM,OAAO;AAAA,EAAG;AACpE;AACA,SAAS,YAAY,MAAM,MAAM,QAAQ,OAAO;AAC5C,MAAI,MAAM,KAAK,OAAO,GAAG,SAAS,CAAC;AACnC,MAAI,CAAC,IAAI,WAAW;AAChB,WAAO;AACX,MAAI,UAAU;AACV,WAAO,CAAC,IAAI,KAAK,GAAG,MAAM;AACtB,UAAI,CAAC,IAAI,YAAY;AACjB,eAAO;AAAA;AACnB,aAAS;AACL,QAAI,SAAS,QAAQ,IAAI,KAAK,GAAG,KAAK;AAClC,aAAO;AACX,QAAI,IAAI,KAAK,GAAG,IAAI;AAChB,aAAO,KAAK,IAAI,IAAI;AACxB,QAAI,CAAC,IAAI,YAAY;AACjB,aAAO,SAAS,OAAO,SAAS,CAAC;AAAA,EACzC;AACJ;AACA,SAAS,iBAAiB,MAAM,SAAS,IAAI,QAAQ,SAAS,GAAG;AAC7D,WAAS,IAAI,KAAK,QAAQ,KAAK,GAAG,IAAI,EAAE,QAAQ;AAC5C,QAAI,CAAC;AACD,aAAO;AACX,QAAI,CAAC,EAAE,KAAK,aAAa;AACrB,UAAI,QAAQ,CAAC,KAAK,QAAQ,CAAC,KAAK,EAAE;AAC9B,eAAO;AACX;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;AACA,IAAM,gBAAN,MAAoB;AAAA,EAChB,YAAY,QAAQ,QAAQ,OAAOA,QAAO;AACtC,SAAK,SAAS;AACd,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,SAAK,QAAQA;AAAA,EACjB;AACJ;AACA,IAAM,aAAN,MAAiB;AAAA,EACb,IAAI,OAAO;AAAE,WAAO,KAAK,KAAK;AAAA,EAAM;AAAA,EACpC,IAAI,OAAO;AAAE,WAAO,KAAK,QAAQ,QAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EACrF,IAAI,KAAK;AAAE,WAAO,KAAK,QAAQ,QAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EACnF,YAAY,SAAS,SAAS,OAAO;AACjC,SAAK,UAAU;AACf,SAAK,UAAU;AACf,SAAK,QAAQ;AACb,SAAK,OAAO,QAAQ,OAAO,IAAI,MAAM,QAAQ,OAAO,OAAO,KAAK,CAAC;AAAA,EACrE;AAAA,EACA,MAAM,KAAK,KAAK,MAAM;AAClB,QAAI,EAAE,OAAO,IAAI,KAAK;AACtB,QAAI,QAAQ,OAAO,UAAU,KAAK,QAAQ,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,GAAG,KAAK,MAAM,KAAK,QAAQ,OAAO,IAAI;AAC/G,WAAO,QAAQ,IAAI,OAAO,IAAI,WAAW,KAAK,SAAS,MAAM,KAAK;AAAA,EACtE;AAAA,EACA,IAAI,aAAa;AAAE,WAAO,KAAK;AAAA,MAAM;AAAA,MAAG;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EAAG;AAAA,EACnE,IAAI,YAAY;AAAE,WAAO,KAAK;AAAA,MAAM;AAAA,MAAI;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EAAG;AAAA,EACnE,WAAW,KAAK;AAAE,WAAO,KAAK;AAAA,MAAM;AAAA,MAAG;AAAA,MAAK;AAAA;AAAA,IAAkB;AAAA,EAAG;AAAA,EACjE,YAAY,KAAK;AAAE,WAAO,KAAK;AAAA,MAAM;AAAA,MAAI;AAAA,MAAK;AAAA;AAAA,IAAoB;AAAA,EAAG;AAAA,EACrE,MAAM,KAAK,MAAM,OAAO,GAAG;AACvB,QAAI,OAAO,SAAS;AAChB,aAAO;AACX,QAAI,EAAE,OAAO,IAAI,KAAK;AACtB,QAAI,QAAQ,OAAO,UAAU,KAAK,QAAQ,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,GAAG,OAAO,IAAI,IAAI,IAAI,MAAM,KAAK,QAAQ,OAAO,IAAI;AAC7H,WAAO,QAAQ,IAAI,OAAO,IAAI,WAAW,KAAK,SAAS,MAAM,KAAK;AAAA,EACtE;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK,WAAW,KAAK,QAAQ,OAAO,sBAAsB;AAAA,EACrE;AAAA,EACA,gBAAgB,KAAK;AACjB,WAAO,KAAK,UAAU,OAAO,KAAK,QAAQ,OAAO;AAAA,MAAU,KAAK,QAAQ,QAAQ;AAAA,MAAK;AAAA,MAAK;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EACtH;AAAA,EACA,IAAI,cAAc;AACd,QAAI,EAAE,OAAO,IAAI,KAAK;AACtB,QAAI,QAAQ,OAAO,OAAO,KAAK,QAAQ,CAAC;AACxC,QAAI,SAAS,KAAK,UAAU,OAAO,OAAO,KAAK,QAAQ,QAAQ,CAAC,IAAI,OAAO,OAAO;AAC9E,aAAO,IAAI,WAAW,KAAK,SAAS,KAAK,SAAS,KAAK;AAC3D,WAAO,KAAK,gBAAgB,CAAC;AAAA,EACjC;AAAA,EACA,IAAI,cAAc;AACd,QAAI,EAAE,OAAO,IAAI,KAAK;AACtB,QAAI,cAAc,KAAK,UAAU,KAAK,QAAQ,QAAQ,IAAI;AAC1D,QAAI,KAAK,SAAS;AACd,aAAO,KAAK,gBAAgB,EAAE;AAClC,WAAO,IAAI,WAAW,KAAK,SAAS,KAAK,SAAS,OAAO;AAAA,MAAU;AAAA,MAAa,KAAK;AAAA,MAAO;AAAA,MAAI;AAAA,MAAG;AAAA;AAAA,IAAqB,CAAC;AAAA,EAC7H;AAAA,EACA,OAAO,OAAO,GAAG;AAAE,WAAO,IAAI,WAAW,MAAM,IAAI;AAAA,EAAG;AAAA,EACtD,IAAI,OAAO;AAAE,WAAO;AAAA,EAAM;AAAA,EAC1B,SAAS;AACL,QAAI,WAAW,CAAC,GAAG,YAAY,CAAC;AAChC,QAAI,EAAE,OAAO,IAAI,KAAK;AACtB,QAAI,SAAS,KAAK,QAAQ,GAAG,OAAO,OAAO,OAAO,KAAK,QAAQ,CAAC;AAChE,QAAI,OAAO,QAAQ;AACf,UAAI,OAAO,OAAO,OAAO,KAAK,QAAQ,CAAC;AACvC,eAAS,KAAK,OAAO,MAAM,QAAQ,MAAM,IAAI,CAAC;AAC9C,gBAAU,KAAK,CAAC;AAAA,IACpB;AACA,WAAO,IAAI,KAAK,KAAK,MAAM,UAAU,WAAW,KAAK,KAAK,KAAK,IAAI;AAAA,EACvE;AAAA,EACA,QAAQ,KAAK,OAAO,GAAG;AACnB,WAAO,YAAY,MAAM,KAAK,MAAM,KAAK;AAAA,EAC7C;AAAA,EACA,aAAa,KAAK,OAAO,GAAG;AACxB,WAAO,YAAY,MAAM,KAAK,MAAM,IAAI;AAAA,EAC5C;AAAA,EACA,2BAA2B,KAAK;AAAE,WAAO,2BAA2B,MAAM,GAAG;AAAA,EAAG;AAAA;AAAA,EAEhF,WAAW;AAAE,WAAO,KAAK,QAAQ,OAAO,YAAY,KAAK,KAAK;AAAA,EAAG;AAAA,EACjE,SAAS,MAAM,SAAS,MAAM,QAAQ,MAAM;AACxC,QAAI,IAAI,YAAY,MAAM,MAAM,QAAQ,KAAK;AAC7C,WAAO,EAAE,SAAS,EAAE,CAAC,IAAI;AAAA,EAC7B;AAAA,EACA,YAAY,MAAM,SAAS,MAAM,QAAQ,MAAM;AAC3C,WAAO,YAAY,MAAM,MAAM,QAAQ,KAAK;AAAA,EAChD;AAAA,EACA,IAAI,OAAO;AAAE,WAAO;AAAA,EAAM;AAAA,EAC1B,aAAa,SAAS;AAAE,WAAO,iBAAiB,MAAM,OAAO;AAAA,EAAG;AACpE;AAGA,IAAM,aAAN,MAAiB;AAAA;AAAA,EAEb,IAAI,OAAO;AAAE,WAAO,KAAK,KAAK;AAAA,EAAM;AAAA;AAAA,EAEpC,YAAY,MAEZ,OAAO,GAAG;AACN,SAAK,OAAO;AAEZ,SAAK,SAAS;AACd,SAAK,QAAQ,CAAC;AAEd,SAAK,QAAQ;AACb,SAAK,aAAa;AAClB,QAAI,gBAAgB,UAAU;AAC1B,WAAK,UAAU,IAAI;AAAA,IACvB,OACK;AACD,WAAK,QAAQ,KAAK,QAAQ;AAC1B,WAAK,SAAS,KAAK;AACnB,eAAS,IAAI,KAAK,SAAS,GAAG,IAAI,EAAE;AAChC,aAAK,MAAM,QAAQ,EAAE,KAAK;AAC9B,WAAK,aAAa;AAClB,WAAK,SAAS,KAAK,KAAK;AAAA,IAC5B;AAAA,EACJ;AAAA,EACA,UAAU,MAAM;AACZ,QAAI,CAAC;AACD,aAAO;AACX,SAAK,QAAQ;AACb,SAAK,OAAO,KAAK;AACjB,SAAK,OAAO,KAAK;AACjB,SAAK,KAAK,KAAK;AACf,WAAO;AAAA,EACX;AAAA,EACA,SAAS,OAAO,MAAM;AAClB,SAAK,QAAQ;AACb,QAAI,EAAE,OAAAA,QAAO,OAAO,IAAI,KAAK;AAC7B,SAAK,OAAO,QAAQ,OAAO,IAAI,MAAM,OAAO,OAAO,KAAK,CAAC;AACzD,SAAK,OAAOA,SAAQ,OAAO,OAAO,QAAQ,CAAC;AAC3C,SAAK,KAAKA,SAAQ,OAAO,OAAO,QAAQ,CAAC;AACzC,WAAO;AAAA,EACX;AAAA,EACA,MAAM,MAAM;AACR,QAAI,CAAC;AACD,aAAO;AACX,QAAI,gBAAgB,UAAU;AAC1B,WAAK,SAAS;AACd,aAAO,KAAK,UAAU,IAAI;AAAA,IAC9B;AACA,SAAK,SAAS,KAAK;AACnB,WAAO,KAAK,SAAS,KAAK,OAAO,KAAK,IAAI;AAAA,EAC9C;AAAA;AAAA,EAEA,WAAW;AACP,WAAO,KAAK,SAAS,KAAK,OAAO,OAAO,YAAY,KAAK,KAAK,IAAI,KAAK,MAAM,SAAS;AAAA,EAC1F;AAAA;AAAA,EAEA,WAAW,KAAK,KAAK,MAAM;AACvB,QAAI,CAAC,KAAK;AACN,aAAO,KAAK,MAAM,KAAK,MAAM,UAAU,MAAM,IAAI,KAAK,MAAM,MAAM,SAAS,SAAS,IAAI,GAAG,KAAK,KAAK,MAAM,KAAK,IAAI,CAAC;AACzH,QAAI,EAAE,OAAO,IAAI,KAAK;AACtB,QAAI,QAAQ,OAAO,UAAU,KAAK,QAAQ,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,GAAG,KAAK,MAAM,KAAK,OAAO,OAAO,IAAI;AAC9G,QAAI,QAAQ;AACR,aAAO;AACX,SAAK,MAAM,KAAK,KAAK,KAAK;AAC1B,WAAO,KAAK,SAAS,KAAK;AAAA,EAC9B;AAAA;AAAA;AAAA,EAGA,aAAa;AAAE,WAAO,KAAK;AAAA,MAAW;AAAA,MAAG;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EAAG;AAAA;AAAA,EAEpE,YAAY;AAAE,WAAO,KAAK;AAAA,MAAW;AAAA,MAAI;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EAAG;AAAA;AAAA,EAEpE,WAAW,KAAK;AAAE,WAAO,KAAK;AAAA,MAAW;AAAA,MAAG;AAAA,MAAK;AAAA;AAAA,IAAkB;AAAA,EAAG;AAAA;AAAA,EAEtE,YAAY,KAAK;AAAE,WAAO,KAAK;AAAA,MAAW;AAAA,MAAI;AAAA,MAAK;AAAA;AAAA,IAAoB;AAAA,EAAG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM1E,MAAM,KAAK,MAAM,OAAO,KAAK,MAAM;AAC/B,QAAI,CAAC,KAAK;AACN,aAAO,KAAK,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM,IAAI,CAAC;AACvD,WAAO,OAAO,SAAS,iBAAiB,QAAQ,KAAK,WAAW,GAAG,KAAK,IAAI;AAAA,EAChF;AAAA;AAAA,EAEA,SAAS;AACL,QAAI,CAAC,KAAK;AACN,aAAO,KAAK,UAAW,KAAK,OAAO,SAAS,mBAAoB,KAAK,MAAM,UAAU,KAAK,MAAM,MAAM;AAC1G,QAAI,KAAK,MAAM;AACX,aAAO,KAAK,SAAS,KAAK,MAAM,IAAI,CAAC;AACzC,QAAI,SAAU,KAAK,OAAO,SAAS,mBAAoB,KAAK,OAAO,SAAS,KAAK,OAAO,OAAO,sBAAsB;AACrH,SAAK,SAAS;AACd,WAAO,KAAK,UAAU,MAAM;AAAA,EAChC;AAAA;AAAA,EAEA,QAAQ,KAAK;AACT,QAAI,CAAC,KAAK;AACN,aAAO,CAAC,KAAK,MAAM,UAAU,QACvB,KAAK,MAAM,KAAK,MAAM,QAAQ,IAAI,OAC9B,KAAK,MAAM,QAAQ,UAAU,KAAK,MAAM,QAAQ,KAAK,KAAK,GAAG,GAAuB,KAAK,IAAI,CAAC;AAC5G,QAAI,EAAE,OAAO,IAAI,KAAK,QAAQ,IAAI,KAAK,MAAM,SAAS;AACtD,QAAI,MAAM,GAAG;AACT,UAAI,cAAc,IAAI,IAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AAC9C,UAAI,KAAK,SAAS;AACd,eAAO,KAAK,SAAS,OAAO;AAAA,UAAU;AAAA,UAAa,KAAK;AAAA,UAAO;AAAA,UAAI;AAAA,UAAG;AAAA;AAAA,QAAqB,CAAC;AAAA,IACpG,OACK;AACD,UAAI,QAAQ,OAAO,OAAO,KAAK,QAAQ,CAAC;AACxC,UAAI,SAAS,IAAI,IAAI,OAAO,OAAO,SAAS,OAAO,OAAO,KAAK,MAAM,CAAC,IAAI,CAAC;AACvE,eAAO,KAAK,SAAS,KAAK;AAAA,IAClC;AACA,WAAO,IAAI,IAAI,KAAK,MAAM,KAAK,OAAO,OAAO,UAAU,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG,GAAuB,KAAK,IAAI,CAAC,IAAI;AAAA,EACjI;AAAA;AAAA,EAEA,cAAc;AAAE,WAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA;AAAA,EAExC,cAAc;AAAE,WAAO,KAAK,QAAQ,EAAE;AAAA,EAAG;AAAA,EACzC,WAAW,KAAK;AACZ,QAAI,OAAO,QAAQ,EAAE,OAAO,IAAI;AAChC,QAAI,QAAQ;AACR,UAAI,MAAM,GAAG;AACT,YAAI,KAAK,QAAQ,OAAO,OAAO,OAAO;AAClC,iBAAO;AAAA,MACf,OACK;AACD,iBAAS,IAAI,GAAG,IAAI,KAAK,OAAO;AAC5B,cAAI,OAAO,OAAO,OAAO,IAAI,CAAC,IAAI,KAAK;AACnC,mBAAO;AAAA,MACnB;AACA,OAAC,EAAE,OAAO,OAAO,IAAI;AAAA,IACzB,OACK;AACD,OAAC,EAAE,OAAO,SAAS,OAAO,IAAI,KAAK;AAAA,IACvC;AACA,WAAO,QAAQ,EAAE,OAAO,SAAS,OAAO,IAAI,QAAQ;AAChD,UAAI,QAAQ;AACR,iBAAS,IAAI,QAAQ,KAAK,IAAI,MAAM,IAAI,KAAK,OAAO,MAAM,SAAS,QAAQ,KAAK,GAAG,KAAK,KAAK;AACzF,cAAI,QAAQ,OAAO,MAAM,SAAS,CAAC;AACnC,cAAK,KAAK,OAAO,SAAS,oBACtB,iBAAiB,cACjB,CAAC,MAAM,KAAK,eACZ,SAAS,KAAK;AACd,mBAAO;AAAA,QACf;AAAA,IACR;AACA,WAAO;AAAA,EACX;AAAA,EACA,KAAK,KAAK,OAAO;AACb,QAAI,SAAS,KAAK;AAAA,MAAW;AAAA,MAAK;AAAA,MAAG;AAAA;AAAA,IAAqB;AACtD,aAAO;AACX,eAAS;AACL,UAAI,KAAK,QAAQ,GAAG;AAChB,eAAO;AACX,UAAI,KAAK,WAAW,GAAG,KAAK,CAAC,KAAK,OAAO;AACrC,eAAO;AAAA,IACf;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,KAAK,QAAQ,MAAM;AAAE,WAAO,KAAK,KAAK,GAAG,KAAK;AAAA,EAAG;AAAA;AAAA;AAAA;AAAA;AAAA,EAKjD,KAAK,QAAQ,MAAM;AAAE,WAAO,KAAK,KAAK,IAAI,KAAK;AAAA,EAAG;AAAA;AAAA;AAAA;AAAA,EAIlD,OAAO,KAAK,OAAO,GAAG;AAElB,WAAO,KAAK,QAAQ,KAAK,OACpB,OAAO,IAAI,KAAK,QAAQ,MAAM,KAAK,OAAO,SAC1C,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK;AACxC,UAAI,CAAC,KAAK,OAAO;AACb;AAER,WAAO,KAAK,WAAW,GAAG,KAAK,IAAI,GAAG;AAAA,IAAE;AACxC,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAGA,IAAI,OAAO;AACP,QAAI,CAAC,KAAK;AACN,aAAO,KAAK;AAChB,QAAI,QAAQ,KAAK,YAAY,SAAS,MAAM,QAAQ;AACpD,QAAI,SAAS,MAAM,WAAW,KAAK,QAAQ;AACvC;AAAM,iBAAS,QAAQ,KAAK,OAAO,IAAI,KAAK,MAAM,QAAQ,KAAK,KAAI;AAC/D,mBAAS,IAAI,OAAO,GAAG,IAAI,EAAE;AACzB,gBAAI,EAAE,SAAS,OAAO;AAClB,kBAAI,SAAS,KAAK;AACd,uBAAO;AACX,uBAAS;AACT,sBAAQ,IAAI;AACZ,oBAAM;AAAA,YACV;AACJ,kBAAQ,KAAK,MAAM,EAAE,CAAC;AAAA,QAC1B;AAAA,IACJ;AACA,aAAS,IAAI,OAAO,IAAI,KAAK,MAAM,QAAQ;AACvC,eAAS,IAAI,WAAW,KAAK,QAAQ,QAAQ,KAAK,MAAM,CAAC,CAAC;AAC9D,WAAO,KAAK,aAAa,IAAI,WAAW,KAAK,QAAQ,QAAQ,KAAK,KAAK;AAAA,EAC3E;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,OAAO;AACP,WAAO,KAAK,SAAS,OAAO,KAAK,MAAM;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,OAAO,OAAO;AAClB,aAAS,QAAQ,OAAK;AAClB,UAAI,YAAY;AAChB,UAAI,KAAK,KAAK,eAAe,MAAM,IAAI,MAAM,OAAO;AAChD,YAAI,KAAK,WAAW,GAAG;AACnB;AACA;AAAA,QACJ;AACA,YAAI,CAAC,KAAK,KAAK;AACX,sBAAY;AAAA,MACpB;AACA,iBAAS;AACL,YAAI,aAAa;AACb,gBAAM,IAAI;AACd,oBAAY,KAAK,KAAK;AACtB,YAAI,KAAK,YAAY;AACjB;AACJ,YAAI,CAAC;AACD;AACJ,aAAK,OAAO;AACZ;AACA,oBAAY;AAAA,MAChB;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAIA,aAAa,SAAS;AAClB,QAAI,CAAC,KAAK;AACN,aAAO,iBAAiB,KAAK,MAAM,OAAO;AAC9C,QAAI,EAAE,OAAO,IAAI,KAAK,QAAQ,EAAE,MAAM,IAAI,OAAO;AACjD,aAAS,IAAI,QAAQ,SAAS,GAAG,IAAI,KAAK,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AACrE,UAAI,IAAI;AACJ,eAAO,iBAAiB,KAAK,MAAM,SAAS,CAAC;AACjD,UAAI,OAAO,MAAM,OAAO,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC;AAC7C,UAAI,CAAC,KAAK,aAAa;AACnB,YAAI,QAAQ,CAAC,KAAK,QAAQ,CAAC,KAAK,KAAK;AACjC,iBAAO;AACX;AAAA,MACJ;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ;AACA,SAAS,SAAS,MAAM;AACpB,SAAO,KAAK,SAAS,KAAK,QAAM,cAAc,cAAc,CAAC,GAAG,KAAK,eAAe,SAAS,EAAE,CAAC;AACpG;AACA,SAAS,UAAU,MAAM;AACrB,MAAI;AACJ,MAAI,EAAE,QAAQ,SAAS,kBAAkB,qBAAqB,SAAS,CAAC,GAAG,gBAAgB,QAAQ,MAAM,OAAO,IAAI;AACpH,MAAI,SAAS,MAAM,QAAQ,MAAM,IAAI,IAAI,iBAAiB,QAAQ,OAAO,MAAM,IAAI;AACnF,MAAI,QAAQ,QAAQ;AACpB,MAAI,cAAc,GAAG,YAAY;AACjC,WAAS,SAAS,aAAa,QAAQC,WAAUC,YAAW,UAAU;AAClE,QAAI,EAAE,IAAI,OAAAF,QAAO,KAAAG,MAAK,KAAK,IAAI;AAC/B,QAAI,mBAAmB;AACvB,WAAO,OAAO,GAAG;AACb,aAAO,KAAK;AACZ,UAAI,QAAQ,IAA8B;AACtC,YAAIC,QAAO,OAAO,EAAE;AACpB,QAAAH,UAAS,KAAKG,KAAI;AAClB,QAAAF,WAAU,KAAKF,SAAQ,WAAW;AAClC;AAAA,MACJ,WACS,QAAQ,IAAsC;AACnD,sBAAc;AACd;AAAA,MACJ,WACS,QAAQ,IAAkC;AAC/C,oBAAY;AACZ;AAAA,MACJ,OACK;AACD,cAAM,IAAI,WAAW,6BAA6B,MAAM;AAAA,MAC5D;AAAA,IACJ;AACA,QAAI,OAAO,MAAM,EAAE,GAAG,MAAMK;AAC5B,QAAI,WAAWL,SAAQ;AACvB,QAAIG,OAAMH,UAAS,oBAAoBK,UAAS,eAAe,OAAO,MAAM,QAAQ,QAAQ,IAAI;AAE5F,UAAIC,QAAO,IAAI,YAAYD,QAAO,OAAOA,QAAO,IAAI;AACpD,UAAI,SAAS,OAAO,MAAMA,QAAO,MAAM,QAAQC,MAAK;AACpD,aAAO,OAAO,MAAM;AAChB,gBAAQ,aAAaD,QAAO,OAAOC,OAAM,KAAK;AAClD,aAAO,IAAI,WAAWA,OAAMH,OAAME,QAAO,OAAO,OAAO;AACvD,iBAAWA,QAAO,QAAQ;AAAA,IAC9B,OACK;AACD,UAAI,SAAS,OAAO,MAAM;AAC1B,aAAO,KAAK;AACZ,UAAI,gBAAgB,CAAC,GAAG,iBAAiB,CAAC;AAC1C,UAAI,gBAAgB,MAAM,gBAAgB,KAAK;AAC/C,UAAI,YAAY,GAAG,UAAUF;AAC7B,aAAO,OAAO,MAAM,QAAQ;AACxB,YAAI,iBAAiB,KAAK,OAAO,MAAM,iBAAiB,OAAO,QAAQ,GAAG;AACtE,cAAI,OAAO,OAAO,UAAU,iBAAiB;AACzC,2BAAe,eAAe,gBAAgBH,QAAO,WAAW,OAAO,KAAK,SAAS,eAAe,gBAAgB;AACpH,wBAAY,cAAc;AAC1B,sBAAU,OAAO;AAAA,UACrB;AACA,iBAAO,KAAK;AAAA,QAChB,OACK;AACD,mBAASA,QAAO,QAAQ,eAAe,gBAAgB,aAAa;AAAA,QACxE;AAAA,MACJ;AACA,UAAI,iBAAiB,KAAK,YAAY,KAAK,YAAY,cAAc;AACjE,uBAAe,eAAe,gBAAgBA,QAAO,WAAWA,QAAO,SAAS,eAAe,gBAAgB;AACnH,oBAAc,QAAQ;AACtB,qBAAe,QAAQ;AACvB,UAAI,gBAAgB,MAAM,YAAY,GAAG;AACrC,YAAI,OAAO,aAAa,IAAI;AAC5B,eAAO,aAAa,MAAM,eAAe,gBAAgB,GAAG,cAAc,QAAQ,GAAGG,OAAMH,QAAO,MAAM,IAAI;AAAA,MAChH,OACK;AACD,eAAO,SAAS,MAAM,eAAe,gBAAgBG,OAAMH,QAAO,mBAAmBG,IAAG;AAAA,MAC5F;AAAA,IACJ;AACA,IAAAF,UAAS,KAAK,IAAI;AAClB,IAAAC,WAAU,KAAK,QAAQ;AAAA,EAC3B;AACA,WAAS,aAAa,MAAM;AACxB,WAAO,CAACD,WAAUC,YAAWJ,YAAW;AACpC,UAAIS,aAAY,GAAG,QAAQN,UAAS,SAAS,GAAGF,OAAM;AACtD,UAAI,SAAS,MAAMA,QAAOE,UAAS,KAAK,cAAc,MAAM;AACxD,YAAI,CAAC,SAASF,MAAK,QAAQ,QAAQA,MAAK,UAAUD;AAC9C,iBAAOC;AACX,YAAI,gBAAgBA,MAAK,KAAK,SAAS,SAAS;AAC5C,UAAAQ,aAAYL,WAAU,KAAK,IAAIH,MAAK,SAAS;AAAA,MACrD;AACA,aAAO,SAAS,MAAME,WAAUC,YAAWJ,SAAQS,UAAS;AAAA,IAChE;AAAA,EACJ;AACA,WAAS,eAAeN,WAAUC,YAAW,MAAM,GAAG,MAAM,IAAI,MAAMK,YAAW;AAC7E,QAAI,gBAAgB,CAAC,GAAG,iBAAiB,CAAC;AAC1C,WAAON,UAAS,SAAS,GAAG;AACxB,oBAAc,KAAKA,UAAS,IAAI,CAAC;AACjC,qBAAe,KAAKC,WAAU,IAAI,IAAI,OAAO,IAAI;AAAA,IACrD;AACA,IAAAD,UAAS,KAAK,SAAS,QAAQ,MAAM,IAAI,GAAG,eAAe,gBAAgB,KAAK,MAAMM,aAAY,EAAE,CAAC;AACrG,IAAAL,WAAU,KAAK,OAAO,IAAI;AAAA,EAC9B;AACA,WAAS,SAAS,MAAMD,WAAUC,YAAWJ,SAAQS,aAAY,GAAG,OAAO;AACvE,QAAI,aAAa;AACb,UAAIC,QAAO,CAAC,SAAS,aAAa,WAAW;AAC7C,cAAQ,QAAQ,CAACA,KAAI,EAAE,OAAO,KAAK,IAAI,CAACA,KAAI;AAAA,IAChD;AACA,QAAID,aAAY,IAAI;AAChB,UAAIC,QAAO,CAAC,SAAS,WAAWD,UAAS;AACzC,cAAQ,QAAQ,CAACC,KAAI,EAAE,OAAO,KAAK,IAAI,CAACA,KAAI;AAAA,IAChD;AACA,WAAO,IAAI,KAAK,MAAMP,WAAUC,YAAWJ,SAAQ,KAAK;AAAA,EAC5D;AACA,WAAS,eAAe,SAAS,UAAU;AAOvC,QAAI,OAAO,OAAO,KAAK;AACvB,QAAI,OAAO,GAAGE,SAAQ,GAAG,OAAO,GAAG,WAAW,KAAK,MAAM;AACzD,QAAI,SAAS,EAAE,MAAM,GAAG,OAAO,GAAG,MAAM,EAAE;AAC1C;AAAM,eAAS,SAAS,KAAK,MAAM,SAAS,KAAK,MAAM,UAAS;AAC5D,YAAIS,YAAW,KAAK;AAEpB,YAAI,KAAK,MAAM,YAAYA,aAAY,GAAG;AAGtC,iBAAO,OAAO;AACd,iBAAO,QAAQT;AACf,iBAAO,OAAO;AACd,kBAAQ;AACR,kBAAQ;AACR,eAAK,KAAK;AACV;AAAA,QACJ;AACA,YAAI,WAAW,KAAK,MAAMS;AAC1B,YAAIA,YAAW,KAAK,WAAW,UAAU,KAAK,QAAQ;AAClD;AACJ,YAAI,eAAe,KAAK,MAAM,gBAAgB,IAAI;AAClD,YAAI,YAAY,KAAK;AACrB,aAAK,KAAK;AACV,eAAO,KAAK,MAAM,UAAU;AACxB,cAAI,KAAK,OAAO,GAAG;AACf,gBAAI,KAAK,QAAQ;AACb,8BAAgB;AAAA;AAEhB,oBAAM;AAAA,UACd,WACS,KAAK,MAAM,eAAe;AAC/B,4BAAgB;AAAA,UACpB;AACA,eAAK,KAAK;AAAA,QACd;AACA,QAAAT,SAAQ;AACR,gBAAQS;AACR,gBAAQ;AAAA,MACZ;AACA,QAAI,WAAW,KAAK,QAAQ,SAAS;AACjC,aAAO,OAAO;AACd,aAAO,QAAQT;AACf,aAAO,OAAO;AAAA,IAClB;AACA,WAAO,OAAO,OAAO,IAAI,SAAS;AAAA,EACtC;AACA,WAAS,aAAa,aAAaK,SAAQ,OAAO;AAC9C,QAAI,EAAE,IAAI,OAAAL,QAAO,KAAAG,MAAK,KAAK,IAAI;AAC/B,WAAO,KAAK;AACZ,QAAI,QAAQ,KAAK,KAAK,eAAe;AACjC,UAAI,aAAa;AACjB,UAAI,OAAO,GAAG;AACV,YAAI,SAAS,OAAO,OAAO,OAAO;AAClC,eAAO,OAAO,MAAM;AAChB,kBAAQ,aAAa,aAAaE,SAAQ,KAAK;AAAA,MACvD;AACA,MAAAA,QAAO,EAAE,KAAK,IAAI;AAClB,MAAAA,QAAO,EAAE,KAAK,IAAIF,OAAM;AACxB,MAAAE,QAAO,EAAE,KAAK,IAAIL,SAAQ;AAC1B,MAAAK,QAAO,EAAE,KAAK,IAAI;AAAA,IACtB,WACS,QAAQ,IAAsC;AACnD,oBAAc;AAAA,IAClB,WACS,QAAQ,IAAkC;AAC/C,kBAAY;AAAA,IAChB;AACA,WAAO;AAAA,EACX;AACA,MAAI,WAAW,CAAC,GAAG,YAAY,CAAC;AAChC,SAAO,OAAO,MAAM;AAChB,aAAS,KAAK,SAAS,GAAG,KAAK,eAAe,GAAG,UAAU,WAAW,EAAE;AAC5E,MAAIP,WAAU,KAAK,KAAK,YAAY,QAAQ,OAAO,SAAS,KAAM,SAAS,SAAS,UAAU,CAAC,IAAI,SAAS,CAAC,EAAE,SAAS;AACxH,SAAO,IAAI,KAAK,MAAM,KAAK,KAAK,GAAG,SAAS,QAAQ,GAAG,UAAU,QAAQ,GAAGA,OAAM;AACtF;AACA,IAAM,gBAAgB,oBAAI;AAC1B,SAAS,SAAS,aAAa,MAAM;AACjC,MAAI,CAAC,YAAY,eAAe,gBAAgB,cAAc,KAAK,QAAQ;AACvE,WAAO;AACX,MAAI,OAAO,cAAc,IAAI,IAAI;AACjC,MAAI,QAAQ,MAAM;AACd,WAAO;AACP,aAAS,SAAS,KAAK,UAAU;AAC7B,UAAI,MAAM,QAAQ,eAAe,EAAE,iBAAiB,OAAO;AACvD,eAAO;AACP;AAAA,MACJ;AACA,cAAQ,SAAS,aAAa,KAAK;AAAA,IACvC;AACA,kBAAc,IAAI,MAAM,IAAI;AAAA,EAChC;AACA,SAAO;AACX;AACA,SAAS,aAET,aAEA,UAAU,WAEV,MAAM,IAENE,QAEAF,SAEA,OAEA,QAAQ;AACJ,MAAI,QAAQ;AACZ,WAAS,IAAI,MAAM,IAAI,IAAI;AACvB,aAAS,SAAS,aAAa,SAAS,CAAC,CAAC;AAC9C,MAAI,WAAW,KAAK;AAAA,IAAM,QAAQ,MAAO;AAAA;AAAA,EAA4B;AACrE,MAAI,gBAAgB,CAAC,GAAG,iBAAiB,CAAC;AAC1C,WAAS,OAAOG,WAAUC,YAAWQ,OAAMC,KAAI,QAAQ;AACnD,aAAS,IAAID,OAAM,IAAIC,OAAK;AACxB,UAAI,YAAY,GAAG,aAAaT,WAAU,CAAC,GAAG,YAAY,SAAS,aAAaD,UAAS,CAAC,CAAC;AAC3F;AACA,aAAO,IAAIU,KAAI,KAAK;AAChB,YAAI,WAAW,SAAS,aAAaV,UAAS,CAAC,CAAC;AAChD,YAAI,YAAY,YAAY;AACxB;AACJ,qBAAa;AAAA,MACjB;AACA,UAAI,KAAK,YAAY,GAAG;AACpB,YAAI,YAAY,UAAU;AACtB,cAAI,OAAOA,UAAS,SAAS;AAC7B,iBAAO,KAAK,UAAU,KAAK,WAAW,GAAG,KAAK,SAAS,QAAQC,WAAU,SAAS,IAAI,MAAM;AAC5F;AAAA,QACJ;AACA,sBAAc,KAAKD,UAAS,SAAS,CAAC;AAAA,MAC1C,OACK;AACD,YAAIH,UAASI,WAAU,IAAI,CAAC,IAAID,UAAS,IAAI,CAAC,EAAE,SAAS;AACzD,sBAAc,KAAK,aAAa,aAAaA,WAAUC,YAAW,WAAW,GAAG,YAAYJ,SAAQ,MAAM,MAAM,CAAC;AAAA,MACrH;AACA,qBAAe,KAAK,aAAa,SAASE,MAAK;AAAA,IACnD;AAAA,EACJ;AACA,SAAO,UAAU,WAAW,MAAM,IAAI,CAAC;AACvC,UAAQ,SAAS,QAAQ,eAAe,gBAAgBF,OAAM;AAClE;AAkIA,IAAM,SAAN,MAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAST,WAAW,OAAO,WAAW,QAAQ;AACjC,QAAI,OAAO,SAAS;AAChB,cAAQ,IAAI,YAAY,KAAK;AACjC,aAAS,CAAC,SAAS,CAAC,IAAI,MAAM,GAAG,MAAM,MAAM,CAAC,IAAI,OAAO,SAAS,OAAO,IAAI,OAAK,IAAI,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC;AAC7H,WAAO,KAAK,YAAY,OAAO,aAAa,CAAC,GAAG,MAAM;AAAA,EAC1D;AAAA;AAAA,EAEA,MAAM,OAAO,WAAW,QAAQ;AAC5B,QAAI,QAAQ,KAAK,WAAW,OAAO,WAAW,MAAM;AACpD,eAAS;AACL,UAAI,OAAO,MAAM,QAAQ;AACzB,UAAI;AACA,eAAO;AAAA,IACf;AAAA,EACJ;AACJ;AACA,IAAM,cAAN,MAAkB;AAAA,EACd,YAAY,QAAQ;AAChB,SAAK,SAAS;AAAA,EAClB;AAAA,EACA,IAAI,SAAS;AAAE,WAAO,KAAK,OAAO;AAAA,EAAQ;AAAA,EAC1C,MAAM,MAAM;AAAE,WAAO,KAAK,OAAO,MAAM,IAAI;AAAA,EAAG;AAAA,EAC9C,IAAI,aAAa;AAAE,WAAO;AAAA,EAAO;AAAA,EACjC,KAAK,MAAM,IAAI;AAAE,WAAO,KAAK,OAAO,MAAM,MAAM,EAAE;AAAA,EAAG;AACzD;AAkCA,IAAM,eAAe,IAAI,SAAS,EAAE,SAAS,KAAK,CAAC;;;AC56CnD,IAAM,QAAN,MAAY;AAAA;AAAA,EAER,YAEA,GAGA,OAEA,OAMA,WAEA,KAIA,OAKA,QAOA,YAEA,YAEA,YAAY,GAMZ,QAAQ;AACJ,SAAK,IAAI;AACT,SAAK,QAAQ;AACb,SAAK,QAAQ;AACb,SAAK,YAAY;AACjB,SAAK,MAAM;AACX,SAAK,QAAQ;AACb,SAAK,SAAS;AACd,SAAK,aAAa;AAClB,SAAK,aAAa;AAClB,SAAK,YAAY;AACjB,SAAK,SAAS;AAAA,EAClB;AAAA;AAAA,EAEA,WAAW;AACP,WAAO,IAAI,KAAK,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,KAAK,CAAC,EAAE,OAAO,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,QAAQ,MAAM,KAAK,QAAQ;AAAA,EACzH;AAAA;AAAA;AAAA,EAGA,OAAO,MAAM,GAAG,OAAO,MAAM,GAAG;AAC5B,QAAI,KAAK,EAAE,OAAO;AAClB,WAAO,IAAI,MAAM,GAAG,CAAC,GAAG,OAAO,KAAK,KAAK,GAAG,CAAC,GAAG,GAAG,KAAK,IAAI,aAAa,IAAI,GAAG,KAAK,IAAI,MAAM,GAAG,IAAI;AAAA,EAC1G;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,UAAU;AAAE,WAAO,KAAK,aAAa,KAAK,WAAW,UAAU;AAAA,EAAM;AAAA;AAAA;AAAA;AAAA,EAIzE,UAAU,OAAOc,QAAO;AACpB,SAAK,MAAM,KAAK,KAAK,OAAOA,QAAO,KAAK,aAAa,KAAK,OAAO,MAAM;AACvE,SAAK,QAAQ;AAAA,EACjB;AAAA;AAAA;AAAA,EAGA,OAAO,QAAQ;AACX,QAAI;AACJ,QAAI,QAAQ,UAAU,IAAkC,OAAO,SAAS;AACxE,QAAI,EAAE,QAAAC,QAAO,IAAI,KAAK;AACtB,QAAI,QAAQA,QAAO,kBAAkB,IAAI;AACzC,QAAI;AACA,WAAK,SAAS;AAClB,QAAI,SAAS,GAAG;AACZ,WAAK,UAAUA,QAAO,QAAQ,KAAK,OAAO,MAAM,IAAI,GAAG,KAAK,SAAS;AAGrE,UAAI,OAAOA,QAAO;AACd,aAAK,UAAU,MAAM,KAAK,WAAW,KAAK,WAAW,GAAG,IAAI;AAChE,WAAK,cAAc,MAAM,KAAK,SAAS;AACvC;AAAA,IACJ;AAMA,QAAI,OAAO,KAAK,MAAM,UAAW,QAAQ,KAAK,KAAM,SAAS,SAA+B,IAAI;AAChG,QAAID,SAAQ,OAAO,KAAK,MAAM,OAAO,CAAC,IAAI,KAAK,EAAE,OAAO,CAAC,EAAE,MAAM,OAAO,KAAK,YAAYA;AAIzF,QAAI,QAAQ,OAAsC,GAAG,KAAK,KAAK,EAAE,OAAO,QAAQ,MAAM,IAAI,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,cAAc;AAC/I,UAAIA,UAAS,KAAK,EAAE,uBAAuB;AACvC,aAAK,EAAE;AACP,aAAK,EAAE,uBAAuB;AAAA,MAClC,WACS,KAAK,EAAE,uBAAuB,MAAM;AACzC,aAAK,EAAE,oBAAoB;AAC3B,aAAK,EAAE,wBAAwBA;AAC/B,aAAK,EAAE,uBAAuB;AAAA,MAClC;AAAA,IACJ;AACA,QAAI,aAAa,OAAO,KAAK,MAAM,OAAO,CAAC,IAAI,GAAG,QAAQ,KAAK,aAAa,KAAK,OAAO,SAAS;AAEjG,QAAI,OAAOC,QAAO,iBAAkB,SAAS,QAAiC;AAC1E,UAAI,MAAMA,QAAO;AAAA,QAAU,KAAK;AAAA,QAAO;AAAA;AAAA,MAAyB,IAAI,KAAK,MAAM,KAAK;AACpF,WAAK,UAAU,MAAMD,QAAO,KAAK,QAAQ,GAAG,IAAI;AAAA,IACpD;AACA,QAAI,SAAS,QAA8B;AACvC,WAAK,QAAQ,KAAK,MAAM,IAAI;AAAA,IAChC,OACK;AACD,UAAI,cAAc,KAAK,MAAM,OAAO,CAAC;AACrC,WAAK,QAAQC,QAAO,QAAQ,aAAa,MAAM,IAAI;AAAA,IACvD;AACA,WAAO,KAAK,MAAM,SAAS;AACvB,WAAK,MAAM,IAAI;AACnB,SAAK,cAAc,MAAMD,MAAK;AAAA,EAClC;AAAA;AAAA;AAAA,EAGA,UAAU,MAAMA,QAAOE,MAAK,OAAO,GAAG,WAAW,OAAO;AACpD,QAAI,QAAQ,MACP,CAAC,KAAK,MAAM,UAAU,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC,IAAI,KAAK,OAAO,SAAS,KAAK,aAAa;AAElG,UAAI,MAAM,MAAM,MAAM,KAAK,OAAO;AAClC,UAAI,OAAO,KAAK,IAAI,QAAQ;AACxB,cAAM,IAAI,aAAa,IAAI,OAAO;AAClC,cAAM,IAAI;AAAA,MACd;AACA,UAAI,MAAM,KAAK,IAAI,OAAO,MAAM,CAAC,KAAK,KAAoB,IAAI,OAAO,MAAM,CAAC,IAAI,IAAI;AAChF,YAAIF,UAASE;AACT;AACJ,YAAI,IAAI,OAAO,MAAM,CAAC,KAAKF,QAAO;AAC9B,cAAI,OAAO,MAAM,CAAC,IAAIE;AACtB;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,CAAC,YAAY,KAAK,OAAOA,MAAK;AAC9B,WAAK,OAAO,KAAK,MAAMF,QAAOE,MAAK,IAAI;AAAA,IAC3C,OACK;AACD,UAAI,QAAQ,KAAK,OAAO;AACxB,UAAI,QAAQ,KAAK,KAAK,OAAO,QAAQ,CAAC,KAAK;AACvC,eAAO,QAAQ,KAAK,KAAK,OAAO,QAAQ,CAAC,IAAIA,MAAK;AAE9C,eAAK,OAAO,KAAK,IAAI,KAAK,OAAO,QAAQ,CAAC;AAC1C,eAAK,OAAO,QAAQ,CAAC,IAAI,KAAK,OAAO,QAAQ,CAAC;AAC9C,eAAK,OAAO,QAAQ,CAAC,IAAI,KAAK,OAAO,QAAQ,CAAC;AAC9C,eAAK,OAAO,QAAQ,CAAC,IAAI,KAAK,OAAO,QAAQ,CAAC;AAC9C,mBAAS;AACT,cAAI,OAAO;AACP,oBAAQ;AAAA,QAChB;AACJ,WAAK,OAAO,KAAK,IAAI;AACrB,WAAK,OAAO,QAAQ,CAAC,IAAIF;AACzB,WAAK,OAAO,QAAQ,CAAC,IAAIE;AACzB,WAAK,OAAO,QAAQ,CAAC,IAAI;AAAA,IAC7B;AAAA,EACJ;AAAA;AAAA;AAAA,EAGA,MAAM,QAAQ,MAAM,SAAS;AACzB,QAAIF,SAAQ,KAAK;AACjB,QAAI,SAAS,QAA8B;AACvC,WAAK,UAAU,SAAS,OAA8B,KAAK,GAAG;AAAA,IAClE,YACU,SAAS,WAAiC,GAAG;AACnD,UAAI,YAAY,QAAQ,EAAE,QAAAC,QAAO,IAAI,KAAK;AAC1C,UAAI,UAAU,KAAK,OAAO,QAAQA,QAAO,SAAS;AAC9C,aAAK,MAAM;AACX,YAAI,CAACA,QAAO;AAAA,UAAU;AAAA,UAAW;AAAA;AAAA,QAAyB;AACtD,eAAK,YAAY;AAAA,MACzB;AACA,WAAK,UAAU,WAAWD,MAAK;AAC/B,WAAK,aAAa,MAAMA,MAAK;AAC7B,UAAI,QAAQC,QAAO;AACf,aAAK,OAAO,KAAK,MAAMD,QAAO,SAAS,CAAC;AAAA,IAChD,OACK;AACD,WAAK,MAAM;AACX,WAAK,aAAa,MAAMA,MAAK;AAC7B,UAAI,QAAQ,KAAK,EAAE,OAAO;AACtB,aAAK,OAAO,KAAK,MAAMA,QAAO,SAAS,CAAC;AAAA,IAChD;AAAA,EACJ;AAAA;AAAA;AAAA,EAGA,MAAM,QAAQ,MAAM,SAAS;AACzB,QAAI,SAAS;AACT,WAAK,OAAO,MAAM;AAAA;AAElB,WAAK,MAAM,QAAQ,MAAM,OAAO;AAAA,EACxC;AAAA;AAAA;AAAA,EAGA,QAAQ,OAAO,MAAM;AACjB,QAAI,QAAQ,KAAK,EAAE,OAAO,SAAS;AACnC,QAAI,QAAQ,KAAK,KAAK,EAAE,OAAO,KAAK,KAAK,OAAO;AAC5C,WAAK,EAAE,OAAO,KAAK,KAAK;AACxB;AAAA,IACJ;AACA,QAAIA,SAAQ,KAAK;AACjB,SAAK,YAAY,KAAK,MAAMA,SAAQ,MAAM;AAC1C,SAAK,UAAU,MAAMA,MAAK;AAC1B,SAAK,OAAO;AAAA,MAAK;AAAA,MAAOA;AAAA,MAAO,KAAK;AAAA,MAAW;AAAA;AAAA,IAAgD;AAC/F,QAAI,KAAK;AACL,WAAK,cAAc,KAAK,WAAW,QAAQ,MAAM,KAAK,WAAW,SAAS,OAAO,MAAM,KAAK,EAAE,OAAO,MAAM,KAAK,MAAM,MAAM,MAAM,CAAC,CAAC;AAAA,EAC5I;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ;AACJ,QAAI,SAAS;AACb,QAAI,MAAM,OAAO,OAAO;AAKxB,WAAO,MAAM,KAAK,OAAO,OAAO,MAAM,CAAC,IAAI,OAAO;AAC9C,aAAO;AACX,QAAI,SAAS,OAAO,OAAO,MAAM,GAAG,GAAG,OAAO,OAAO,aAAa;AAElE,WAAO,UAAU,QAAQ,OAAO;AAC5B,eAAS,OAAO;AACpB,WAAO,IAAI,MAAM,KAAK,GAAG,KAAK,MAAM,MAAM,GAAG,KAAK,OAAO,KAAK,WAAW,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,KAAK,YAAY,KAAK,WAAW,MAAM;AAAA,EACxJ;AAAA;AAAA;AAAA,EAGA,gBAAgB,MAAM,SAAS;AAC3B,QAAI,SAAS,QAAQ,KAAK,EAAE,OAAO;AACnC,QAAI;AACA,WAAK,UAAU,MAAM,KAAK,KAAK,SAAS,CAAC;AAC7C,SAAK,UAAU,GAAkB,KAAK,KAAK,SAAS,SAAS,IAAI,CAAC;AAClE,SAAK,MAAM,KAAK,YAAY;AAC5B,SAAK,SAAS;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,MAAM;AACX,aAAS,MAAM,IAAI,eAAe,IAAI,OAAK;AACvC,UAAI,SAAS,KAAK,EAAE,OAAO;AAAA,QAAU,IAAI;AAAA,QAAO;AAAA;AAAA,MAAgC,KAAK,KAAK,EAAE,OAAO,UAAU,IAAI,OAAO,IAAI;AAC5H,UAAI,UAAU;AACV,eAAO;AACX,WAAK,SAAS,UAAkC;AAC5C,eAAO;AACX,UAAI,OAAO,MAAM;AAAA,IACrB;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAIA,gBAAgB,MAAM;AAClB,QAAI,KAAK,MAAM,UAAU;AACrB,aAAO,CAAC;AACZ,QAAI,aAAa,KAAK,EAAE,OAAO,WAAW,KAAK,KAAK;AACpD,QAAI,WAAW,SAAS,KAA2B,KAAK,KAAK,MAAM,UAAU,KAA0C;AACnH,UAAI,OAAO,CAAC;AACZ,eAAS,IAAI,GAAG,GAAG,IAAI,WAAW,QAAQ,KAAK,GAAG;AAC9C,aAAK,IAAI,WAAW,IAAI,CAAC,MAAM,KAAK,SAAS,KAAK,EAAE,OAAO,UAAU,GAAG,IAAI;AACxE,eAAK,KAAK,WAAW,CAAC,GAAG,CAAC;AAAA,MAClC;AACA,UAAI,KAAK,MAAM,SAAS;AACpB,iBAAS,IAAI,GAAG,KAAK,SAAS,KAA2B,KAAK,IAAI,WAAW,QAAQ,KAAK,GAAG;AACzF,cAAI,IAAI,WAAW,IAAI,CAAC;AACxB,cAAI,CAAC,KAAK,KAAK,CAAC,GAAGG,OAAOA,KAAI,KAAM,KAAK,CAAC;AACtC,iBAAK,KAAK,WAAW,CAAC,GAAG,CAAC;AAAA,QAClC;AACJ,mBAAa;AAAA,IACjB;AACA,QAAI,SAAS,CAAC;AACd,aAAS,IAAI,GAAG,IAAI,WAAW,UAAU,OAAO,SAAS,GAAyB,KAAK,GAAG;AACtF,UAAI,IAAI,WAAW,IAAI,CAAC;AACxB,UAAI,KAAK,KAAK;AACV;AACJ,UAAI,QAAQ,KAAK,MAAM;AACvB,YAAM,UAAU,GAAG,KAAK,GAAG;AAC3B,YAAM,UAAU,GAAkB,MAAM,KAAK,MAAM,KAAK,GAAG,IAAI;AAC/D,YAAM,aAAa,WAAW,CAAC,GAAG,KAAK,GAAG;AAC1C,YAAM,SAAS;AACf,aAAO,KAAK,KAAK;AAAA,IACrB;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,cAAc;AACV,QAAI,EAAE,QAAAF,QAAO,IAAI,KAAK;AACtB,QAAI,SAASA,QAAO;AAAA,MAAU,KAAK;AAAA,MAAO;AAAA;AAAA,IAA+B;AACzE,SAAK,SAAS,UAAkC;AAC5C,aAAO;AACX,QAAI,CAACA,QAAO,YAAY,KAAK,OAAO,MAAM,GAAG;AACzC,UAAI,QAAQ,UAAU,IAAkC,OAAO,SAAS;AACxE,UAAI,SAAS,KAAK,MAAM,SAAS,QAAQ;AACzC,UAAI,SAAS,KAAKA,QAAO,QAAQ,KAAK,MAAM,MAAM,GAAG,MAAM,KAAK,IAAI,GAAG;AACnE,YAAI,SAAS,KAAK,oBAAoB;AACtC,YAAI,UAAU;AACV,iBAAO;AACX,iBAAS;AAAA,MACb;AACA,WAAK,UAAU,GAAkB,KAAK,KAAK,KAAK,KAAK,GAAG,IAAI;AAC5D,WAAK,SAAS;AAAA,IAClB;AACA,SAAK,YAAY,KAAK;AACtB,SAAK,OAAO,MAAM;AAClB,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,sBAAsB;AAClB,QAAI,EAAE,QAAAA,QAAO,IAAI,KAAK,GAAG,OAAO,CAAC;AACjC,QAAI,UAAU,CAAC,OAAO,UAAU;AAC5B,UAAI,KAAK,SAAS,KAAK;AACnB;AACJ,WAAK,KAAK,KAAK;AACf,aAAOA,QAAO,WAAW,OAAO,CAAC,WAAW;AACxC,YAAI,UAAU,SAA+B;AAA+B;AAAA,iBACnE,SAAS,OAA+B;AAC7C,cAAI,UAAU,UAAU,MAAoC;AAC5D,cAAI,SAAS,GAAG;AACZ,gBAAI,OAAO,SAAS,OAA8B,SAAS,KAAK,MAAM,SAAS,SAAS;AACxF,gBAAI,UAAU,KAAKA,QAAO,QAAQ,KAAK,MAAM,MAAM,GAAG,MAAM,KAAK,KAAK;AAClE,qBAAQ,UAAU,KAAoC,QAAgC;AAAA,UAC9F;AAAA,QACJ,OACK;AACD,cAAI,QAAQ,QAAQ,QAAQ,QAAQ,CAAC;AACrC,cAAI,SAAS;AACT,mBAAO;AAAA,QACf;AAAA,MACJ,CAAC;AAAA,IACL;AACA,WAAO,QAAQ,KAAK,OAAO,CAAC;AAAA,EAChC;AAAA;AAAA,EAEA,WAAW;AACP,WAAO,CAAC,KAAK,EAAE,OAAO;AAAA,MAAU,KAAK;AAAA,MAAO;AAAA;AAAA,IAA2B,GAAG;AACtE,UAAI,CAAC,KAAK,YAAY,GAAG;AACrB,aAAK,UAAU,GAAkB,KAAK,KAAK,KAAK,KAAK,GAAG,IAAI;AAC5D;AAAA,MACJ;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,UAAU;AACV,QAAI,KAAK,MAAM,UAAU;AACrB,aAAO;AACX,QAAI,EAAE,QAAAA,QAAO,IAAI,KAAK;AACtB,WAAOA,QAAO,KAAKA,QAAO;AAAA,MAAU,KAAK;AAAA,MAAO;AAAA;AAAA,IAA0B,CAAC,KAAK,SAC5E,CAACA,QAAO;AAAA,MAAU,KAAK;AAAA,MAAO;AAAA;AAAA,IAAgC;AAAA,EACtE;AAAA;AAAA;AAAA;AAAA,EAIA,UAAU;AACN,SAAK,QAAQ,KAAK,MAAM,CAAC;AACzB,SAAK,MAAM,SAAS;AAAA,EACxB;AAAA;AAAA,EAEA,UAAU,OAAO;AACb,QAAI,KAAK,SAAS,MAAM,SAAS,KAAK,MAAM,UAAU,MAAM,MAAM;AAC9D,aAAO;AACX,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,KAAK;AACxC,UAAI,KAAK,MAAM,CAAC,KAAK,MAAM,MAAM,CAAC;AAC9B,eAAO;AACf,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,IAAI,SAAS;AAAE,WAAO,KAAK,EAAE;AAAA,EAAQ;AAAA;AAAA;AAAA,EAGrC,eAAe,WAAW;AAAE,WAAO,KAAK,EAAE,OAAO,QAAQ,MAAM,SAAS;AAAA,EAAG;AAAA,EAC3E,aAAa,MAAMD,QAAO;AACtB,QAAI,KAAK;AACL,WAAK,cAAc,KAAK,WAAW,QAAQ,MAAM,KAAK,WAAW,SAAS,MAAM,MAAM,KAAK,EAAE,OAAO,MAAMA,MAAK,CAAC,CAAC;AAAA,EACzH;AAAA,EACA,cAAc,MAAMA,QAAO;AACvB,QAAI,KAAK;AACL,WAAK,cAAc,KAAK,WAAW,QAAQ,OAAO,KAAK,WAAW,SAAS,MAAM,MAAM,KAAK,EAAE,OAAO,MAAMA,MAAK,CAAC,CAAC;AAAA,EAC1H;AAAA;AAAA,EAEA,cAAc;AACV,QAAII,QAAO,KAAK,OAAO,SAAS;AAChC,QAAIA,QAAO,KAAK,KAAK,OAAOA,KAAI,KAAK;AACjC,WAAK,OAAO,KAAK,KAAK,WAAW,MAAM,KAAK,KAAK,KAAK,KAAK,EAAE;AAAA,EACrE;AAAA;AAAA,EAEA,gBAAgB;AACZ,QAAIA,QAAO,KAAK,OAAO,SAAS;AAChC,QAAIA,QAAO,KAAK,KAAK,OAAOA,KAAI,KAAK;AACjC,WAAK,OAAO,KAAK,KAAK,WAAW,KAAK,KAAK,KAAK,KAAK,EAAE;AAAA,EAC/D;AAAA,EACA,cAAc,SAAS;AACnB,QAAI,WAAW,KAAK,WAAW,SAAS;AACpC,UAAI,QAAQ,IAAI,aAAa,KAAK,WAAW,SAAS,OAAO;AAC7D,UAAI,MAAM,QAAQ,KAAK,WAAW;AAC9B,aAAK,YAAY;AACrB,WAAK,aAAa;AAAA,IACtB;AAAA,EACJ;AAAA;AAAA,EAEA,aAAa,WAAW;AACpB,QAAI,YAAY,KAAK,WAAW;AAC5B,WAAK,cAAc;AACnB,WAAK,YAAY;AAAA,IACrB;AAAA,EACJ;AAAA;AAAA,EAEA,QAAQ;AACJ,QAAI,KAAK,cAAc,KAAK,WAAW,QAAQ;AAC3C,WAAK,YAAY;AACrB,QAAI,KAAK,YAAY;AACjB,WAAK,cAAc;AAAA,EAC3B;AACJ;AACA,IAAM,eAAN,MAAmB;AAAA,EACf,YAAY,SAAS,SAAS;AAC1B,SAAK,UAAU;AACf,SAAK,UAAU;AACf,SAAK,OAAO,QAAQ,SAAS,QAAQ,KAAK,OAAO,IAAI;AAAA,EACzD;AACJ;AACA,IAAI;AAAA,CACH,SAAUC,UAAS;AAChB,EAAAA,SAAQA,SAAQ,QAAQ,IAAI,GAAG,IAAI;AACnC,EAAAA,SAAQA,SAAQ,QAAQ,IAAI,GAAG,IAAI;AACnC,EAAAA,SAAQA,SAAQ,QAAQ,IAAI,GAAG,IAAI;AACnC,EAAAA,SAAQA,SAAQ,SAAS,IAAI,CAAC,IAAI;AAClC,EAAAA,SAAQA,SAAQ,qBAAqB,IAAI,GAAG,IAAI;AAChD,EAAAA,SAAQA,SAAQ,wBAAwB,IAAI,GAAG,IAAI;AACnD,EAAAA,SAAQA,SAAQ,iBAAiB,IAAI,GAAI,IAAI;AACjD,GAAG,YAAY,UAAU,CAAC,EAAE;AAG5B,IAAM,iBAAN,MAAqB;AAAA,EACjB,YAAYL,QAAO;AACf,SAAK,QAAQA;AACb,SAAK,QAAQA,OAAM;AACnB,SAAK,QAAQA,OAAM;AACnB,SAAK,OAAO,KAAK,MAAM;AAAA,EAC3B;AAAA,EACA,OAAO,QAAQ;AACX,QAAI,OAAO,SAAS,OAA8B,QAAQ,UAAU;AACpE,QAAI,SAAS,GAAG;AACZ,UAAI,KAAK,SAAS,KAAK,MAAM;AACzB,aAAK,QAAQ,KAAK,MAAM,MAAM;AAClC,WAAK,MAAM,KAAK,KAAK,OAAO,GAAG,CAAC;AAChC,WAAK,QAAQ;AAAA,IACjB,OACK;AACD,WAAK,SAAS,QAAQ,KAAK;AAAA,IAC/B;AACA,QAAI,OAAO,KAAK,MAAM,EAAE,OAAO,QAAQ,KAAK,MAAM,KAAK,OAAO,CAAC,GAAG,MAAM,IAAI;AAC5E,SAAK,QAAQ;AAAA,EACjB;AACJ;AAGA,IAAM,oBAAN,MAAwB;AAAA,EACpB,YAAY,OAAO,KAAK,OAAO;AAC3B,SAAK,QAAQ;AACb,SAAK,MAAM;AACX,SAAK,QAAQ;AACb,SAAK,SAAS,MAAM;AACpB,QAAI,KAAK,SAAS;AACd,WAAK,UAAU;AAAA,EACvB;AAAA,EACA,OAAO,OAAO,OAAO,MAAM,MAAM,aAAa,MAAM,OAAO,QAAQ;AAC/D,WAAO,IAAI,kBAAkB,OAAO,KAAK,MAAM,MAAM,UAAU;AAAA,EACnE;AAAA,EACA,YAAY;AACR,QAAI,OAAO,KAAK,MAAM;AACtB,QAAI,QAAQ,MAAM;AACd,WAAK,QAAQ,KAAK,MAAM,aAAa,KAAK;AAC1C,WAAK,QAAQ;AACb,WAAK,SAAS,KAAK;AAAA,IACvB;AAAA,EACJ;AAAA,EACA,IAAI,KAAK;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EAC/C,IAAI,QAAQ;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EAClD,IAAI,MAAM;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EAChD,IAAI,OAAO;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EACjD,OAAO;AACH,SAAK,SAAS;AACd,SAAK,OAAO;AACZ,QAAI,KAAK,SAAS;AACd,WAAK,UAAU;AAAA,EACvB;AAAA,EACA,OAAO;AACH,WAAO,IAAI,kBAAkB,KAAK,OAAO,KAAK,KAAK,KAAK,KAAK;AAAA,EACjE;AACJ;AAIA,SAAS,YAAY,OAAO,OAAO,aAAa;AAC5C,MAAI,OAAO,SAAS;AAChB,WAAO;AACX,MAAI,QAAQ;AACZ,WAAS,MAAM,GAAG,MAAM,GAAG,MAAM,MAAM,UAAS;AAC5C,QAAI,QAAQ;AACZ,eAAS;AACL,UAAI,OAAO,MAAM,WAAW,KAAK,GAAG,OAAO;AAC3C,UAAI,QAAQ,KAA6B;AACrC,gBAAQ;AACR;AAAA,MACJ;AACA,UAAI,QAAQ;AACR;AACJ,UAAI,QAAQ;AACR;AACJ,UAAI,QAAQ,OAAO;AACnB,UAAI,SAAS,IAAsB;AAC/B,iBAAS;AACT,eAAO;AAAA,MACX;AACA,eAAS;AACT,UAAI;AACA;AACJ,eAAS;AAAA,IACb;AACA,QAAI;AACA,YAAM,KAAK,IAAI;AAAA;AAEf,cAAQ,IAAI,KAAK,KAAK;AAAA,EAC9B;AACA,SAAO;AACX;AAEA,IAAM,cAAN,MAAkB;AAAA,EACd,cAAc;AACV,SAAK,QAAQ;AACb,SAAK,QAAQ;AACb,SAAK,MAAM;AACX,SAAK,WAAW;AAChB,SAAK,YAAY;AACjB,SAAK,OAAO;AACZ,SAAK,UAAU;AAAA,EACnB;AACJ;AACA,IAAM,YAAY,IAAI;AAKtB,IAAM,cAAN,MAAkB;AAAA;AAAA,EAEd,YAEA,OAEA,QAAQ;AACJ,SAAK,QAAQ;AACb,SAAK,SAAS;AAEd,SAAK,QAAQ;AAEb,SAAK,WAAW;AAEhB,SAAK,SAAS;AACd,SAAK,YAAY;AAGjB,SAAK,OAAO;AAEZ,SAAK,QAAQ;AACb,SAAK,aAAa;AAClB,SAAK,MAAM,KAAK,WAAW,OAAO,CAAC,EAAE;AACrC,SAAK,QAAQ,OAAO,CAAC;AACrB,SAAK,MAAM,OAAO,OAAO,SAAS,CAAC,EAAE;AACrC,SAAK,SAAS;AAAA,EAClB;AAAA;AAAA,EAEA,cAAc,QAAQ,OAAO;AACzB,QAAI,QAAQ,KAAK,OAAO,QAAQ,KAAK;AACrC,QAAI,MAAM,KAAK,MAAM;AACrB,WAAO,MAAM,MAAM,MAAM;AACrB,UAAI,CAAC;AACD,eAAO;AACX,UAAI,OAAO,KAAK,OAAO,EAAE,KAAK;AAC9B,aAAO,MAAM,OAAO,KAAK;AACzB,cAAQ;AAAA,IACZ;AACA,WAAO,QAAQ,IAAI,MAAM,MAAM,KAAK,OAAO,MAAM,IAAI;AACjD,UAAI,SAAS,KAAK,OAAO,SAAS;AAC9B,eAAO;AACX,UAAI,OAAO,KAAK,OAAO,EAAE,KAAK;AAC9B,aAAO,KAAK,OAAO,MAAM;AACzB,cAAQ;AAAA,IACZ;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,QAAQ,KAAK;AACT,QAAI,OAAO,KAAK,MAAM,QAAQ,MAAM,KAAK,MAAM;AAC3C,aAAO;AACX,aAAS,SAAS,KAAK;AACnB,UAAI,MAAM,KAAK;AACX,eAAO,KAAK,IAAI,KAAK,MAAM,IAAI;AACvC,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,KAAK,QAAQ;AACT,QAAI,MAAM,KAAK,WAAW,QAAQ,KAAK;AACvC,QAAI,OAAO,KAAK,MAAM,KAAK,MAAM,QAAQ;AACrC,YAAM,KAAK,MAAM;AACjB,eAAS,KAAK,MAAM,WAAW,GAAG;AAAA,IACtC,OACK;AACD,UAAI,WAAW,KAAK,cAAc,QAAQ,CAAC;AAC3C,UAAI,YAAY;AACZ,eAAO;AACX,YAAM;AACN,UAAI,OAAO,KAAK,aAAa,MAAM,KAAK,YAAY,KAAK,OAAO,QAAQ;AACpE,iBAAS,KAAK,OAAO,WAAW,MAAM,KAAK,SAAS;AAAA,MACxD,OACK;AACD,YAAI,IAAI,KAAK,YAAY,QAAQ,KAAK;AACtC,eAAO,MAAM,MAAM;AACf,kBAAQ,KAAK,OAAO,EAAE,CAAC;AAC3B,aAAK,SAAS,KAAK,MAAM,MAAM,KAAK,YAAY,GAAG;AACnD,YAAI,MAAM,KAAK,OAAO,SAAS,MAAM;AACjC,eAAK,SAAS,KAAK,OAAO,MAAM,GAAG,MAAM,KAAK,GAAG;AACrD,iBAAS,KAAK,OAAO,WAAW,CAAC;AAAA,MACrC;AAAA,IACJ;AACA,QAAI,OAAO,KAAK,MAAM;AAClB,WAAK,MAAM,YAAY,MAAM;AACjC,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,YAAY,OAAO,YAAY,GAAG;AAC9B,QAAIE,OAAM,YAAY,KAAK,cAAc,WAAW,EAAE,IAAI,KAAK;AAC/D,QAAIA,QAAO,QAAQA,OAAM,KAAK,MAAM;AAChC,YAAM,IAAI,WAAW,yBAAyB;AAClD,SAAK,MAAM,QAAQ;AACnB,SAAK,MAAM,MAAMA;AAAA,EACrB;AAAA,EACA,WAAW;AACP,QAAI,KAAK,OAAO,KAAK,aAAa,KAAK,MAAM,KAAK,YAAY,KAAK,OAAO,QAAQ;AAC9E,UAAI,EAAE,OAAO,SAAS,IAAI;AAC1B,WAAK,QAAQ,KAAK;AAClB,WAAK,WAAW,KAAK;AACrB,WAAK,SAAS;AACd,WAAK,YAAY;AACjB,WAAK,WAAW,KAAK,MAAM,KAAK;AAAA,IACpC,OACK;AACD,WAAK,SAAS,KAAK;AACnB,WAAK,YAAY,KAAK;AACtB,UAAI,YAAY,KAAK,MAAM,MAAM,KAAK,GAAG;AACzC,UAAIA,OAAM,KAAK,MAAM,UAAU;AAC/B,WAAK,QAAQA,OAAM,KAAK,MAAM,KAAK,UAAU,MAAM,GAAG,KAAK,MAAM,KAAK,KAAK,GAAG,IAAI;AAClF,WAAK,WAAW,KAAK;AACrB,WAAK,WAAW;AAAA,IACpB;AAAA,EACJ;AAAA,EACA,WAAW;AACP,QAAI,KAAK,YAAY,KAAK,MAAM,QAAQ;AACpC,WAAK,SAAS;AACd,UAAI,KAAK,YAAY,KAAK,MAAM;AAC5B,eAAO,KAAK,OAAO;AAAA,IAC3B;AACA,WAAO,KAAK,OAAO,KAAK,MAAM,WAAW,KAAK,QAAQ;AAAA,EAC1D;AAAA;AAAA;AAAA,EAGA,QAAQ,IAAI,GAAG;AACX,SAAK,YAAY;AACjB,WAAO,KAAK,MAAM,KAAK,KAAK,MAAM,IAAI;AAClC,UAAI,KAAK,cAAc,KAAK,OAAO,SAAS;AACxC,eAAO,KAAK,QAAQ;AACxB,WAAK,KAAK,MAAM,KAAK,KAAK;AAC1B,WAAK,QAAQ,KAAK,OAAO,EAAE,KAAK,UAAU;AAC1C,WAAK,MAAM,KAAK,MAAM;AAAA,IAC1B;AACA,SAAK,OAAO;AACZ,QAAI,KAAK,OAAO,KAAK,MAAM;AACvB,WAAK,MAAM,YAAY,KAAK,MAAM;AACtC,WAAO,KAAK,SAAS;AAAA,EACzB;AAAA,EACA,UAAU;AACN,SAAK,MAAM,KAAK,WAAW,KAAK;AAChC,SAAK,QAAQ,KAAK,OAAO,KAAK,aAAa,KAAK,OAAO,SAAS,CAAC;AACjE,SAAK,QAAQ;AACb,WAAO,KAAK,OAAO;AAAA,EACvB;AAAA;AAAA,EAEA,MAAM,KAAK,OAAO;AACd,QAAI,OAAO;AACP,WAAK,QAAQ;AACb,YAAM,QAAQ;AACd,YAAM,YAAY,MAAM;AACxB,YAAM,QAAQ,MAAM,WAAW;AAAA,IACnC,OACK;AACD,WAAK,QAAQ;AAAA,IACjB;AACA,QAAI,KAAK,OAAO,KAAK;AACjB,WAAK,MAAM;AACX,UAAI,OAAO,KAAK,KAAK;AACjB,aAAK,QAAQ;AACb,eAAO;AAAA,MACX;AACA,aAAO,MAAM,KAAK,MAAM;AACpB,aAAK,QAAQ,KAAK,OAAO,EAAE,KAAK,UAAU;AAC9C,aAAO,OAAO,KAAK,MAAM;AACrB,aAAK,QAAQ,KAAK,OAAO,EAAE,KAAK,UAAU;AAC9C,UAAI,OAAO,KAAK,YAAY,MAAM,KAAK,WAAW,KAAK,MAAM,QAAQ;AACjE,aAAK,WAAW,MAAM,KAAK;AAAA,MAC/B,OACK;AACD,aAAK,QAAQ;AACb,aAAK,WAAW;AAAA,MACpB;AACA,WAAK,SAAS;AAAA,IAClB;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,KAAK,MAAM,IAAI;AACX,QAAI,QAAQ,KAAK,YAAY,MAAM,KAAK,WAAW,KAAK,MAAM;AAC1D,aAAO,KAAK,MAAM,MAAM,OAAO,KAAK,UAAU,KAAK,KAAK,QAAQ;AACpE,QAAI,QAAQ,KAAK,aAAa,MAAM,KAAK,YAAY,KAAK,OAAO;AAC7D,aAAO,KAAK,OAAO,MAAM,OAAO,KAAK,WAAW,KAAK,KAAK,SAAS;AACvE,QAAI,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,MAAM;AAC5C,aAAO,KAAK,MAAM,KAAK,MAAM,EAAE;AACnC,QAAI,SAAS;AACb,aAAS,KAAK,KAAK,QAAQ;AACvB,UAAI,EAAE,QAAQ;AACV;AACJ,UAAI,EAAE,KAAK;AACP,kBAAU,KAAK,MAAM,KAAK,KAAK,IAAI,EAAE,MAAM,IAAI,GAAG,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;AAAA,IAC5E;AACA,WAAO;AAAA,EACX;AACJ;AAEA,IAAM,aAAN,MAAiB;AAAA,EACb,YAAY,MAAM,IAAI;AAClB,SAAK,OAAO;AACZ,SAAK,KAAK;AAAA,EACd;AAAA,EACA,MAAM,OAAO,OAAO;AAChB,QAAI,EAAE,QAAAD,QAAO,IAAI,MAAM;AACvB,cAAU,KAAK,MAAM,OAAO,OAAO,KAAK,IAAIA,QAAO,MAAMA,QAAO,cAAc;AAAA,EAClF;AACJ;AACA,WAAW,UAAU,aAAa,WAAW,UAAU,WAAW,WAAW,UAAU,SAAS;AAEhG,IAAM,kBAAN,MAAsB;AAAA,EAClB,YAAY,MAAM,WAAW,WAAW;AACpC,SAAK,YAAY;AACjB,SAAK,YAAY;AACjB,SAAK,OAAO,OAAO,QAAQ,WAAW,YAAY,IAAI,IAAI;AAAA,EAC9D;AAAA,EACA,MAAM,OAAO,OAAO;AAChB,QAAID,SAAQ,MAAM,KAAK,UAAU;AACjC,eAAS;AACL,UAAI,QAAQ,MAAM,OAAO,GAAG,UAAU,MAAM,cAAc,GAAG,CAAC;AAC9D,gBAAU,KAAK,MAAM,OAAO,OAAO,GAAG,KAAK,MAAM,KAAK,SAAS;AAC/D,UAAI,MAAM,MAAM,QAAQ;AACpB;AACJ,UAAI,KAAK,aAAa;AAClB;AACJ,UAAI,CAAC;AACD;AACJ,UAAI,WAAW;AACX;AACJ,YAAM,MAAM,SAAS,MAAM,KAAK;AAAA,IACpC;AACA,QAAI,SAAS;AACT,YAAM,MAAMA,QAAO,MAAM,KAAK;AAC9B,YAAM,YAAY,KAAK,WAAW,OAAO;AAAA,IAC7C;AAAA,EACJ;AACJ;AACA,gBAAgB,UAAU,aAAa,WAAW,UAAU,WAAW,WAAW,UAAU,SAAS;AAsCrG,SAAS,UAAU,MAAM,OAAO,OAAO,OAAO,WAAW,YAAY;AACjE,MAAI,QAAQ,GAAG,YAAY,KAAK,OAAO,EAAE,QAAQ,IAAI,MAAM,EAAE;AAC7D;AAAM,eAAS;AACX,WAAK,YAAY,KAAK,KAAK,MAAM;AAC7B;AACJ,UAAI,SAAS,KAAK,QAAQ,CAAC;AAI3B,eAAS,IAAI,QAAQ,GAAG,IAAI,QAAQ,KAAK;AACrC,aAAK,KAAK,IAAI,CAAC,IAAI,aAAa,GAAG;AAC/B,cAAI,OAAO,KAAK,CAAC;AACjB,cAAI,QAAQ,OAAO,IAAI,MAClB,MAAM,MAAM,SAAS,MAAM,MAAM,MAAM,SAAS,QAC7C,UAAU,MAAM,MAAM,MAAM,OAAO,WAAW,UAAU,IAAI;AAChE,kBAAM,YAAY,IAAI;AACtB;AAAA,UACJ;AAAA,QACJ;AACJ,UAAI,OAAO,MAAM,MAAM,MAAM,GAAG,OAAO,KAAK,QAAQ,CAAC;AAErD,UAAI,MAAM,OAAO,KAAK,OAAO,OAAO,KAAK,SAAS,OAAO,IAAI,CAAC,KAAK,SAAuB,KAAK,SAAS,OAAO,IAAI,CAAC,KAAK,OAAqB;AAC1I,gBAAQ,KAAK,SAAS,OAAO,IAAI,CAAC;AAClC,iBAAS;AAAA,MACb;AAEA,aAAO,MAAM,QAAO;AAChB,YAAI,MAAO,MAAM,QAAS;AAC1B,YAAI,QAAQ,SAAS,OAAO,OAAO;AACnC,YAAI,OAAO,KAAK,KAAK,GAAG,KAAK,KAAK,QAAQ,CAAC,KAAK;AAChD,YAAI,OAAO;AACP,iBAAO;AAAA,iBACF,QAAQ;AACb,gBAAM,MAAM;AAAA,aACX;AACD,kBAAQ,KAAK,QAAQ,CAAC;AACtB,gBAAM,QAAQ;AACd,mBAAS;AAAA,QACb;AAAA,MACJ;AACA;AAAA,IACJ;AACJ;AACA,SAAS,WAAW,MAAMM,QAAO,MAAM;AACnC,WAAS,IAAIA,QAAO,OAAO,OAAO,KAAK,CAAC,MAAM,OAAqB;AAC/D,QAAI,QAAQ;AACR,aAAO,IAAIA;AACnB,SAAO;AACX;AACA,SAAS,UAAU,OAAO,MAAM,WAAW,aAAa;AACpD,MAAI,QAAQ,WAAW,WAAW,aAAa,IAAI;AACnD,SAAO,QAAQ,KAAK,WAAW,WAAW,aAAa,KAAK,IAAI;AACpE;AAGA,IAAM,UAAU,OAAO,WAAW,eAAe,QAAQ,OAAO,YAAY,KAAK,QAAQ,IAAI,GAAG;AAChG,IAAI,WAAW;AACf,IAAI;AAAA,CACH,SAAUC,SAAQ;AACf,EAAAA,QAAOA,QAAO,QAAQ,IAAI,EAAE,IAAI;AACpC,GAAG,WAAW,SAAS,CAAC,EAAE;AAC1B,SAAS,MAAM,MAAM,KAAK,MAAM;AAC5B,MAAI,SAAS,KAAK,OAAO,SAAS,gBAAgB;AAClD,SAAO,OAAO,GAAG;AACjB,aAAS;AACL,QAAI,EAAE,OAAO,IAAI,OAAO,YAAY,GAAG,IAAI,OAAO,WAAW,GAAG;AAC5D,iBAAS;AACL,aAAK,OAAO,IAAI,OAAO,KAAK,MAAM,OAAO,OAAO,QAAQ,CAAC,OAAO,KAAK;AACjE,iBAAO,OAAO,IAAI,KAAK,IAAI,GAAG,KAAK;AAAA,YAAI,OAAO,KAAK;AAAA,YAAG,MAAM;AAAA;AAAA,UAAsB,CAAC,IAC7E,KAAK,IAAI,KAAK,QAAQ,KAAK;AAAA,YAAI,OAAO,OAAO;AAAA,YAAG,MAAM;AAAA;AAAA,UAAsB,CAAC;AACvF,YAAI,OAAO,IAAI,OAAO,YAAY,IAAI,OAAO,YAAY;AACrD;AACJ,YAAI,CAAC,OAAO,OAAO;AACf,iBAAO,OAAO,IAAI,IAAI,KAAK;AAAA,MACnC;AAAA,EACR;AACJ;AACA,IAAM,iBAAN,MAAqB;AAAA,EACjB,YAAY,WAAW,SAAS;AAC5B,SAAK,YAAY;AACjB,SAAK,UAAU;AACf,SAAK,IAAI;AACT,SAAK,WAAW;AAChB,SAAK,WAAW;AAChB,SAAK,SAAS;AACd,SAAK,QAAQ,CAAC;AACd,SAAK,QAAQ,CAAC;AACd,SAAK,QAAQ,CAAC;AACd,SAAK,aAAa;AAAA,EACtB;AAAA,EACA,eAAe;AACX,QAAI,KAAK,KAAK,WAAW,KAAK,KAAK,KAAK,UAAU,SAAS,OAAO,KAAK,UAAU,KAAK,GAAG;AACzF,QAAI,IAAI;AACJ,WAAK,WAAW,GAAG,YAAY,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,QAAQ,CAAC,IAAI,GAAG,SAAS,GAAG;AACvF,WAAK,SAAS,GAAG,UAAU,MAAM,GAAG,MAAM,GAAG,KAAK,GAAG,QAAQ,EAAE,IAAI,GAAG,SAAS,GAAG;AAClF,aAAO,KAAK,MAAM,QAAQ;AACtB,aAAK,MAAM,IAAI;AACf,aAAK,MAAM,IAAI;AACf,aAAK,MAAM,IAAI;AAAA,MACnB;AACA,WAAK,MAAM,KAAK,GAAG,IAAI;AACvB,WAAK,MAAM,KAAK,CAAC,GAAG,MAAM;AAC1B,WAAK,MAAM,KAAK,CAAC;AACjB,WAAK,YAAY,KAAK;AAAA,IAC1B,OACK;AACD,WAAK,YAAY;AAAA,IACrB;AAAA,EACJ;AAAA;AAAA,EAEA,OAAO,KAAK;AACR,QAAI,MAAM,KAAK;AACX,aAAO;AACX,WAAO,KAAK,YAAY,KAAK,UAAU;AACnC,WAAK,aAAa;AACtB,QAAI,CAAC,KAAK;AACN,aAAO;AACX,eAAS;AACL,UAAIC,QAAO,KAAK,MAAM,SAAS;AAC/B,UAAIA,QAAO,GAAG;AACV,aAAK,aAAa;AAClB,eAAO;AAAA,MACX;AACA,UAAI,MAAM,KAAK,MAAMA,KAAI,GAAG,QAAQ,KAAK,MAAMA,KAAI;AACnD,UAAI,SAAS,IAAI,SAAS,QAAQ;AAC9B,aAAK,MAAM,IAAI;AACf,aAAK,MAAM,IAAI;AACf,aAAK,MAAM,IAAI;AACf;AAAA,MACJ;AACA,UAAI,OAAO,IAAI,SAAS,KAAK;AAC7B,UAAIF,SAAQ,KAAK,MAAME,KAAI,IAAI,IAAI,UAAU,KAAK;AAClD,UAAIF,SAAQ,KAAK;AACb,aAAK,YAAYA;AACjB,eAAO;AAAA,MACX;AACA,UAAI,gBAAgB,MAAM;AACtB,YAAIA,UAAS,KAAK;AACd,cAAIA,SAAQ,KAAK;AACb,mBAAO;AACX,cAAIG,OAAMH,SAAQ,KAAK;AACvB,cAAIG,QAAO,KAAK,QAAQ;AACpB,gBAAI,YAAY,KAAK,KAAK,SAAS,SAAS;AAC5C,gBAAI,CAAC,aAAaA,OAAM,YAAY,KAAK,SAAS;AAC9C,qBAAO;AAAA,UACf;AAAA,QACJ;AACA,aAAK,MAAMD,KAAI;AACf,YAAIF,SAAQ,KAAK,UAAU,KAAK,IAAI,KAAK,UAAU,GAAG,GAAG;AACrD,eAAK,MAAM,KAAK,IAAI;AACpB,eAAK,MAAM,KAAKA,MAAK;AACrB,eAAK,MAAM,KAAK,CAAC;AAAA,QACrB;AAAA,MACJ,OACK;AACD,aAAK,MAAME,KAAI;AACf,aAAK,YAAYF,SAAQ,KAAK;AAAA,MAClC;AAAA,IACJ;AAAA,EACJ;AACJ;AACA,IAAM,aAAN,MAAiB;AAAA,EACb,YAAYI,SAAQ,QAAQ;AACxB,SAAK,SAAS;AACd,SAAK,SAAS,CAAC;AACf,SAAK,YAAY;AACjB,SAAK,UAAU,CAAC;AAChB,SAAK,SAASA,QAAO,WAAW,IAAI,OAAK,IAAI,aAAW;AAAA,EAC5D;AAAA,EACA,WAAW,OAAO;AACd,QAAI,cAAc;AAClB,QAAI,OAAO;AACX,QAAI,EAAE,QAAAA,QAAO,IAAI,MAAM,GAAG,EAAE,WAAW,IAAIA;AAC3C,QAAI,OAAOA,QAAO;AAAA,MAAU,MAAM;AAAA,MAAO;AAAA;AAAA,IAAgC;AACzE,QAAI,UAAU,MAAM,aAAa,MAAM,WAAW,OAAO;AACzD,QAAI,YAAY;AAChB,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AACxC,WAAM,KAAK,IAAK,SAAS;AACrB;AACJ,UAAI,YAAY,WAAW,CAAC,GAAG,QAAQ,KAAK,OAAO,CAAC;AACpD,UAAI,QAAQ,CAAC,UAAU;AACnB;AACJ,UAAI,UAAU,cAAc,MAAM,SAAS,MAAM,OAAO,MAAM,QAAQ,QAAQ,MAAM,WAAW,SAAS;AACpG,aAAK,kBAAkB,OAAO,WAAW,KAAK;AAC9C,cAAM,OAAO;AACb,cAAM,UAAU;AAAA,MACpB;AACA,UAAI,MAAM,YAAY,MAAM,MAAM;AAC9B,oBAAY,KAAK,IAAI,MAAM,WAAW,SAAS;AACnD,UAAI,MAAM,SAAS,GAAkB;AACjC,YAAI,aAAa;AACjB,YAAI,MAAM,WAAW;AACjB,wBAAc,KAAK,WAAW,OAAO,MAAM,UAAU,MAAM,KAAK,WAAW;AAC/E,sBAAc,KAAK,WAAW,OAAO,MAAM,OAAO,MAAM,KAAK,WAAW;AACxE,YAAI,CAAC,UAAU,QAAQ;AACnB,iBAAO;AACP,cAAI,cAAc;AACd;AAAA,QACR;AAAA,MACJ;AAAA,IACJ;AACA,WAAO,KAAK,QAAQ,SAAS;AACzB,WAAK,QAAQ,IAAI;AACrB,QAAI;AACA,YAAM,aAAa,SAAS;AAChC,QAAI,CAAC,QAAQ,MAAM,OAAO,KAAK,OAAO,KAAK;AACvC,aAAO,IAAI;AACX,WAAK,QAAQ,MAAM,EAAE,OAAO;AAC5B,WAAK,QAAQ,KAAK,MAAM,MAAM;AAC9B,oBAAc,KAAK,WAAW,OAAO,KAAK,OAAO,KAAK,KAAK,WAAW;AAAA,IAC1E;AACA,SAAK,YAAY;AACjB,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,aAAa,OAAO;AAChB,QAAI,KAAK;AACL,aAAO,KAAK;AAChB,QAAI,OAAO,IAAI,eAAa,EAAE,KAAK,EAAE,IAAI;AACzC,SAAK,QAAQ;AACb,SAAK,MAAM,KAAK,IAAI,MAAM,GAAG,EAAE,OAAO,GAAG;AACzC,SAAK,QAAQ,OAAO,EAAE,OAAO,MAAM,EAAE,OAAO,UAAU;AACtD,WAAO;AAAA,EACX;AAAA,EACA,kBAAkB,OAAO,WAAW,OAAO;AACvC,QAAIJ,SAAQ,KAAK,OAAO,QAAQ,MAAM,GAAG;AACzC,cAAU,MAAM,KAAK,OAAO,MAAMA,QAAO,KAAK,GAAG,KAAK;AACtD,QAAI,MAAM,QAAQ,IAAI;AAClB,UAAI,EAAE,QAAAI,QAAO,IAAI,MAAM;AACvB,eAAS,IAAI,GAAG,IAAIA,QAAO,YAAY,QAAQ;AAC3C,YAAIA,QAAO,YAAY,CAAC,KAAK,MAAM,OAAO;AACtC,cAAI,SAASA,QAAO,aAAa,CAAC,EAAE,KAAK,OAAO,KAAK,MAAM,OAAO,MAAM,GAAG,GAAG,KAAK;AACnF,cAAI,UAAU,KAAK,MAAM,EAAE,OAAO,QAAQ,OAAO,UAAU,CAAC,GAAG;AAC3D,iBAAK,SAAS,MAAM;AAChB,oBAAM,QAAQ,UAAU;AAAA;AAExB,oBAAM,WAAW,UAAU;AAC/B;AAAA,UACJ;AAAA,QACJ;AAAA,IACR,OACK;AACD,YAAM,QAAQ;AACd,YAAM,MAAM,KAAK,OAAO,QAAQJ,SAAQ,CAAC;AAAA,IAC7C;AAAA,EACJ;AAAA,EACA,UAAU,QAAQ,OAAOG,MAAK,OAAO;AAEjC,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,UAAI,KAAK,QAAQ,CAAC,KAAK;AACnB,eAAO;AACf,SAAK,QAAQ,OAAO,IAAI;AACxB,SAAK,QAAQ,OAAO,IAAI;AACxB,SAAK,QAAQ,OAAO,IAAIA;AACxB,WAAO;AAAA,EACX;AAAA,EACA,WAAW,OAAO,OAAOA,MAAK,OAAO;AACjC,QAAI,EAAE,MAAM,IAAI,OAAO,EAAE,QAAAC,QAAO,IAAI,MAAM,GAAG,EAAE,KAAK,IAAIA;AACxD,aAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAC9B,eAAS,IAAIA,QAAO;AAAA,QAAU;AAAA,QAAO,MAAM,IAA0B;AAAA;AAAA,MAA0B,KAAI,KAAK,GAAG;AACvG,YAAI,KAAK,CAAC,KAAK,OAAqB;AAChC,cAAI,KAAK,IAAI,CAAC,KAAK,GAAkB;AACjC,gBAAI,KAAK,MAAM,IAAI,CAAC;AAAA,UACxB,OACK;AACD,gBAAI,SAAS,KAAK,KAAK,IAAI,CAAC,KAAK;AAC7B,sBAAQ,KAAK,UAAU,KAAK,MAAM,IAAI,CAAC,GAAG,OAAOD,MAAK,KAAK;AAC/D;AAAA,UACJ;AAAA,QACJ;AACA,YAAI,KAAK,CAAC,KAAK;AACX,kBAAQ,KAAK,UAAU,KAAK,MAAM,IAAI,CAAC,GAAG,OAAOA,MAAK,KAAK;AAAA,MACnE;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ;AACA,IAAI;AAAA,CACH,SAAUE,MAAK;AACZ,EAAAA,KAAIA,KAAI,UAAU,IAAI,CAAC,IAAI;AAC3B,EAAAA,KAAIA,KAAI,qBAAqB,IAAI,CAAC,IAAI;AAGtC,EAAAA,KAAIA,KAAI,sBAAsB,IAAI,GAAG,IAAI;AACzC,EAAAA,KAAIA,KAAI,kBAAkB,IAAI,EAAE,IAAI;AAIpC,EAAAA,KAAIA,KAAI,UAAU,IAAI,IAAK,IAAI;AAC/B,EAAAA,KAAIA,KAAI,OAAO,IAAI,GAAI,IAAI;AAC3B,EAAAA,KAAIA,KAAI,kCAAkC,IAAI,GAAG,IAAI;AAIrD,EAAAA,KAAIA,KAAI,eAAe,IAAI,EAAE,IAAI;AACrC,GAAG,QAAQ,MAAM,CAAC,EAAE;AACpB,IAAM,QAAN,MAAY;AAAA,EACR,YAAYD,SAAQ,OAAO,WAAW,QAAQ;AAC1C,SAAK,SAASA;AACd,SAAK,QAAQ;AACb,SAAK,SAAS;AACd,SAAK,aAAa;AAClB,SAAK,cAAc;AACnB,SAAK,cAAc;AACnB,SAAK,SAAS,CAAC;AACf,SAAK,YAAY;AACjB,SAAK,wBAAwB;AAC7B,SAAK,uBAAuB;AAC5B,SAAK,oBAAoB;AACzB,SAAK,SAAS,IAAI,YAAY,OAAO,MAAM;AAC3C,SAAK,SAAS,IAAI,WAAWA,SAAQ,KAAK,MAAM;AAChD,SAAK,UAAUA,QAAO,IAAI,CAAC;AAC3B,QAAI,EAAE,KAAK,IAAI,OAAO,CAAC;AACvB,SAAK,SAAS,CAAC,MAAM,MAAM,MAAMA,QAAO,IAAI,CAAC,GAAG,IAAI,CAAC;AACrD,SAAK,YAAY,UAAU,UAAU,KAAK,OAAO,MAAM,OAAOA,QAAO,eAAe,IAC9E,IAAI,eAAe,WAAWA,QAAO,OAAO,IAAI;AAAA,EAC1D;AAAA,EACA,IAAI,YAAY;AACZ,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU;AACN,QAAI,SAAS,KAAK,QAAQ,MAAM,KAAK;AAErC,QAAI,YAAY,KAAK,SAAS,CAAC;AAC/B,QAAI,SAAS;AAQb,QAAI,KAAK,oBAAoB,OAAkD,OAAO,UAAU,GAAG;AAC/F,UAAI,CAAC,CAAC,IAAI;AACV,aAAO,EAAE,YAAY,KAAK,EAAE,MAAM,UAAU,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC,KAAK,KAAK,uBAAuB;AAAA,MAAE;AACzG,WAAK,oBAAoB,KAAK,uBAAuB;AAAA,IACzD;AAIA,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,UAAI,QAAQ,OAAO,CAAC;AACpB,iBAAS;AACL,aAAK,OAAO,YAAY;AACxB,YAAI,MAAM,MAAM,KAAK;AACjB,oBAAU,KAAK,KAAK;AAAA,QACxB,WACS,KAAK,aAAa,OAAO,WAAW,MAAM,GAAG;AAClD;AAAA,QACJ,OACK;AACD,cAAI,CAAC,SAAS;AACV,sBAAU,CAAC;AACX,4BAAgB,CAAC;AAAA,UACrB;AACA,kBAAQ,KAAK,KAAK;AAClB,cAAI,MAAM,KAAK,OAAO,aAAa,KAAK;AACxC,wBAAc,KAAK,IAAI,OAAO,IAAI,GAAG;AAAA,QACzC;AACA;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,CAAC,UAAU,QAAQ;AACnB,UAAI,WAAW,WAAW,aAAa,OAAO;AAC9C,UAAI;AACA,eAAO,KAAK,YAAY,QAAQ;AACpC,UAAI,KAAK,OAAO,QAAQ;AACpB,YAAI,WAAW;AACX,kBAAQ,IAAI,uBAAuB,KAAK,OAAO,YAAY,KAAK,OAAO,QAAQ,KAAK,OAAO,UAAU,KAAK,IAAI,OAAO;AACzH,cAAM,IAAI,YAAY,iBAAiB,GAAG;AAAA,MAC9C;AACA,UAAI,CAAC,KAAK;AACN,aAAK,aAAa;AAAA,IAC1B;AACA,QAAI,KAAK,cAAc,SAAS;AAC5B,UAAI,WAAW,KAAK,aAAa,QAAQ,QAAQ,CAAC,EAAE,MAAM,KAAK,YAAY,QAAQ,CAAC,IAC9E,KAAK,YAAY,SAAS,eAAe,SAAS;AACxD,UAAI;AACA,eAAO,KAAK,YAAY,SAAS,SAAS,CAAC;AAAA,IACnD;AACA,QAAI,KAAK,YAAY;AACjB,UAAI,eAAe,KAAK,cAAc,IAAI,IAAI,KAAK,aAAa;AAChE,UAAI,UAAU,SAAS,cAAc;AACjC,kBAAU,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC1C,eAAO,UAAU,SAAS;AACtB,oBAAU,IAAI;AAAA,MACtB;AACA,UAAI,UAAU,KAAK,OAAK,EAAE,YAAY,GAAG;AACrC,aAAK;AAAA,IACb,WACS,UAAU,SAAS,GAAG;AAI3B;AAAO,iBAAS,IAAI,GAAG,IAAI,UAAU,SAAS,GAAG,KAAK;AAClD,cAAI,QAAQ,UAAU,CAAC;AACvB,mBAAS,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAC3C,gBAAI,QAAQ,UAAU,CAAC;AACvB,gBAAI,MAAM,UAAU,KAAK,KACrB,MAAM,OAAO,SAAS,OAAsC,MAAM,OAAO,SAAS,KAAoC;AACtH,mBAAM,MAAM,QAAQ,MAAM,SAAW,MAAM,OAAO,SAAS,MAAM,OAAO,UAAW,GAAG;AAClF,0BAAU,OAAO,KAAK,CAAC;AAAA,cAC3B,OACK;AACD,0BAAU,OAAO,KAAK,CAAC;AACvB,yBAAS;AAAA,cACb;AAAA,YACJ;AAAA,UACJ;AAAA,QACJ;AACA,UAAI,UAAU,SAAS;AACnB,kBAAU;AAAA,UAAO;AAAA,UAA4B,UAAU,SAAS;AAAA;AAAA,QAA0B;AAAA,IAClG;AACA,SAAK,cAAc,UAAU,CAAC,EAAE;AAChC,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ;AAClC,UAAI,UAAU,CAAC,EAAE,MAAM,KAAK;AACxB,aAAK,cAAc,UAAU,CAAC,EAAE;AACxC,WAAO;AAAA,EACX;AAAA,EACA,OAAO,KAAK;AACR,QAAI,KAAK,aAAa,QAAQ,KAAK,YAAY;AAC3C,YAAM,IAAI,WAAW,8BAA8B;AACvD,SAAK,YAAY;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa,OAAO,QAAQ,OAAO;AAC/B,QAAIJ,SAAQ,MAAM,KAAK,EAAE,QAAAI,QAAO,IAAI;AACpC,QAAI,OAAO,UAAU,KAAK,QAAQ,KAAK,IAAI,SAAS;AACpD,QAAI,KAAK,aAAa,QAAQJ,SAAQ,KAAK;AACvC,aAAO,MAAM,YAAY,IAAI,QAAQ;AACzC,QAAI,KAAK,WAAW;AAChB,UAAI,WAAW,MAAM,cAAc,MAAM,WAAW,QAAQ,QAAQ,SAAS,WAAW,MAAM,WAAW,OAAO;AAChH,eAAS,SAAS,KAAK,UAAU,OAAOA,MAAK,GAAG,UAAS;AACrD,YAAI,QAAQ,KAAK,OAAO,QAAQ,MAAM,OAAO,KAAK,EAAE,KAAK,OAAO,OAAOI,QAAO,QAAQ,MAAM,OAAO,OAAO,KAAK,EAAE,IAAI;AACrH,YAAI,QAAQ,MAAM,OAAO,WAAW,CAAC,aAAa,OAAO,KAAK,SAAS,WAAW,KAAK,MAAM,SAAS;AAClG,gBAAM,QAAQ,QAAQ,KAAK;AAC3B,cAAI;AACA,oBAAQ,IAAI,OAAO,KAAK,QAAQ,KAAK,IAAI,kBAAkBA,QAAO,QAAQ,OAAO,KAAK,EAAE,IAAI;AAChG,iBAAO;AAAA,QACX;AACA,YAAI,EAAE,kBAAkB,SAAS,OAAO,SAAS,UAAU,KAAK,OAAO,UAAU,CAAC,IAAI;AAClF;AACJ,YAAI,QAAQ,OAAO,SAAS,CAAC;AAC7B,YAAI,iBAAiB,QAAQ,OAAO,UAAU,CAAC,KAAK;AAChD,mBAAS;AAAA;AAET;AAAA,MACR;AAAA,IACJ;AACA,QAAI,gBAAgBA,QAAO;AAAA,MAAU,MAAM;AAAA,MAAO;AAAA;AAAA,IAAgC;AAClF,QAAI,gBAAgB,GAAG;AACnB,YAAM,OAAO,aAAa;AAC1B,UAAI;AACA,gBAAQ,IAAI,OAAO,KAAK,QAAQ,KAAK,IAAI,uBAAuBA,QAAO;AAAA,UAAQ,gBAAgB;AAAA;AAAA,QAA4B,IAAI;AACnI,aAAO;AAAA,IACX;AACA,QAAI,MAAM,MAAM,UAAU,MAA0B;AAChD,aAAO,MAAM,MAAM,SAAS,OAAwB,MAAM,YAAY,GAAG;AAAA,MAAE;AAAA,IAC/E;AACA,QAAI,UAAU,KAAK,OAAO,WAAW,KAAK;AAC1C,aAAS,IAAI,GAAG,IAAI,QAAQ,UAAS;AACjC,UAAI,SAAS,QAAQ,GAAG,GAAG,OAAO,QAAQ,GAAG,GAAGD,OAAM,QAAQ,GAAG;AACjE,UAAID,QAAO,KAAK,QAAQ,UAAU,CAAC;AACnC,UAAI,aAAaA,QAAO,QAAQ,MAAM,MAAM;AAC5C,iBAAW,MAAM,QAAQ,MAAMC,IAAG;AAClC,UAAI;AACA,gBAAQ,IAAI,OAAO,KAAK,QAAQ,UAAU,IAAI,UAAU,SAAS,UAAkC,IAAI,UACjG,aAAaC,QAAO;AAAA,UAAQ,SAAS;AAAA;AAAA,QAA4B,WAAWA,QAAO,QAAQ,IAAI,OAAOJ,SAAQ,cAAc,QAAQ,KAAK,YAAY;AAC/J,UAAIE;AACA,eAAO;AAAA,eACF,WAAW,MAAMF;AACtB,eAAO,KAAK,UAAU;AAAA;AAEtB,cAAM,KAAK,UAAU;AAAA,IAC7B;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,aAAa,OAAO,WAAW;AAC3B,QAAI,MAAM,MAAM;AAChB,eAAS;AACL,UAAI,CAAC,KAAK,aAAa,OAAO,MAAM,IAAI;AACpC,eAAO;AACX,UAAI,MAAM,MAAM,KAAK;AACjB,uBAAe,OAAO,SAAS;AAC/B,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,YAAY,QAAQ,QAAQ,WAAW;AACnC,QAAI,WAAW,MAAM,YAAY;AACjC,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,UAAI,QAAQ,OAAO,CAAC,GAAG,QAAQ,OAAO,KAAK,CAAC,GAAG,WAAW,QAAQ,KAAK,KAAK,CAAC;AAC7E,UAAI,OAAO,UAAU,KAAK,QAAQ,KAAK,IAAI,SAAS;AACpD,UAAI,MAAM,SAAS;AACf,YAAI;AACA;AACJ,oBAAY;AACZ,cAAM,QAAQ;AACd,YAAI;AACA,kBAAQ,IAAI,OAAO,KAAK,QAAQ,KAAK,IAAI,cAAc;AAC3D,YAAI,OAAO,KAAK,aAAa,OAAO,SAAS;AAC7C,YAAI;AACA;AAAA,MACR;AACA,UAAI,QAAQ,MAAM,MAAM,GAAG,YAAY;AACvC,eAAS,IAAI,GAAG,MAAM,YAAY,KAAK,IAAI,IAA+B,KAAK;AAC3E,YAAI;AACA,kBAAQ,IAAI,YAAY,KAAK,QAAQ,KAAK,IAAI,qBAAqB;AACvE,YAAI,OAAO,KAAK,aAAa,OAAO,SAAS;AAC7C,YAAI;AACA;AACJ,YAAI;AACA,sBAAY,KAAK,QAAQ,KAAK,IAAI;AAAA,MAC1C;AACA,eAAS,UAAU,MAAM,gBAAgB,KAAK,GAAG;AAC7C,YAAI;AACA,kBAAQ,IAAI,OAAO,KAAK,QAAQ,MAAM,IAAI,uBAAuB;AACrE,aAAK,aAAa,QAAQ,SAAS;AAAA,MACvC;AACA,UAAI,KAAK,OAAO,MAAM,MAAM,KAAK;AAC7B,YAAI,YAAY,MAAM,KAAK;AACvB;AACA,kBAAQ;AAAA,QACZ;AACA,cAAM,gBAAgB,OAAO,QAAQ;AACrC,YAAI;AACA,kBAAQ,IAAI,OAAO,KAAK,QAAQ,KAAK,IAAI,wBAAwB,KAAK,OAAO,QAAQ,KAAK,IAAI;AAClG,uBAAe,OAAO,SAAS;AAAA,MACnC,WACS,CAAC,YAAY,SAAS,QAAQ,MAAM,OAAO;AAChD,mBAAW;AAAA,MACf;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,YAAY,OAAO;AACf,UAAM,MAAM;AACZ,WAAO,KAAK,MAAM;AAAA,MAAE,QAAQ,kBAAkB,OAAO,KAAK;AAAA,MACtD,SAAS,KAAK,OAAO;AAAA,MACrB,OAAO,KAAK;AAAA,MACZ,iBAAiB,KAAK,OAAO;AAAA,MAC7B,QAAQ,KAAK;AAAA,MACb,OAAO,KAAK,OAAO,CAAC,EAAE;AAAA,MACtB,QAAQ,MAAM,MAAM,KAAK,OAAO,CAAC,EAAE;AAAA,MACnC,eAAe,KAAK,OAAO;AAAA,IAAc,CAAC;AAAA,EAClD;AAAA,EACA,QAAQ,OAAO;AACX,QAAI,MAAM,aAAa,WAAW,oBAAI,YAAU,IAAI,KAAK;AACzD,QAAI,CAAC;AACD,eAAS,IAAI,OAAO,KAAK,OAAO,cAAc,KAAK,aAAa,CAAC;AACrE,WAAO,KAAK;AAAA,EAChB;AACJ;AACA,SAAS,eAAe,OAAO,WAAW;AACtC,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACvC,QAAI,QAAQ,UAAU,CAAC;AACvB,QAAI,MAAM,OAAO,MAAM,OAAO,MAAM,UAAU,KAAK,GAAG;AAClD,UAAI,UAAU,CAAC,EAAE,QAAQ,MAAM;AAC3B,kBAAU,CAAC,IAAI;AACnB;AAAA,IACJ;AAAA,EACJ;AACA,YAAU,KAAK,KAAK;AACxB;AACA,IAAM,UAAN,MAAc;AAAA,EACV,YAAY,QAAQ,OAAO,UAAU;AACjC,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,SAAK,WAAW;AAAA,EACpB;AAAA,EACA,OAAO,MAAM;AAAE,WAAO,CAAC,KAAK,YAAY,KAAK,SAAS,IAAI,KAAK;AAAA,EAAG;AACtE;AA0BA,IAAM,WAAN,cAAuB,OAAO;AAAA;AAAA,EAE1B,YAAY,MAAM;AACd,UAAM;AAEN,SAAK,WAAW,CAAC;AACjB,QAAI,KAAK,WAAW;AAChB,YAAM,IAAI,WAAW,mBAAmB,KAAK,2CAA2C,KAAwB;AACpH,QAAI,YAAY,KAAK,UAAU,MAAM,GAAG;AACxC,SAAK,gBAAgB,UAAU;AAC/B,aAAS,IAAI,GAAG,IAAI,KAAK,iBAAiB;AACtC,gBAAU,KAAK,EAAE;AACrB,QAAI,WAAW,OAAO,KAAK,KAAK,QAAQ,EAAE,IAAI,OAAK,KAAK,SAAS,CAAC,EAAE,CAAC,CAAC;AACtE,QAAI,YAAY,CAAC;AACjB,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ;AAClC,gBAAU,KAAK,CAAC,CAAC;AACrB,aAAS,QAAQ,QAAQ,MAAM,OAAO;AAClC,gBAAU,MAAM,EAAE,KAAK,CAAC,MAAM,KAAK,YAAY,OAAO,KAAK,CAAC,CAAC,CAAC;AAAA,IAClE;AACA,QAAI,KAAK;AACL,eAAS,YAAY,KAAK,WAAW;AACjC,YAAI,OAAO,SAAS,CAAC;AACrB,YAAI,OAAO,QAAQ;AACf,iBAAO,SAAS,IAAI;AACxB,iBAAS,IAAI,GAAG,IAAI,SAAS,UAAS;AAClC,cAAI,OAAO,SAAS,GAAG;AACvB,cAAI,QAAQ,GAAG;AACX,oBAAQ,MAAM,MAAM,SAAS,GAAG,CAAC;AAAA,UACrC,OACK;AACD,gBAAI,QAAQ,SAAS,IAAI,CAAC,IAAI;AAC9B,qBAAS,IAAI,CAAC,MAAM,IAAI,GAAG;AACvB,sBAAQ,SAAS,GAAG,GAAG,MAAM,KAAK;AACtC;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AACJ,SAAK,UAAU,IAAI,QAAQ,UAAU,IAAI,CAAC,MAAM,MAAM,SAAS,OAAO;AAAA,MAClE,MAAM,KAAK,KAAK,gBAAgB,SAAY;AAAA,MAC5C,IAAI;AAAA,MACJ,OAAO,UAAU,CAAC;AAAA,MAClB,KAAK,SAAS,QAAQ,CAAC,IAAI;AAAA,MAC3B,OAAO,KAAK;AAAA,MACZ,SAAS,KAAK,gBAAgB,KAAK,aAAa,QAAQ,CAAC,IAAI;AAAA,IACjE,CAAC,CAAC,CAAC;AACH,QAAI,KAAK;AACL,WAAK,UAAU,KAAK,QAAQ,OAAO,GAAG,KAAK,WAAW;AAC1D,SAAK,SAAS;AACd,SAAK,eAAe;AACpB,QAAI,aAAa,YAAY,KAAK,SAAS;AAC3C,SAAK,UAAU,KAAK;AACpB,SAAK,mBAAmB,KAAK,eAAe,CAAC;AAC7C,SAAK,cAAc,IAAI,YAAY,KAAK,iBAAiB,MAAM;AAC/D,aAAS,IAAI,GAAG,IAAI,KAAK,iBAAiB,QAAQ;AAC9C,WAAK,YAAY,CAAC,IAAI,KAAK,iBAAiB,CAAC,EAAE;AACnD,SAAK,eAAe,KAAK,iBAAiB,IAAI,cAAc;AAC5D,SAAK,SAAS,YAAY,KAAK,QAAQ,WAAW;AAClD,SAAK,OAAO,YAAY,KAAK,SAAS;AACtC,SAAK,OAAO,YAAY,KAAK,IAAI;AACjC,SAAK,UAAU,KAAK;AACpB,SAAK,aAAa,KAAK,WAAW,IAAI,WAAS,OAAO,SAAS,WAAW,IAAI,WAAW,YAAY,KAAK,IAAI,KAAK;AACnH,SAAK,WAAW,KAAK;AACrB,SAAK,WAAW,KAAK,YAAY,CAAC;AAClC,SAAK,qBAAqB,KAAK,sBAAsB;AACrD,SAAK,iBAAiB,KAAK;AAC3B,SAAK,YAAY,KAAK,aAAa;AACnC,SAAK,UAAU,KAAK,QAAQ,MAAM,SAAS;AAC3C,SAAK,UAAU,KAAK,aAAa;AACjC,SAAK,MAAM,KAAK,SAAS,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC,CAAC;AAAA,EAC1D;AAAA,EACA,YAAY,OAAO,WAAW,QAAQ;AAClC,QAAI,QAAQ,IAAI,MAAM,MAAM,OAAO,WAAW,MAAM;AACpD,aAAS,KAAK,KAAK;AACf,cAAQ,EAAE,OAAO,OAAO,WAAW,MAAM;AAC7C,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,QAAQ,OAAO,MAAM,QAAQ,OAAO;AAChC,QAAI,QAAQ,KAAK;AACjB,QAAI,QAAQ,MAAM,CAAC;AACf,aAAO;AACX,aAAS,MAAM,MAAM,OAAO,CAAC,OAAK;AAC9B,UAAI,WAAW,MAAM,KAAK,GAAGM,QAAO,WAAW;AAC/C,UAAI,SAAS,MAAM,KAAK;AACxB,UAAIA,SAAQ;AACR,eAAO;AACX,eAASC,OAAM,OAAO,YAAY,IAAI,MAAMA,MAAK;AAC7C,YAAI,MAAM,GAAG,KAAK;AACd,iBAAO;AACf,UAAID;AACA,eAAO;AAAA,IACf;AAAA,EACJ;AAAA;AAAA,EAEA,UAAU,OAAO,UAAU;AACvB,QAAI,OAAO,KAAK;AAChB,aAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAC9B,eAAS,IAAI,KAAK;AAAA,QAAU;AAAA,QAAO,MAAM,IAA0B;AAAA;AAAA,MAA0B,GAAG,QAAO,KAAK,GAAG;AAC3G,aAAK,OAAO,KAAK,CAAC,MAAM,OAAqB;AACzC,cAAI,KAAK,IAAI,CAAC,KAAK;AACf,mBAAO,KAAK,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC;AAAA,mBAC5B,KAAK,IAAI,CAAC,KAAK;AACpB,mBAAO,KAAK,MAAM,IAAI,CAAC;AAAA;AAEvB;AAAA,QACR;AACA,YAAI,QAAQ,YAAY,QAAQ;AAC5B,iBAAO,KAAK,MAAM,IAAI,CAAC;AAAA,MAC/B;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,UAAU,OAAO,MAAM;AACnB,WAAO,KAAK,OAAQ,QAAQ,IAA2B,IAAI;AAAA,EAC/D;AAAA;AAAA,EAEA,UAAU,OAAO,MAAM;AACnB,YAAQ,KAAK;AAAA,MAAU;AAAA,MAAO;AAAA;AAAA,IAAwB,IAAI,QAAQ;AAAA,EACtE;AAAA;AAAA,EAEA,YAAY,OAAO,QAAQ;AACvB,WAAO,CAAC,CAAC,KAAK,WAAW,OAAO,OAAK,KAAK,SAAS,OAAO,IAAI;AAAA,EAClE;AAAA;AAAA,EAEA,WAAW,OAAO,QAAQ;AACtB,QAAI,QAAQ,KAAK;AAAA,MAAU;AAAA,MAAO;AAAA;AAAA,IAAgC;AAClE,QAAI,SAAS,QAAQ,OAAO,KAAK,IAAI;AACrC,aAAS,IAAI,KAAK;AAAA,MAAU;AAAA,MAAO;AAAA;AAAA,IAA0B,GAAG,UAAU,MAAM,KAAK,GAAG;AACpF,UAAI,KAAK,KAAK,CAAC,KAAK,OAAqB;AACrC,YAAI,KAAK,KAAK,IAAI,CAAC,KAAK;AACpB,cAAI,KAAK,KAAK,MAAM,IAAI,CAAC;AAAA;AAEzB;AAAA,MACR;AACA,eAAS,OAAO,KAAK,KAAK,MAAM,IAAI,CAAC,CAAC;AAAA,IAC1C;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAGA,WAAW,OAAO;AACd,QAAI,SAAS,CAAC;AACd,aAAS,IAAI,KAAK;AAAA,MAAU;AAAA,MAAO;AAAA;AAAA,IAA0B,KAAI,KAAK,GAAG;AACrE,UAAI,KAAK,KAAK,CAAC,KAAK,OAAqB;AACrC,YAAI,KAAK,KAAK,IAAI,CAAC,KAAK;AACpB,cAAI,KAAK,KAAK,MAAM,IAAI,CAAC;AAAA;AAEzB;AAAA,MACR;AACA,WAAK,KAAK,KAAK,IAAI,CAAC,IAAK,SAAiC,OAAQ,GAAG;AACjE,YAAI,QAAQ,KAAK,KAAK,IAAI,CAAC;AAC3B,YAAI,CAAC,OAAO,KAAK,CAAC,GAAGE,OAAOA,KAAI,KAAM,KAAK,KAAK;AAC5C,iBAAO,KAAK,KAAK,KAAK,CAAC,GAAG,KAAK;AAAA,MACvC;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,UAAU,QAAQ;AAGd,QAAI,OAAO,OAAO,OAAO,OAAO,OAAO,SAAS,SAAS,GAAG,IAAI;AAChE,QAAI,OAAO;AACP,WAAK,UAAU,KAAK,QAAQ,OAAO,GAAG,OAAO,KAAK;AACtD,QAAI,OAAO,KAAK;AACZ,UAAIC,QAAO,KAAK,SAAS,OAAO,GAAG;AACnC,UAAI,CAACA;AACD,cAAM,IAAI,WAAW,yBAAyB,OAAO,KAAK;AAC9D,WAAK,MAAMA;AAAA,IACf;AACA,QAAI,OAAO;AACP,WAAK,aAAa,KAAK,WAAW,IAAI,OAAK;AACvC,YAAI,QAAQ,OAAO,WAAW,KAAK,OAAK,EAAE,QAAQ,CAAC;AACnD,eAAO,QAAQ,MAAM,KAAK;AAAA,MAC9B,CAAC;AACL,QAAI,OAAO,cAAc;AACrB,WAAK,eAAe,KAAK,aAAa,MAAM;AAC5C,WAAK,mBAAmB,KAAK,iBAAiB,IAAI,CAAC,GAAG,MAAM;AACxD,YAAI,QAAQ,OAAO,aAAa,KAAK,OAAK,EAAE,QAAQ,EAAE,QAAQ;AAC9D,YAAI,CAAC;AACD,iBAAO;AACX,YAAI,OAAO,OAAO,OAAO,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,MAAM,GAAG,CAAC;AACrE,aAAK,aAAa,CAAC,IAAI,eAAe,IAAI;AAC1C,eAAO;AAAA,MACX,CAAC;AAAA,IACL;AACA,QAAI,OAAO;AACP,WAAK,UAAU,OAAO;AAC1B,QAAI,OAAO;AACP,WAAK,UAAU,KAAK,aAAa,OAAO,OAAO;AACnD,QAAI,OAAO,UAAU;AACjB,WAAK,SAAS,OAAO;AACzB,QAAI,OAAO;AACP,WAAK,WAAW,KAAK,SAAS,OAAO,OAAO,IAAI;AACpD,QAAI,OAAO,gBAAgB;AACvB,WAAK,eAAe,OAAO;AAC/B,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAGA,cAAc;AACV,WAAO,KAAK,SAAS,SAAS;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,MAAM;AACV,WAAO,KAAK,YAAY,KAAK,UAAU,IAAI,IAAI,OAAO,QAAQ,KAAK,WAAW,KAAK,QAAQ,MAAM,IAAI,EAAE,QAAQ,IAAI;AAAA,EACvH;AAAA;AAAA;AAAA,EAGA,IAAI,UAAU;AAAE,WAAO,KAAK,UAAU;AAAA,EAAG;AAAA;AAAA,EAEzC,IAAI,UAAU;AAAE,WAAO,KAAK,QAAQ,MAAM,KAAK,IAAI,CAAC,CAAC;AAAA,EAAG;AAAA;AAAA,EAExD,kBAAkB,MAAM;AACpB,QAAI,OAAO,KAAK;AAChB,WAAO,QAAQ,OAAO,IAAI,KAAK,IAAI,KAAK;AAAA,EAC5C;AAAA;AAAA,EAEA,aAAa,SAAS;AAClB,QAAI,SAAS,OAAO,KAAK,KAAK,QAAQ,GAAG,QAAQ,OAAO,IAAI,MAAM,KAAK;AACvE,QAAI;AACA,eAAS,QAAQ,QAAQ,MAAM,GAAG,GAAG;AACjC,YAAI,KAAK,OAAO,QAAQ,IAAI;AAC5B,YAAI,MAAM;AACN,gBAAM,EAAE,IAAI;AAAA,MACpB;AACJ,QAAI,WAAW;AACf,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ;AAC/B,UAAI,CAAC,MAAM,CAAC,GAAG;AACX,iBAAS,IAAI,KAAK,SAAS,OAAO,CAAC,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,GAAG,MAAM;AAChE,WAAC,aAAa,WAAW,IAAI,WAAW,KAAK,UAAU,CAAC,IAAI,EAAE,IAAI;AAAA,MAC1E;AACJ,WAAO,IAAI,QAAQ,SAAS,OAAO,QAAQ;AAAA,EAC/C;AAAA;AAAA;AAAA,EAGA,OAAO,YAAY,MAAM;AACrB,WAAO,IAAI,SAAS,IAAI;AAAA,EAC5B;AACJ;AACA,SAAS,KAAK,MAAM,KAAK;AAAE,SAAO,KAAK,GAAG,IAAK,KAAK,MAAM,CAAC,KAAK;AAAK;AACrE,SAAS,aAAa,QAAQ;AAC1B,MAAI,OAAO;AACX,WAAS,SAAS,QAAQ;AACtB,QAAI,UAAU,MAAM,EAAE;AACtB,SAAK,MAAM,OAAO,MAAM,EAAE,OAAO,OAAO,WAAW,QAAQ,MAAM,MAAM,YACnE,MAAM,EAAE,OAAO;AAAA,MAAU,MAAM;AAAA,MAAO;AAAA;AAAA,IAA2B,MAChE,CAAC,QAAQ,KAAK,QAAQ,MAAM;AAC7B,aAAO;AAAA,EACf;AACA,SAAO;AACX;AACA,SAAS,eAAe,MAAM;AAC1B,MAAI,KAAK,UAAU;AACf,QAAI,OAAO,KAAK,SAAS,IAA4B;AACrD,WAAO,CAAC,OAAO,UAAW,KAAK,SAAS,OAAO,KAAK,KAAK,IAAK;AAAA,EAClE;AACA,SAAO,KAAK;AAChB;;;AC9rDO,IAAM,SAAS,SAAS,YAAY;AAAA,EACzC,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM;AAAA,EACN,WAAW;AAAA,EACX,SAAS;AAAA,EACT,cAAc,CAAC,CAAC;AAAA,EAChB,iBAAiB;AAAA,EACjB,WAAW;AAAA,EACX,YAAY,CAAC,GAAG,CAAC;AAAA,EACjB,UAAU,EAAC,UAAS,CAAC,GAAE,CAAC,EAAC;AAAA,EACzB,WAAW;AACb,CAAC;;;ACfD;AAaA,IAAM,mBAAN,MAAuB;AAAA,EAAvB;AAEE,gCAAuC;AAAA;AAAA,EAEvC,sBAAsB,IAAY,SAAS,mBAAK,UAAS;AACvD,QAAI,oBAAoB,MAAM,KAAK,OAAO,OAAO,IAAI;AACnD;AAAA,IACF,OAAO;AACL,yBAAK,SAAU;AAAA,QACb;AAAA,QACA,SAAS,CAAC,mBAAK,QAAiB;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,QAAyB;AAC3B,QAAI,mBAAK,aAAY,QAAW;AAC9B,yBAAK,SAAU;AAAA,IACjB,WAAW,oBAAoB,mBAAK,QAAO,GAAG;AAC5C,yBAAK,SAAQ,QAAQ,KAAK,MAAgB;AAAA,IAC5C,OAAO;AACL,YAAM,MAAM,2CAA2C;AAAA,IACzD;AAAA,EACF;AAAA,EAEA,UAAU,QAAgB,SAAS,mBAAK,UAAS;AAC/C,QAAI,oBAAoB,MAAM,GAAG;AAC/B,YAAM,SAAS,OAAO,QAAQ,GAAG,EAAE;AACnC,UAAI,QAAQ;AACV,aAAK,UAAU,QAAQ,MAAM;AAAA,MAC/B;AAAA,IACF,WAAW,QAAQ;AACjB,aAAO,SAAS;AAAA,IAClB;AAAA,EACF;AAAA,EACA,MAAM,OAAe,SAAS,mBAAK,UAAS;AAC1C,QAAI,oBAAoB,MAAM,GAAG;AAC/B,YAAM,SAAS,OAAO,QAAQ,GAAG,EAAE;AACnC,UAAI,QAAQ;AACV,aAAK,MAAM,OAAO,MAAM;AAAA,MAC1B;AAAA,IACF,WAAW,QAAQ;AACjB,aAAO,KAAK;AAAA,IAGd;AAAA,EACF;AAAA,EACA,SAAS,OAAkC,SAAS,mBAAK,UAAS;AA5DpE;AA6DI,QAAI,oBAAoB,MAAM,GAAG;AAC/B,YAAM,SAAS,OAAO,QAAQ,GAAG,EAAE;AACnC,UAAI,QAAQ;AACV,aAAK,SAAS,OAAO,MAAM;AAAA,MAC7B;AAAA,IACF,WAAW,mBAAmB,MAAM,GAAG;AACrC,mBAAO,WAAP,mBAAO,SAAW,CAAC;AAGnB,aAAO,OAAO,KAAK,KAAK;AAAA,IAC1B,WAAW,oBAAoB,MAAM,GAAG;AACtC,aAAO,QAAQ;AAAA,IACjB;AAAA,EACF;AAAA,EAEA,OAAO,SAAS,mBAAK,UAAS;AAC5B,QAAI,KAAK,MAAM;AACb,aAAO;AAAA,QACL,GAAG;AAAA,QACH,MAAM,KAAK;AAAA,MACb;AAAA,IACF,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAvEE;AAyEK,IAAM,WAAW,CAAC,MAAY,WAAmB;AACtD,QAAM,mBAAmB,IAAI,iBAAiB;AAC9C,QAAM,SAAS,KAAK,OAAO;AAC3B,KAAG;AACD,UAAM,EAAE,MAAM,MAAM,GAAG,IAAI;AAC3B,YAAQ,MAAM;AAAA,MACZ,KAAK;AACH,yBAAiB,IAAI,CAAC,CAAC;AACvB;AAAA,MACF,KAAK;AACH,yBAAiB,IAAI,EAAE,IAAI,KAAK,CAAC;AACjC;AAAA,MAEF,KAAK;AAAA,MACL,KAAK;AACH,yBAAiB,sBAAsB,OAAO,UAAU,MAAM,EAAE,CAAC;AACjE;AAAA,MAEF,KAAK;AACH,yBAAiB,UAAU,OAAO,UAAU,MAAM,EAAE,CAAC;AACrD;AAAA,MAEF,KAAK;AACH,yBAAiB,MAAM,OAAO,UAAU,MAAM,EAAE,CAAC;AACjD;AAAA,MAEF,KAAK;AACH,yBAAiB,SAAS,OAAO,UAAU,OAAO,GAAG,KAAK,CAAC,CAAC;AAC5D;AAAA,MAEF,KAAK;AACH,yBAAiB,SAAS,WAAW,OAAO,UAAU,MAAM,EAAE,CAAC,CAAC;AAChE;AAAA,MAEF,KAAK;AACH,yBAAiB,SAAS,IAAI;AAC9B;AAAA,MAEF,KAAK;AACH,yBAAiB,SAAS,KAAK;AAC/B;AAAA,MAEF,KAAK;AACH,yBAAiB,OAAO,OAAO,UAAU,MAAM,EAAE;AACjD;AAAA,MAEF;AAAA,IACF;AAAA,EACF,SAAS,OAAO,KAAK;AAErB,SAAO,iBAAiB,OAAO;AACjC;;;ACvIA,IAAM,eAAe,OAAO,UAAU,EAAE,QAAQ,KAAK,CAAC;AAE/C,IAAM,cAAc,CAAC,gBAAgC;AAC1D,QAAM,YAAY,aAAa,MAAM,WAAW;AAChD,QAAM,SAAS,SAAS,WAAW,WAAW;AAC9C,SAAO;AACT;;;AC0BO,SAAS,gBACd,WACA,QACiB;AAEjB,UAAQ,OAAO,IAAI;AAAA,IACjB,KAAK;AACH,aAAO,YAAY,WAAW,MAAM;AAAA,IACtC,KAAK;AACH,aAAO,OAAO,WAAW,MAAM;AAAA,IACjC,KAAK;AACH,aAAO,OAAO,WAAW,MAAM;AAAA,IACjC,KAAK;AACH,aAAO,OAAO,WAAW,MAAM;AAAA,IACjC,KAAK;AACH,aAAO,OAAO,WAAW,MAAM;AAAA,IACjC,KAAK;AACH,aAAO,OAAO,WAAW,MAAM;AAAA,IACjC,KAAK;AACH,aAAO,OAAO,WAAW,MAAM;AAAA,IACjC,KAAK;AACH,aAAO,QAAQ,WAAW,MAAmB;AAAA,IAC/C,KAAK;AACH,aAAO,OAAO,WAAW,MAAkB;AAAA,IAC7C;AACE,cAAQ,IAAI,4BAA4B,OAAO,IAAI;AACnD,aAAO,MAAM;AAAA,EACjB;AACF;AAIA,IAAM,cAAc,CAClB,WACA,WACoB;AACpB,SAAO,CAAC,QACL,OAAO,OAAqB,QAAQ,IAAI,UAAU,OAAO,MAAM,CAAC,CAAC,MAAM;AAC5E;AAEA,IAAM,SAAS,CACb,WACA,WACoB;AACpB,SAAO,CAAC,QAAQ,IAAI,UAAU,OAAO,MAAM,CAAC,MAAM,OAAO;AAC3D;AAEA,IAAM,SAAS,CACb,WACA,WACoB;AACpB,SAAO,CAAC,QAAQ,IAAI,UAAU,OAAO,MAAM,CAAC,IAAI,OAAO;AACzD;AACA,IAAM,SAAS,CACb,WACA,WACoB;AACpB,SAAO,CAAC,QAAQ,IAAI,UAAU,OAAO,MAAM,CAAC,KAAK,OAAO;AAC1D;AAEA,IAAM,SAAS,CACb,WACA,WACoB;AACpB,SAAO,CAAC,QAAQ,IAAI,UAAU,OAAO,MAAM,CAAC,IAAI,OAAO;AACzD;AACA,IAAM,SAAS,CACb,WACA,WACoB;AACpB,SAAO,CAAC,QAAQ,IAAI,UAAU,OAAO,MAAM,CAAC,KAAK,OAAO;AAC1D;AAEA,IAAM,SAAS,CACb,WACA,WACoB;AACpB,QAAM,cAAc,OAAO;AAC3B,MAAI,OAAO,gBAAgB,UAAU;AACnC,UAAM,MAAM,8CAA8C;AAAA,EAC5D;AACA,SAAO,CAAC,QAAQ;AACd,UAAM,WAAW,IAAI,UAAU,OAAO,MAAM,CAAC;AAC7C,QAAI,OAAO,aAAa,UAAU;AAChC,YAAM,MAAM,8CAA8C;AAAA,IAC5D;AACA,WAAO,SAAS,YAAY,EAAE,WAAW,YAAY,YAAY,CAAC;AAAA,EACpE;AACF;AAEA,IAAM,UAAU,CAAC,WAAsB,WAAuC;AAC5E,QAAM,UAAU,OAAO,QAAQ,IAAI,CAAC,OAAO,gBAAgB,WAAW,EAAE,CAAC;AACzE,SAAO,CAAC,QAAQ,QAAQ,MAAM,CAAC,OAAO,GAAG,GAAG,CAAC;AAC/C;AAEA,SAAS,OAAO,WAAsB,QAAmC;AACvE,QAAM,UAAU,OAAO,QAAQ,IAAI,CAAC,OAAO,gBAAgB,WAAW,EAAE,CAAC;AACzE,SAAO,CAAC,QAAQ,QAAQ,KAAK,CAAC,OAAO,GAAG,GAAG,CAAC;AAC9C;;;AC/HO,IAAM,gBAAgB,CAC3B,cACA,YACA,SACA,UACA,WACA,aACG;AACH,QAAM,YAAY,aAAa,WAAW,YAAY;AACtD,QAAM,UAAU,aAAa,aAAa,SAAS,CAAC,EAAE;AACtD,QAAM,eAAe,QAAQ,IAAY,CAAC,WAAW,UAAU,MAAM,CAAC;AAEtE,UAAQ,SAAS;AAAA,IACf,KAAK;AACH,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,KAAK;AACH,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,KAAK;AACH,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,KAAK;AACH,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,KAAK;AACH,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,KAAK;AACH,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,EACJ;AACF;AAEA,SAAS,eACP,UACA,WACA,cACA,YACA,cAC2B;AAC3B,QAAM,SAAoC,CAAC;AAC3C,QAAM,YAAY,aAAa,WAAW,YAAY;AAEtD,WAAS,eAAe,KAAyB;AAC/C,QAAI,MAAM,QAAQ,GAAG,GAAG;AACtB,aAAO,IAAI;AAAA,IACb,OAAO;AACL,UAAI,QAAQ;AACZ,iBAAW,OAAO,KAAK;AACrB,iBAAS,IAAI,eAAe,IAAI,GAAG,CAAC;AAAA,MACtC;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,aAAW,OAAO,UAAU;AAC1B,UAAM,QAAQ,eAAe,SAAS,GAAG,CAAC;AAC1C,WAAO,GAAG,IAAI;AAAA,EAChB;AAEA,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS;AACtD,eAAW,OAAO,QAAQ;AACxB,UAAI,WAAW,KAAK,EAAE,aAAa,CAAC,CAAC,MAAM,KAAK;AAC9C,mBAAW,KAAK,EAAE,SAAS,IAAI,OAAO,GAAG;AAAA,MAC3C;AAAA,IACF;AAAA,EACF;AAEA,UAAQ,IAAI,mBAAmB,UAAU;AACzC,UAAQ,IAAI,eAAe,MAAM;AACjC,SAAO;AACT;AAEA,SAAS,aAAa,WAAsB,cAAgC;AAC1E,UAAQ,IAAI,2BAA2B,aAAa,MAAM;AAC1D,QAAM,aAAa,aAAa,aAAa,SAAS,CAAC,EAAE;AACzD,QAAM,eAAe,UAAU,UAAU;AACzC,SAAO;AACT;AAEA,SAAS,aACP,UACA,UACA,WACA,cACA,YACA,cAC2B;AAC3B,QAAM,OAAkC,CAAC;AACzC,QAAM,YAAY,aAAa,WAAW,YAAY;AAEtD,WAAS,aACP,KACAC,WACAC,YACA;AACA,QAAI,MAAM,QAAQ,GAAG,GAAG;AACtB,UAAI,MAAM;AACV,iBAAW,OAAO,KAAK;AACrB,eAAO,OAAOD,UAAS,GAAG,EAAEC,UAAS,CAAC;AAAA,MACxC;AACA,aAAO;AAAA,IACT,OAAO;AACL,UAAI,MAAM;AACV,iBAAW,OAAO,KAAK;AACrB,eAAO,aAAa,IAAI,GAAG,GAAGD,WAAUC,UAAS;AAAA,MACnD;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,aAAW,OAAO,UAAU;AAC1B,YAAQ,IAAI,GAAG;AACf,UAAM,MAAM,OAAO,aAAa,SAAS,GAAG,GAAG,UAAU,SAAS,CAAC;AACnE,SAAK,GAAG,IAAI;AAAA,EACd;AAEA,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS;AACtD,eAAW,OAAO,MAAM;AACtB,UAAI,WAAW,KAAK,EAAE,aAAa,CAAC,CAAC,MAAM,KAAK;AAC9C,mBAAW,KAAK,EAAE,SAAS,IAAI,KAAK,GAAG;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,UAAQ,IAAI,mBAAmB,UAAU;AACzC,UAAQ,IAAI,aAAa,IAAI;AAC7B,SAAO;AACT;AAEA,SAAS,iBACP,UACA,UACA,WACA,cACA,YACA,cAC2B;AAC3B,QAAM,WAAsC,CAAC;AAC7C,QAAM,YAAY,aAAa,WAAW,YAAY;AAEtD,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,MAAM;AAAA,IACV;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,aAAW,OAAO,OAAO;AACvB,QAAI,UAAU;AACd,cAAU,IAAI,GAAG,IAAI,MAAM,GAAG;AAC9B,aAAS,GAAG,IAAI;AAAA,EAClB;AAEA,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS;AACtD,eAAW,OAAO,UAAU;AAC1B,UAAI,WAAW,KAAK,EAAE,aAAa,CAAC,CAAC,MAAM,KAAK;AAC9C,mBAAW,KAAK,EAAE,SAAS,IAAI,SAAS,GAAG;AAAA,MAC7C;AAAA,IACF;AAAA,EACF;AAEA,UAAQ,IAAI,mBAAmB,UAAU;AACzC,UAAQ,IAAI,iBAAiB,QAAQ;AACrC,SAAO;AACT;AAEA,SAAS,kBACP,KACA,UACA,WACU;AACV,QAAM,OAAiB,CAAC;AAExB,MAAI,MAAM,QAAQ,GAAG,GAAG;AACtB,eAAW,OAAO,KAAK;AACrB,WAAK,KAAK,SAAS,GAAG,EAAE,SAAS,CAAW;AAAA,IAC9C;AAAA,EACF,OAAO;AACL,eAAW,OAAO,KAAK;AACrB,WAAK,KAAK,GAAG,kBAAkB,IAAI,GAAG,GAAG,UAAU,SAAS,CAAC;AAAA,IAC/D;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,kBACP,UACA,UACA,WACA,cACA,YACA,cAC2B;AAC3B,QAAM,YAAuC,CAAC;AAC9C,QAAM,YAAY,aAAa,WAAW,YAAY;AAEtD,aAAW,OAAO,UAAU;AAC1B,UAAM,iBAAiB;AAAA,MACrB,SAAS,GAAG;AAAA,MACZ;AAAA,MACA;AAAA,IACF;AACA,UAAM,WAAgB,CAAC,GAAG,IAAI,IAAI,cAAc,CAAC;AAEjD,cAAU,GAAG,IAAI;AAAA,EACnB;AAEA,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS;AACtD,eAAW,OAAO,WAAW;AAC3B,UAAI,WAAW,KAAK,EAAE,aAAa,CAAC,CAAC,MAAM,KAAK;AAC9C,mBAAW,KAAK,EAAE,SAAS,IAAI,UAAU,GAAG;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,cACP,UACA,UACA,WACA,cACA,YACA,cAC2B;AAC3B,QAAM,QAAmC,CAAC;AAC1C,QAAM,YAAY,aAAa,WAAW,YAAY;AAEtD,aAAW,OAAO,UAAU;AAC1B,UAAM,iBAAiB;AAAA,MACrB,SAAS,GAAG;AAAA,MACZ;AAAA,MACA;AAAA,IACF;AACA,UAAM,YAAY,KAAK,IAAI,GAAG,cAAc;AAE5C,UAAM,GAAG,IAAI;AAAA,EACf;AACA,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS;AACtD,eAAW,OAAO,OAAO;AACvB,UAAI,WAAW,KAAK,EAAE,aAAa,CAAC,CAAC,MAAM,KAAK;AAC9C,mBAAW,KAAK,EAAE,SAAS,IAAI,MAAM,GAAG;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,aACP,UACA,UACA,WACA,cACA,YACA,cAC2B;AAC3B,QAAM,OAAkC,CAAC;AACzC,QAAM,YAAY,aAAa,WAAW,YAAY;AAEtD,aAAW,OAAO,UAAU;AAC1B,UAAM,iBAAiB;AAAA,MACrB,SAAS,GAAG;AAAA,MACZ;AAAA,MACA;AAAA,IACF;AACA,UAAM,YAAY,KAAK,IAAI,GAAG,cAAc;AAC5C,SAAK,GAAG,IAAI;AAAA,EACd;AAEA,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS;AACtD,eAAW,OAAO,MAAM;AACtB,UAAI,WAAW,KAAK,EAAE,aAAa,CAAC,CAAC,MAAM,KAAK;AAC9C,mBAAW,KAAK,EAAE,SAAS,IAAI,KAAK,GAAG;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;;;ACvUA,IAAM,EAAE,OAAAC,QAAO,aAAa,KAAAC,KAAI,IAAI;AAE7B,IAAM,gBAAgB,CAC3B,KACA,gBACoB;AACpB,QAAM,OAAwB,CAAC;AAE/B,WACM,IAAI,GAAG,MAAM,GAAG,YAAY,OAAO,MAAM,YAAY,QACzD,IAAI,KACJ,KACA;AACA,UAAM,MAAM,YAAY,CAAC;AACzB,UAAM,EAAE,CAACD,MAAK,GAAG,OAAO,CAACC,IAAG,GAAG,OAAO,IAAI;AAC1C,QAAI,WAAW,KAAK;AAClB,YAAM,eAAe,IAAI,MAAM;AAC/B,mBAAa,WAAW,IAAI;AAC5B,WAAK,KAAK,YAAY;AACtB,aAAO;AACP,kBAAY;AACZ,aAAO,IAAI,MAAM,KAAK,YAAY,IAAI,CAAC,EAAED,MAAK,IAAI,OAAO;AACvD,aAAK;AAAA,MACP;AAAA,IACF,WAAW,WAAW;AACpB,YAAM,SAAS,IAAI,MAAM;AACzB,aAAO,CAAC,IAAI;AACZ,aAAO,CAAC,IAAI;AACZ,WAAK,KAAK,MAAM;AAChB,aAAO;AAAA,IACT,OAAO;AACL,WAAK,KAAK,GAAG;AACb,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAEO,IAAM,cAAc,CACzB,MACA,YACA,SACA,WACA,UACA,kBACoB;AACpB,QAAM,eAAe,QAAQ,IAAY,CAAC,WAAW,UAAU,MAAM,CAAC;AACtE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,IAAM,sBAAsB,CAC1B,UACA,cACA,UACA,aAAuC,CAAC,GACxC,OAAO,SACP,QAAQ,GACR,OAAwB,CAAC,GACzB,kBACG;AACH,UAAQ,IAAI,wBAAwB;AACpC,QAAM,OAAO,OAAO,KAAK,QAAQ,EAAE,KAAK;AACxC,aAAW,OAAO,MAAM;AACtB,UAAM,MAAM,KAAK;AACjB,UAAM,WAAW,GAAG,QAAQ;AAC5B,UAAM,MAAqB,CAAC,KAAK,KAAK,OAAO,OAAO,OAAO,GAAG,UAAU,CAAC;AAEzE,QAAI,aAAa,QAAQ,CAAC,CAAC,IAAI;AAC/B,SAAK,KAAK,GAAG;AAEb,QAAI,SAAS,SAAS,QAAQ,GAAG;AAC/B,UAAI,WAAW,IAAI;AACnB,UAAI,MAAM,QAAQ,SAAS,GAAG,CAAC,GAAG;AAChC;AAAA,UACE;AAAA,UACA,SAAS,GAAG;AAAA,UACZ;AAAA,UACA;AAAA,UACA,QAAQ;AAAA,QACV;AAAA,MACF,OAAO;AACL;AAAA,UACE,SAAS,GAAG;AAAA,UACZ;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,QAAQ;AAAA,UACR;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,UAAQ,IAAI,wBAAwB;AAEpC,aAAW,OAAO,MAAM;AACtB,eAAW,SAAS,MAAM;AACxB,UAAI,KAAK,GAAG,EAAE,CAAC,MAAM,SAAS,cAAc,KAAK,KAAK,QAAW;AAC/D,YACE,KAAK,GAAG,EAAE,aAAa,CAAC,CAAC,MAAM,cAAc,KAAK,EAAE,aAAa,CAAC,CAAC,GACnE;AACA,eAAK,GAAG,IAAI,KAAK,GAAG,EAAE,OAAO,GAAG,CAAC,EAAE;AAAA,YACjC,cAAc,KAAK,EAAE;AAAA,cACnB;AAAA;AAAA,cACA,cAAc,KAAK,EAAE;AAAA,YACvB;AAAA,UACF;AACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,UAAQ,IAAI,wBAAwB;AAEpC,SAAO;AACT;AAEA,IAAM,eAAe,CACnB,MACA,MACA,YACA,WACA,UACG;AACH,aAAW,UAAU,MAAM;AACzB,UAAM,MAAM,KAAK;AACjB,UAAM,YAAY,WAAW,MAAM,EAAE,MAAM;AAC3C,cAAU,CAAC,IAAI;AACf,cAAU,CAAC,IAAI;AACf,cAAUA,MAAK,IAAI;AACnB,cAAUC,IAAG,IAAI,GAAG,aAAa,UAAUA,IAAG;AAC9C,SAAK,KAAK,SAAS;AAAA,EACrB;AACF;AAEO,IAAM,YAAY,CACvB,MACA,SACA,cACgC;AAChC,QAAM,eAAe,QAAQ,IAAY,CAAC,WAAW,UAAU,MAAM,CAAC;AACtE,QAAM,YAAY,cAAc,MAAM,YAAY;AAClD,QAAM,kBAAkB,mBAAmB,WAAW,YAAY;AAGlE,SAAO,CAAC,iBAAiB,SAAS;AACpC;AAEA,IAAM,qBAAqB,CAAC,WAAqB,iBAA2B;AAC1E,QAAM,QAAQ;AACd,QAAM,OAAwB,CAAC;AAC/B,MAAI,MAAM;AACV,QAAM,OAAO,OAAO,KAAK,SAAS,EAAE,KAAK;AACzC,aAAW,OAAO,MAAM;AACtB,UAAM,MAAqB;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT;AAAA,IACF;AACA,QAAI,aAAa,KAAK,CAAC,IAAI;AAC3B,SAAK,KAAK,GAAG;AACb,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,cAAc,UAAoC,SAAmB;AAC5E,QAAM,SAAmB,CAAC;AAC1B,QAAM,SAAS,QAAQ;AACvB,QAAM,YAAY,SAAS;AAC3B,WAAS,IAAI,GAAG,MAAM,SAAS,QAAQ,IAAI,KAAK,KAAK;AACnD,UAAM,UAAU,SAAS,CAAC;AAC1B,QAAI,SAA6B;AACjC,QAAI;AACJ,QAAI;AACJ,aAAS,QAAQ,GAAG,QAAQ,QAAQ,SAAS;AAC3C,YAAM,SAAS,QAAQ,KAAK;AAC5B,YAAM,QAAQ,MAAM,EAAE,SAAS;AAC/B,mBAAc,OAAoB,GAAG;AACrC,UAAI,cAAc,UAAU,WAAW;AAErC,QAAC,WAAuB,KAAK,CAAC;AAAA,MAChC,WAAW,YAAY;AACrB,iBAAS;AAAA,MACX,WAAW,CAAC,cAAc,QAAQ,WAAW;AAG3C,iBAAS,OAAO,GAAG,IAAI,CAAC;AAAA,MAC1B,WAAW,CAAC,YAAY;AACtB,QAAC,OAAoB,GAAG,IAAI,CAAC,CAAC;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AACA,UAAQ,IAAI,aAAa,MAAM;AAC/B,SAAO;AACT;;;ACtMA,IAAM,uBAAsC,CAAC,IAAI,IAAI,CAAC,GAAG,SAAS,MAAM;AACtE,QAAM,OAAO,cAAc,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC;AAC7C,QAAM,OAAO,cAAc,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC;AAC7C,MAAI,SAAS,MAAM;AACjB,WAAO;AAAA,EACT,WAAW,SAAS,QAAQ,OAAO,MAAM;AACvC,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAEA,IAAM,iBAAiB,CAAC,aAA2C;AACjE,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO,oBAAoB,QAAQ;AAAA,EACrC,WAAW,SAAS,WAAW,GAAG;AAChC,WAAO,iBAAiB,QAAQ;AAAA,EAClC,OAAO;AACL,WAAO,mBAAmB,QAAQ;AAAA,EACpC;AACF;AAEA,IAAM,sBACJ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,MAChB,CAAC,IAAI,OAAO;AACV,QAAM,KAAK,cAAc,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC;AAC3C,QAAM,KAAK,cAAc,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC;AAC3C,SAAO,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK;AACtC;AAEF,IAAM,mBACJ,CAAC,CAAC,CAAC,MAAM,UAAU,GAAG,CAAC,MAAM,UAAU,CAAC,MACxC,CAAC,IAAI,OAAO;AACV,QAAM,KAAK,eAAe,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI;AAClD,QAAM,KAAK,eAAe,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI;AAClD,QAAM,KAAK,eAAe,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI;AAClD,QAAM,KAAK,eAAe,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI;AAClD,SAAO,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK;AACnE;AAEF,IAAM,qBACJ,CAAC,UAAU,OAAO,yBAClB,CAAC,IAAI,OAAO;AACV,aAAW,WAAW,UAAU;AAC9B,UAAM,SAAS,KAAK,IAAI,IAAI,OAAO;AACnC,QAAI,WAAW,GAAG;AAChB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEK,IAAM,WAAW,CACtB,MACA,EAAE,SAAS,GACX,cACG;AACH,QAAM,kBAAkB,SAAS,IAAa,CAAC,EAAE,QAAQ,SAAS,MAAM;AAAA,IACtE,UAAU,MAAM;AAAA,IAChB;AAAA,EACF,CAAC;AACD,QAAM,aAAa,eAAe,eAAe;AACjD,SAAO,KAAK,MAAM,EAAE,KAAK,UAAU;AACrC;;;AC1EA,IAAM,EAAE,YAAY,UAAAC,UAAS,IAAI;AAE1B,IAAM,cAAc,CACzB,KACA,MACA,WACA,gBACG;AACH,QAAM,CAAC,QAAQ,IAAI;AACnB,MAAI;AACJ,MAAI,aAAa;AAGf,UAAM,EAAE,MAAM,IAAI;AAClB,gBAAY,IACT,MAAM,GAAG,KAAK,EACd,OAAO,YAAY,IAAI,CAAC,QAAQ,IAAI,GAAG,CAAC,CAAC;AAAA,EAC9C,OAAO;AACL,gBAAY,IAAI,MAAM;AAAA,EACxB;AACA,YAAU,UAAU,IAAI,KAAK,OAAO,QAAQ;AAC5C,YAAUA,SAAQ,IAAI,mBAAmB,WAAW,QAAQ;AAC5D,SAAO;AACT;AAEA,IAAM,gBAAgB,CAAC,WAAsB,YAAwB;AACnE,MAAI,SAAS;AACX,UAAM,EAAE,OAAO,UAAU,IAAI;AAC7B,eAAW,CAAC,YAAY,KAAK,KAAK,OAAO,QAAQ,SAAS,GAAG;AAC3D,YAAM,UAAU,QAAQ,UAAU;AAClC,UAAI,YAAY,QAAW;AACzB,cAAM;AAAA,UACJ,0BAA0B;AAAA,QAC5B;AAAA,MACF,WAAW,YAAY,QAAQ,WAAW;AACxC,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAM,iBAAiB,CAAC,WAAsB,YAAuB;AACnE,QAAM,EAAE,OAAO,UAAU,IAAI;AAC7B,QAAM,SAAmB,CAAC;AAC1B,SAAO,QAAQ,SAAS,EAAE,QAAQ,CAAC,CAAC,UAAU,MAAM;AAClD,WAAO,KAAK,QAAQ,UAAU,IAAI,SAAS;AAAA,EAC7C,CAAC;AACD,SAAO;AACT;AAEO,IAAM,uBAAuB,CAClC,WACA,YACyB;AACzB,MAAI,WAAW,cAAc,WAAW,OAAO,GAAG;AAChD,WAAO,eAAe,WAAW,OAAO;AAAA,EAC1C;AACA,SAAO;AACT;;;ACZA,IAAM,EAAE,KAAAC,KAAI,IAAI;AAUhB,IAAM,EAAE,OAAAC,OAAM,IAAI,OAAO,iBAAiB;AAE1C,IAAM,kBACJ,CAAC,QACD,CAAC,MAA4B,UAAiC;AAC5D,SAAO,CAAC,OAAO,OAAO,MAAM,OAAO,GAAG,GAAG,OAAO,KAAK,GAAG,CAAC,GAAG,GAAG,GAAG,IAAI;AACxE;AAEF,IAAM,mBAAmB,CACvB,SACA,cACgB;AAChB,QAAM,SAAsB;AAAA,IAC1B,SAAS,QAAQ,IAAI,CAAC,EAAE,MAAM,iBAAiB,SAAS,OAAO;AAAA,MAC7D;AAAA,MACA;AAAA,IACF,EAAE;AAAA,IACF,KAAK,gCAAa,QAAQ,CAAC,EAAE;AAAA,IAC7B,OAAO,EAAE,QAAQ,IAAI,OAAO,QAAQ;AAAA,EACtC;AAEA,SAAO;AACT;AAxFA;AA0FO,IAAM,kBAAN,cACG,aAEV;AAAA,EAoCE,YAAY;AAAA,IACV;AAAA;AAAA,IAEA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,oBAAoB;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,EACF,GAAoC;AAClC,UAAM;AAtCR,SAAQ,kBAA4B,EAAE,MAAM,GAAG,IAAI,EAAE;AAErD,SAAQ,gBAA0B,CAAC;AAGnC;AAAA;AACA,gCAA0B;AAC1B;AACA;AACA,+BAAmB;AACnB,2CAAqB;AACrB,8BAAQ;AACR,gCAA4B;AAC5B;AAGA,SAAU,eAA0B,CAAC;AAKrC,SAAQ,OAAO,IAAI,OAAO,mBAAK,OAAM;AACrC,SAAU,gBAA6C;AAmUvD,SAAU,SAAS,CAAC,QAA8B;AAEhD,YAAM,gBAAgB,gBAAgB,KAAK,GAAG,EAAE,KAAK,KAAK,IAAI;AAC9D,MAAC,mBAAK,OAA0B,KAAK,aAAa;AAClD,YAAM,EAAE,MAAM,GAAG,IAAI,mBAAK;AAC1B,YAAM,CAAC,MAAM,IAAI;AACjB,UAAI,UAAU,QAAQ,SAAS,IAAI;AACjC,aAAK,iBAAiB;AAAA,MACxB;AAAA,IACF;AAEA,SAAU,SAAS,CAAC,KAA2B,eAAuB;AA7cxE;AA+cI,YAAM,WAAW,IAAI,KAAK,GAAG;AAC7B,YAAM,WAAW,mBAAK,YAAW,UAAU;AAC3C,YAAM,gBAAe,UAAK,YAAL,mBAAe;AACpC,YAAM,YAAY,mBAAK,OAAM,UAAU,CAACC,SAAQA,KAAIF,IAAG,MAAM,QAAQ;AACrE,UAAI,cAAc,MAAM,iBAAiB,QAAW;AAClD,cAAM,gBAAgB,mBAAK,OAAM,SAAS;AAC1C,sBAAc,QAAQ,IAAI,IAAI,YAAY;AAC1C,cAAM,EAAE,MAAM,GAAG,IAAI,mBAAK;AAC1B,cAAM,CAAC,MAAM,IAAI;AACjB,YAAI,UAAU,QAAQ,SAAS,IAAI;AACjC,eAAK,iBAAiB,OAAO,aAAa;AAAA,QAC5C;AAAA,MACF;AAAA,IACF;AAEA,SAAU,YAAY,CAAC,QAA8B;AAEnD,YAAM,WAAW,IAAI,KAAK,GAAG;AAC7B,YAAM,YAAY,mBAAK,OAAM,UAAU,CAACE,SAAQA,KAAIF,IAAG,MAAM,QAAQ;AACrE,UAAI,cAAc,IAAI;AACpB,cAAM,gBAAgB,gBAAgB,KAAK,GAAG,EAAE,KAAK,SAAS;AAE9D,2BAAK,OAAM,SAAS,IAAI;AACxB,cAAM,EAAE,MAAM,GAAG,IAAI,mBAAK;AAC1B,YAAI,aAAa,QAAQ,YAAY,IAAI;AACvC,eAAK,iBAAiB,OAAO,aAAa;AAAA,QAC5C;AAAA,MACF;AAAA,IACF;AA1VE,QAAI,CAAC,QAAQ,CAAC,mBAAmB;AAC/B,YAAM;AAAA,QACJ;AAAA,MACF;AAAA,IACF;AAEA,SAAK,oBAAoB;AACzB,SAAK,UAAU;AACf,SAAK,MAAM,YACP,KAAK,kBAAkB,UAAU,CAAC,QAAQ,IAAI,SAAS,SAAS,IAChE;AACJ,SAAK,oBAAoB;AACzB,SAAK,cAAc,iBAAiB,mBAAmB,SAAS;AAChE,SAAK,WAAW,YAAY,KAAK;AACjC,uBAAK,OAAQ,KAAK;AAClB,uBAAK,QAAS;AAEd,UAAM,UAAU,kBAAkB,IAAI,CAAC,QAAQ,IAAI,IAAI;AACvD,uBAAK,YAAa,eAAe,OAAO;AACxC,SAAK,cAAc,qBAAqB,mBAAK,aAAY,KAAK,OAAO;AACrE,uBAAK,OAAQ,KAAK,IAAmB,gBAAgB,KAAK,GAAG,CAAC;AAE9D,SAAK,SAAS;AAAA,MACZ,GAAG,mBAAK;AAAA,MACR,cAAc,gBAAgB,mBAAK,SAAQ;AAAA,MAC3C;AAAA,MACA,QAAQ,UAAU,mBAAK,SAAQ;AAAA,MAC/B,SAAS,WAAW,mBAAK,SAAQ;AAAA,MACjC,MAAM,QAAQ,mBAAK,SAAQ;AAAA,IAC7B;AAEA,IAAAC,UAAA,gBAAAA,OAAQ,cAAc,KAAK,UAAU,mBAAK,WAAU;AAAA,EACtD;AAAA,EAEA,MAAM,UACJ;AAAA,IACE,YAAW,mBAAK,aAAL,YAAiB,KAAK;AAAA,IACjC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,GACA,UACA;AA9LJ,QAAAE;AA+LI,SAAK,iBAAiB;AACtB,SAAK,WAAW;AAChB,uBAAK,SAAU;AACf,SAAK,kBAAkB,EAAE,MAAM,GAAG,IAAI,EAAE;AAExC,QAAI,SAAS,mBAAK;AAElB,UAAM,iBAAiB,gBAAgB,WAAW,UAAU,WAAW;AACvE,QAAI,gBAAgB;AAClB,UAAI,OAAO;AACT,2BAAK,QAAS;AAAA,MAChB;AACA,eAAS;AAAA,QACP,GAAG;AAAA,QACH,cAAc,gBAAgB,mBAAK,SAAQ;AAAA,QAC3C,SAAS,WAAW,mBAAK,SAAQ;AAAA,QACjC,QAAQ,UAAU,mBAAK,SAAQ;AAAA,QAC/B,SAAS,WAAW,mBAAK,SAAQ;AAAA,QACjC,MAAM,QAAQ,mBAAK,SAAQ;AAAA,MAC7B;AAAA,IACF;AAEA,KAAAA,MAAA,KAAK,mBAAL,gBAAAA,IAAA,WAAsB;AAAA,MACpB,GAAG;AAAA,MACH,MAAM;AAAA,MACN,kBAAkB,KAAK;AAAA,MACvB,OAAO,mBAAK;AAAA,MACZ,aAAa,KAAK;AAAA,IACpB;AAEA,QAAI,gBAAgB;AAElB,WAAK,SAAS;AAAA,IAChB,OAAO;AACL,WAAK,eAAe;AAAA,QAClB,kBAAkB,KAAK;AAAA,QACvB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM,mBAAK,OAAM;AAAA,MACnB,CAAC;AACD,UAAI,OAAO;AAET,aAAK,QAAQ;AAAA,MACf,WAAW,mBAAK,YAAW,YAAY;AACrC,aAAK,iBAAiB;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAAA,EAEA,cAAc;AACZ,YAAQ,IAAI,kBAAkB;AAAA,EAChC;AAAA,EAEA,UAAU;AACR,YAAQ,IAAI,MAAM;AAClB,WAAO;AAAA,EACT;AAAA,EAEA,SAAS;AACP,YAAQ,IAAI,aAAa;AACzB,WAAO;AAAA,EACT;AAAA,EAEA,UAAU;AACR,YAAQ,IAAI,cAAc;AAC1B,WAAO;AAAA,EACT;AAAA,EAEA,SAAS;AACP,YAAQ,IAAI,aAAa;AACzB,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,UAAqB;AAC1B,uBAAK,oBAAqB,SAAS;AACnC,IAAAF,UAAA,gBAAAA,OAAQ,UAAU,KAAK,UAAU,QAAQ;AACzC,SAAK,eAAe;AACpB,SAAK,SAAS,WAAW,mBAAK,OAAM,GAAG,IAAI;AAAA,EAC7C;AAAA,EAEA,aAAa,KAAa;AACxB,SAAK,cAAc,KAAK,GAAG;AAC3B,SAAK,gBAAgB;AAAA,MACnB,KAAK;AAAA,MACL,mBAAK;AAAA,MACL,mBAAK,SAAQ;AAAA,MACb,mBAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AACA,SAAK,SAAS,WAAW,mBAAK,OAAM,GAAG,IAAI;AAAA,EAC7C;AAAA,EAEA,cAAc,KAAa;AACzB,SAAK,gBAAgB,KAAK,cAAc,OAAO,CAAC,UAAU,UAAU,GAAG;AACvE,QAAI,KAAK,eAAe;AACtB,WAAK,gBAAgB,cAAc,KAAK,KAAK,aAAa;AAC1D,WAAK,SAAS,WAAW,mBAAK,OAAM,GAAG,IAAI;AAAA,IAC7C;AAAA,EACF;AAAA,EAEA,IAAI,QAAQ;AACV,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,mBAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,cAAc;AArTpB;AAsTI,YAAO,UAAK,kBAAL,YAAsB,mBAAK;AAAA,EACpC;AAAA,EAEA,IAAI,QAAQ;AACV,WAAO,KAAK,YAAY;AAAA,EAC1B;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,OAAO,QAA0B;AAjUvC;AAkUI,QAAI,KAAK,YAAY,MAAM,GAAG;AAC5B,UAAI,QAAQ;AACV,cAAM,iBAAiB,mBAAK;AAC5B,cAAM,cACJ,sCAAQ,WAAR,mBAAgB,YAAU,iCAAQ,OAAO,kBAAiB,SACtD;AAAA,UACE,GAAG;AAAA,UACH,QAAQ;AAAA,YACN,QAAQ,OAAO,OAAO;AAAA,YACtB,cAAc,YAAY,OAAO,OAAO,MAAM;AAAA,UAChD;AAAA,QACF,IACA;AAEN,2BAAK,SAAU,mBAAmB,SAAS;AAE3C,YAAI;AAEJ,YAAI,UAAU,MAAM,GAAG;AACrB,gBAAM,EAAE,QAAQ,eAAe,YAAY,MAAM,EAAE,IAAI,OAAO;AAC9D,cAAI,cAAc;AAChB,kBAAM,KAAK,gBAAgB,mBAAK,aAAY,YAAY;AACxD,4BAAgB,mBAAK,OAAM,OAAO,EAAE;AAAA,UACtC,OAAO;AACL,kBAAM,MAAM,kCAAkC;AAAA,UAChD;AAAA,QACF;AAEA,YAAI,QAAQ,MAAM,GAAG;AACnB,0BAAgB;AAAA,YACd,wCAAiB,mBAAK;AAAA,YACtB,OAAO;AAAA,YACP,mBAAK;AAAA,UACP;AAAA,QACF;AAEA,YACE,KAAK,cAAc,SAAS,KAC5B,eAAe,gBAAgB,MAAM,GACrC;AACA,cAAI,mBAAK,SAAQ,QAAQ,WAAW,GAAG;AACrC,iBAAK,cAAc,SAAS;AAAA,UAC9B,OAAO;AAEL,oBAAQ,IAAI,6CAA6C;AAAA,cACvD,iBAAiB,eAAe;AAAA,cAChC,YAAY,UAAU;AAAA,YACxB,CAAC;AAAA,UACH;AAAA,QACF;AAEA,YAAI,WAAW,MAAM,GAAG;AACtB,gBAAM,CAAC,aAAa,QAAQ,IAAI;AAAA,YAC9B,wCAAiB,mBAAK;AAAA,YACtB,OAAO;AAAA,YACP,mBAAK;AAAA,UACP;AACA,eAAK,WAAW;AAChB,0BAAgB;AAEhB,cAAI,KAAK,cAAc,SAAS,GAAG;AACjC,4BAAgB;AAAA,cACd,KAAK;AAAA,cACL,mBAAK;AAAA,cACL,mBAAK,SAAQ;AAAA,cACb,mBAAK;AAAA,cACL,KAAK;AAAA,cACL;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,aAAK,gBAAgB,+CAAe,IAAI,CAAC,KAAK,MAAM;AAClD,gBAAM,QAAQ,IAAI,MAAM;AACxB,gBAAM,CAAC,IAAI;AACX,gBAAM,CAAC,IAAI;AACX,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,WAAK,SAAS,WAAW,mBAAK,OAAM,GAAG,IAAI;AAE3C,WAAK,KAAK,UAAU,mBAAK,QAAO;AAAA,IAClC;AAAA,EACF;AAAA,EAEA,YAAY,QAA0B;AAxZxC;AAyZI,QAAI,cAAc,mBAAK,UAAS,MAAM,GAAG;AACvC,UAAI,QAAQ;AACV,cAAM,cACJ,sCAAQ,WAAR,mBAAgB,YAAU,iCAAQ,OAAO,kBAAiB,SACtD;AAAA,UACE,GAAG;AAAA,UACH,QAAQ;AAAA,YACN,QAAQ,OAAO,OAAO;AAAA,YACtB,cAAc,YAAY,OAAO,OAAO,MAAM;AAAA,UAChD;AAAA,QACF,IACA;AACN,2BAAK,SAAU,mBAAmB,SAAS;AAC3C,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,oBAAoB;AACtB,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,OAAO;AA/ab;AAibI,YAAO,gBAAK,kBAAL,mBAAoB,WAApB,YAA8B,mBAAK,OAAM;AAAA,EAClD;AAAA,EAEA,IAAI,QAAQ;AACV,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,MAAM,OAAiB;AACzB,QAAI,MAAM,SAAS,mBAAK,QAAO,QAAQ,MAAM,OAAO,mBAAK,QAAO,IAAI;AAClE,WAAK,SAAS,KAAK;AAAA,IACrB;AAAA,EACF;AAAA,EAEU,OAAO,KAA2B;AAC1C,YAAQ,IAAI,cAAc,IAAI,KAAK,GAAG,GAAG;AAAA,EAC3C;AAAA,EA6CQ,SAAS,OAAiB,mBAAmB,OAAO;AAC1D,uBAAK,QAAS;AACd,SAAK,KAAK,MAAM,KAAK;AACrB,SAAK,iBAAiB,gBAAgB;AAAA,EACxC;AAAA,EAEA,iBAAiB,mBAAmB,OAAO,KAAqB;AAnflE;AAofI,QAAI,KAAK;AACP,iBAAK,mBAAL,8BAAsB;AAAA,QACpB,kBAAkB,KAAK;AAAA,QACvB,MAAM;AAAA,QACN,MAAM;AAAA,UACJ,YAAY,KAAK,KAAK,MAAM,KAAK,cAAc,KAAK,WAAW;AAAA,QACjE;AAAA,QACA,MAAM;AAAA,MACR;AAAA,IACF,OAAO;AACL,YAAM,WACJ,KAAK,sBAAsB,WAAW,CAAC,mBACnC,cAAc,KAAK,iBAAiB,mBAAK,OAAM,IAC/C,mBAAK;AACX,YAAM,QAAO,UAAK,kBAAL,YAAsB,mBAAK;AAExC,YAAM,qBAAqB,KACxB,MAAM,SAAS,MAAM,SAAS,EAAE,EAChC;AAAA,QAAI,CAACC,SACJ,YAAYA,MAAK,KAAK,MAAM,KAAK,cAAc,KAAK,WAAW;AAAA,MACjE;AAEF,iBAAK,mBAAL,8BAAsB;AAAA,QACpB,kBAAkB,KAAK;AAAA,QACvB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM,KAAK;AAAA,QACX,MAAM;AAAA,MACR;AACA,WAAK,kBAAkB;AAAA,QACrB,MAAM,mBAAK,QAAO;AAAA,QAClB,IAAI,KAAK;AAAA,UACP,mBAAK,QAAO;AAAA,UACZ,mBAAK,QAAO,OAAO,mBAAmB;AAAA,QACxC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,UAAU;AACZ,WAAO,mBAAK,SAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,QAAQ,SAAmB;AAC7B,UAAM,eAAe,cAAc,KAAK,OAAO,SAAS,OAAO;AAC/D,QAAI,aAAa,SAAS,GAAG;AAC3B,YAAM,4BAA4B;AAAA,QAChC,KAAK;AAAA,QACL;AAAA,QACA,CAAC,QAAQ,IAAI;AAAA,MACf;AACA,cAAQ,IAAI,6BAA6B;AAAA,QACvC;AAAA,MACF,CAAC;AAAA,IACH;AACA,uBAAK,YAAa,eAAe,OAAO;AACxC,SAAK,cAAc,qBAAqB,mBAAK,aAAY,KAAK,OAAO;AAErE,SAAK,SAAS;AAAA,MACZ,GAAG,mBAAK;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,eAAe;AACjB,WAAO,mBAAK,SAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,aAAa,cAAgC;AAxjBnD;AAyjBI,uBAAK,SAAU;AAAA,MACb,GAAG,mBAAK;AAAA,MACR;AAAA,IACF;AAEA,UAAM,cAAa,UAAK,kBAAL,YAAsB,mBAAK;AAC9C,UAAM,WAAW,mBAAK;AAEtB;AAAA,MACE;AAAA,MACA;AAAA,MACA,mBAAK,SAAQ;AAAA,MACb;AAAA,MACA,mBAAK;AAAA,MACL,KAAK;AAAA,IACP;AACA,SAAK,SAAS,WAAW,mBAAK,OAAM,GAAG,IAAI;AAE3C,SAAK,KAAK,UAAU,mBAAK,QAAO;AAAA,EAClC;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,mBAAK,SAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,KAAK,MAAe;AACtB,IAAAD,UAAA,gBAAAA,OAAQ,QAAQ,KAAK,UAAU,IAAI;AACnC,SAAK,SAAS;AAAA,MACZ,GAAG,mBAAK;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,mBAAK,SAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,OAAO,QAA0B;AACnC,IAAAA,UAAA,gBAAAA,OAAQ,UAAU,KAAK,UAAU,MAAM;AAEvC,SAAK,SAAS;AAAA,MACZ,GAAG,mBAAK;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,UAAU;AACZ,WAAO,mBAAK,SAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,QAAQ,SAAqB;AAC/B,SAAK,SAAS;AAAA,MACZ,GAAG,mBAAK;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,QAAQ;AACV,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,MAAM,OAA2B;AACnC,uBAAK,QAAS;AAAA,EAChB;AAAA,EAEA,IAAI,kBAAkB;AACpB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,WAAW;AAAA,IACT;AAAA,IACA,MAAM,EAAE,YAAY,SAAS;AAAA,EAC/B,GAA4B;AAC1B,YAAQ,IAAI,eAAe;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,aAAa;AACX,YAAQ,IAAI,aAAa;AAAA,EAC3B;AAAA,EAEQ,QAAQ,QAAgB;AAC9B,UAAM,MAAM,mBAAK,OAAM,MAAM;AAC7B,QAAI,KAAK;AACP,aAAO;AAAA,IACT,OAAO;AACL,YAAM,wBAAwB;AAAA,IAChC;AAAA,EACF;AAAA,EAEA,UACE,KACA,YACA,OACe;AACf,YAAQ,IAAI,6BAA6B,IAAI,CAAC,KAAK,cAAc,OAAO;AACxE,WAAO,QAAQ,QAAQ,IAAI;AAAA,EAC7B;AAAA,EAEA,MAAM,YACJ,YAMA;AACA,WAAO,IAAI,QAAQ,CAAC,YAAY;AAC9B,YAAM,EAAE,KAAK,IAAI;AACjB,cAAQ,MAAM;AAAA,QACZ,KAAK;AACH;AAAA,UASA;AAEA;AAAA,QACF;AACE,kBAAQ,MAAS;AAAA,MACrB;AAAA,IACF,CAAC;AAAA,EACH;AACF;AA9kBE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;ACjFF,IAAM,cAAc,EAAE,SAAS,CAAC,GAAG,KAAK,IAAI,OAAO,EAAE,QAAQ,IAAI,OAAO,GAAG,EAAE;AAO7E,IAAM,EAAE,OAAAG,QAAO,KAAAC,MAAK,aAAAC,cAAa,SAAAC,UAAS,KAAAC,MAAK,UAAAC,UAAS,IAAI;AAE5D,IAAMC,eAAc,CAAC,KAAoB,SAAiB;AACxD,QAAM,CAAC,QAAQ,IAAI;AACnB,QAAM,YAAY,IAAI,MAAM;AAC5B,YAAU,CAAC,IAAI,KAAK,OAAO,QAAQ;AACnC,SAAO;AACT;AAnDA,mBAAAC,UAAAC,QAAAC,UAAA,UAAAC,SAAAC,qBAAAC,QAAA,OAAAC,UAAAC;AAqDO,IAAM,iBAAN,cACG,aAEV;AAAA,EAuBE,YAAY;AAAA,IACV;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,GAAmC;AACjC,UAAM;AA7BR,SAAQ,eAAe,oBAAI,IAAY;AACvC,SAAQ,cAA+B,CAAC;AAExC,sCAAkC,CAAC;AACnC,uBAAAP,UAA0B;AAC1B,uBAAAC,QAAA;AACA,uBAAAC,UAA4B,EAAE,QAAQ,GAAG;AACzC,iCAAuB,CAAC;AACxB,uBAAAC,SAAmB,EAAE,MAAM,GAAG,IAAI,EAAE;AACpC,uBAAAC,qBAAqB;AACrB,uBAAAC,QAAQ;AACR,8BAAiB,EAAE,UAAU,CAAC,EAAE;AAChC,uBAAAC,UAA4B;AAC5B,uBAAAC,SAAA;AAKA,SAAQ,OAAO,IAAI,OAAO,mBAAKJ,QAAM;AAanC,QAAI,CAAC,MAAM;AACT,YAAM,MAAM,gDAAgD;AAAA,IAC9D;AAEA,KAAC,KAAK,mBAAmB,uBAAAF,QAAA,CAAU,IAAI,qBAAqB,IAAI;AAEhE,SAAK,cAAc,mBAAKA,QACrB,OAAO,CAAC,QAAQ,IAAIR,MAAK,MAAM,CAAC,EAChC;AAAA,MAAI,CAAC,KAAK,UACR,CAAC,OAAO,KAAK,EAA6B,OAAO,IAAI,MAAM,CAAC,CAAC;AAAA,IAChE;AACF,SAAK,WAAW,YAAY,KAAK;AACjC,QAAI,cAAc;AAChB,yBAAK,eAAgB;AAAA,IACvB;AACA,QAAI,KAAK,mBAAmB;AAC1B,yBAAKO,UAAU;AAAA,QACb,GAAG,mBAAKA;AAAA,QACR,SAAS,KAAK,kBAAkB,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,MACnD;AAAA,IACF;AACA,QAAI,QAAQ;AACV,yBAAKE,UAAU;AAAA,IACjB;AACA,QAAI,SAAS;AACX,yBAAK,UAAW;AAAA,IAClB;AACA,QAAI,MAAM;AACR,yBAAK,OAAQ;AAAA,IACf;AACA,uBAAKK,SAAS;AAAA,EAChB;AAAA,EAEA,MAAM,UACJ;AAAA,IACE,YAAW,mBAAK,aAAL,YAAiB,KAAK;AAAA,IACjC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,GACA,UACA;AAtIJ,QAAAC;AAuII,SAAK,iBAAiB;AAEtB,QAAI,cAAc;AAChB,yBAAK,eAAgB;AAAA,IACvB;AACA,QAAI,SAAS;AACX,yBAAKR,UAAU;AAAA,QACb,GAAG,mBAAKA;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,QAAI,QAAQ;AACV,yBAAKE,UAAU;AAAA,IACjB;AACA,QAAI,SAAS;AACX,yBAAK,UAAW;AAAA,IAClB;AACA,QAAI,OAAO;AACT,yBAAKC,SAAS;AAAA,IAChB;AACA,QAAI,MAAM;AACR,yBAAK,OAAQ;AAAA,IACf;AAEA,QAAI,mBAAKG,cAAY,gBAAgB;AAEnC;AAAA,IACF;AAEA,SAAK,WAAW;AAEhB,uBAAKA,UAAU;AAEf,KAAAE,MAAA,KAAK,mBAAL,gBAAAA,IAAA,WAAsB;AAAA,MACpB,cAAc,mBAAK;AAAA,MACnB,MAAM;AAAA,MACN,kBAAkB,KAAK;AAAA,MACvB,SAAS,mBAAKR,UAAQ;AAAA,MACtB,QAAQ,mBAAKE;AAAA,MACb,SAAS,mBAAK;AAAA,MACd,OAAO,mBAAKC;AAAA,MACZ,MAAM,mBAAK;AAAA,MACX,aAAa;AAAA,IACf;AAEA,SAAK,eAAe;AAAA,MAClB,kBAAkB,KAAK;AAAA,MACvB,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM,KAAK,YAAY;AAAA,IACzB,CAAC;AAAA,EACH;AAAA,EAEA,cAAc;AACZ,YAAQ,IAAI,MAAM;AAAA,EACpB;AAAA,EAEA,UAAU;AACR,YAAQ,IAAI,MAAM;AAClB,WAAO;AAAA,EACT;AAAA,EAEA,SAAS;AACP,YAAQ,IAAI,MAAM;AAClB,WAAO;AAAA,EACT;AAAA,EAEA,UAAU;AACR,YAAQ,IAAI,MAAM;AAClB,WAAO;AAAA,EACT;AAAA,EAEA,SAAS;AACP,YAAQ,IAAI,MAAM;AAClB,WAAO;AAAA,EACT;AAAA,EACA,IAAI,KAAK,MAAgB;AACvB,YAAQ,IAAI,yBAAyB;AACrC,KAAC,KAAK,mBAAmB,uBAAAF,QAAA,CAAU,IAAI,qBAAqB,IAAI;AAChE,SAAK,cAAc,mBAAKA,QACrB,OAAO,CAAC,QAAQ,IAAIR,MAAK,MAAM,CAAC,EAChC;AAAA,MAAI,CAAC,KAAK,UACR,CAAC,OAAO,KAAK,EAA6B,OAAO,IAAI,MAAM,CAAC,CAAC;AAAA,IAChE;AAEF,0BAAsB,MAAM;AAC1B,WAAK,iBAAiB;AAAA,IACxB,CAAC;AAAA,EACH;AAAA,EAEA,OAAO,UAAqB;AAjO9B;AAkOI,UAAM,cAA+B,CAAC;AACtC,eAAW,OAAO,mBAAKQ,SAAO;AAC5B,YAAM,EAAE,CAACP,IAAG,GAAG,UAAU,CAACI,SAAQ,GAAG,IAAI,IAAI;AAC7C,YAAM,cAAc,QAAQ;AAC5B,YAAM,cAAc,WAAW,UAAU,QAAQ;AACjD,UAAI,gBAAgB,aAAa;AAC/B,cAAM,cAAc,IAAI,MAAM;AAC9B,oBAAYA,SAAQ,IAAI,cAAc,IAAI;AAC1C,2BAAKG,QAAM,QAAQ,IAAI;AACvB,oBAAY,KAAK,WAAW;AAAA,MAC9B;AAAA,IACF;AAEA,QAAI,YAAY,SAAS,GAAG;AAC1B,iBAAK,mBAAL,8BAAsB;AAAA,QACpB,kBAAkB,KAAK;AAAA,QACvB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,aAAa,KAAa;AAzP5B;AA0PI,SAAK,aAAa,IAAI,GAAG;AACzB,SAAK,cAAc,eAAe,mBAAKA,SAAO,KAAK,YAAY;AAC/D,UAAM,EAAE,MAAM,GAAG,IAAI,mBAAKE;AAC1B,eAAK,mBAAL,8BAAsB;AAAA,MACpB,kBAAkB,KAAK;AAAA,MAEvB,MAAM;AAAA,MACN,MAAM,KAAK,YACR,MAAM,MAAM,EAAE,EACd,IAAI,CAAC,QAAQJ,aAAY,KAAK,KAAK,IAAI,CAAC;AAAA,MAC3C,MAAM,KAAK,YAAY;AAAA,MACvB,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,cAAc,KAAa,UAAU,OAAO;AAC1C,SAAK,aAAa,OAAO,GAAG;AAC5B,QAAI,SAAS;AACX,iBAAW,UAAU,KAAK,aAAa,KAAK,GAAG;AAC7C,YAAI,OAAO,WAAW,GAAG,GAAG;AAC1B,eAAK,aAAa,OAAO,MAAM;AAAA,QACjC;AAAA,MACF;AAAA,IACF;AACA,SAAK,cAAc,eAAe,mBAAKE,SAAO,KAAK,YAAY;AAC/D,SAAK,iBAAiB;AAAA,EACxB;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,mBAAKK;AAAA,EACd;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,mBAAKN;AAAA,EACd;AAAA,EAEA,cAAc;AACZ,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,oBAAoB;AACtB,WAAO,mBAAKI;AAAA,EACd;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,mBAAKC;AAAA,EACd;AAAA,EAEA,IAAI,QAAQ;AACV,WAAO,mBAAKF;AAAA,EACd;AAAA,EAEA,IAAI,MAAM,OAAiB;AACzB,uBAAKA,SAAS;AACd,SAAK,KAAK,MAAM,KAAK;AACrB,0BAAsB,MAAM;AAC1B,WAAK,iBAAiB;AAAA,IACxB,CAAC;AAAA,EACH;AAAA,EAEQ,mBAAmB;AAtT7B;AAuTI,UAAM,EAAE,MAAM,GAAG,IAAI,mBAAKA;AAC1B,eAAK,mBAAL,8BAAsB;AAAA,MACpB,kBAAkB,KAAK;AAAA,MACvB,MAAM;AAAA,MACN,MAAM,KAAK,YACR,MAAM,MAAM,EAAE,EACd,IAAI,CAAC,QAAQJ,aAAY,KAAK,KAAK,IAAI,CAAC;AAAA,MAC3C,MAAM,KAAK,YAAY;AAAA,MACvB,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,IAAI,UAAU;AACZ,WAAO,mBAAKC,UAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,QAAQ,SAAmB;AAE7B,uBAAKA,UAAU;AAAA,MACb,GAAG,mBAAKA;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,eAAe;AACjB,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,aAAa,cAAgC;AAC/C,uBAAK,eAAgB;AAAA,EACvB;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,KAAK,MAAe;AAEtB,uBAAK,OAAQ;AAAA,EACf;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,mBAAKE;AAAA,EACd;AAAA,EAEA,IAAI,OAAO,QAA0B;AAEnC,uBAAKA,UAAU;AAAA,EACjB;AAAA,EAEA,IAAI,UAAU;AACZ,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,QAAQ,SAAqB;AAC/B,uBAAK,UAAW;AAAA,EAClB;AAAA,EAEA,IAAI,QAAQ;AACV,WAAO,mBAAKK;AAAA,EACd;AAAA,EAEA,IAAI,MAAM,OAA2B;AACnC,uBAAKA,SAAS;AAAA,EAChB;AAAA,EAEA,WAAW;AAAA,IACT;AAAA,IACA,MAAM,EAAE,YAAY,SAAS;AAAA,EAC/B,GAA4B;AAC1B,YAAQ,IAAI,eAAe;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,aAAa;AACX,YAAQ,IAAI,aAAa;AAAA,EAC3B;AAAA,EAEA,MAAM,YACJ,YAMA;AACA,YAAQ,IAAI,gBAAgB;AAAA,MAC1B;AAAA,IACF,CAAC;AACD,WAAO;AAAA,EACT;AAAA,EAEA,UACE,KACA,YACA,OACe;AACf,YAAQ;AAAA,MACN,6BAA6B,IAAI,KAAK,GAAG,KAAK,cAAc;AAAA,IAC9D;AACA,WAAO,QAAQ,QAAQ,IAAI;AAAA,EAC7B;AAAA,EAEA,aAAa,QAAgB;AAC3B,UAAM,YAAY,mBAAKN,QAAM,KAAK,CAAC,QAAQ,IAAIJ,IAAG,MAAM,MAAM;AAC9D,QAAI,WAAW;AACb,YAAM,EAAE,CAACH,IAAG,GAAG,WAAW,CAACD,MAAK,GAAG,YAAY,IAAI;AACnD,UAAI,SAAS,YAAY;AACzB,YAAM,YAAY,CAAC;AACnB,SAAG;AACD,cAAM,EAAE,CAACA,MAAK,GAAG,MAAM,IAAI,mBAAKQ,QAAM,MAAM;AAC5C,YAAI,UAAU,cAAc,GAAG;AAC7B,oBAAU,KAAK,mBAAKA,QAAM,MAAM,CAAC;AAAA,QACnC,WAAW,SAAS,aAAa;AAC/B;AAAA,QACF;AACA,kBAAU;AAAA,MACZ,SAAS,SAAS,mBAAKA,QAAM;AAC7B,aAAO;AAAA,IACT,OAAO;AACL,cAAQ;AAAA,QACN,qDAAqD;AAAA,MACvD;AAAA,IACF;AAEA,WAAO,CAAC;AAAA,EACV;AAAA,EAEA,eAAe,OAAe,cAAc,MAAM;AAChD,UAAM,OAAO,cAAc,KAAK,cAAc,mBAAKA;AACnD,WAAO,KAAK,OAAO,CAAC,QAAQ,IAAIR,MAAK,MAAM,KAAK;AAAA,EAClD;AACF;AAhYE;AACAO,WAAA;AACAC,SAAA;AACAC,WAAA;AACA;AACAC,UAAA;AACAC,sBAAA;AACAC,SAAA;AACA;AACAC,WAAA;AACAC,UAAA;AA4XF,SAAS,eAAe,MAAuB,cAA2B;AACxE,QAAM,cAA+B,CAAC;AACtC,QAAM,QAAe,EAAE,OAAO,EAAE;AAChC,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,MAAM,KAAK,CAAC;AAClB,UAAM,EAAE,CAACd,MAAK,GAAG,OAAO,CAACI,IAAG,GAAG,KAAK,CAACD,QAAO,GAAG,OAAO,IAAI;AAC1D,UAAM,aAAa,aAAa,IAAI,GAAG;AACvC,gBAAY,KAAK,SAAS,KAAK,OAAO,UAAU,CAAC;AACjD,QAAI,CAAC,UAAU,CAAC,YAAY;AAC1B,SAAG;AACD,aAAK;AAAA,MACP,SAAS,IAAI,KAAK,SAAS,KAAK,KAAK,IAAI,CAAC,EAAEH,MAAK,IAAI;AAAA,IACvD;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAM,WAAW,CACf,KACA,OACA,eACkB;AAClB,QAAM,QAAQ,IAAI,MAAM;AACxB,QAAM,CAAC,IAAI,MAAM;AACjB,QAAM,CAAC,IAAI,MAAM;AACjB,MAAI,YAAY;AACd,UAAME,YAAW,IAAI;AAAA,EACvB;AACA,QAAM,SAAS;AACf,SAAO;AACT;;;AC3aA,IAAM,EAAE,KAAK,IAAI,OAAO,kBAAkB;AAE1C,IAAM,EAAE,KAAAc,KAAI,IAAI;AAzDhB,IAAAC,UAAAC,WAAAC,SAAA,kBAAAC,SAAAC,qBAAAC,QAAAC,UAAAC;AA8DO,IAAM,mBAAN,cACG,aAEV;AAAA,EAuBE,YAAY;AAAA,IACV,aAAa;AAAA,IACb;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,GAA+B;AAC7B,UAAM;AAjCR,SAAQ,SAA2B;AAKnC,uBAAAP,UAA0B;AAC1B,uBAAAC,WAAuB,CAAC;AACxB,uBAAAC,SAAA;AACA;AACA,kCAA8B;AAC9B,uBAAAC,SAAmB,EAAE,MAAM,GAAG,IAAI,EAAE;AACpC,uBAAAC,qBAAqB;AACrB,uBAAAC,QAAQ;AACR,uBAAAC,UAA4B;AAE5B,uBAAAC,SAAA;AA0GA,mCAA0B,CAAC,YAAuC;AA5LpE;AA6LI,UAAI,QAAQ,SAAS,cAAc;AACjC,2BAAKD,UAAU;AACf,YAAI,QAAQ,aAAa;AACvB,eAAK,cAAc,QAAQ;AAAA,QAC7B;AACA,mBAAK,mBAAL,8BAAsB;AAAA,MACxB,WAAW,QAAQ,SAAS,YAAY;AACtC,2BAAKA,UAAU;AAAA,MACjB,WAAW,QAAQ,SAAS,WAAW;AACrC,2BAAKA,UAAU;AAAA,MACjB,WAAW,0BAA0B,OAAO,GAAG;AAI7C;AAAA,MACF,WAAW,QAAQ,SAAS,kBAAkB;AAC5C,aAAK,WAAW;AAAA,MAClB,OAAO;AACL,YACE,QAAQ,SAAS,qBACjB,QAAQ,SAAS,UACjB,QAAQ,SAAS,mBAAKD,SACtB;AACA,6BAAKA,QAAQ,QAAQ;AACrB,eAAK,KAAK,UAAU,QAAQ,IAAI;AAAA,QAClC;AAKA,YAAI,KAAK,qBAAqB;AAC5B,eAAK,iBAAiB;AAAA,QACxB;AAEA,YAAI,sBAAsB,OAAO,GAAG;AAClC,6BAAK,OAAQ,QAAQ;AAAA,QACvB,WAAW,oBAAoB,OAAO,GAAG;AACvC,6BAAKH,SAAS,QAAQ;AAAA,QACxB,OAAO;AACL,qBAAK,mBAAL,8BAAsB;AAAA,QACxB;AAEA,YAAI,KAAK,aAAa,YAAY;AAChC,eAAK,eAAe;AAAA,QACtB;AAAA,MACF;AAAA,IACF;AAkJA,SAAQ,iBAAiB,SAAS,MAAM;AACtC,WAAK,WAAW;AAAA,IAClB,GAAG,GAAG;AAqBN,SAAQ,kBAAgC,CAAC,UAAU;AACjD,UAAI,KAAK,YAAY,KAAK,QAAQ;AAChC,aAAK,OAAO,KAAK;AAAA,UACf,UAAU,KAAK;AAAA,UACf,MAAM;AAAA,UACN;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAEA,SAAQ,uBAAqC,SAAS,CAAC,UAAoB;AACzE,UAAI,KAAK,YAAY,KAAK,QAAQ;AAChC,aAAK,OAAO,KAAK;AAAA,UACf,UAAU,KAAK;AAAA,UACf,MAAM;AAAA,UACN;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF,GAAG,EAAE;AAEL,SAAQ,uBAAqC,SAAS,CAAC,UAAoB;AACzE,UAAI,KAAK,YAAY,KAAK,QAAQ;AAChC,aAAK,OAAO,KAAK;AAAA,UACf,UAAU,KAAK;AAAA,UACf,MAAM;AAAA,UACN;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF,GAAG,EAAE;AA1UH,QAAI,CAAC;AACH,YAAM,MAAM,mDAAmD;AAEjE,SAAK,aAAa;AAClB,SAAK,QAAQ;AACb,SAAK,WAAW;AAEhB,uBAAKF,UAAU;AAAA,MACb,GAAG,mBAAKA;AAAA,MACR,cAAc,gBAAgB,mBAAKA,UAAQ;AAAA,MAC3C,SAAS,WAAW,mBAAKA,UAAQ;AAAA,MACjC,QAAQ,UAAU,mBAAKA,UAAQ;AAAA,MAC/B,SAAS,WAAW,mBAAKA,UAAQ;AAAA,MACjC,MAAM,QAAQ,mBAAKA,UAAQ;AAAA,MAC3B,YAAY,cAAc,mBAAKA,UAAQ;AAAA,IACzC;AAEA,uBAAKO,SAAS;AACd,SAAK,eAAe,KAAK;AAAA,EAC3B;AAAA,EAEA,MAAM,UACJ;AAAA,IACE,YAAW,mBAAK,aAAL,YAAkB,KAAK,WAAW,KAAK;AAAA,IAClD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,GACA,UACA;AAtIJ,QAAAC;AAuII,QAAI,mBAAKF,cAAY,cAAc,mBAAKA,cAAY,aAAa;AAC/D,WAAK,OAAO,QAAQ;AACpB;AAAA,IACF;AACA,SAAK,iBAAiB;AACtB,QAAI,gBAAgB,WAAW,UAAU,WAAW,MAAM;AACxD,yBAAKN,UAAU;AAAA,QACb,GAAG,mBAAKA;AAAA,QACR,cAAc,gBAAgB,mBAAKA,UAAQ;AAAA,QAC3C,SAAS,WAAW,mBAAKA,UAAQ;AAAA,QACjC,QAAQ,UAAU,mBAAKA,UAAQ;AAAA,QAC/B,SAAS,WAAW,mBAAKA,UAAQ;AAAA,QACjC,MAAM,QAAQ,mBAAKA,UAAQ;AAAA,MAC7B;AAAA,IACF;AAKA,QAAI,OAAO;AACT,yBAAKG,SAAS;AAAA,IAChB;AAEA,QACE,mBAAKG,cAAY,kBACjB,mBAAKA,cAAY,gBAIjB;AACA;AAAA,IACF;AAEA,uBAAKA,UAAU;AACf,SAAK,WAAW;AAEhB,SAAK,SAAS,MAAM,aAAa;AAEjC,UAAM,EAAE,WAAW,IAAI;AAEvB,KAAAE,MAAA,KAAK,WAAL,gBAAAA,IAAa;AAAA,MACX;AAAA,QACE,GAAG,mBAAKR;AAAA,QACR;AAAA,QACA;AAAA,QACA,OAAO,KAAK;AAAA,QACZ,OAAO,mBAAKG;AAAA,QACZ,OAAO,mBAAKI;AAAA,MACd;AAAA,MACA,KAAK;AAAA;AAAA,EAET;AAAA,EAmDA,cAAc;AA7OhB;AA8OI,YAAQ,IAAI,gBAAgB,KAAK,UAAU;AAC3C,iCAAO,gBAAgB,KAAK;AAC5B,QAAI,KAAK,UAAU;AACjB,iBAAK,WAAL,mBAAa,YAAY,KAAK;AAAA,IAChC;AACA,eAAK,WAAL,mBAAa,QAAQ,KAAK;AAC1B,SAAK,SAAS;AACd,SAAK,mBAAmB;AACxB,uBAAKD,UAAU;AACf,SAAK,WAAW;AAChB,SAAK,QAAQ,EAAE,MAAM,GAAG,IAAI,EAAE;AAAA,EAChC;AAAA,EAEA,UAAU;AA3PZ;AA4PI,YAAQ,IAAI,YAAY,KAAK,4BAA4B,mBAAKA,WAAS;AACvE,iCAAO,YAAY,KAAK,4BAA4B,mBAAKA;AACzD,QAAI,KAAK,UAAU;AACjB,yBAAKA,UAAU;AACf,iBAAK,WAAL,mBAAa,KAAK;AAAA,QAChB,MAAM;AAAA,QACN,UAAU,KAAK;AAAA,MACjB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,SAAS;AAxQX;AAyQI,YAAQ,IAAI,WAAW,KAAK,4BAA4B,mBAAKA,WAAS;AAEtE,UAAM,aAAa,mBAAKA,UAAQ,WAAW,QAAQ;AACnD,UAAM,cAAc,mBAAKA,cAAY;AACrC,iCAAO,WAAW,KAAK,4BAA4B,mBAAKA;AACxD,QAAI,KAAK,UAAU;AACjB,UAAI,YAAY;AACd,aAAK,OAAO;AAAA,MACd,WAAW,aAAa;AACtB,mBAAK,WAAL,mBAAa,KAAK;AAAA,UAChB,MAAM;AAAA,UACN,UAAU,KAAK;AAAA,QACjB;AACA,2BAAKA,UAAU;AAAA,MACjB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,UAAU;AA5RZ;AA6RI,iCAAO,YAAY,KAAK,4BAA4B,mBAAKA;AACzD,QAAI,KAAK,UAAU;AACjB,yBAAKA,UAAU;AACf,iBAAK,WAAL,mBAAa,KAAK;AAAA,QAChB,UAAU,KAAK;AAAA,QACf,MAAM;AAAA,MACR;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,UAA8B;AAxSvC;AAySI,iCAAO,WAAW,KAAK,4BAA4B,mBAAKA;AACxD,QACE,KAAK,aACJ,mBAAKA,cAAY,cAAc,mBAAKA,cAAY,cACjD;AACA,yBAAKA,UAAU;AACf,UAAI,UAAU;AACZ,aAAK,iBAAiB;AAAA,MACxB;AACA,iBAAK,WAAL,mBAAa,KAAK;AAAA,QAChB,UAAU,KAAK;AAAA,QACf,MAAM;AAAA,MACR;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,UAAqB;AA1T9B;AA6TI,uBAAKF,qBAAqB,SAAS;AACnC,QAAI,KAAK,UAAU;AACjB,iBAAK,WAAL,mBAAa,KAAK;AAAA,QAChB,UAAU,KAAK;AAAA,QACf,MAAM;AAAA,QACN;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,aAAa,KAAa;AAvU5B;AAwUI,QAAI,KAAK,UAAU;AACjB,iBAAK,WAAL,mBAAa,KAAK;AAAA,QAChB,UAAU,KAAK;AAAA,QACf,MAAM;AAAA,QACN;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,cAAc,KAAa;AAjV7B;AAkVI,QAAI,KAAK,UAAU;AACjB,iBAAK,WAAL,mBAAa,KAAK;AAAA,QAChB,UAAU,KAAK;AAAA,QACf,MAAM;AAAA,QACN;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,QAAQ;AACV,WAAO,mBAAKF;AAAA,EACd;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,mBAAKI;AAAA,EACd;AAAA,EAEA,IAAI,WAAW;AACb,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,SAAS,UAA4B;AACvC,QAAI,aAAa,mBAAK,YAAW;AAC/B,yBAAK,WAAY;AACjB,cAAQ,UAAU;AAAA,QAChB,KAAK;AACH,eAAK,eAAe,KAAK;AACzB;AAAA,QACF,KAAK;AACH,eAAK,eAAe,KAAK;AACzB;AAAA,QACF,KAAK;AACH,eAAK,eAAe,KAAK;AACzB;AAAA,MACJ;AACA,WAAK,KAAK,YAAY,QAAQ;AAAA,IAChC;AAAA,EACF;AAAA,EAMA,IAAI,oBAAoB;AACtB,WAAO,mBAAKF;AAAA,EACd;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,mBAAKC;AAAA,EACd;AAAA,EAEA,IAAI,QAAQ;AACV,WAAO,mBAAKF;AAAA,EACd;AAAA,EAEA,IAAI,MAAM,OAAiB;AACzB,QAAI,MAAM,SAAS,mBAAKA,SAAO,QAAQ,MAAM,OAAO,mBAAKA,SAAO,IAAI;AAClE,yBAAKA,SAAS;AACd,WAAK,aAAa,KAAK;AAAA,IACzB;AAAA,EACF;AAAA,EAgCA,IAAI,SAAS;AACX,WAAO,mBAAKH;AAAA,EACd;AAAA,EAEA,IAAI,OAAO,QAA0B;AAtbvC;AAubI,QAAI,KAAK,YAAY,MAAM,GAAG;AAC5B,UAAI,mBAAKA,aAAW,KAAK,YAAY,KAAK,QAAQ;AAChD,YAAI,QAAQ;AACV,qBAAK,WAAL,mBAAa,KAAK;AAAA,YAChB,UAAU,KAAK;AAAA,YACf,MAAM;AAAA,YACN,QAAQ,mBAAKA;AAAA,UACf;AAAA,QACF;AAAA,MACF;AACA,WAAK,KAAK,UAAU,mBAAKA,SAAO;AAAA,IAClC;AAAA,EACF;AAAA,EAEA,YAAY,QAA0B;AArcxC;AAscI,QAAI,cAAc,mBAAKA,WAAS,MAAM,GAAG;AACvC,UAAI,QAAQ;AACV,cAAM,cACJ,sCAAQ,WAAR,mBAAgB,YAAU,iCAAQ,OAAO,kBAAiB,SACtD;AAAA,UACE,GAAG;AAAA,UACH,QAAQ;AAAA,YACN,QAAQ,OAAO,OAAO;AAAA,YACtB,cAAc,YAAY,OAAO,OAAO,MAAM;AAAA,UAChD;AAAA,QACF,IACA;AACN,2BAAKA,UAAU,mBAAmB,SAAS;AAC3C,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,IAAI,UAAU;AACZ,WAAO,mBAAKA,UAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,QAAQ,SAAmB;AAC7B,uBAAKA,UAAU;AAAA,MACb,GAAG,mBAAKA;AAAA,MACR;AAAA,IACF;AACA,QAAI,KAAK,UAAU;AACjB,YAAM,UAAU;AAAA,QACd,UAAU,KAAK;AAAA,QACf,MAAM;AAAA,QACN;AAAA,MACF;AACA,UAAI,KAAK,QAAQ;AACf,aAAK,OAAO,KAAK,OAAO;AAAA,MAC1B;AAAA,IACF;AACA,SAAK,KAAK,UAAU,mBAAKA,SAAO;AAAA,EAClC;AAAA,EAEA,IAAI,eAAe;AACjB,WAAO,mBAAKA,UAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,aAAa,cAAgC;AAnfnD;AAofI,uBAAKA,UAAU;AAAA,MACb,GAAG,mBAAKA;AAAA,MACR;AAAA,IACF;AACA,QAAI,KAAK,UAAU;AACjB,iBAAK,WAAL,mBAAa,KAAK;AAAA,QAChB,UAAU,KAAK;AAAA,QACf,MAAM;AAAA,QACN;AAAA,MACF;AAAA,IACF;AACA,SAAK,KAAK,UAAU,mBAAKA,SAAO;AAAA,EAClC;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,mBAAKA,UAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,KAAK,MAAe;AAEtB,uBAAKA,UAAU;AAAA,MACb,GAAG,mBAAKA;AAAA,MACR;AAAA,IACF;AACA,QAAI,KAAK,UAAU;AACjB,YAAM,UAAU;AAAA,QACd,UAAU,KAAK;AAAA,QACf,MAAM;AAAA,QACN;AAAA,MACF;AACA,UAAI,KAAK,QAAQ;AACf,aAAK,OAAO,KAAK,OAAO;AAAA,MAC1B;AAAA,IACF;AACA,SAAK,KAAK,UAAU,mBAAKA,SAAO;AAAA,EAClC;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,mBAAKA,UAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,OAAO,QAA0B;AAEnC,uBAAKA,UAAU;AAAA,MACb,GAAG,mBAAKA;AAAA,MACR;AAAA,IACF;AACA,QAAI,KAAK,UAAU;AACjB,YAAM,UAAU;AAAA,QACd,UAAU,KAAK;AAAA,QACf,MAAM;AAAA,QACN;AAAA,MACF;AACA,UAAI,KAAK,QAAQ;AACf,aAAK,OAAO,KAAK,OAAO;AAAA,MAC1B;AAAA,IACF;AACA,SAAK,KAAK,UAAU,mBAAKA,SAAO;AAAA,EAClC;AAAA,EAEA,IAAI,UAAU;AACZ,WAAO,mBAAKA,UAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,QAAQ,SAAqB;AApjBnC;AAqjBI,QAAI,oBAAoB,KAAK,SAAS,OAAO,GAAG;AAC9C,YAAM,aAAa,mBAAKC,WAAS,SAAS;AAC1C,yBAAKD,UAAU;AAAA,QACb,GAAG,mBAAKA;AAAA,QACR;AAAA,MACF;AACA,UAAI,KAAK,UAAU;AACjB,cAAM,UAAU;AAAA,UACd,UAAU,KAAK;AAAA,UACf,MAAM;AAAA,UACN,SAAS,mBAAKA,UAAQ;AAAA,QACxB;AAEA,YAAI,KAAK,QAAQ;AACf,eAAK,OAAO,KAAK,OAAO;AAAA,QAC1B;AAAA,MACF;AACA,UAAI,CAAC,cAAc,QAAQ,SAAS,KAAK,KAAK,UAAU;AACtD,mBAAK,mBAAL,8BAAsB;AAAA,UACpB,kBAAkB,KAAK;AAAA,UACvB,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM,CAAC;AAAA,QACT;AAAA,MACF;AACA,WAAK,KAAK,UAAU,mBAAKA,SAAO;AAChC,WAAK,iBAAiB,EAAE,QAAQ,CAAC;AAAA,IACnC;AAAA,EACF;AAAA,EAEA,IAAI,QAAQ;AACV,WAAO,mBAAKO;AAAA,EACd;AAAA,EAEA,IAAI,MAAM,OAA2B;AAxlBvC;AAylBI,uBAAKA,SAAS;AACd,QAAI,KAAK,YAAY,OAAO;AAC1B,iBAAK,WAAL,mBAAa,KAAK;AAAA,QAChB,MAAM;AAAA,QACN;AAAA,QACA,UAAU,KAAK;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,aAAa;AACf,WAAO,mBAAKP,UAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,WAAW,YAAiD;AAvmBlE;AAwmBI,uBAAKA,UAAU;AAAA,MACb,GAAG,mBAAKA;AAAA,MACR;AAAA,IACF;AAEA,QAAI,YAAY;AACd,YAAM;AAAA,QACJ;AAAA,QACA,MAAM,EAAE,YAAY,SAAS;AAAA,MAC/B,IAAI;AAEJ,UAAI,KAAK,UAAU;AACjB,mBAAK,WAAL,mBAAa,KAAK;AAAA,UAChB,UAAU,KAAK;AAAA,UACf,MAAM;AAAA,UACN;AAAA,UACA,kBAAkB;AAAA,UAClB,iBAAiB;AAAA,QACnB;AAAA,MACF;AAAA,IACF,OAAO;AACL,UAAI,KAAK,UAAU;AACjB,mBAAK,WAAL,mBAAa,KAAK;AAAA,UAChB,MAAM;AAAA,UACN,UAAU,KAAK;AAAA,QACjB;AAAA,MACF;AAAA,IACF;AACA,SAAK,KAAK,UAAU,mBAAKA,SAAO;AAAA,EAClC;AAAA,EAEQ,iBAAiB,QAA2B;AAClD,UAAM,gBAAgB,KAAK;AAC3B,SAAK,sBAAsB;AAE3B,QAAI,WAAW,QAAW;AACxB,WAAK,KAAK,UAAU,QAAQ,KAAK;AAAA,IACnC,OAAO;AACL,WAAK,KAAK,UAAU,eAAe,IAAI;AAAA,IACzC;AAAA,EACF;AAAA,EAEA,MAAM,QACJ,YACA;AAppBJ;AAqpBI,QAAI,KAAK,UAAU;AACjB,cAAO,UAAK,WAAL,mBAAa,QAAW;AAAA,QAC7B,MAAM,KAAK;AAAA,QACX,GAAG;AAAA,MACL;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,YACJ,YACA;AA/pBJ;AAgqBI,QAAI,KAAK,UAAU;AACjB,cAAO,UAAK,WAAL,mBAAa,QAAyB;AAAA,QAC3C,MAAM,KAAK;AAAA,QACX,GAAG;AAAA,MACL;AAAA,IACF;AAAA,EACF;AAAA,EAEA,UAAU,KAAoB,YAAoB,OAA2B;AAC3E,WAAO,KAAK,YAAY;AAAA,MACtB,QAAQ,IAAID,IAAG;AAAA,MACf,OAAO;AAAA,MACP;AAAA,MACA,MAAM;AAAA,IACR,CAAC,EAAE,KAAK,CAAC,aAAa;AACpB,UAAI,qCAAU,OAAO;AACnB,eAAO,SAAS;AAAA,MAClB,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,UAAU,KAAa,MAAqB;AAC1C,WAAO,KAAK,YAAY;AAAA,MACtB,QAAQ;AAAA,MACR;AAAA,MACA,MAAM;AAAA,IACR,CAAC,EAAE,KAAK,CAAC,aAAa;AACpB,UAAI,qCAAU,OAAO;AACnB,eAAO,SAAS;AAAA,MAClB,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EACA,UAAU,QAAgB;AACxB,WAAO,KAAK,YAAY;AAAA,MACtB;AAAA,MACA,MAAM;AAAA,IACR,CAAC,EAAE,KAAK,CAAC,aAAa;AACpB,UAAI,qCAAU,OAAO;AACnB,eAAO,SAAS;AAAA,MAClB,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH;AACF;AAxoBEC,WAAA;AACAC,YAAA;AACAC,UAAA;AACA;AACA;AACAC,UAAA;AACAC,sBAAA;AACAC,SAAA;AACAC,WAAA;AAEAC,UAAA;;;AC/EF,IAAM,eAAe,oBAAI,IAAoC;AAE7D,IAAM,kBAAkB,CAAC,OAAc,QAAgB,UAAU,OAAO;AACtE,MAAI;AACJ,QAAM,cAAc,aAAa,IAAI,KAAK;AAC1C,MAAI,eAAe,YAAY,IAAI,MAAM,GAAG;AAC1C,mBAAe,YAAY,IAAI,MAAM;AAAA,EACvC,OAAO;AACL,UAAM,EAAE,MAAM,IAAI,IAAI;AACtB,UAAM,MAAM,IAAI,MAAM;AACtB,mBAAe,CAAC;AAChB,UAAM,MAAM,oBAAI,IAAI;AACpB,eAAW,OAAO,MAAM;AACtB,YAAM,QAAQ,IAAI,GAAG;AACrB,UAAI,CAAC,IAAI,IAAI,KAAK,GAAG;AACnB,YAAI,IAAI,KAAK;AACb,qBAAa,KAAK,KAAK;AAAA,MACzB;AAAA,IACF;AACA,iBAAa,KAAK;AAClB,QAAI,aAAa;AACf,kBAAY,IAAI,QAAQ,YAAY;AAAA,IACtC,OAAO;AACL,mBAAa,IAAI,OAAO,oBAAI,IAAI,CAAC,CAAC,QAAQ,YAAY,CAAC,CAAC,CAAC;AAAA,IAC3D;AAAA,EACF;AACA,SAAO,UACH,aAAa,OAAO,CAAC,UAAU,MAAM,SAAS,EAAE,WAAW,OAAO,CAAC,IACnE;AACN;AAcO,IAAM,kBAAkB,CAC7B,OACA,QACA,YAEA,IAAI,QAAQ,CAAC,YAAY;AACvB,QAAM,eAAe,gBAAgB,OAAO,QAAQ,OAAO;AAC3D,QAAM,SACJ,aAAa,SAAS,KAClB,6CAAc,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,SAAS,KACjD,aAAa,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC;AAC1C,aAAW,MAAM,QAAQ,MAAM,GAAG,GAAG;AACvC,CAAC;;;AC1DH;AAsCO,IAAM,yBAAN,cAAqC,gBAAgB;AAAA,EAK1D,YAAY;AAAA,IACV;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAG;AAAA,EACL,GAA2C;AAlD7C;AAmDI,QAAI,SAAS,UAAa,UAAU,QAAW;AAC7C,YAAM,MAAM,sDAAsD;AAAA,IACpE;AACA,UAAM;AAAA,MACJ,GAAG;AAAA,MACH,OAAM,2BAAQ,+BAAO,SAAf,YAAuB,CAAC;AAAA,IAChC,CAAC;AAlBH;AACA;AACA;AAiBE,SAAK,QAAQ;AACb,uBAAK,kBAAmB;AACxB,uBAAK,cAAe;AACpB,uBAAK,QAAS;AAEd,QAAI,OAAO;AACT,YAAM,GAAG,UAAU,KAAK,MAAM;AAC9B,YAAM,GAAG,UAAU,KAAK,SAAS;AAAA,IACnC;AAAA,EACF;AAAA,EAEA,MAAM,UAAU,gBAAgC,UAA6B;AAC3E,UAAM,eAAe,MAAM,UAAU,gBAAgB,QAAQ;AAI7D,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,MAAM,OAAiB;AACzB,UAAM,QAAQ;AAAA,EAEhB;AAAA,EACA,IAAI,QAAQ;AACV,WAAO,MAAM;AAAA,EACf;AAAA,EAEQ,kBAAkB;AACxB,WAAO,KAAK,aAAa;AAAA,MACvB,CAAC,MAAuB,aAA4B;AAClD,YAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,mBAAS,QAAQ,CAAC,QAAQ;AACxB,kBAAM,MAAM,KAAK,KAAK,GAAG;AACzB,gBAAI,KAAK;AACP,mBAAK,KAAK,GAAG;AAAA,YACf;AAAA,UACF,CAAC;AAAA,QACH,OAAO;AACL,gBAAM,MAAM,KAAK,KAAK,QAAQ;AAC9B,cAAI,KAAK;AACP,iBAAK,KAAK,GAAG;AAAA,UACf;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,MACA,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,UACE,KACA,YACA,OACe;AA/GnB;AAgHI,UAAM,MAAM,IAAI,aAAa,GAAG;AAChC,6BAAK,YAAL,mBAAa,OAAO,KAAK,YAAY;AACrC,WAAO,QAAQ,QAAQ,IAAI;AAAA,EAC7B;AAAA,EAEA,MAAM,QACJ,YACwB;AAvH5B;AAwHI,UAAM,cAAa,wBAAK,kBAAL,mBAAmB;AAAA,MACpC,CAAC,YACC,QAAQ,YACP,WAA6C;AAAA;AAElD,QAAI,YAAY;AACd,aAAO,WAAW,QAAQ;AAAA,QACxB,GAAG;AAAA,MACL,CAAC;AAAA,IACH,OAAO;AACL,cAAQ,IAAI,qCAAqC,WAAW,SAAS;AAAA,IACvE;AAAA,EACF;AAAA,EAEA,MAAM,YACJ,YAMA;AA7IJ;AA8II,UAAM,cAAa,wBAAK,kBAAL,mBAAmB;AAAA,MACpC,CAAC,YACC,QAAQ,YAAa,WAAqC;AAAA;AAG9D,QAAI,YAAY;AACd,cAAQ,WAAW,MAAM;AAAA,QACvB,KAAK,8BAA8B;AACjC,gBAAM,eAAe,KAAK,gBAAgB;AAC1C,iBAAO,WAAW,QAAQ;AAAA,YACxB,GAAG;AAAA,YACH;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QAEA;AAAA,MACF;AAAA,IACF;AACA,WAAO,MAAM,YAAY,UAAU;AAAA,EACrC;AAAA,EAEA,wBAAwB,QAAgB,SAAqC;AAC3E,QAAI,mBAAK,SAAQ;AACf,aAAO,gBAAgB,mBAAK,SAAQ,QAAQ,OAAO;AAAA,IACrD,OAAO;AACL,YAAM;AAAA,QACJ;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AArIE;AACA;AACA;;;ACnCK,IAAM,qBAAqB,CAAC,gBACjC,CAAC,QAAQ,EAAE;AAAA,EACT,MAAM,WAAW,EACd,KAAK,EAAE,EACP,IAAI,CAAC,GAAG,MAAM,UAAU,IAAI,GAAG;AACpC;AAWK,IAAM,sBACX,CAAC,YAAsB,CAAC,UAAU;AAChC,SAAO,CAAC,OAAO,QAAQ,GAAG,EAAE;AAAA,IAC1B,MAAM,QAAQ,MAAM,EACjB,KAAK,IAAI,EACT,IAAI,CAAC,GAAG,MAAM,SAAS,IAAI,OAAO,QAAQ,GAAG;AAAA,EAClD;AACF;AAEK,IAAM,yBAA4C,CACvD,SACA,eAAe,CAAC,MACb;AACH,MAAI,OAAO,YAAY,UAAU;AAC/B,WAAO,CAAC,EAAE,MAAM,cAAc,OAAO,IAAI,CAAC,EAAE;AAAA,MAC1C,MAAM,OAAO,EACV,KAAK,IAAI,EACT,IAAI,CAAC,GAAG,MAAM;AACb,cAAM,OAAO,UAAU,IAAI;AAC3B,eAAO,EAAE,MAAM,OAAO,KAAK,GAAG,aAAa,IAAI,EAAE;AAAA,MACnD,CAAC;AAAA,IACL;AAAA,EACF,OAAO;AACL,UAAM,MAAM,wDAAwD;AAAA,EACtE;AACF;AAEA,IAAM,oBAAoB;AAAA,EACxB,iBAAiB;AAAA,EACjB,cAAc;AAChB;AAEO,IAAM,2BAA2B,CACtC,UAGqE;AA1DvE;AA2DE,QAAM,aAAY,oCAAO,UAAP,YAAgB;AAGlC,UAAQ,+BAAO,QAAQ;AAAA,IACrB,KAAK,SAAS;AACZ,YAAM,EAAE,iBAAiB,cAAc,sBAAsB;AAAA;AAAA;AAAA,SAG3D,yBAAoB,SAAS,MAA7B,YAAkC;AAAA;AACpC,aAAO,CAAC,iBAAiB,cAAc,qBAAqB;AAAA,IAC9D;AAAA,IAEA,KAAK,UAAU;AACb,YAAM,EAAE,iBAAiB,cAAc,sBAAsB;AAAA;AAAA;AAAA,SAG3D,0BAAqB,SAAS,MAA9B,YAAmC;AAAA;AACrC,aAAO,CAAC,iBAAiB,cAAc,qBAAqB;AAAA,IAC9D;AAAA,IACA,KAAK,QAAW;AACd,YAAM,EAAE,iBAAiB,aAAa,IAAI;AAC1C,aAAO,CAAC,iBAAiB,YAAY;AAAA,IACvC;AAAA,IACA;AACE,YAAM;AAAA,QACJ,2BAA2B,+BAAO;AAAA,MACpC;AAAA,EACJ;AACF;AAEO,IAAM,gBAAgB,CAC3B,OACA,QACA,QACA,YACG;AACH,QAAM,oBAAoB,OAAO,OAAO;AACxC,QAAM,cAAc,OAAO,kBAAkB,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC;AACnE,QAAM,OAAoC,CAAC;AAC3C,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAM,MAAM,YAAY,CAAC;AACzB,QAAI,KAAK;AACP,WAAK,CAAC,IAAI;AAAA,IACZ,OAAO;AACL;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;;;AC3GA,IAAAE,QAAA;AAWO,IAAM,QAAN,cAAoB,aAA0B;AAAA,EAOnD,YACE,QACA,MACA,SACA,iBACA;AACA,UAAM;AAZR,uBAAAA,QAAA;AACA;AACA;AACA,+BAAS,oBAAI,IAAoB;AACjC;AASE,uBAAKA,QAAQ;AACb,uBAAK,UAAW;AAChB,uBAAK,SAAU;AACf,uBAAK,aAAc,QAAQ,OAAO,GAAG;AACrC,SAAK,WAAW;AAChB,uDAAiB,SAAS;AAC1B,uDAAiB,SAAS,EAAE,MAAM,GAAG,IAAI,IAAI;AAAA,EAC/C;AAAA,EAEQ,aAAa;AACnB,aAAS,IAAI,GAAG,IAAI,mBAAKA,QAAM,QAAQ,KAAK;AAC1C,YAAM,MAAM,mBAAKA,QAAM,CAAC,EAAE,mBAAK,YAAW;AAC1C,yBAAK,QAAO,IAAI,KAAK,CAAC;AAAA,IACxB;AAAA,EACF;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,mBAAKA;AAAA,EACd;AAAA,EAEA,IAAI,MAAM;AACR,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,OAAO,KAA2B;AAChC,UAAM,QAAQ,mBAAKA,QAAM;AACzB,uBAAKA,QAAM,KAAK,GAAG;AACnB,UAAM,MAAM,IAAI,mBAAK,YAAW;AAChC,uBAAK,QAAO,IAAI,KAAK,KAAK;AAC1B,SAAK,KAAK,UAAU,GAAG;AAAA,EACzB;AAAA,EAEA,UAAU,KAAa;AA7DzB;AA8DI,UAAM,SAAQ,wBAAK,QAAO,IAAI,GAAG,MAAnB,YAAwB;AACtC,WAAO,mBAAKA,QAAM,KAAK;AAAA,EACzB;AAAA,EAEA,OAAO,KAAa,YAAoB,OAA2B;AACjE,UAAM,WAAW,mBAAKA,QAAM;AAAA,MAC1B,CAAC,QAAQ,IAAI,mBAAK,YAAW,MAAM;AAAA,IACrC;AACA,UAAM,WAAW,mBAAK,UAAS,UAAU;AACzC,QAAI,aAAa,IAAI;AACnB,YAAM,MAAM,mBAAKA,QAAM,QAAQ;AAC/B,YAAM,SAAS,IAAI,MAAM;AACzB,aAAO,QAAQ,IAAI;AACnB,yBAAKA,QAAM,QAAQ,IAAI;AACvB,WAAK,KAAK,UAAU,QAAQ,UAAU;AAAA,IACxC;AAAA,EACF;AAAA,EACA,UAAU,KAA2B;AACnC,UAAM,MAAM,IAAI,mBAAK,YAAW;AAChC,UAAM,WAAW,mBAAKA,QAAM;AAAA,MAC1B,CAACC,SAAQA,KAAI,mBAAK,YAAW,MAAM;AAAA,IACrC;AACA,QAAI,aAAa,IAAI;AACnB,yBAAKD,QAAM,QAAQ,IAAI;AACvB,WAAK,KAAK,UAAU,GAAG;AAAA,IACzB;AAAA,EACF;AACF;AA7EEA,SAAA;AACA;AACA;AACA;AACA;AA2EK,IAAM,qBAAqB,CAAC,WACjC,OAAO,OAAO,OAAO,OAAO,EAAE,OAAkB,CAAC,KAAK,KAAK,UAAU;AACnE,MAAI,IAAI,IAAI,IAAI;AAChB,SAAO;AACT,GAAG,CAAC,CAAC;AAEP,IAAM,oBAAoB,CACxB,YACA,EAAE,SAAS,OAAO,OAAO,GAAG,GAC5B,EAAE,SAAS,OAAO,OAAO,GAAG,MACzB;AACH,QAAM,OAAO,MAAM,KAAK,CAAC,QAAQ,IAAI,SAAS,UAAU;AACxD,QAAM,OAAO,MAAM,KAAK,CAAC,QAAQ,IAAI,SAAS,UAAU;AACxD,MAAI,QAAQ,MAAM;AAChB,QAAI,KAAK,mBAAmB,KAAK,gBAAgB;AAC/C,aAAO,KAAK;AAAA,IACd,OAAO;AACL,YAAM;AAAA,QACJ,eAAe,GAAG,aAAa,GAAG,0BAA0B;AAAA,MAC9D;AAAA,IACF;AAAA,EACF,WAAW,MAAM;AACf,WAAO,KAAK;AAAA,EACd,WAAW,MAAM;AACf,WAAO,KAAK;AAAA,EACd,OAAO;AACL,UAAM,MAAM,0BAA0B;AAAA,EACxC;AACF;AAIO,IAAM,aAAa,CACxB,WACA,QACA,QACA,eACG;AACH,QAAM,EAAE,KAAK,IAAI,QAAQ,QAAQ,IAAI;AACrC,QAAM,EAAE,KAAK,IAAI,QAAQ,QAAQ,IAAI;AACrC,QAAM,KAAK,GAAG,UAAU;AACxB,QAAM,KAAK,GAAG,UAAU;AAExB,QAAM,kBAAkB,IAAI;AAAA,IAC1B,CAAC,GAAG,QAAQ,SAAS,GAAG,QAAQ,OAAO,EAAE,IAAI,CAAC,QAAQ,IAAI,IAAI,EAAE,KAAK;AAAA,EACvE;AAEA,QAAM,iBAA8B;AAAA,IAClC,KAAK;AAAA,IACL,OAAO;AAAA,IACP,SAAS,MAAM,KAAK,eAAe,EAAE,IAAkB,CAAC,gBAAgB;AAAA,MACtE,MAAM;AAAA,MACN,gBAAgB,kBAAkB,YAAY,SAAS,OAAO;AAAA,IAChE,EAAE;AAAA,EACJ;AAEA,QAAM,OAA+B,CAAC;AACtC,QAAM,oBAAoB,mBAAmB,cAAc;AAE3D,aAAW,OAAO,OAAO,MAAM;AAC7B,UAAM,OAAO,OAAO,UAAU,OAAO,IAAI,EAAE,CAAC,CAAC;AAC7C,QAAI,MAAM;AACR,YAAM,MAAM,CAAC;AACb,iBAAW,UAAU,OAAO,OAAO,SAAS;AAC1C,cAAM,QAAQ,IAAI,GAAG,OAAO,IAAI,CAAC;AACjC,YAAI,kBAAkB,OAAO,IAAI,CAAC,IAAI;AAAA,MACxC;AACA,iBAAW,UAAU,OAAO,OAAO,SAAS;AAC1C,cAAM,QAAQ,KAAK,GAAG,OAAO,IAAI,CAAC;AAClC,YAAI,kBAAkB,OAAO,IAAI,CAAC,IAAI;AAAA,MACxC;AAEA,WAAK,KAAK,GAAG;AAAA,IACf;AAAA,EACF;AAIA,QAAM,WAAW,IAAI,MAAM,gBAAgB,MAAM,iBAAiB;AAElE,SAAO,GAAG,UAAU,CAAC,QAAQ;AAC3B,UAAM,OAAO,OAAO,UAAU,OAAO,IAAI,EAAE,CAAC,CAAC;AAC7C,QAAI,MAAM;AACR,YAAM,MAAM,CAAC;AACb,iBAAW,UAAU,OAAO,OAAO,SAAS;AAC1C,cAAM,QAAQ,IAAI,GAAG,OAAO,IAAI,CAAC;AACjC,YAAI,kBAAkB,OAAO,IAAI,CAAC,IAAI;AAAA,MACxC;AACA,iBAAW,UAAU,OAAO,OAAO,SAAS;AAC1C,cAAM,QAAQ,KAAK,GAAG,OAAO,IAAI,CAAC;AAClC,YAAI,kBAAkB,OAAO,IAAI,CAAC,IAAI;AAAA,MACxC;AACA,eAAS,OAAO,GAAG;AAAA,IACrB;AAAA,EACF,CAAC;AAED,SAAO,GAAG,UAAU,CAAC,QAAQ;AAC3B,UAAM,WAAW,IAAI,EAAE;AACvB,UAAM,YAAY,SAAS,UAAU,QAAQ;AAC7C,QAAI,WAAW;AACb,YAAM,aAAa,UAAU,MAAM;AACnC,iBAAW,EAAE,KAAK,KAAK,OAAO,OAAO,SAAS;AAC5C,YAAI,IAAI,GAAG,IAAI,CAAC,MAAM,WAAW,kBAAkB,IAAI,CAAC,GAAG;AACzD,qBAAW,kBAAkB,IAAI,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC;AAAA,QACpD;AAAA,MACF;AACA,eAAS,UAAU,UAAU;AAAA,IAC/B;AAAA,EACF,CAAC;AAED,SAAO;AACT;;;AC1MO,SAAS,OAAO,KAAa,KAAa;AAC/C,QAAM,KAAK,KAAK,GAAG;AACnB,QAAM,KAAK,MAAM,GAAG;AACpB,SAAO,KAAK,MAAM,KAAK,OAAO,KAAK,MAAM,MAAM,EAAE,IAAI;AACvD;AASO,IAAM,mBAAmC,CAAC,KAAK,QACpD,OAAO,MAAM,OAAO,KAAK,OAAO;AAE3B,IAAM,aAAa,CACxB,eACAE,sBACG;AACH,QAAM,MAAMA,kBAAiB,GAAG,GAAI;AACpC,QAAM,UAAUA,kBAAiB,MAAM,eAAe,MAAM,CAAC;AAC7D,QAAMC,OAAMD,kBAAiB,MAAM,GAAG,MAAM,aAAa;AACzD,QAAME,OAAM,UAAU,IAAI,MAAM;AAChC,QAAM,SAAS,KAAK,MAAMA,OAAM,GAAG,IAAI;AACvC,QAAM,SAAS,KAAK,MAAMD,OAAM,GAAG,IAAI;AACvC,SAAO,CAAC,QAAQ,MAAM;AACxB;AAEA,IAAM,SAAS,CACbC,MACAD,MACA,iBACA,kBACG;AACH,QAAM,SAASA,OAAMC;AACrB,SAAO,KAAK;AAAA,IACVD,OAAM,kBAAkB;AAAA,IACxB,SAAS,IAAIC,OAAM;AAAA,EACrB;AACF;AAEA,IAAM,SAAS,CACbA,MACAD,MACA,iBACA,kBACG;AACH,SAAO,KAAK,IAAIC,OAAM,IAAID,OAAMC,QAAO,IAAIA,IAAG;AAChD;AAEA,IAAM,SAAS,CACbA,MACAD,MACA,iBACA,kBACG;AACH,QAAM,SAAS,KAAK,IAAIA,OAAM,IAAIA,OAAMC,QAAO,IAAIA,IAAG;AACtD,SAAO,SAAS,IAAIA,OAAM,IAAI;AAChC;AAEA,IAAM,SAAS,CACbA,MACAD,MACA,iBACA,kBACG;AACH,QAAM,SAASA,OAAMC;AACrB,QAAM,MAAM,SAAS,IAAIA;AACzB,QAAM,SAAS,KAAK;AAAA,IAClBA,OAAM,KAAK,IAAI,kBAAkB,QAAQ,EAAE;AAAA,IAC3C,MAAM;AAAA,EACR;AACA,SAAO,SAAS,IAAIA,OAAM;AAC5B;AAEO,IAAM,qBAAqB,CAChCA,MACAD,MACA,iBACA,eACAD,sBACG;AACH,MAAI,UAAUC;AACd,MAAI,KAAK,IAAIC,OAAMD,IAAG,KAAK;AAAG,cAAUA,OAAM;AAC9C,QAAM,cAAc,OAAOC,MAAK,SAAS,iBAAiB,aAAa;AACvE,QAAM,cAAc,OAAOA,MAAK,SAAS,iBAAiB,aAAa;AACvE,QAAM,cAAc,OAAOA,MAAK,SAAS,iBAAiB,aAAa;AACvE,QAAM,cAAc,OAAOA,MAAK,SAAS,iBAAiB,aAAa;AACvE,QAAM,SACJ,KAAK,MAAMF,kBAAiB,aAAa,WAAW,IAAI,GAAG,IAAI;AACjE,QAAM,SACJ,KAAK,MAAMA,kBAAiB,aAAa,WAAW,IAAI,GAAG,IAAI;AACjE,SAAO,CAAC,QAAQ,MAAM;AACxB;;;ACzFA,IAAM,cAAc,CAAC,UAAkB;AACrC,QAAM,aAAa,OAAO,GAAG,GAAG,IAAI;AACpC,QAAM,YAAY,OAAO,GAAG,EAAE,KAAK,IAAI,IAAI;AAC3C,SAAO,QAAQ,QAAQ,aAAa;AACtC;AAEO,IAAM,sBAAN,MAAqD;AAAA,EAO1D,YAAY,gBAA2C;AAJvD,SAAQ,WAAW;AAgCnB,kBAAS,MAAM;AA9CjB;AA+CI,UAAI,KAAK,SAAS,KAAK,OAAO;AAC5B,cAAM,QAAO,UAAK,UAAL,mBAAY;AACzB,cAAM,EAAE,KAAAG,MAAK,KAAAC,MAAK,MAAAC,OAAM,GAAG,KAAK,IAAI,KAAK;AACzC,YAAI,SAAQ,6BAAM,UAAS,GAAG;AAC5B,gBAAM,WAAW,KAAK,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM;AACpD,mBAAS,WAAW,KAAK,MAAM,MAAM,WAAW,UAAU,YAAY;AACpE,gBAAI,cAAc;AAClB,kBAAM,iBAAiB,OAAO,GAAG,EAAE,IAAI;AACvC,gBAAI,gBAAgB;AAGlB,oBAAM,aAAa,KAAK,MAAM,KAAK,QAAQ;AAC3C,oBAAM,MAAM,KAAK,QAAQ;AAEzB,kBAAIF,SAAQ,UAAaC,SAAQ,QAAW;AAC1C,sBAAM,EAAE,CAACD,IAAG,GAAG,YAAY,CAACC,IAAG,GAAG,WAAW,IAAI;AACjD,sBAAM,CAAC,QAAQ,MAAM,IAAI;AAAA,kBACvB;AAAA,kBACA;AAAA,kBACA;AAAA,kBACA;AAAA,kBACA;AAAA,gBACF;AACA,2BAAWA,IAAG,IAAI;AAClB,2BAAWD,IAAG,IAAI;AAClB,oBAAIE,UAAS,QAAW;AACtB,wBAAM,UACJ,KAAK,OAAO,cAAc,SAAS,cAAc,KAAK,GAAG,IACzD;AACF,6BAAWA,KAAI,IAAI;AAAA,gBACrB;AAAA,cACF;AAEA,yBAAW,UAAU,OAAO,OAAO,IAAI,GAAG;AACxC,sBAAM,oBAAoB,OAAO,GAAG,EAAE,IAAI;AAC1C,oBAAI,mBAAmB;AACrB,iCAAe;AACf,wBAAM,WAAW,YAAY,IAAI,MAAM,CAAW;AAClD,sBAAI,KAAK,OAAO;AACd,+BAAW,MAAM,IAAI;AAAA,kBACvB;AAAA,gBACF;AAAA,cACF;AACA,kBAAI,KAAK,SAAS,cAAc,GAAG;AACjC,qBAAK,MAAM,UAAU,UAAU;AAAA,cACjC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,UAAI,KAAK,UAAU;AACjB,aAAK,QAAQ,OAAO,WAAW,KAAK,QAAQ,GAAG;AAAA,MACjD;AAAA,IACF;AAlFE,SAAK,iBAAiB;AAAA,EACxB;AAAA,EAEA,SAAS,OAAiB;AACxB,SAAK,QAAQ;AACb,QAAI,CAAC,KAAK,YAAY,KAAK,OAAO;AAChC,WAAK,cAAc;AAAA,IACrB;AAAA,EACF;AAAA,EAEA,SAAS,OAAc;AACrB,SAAK,QAAQ;AAAA,EACf;AAAA,EAEQ,gBAAgB;AACtB,SAAK,WAAW;AAChB,SAAK,OAAO;AAAA,EACd;AAAA,EAEQ,eAAe;AACrB,SAAK,WAAW;AAChB,QAAI,KAAK,OAAO;AACd,aAAO,aAAa,KAAK,KAAK;AAC9B,WAAK,QAAQ;AAAA,IACf;AAAA,EACF;AA0DF;;;ACpGA,IAAO,kBAAQ;AAAA,EACX,CAAC,SAAQ,uBAAsB,gBAAe,gBAAe,WAAW;AAAA,EACxE,CAAC,SAAQ,iCAAgC,kBAAiB,gBAAe,QAAQ;AAAA,EACjF,CAAC,SAAQ,sBAAqB,kBAAiB,EAAE;AAAA,EACjD,CAAC,SAAQ,kCAAiC,gBAAe,gBAAe,SAAS;AAAA,EACjF,CAAC,SAAQ,sBAAqB,kBAAiB,gBAAe,SAAS;AAAA,EACvE,CAAC,UAAS,oBAAmB,gBAAe,iBAAgB,WAAW;AAAA,EACvE,CAAC,SAAQ,qBAAoB,kBAAiB,gBAAe,SAAS;AAAA,EACtE,CAAC,QAAO,cAAa,gBAAe,gBAAe,WAAW;AAAA,EAC9D,CAAC,SAAQ,oBAAmB,kBAAiB,gBAAe,SAAS;AAAA,EACrE,CAAC,QAAO,oBAAmB,gBAAe,gBAAe,WAAW;AAAA,EACpE,CAAC,SAAQ,oCAAmC,gBAAe,gBAAe,SAAS;AAAA,EACnF,CAAC,UAAS,iBAAgB,gBAAgB,gBAAe,WAAW;AAAA,EACpE,CAAC,UAAS,iCAAgC,kBAAkB,gBAAe,SAAS;AAAA,EACpF,CAAC,UAAS,6BAA4B,gBAAgB,gBAAe,WAAW;AAAA,EAChF,CAAC,QAAO,iBAAgB,kBAAkB,gBAAe,WAAW;AAAA,EACpE,CAAC,SAAQ,sCAAqC,kBAAkB,iBAAgB,QAAQ;AAAA,EACxF,CAAC,UAAS,wBAAuB,gBAAgB,iBAAgB,WAAW;AAAA,EAC5E,CAAC,SAAQ,qBAAoB,gBAAgB,gBAAe,WAAW;AAAA,EACvE,CAAC,UAAS,cAAa,kBAAkB,gBAAe,SAAS;AAAA,EACjE,CAAC,QAAO,WAAU,gBAAgB,gBAAe,YAAY;AAAA,EAC7D,CAAC,UAAS,uBAAsB,kBAAkB,gBAAe,SAAS;AAAA,EAC1E,CAAC,QAAO,mBAAkB,gBAAgB,gBAAe,WAAW;AAAA,EACpE,CAAC,SAAQ,iBAAgB,kBAAkB,iBAAgB,QAAQ;AAAA,EACnE,CAAC,SAAQ,iBAAgB,gBAAgB,gBAAe,WAAW;AAAA,EACnE,CAAC,SAAQ,sBAAqB,kBAAkB,gBAAe,WAAW;AAAA,EAC1E,CAAC,SAAQ,eAAc,kBAAkB,gBAAe,SAAS;AAAA,EACjE,CAAC,SAAQ,YAAW,kBAAkB,iBAAgB,SAAS;AAAA,EAC/D,CAAC,QAAO,mBAAkB,gBAAe,EAAE;AAAA,EAC3C,CAAC,SAAQ,eAAc,kBAAkB,gBAAe,SAAS;AAAA,EACjE,CAAC,SAAQ,oCAAmC,gBAAgB,gBAAe,WAAW;AAAA,EACtF,CAAC,UAAS,iBAAgB,kBAAkB,gBAAe,SAAS;AAAA,EACpE,CAAC,SAAQ,gBAAe,kBAAkB,iBAAgB,WAAW;AAAA,EACrE,CAAC,UAAS,kBAAiB,gBAAgB,gBAAe,SAAS;AAAA,EACnE,CAAC,SAAQ,YAAW,gBAAgB,gBAAe,WAAW;AAAA,EAC9D,CAAC,SAAQ,YAAW,gBAAgB,gBAAe,SAAS;AAAA,EAC5D,CAAC,UAAS,iBAAgB,eAAe,gBAAe,YAAY;AAAA,EACpE,CAAC,SAAQ,wBAAuB,kBAAkB,gBAAe,WAAW;AAAA,EAC5E,CAAC,SAAQ,8BAA6B,kBAAkB,iBAAgB,SAAS;AAAA,EACjF,CAAC,QAAO,4BAA2B,kBAAkB,gBAAe,SAAS;AAAA,EAC7E,CAAC,UAAS,kBAAiB,gBAAgB,gBAAe,SAAS;AAAA,EACnE,CAAC,UAAS,sBAAqB,gBAAgB,gBAAe,WAAW;AAAA,EACzE,CAAC,SAAQ,gDAA+C,gBAAgB,iBAAgB,WAAW;AAAA,EACnG,CAAC,SAAQ,sCAAqC,kBAAkB,iBAAgB,SAAS;AAAA,EACzF,CAAC,SAAQ,iBAAgB,gBAAgB,gBAAe,SAAS;AAAA,EACjE,CAAC,SAAQ,+BAA8B,kBAAkB,iBAAgB,SAAS;AAAA,EAClF,CAAC,UAAS,wBAAuB,gBAAgB,gBAAe,SAAS;AAAA,EACzE,CAAC,UAAS,iBAAgB,kBAAkB,gBAAe,SAAS;AAAA,EACpE,CAAC,UAAS,uBAAsB,kBAAkB,gBAAe,QAAQ;AAAA,EACzE,CAAC,SAAQ,YAAW,gBAAgB,gBAAe,WAAW;AAAA,EAC9D,CAAC,UAAS,wBAAuB,kBAAkB,iBAAgB,SAAS;AAAA,EAC5E,CAAC,SAAQ,mBAAkB,gBAAgB,gBAAe,WAAW;AAAA,EACrE,CAAC,UAAS,8BAA6B,kBAAkB,gBAAe,SAAS;AAAA,EACjF,CAAC,UAAS,8BAA6B,gBAAgB,gBAAe,WAAW;AAAA,EACjF,CAAC,UAAS,6BAA4B,eAAe,gBAAe,YAAY;AAAA,EAChF,CAAC,SAAQ,oCAAmC,kBAAkB,gBAAe,SAAS;AAAA,EACtF,CAAC,UAAS,gBAAe,gBAAgB,gBAAe,SAAS;AAAA,EACjE,CAAC,SAAQ,8BAA6B,gBAAgB,gBAAe,SAAS;AAAA,EAC9E,CAAC,UAAS,cAAa,kBAAkB,gBAAe,SAAS;AAAA,EACjE,CAAC,SAAQ,mCAAkC,gBAAe,EAAE;AAAA,EAC5D,CAAC,QAAO,sBAAqB,gBAAgB,gBAAe,WAAW;AAAA,EACvE,CAAC,SAAQ,aAAY,kBAAkB,iBAAgB,SAAS;AAAA,EAChE,CAAC,SAAQ,mBAAkB,gBAAgB,gBAAe,WAAW;AAAA,EACrE,CAAC,SAAQ,mBAAkB,kBAAkB,iBAAgB,SAAS;AAAA,EACtE,CAAC,UAAS,gBAAe,gBAAgB,gBAAe,WAAW;AAAA,EACnE,CAAC,QAAO,gCAA+B,kBAAkB,iBAAgB,SAAS;AAAA,EAClF,CAAC,SAAQ,qCAAoC,gBAAgB,gBAAe,WAAW;AAAA,EACvF,CAAC,UAAS,0BAAyB,kBAAkB,iBAAgB,WAAW;AAAA,EAChF,CAAC,UAAS,0BAAyB,kBAAkB,iBAAgB,WAAW;AAAA,EAChF,CAAC,SAAQ,sBAAqB,kBAAiB,gBAAe,SAAS;AAAA,EACvE,CAAC,SAAQ,kBAAiB,kBAAkB,iBAAgB,WAAW;AAAA,EACvE,CAAC,SAAQ,mBAAkB,gBAAgB,gBAAe,SAAS;AAAA,EACnE,CAAC,QAAO,0BAAyB,gBAAgB,gBAAe,WAAW;AAAA,EAC3E,CAAC,SAAQ,0BAAyB,kBAAiB,gBAAe,SAAS;AAAA,EAC3E,CAAC,SAAQ,4BAA2B,gBAAgB,gBAAe,SAAS;AAAA,EAC5E,CAAC,SAAQ,kBAAiB,kBAAkB,gBAAe,SAAS;AAAA,EACpE,CAAC,UAAS,sBAAqB,gBAAgB,gBAAe,WAAW;AAAA,EACzE,CAAC,SAAQ,kBAAiB,kBAAkB,iBAAgB,QAAQ;AAAA,EACpE,CAAC,SAAQ,yBAAwB,gBAAgB,gBAAe,SAAS;AAAA,EACzE,CAAC,SAAQ,cAAa,kBAAkB,iBAAgB,SAAS;AAAA,EACjE,CAAC,SAAQ,OAAM,kBAAkB,gBAAe,SAAS;AAAA,EACzD,CAAC,QAAO,sBAAqB,gBAAgB,gBAAe,SAAS;AAAA,EACrE,CAAC,UAAS,qBAAoB,gBAAgB,iBAAgB,SAAS;AAAA,EACvE,CAAC,QAAO,uBAAsB,kBAAkB,gBAAe,SAAS;AAAA,EACxE,CAAC,SAAQ,oCAAmC,gBAAgB,gBAAe,SAAS;AAAA,EACpF,CAAC,SAAQ,YAAW,kBAAkB,gBAAe,SAAS;AAAA,EAC9D,CAAC,UAAS,2BAA0B,gBAAgB,gBAAe,WAAW;AAAA,EAC9E,CAAC,SAAQ,yBAAwB,gBAAgB,iBAAgB,SAAS;AAAA,EAC1E,CAAC,SAAQ,qBAAoB,kBAAkB,gBAAe,QAAQ;AAAA,EACtE,CAAC,SAAQ,uBAAsB,kBAAkB,gBAAe,QAAQ;AAAA,EACxE,CAAC,UAAS,cAAa,gBAAgB,gBAAe,WAAW;AAAA,EACjE,CAAC,SAAQ,UAAS,kBAAkB,gBAAe,SAAS;AAAA,EAC5D,CAAC,QAAO,sBAAqB,gBAAgB,gBAAe,WAAW;AAAA,EACvE,CAAC,UAAS,iBAAgB,kBAAkB,iBAAgB,SAAS;AAAA,EACrE,CAAC,QAAO,+BAA8B,gBAAgB,gBAAe,SAAS;AAAA,EAC9E,CAAC,SAAQ,uBAAsB,gBAAgB,gBAAe,YAAY;AAAA,EAC1E,CAAC,SAAQ,iBAAgB,kBAAkB,gBAAe,SAAS;AAAA,EACnE,CAAC,SAAQ,YAAW,kBAAkB,iBAAgB,SAAS;AAAA,EAC/D,CAAC,SAAQ,kBAAiB,kBAAkB,iBAAgB,SAAS;AACzE;;;ACnGA,IAAO,oBAAQ;AAAA,EACb,CAAC,aAAa,QAAQ,QAAO,QAAO,MAAM,SAAS;AAAA,EACnD,CAAC,kBAAkB,QAAQ,MAAK,QAAO,OAAO,UAAU;AAAA,EACxD,CAAC,kBAAkB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACvD,CAAC,eAAe,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACtD,CAAC,sBAAsB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EAC3D,CAAC,aAAa,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACpD,CAAC,gBAAgB,SAAS,OAAM,QAAO,MAAM,SAAS;AAAA,EACtD,CAAC,gBAAgB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACrD,CAAC,gBAAgB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACrD,CAAC,yBAAyB,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EAChE,CAAC,eAAe,OAAO,OAAM,QAAO,OAAO,UAAU;AAAA,EACrD,CAAC,aAAa,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACpD,CAAC,qBAAqB,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EACzD,CAAC,gBAAgB,SAAS,OAAM,MAAM,OAAO,UAAU;AAAA,EACvD,CAAC,eAAe,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACpD,CAAC,mBAAmB,QAAQ,MAAK,QAAO,MAAM,SAAS;AAAA,EACvD,CAAC,8BAA8B,OAAO,OAAM,OAAM,OAAO,UAAU;AAAA,EACnE,CAAC,yBAAyB,OAAO,OAAM,KAAO,MAAM,SAAS;AAAA,EAC7D,CAAC,cAAc,QAAQ,MAAK,OAAM,MAAM,SAAS;AAAA,EACjD,CAAC,aAAa,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EAClD,CAAC,cAAc,QAAQ,OAAM,KAAO,MAAM,SAAS;AAAA,EACnD,CAAC,+BAA+B,OAAO,OAAM,QAAO,OAAO,UAAU;AAAA,EACrE,CAAC,gBAAgB,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACvD,CAAC,yBAAyB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EAC9D,CAAC,wBAAwB,QAAQ,OAAM,GAAG,MAAM,OAAQ,UAAU;AAAA,EAClE,CAAC,kBAAkB,QAAQ,OAAM,MAAM,MAAM,SAAS;AAAA,EACtD,CAAC,0BAA0B,QAAQ,OAAM,OAAO,KAAM,SAAS;AAAA,EAC/D,CAAC,iCAAiC,OAAO,OAAM,QAAO,KAAM,SAAS;AAAA,EACrE,CAAC,8BAA8B,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EAClE,CAAC,uBAAuB,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EAC3D,CAAC,8BAA8B,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACnE,CAAC,iCAAiC,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACtE,CAAC,sBAAsB,OAAO,OAAM,QAAO,MAAM,SAAS;AAAA,EAC1D,CAAC,qBAAqB,QAAQ,OAAM,KAAO,MAAM,SAAS;AAAA,EAC1D,CAAC,yBAAyB,MAAM,OAAM,MAAM,MAAM,SAAS;AAAA,EAC3D,CAAC,0BAA0B,QAAQ,OAAM,OAAO,MAAM,SAAS;AAAA,EAC/D,CAAC,gBAAgB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACrD,CAAC,8BAA8B,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACrE,CAAC,oBAAoB,QAAQ,OAAM,GAAE,OAAO,OAAO,UAAU;AAAA,EAC7D,CAAC,uBAAuB,QAAQ,OAAM,MAAM,MAAM,SAAS;AAAA,EAC3D,CAAC,YAAY,OAAO,MAAK,OAAM,MAAM,SAAS;AAAA,EAC9C,CAAC,8BAA8B,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACnE,CAAC,YAAY,QAAQ,MAAK,QAAO,MAAM,SAAS;AAAA,EAChD,CAAC,wBAAwB,OAAO,OAAM,OAAM,OAAO,UAAU;AAAA,EAC7D,CAAC,iCAAiC,OAAO,OAAM,OAAO,OAAO,UAAU;AAAA,EACvE,CAAC,yBAAyB,QAAQ,OAAM,OAAM,OAAO,UAAU;AAAA,EAC/D,CAAC,cAAc,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACrD,CAAC,2BAA2B,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EAChE,CAAC,eAAe,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACpD,CAAC,mBAAmB,QAAQ,OAAM,KAAO,MAAO,UAAU;AAAA,EAC1D,CAAC,yBAAyB,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EAChE,CAAC,eAAe,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACpD,CAAC,2BAA2B,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EAClE,CAAC,4BAA4B,OAAM,OAAM,MAAM,SAAS;AAAA,EACxD,CAAC,gBAAgB,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EACpD,CAAC,0BAA0B,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EAC9D,CAAC,cAAc,QAAQ,MAAK,OAAM,MAAM,SAAS;AAAA,EACjD,CAAC,iCAAiC,QAAQ,MAAK,QAAO,MAAM,SAAS;AAAA,EACrE,CAAC,gBAAgB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACrD,CAAC,sBAAsB,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EACzD,CAAC,4BAA4B,QAAQ,MAAK,IAAM,OAAO,UAAU;AAAA,EACjE,CAAC,cAAc,QAAQ,OAAM,OAAM,KAAM,SAAS;AAAA,EAClD,CAAC,kCAAkC,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EACrE,CAAC,eAAe,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACpD,CAAC,eAAe,OAAO,MAAK,OAAM,MAAM,SAAS;AAAA,EACjD,CAAC,yBAAyB,MAAM,OAAM,OAAM,MAAM,SAAS;AAAA,EAC3D,CAAC,uBAAuB,OAAO,OAAM,OAAM,OAAO,UAAU;AAAA,EAC5D,CAAC,cAAc,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACrD,CAAC,mBAAmB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACxD,CAAC,eAAe,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACpD,CAAC,cAAc,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACnD,CAAC,4BAA4B,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACjE,CAAC,0BAA0B,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EAC/D,CAAC,mBAAmB,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EACtD,CAAC,6BAA6B,OAAM,OAAM,QAAO,MAAM,SAAS;AAAA,EAChE,CAAC,uCAAsC,QAAO,OAAM,OAAM,MAAK,SAAS;AAAA,EACxE,CAAC,wBAAwB,QAAQ,OAAM,QAAO,KAAM,SAAS;AAAA,EAC7D,CAAC,cAAc,QAAQ,KAAI,MAAM,KAAM,SAAS;AAAA,EAChD,CAAC,sBAAsB,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EACzD,CAAC,mBAAmB,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EACtD,CAAC,uBAAuB,MAAM,OAAM,QAAO,OAAO,UAAU;AAAA,EAC5D,CAAC,oBAAoB,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EACxD,CAAC,uBAAuB,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EAC1D,CAAC,eAAe,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EACnD,CAAC,kBAAkB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACvD,CAAC,kCAAkC,QAAQ,OAAM,OAAM,OAAO,UAAU;AAAA,EACxE,CAAC,6BAA6B,OAAO,OAAM,OAAM,OAAO,UAAU;AAAA,EAClE,CAAC,0BAA0B,QAAQ,OAAM,OAAO,MAAM,SAAS;AAAA,EAC/D,CAAC,eAAe,QAAQ,MAAK,OAAM,MAAM,SAAS;AAAA,EAClD,CAAC,aAAa,QAAQ,OAAM,OAAO,OAAO,UAAU;AAAA,EACpD,CAAC,YAAY,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EAChD,CAAC,mBAAmB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACxD,CAAC,wBAAwB,QAAQ,KAAI,QAAO,OAAO,UAAU;AAAA,EAC7D,CAAC,eAAe,MAAM,OAAM,OAAO,MAAM,SAAS;AAAA,EAClD,CAAC,gBAAgB,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACvD,CAAC,gCAAgC,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EACnE,CAAC,iCAAiC,MAAM,OAAM,OAAM,OAAO,UAAU;AAAA,EACrE,CAAC,sBAAsB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EAC3D,CAAC,0BAA0B,QAAQ,OAAM,MAAK,MAAM,SAAS;AAAA,EAC7D,CAAC,kBAAkB,MAAM,OAAM,OAAM,MAAM,SAAS;AAAA,EACpD,CAAC,mBAAmB,QAAQ,OAAM,MAAK,MAAM,SAAS;AACxD;;;ACvGA,IAAO,gBAAQ;AAAA,EACb,CAAC,aAAa,QAAQ,UAAU,OAAO,MAAM,SAAS;AAAA,EACtD,CAAC,kBAAkB,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EAC5D,CAAC,kBAAkB,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EAC5D,CAAC,eAAe,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EACzD,CAAC,qBAAqB,SAAS,UAAU,QAAQ,MAAM,SAAS;AAAA,EAChE,CAAC,aAAa,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EACvD,CAAC,qBAAqB,QAAQ,SAAS,QAAQ,MAAM,SAAS;AAAA,EAC9D,CAAC,8BAA8B,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EACxE,CAAC,+BAA+B,SAAS,SAAS,QAAQ,MAAM,SAAS;AAAA,EACzE,CAAC,oBAAoB,OAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,EAC/D,CAAC,0BAA0B,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EACnE,CAAC,kBAAkB,OAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,EAC7D,CAAC,uBAAuB,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EAChE,CAAC,yBAAyB,OAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,EACpE,CAAC,2BAA2B,KAAK,UAAU,QAAQ,MAAM,SAAS;AAAA,EAClE,CAAC,uBAAuB,MAAM,UAAU,QAAQ,OAAO,UAAU;AAAA,EACjE,CAAC,gBAAgB,QAAQ,UAAU,QAAQ,OAAO,SAAS;AAAA,EAC3D,CAAC,oBAAoB,MAAM,UAAU,QAAQ,MAAM,SAAS;AAAA,EAC5D,CAAC,gBAAgB,OAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,EAC3D,CAAC,kBAAkB,MAAM,UAAU,QAAQ,MAAM,SAAS;AAAA,EAC1D,CAAC,cAAc,OAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,EACzD,CAAC,oBAAoB,OAAO,UAAU,OAAO,MAAM,SAAS;AAAA,EAC5D,CAAC,yBAAyB,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EACnE,CAAC,eAAe,OAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,EAC1D,CAAC,eAAe,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EACxD,CAAC,aAAa,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EACvD,CAAC,gBAAgB,MAAM,SAAS,OAAO,OAAO,UAAU;AAAA,EACxD,CAAC,qBAAqB,QAAQ,UAAU,OAAO,MAAM,SAAS;AAAA,EAC9D,CAAC,sBAAsB,OAAO,SAAS,OAAO,OAAO,UAAU;AAAA,EAC/D,CAAC,kBAAkB,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EAC3D,CAAC,gCAAgC,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EACzE,CAAC,mBAAmB,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EAC5D,CAAC,wBAAwB,OAAO,UAAU,OAAO,MAAM,SAAS;AAAA,EAChE,CAAC,wBAAwB,SAAS,UAAU,OAAO,MAAM,SAAS;AAAA,EAClE,CAAC,aAAa,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EACtD,CAAC,cAAc,OAAO,UAAU,OAAO,OAAO,UAAU;AAAA,EACxD,CAAC,eAAe,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EACzD,CAAC,uBAAuB,OAAO,UAAU,OAAO,MAAM,SAAS;AAAA,EAC/D,CAAC,eAAe,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAC3D;;;ACtCA,IAAO,cAAQ;AAAA,EACX,CAAC,gBAAe,YAAW,MAAO,MAAO,WAAU,SAAQ,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EAChG,CAAC,gBAAe,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,QAAO,MAAK,SAAQ,SAAS;AAAA,EAClG,CAAC,kBAAiB,YAAW,MAAM,MAAO,WAAU,UAAS,UAAS,OAAM,MAAK,SAAQ,SAAS;AAAA,EAClG,CAAC,0BAAyB,MAAO,KAAO,WAAU,UAAS,SAAQ,OAAM,MAAK,SAAQ,GAAE,SAAS;AAAA,EACjG,CAAC,gBAAe,YAAW,MAAO,OAAO,WAAU,SAAQ,WAAU,MAAM,MAAK,SAAQ,QAAQ;AAAA,EAChG,CAAC,kBAAiB,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EACnG,CAAC,kBAAiB,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAClG,CAAC,WAAU,YAAW,MAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,KAAK,SAAQ,SAAS;AAAA,EAC5F,CAAC,iBAAgB,YAAW,OAAO,KAAO,WAAU,UAAS,WAAU,OAAM,MAAK,UAAS,QAAQ;AAAA,EACnG,CAAC,cAAa,YAAW,OAAO,KAAO,WAAU,UAAS,WAAU,aAAY,MAAK,SAAQ,SAAS;AAAA,EACtG,CAAC,mBAAkB,YAAW,IAAO,KAAO,WAAU,SAAQ,WAAU,MAAM,MAAK,SAAQ,SAAS;AAAA,EACpG,CAAC,iBAAgB,YAAW,OAAO,MAAO,WAAU,SAAQ,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAChG,CAAC,cAAa,YAAW,MAAM,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAC9F,CAAC,cAAa,YAAW,MAAM,MAAO,YAAW,UAAS,WAAU,QAAO,MAAK,SAAQ,QAAQ;AAAA,EAChG,CAAC,SAAQ,YAAW,KAAM,KAAO,WAAU,UAAS,UAAS,MAAK,MAAK,SAAQ,SAAS;AAAA,EACxF,CAAC,YAAW,YAAW,MAAM,MAAO,WAAU,UAAS,UAAS,MAAK,KAAK,SAAQ,QAAQ;AAAA,EAC1F,CAAC,kBAAiB,YAAW,OAAO,KAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EACnG,CAAC,QAAO,YAAW,OAAQ,MAAO,WAAU,WAAU,UAAS,MAAK,MAAK,UAAS,QAAQ;AAAA,EAC1F,CAAC,UAAS,YAAW,OAAO,MAAO,WAAU,SAAQ,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EACzF,CAAC,gBAAe,YAAW,MAAM,OAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EAChG,CAAC,QAAO,YAAW,OAAQ,GAAO,WAAU,SAAQ,SAAQ,OAAM,MAAK,SAAQ,SAAS;AAAA,EACxF,CAAC,kBAAiB,YAAW,IAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EACnG,CAAC,kBAAiB,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EACnG,CAAC,WAAU,YAAW,OAAQ,KAAO,WAAU,UAAS,SAAQ,OAAM,KAAK,SAAQ,GAAE,SAAS;AAAA,EAC9F,CAAC,gBAAe,YAAW,MAAM,OAAO,WAAU,SAAQ,UAAS,MAAK,MAAK,SAAQ,SAAS;AAAA,EAC9F,CAAC,aAAY,YAAW,MAAO,MAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,QAAQ;AAAA,EAC7F,CAAC,mBAAkB,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EACnG,CAAC,cAAa,YAAW,KAAM,GAAM,UAAS,UAAS,WAAU,MAAK,KAAK,SAAQ,SAAS;AAAA,EAC5F,CAAC,eAAc,YAAW,OAAO,MAAO,WAAU,SAAQ,UAAS,MAAK,KAAK,SAAQ,QAAQ;AAAA,EAC7F,CAAC,mBAAkB,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,MAAK,MAAK,SAAQ,QAAQ;AAAA,EAClG,CAAC,SAAQ,YAAW,OAAO,OAAO,WAAU,UAAS,WAAU,MAAK,MAAK,UAAS,SAAS;AAAA,EAC3F,CAAC,OAAM,YAAW,MAAM,MAAO,WAAU,WAAU,SAAQ,MAAK,MAAK,SAAQ,GAAE,SAAS;AAAA,EACxF,CAAC,gBAAe,YAAW,MAAO,MAAO,WAAU,SAAQ,WAAU,MAAK,MAAK,SAAQ,GAAE,SAAS;AAAA,EAClG,CAAC,iBAAgB,YAAW,OAAO,KAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,QAAQ;AAAA,EACjG,CAAC,eAAc,YAAW,MAAM,MAAO,WAAU,UAAS,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAC9F,CAAC,QAAO,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EAC1F,CAAC,gBAAe,YAAW,MAAM,MAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,QAAQ;AAAA,EAC/F,CAAC,gBAAe,YAAW,OAAO,MAAO,WAAU,SAAQ,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAC/F,CAAC,gBAAe,YAAW,OAAO,KAAO,WAAU,SAAQ,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAC/F,CAAC,iBAAgB,YAAW,MAAO,MAAO,WAAU,SAAQ,WAAU,MAAK,MAAK,UAAS,QAAQ;AAAA,EACjG,CAAC,eAAc,YAAW,MAAM,MAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,QAAQ;AAAA,EAC9F,CAAC,aAAY,YAAW,MAAO,KAAO,WAAU,SAAQ,UAAS,MAAK,MAAK,SAAQ,QAAQ;AAAA,EAC3F,CAAC,kBAAiB,YAAW,MAAO,GAAO,WAAU,SAAQ,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EAClG,CAAC,YAAW,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,KAAK,MAAK,SAAQ,SAAS;AAAA,EAC5F,CAAC,iBAAgB,YAAW,MAAM,MAAO,WAAU,UAAS,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAChG,CAAC,kBAAiB,YAAW,MAAO,KAAO,WAAU,SAAQ,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EACjG,CAAC,eAAc,YAAW,KAAQ,GAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EACjG,CAAC,OAAM,YAAW,OAAO,MAAO,WAAU,UAAS,SAAQ,QAAO,MAAK,SAAQ,SAAS;AAAA,EACxF,CAAC,iBAAgB,YAAW,MAAM,MAAO,WAAU,UAAS,UAAS,MAAK,MAAK,SAAQ,QAAQ;AAAA,EAC/F,CAAC,QAAO,YAAW,MAAM,MAAO,WAAU,WAAU,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EACzF,CAAC,YAAW,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,QAAO,KAAK,SAAQ,SAAS;AAAA,EAC/F,CAAC,YAAW,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EAC9F,CAAC,mBAAkB,YAAW,IAAO,MAAO,WAAU,UAAS,WAAU,aAAY,OAAM,SAAQ,SAAS;AAAA,EAC5G,CAAC,iBAAgB,YAAW,MAAO,MAAO,WAAU,SAAQ,UAAS,OAAM,MAAK,UAAS,SAAS;AAAA,EAClG,CAAC,cAAa,YAAW,OAAO,KAAO,WAAU,SAAQ,WAAU,aAAY,MAAK,SAAQ,QAAQ;AAAA,EACpG,CAAC,eAAc,YAAW,OAAO,KAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EAChG,CAAC,YAAW,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EAC9F,CAAC,iBAAgB,YAAW,IAAO,KAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EAClG,CAAC,WAAU,YAAW,OAAO,MAAO,WAAU,UAAS,SAAQ,MAAK,MAAK,SAAQ,SAAS;AAAA,EAC1F,CAAC,iBAAgB,YAAW,OAAO,KAAO,WAAU,SAAQ,WAAU,OAAM,KAAK,SAAQ,SAAS;AAAA,EAClG,CAAC,WAAU,YAAW,OAAO,KAAO,WAAU,UAAS,WAAU,MAAM,MAAK,SAAQ,QAAQ;AAAA,EAC5F,CAAC,iBAAgB,YAAW,MAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EACjG,CAAC,iBAAgB,YAAW,OAAO,KAAO,WAAU,SAAQ,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EACjG,CAAC,cAAa,YAAW,MAAO,MAAO,WAAU,UAAS,WAAU,MAAK,KAAK,SAAQ,QAAQ;AAAA,EAC9F,CAAC,cAAa,YAAW,IAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAC9F,CAAC,gBAAe,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EACjG,CAAC,aAAY,YAAW,OAAQ,KAAO,WAAU,UAAS,SAAQ,aAAY,MAAK,SAAQ,SAAS;AAAA,EACpG,CAAC,iBAAgB,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAClG,CAAC,WAAU,YAAW,MAAO,KAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EAC5F,CAAC,iBAAgB,YAAW,MAAM,MAAO,WAAU,WAAU,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EAClG,CAAC,eAAc,YAAW,MAAM,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAC/F,CAAC,aAAY,YAAW,MAAO,MAAO,WAAU,SAAQ,WAAU,QAAO,MAAK,SAAQ,SAAS;AAAA,EAC/F,CAAC,mBAAkB,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EACnG,CAAC,YAAW,YAAW,IAAO,KAAO,WAAU,SAAQ,WAAU,OAAM,OAAM,SAAQ,SAAS;AAAA,EAC9F,CAAC,SAAQ,YAAW,OAAQ,GAAO,WAAU,SAAQ,WAAU,OAAM,KAAK,SAAQ,SAAS;AAAA,EAC3F,CAAC,iBAAgB,YAAW,IAAO,KAAO,WAAU,SAAQ,WAAU,OAAM,OAAM,SAAQ,SAAS;AAAA,EACnG,CAAC,WAAU,YAAW,OAAQ,KAAO,WAAU,SAAQ,WAAU,MAAM,KAAK,SAAQ,SAAS;AAAA,EAC7F,CAAC,cAAa,YAAW,OAAQ,GAAO,WAAU,SAAQ,WAAU,QAAO,KAAK,SAAQ,SAAS;AAAA,EACjG,CAAC,WAAU,YAAW,MAAO,KAAO,WAAU,UAAS,SAAQ,OAAM,MAAK,SAAQ,GAAE,SAAS;AAAA,EAC7F,CAAC,UAAS,YAAW,OAAQ,KAAO,WAAU,SAAQ,WAAU,MAAM,MAAK,SAAQ,SAAS;AAChG;;;AC9EA,IAAM,wBAAwB,CAAC;AAC/B,WAAW,OAAO,iBAAM;AAEtB,QAAM,CAAC,KAAK,MAAM,WAAW,QAAQ,MAAM,IAAI;AAC/C,QAAM,WAAW;AACjB,QAAM,OAAO;AACb,QAAM,YAAY;AAElB,wBAAsB,KAAK,CAAE,UAAU,QAAQ,MAAM,WAAW,KAAK,GAAG,OAAO,YAAY,MAAM,QAAQ,SAAU,CAAC;AACtH;AAEA,WAAW,OAAO,aAAK;AAErB,QAAM,CAAC,MAAM,KAAK,WAAW,QAAQ,EAAE,MAAM,IAAI;AACjD,QAAM,WAAW;AACjB,QAAM,OAAO;AACb,QAAM,YAAY;AAElB,wBAAsB,KAAK,CAAC,UAAS,QAAO,MAAM,WAAU,KAAI,GAAG,OAAO,YAAW,MAAK,QAAO,SAAU,CAAC;AAC9G;AAEA,WAAW,OAAO,mBAAQ;AAExB,QAAM,CAAC,MAAM,KAAK,WAAW,WAAW,MAAM,IAAI;AAClD,QAAM,WAAW;AACjB,QAAM,OAAO;AACb,QAAM,SAAS;AAEf,wBAAsB,KAAK,CAAE,UAAU,QAAQ,MAAM,WAAW,KAAK,GAAG,OAAO,YAAY,MAAM,QAAQ,SAAU,CAAC;AACtH;AAEA,WAAW,OAAO,eAAO;AAEvB,QAAM,CAAC,MAAM,KAAK,WAAU,EAAC,MAAM,IAAI;AACvC,QAAM,WAAW;AACjB,QAAM,OAAO;AACb,QAAM,SAAS;AACf,QAAM,YAAY;AAElB,wBAAsB,KAAK,CAAE,UAAU,QAAQ,MAAM,WAAW,KAAK,GAAG,OAAO,YAAY,MAAM,QAAQ,SAAU,CAAC;AACtH;AAEA,IAAO,uBAAQ;;;AClBf,IAAM,EAAE,KAAK,SAAS,KAAK,SAAS,KAAK,IAAI,mBAAmBC,SAAQ,MAAM;AAC9E,IAAM,wBAAwB,IAAI,oBAAoB;AAAA,EACpD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,SAA0B,CAAC;AAGjC,WAAW,CAAC,EAAC,EAAC,EAAC,WAAU,GAAG,KAAK,sBAAuB;AACtD,QAAM,YAAY,WAAW,OAAO,SAAS,CAAC;AAC9C,MAAI,CAAC,MAAM,SAAS,GAAE;AACtB,UAAM,CAACC,MAAKC,IAAG,IAAI,WAAW,GAAE,gBAAgB;AAChD,UAAMC,WAAU,OAAO,KAAM,GAAI;AACjC,UAAMC,WAAU,OAAO,KAAM,GAAI;AACjC,UAAM,QAAQ,YAAY,OAAO,GAAG,CAAC,IAAI;AACzC,UAAMC,QAAO,YAAY,OAAO,GAAG,CAAC,IAAI;AACxC,UAAM,OAAO,YAAY,OAAO,GAAG,CAAC,IAAI;AACxC,UAAM,QAAQ;AACd,UAAM,WAAW;AACjB,WAAO,KAAK;AAAA,MACVH;AAAA,MACAC;AAAA,MACAF;AAAA,MACAG;AAAA,MACA;AAAA,MACAC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EAED;AACF;AAEA,IAAM,cAAc,IAAI;AAAA,EACtBL,SAAQ;AAAA,EACR;AAAA,EACA,mBAAmBA,SAAQ,MAAM;AAAA,EACjC;AACF;AAEA,IAAO,iBAAQ;;;AC9Df,IAAMM,sBAAqB,CAAC,cAC1B,OAAO,OAAO,QAAQ,SAAS,EAAE,OAAO,EAAE;AAAA,EACxC,CAAC,KAAK,KAAK,UAAU;AACnB,QAAI,IAAI,IAAI,IAAI;AAChB,WAAO;AAAA,EACT;AAAA,EACA,CAAC;AACH;AAEF,IAAM,YAAiD;AAAA,EACrD,UAAUA,oBAAmB,UAAU;AAAA,EACvC,QAAQA,oBAAmB,QAAQ;AAAA,EACnC,eAAeA,oBAAmB,eAAe;AAAA,EACjD,0BAA0BA,oBAAmB,0BAA0B;AAAA,EACvE,mBAAmBA,oBAAmB,mBAAmB;AAAA,EACzD,8BAA8BA;AAAA,IAC5B;AAAA,EACF;AAAA,EACA,mBAAmBA,oBAAmB,mBAAmB;AAC3D;AAMA,IAAM,oBAAoB,IAAI;AAAA,EAC5B,QAAQ;AAAA,EACR;AAAA,EACA,UAAU;AACZ;AAKA,IAAM,gBAAgB,IAAI;AAAA,EACxB,QAAQ;AAAA,EACR,CAAC;AAAA,EACD,UAAU;AACZ;AAEA,IAAI,kBAAkB;AAItB,IAAM,2BAA2B,IAAI;AAAA,EACnC,QAAQ;AAAA,EACR,CAAC;AAAA,EACD,UAAU;AACZ;AAGO,IAAM,yBAAyB,CACpC,UACA,YACA,OAAO,OACP,SAAS,iBACN;AAAA,EACH;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAAS;AAAA,EACT;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,SAAS,oBAAoB,UAAkB,YAAoB;AACjE,QAAM,mBAAmB,uBAAuB,UAAU,UAAU;AAEpE,gBAAc,OAAO,gBAAgB;AAErC,QAAM,EAAE,UAAU,IAAI,IAAIA,oBAAmB,mBAAmB;AAChE,QAAM,eAAe,kBAAkB,KAAK;AAAA,IAC1C,CAAC,MAAM,EAAE,GAAG,MAAM;AAAA,EACpB;AAEA,eAAa,QAAQ,CAAC,CAAC,EAAE,EAAE,aAAa,EAAE,KAAK,EAAE,EAAE,UAAU,SAAS,MAAM;AAC1E,UAAM,OAAO;AACb,UAAM,aAAa;AACnB,UAAM,aAAa;AACnB,UAAM,gBAAgB;AACtB,UAAM,cAAc;AACpB,UAAM,YAAY;AAClB,UAAM,cAAc;AACpB,UAAM,kBAAkB;AACxB,UAAM,OAAO;AACb,UAAM,QAAQ;AAEd,UAAM,EAAE,WAAW,IAAI,UAAU;AACjC,UAAM,mBAAmB,iBAAiB,UAAU;AACpD,UAAM,8BAAoD;AAAA,MACxD;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAG,oBAAoB;AAAA,MACvB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,6BAAyB,OAAO,2BAA2B;AAAA,EAC7D,CAAC;AACH;AAEA,eAAe,eAAe,YAA2C;AACvE,UAAQ,IAAI,qBAAqB,WAAW,SAAS;AACvD;AACA,eAAe,aAAa,YAA2C;AACrE,QAAM,CAAC,gBAAgB,IAAI,WAAW;AACtC,UAAQ,IAAI,qBAAqB,WAAW,WAAW,kBAAkB;AAC3E;AACA,eAAe,cAAc,YAA2C;AACtE,UAAQ,IAAI,qBAAqB,WAAW,SAAS;AACvD;AAEA,eAAe,gBAAgB,YAA2C;AACxE,QAAM;AAAA,IACJ,QAAQ,CAAC,UAAU,UAAU;AAAA,EAC/B,IAAI;AACJ,sBAAoB,UAAU,UAAU;AAC1C;AAIO,IAAM,SAA0C;AAAA,EACrD,UAAU,IAAI;AAAA,IACZ,QAAQ;AAAA,IACR;AAAA,MACE,CAAC,UAAU,CAAC;AAAA,MACZ,CAAC,kBAAkB,CAAC;AAAA,MACpB,CAAC,QAAQ,CAAC;AAAA,MACV,CAAC,OAAO,CAAC;AAAA,MACT,CAAC,iBAAiB,CAAC;AAAA,IACrB;AAAA,IACA,UAAU;AAAA,EACZ;AAAA,EACA,QAAQ,IAAI;AAAA,IACV,QAAQ;AAAA,IACR;AAAA,MACE,CAAC,cAAc,cAAc,GAAG,CAAC;AAAA,MACjC,CAAC,QAAQ,QAAQ,GAAG,CAAC;AAAA,MACrB,CAAC,YAAY,YAAY,GAAG,CAAC;AAAA,MAC7B,CAAC,UAAU,UAAU,GAAG,CAAC;AAAA,IAC3B;AAAA,IACA,UAAU;AAAA,EACZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,8BAA8B;AAAA,IAC5B,EAAE,QAAQ,UAAU,OAAO,+BAA+B;AAAA,IAC1D;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAAA,EACA,mBAAmB,IAAI;AAAA,IACrB,QAAQ;AAAA,IACR;AAAA,MACE,CAAC,qBAAqB,CAAC;AAAA,MACvB,CAAC,aAAa,CAAC;AAAA,MACf,CAAC,SAAS,CAAC;AAAA,MACX,CAAC,QAAQ,CAAC;AAAA,IACZ;AAAA,IACA,UAAU;AAAA,EACZ;AACF;AAEA,IAAM,QAAuD;AAAA,EAC3D,UAAU;AAAA,EACV,QAAQ;AAAA,IACN,MAAM;AAAA,IACN,OAAO;AAAA,MACL;AAAA,QACE,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,MAAM;AAAA,QACN,SAAS;AAAA,MACX;AAAA,IACF;AAAA,EACF;AAAA,EACA,mBAAmB;AAAA,EACnB,eAAe;AAAA,EACf,0BAA0B;AAAA,EAC1B,8BAA8B;AAAA,EAC9B,mBAAmB;AACrB;AAOA,IAAM,WAA+D;AAAA,EACnE,UAAU;AAAA,EACV,QAAQ;AAAA,IACN;AAAA,MACE,SAAS;AAAA,MACT,SAAS;AAAA,IACX;AAAA,EACF;AAAA,EACA,mBAAmB;AAAA,EACnB,eAAe;AAAA,IACb;AAAA,MACE,SAAS;AAAA,MACT,SAAS;AAAA,IACX;AAAA,IACA;AAAA,MACE,SAAS;AAAA,MACT,SAAS;AAAA,IACX;AAAA,EACF;AAAA,EACA,0BAA0B;AAAA,EAC1B,8BAA8B;AAAA,IAC5B;AAAA,MACE,SAAS;AAAA,MACT,SAAS;AAAA,IACX;AAAA,EACF;AAAA,EACA,mBAAmB;AACrB;AAEA,IAAM,uBAAuB,CAAC,cAAgC;AAC5D,QAAM,SAAS,QAAQ,SAAS;AAChC,SAAO,OAAO;AAChB;AAEA,IAAM,mBAAmB,CAAC,cAAgC;AACxD,QAAM,oBAAoB,qBAAqB,SAAS;AACxD,QAAM,EAAE,IAAI,IAAI,QAAQ,SAAS;AACjC,SAAO,IAAI,uBAAuB;AAAA,IAChC;AAAA,IACA,SAAS,UAAU,SAAS;AAAA,IAC5B,WAAW;AAAA,IACX,MAAM,MAAM,SAAS;AAAA,IACrB,aAAa,SAAS,SAAS;AAAA,IAC/B,OAAO,OAAO,SAAS;AAAA;AAAA,EAEzB,CAAC;AACH;AAEA,IAAM,oBAAoB,YAAY,CAAC;AAEvC,IAAM,eAA4C;AAAA,EAChD;AAAA,EACA,eAAe,MAAM;AACvB;AAEA,IAAO,wBAAQ;;;ACjRf,4BAA8B;;;ACAvB,IAAM,aAAa,CAAC,OAAO,OAAO,OAAO,OAAO,KAAK;;;ACArD,IAAM,YAAyC;AAAA,EACpD,GAAG,CAAC,cAAc,eAAe;AAAA,EACjC,GAAG,CAAC,eAAe,cAAc;AAAA,EACjC,IAAI,CAAC,QAAQ,eAAe;AAAA,EAC5B,IAAI,CAAC,OAAO,eAAe;AAAA,EAC3B,IAAI,CAAC,SAAS,YAAY;AAAA,EAC1B,IAAI,CAAC,SAAS,YAAY;AAAA,EAC1B,IAAI,CAAC,aAAa,WAAW;AAAA,EAC7B,IAAI,CAAC,UAAU,WAAW;AAC5B;AACO,IAAM,WAAW,CAAC,KAAK,KAAK,MAAM,MAAM,MAAM,MAAM,MAAM,IAAI;;;ACV9D,IAAM,WAAW;AAAA,EACtB;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACtE;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AACpB;;;AHwBO,IAAM,sBAAsB;AAAA,EACjC,KAAK;AAAA,EACL,UAAU;AAAA,EACV,aAAa;AAAA,EACb,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,KAAK;AAAA,EACL,OAAO;AACT;AAEA,IAAM,kBAAwC,CAAC;AAE/C,IAAM,QAAQ,MAAM,KAAK,sBAAsB;AAE/C,IAAM,cAAc,MAAM;AACxB,QAAM,QAAQ,OAAO,GAAG,GAAK;AAC7B,QAAM,aAAa,OAAO,GAAG,EAAE;AAC/B,SAAO,QAAQ;AACjB;AAEA,IAAM,QAAQ,YAAY,IAAI;AAE9B,WAAW,QAAQ,OAAO;AACxB,WAAS,IAAI,GAAG,IAAI,KAAQ,KAAK;AAC/B,UAAM,QAAQ,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,CAAC;AAC/C,UAAM,QAAQ,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,CAAC;AAC/C,UAAM,QAAQ,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,CAAC;AAE/C,UAAM,SAAS,SAAS,OAAO,GAAG,SAAS,SAAS,CAAC,CAAC;AACtD,UAAM,MAAM,OAAO,QAAQ,QAAQ,QAAQ,MAAM;AACjD,UAAM,MAAM,OAAO,QAAQ,QAAQ,QAAQ,MAAM;AACjD,UAAM,cAAc,GAAG;AACvB,UAAM,WAAW,WAAW,OAAO,GAAG,CAAC,CAAC;AACxC,UAAM,WAAO,qCAAc;AAC3B,UAAM,UAAU,SAAS,OAAO,GAAG,SAAS,SAAS,CAAC,CAAC;AAEvD,UAAM,WAAW,UAAU,MAAM,EAAE,CAAC;AACpC,UAAM,QAAQ,YAAY;AAE1B,oBAAgB,KAAK;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAO,IAAI;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AACF;AACA,IAAM,MAAM,YAAY,IAAI;AAC5B,QAAQ,IAAI,sCAAsC,MAAM,UAAU;AAElE,IAAM,mBAAmB,IAAI;AAAA,EAC3BC,SAAQ;AAAA,EACR;AAAA,EACA,mBAAmBA,SAAQ,WAAW;AACxC;AAGA,IAAO,sBAAQ;;;AInFf,IAAM,0BAA0B,gBAAgB;AAAA,EAAI,CAAC,QAClD,IACE,MAAM,GAAG,EAAE,EACX,OAAO,CAAC,OAAO,GAAG,CAAC,MAAM,GAAG,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;AACpD;AAEA,IAAM,2BAA2B,IAAI;AAAA,EACnCC,SAAQ;AAAA,EACR;AAAA,EACA,mBAAmBA,SAAQ,mBAAmB;AAChD;AAEA,IAAO,+BAAQ;;;ACaf,IAAM,EAAE,KAAAC,MAAK,SAAAC,UAAS,KAAAC,MAAK,SAAAC,SAAQ,IAAI,mBAAmBC,SAAQ,MAAM;AACxE,IAAMC,yBAAwB,IAAI,oBAAoB;AAAA,EACpD,KAAAL;AAAA,EACA,SAAAC;AAAA,EACA,KAAAC;AAAA,EACA,SAAAC;AACF,CAAC;AAID,IAAM,2BAA2B,CAAC,OAAO,OAAO;AAChD,IAAM,aAAmC,gBAAgB,IAAI,CAAC,eAAe;AAC3E,QAAM,EAAE,KAAK,OAAO,UAAU,IAAI,yBAAyB;AAAA,IACzD,CAAC,KAAK,OAAO,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,WAAW,oBAAoB,CAAC,CAAC,EAAE;AAAA,IAC/D,CAAC;AAAA,EACH;AACA,QAAM,SAAS,OAAO,GAAG,EAAE;AAE3B,QAAMD,OAAM,YAAY,SAAS;AACjC,QAAMC,WAAU,OAAO,KAAM,GAAI;AACjC,QAAMH,OAAM,YAAY,SAAS;AACjC,QAAMC,WAAU,OAAO,KAAM,GAAI;AACjC,QAAM,QAAQ,YAAY,OAAO,GAAG,CAAC,IAAI;AACzC,QAAMK,QAAO,YAAY,OAAO,GAAG,CAAC,IAAI;AACxC,QAAM,OAAO,YAAY,OAAO,GAAG,CAAC,IAAI;AACxC,QAAM,QAAQ;AACd,QAAM,WAAW;AACjB,SAAO,CAACJ,MAAKC,UAASH,MAAKC,UAAS,OAAOK,OAAM,MAAM,OAAO,KAAK,QAAQ;AAC7E,CAAC;AAGD,WAAW,CAAC,EAAC,EAAC,EAAC,WAAU,GAAG,KAAK,sBAAuB;AACtD,QAAM,YAAY,WAAW,OAAO,SAAS,CAAC;AAC9C,MAAI,CAAC,MAAM,SAAS,GAAG;AACrB,UAAM,SAAS,OAAO,GAAG,EAAE;AAC3B,UAAMJ,OAAM,YAAY,SAAS;AACjC,UAAMC,WAAU,OAAO,KAAM,GAAI;AACjC,UAAMH,OAAM,YAAY,SAAS;AACjC,UAAMC,WAAU,OAAO,KAAM,GAAI;AACjC,UAAM,QAAQ,YAAY,OAAO,GAAG,CAAC,IAAI;AACzC,UAAMK,QAAO,YAAY,OAAO,GAAG,CAAC,IAAI;AACxC,UAAM,OAAO,YAAY,OAAO,GAAG,CAAC,IAAI;AACxC,UAAM,QAAQ;AACd,UAAM,WAAW;AACjB,eAAW,KAAK;AAAA,MACdJ;AAAA,MACAC;AAAA,MACAH;AAAA,MACAC;AAAA,MACA;AAAA,MACAK;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AACF;AAKA,IAAMC,eAAc,IAAI;AAAA,EACtBH,SAAQ;AAAA,EACR;AAAA,EACA,mBAAmBA,SAAQ,MAAM;AAAA,EACjCC;AACF;AAGA,IAAOG,kBAAQC;;;AC1Ff,IAAMC,UAAwC;AAAA,EAC5C,aAAa,IAAI;AAAA,IACfC,SAAQ;AAAA,IACR,CAAC;AAAA,IACD,mBAAmBA,SAAQ,WAAW;AAAA,EACxC;AAAA,EACA,aAAa;AAAA,EACb,qBAAqB;AAAA,EACrB,kBAAkB;AAAA,IAChB,EAAE,QAAQ,SAAS,OAAO,mBAAmB;AAAA,IAC7C;AAAA,IACAC;AAAA,IACA;AAAA,EACF;AAAA,EACA,QAAQ,IAAI,MAAMD,SAAQ,QAAQ,CAAC,GAAG,mBAAmBA,SAAQ,MAAM,CAAC;AAAA,EACxE,cAAc,IAAI;AAAA,IAChBA,SAAQ;AAAA,IACR,CAAC;AAAA,IACD,mBAAmBA,SAAQ,YAAY;AAAA,EACzC;AAAA,EACA,QAAQC;AACV;AAEA,IAAMC,wBAAuB,CAAC,cAA8B;AAC1D,QAAM,SAASF,SAAQ,SAAS;AAChC,MAAI,QAAQ;AACV,WAAO,OAAO;AAAA,EAChB,OAAO;AACL,UAAM,MAAM,gDAAgD,WAAW;AAAA,EACzE;AACF;AAEA,IAAMG,oBAAmB,CAAC,cAA8B;AACtD,QAAM,oBAAoBD,sBAAqB,SAAS;AACxD,SAAO,IAAI,uBAAuB;AAAA,IAChC;AAAA,IACA,WAAWF,SAAQ,SAAS,EAAE;AAAA,IAC9B,OAAOD,QAAO,SAAS;AAAA;AAAA;AAAA,EAGzB,CAAC;AACH;AAEA,IAAM,oBAAuC,CAAC;AAAA,EAC5C;AAAA,EACA;AAAA,EACA;AACF,MAAuB;AACrB,QAAM,QAAQA,QAAO,SAAS,KAAuB;AACrD,MAAI,OAAO;AACT,WAAO,gBAAgB,OAAO,QAAQ,OAAO;AAAA,EAC/C,OAAO;AACL,UAAM;AAAA,MACJ,0CAA0C,SAAS,UAAU,SAAS;AAAA,IACxE;AAAA,EACF;AACF;AAEA,IAAM,cAAyC;AAAA,EAC7C,kBAAAI;AAAA,EACA,eAAe,MAAM;AACvB;AAEA,IAAO,uBAAQ;;;AC5Df,IAAM,aAGF;AAAA,EACF,QAAQ;AAAA,EACR,OAAO;AACT;AAEO,IAAM,YAAY,CACvB,eACG,WAAW,UAAU;",
-  "names": ["module", "cusip", "isinGenerator", "schemas", "schemas", "schemas", "start", "debugEnabled", "info", "debug", "uuid", "random", "worker", "IterMode", "length", "last", "start", "children", "positions", "end", "node", "buffer", "data", "lookAhead", "pair", "nodeSize", "from", "to", "start", "parser", "end", "i", "last", "Recover", "start", "Safety", "last", "end", "parser", "Rec", "last", "end", "i", "info", "leafData", "aggColumn", "DEPTH", "KEY", "SELECTED", "KEY", "debug", "row", "_a", "DEPTH", "IDX", "IS_EXPANDED", "IS_LEAF", "KEY", "SELECTED", "toClientRow", "_config", "_data", "_filter", "_range", "_selectedRowsCount", "_size", "_status", "_title", "_a", "KEY", "_config", "_groupBy", "_links", "_range", "_selectedRowsCount", "_size", "_status", "_title", "_a", "_data", "row", "nextRandomDouble", "ask", "bid", "bid", "ask", "last", "schemas", "bid", "ask", "askSize", "bidSize", "last", "buildDataColumnMap", "schemas", "schemas", "bid", "bidSize", "ask", "askSize", "schemas", "pricesUpdateGenerator", "last", "pricesTable", "prices_default", "pricesTable", "tables", "schemas", "prices_default", "getColumnDescriptors", "createDataSource"]
+  "sources": ["../../../node_modules/@thomaschaplin/isin-generator/country-codes.json", "../../../node_modules/@thomaschaplin/cusip-generator/src/convert-string-to-base-ten-number.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/is-odd.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-cusip-check-code.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/fixtures/alphabet.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/fixtures/base-ten-numbers.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/fixtures/alphanumeric-values.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-random-alphanumeric.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-random-string-of-alphanumeric-chars.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-random-base-ten-number.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-random-string-of-base-ten-chars.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-cusip-without-check-code.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/generate-cusip.ts", "../../../node_modules/@thomaschaplin/cusip-generator/src/index.ts", "../../../node_modules/@thomaschaplin/isin-generator/index.js", "../../../packages/vuu-data-test/src/index.ts", "../../../packages/vuu-data-test/src/basket/basket-schemas.ts", "../../../packages/vuu-data-test/src/simul/simul-schemas.ts", "../../../packages/vuu-data-test/src/schemas.ts", "../../../node_modules/@lezer/common/dist/index.js", "../../../node_modules/@lezer/lr/dist/index.js", "../../../packages/vuu-filter-parser/src/generated/filter-parser.js", "../../../packages/vuu-utils/src/array-utils.ts", "../../../packages/vuu-utils/src/filter-utils.ts", "../../../packages/vuu-utils/src/column-utils.ts", "../../../packages/vuu-utils/src/cookie-utils.ts", "../../../packages/vuu-utils/src/range-utils.ts", "../../../packages/vuu-utils/src/datasource-utils.ts", "../../../packages/vuu-utils/src/logging-utils.ts", "../../../packages/vuu-utils/src/event-emitter.ts", "../../../packages/vuu-utils/src/keyset.ts", "../../../packages/vuu-utils/src/nanoid/index.ts", "../../../packages/vuu-utils/src/selection-utils.ts", "../../../packages/vuu-filter-parser/src/FilterTreeWalker.ts", "../../../packages/vuu-filter-parser/src/FilterParser.ts", "../../../packages/vuu-filter-parser/src/filter-evaluation-utils.ts", "../../../packages/vuu-data-local/src/array-data-source/aggregate-utils.ts", "../../../packages/vuu-data-local/src/array-data-source/array-data-utils.ts", "../../../packages/vuu-data-local/src/array-data-source/group-utils.ts", "../../../packages/vuu-data-local/src/array-data-source/sort-utils.ts", "../../../packages/vuu-data-local/src/array-data-source/array-data-source.ts", "../../../packages/vuu-data-local/src/json-data-source/json-data-source.ts", "../../../packages/vuu-data-test/src/makeSuggestions.ts", "../../../packages/vuu-data-test/src/TickingArrayDataSource.ts", "../../../packages/vuu-data-test/src/vuu-row-generator.ts", "../../../packages/vuu-data-test/src/Table.ts", "../../../packages/vuu-data-test/src/data-utils.ts", "../../../packages/vuu-data-test/src/UpdateGenerator.ts", "../../../packages/vuu-data-test/src/basket/reference-data/ftse100.ts", "../../../packages/vuu-data-test/src/basket/reference-data/nasdaq100.ts", "../../../packages/vuu-data-test/src/basket/reference-data/sp500.ts", "../../../packages/vuu-data-test/src/basket/reference-data/hsi.ts", "../../../packages/vuu-data-test/src/basket/reference-data/constituents.ts", "../../../packages/vuu-data-test/src/basket/reference-data/prices.ts", "../../../packages/vuu-data-test/src/basket/basket-module.ts", "../../../packages/vuu-data-test/src/simul/reference-data/instruments.ts", "../../../packages/vuu-data-test/src/simul/reference-data/currencies.ts", "../../../packages/vuu-data-test/src/simul/reference-data/locations.ts", "../../../packages/vuu-data-test/src/simul/reference-data/lotsizes.ts", "../../../packages/vuu-data-test/src/simul/reference-data/instruments-extended.ts", "../../../packages/vuu-data-test/src/simul/reference-data/prices.ts", "../../../packages/vuu-data-test/src/simul/simul-module.ts", "../../../packages/vuu-data-test/src/vuu-modules.ts"],
+  "sourcesContent": ["[\r\n    \"AD\",\r\n    \"AE\",\r\n    \"AF\",\r\n    \"AG\",\r\n    \"AI\",\r\n    \"AL\",\r\n    \"AM\",\r\n    \"AO\",\r\n    \"AQ\",\r\n    \"AR\",\r\n    \"AS\",\r\n    \"AT\",\r\n    \"AU\",\r\n    \"AW\",\r\n    \"AX\",\r\n    \"AZ\",\r\n    \"BA\",\r\n    \"BB\",\r\n    \"BD\",\r\n    \"BE\",\r\n    \"BF\",\r\n    \"BG\",\r\n    \"BH\",\r\n    \"BI\",\r\n    \"BJ\",\r\n    \"BL\",\r\n    \"BM\",\r\n    \"BN\",\r\n    \"BO\",\r\n    \"BQ\",\r\n    \"BR\",\r\n    \"BS\",\r\n    \"BT\",\r\n    \"BV\",\r\n    \"BW\",\r\n    \"BY\",\r\n    \"BZ\",\r\n    \"CA\",\r\n    \"CC\",\r\n    \"CD\",\r\n    \"CF\",\r\n    \"CG\",\r\n    \"CH\",\r\n    \"CI\",\r\n    \"CK\",\r\n    \"CL\",\r\n    \"CM\",\r\n    \"CN\",\r\n    \"CO\",\r\n    \"CR\",\r\n    \"CU\",\r\n    \"CV\",\r\n    \"CW\",\r\n    \"CX\",\r\n    \"CY\",\r\n    \"CZ\",\r\n    \"DE\",\r\n    \"DJ\",\r\n    \"DK\",\r\n    \"DM\",\r\n    \"DO\",\r\n    \"DZ\",\r\n    \"EC\",\r\n    \"EE\",\r\n    \"EG\",\r\n    \"EH\",\r\n    \"ER\",\r\n    \"ES\",\r\n    \"ET\",\r\n    \"FI\",\r\n    \"FJ\",\r\n    \"FK\",\r\n    \"FM\",\r\n    \"FO\",\r\n    \"FR\",\r\n    \"GA\",\r\n    \"GB\",\r\n    \"GD\",\r\n    \"GE\",\r\n    \"GF\",\r\n    \"GG\",\r\n    \"GH\",\r\n    \"GI\",\r\n    \"GL\",\r\n    \"GM\",\r\n    \"GN\",\r\n    \"GP\",\r\n    \"GQ\",\r\n    \"GR\",\r\n    \"GS\",\r\n    \"GT\",\r\n    \"GU\",\r\n    \"GW\",\r\n    \"GY\",\r\n    \"HK\",\r\n    \"HM\",\r\n    \"HN\",\r\n    \"HR\",\r\n    \"HT\",\r\n    \"HU\",\r\n    \"ID\",\r\n    \"IE\",\r\n    \"IL\",\r\n    \"IM\",\r\n    \"IN\",\r\n    \"IO\",\r\n    \"IQ\",\r\n    \"IR\",\r\n    \"IS\",\r\n    \"IT\",\r\n    \"JE\",\r\n    \"JM\",\r\n    \"JO\",\r\n    \"JP\",\r\n    \"KE\",\r\n    \"KG\",\r\n    \"KH\",\r\n    \"KI\",\r\n    \"KM\",\r\n    \"KN\",\r\n    \"KP\",\r\n    \"KR\",\r\n    \"KW\",\r\n    \"KY\",\r\n    \"KZ\",\r\n    \"LA\",\r\n    \"LB\",\r\n    \"LC\",\r\n    \"LI\",\r\n    \"LK\",\r\n    \"LR\",\r\n    \"LS\",\r\n    \"LT\",\r\n    \"LU\",\r\n    \"LV\",\r\n    \"LY\",\r\n    \"MA\",\r\n    \"MC\",\r\n    \"MD\",\r\n    \"ME\",\r\n    \"MF\",\r\n    \"MG\",\r\n    \"MH\",\r\n    \"MK\",\r\n    \"ML\",\r\n    \"MM\",\r\n    \"MN\",\r\n    \"MO\",\r\n    \"MP\",\r\n    \"MQ\",\r\n    \"MR\",\r\n    \"MS\",\r\n    \"MT\",\r\n    \"MU\",\r\n    \"MV\",\r\n    \"MW\",\r\n    \"MX\",\r\n    \"MY\",\r\n    \"MZ\",\r\n    \"NA\",\r\n    \"NC\",\r\n    \"NE\",\r\n    \"NF\",\r\n    \"NG\",\r\n    \"NI\",\r\n    \"NL\",\r\n    \"NO\",\r\n    \"NP\",\r\n    \"NR\",\r\n    \"NU\",\r\n    \"NZ\",\r\n    \"OM\",\r\n    \"PA\",\r\n    \"PE\",\r\n    \"PF\",\r\n    \"PG\",\r\n    \"PH\",\r\n    \"PK\",\r\n    \"PL\",\r\n    \"PM\",\r\n    \"PN\",\r\n    \"PR\",\r\n    \"PS\",\r\n    \"PT\",\r\n    \"PW\",\r\n    \"PY\",\r\n    \"QA\",\r\n    \"RE\",\r\n    \"RO\",\r\n    \"RS\",\r\n    \"RU\",\r\n    \"RW\",\r\n    \"SA\",\r\n    \"SB\",\r\n    \"SC\",\r\n    \"SD\",\r\n    \"SE\",\r\n    \"SG\",\r\n    \"SH\",\r\n    \"SI\",\r\n    \"SJ\",\r\n    \"SK\",\r\n    \"SL\",\r\n    \"SM\",\r\n    \"SN\",\r\n    \"SO\",\r\n    \"SR\",\r\n    \"SS\",\r\n    \"ST\",\r\n    \"SV\",\r\n    \"SX\",\r\n    \"SY\",\r\n    \"SZ\",\r\n    \"TC\",\r\n    \"TD\",\r\n    \"TF\",\r\n    \"TG\",\r\n    \"TH\",\r\n    \"TJ\",\r\n    \"TK\",\r\n    \"TL\",\r\n    \"TM\",\r\n    \"TN\",\r\n    \"TO\",\r\n    \"TR\",\r\n    \"TT\",\r\n    \"TV\",\r\n    \"TW\",\r\n    \"TZ\",\r\n    \"UA\",\r\n    \"UG\",\r\n    \"UM\",\r\n    \"US\",\r\n    \"UY\",\r\n    \"UZ\",\r\n    \"VA\",\r\n    \"VC\",\r\n    \"VE\",\r\n    \"VG\",\r\n    \"VI\",\r\n    \"VN\",\r\n    \"VU\",\r\n    \"WF\",\r\n    \"WS\",\r\n    \"YE\",\r\n    \"YT\",\r\n    \"ZA\",\r\n    \"ZM\",\r\n    \"ZW\"\r\n]", null, null, null, null, null, null, null, null, null, null, null, null, null, "'use-strict'\r\n\r\nconst countryCodes = require('./country-codes.json')\r\nconst cusip = require('@thomaschaplin/cusip-generator').generateCusip()\r\n\r\n\r\nconst generateIsin = cusip => {\r\n    let code = countryCodes[Math.floor(Math.random() * countryCodes.length)]\r\n    let isin = code + cusip + generateIsinCheckDigit(code + cusip + '0')\r\n    return isin\r\n}\r\n\r\nconst generateIsinCheckDigit = isin => {\r\n    if (isin.length != 12) return false;\r\n    var v = [];\r\n    for (var i = isin.length - 2; i >= 0; i--) {\r\n        let c = isin.charAt(i);\r\n        if (isNaN(c)) {\r\n            var letterCode = isin.charCodeAt(i) - 55;\r\n            v.push(letterCode % 10);\r\n            if (letterCode > 9) {\r\n                v.push(Math.floor(letterCode / 10));\r\n            }\r\n        } else {\r\n            v.push(Number(c));\r\n        }\r\n    }\r\n    var sum = 0;\r\n    var l = v.length;\r\n    for (var i = 0; i < l; i++) {\r\n        if (i % 2 == 0) {\r\n            var d = v[i] * 2;\r\n            sum += Math.floor(d / 10)\r\n            sum += d % 10;\r\n        } else {\r\n            sum += v[i];\r\n        }\r\n    }\r\n    return (10 - (sum % 10)) % 10\r\n}\r\n\r\n\r\nexports.isinGenerator = function isinGenerator() {\r\n    return generateIsin(cusip)\r\n}", "export * from \"./schemas\";\nexport * from \"./TickingArrayDataSource\";\nexport * from \"./vuu-row-generator\";\nexport * from \"./vuu-modules\";\nexport { type BasketsTableName } from \"./basket/basket-schemas\";\nexport { createBasketTradingRow } from \"./basket/basket-module\";\nexport { type SimulTableName } from \"./simul/simul-schemas\";\n", "import { TableSchema } from \"@vuu-ui/vuu-data-types\";\n\nexport type BasketsTableName =\n  | \"algoType\"\n  | \"basket\"\n  | \"basketConstituent\"\n  | \"basketTrading\"\n  | \"basketTradingConstituent\"\n  | \"basketTradingConstituentJoin\"\n  | \"priceStrategyType\";\n\nexport const schemas: Readonly<\n  Record<BasketsTableName, Readonly<TableSchema>>\n> = {\n  algoType: {\n    columns: [\n      { name: \"algoType\", serverDataType: \"string\" },\n      { name: \"id\", serverDataType: \"int\" },\n    ],\n    key: \"id\",\n    table: { module: \"BASKET\", table: \"algoType\" },\n  },\n  basket: {\n    columns: [\n      { name: \"id\", serverDataType: \"string\" },\n      { name: \"name\", serverDataType: \"string\" },\n      { name: \"notionalValue\", serverDataType: \"double\" },\n      { name: \"notionalValueUsd\", serverDataType: \"double\" },\n    ],\n    key: \"id\",\n    table: { module: \"BASKET\", table: \"basket\" },\n  },\n  basketConstituent: {\n    columns: [\n      { name: \"basketId\", serverDataType: \"string\" },\n      { name: \"change\", serverDataType: \"string\" },\n      { name: \"description\", serverDataType: \"string\" },\n      { name: \"lastTrade\", serverDataType: \"string\" },\n      { name: \"ric\", serverDataType: \"string\" },\n      { name: \"ricBasketId\", serverDataType: \"string\" },\n      { name: \"side\", serverDataType: \"string\" },\n      { name: \"volume\", serverDataType: \"string\" },\n      { name: \"weighting\", serverDataType: \"double\" },\n    ],\n    key: \"ricBasketId\",\n    table: { module: \"BASKET\", table: \"basketConstituent\" },\n  },\n  basketTrading: {\n    columns: [\n      { name: \"basketId\", serverDataType: \"string\" },\n      { name: \"basketName\", serverDataType: \"string\" },\n      { name: \"filledPct\", serverDataType: \"double\" },\n      { name: \"fxRateToUsd\", serverDataType: \"double\" },\n      { name: \"instanceId\", serverDataType: \"string\" },\n      { name: \"side\", serverDataType: \"string\" },\n      { name: \"status\", serverDataType: \"string\" },\n      { name: \"totalNotional\", serverDataType: \"double\" },\n      { name: \"totalNotionalUsd\", serverDataType: \"double\" },\n      { name: \"units\", serverDataType: \"int\" },\n    ],\n    key: \"instanceId\",\n    table: { module: \"BASKET\", table: \"basketTrading\" },\n  },\n  basketTradingConstituent: {\n    columns: [\n      { name: \"algo\", serverDataType: \"string\" },\n      { name: \"algoParams\", serverDataType: \"string\" },\n      { name: \"basketId\", serverDataType: \"string\" },\n      { name: \"description\", serverDataType: \"string\" },\n      { name: \"instanceId\", serverDataType: \"string\" },\n      { name: \"instanceIdRic\", serverDataType: \"string\" },\n      { name: \"limitPrice\", serverDataType: \"double\" },\n      { name: \"notionalLocal\", serverDataType: \"double\" },\n      { name: \"notionalUsd\", serverDataType: \"double\" },\n      { name: \"pctFilled\", serverDataType: \"double\" },\n      { name: \"priceSpread\", serverDataType: \"int\" },\n      { name: \"priceStrategyId\", serverDataType: \"int\" },\n      { name: \"quantity\", serverDataType: \"long\" },\n      { name: \"ric\", serverDataType: \"string\" },\n      { name: \"side\", serverDataType: \"string\" },\n      { name: \"status\", serverDataType: \"string\" },\n      { name: \"venue\", serverDataType: \"string\" },\n      { name: \"weighting\", serverDataType: \"double\" },\n    ],\n    key: \"instanceIdRic\",\n    table: { module: \"BASKET\", table: \"basketTradingConstituent\" },\n  },\n\n  basketTradingConstituentJoin: {\n    columns: [\n      { name: \"algo\", serverDataType: \"string\" },\n      { name: \"algoParams\", serverDataType: \"string\" },\n      { name: \"ask\", serverDataType: \"double\" },\n      { name: \"askSize\", serverDataType: \"double\" },\n      { name: \"basketId\", serverDataType: \"string\" },\n      { name: \"bid\", serverDataType: \"double\" },\n      { name: \"bidSize\", serverDataType: \"double\" },\n      { name: \"close\", serverDataType: \"double\" },\n      { name: \"description\", serverDataType: \"string\" },\n      { name: \"instanceId\", serverDataType: \"string\" },\n      { name: \"instanceIdRic\", serverDataType: \"string\" },\n      { name: \"last\", serverDataType: \"double\" },\n      { name: \"limitPrice\", serverDataType: \"double\" },\n      { name: \"notionalLocal\", serverDataType: \"double\" },\n      { name: \"notionalUsd\", serverDataType: \"double\" },\n      { name: \"open\", serverDataType: \"double\" },\n      { name: \"pctFilled\", serverDataType: \"double\" },\n      { name: \"phase\", serverDataType: \"string\" },\n      { name: \"priceSpread\", serverDataType: \"int\" },\n      { name: \"priceStrategyId\", serverDataType: \"int\" },\n      { name: \"quantity\", serverDataType: \"long\" },\n      { name: \"ric\", serverDataType: \"string\" },\n      { name: \"scenario\", serverDataType: \"string\" },\n      { name: \"side\", serverDataType: \"string\" },\n      { name: \"status\", serverDataType: \"string\" },\n      { name: \"venue\", serverDataType: \"string\" },\n      { name: \"weighting\", serverDataType: \"double\" },\n    ],\n    key: \"instanceIdRic\",\n    table: { module: \"BASKET\", table: \"basketTradingConstituentJoin\" },\n  },\n  priceStrategyType: {\n    columns: [\n      { name: \"priceStrategy\", serverDataType: \"string\" },\n      { name: \"id\", serverDataType: \"int\" },\n    ],\n    key: \"\",\n    table: { module: \"BASKET\", table: \"priceStrategyType\" },\n  },\n};\n", "import type { ColumnDescriptor } from \"@vuu-ui/vuu-table-types\";\nimport { TableSchema } from \"@vuu-ui/vuu-data-types\";\n\nexport type SimulTableName =\n  | \"instruments\"\n  | \"instrumentsExtended\"\n  | \"instrumentPrices\"\n  | \"orders\"\n  | \"childOrders\"\n  | \"parentOrders\"\n  | \"prices\";\n\n// These Schemas take the form of the schemas that we create\n// with TABLE_META returned by Vuu.\nexport const schemas: Readonly<Record<SimulTableName, Readonly<TableSchema>>> =\n  {\n    instruments: {\n      columns: [\n        { name: \"bbg\", serverDataType: \"string\" },\n        { name: \"currency\", serverDataType: \"string\" },\n        { name: \"description\", serverDataType: \"string\" },\n        { name: \"exchange\", serverDataType: \"string\" },\n        { name: \"isin\", serverDataType: \"string\" },\n        { name: \"lotSize\", serverDataType: \"int\" },\n        { name: \"ric\", serverDataType: \"string\" },\n      ],\n      key: \"ric\",\n      table: { module: \"SIMUL\", table: \"instruments\" },\n    },\n    instrumentsExtended: {\n      columns: [\n        { name: \"bbg\", serverDataType: \"string\" },\n        { name: \"currency\", serverDataType: \"string\" },\n        { name: \"description\", serverDataType: \"string\" },\n        { name: \"exchange\", serverDataType: \"string\" },\n        { name: \"isin\", serverDataType: \"string\" },\n        { name: \"lotSize\", serverDataType: \"int\" },\n        { name: \"ric\", serverDataType: \"string\" },\n        { name: \"supported\", serverDataType: \"boolean\" },\n        { name: \"wishlist\", serverDataType: \"boolean\" },\n        { name: \"lastUpdated\", serverDataType: \"long\" },\n      ],\n      key: \"ric\",\n      table: { module: \"SIMUL\", table: \"instruments\" },\n    },\n    instrumentPrices: {\n      columns: [\n        { name: \"ask\", serverDataType: \"double\" },\n        { name: \"askSize\", serverDataType: \"double\" }, // type: \"int\"\n        { name: \"bbg\", serverDataType: \"string\" },\n        { name: \"bid\", serverDataType: \"double\" },\n        { name: \"bidSize\", serverDataType: \"double\" },\n        { name: \"close\", serverDataType: \"double\" },\n        { name: \"currency\", serverDataType: \"string\" },\n        { name: \"description\", serverDataType: \"string\" },\n        { name: \"exchange\", serverDataType: \"string\" },\n        { name: \"isin\", serverDataType: \"string\" },\n        { name: \"last\", serverDataType: \"double\" },\n        { name: \"lotSize\", serverDataType: \"int\" },\n        { name: \"open\", serverDataType: \"double\" },\n        { name: \"phase\", serverDataType: \"string\" },\n        { name: \"ric\", serverDataType: \"string\" },\n        { name: \"scenario\", serverDataType: \"string\" },\n      ],\n      key: \"ric\",\n      table: { module: \"SIMUL\", table: \"instrumentPrices\" },\n    },\n    orders: {\n      columns: [\n        { name: \"ccy\", serverDataType: \"string\" },\n        { name: \"created\", serverDataType: \"long\" },\n        { name: \"filledQuantity\", serverDataType: \"double\" },\n        { name: \"lastUpdate\", serverDataType: \"long\" },\n        { name: \"orderId\", serverDataType: \"string\" },\n        { name: \"quantity\", serverDataType: \"double\" },\n        { name: \"ric\", serverDataType: \"string\" },\n        { name: \"side\", serverDataType: \"string\" },\n        { name: \"trader\", serverDataType: \"string\" },\n      ],\n      key: \"orderId\",\n      table: { module: \"SIMUL\", table: \"orders\" },\n    },\n    childOrders: {\n      columns: [\n        { name: \"account\", serverDataType: \"string\" },\n        { name: \"averagePrice\", serverDataType: \"double\" },\n        { name: \"ccy\", serverDataType: \"string\" },\n        { name: \"exchange\", serverDataType: \"string\" },\n        { name: \"filledQty\", serverDataType: \"double\" },\n        { name: \"id\", serverDataType: \"string\" },\n        { name: \"idAsInt\", serverDataType: \"int\" },\n        { name: \"lastUpdate\", serverDataType: \"long\" },\n        { name: \"openQty\", serverDataType: \"double\" },\n        { name: \"parentOrderId\", serverDataType: \"string\" },\n        { name: \"price\", serverDataType: \"double\" },\n        { name: \"quantity\", serverDataType: \"double\" },\n        { name: \"ric\", serverDataType: \"string\" },\n        { name: \"side\", serverDataType: \"string\" },\n        { name: \"status\", serverDataType: \"string\" },\n        { name: \"strategy\", serverDataType: \"string\" },\n        { name: \"volLimit\", serverDataType: \"int\" },\n      ],\n      key: \"id\",\n      table: { module: \"SIMUL\", table: \"childOrders\" },\n    },\n    parentOrders: {\n      columns: [\n        { name: \"account\", serverDataType: \"string\" },\n        { name: \"algo\", serverDataType: \"string\" },\n        { name: \"averagePrice\", serverDataType: \"double\" },\n        { name: \"ccy\", serverDataType: \"string\" },\n        { name: \"childCount\", serverDataType: \"int\" },\n        { name: \"exchange\", serverDataType: \"string\" },\n        { name: \"filledQty\", serverDataType: \"double\" },\n        { name: \"id\", serverDataType: \"string\" },\n        { name: \"idAsInt\", serverDataType: \"int\" },\n        { name: \"lastUpdate\", serverDataType: \"long\" },\n        { name: \"openQty\", serverDataType: \"double\" },\n        { name: \"price\", serverDataType: \"double\" },\n        { name: \"quantity\", serverDataType: \"double\" },\n        { name: \"ric\", serverDataType: \"string\" },\n        { name: \"side\", serverDataType: \"string\" },\n        { name: \"status\", serverDataType: \"string\" },\n        { name: \"volLimit\", serverDataType: \"int\" },\n      ],\n      key: \"id\",\n      table: { module: \"SIMUL\", table: \"parentOrders\" },\n    },\n    prices: {\n      columns: [\n        { name: \"ask\", serverDataType: \"double\" },\n        { name: \"askSize\", serverDataType: \"double\" }, // type: \"int\"\n        { name: \"bid\", serverDataType: \"double\" },\n        { name: \"bidSize\", serverDataType: \"double\" },\n        { name: \"close\", serverDataType: \"double\" },\n        { name: \"last\", serverDataType: \"double\" },\n        { name: \"open\", serverDataType: \"double\" },\n        { name: \"phase\", serverDataType: \"string\" },\n        { name: \"ric\", serverDataType: \"string\" },\n        { name: \"scenario\", serverDataType: \"string\" },\n      ],\n      key: \"ric\",\n      table: { module: \"SIMUL\", table: \"prices\" },\n    },\n  };\n\nexport type ColumnState = { [key: string]: TableSchema };\n\nexport interface ColumnActionUpdate {\n  type: \"updateColumn\";\n  column: ColumnDescriptor;\n}\n\nexport type ColumnAction = ColumnActionUpdate;\n", "import { TableSchema } from \"@vuu-ui/vuu-data-types\";\nimport {\n  type BasketsTableName,\n  schemas as basketSchemas,\n} from \"./basket/basket-schemas\";\nimport {\n  type SimulTableName,\n  schemas as simulSchemas,\n} from \"./simul/simul-schemas\";\n\nexport type VuuTableName = BasketsTableName | SimulTableName;\nexport const schemas: Record<VuuTableName, TableSchema> = {\n  ...basketSchemas,\n  ...simulSchemas,\n};\n\nconst allSchemas: Readonly<Record<VuuTableName, Readonly<TableSchema>>> = {\n  ...basketSchemas,\n  ...simulSchemas,\n};\n\nexport const getAllSchemas = () => schemas;\n\nexport const getSchema = (tableName: VuuTableName) => {\n  if (allSchemas[tableName]) {\n    return allSchemas[tableName];\n  }\n  throw Error(`getSchema no schema for table ${tableName}`);\n};\n", "// FIXME profile adding a per-Tree TreeNode cache, validating it by\n// parent pointer\n/// The default maximum length of a `TreeBuffer` node.\nconst DefaultBufferLength = 1024;\nlet nextPropID = 0;\nclass Range {\n    constructor(from, to) {\n        this.from = from;\n        this.to = to;\n    }\n}\n/// Each [node type](#common.NodeType) or [individual tree](#common.Tree)\n/// can have metadata associated with it in props. Instances of this\n/// class represent prop names.\nclass NodeProp {\n    /// Create a new node prop type.\n    constructor(config = {}) {\n        this.id = nextPropID++;\n        this.perNode = !!config.perNode;\n        this.deserialize = config.deserialize || (() => {\n            throw new Error(\"This node type doesn't define a deserialize function\");\n        });\n    }\n    /// This is meant to be used with\n    /// [`NodeSet.extend`](#common.NodeSet.extend) or\n    /// [`LRParser.configure`](#lr.ParserConfig.props) to compute\n    /// prop values for each node type in the set. Takes a [match\n    /// object](#common.NodeType^match) or function that returns undefined\n    /// if the node type doesn't get this prop, and the prop's value if\n    /// it does.\n    add(match) {\n        if (this.perNode)\n            throw new RangeError(\"Can't add per-node props to node types\");\n        if (typeof match != \"function\")\n            match = NodeType.match(match);\n        return (type) => {\n            let result = match(type);\n            return result === undefined ? null : [this, result];\n        };\n    }\n}\n/// Prop that is used to describe matching delimiters. For opening\n/// delimiters, this holds an array of node names (written as a\n/// space-separated string when declaring this prop in a grammar)\n/// for the node types of closing delimiters that match it.\nNodeProp.closedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/// The inverse of [`closedBy`](#common.NodeProp^closedBy). This is\n/// attached to closing delimiters, holding an array of node names\n/// of types of matching opening delimiters.\nNodeProp.openedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/// Used to assign node types to groups (for example, all node\n/// types that represent an expression could be tagged with an\n/// `\"Expression\"` group).\nNodeProp.group = new NodeProp({ deserialize: str => str.split(\" \") });\n/// The hash of the [context](#lr.ContextTracker.constructor)\n/// that the node was parsed in, if any. Used to limit reuse of\n/// contextual nodes.\nNodeProp.contextHash = new NodeProp({ perNode: true });\n/// The distance beyond the end of the node that the tokenizer\n/// looked ahead for any of the tokens inside the node. (The LR\n/// parser only stores this when it is larger than 25, for\n/// efficiency reasons.)\nNodeProp.lookAhead = new NodeProp({ perNode: true });\n/// This per-node prop is used to replace a given node, or part of a\n/// node, with another tree. This is useful to include trees from\n/// different languages in mixed-language parsers.\nNodeProp.mounted = new NodeProp({ perNode: true });\n/// A mounted tree, which can be [stored](#common.NodeProp^mounted) on\n/// a tree node to indicate that parts of its content are\n/// represented by another tree.\nclass MountedTree {\n    constructor(\n    /// The inner tree.\n    tree, \n    /// If this is null, this tree replaces the entire node (it will\n    /// be included in the regular iteration instead of its host\n    /// node). If not, only the given ranges are considered to be\n    /// covered by this tree. This is used for trees that are mixed in\n    /// a way that isn't strictly hierarchical. Such mounted trees are\n    /// only entered by [`resolveInner`](#common.Tree.resolveInner)\n    /// and [`enter`](#common.SyntaxNode.enter).\n    overlay, \n    /// The parser used to create this subtree.\n    parser) {\n        this.tree = tree;\n        this.overlay = overlay;\n        this.parser = parser;\n    }\n}\nconst noProps = Object.create(null);\n/// Each node in a syntax tree has a node type associated with it.\nclass NodeType {\n    /// @internal\n    constructor(\n    /// The name of the node type. Not necessarily unique, but if the\n    /// grammar was written properly, different node types with the\n    /// same name within a node set should play the same semantic\n    /// role.\n    name, \n    /// @internal\n    props, \n    /// The id of this node in its set. Corresponds to the term ids\n    /// used in the parser.\n    id, \n    /// @internal\n    flags = 0) {\n        this.name = name;\n        this.props = props;\n        this.id = id;\n        this.flags = flags;\n    }\n    /// Define a node type.\n    static define(spec) {\n        let props = spec.props && spec.props.length ? Object.create(null) : noProps;\n        let flags = (spec.top ? 1 /* NodeFlag.Top */ : 0) | (spec.skipped ? 2 /* NodeFlag.Skipped */ : 0) |\n            (spec.error ? 4 /* NodeFlag.Error */ : 0) | (spec.name == null ? 8 /* NodeFlag.Anonymous */ : 0);\n        let type = new NodeType(spec.name || \"\", props, spec.id, flags);\n        if (spec.props)\n            for (let src of spec.props) {\n                if (!Array.isArray(src))\n                    src = src(type);\n                if (src) {\n                    if (src[0].perNode)\n                        throw new RangeError(\"Can't store a per-node prop on a node type\");\n                    props[src[0].id] = src[1];\n                }\n            }\n        return type;\n    }\n    /// Retrieves a node prop for this type. Will return `undefined` if\n    /// the prop isn't present on this node.\n    prop(prop) { return this.props[prop.id]; }\n    /// True when this is the top node of a grammar.\n    get isTop() { return (this.flags & 1 /* NodeFlag.Top */) > 0; }\n    /// True when this node is produced by a skip rule.\n    get isSkipped() { return (this.flags & 2 /* NodeFlag.Skipped */) > 0; }\n    /// Indicates whether this is an error node.\n    get isError() { return (this.flags & 4 /* NodeFlag.Error */) > 0; }\n    /// When true, this node type doesn't correspond to a user-declared\n    /// named node, for example because it is used to cache repetition.\n    get isAnonymous() { return (this.flags & 8 /* NodeFlag.Anonymous */) > 0; }\n    /// Returns true when this node's name or one of its\n    /// [groups](#common.NodeProp^group) matches the given string.\n    is(name) {\n        if (typeof name == 'string') {\n            if (this.name == name)\n                return true;\n            let group = this.prop(NodeProp.group);\n            return group ? group.indexOf(name) > -1 : false;\n        }\n        return this.id == name;\n    }\n    /// Create a function from node types to arbitrary values by\n    /// specifying an object whose property names are node or\n    /// [group](#common.NodeProp^group) names. Often useful with\n    /// [`NodeProp.add`](#common.NodeProp.add). You can put multiple\n    /// names, separated by spaces, in a single property name to map\n    /// multiple node names to a single value.\n    static match(map) {\n        let direct = Object.create(null);\n        for (let prop in map)\n            for (let name of prop.split(\" \"))\n                direct[name] = map[prop];\n        return (node) => {\n            for (let groups = node.prop(NodeProp.group), i = -1; i < (groups ? groups.length : 0); i++) {\n                let found = direct[i < 0 ? node.name : groups[i]];\n                if (found)\n                    return found;\n            }\n        };\n    }\n}\n/// An empty dummy node type to use when no actual type is available.\nNodeType.none = new NodeType(\"\", Object.create(null), 0, 8 /* NodeFlag.Anonymous */);\n/// A node set holds a collection of node types. It is used to\n/// compactly represent trees by storing their type ids, rather than a\n/// full pointer to the type object, in a numeric array. Each parser\n/// [has](#lr.LRParser.nodeSet) a node set, and [tree\n/// buffers](#common.TreeBuffer) can only store collections of nodes\n/// from the same set. A set can have a maximum of 2**16 (65536) node\n/// types in it, so that the ids fit into 16-bit typed array slots.\nclass NodeSet {\n    /// Create a set with the given types. The `id` property of each\n    /// type should correspond to its position within the array.\n    constructor(\n    /// The node types in this set, by id.\n    types) {\n        this.types = types;\n        for (let i = 0; i < types.length; i++)\n            if (types[i].id != i)\n                throw new RangeError(\"Node type ids should correspond to array positions when creating a node set\");\n    }\n    /// Create a copy of this set with some node properties added. The\n    /// arguments to this method can be created with\n    /// [`NodeProp.add`](#common.NodeProp.add).\n    extend(...props) {\n        let newTypes = [];\n        for (let type of this.types) {\n            let newProps = null;\n            for (let source of props) {\n                let add = source(type);\n                if (add) {\n                    if (!newProps)\n                        newProps = Object.assign({}, type.props);\n                    newProps[add[0].id] = add[1];\n                }\n            }\n            newTypes.push(newProps ? new NodeType(type.name, newProps, type.id, type.flags) : type);\n        }\n        return new NodeSet(newTypes);\n    }\n}\nconst CachedNode = new WeakMap(), CachedInnerNode = new WeakMap();\n/// Options that control iteration. Can be combined with the `|`\n/// operator to enable multiple ones.\nvar IterMode;\n(function (IterMode) {\n    /// When enabled, iteration will only visit [`Tree`](#common.Tree)\n    /// objects, not nodes packed into\n    /// [`TreeBuffer`](#common.TreeBuffer)s.\n    IterMode[IterMode[\"ExcludeBuffers\"] = 1] = \"ExcludeBuffers\";\n    /// Enable this to make iteration include anonymous nodes (such as\n    /// the nodes that wrap repeated grammar constructs into a balanced\n    /// tree).\n    IterMode[IterMode[\"IncludeAnonymous\"] = 2] = \"IncludeAnonymous\";\n    /// By default, regular [mounted](#common.NodeProp^mounted) nodes\n    /// replace their base node in iteration. Enable this to ignore them\n    /// instead.\n    IterMode[IterMode[\"IgnoreMounts\"] = 4] = \"IgnoreMounts\";\n    /// This option only applies in\n    /// [`enter`](#common.SyntaxNode.enter)-style methods. It tells the\n    /// library to not enter mounted overlays if one covers the given\n    /// position.\n    IterMode[IterMode[\"IgnoreOverlays\"] = 8] = \"IgnoreOverlays\";\n})(IterMode || (IterMode = {}));\n/// A piece of syntax tree. There are two ways to approach these\n/// trees: the way they are actually stored in memory, and the\n/// convenient way.\n///\n/// Syntax trees are stored as a tree of `Tree` and `TreeBuffer`\n/// objects. By packing detail information into `TreeBuffer` leaf\n/// nodes, the representation is made a lot more memory-efficient.\n///\n/// However, when you want to actually work with tree nodes, this\n/// representation is very awkward, so most client code will want to\n/// use the [`TreeCursor`](#common.TreeCursor) or\n/// [`SyntaxNode`](#common.SyntaxNode) interface instead, which provides\n/// a view on some part of this data structure, and can be used to\n/// move around to adjacent nodes.\nclass Tree {\n    /// Construct a new tree. See also [`Tree.build`](#common.Tree^build).\n    constructor(\n    /// The type of the top node.\n    type, \n    /// This node's child nodes.\n    children, \n    /// The positions (offsets relative to the start of this tree) of\n    /// the children.\n    positions, \n    /// The total length of this tree\n    length, \n    /// Per-node [node props](#common.NodeProp) to associate with this node.\n    props) {\n        this.type = type;\n        this.children = children;\n        this.positions = positions;\n        this.length = length;\n        /// @internal\n        this.props = null;\n        if (props && props.length) {\n            this.props = Object.create(null);\n            for (let [prop, value] of props)\n                this.props[typeof prop == \"number\" ? prop : prop.id] = value;\n        }\n    }\n    /// @internal\n    toString() {\n        let mounted = this.prop(NodeProp.mounted);\n        if (mounted && !mounted.overlay)\n            return mounted.tree.toString();\n        let children = \"\";\n        for (let ch of this.children) {\n            let str = ch.toString();\n            if (str) {\n                if (children)\n                    children += \",\";\n                children += str;\n            }\n        }\n        return !this.type.name ? children :\n            (/\\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) +\n                (children.length ? \"(\" + children + \")\" : \"\");\n    }\n    /// Get a [tree cursor](#common.TreeCursor) positioned at the top of\n    /// the tree. Mode can be used to [control](#common.IterMode) which\n    /// nodes the cursor visits.\n    cursor(mode = 0) {\n        return new TreeCursor(this.topNode, mode);\n    }\n    /// Get a [tree cursor](#common.TreeCursor) pointing into this tree\n    /// at the given position and side (see\n    /// [`moveTo`](#common.TreeCursor.moveTo).\n    cursorAt(pos, side = 0, mode = 0) {\n        let scope = CachedNode.get(this) || this.topNode;\n        let cursor = new TreeCursor(scope);\n        cursor.moveTo(pos, side);\n        CachedNode.set(this, cursor._tree);\n        return cursor;\n    }\n    /// Get a [syntax node](#common.SyntaxNode) object for the top of the\n    /// tree.\n    get topNode() {\n        return new TreeNode(this, 0, 0, null);\n    }\n    /// Get the [syntax node](#common.SyntaxNode) at the given position.\n    /// If `side` is -1, this will move into nodes that end at the\n    /// position. If 1, it'll move into nodes that start at the\n    /// position. With 0, it'll only enter nodes that cover the position\n    /// from both sides.\n    ///\n    /// Note that this will not enter\n    /// [overlays](#common.MountedTree.overlay), and you often want\n    /// [`resolveInner`](#common.Tree.resolveInner) instead.\n    resolve(pos, side = 0) {\n        let node = resolveNode(CachedNode.get(this) || this.topNode, pos, side, false);\n        CachedNode.set(this, node);\n        return node;\n    }\n    /// Like [`resolve`](#common.Tree.resolve), but will enter\n    /// [overlaid](#common.MountedTree.overlay) nodes, producing a syntax node\n    /// pointing into the innermost overlaid tree at the given position\n    /// (with parent links going through all parent structure, including\n    /// the host trees).\n    resolveInner(pos, side = 0) {\n        let node = resolveNode(CachedInnerNode.get(this) || this.topNode, pos, side, true);\n        CachedInnerNode.set(this, node);\n        return node;\n    }\n    /// Iterate over the tree and its children, calling `enter` for any\n    /// node that touches the `from`/`to` region (if given) before\n    /// running over such a node's children, and `leave` (if given) when\n    /// leaving the node. When `enter` returns `false`, that node will\n    /// not have its children iterated over (or `leave` called).\n    iterate(spec) {\n        let { enter, leave, from = 0, to = this.length } = spec;\n        let mode = spec.mode || 0, anon = (mode & IterMode.IncludeAnonymous) > 0;\n        for (let c = this.cursor(mode | IterMode.IncludeAnonymous);;) {\n            let entered = false;\n            if (c.from <= to && c.to >= from && (!anon && c.type.isAnonymous || enter(c) !== false)) {\n                if (c.firstChild())\n                    continue;\n                entered = true;\n            }\n            for (;;) {\n                if (entered && leave && (anon || !c.type.isAnonymous))\n                    leave(c);\n                if (c.nextSibling())\n                    break;\n                if (!c.parent())\n                    return;\n                entered = true;\n            }\n        }\n    }\n    /// Get the value of the given [node prop](#common.NodeProp) for this\n    /// node. Works with both per-node and per-type props.\n    prop(prop) {\n        return !prop.perNode ? this.type.prop(prop) : this.props ? this.props[prop.id] : undefined;\n    }\n    /// Returns the node's [per-node props](#common.NodeProp.perNode) in a\n    /// format that can be passed to the [`Tree`](#common.Tree)\n    /// constructor.\n    get propValues() {\n        let result = [];\n        if (this.props)\n            for (let id in this.props)\n                result.push([+id, this.props[id]]);\n        return result;\n    }\n    /// Balance the direct children of this tree, producing a copy of\n    /// which may have children grouped into subtrees with type\n    /// [`NodeType.none`](#common.NodeType^none).\n    balance(config = {}) {\n        return this.children.length <= 8 /* Balance.BranchFactor */ ? this :\n            balanceRange(NodeType.none, this.children, this.positions, 0, this.children.length, 0, this.length, (children, positions, length) => new Tree(this.type, children, positions, length, this.propValues), config.makeTree || ((children, positions, length) => new Tree(NodeType.none, children, positions, length)));\n    }\n    /// Build a tree from a postfix-ordered buffer of node information,\n    /// or a cursor over such a buffer.\n    static build(data) { return buildTree(data); }\n}\n/// The empty tree\nTree.empty = new Tree(NodeType.none, [], [], 0);\nclass FlatBufferCursor {\n    constructor(buffer, index) {\n        this.buffer = buffer;\n        this.index = index;\n    }\n    get id() { return this.buffer[this.index - 4]; }\n    get start() { return this.buffer[this.index - 3]; }\n    get end() { return this.buffer[this.index - 2]; }\n    get size() { return this.buffer[this.index - 1]; }\n    get pos() { return this.index; }\n    next() { this.index -= 4; }\n    fork() { return new FlatBufferCursor(this.buffer, this.index); }\n}\n/// Tree buffers contain (type, start, end, endIndex) quads for each\n/// node. In such a buffer, nodes are stored in prefix order (parents\n/// before children, with the endIndex of the parent indicating which\n/// children belong to it).\nclass TreeBuffer {\n    /// Create a tree buffer.\n    constructor(\n    /// The buffer's content.\n    buffer, \n    /// The total length of the group of nodes in the buffer.\n    length, \n    /// The node set used in this buffer.\n    set) {\n        this.buffer = buffer;\n        this.length = length;\n        this.set = set;\n    }\n    /// @internal\n    get type() { return NodeType.none; }\n    /// @internal\n    toString() {\n        let result = [];\n        for (let index = 0; index < this.buffer.length;) {\n            result.push(this.childString(index));\n            index = this.buffer[index + 3];\n        }\n        return result.join(\",\");\n    }\n    /// @internal\n    childString(index) {\n        let id = this.buffer[index], endIndex = this.buffer[index + 3];\n        let type = this.set.types[id], result = type.name;\n        if (/\\W/.test(result) && !type.isError)\n            result = JSON.stringify(result);\n        index += 4;\n        if (endIndex == index)\n            return result;\n        let children = [];\n        while (index < endIndex) {\n            children.push(this.childString(index));\n            index = this.buffer[index + 3];\n        }\n        return result + \"(\" + children.join(\",\") + \")\";\n    }\n    /// @internal\n    findChild(startIndex, endIndex, dir, pos, side) {\n        let { buffer } = this, pick = -1;\n        for (let i = startIndex; i != endIndex; i = buffer[i + 3]) {\n            if (checkSide(side, pos, buffer[i + 1], buffer[i + 2])) {\n                pick = i;\n                if (dir > 0)\n                    break;\n            }\n        }\n        return pick;\n    }\n    /// @internal\n    slice(startI, endI, from) {\n        let b = this.buffer;\n        let copy = new Uint16Array(endI - startI), len = 0;\n        for (let i = startI, j = 0; i < endI;) {\n            copy[j++] = b[i++];\n            copy[j++] = b[i++] - from;\n            let to = copy[j++] = b[i++] - from;\n            copy[j++] = b[i++] - startI;\n            len = Math.max(len, to);\n        }\n        return new TreeBuffer(copy, len, this.set);\n    }\n}\nfunction checkSide(side, pos, from, to) {\n    switch (side) {\n        case -2 /* Side.Before */: return from < pos;\n        case -1 /* Side.AtOrBefore */: return to >= pos && from < pos;\n        case 0 /* Side.Around */: return from < pos && to > pos;\n        case 1 /* Side.AtOrAfter */: return from <= pos && to > pos;\n        case 2 /* Side.After */: return to > pos;\n        case 4 /* Side.DontCare */: return true;\n    }\n}\nfunction enterUnfinishedNodesBefore(node, pos) {\n    let scan = node.childBefore(pos);\n    while (scan) {\n        let last = scan.lastChild;\n        if (!last || last.to != scan.to)\n            break;\n        if (last.type.isError && last.from == last.to) {\n            node = scan;\n            scan = last.prevSibling;\n        }\n        else {\n            scan = last;\n        }\n    }\n    return node;\n}\nfunction resolveNode(node, pos, side, overlays) {\n    var _a;\n    // Move up to a node that actually holds the position, if possible\n    while (node.from == node.to ||\n        (side < 1 ? node.from >= pos : node.from > pos) ||\n        (side > -1 ? node.to <= pos : node.to < pos)) {\n        let parent = !overlays && node instanceof TreeNode && node.index < 0 ? null : node.parent;\n        if (!parent)\n            return node;\n        node = parent;\n    }\n    let mode = overlays ? 0 : IterMode.IgnoreOverlays;\n    // Must go up out of overlays when those do not overlap with pos\n    if (overlays)\n        for (let scan = node, parent = scan.parent; parent; scan = parent, parent = scan.parent) {\n            if (scan instanceof TreeNode && scan.index < 0 && ((_a = parent.enter(pos, side, mode)) === null || _a === void 0 ? void 0 : _a.from) != scan.from)\n                node = parent;\n        }\n    for (;;) {\n        let inner = node.enter(pos, side, mode);\n        if (!inner)\n            return node;\n        node = inner;\n    }\n}\nclass TreeNode {\n    constructor(_tree, from, \n    // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay)\n    index, _parent) {\n        this._tree = _tree;\n        this.from = from;\n        this.index = index;\n        this._parent = _parent;\n    }\n    get type() { return this._tree.type; }\n    get name() { return this._tree.type.name; }\n    get to() { return this.from + this._tree.length; }\n    nextChild(i, dir, pos, side, mode = 0) {\n        for (let parent = this;;) {\n            for (let { children, positions } = parent._tree, e = dir > 0 ? children.length : -1; i != e; i += dir) {\n                let next = children[i], start = positions[i] + parent.from;\n                if (!checkSide(side, pos, start, start + next.length))\n                    continue;\n                if (next instanceof TreeBuffer) {\n                    if (mode & IterMode.ExcludeBuffers)\n                        continue;\n                    let index = next.findChild(0, next.buffer.length, dir, pos - start, side);\n                    if (index > -1)\n                        return new BufferNode(new BufferContext(parent, next, i, start), null, index);\n                }\n                else if ((mode & IterMode.IncludeAnonymous) || (!next.type.isAnonymous || hasChild(next))) {\n                    let mounted;\n                    if (!(mode & IterMode.IgnoreMounts) &&\n                        next.props && (mounted = next.prop(NodeProp.mounted)) && !mounted.overlay)\n                        return new TreeNode(mounted.tree, start, i, parent);\n                    let inner = new TreeNode(next, start, i, parent);\n                    return (mode & IterMode.IncludeAnonymous) || !inner.type.isAnonymous ? inner\n                        : inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side);\n                }\n            }\n            if ((mode & IterMode.IncludeAnonymous) || !parent.type.isAnonymous)\n                return null;\n            if (parent.index >= 0)\n                i = parent.index + dir;\n            else\n                i = dir < 0 ? -1 : parent._parent._tree.children.length;\n            parent = parent._parent;\n            if (!parent)\n                return null;\n        }\n    }\n    get firstChild() { return this.nextChild(0, 1, 0, 4 /* Side.DontCare */); }\n    get lastChild() { return this.nextChild(this._tree.children.length - 1, -1, 0, 4 /* Side.DontCare */); }\n    childAfter(pos) { return this.nextChild(0, 1, pos, 2 /* Side.After */); }\n    childBefore(pos) { return this.nextChild(this._tree.children.length - 1, -1, pos, -2 /* Side.Before */); }\n    enter(pos, side, mode = 0) {\n        let mounted;\n        if (!(mode & IterMode.IgnoreOverlays) && (mounted = this._tree.prop(NodeProp.mounted)) && mounted.overlay) {\n            let rPos = pos - this.from;\n            for (let { from, to } of mounted.overlay) {\n                if ((side > 0 ? from <= rPos : from < rPos) &&\n                    (side < 0 ? to >= rPos : to > rPos))\n                    return new TreeNode(mounted.tree, mounted.overlay[0].from + this.from, -1, this);\n            }\n        }\n        return this.nextChild(0, 1, pos, side, mode);\n    }\n    nextSignificantParent() {\n        let val = this;\n        while (val.type.isAnonymous && val._parent)\n            val = val._parent;\n        return val;\n    }\n    get parent() {\n        return this._parent ? this._parent.nextSignificantParent() : null;\n    }\n    get nextSibling() {\n        return this._parent && this.index >= 0 ? this._parent.nextChild(this.index + 1, 1, 0, 4 /* Side.DontCare */) : null;\n    }\n    get prevSibling() {\n        return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4 /* Side.DontCare */) : null;\n    }\n    cursor(mode = 0) { return new TreeCursor(this, mode); }\n    get tree() { return this._tree; }\n    toTree() { return this._tree; }\n    resolve(pos, side = 0) {\n        return resolveNode(this, pos, side, false);\n    }\n    resolveInner(pos, side = 0) {\n        return resolveNode(this, pos, side, true);\n    }\n    enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); }\n    getChild(type, before = null, after = null) {\n        let r = getChildren(this, type, before, after);\n        return r.length ? r[0] : null;\n    }\n    getChildren(type, before = null, after = null) {\n        return getChildren(this, type, before, after);\n    }\n    /// @internal\n    toString() { return this._tree.toString(); }\n    get node() { return this; }\n    matchContext(context) { return matchNodeContext(this, context); }\n}\nfunction getChildren(node, type, before, after) {\n    let cur = node.cursor(), result = [];\n    if (!cur.firstChild())\n        return result;\n    if (before != null)\n        while (!cur.type.is(before))\n            if (!cur.nextSibling())\n                return result;\n    for (;;) {\n        if (after != null && cur.type.is(after))\n            return result;\n        if (cur.type.is(type))\n            result.push(cur.node);\n        if (!cur.nextSibling())\n            return after == null ? result : [];\n    }\n}\nfunction matchNodeContext(node, context, i = context.length - 1) {\n    for (let p = node.parent; i >= 0; p = p.parent) {\n        if (!p)\n            return false;\n        if (!p.type.isAnonymous) {\n            if (context[i] && context[i] != p.name)\n                return false;\n            i--;\n        }\n    }\n    return true;\n}\nclass BufferContext {\n    constructor(parent, buffer, index, start) {\n        this.parent = parent;\n        this.buffer = buffer;\n        this.index = index;\n        this.start = start;\n    }\n}\nclass BufferNode {\n    get name() { return this.type.name; }\n    get from() { return this.context.start + this.context.buffer.buffer[this.index + 1]; }\n    get to() { return this.context.start + this.context.buffer.buffer[this.index + 2]; }\n    constructor(context, _parent, index) {\n        this.context = context;\n        this._parent = _parent;\n        this.index = index;\n        this.type = context.buffer.set.types[context.buffer.buffer[index]];\n    }\n    child(dir, pos, side) {\n        let { buffer } = this.context;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.context.start, side);\n        return index < 0 ? null : new BufferNode(this.context, this, index);\n    }\n    get firstChild() { return this.child(1, 0, 4 /* Side.DontCare */); }\n    get lastChild() { return this.child(-1, 0, 4 /* Side.DontCare */); }\n    childAfter(pos) { return this.child(1, pos, 2 /* Side.After */); }\n    childBefore(pos) { return this.child(-1, pos, -2 /* Side.Before */); }\n    enter(pos, side, mode = 0) {\n        if (mode & IterMode.ExcludeBuffers)\n            return null;\n        let { buffer } = this.context;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], side > 0 ? 1 : -1, pos - this.context.start, side);\n        return index < 0 ? null : new BufferNode(this.context, this, index);\n    }\n    get parent() {\n        return this._parent || this.context.parent.nextSignificantParent();\n    }\n    externalSibling(dir) {\n        return this._parent ? null : this.context.parent.nextChild(this.context.index + dir, dir, 0, 4 /* Side.DontCare */);\n    }\n    get nextSibling() {\n        let { buffer } = this.context;\n        let after = buffer.buffer[this.index + 3];\n        if (after < (this._parent ? buffer.buffer[this._parent.index + 3] : buffer.buffer.length))\n            return new BufferNode(this.context, this._parent, after);\n        return this.externalSibling(1);\n    }\n    get prevSibling() {\n        let { buffer } = this.context;\n        let parentStart = this._parent ? this._parent.index + 4 : 0;\n        if (this.index == parentStart)\n            return this.externalSibling(-1);\n        return new BufferNode(this.context, this._parent, buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n    }\n    cursor(mode = 0) { return new TreeCursor(this, mode); }\n    get tree() { return null; }\n    toTree() {\n        let children = [], positions = [];\n        let { buffer } = this.context;\n        let startI = this.index + 4, endI = buffer.buffer[this.index + 3];\n        if (endI > startI) {\n            let from = buffer.buffer[this.index + 1];\n            children.push(buffer.slice(startI, endI, from));\n            positions.push(0);\n        }\n        return new Tree(this.type, children, positions, this.to - this.from);\n    }\n    resolve(pos, side = 0) {\n        return resolveNode(this, pos, side, false);\n    }\n    resolveInner(pos, side = 0) {\n        return resolveNode(this, pos, side, true);\n    }\n    enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); }\n    /// @internal\n    toString() { return this.context.buffer.childString(this.index); }\n    getChild(type, before = null, after = null) {\n        let r = getChildren(this, type, before, after);\n        return r.length ? r[0] : null;\n    }\n    getChildren(type, before = null, after = null) {\n        return getChildren(this, type, before, after);\n    }\n    get node() { return this; }\n    matchContext(context) { return matchNodeContext(this, context); }\n}\n/// A tree cursor object focuses on a given node in a syntax tree, and\n/// allows you to move to adjacent nodes.\nclass TreeCursor {\n    /// Shorthand for `.type.name`.\n    get name() { return this.type.name; }\n    /// @internal\n    constructor(node, \n    /// @internal\n    mode = 0) {\n        this.mode = mode;\n        /// @internal\n        this.buffer = null;\n        this.stack = [];\n        /// @internal\n        this.index = 0;\n        this.bufferNode = null;\n        if (node instanceof TreeNode) {\n            this.yieldNode(node);\n        }\n        else {\n            this._tree = node.context.parent;\n            this.buffer = node.context;\n            for (let n = node._parent; n; n = n._parent)\n                this.stack.unshift(n.index);\n            this.bufferNode = node;\n            this.yieldBuf(node.index);\n        }\n    }\n    yieldNode(node) {\n        if (!node)\n            return false;\n        this._tree = node;\n        this.type = node.type;\n        this.from = node.from;\n        this.to = node.to;\n        return true;\n    }\n    yieldBuf(index, type) {\n        this.index = index;\n        let { start, buffer } = this.buffer;\n        this.type = type || buffer.set.types[buffer.buffer[index]];\n        this.from = start + buffer.buffer[index + 1];\n        this.to = start + buffer.buffer[index + 2];\n        return true;\n    }\n    yield(node) {\n        if (!node)\n            return false;\n        if (node instanceof TreeNode) {\n            this.buffer = null;\n            return this.yieldNode(node);\n        }\n        this.buffer = node.context;\n        return this.yieldBuf(node.index, node.type);\n    }\n    /// @internal\n    toString() {\n        return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();\n    }\n    /// @internal\n    enterChild(dir, pos, side) {\n        if (!this.buffer)\n            return this.yield(this._tree.nextChild(dir < 0 ? this._tree._tree.children.length - 1 : 0, dir, pos, side, this.mode));\n        let { buffer } = this.buffer;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.buffer.start, side);\n        if (index < 0)\n            return false;\n        this.stack.push(this.index);\n        return this.yieldBuf(index);\n    }\n    /// Move the cursor to this node's first child. When this returns\n    /// false, the node has no child, and the cursor has not been moved.\n    firstChild() { return this.enterChild(1, 0, 4 /* Side.DontCare */); }\n    /// Move the cursor to this node's last child.\n    lastChild() { return this.enterChild(-1, 0, 4 /* Side.DontCare */); }\n    /// Move the cursor to the first child that ends after `pos`.\n    childAfter(pos) { return this.enterChild(1, pos, 2 /* Side.After */); }\n    /// Move to the last child that starts before `pos`.\n    childBefore(pos) { return this.enterChild(-1, pos, -2 /* Side.Before */); }\n    /// Move the cursor to the child around `pos`. If side is -1 the\n    /// child may end at that position, when 1 it may start there. This\n    /// will also enter [overlaid](#common.MountedTree.overlay)\n    /// [mounted](#common.NodeProp^mounted) trees unless `overlays` is\n    /// set to false.\n    enter(pos, side, mode = this.mode) {\n        if (!this.buffer)\n            return this.yield(this._tree.enter(pos, side, mode));\n        return mode & IterMode.ExcludeBuffers ? false : this.enterChild(1, pos, side);\n    }\n    /// Move to the node's parent node, if this isn't the top node.\n    parent() {\n        if (!this.buffer)\n            return this.yieldNode((this.mode & IterMode.IncludeAnonymous) ? this._tree._parent : this._tree.parent);\n        if (this.stack.length)\n            return this.yieldBuf(this.stack.pop());\n        let parent = (this.mode & IterMode.IncludeAnonymous) ? this.buffer.parent : this.buffer.parent.nextSignificantParent();\n        this.buffer = null;\n        return this.yieldNode(parent);\n    }\n    /// @internal\n    sibling(dir) {\n        if (!this.buffer)\n            return !this._tree._parent ? false\n                : this.yield(this._tree.index < 0 ? null\n                    : this._tree._parent.nextChild(this._tree.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode));\n        let { buffer } = this.buffer, d = this.stack.length - 1;\n        if (dir < 0) {\n            let parentStart = d < 0 ? 0 : this.stack[d] + 4;\n            if (this.index != parentStart)\n                return this.yieldBuf(buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n        }\n        else {\n            let after = buffer.buffer[this.index + 3];\n            if (after < (d < 0 ? buffer.buffer.length : buffer.buffer[this.stack[d] + 3]))\n                return this.yieldBuf(after);\n        }\n        return d < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode)) : false;\n    }\n    /// Move to this node's next sibling, if any.\n    nextSibling() { return this.sibling(1); }\n    /// Move to this node's previous sibling, if any.\n    prevSibling() { return this.sibling(-1); }\n    atLastNode(dir) {\n        let index, parent, { buffer } = this;\n        if (buffer) {\n            if (dir > 0) {\n                if (this.index < buffer.buffer.buffer.length)\n                    return false;\n            }\n            else {\n                for (let i = 0; i < this.index; i++)\n                    if (buffer.buffer.buffer[i + 3] < this.index)\n                        return false;\n            }\n            ({ index, parent } = buffer);\n        }\n        else {\n            ({ index, _parent: parent } = this._tree);\n        }\n        for (; parent; { index, _parent: parent } = parent) {\n            if (index > -1)\n                for (let i = index + dir, e = dir < 0 ? -1 : parent._tree.children.length; i != e; i += dir) {\n                    let child = parent._tree.children[i];\n                    if ((this.mode & IterMode.IncludeAnonymous) ||\n                        child instanceof TreeBuffer ||\n                        !child.type.isAnonymous ||\n                        hasChild(child))\n                        return false;\n                }\n        }\n        return true;\n    }\n    move(dir, enter) {\n        if (enter && this.enterChild(dir, 0, 4 /* Side.DontCare */))\n            return true;\n        for (;;) {\n            if (this.sibling(dir))\n                return true;\n            if (this.atLastNode(dir) || !this.parent())\n                return false;\n        }\n    }\n    /// Move to the next node in a\n    /// [pre-order](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order,_NLR)\n    /// traversal, going from a node to its first child or, if the\n    /// current node is empty or `enter` is false, its next sibling or\n    /// the next sibling of the first parent node that has one.\n    next(enter = true) { return this.move(1, enter); }\n    /// Move to the next node in a last-to-first pre-order traveral. A\n    /// node is followed by its last child or, if it has none, its\n    /// previous sibling or the previous sibling of the first parent\n    /// node that has one.\n    prev(enter = true) { return this.move(-1, enter); }\n    /// Move the cursor to the innermost node that covers `pos`. If\n    /// `side` is -1, it will enter nodes that end at `pos`. If it is 1,\n    /// it will enter nodes that start at `pos`.\n    moveTo(pos, side = 0) {\n        // Move up to a node that actually holds the position, if possible\n        while (this.from == this.to ||\n            (side < 1 ? this.from >= pos : this.from > pos) ||\n            (side > -1 ? this.to <= pos : this.to < pos))\n            if (!this.parent())\n                break;\n        // Then scan down into child nodes as far as possible\n        while (this.enterChild(1, pos, side)) { }\n        return this;\n    }\n    /// Get a [syntax node](#common.SyntaxNode) at the cursor's current\n    /// position.\n    get node() {\n        if (!this.buffer)\n            return this._tree;\n        let cache = this.bufferNode, result = null, depth = 0;\n        if (cache && cache.context == this.buffer) {\n            scan: for (let index = this.index, d = this.stack.length; d >= 0;) {\n                for (let c = cache; c; c = c._parent)\n                    if (c.index == index) {\n                        if (index == this.index)\n                            return c;\n                        result = c;\n                        depth = d + 1;\n                        break scan;\n                    }\n                index = this.stack[--d];\n            }\n        }\n        for (let i = depth; i < this.stack.length; i++)\n            result = new BufferNode(this.buffer, result, this.stack[i]);\n        return this.bufferNode = new BufferNode(this.buffer, result, this.index);\n    }\n    /// Get the [tree](#common.Tree) that represents the current node, if\n    /// any. Will return null when the node is in a [tree\n    /// buffer](#common.TreeBuffer).\n    get tree() {\n        return this.buffer ? null : this._tree._tree;\n    }\n    /// Iterate over the current node and all its descendants, calling\n    /// `enter` when entering a node and `leave`, if given, when leaving\n    /// one. When `enter` returns `false`, any children of that node are\n    /// skipped, and `leave` isn't called for it.\n    iterate(enter, leave) {\n        for (let depth = 0;;) {\n            let mustLeave = false;\n            if (this.type.isAnonymous || enter(this) !== false) {\n                if (this.firstChild()) {\n                    depth++;\n                    continue;\n                }\n                if (!this.type.isAnonymous)\n                    mustLeave = true;\n            }\n            for (;;) {\n                if (mustLeave && leave)\n                    leave(this);\n                mustLeave = this.type.isAnonymous;\n                if (this.nextSibling())\n                    break;\n                if (!depth)\n                    return;\n                this.parent();\n                depth--;\n                mustLeave = true;\n            }\n        }\n    }\n    /// Test whether the current node matches a given context\u2014a sequence\n    /// of direct parent node names. Empty strings in the context array\n    /// are treated as wildcards.\n    matchContext(context) {\n        if (!this.buffer)\n            return matchNodeContext(this.node, context);\n        let { buffer } = this.buffer, { types } = buffer.set;\n        for (let i = context.length - 1, d = this.stack.length - 1; i >= 0; d--) {\n            if (d < 0)\n                return matchNodeContext(this.node, context, i);\n            let type = types[buffer.buffer[this.stack[d]]];\n            if (!type.isAnonymous) {\n                if (context[i] && context[i] != type.name)\n                    return false;\n                i--;\n            }\n        }\n        return true;\n    }\n}\nfunction hasChild(tree) {\n    return tree.children.some(ch => ch instanceof TreeBuffer || !ch.type.isAnonymous || hasChild(ch));\n}\nfunction buildTree(data) {\n    var _a;\n    let { buffer, nodeSet, maxBufferLength = DefaultBufferLength, reused = [], minRepeatType = nodeSet.types.length } = data;\n    let cursor = Array.isArray(buffer) ? new FlatBufferCursor(buffer, buffer.length) : buffer;\n    let types = nodeSet.types;\n    let contextHash = 0, lookAhead = 0;\n    function takeNode(parentStart, minPos, children, positions, inRepeat) {\n        let { id, start, end, size } = cursor;\n        let lookAheadAtStart = lookAhead;\n        while (size < 0) {\n            cursor.next();\n            if (size == -1 /* SpecialRecord.Reuse */) {\n                let node = reused[id];\n                children.push(node);\n                positions.push(start - parentStart);\n                return;\n            }\n            else if (size == -3 /* SpecialRecord.ContextChange */) { // Context change\n                contextHash = id;\n                return;\n            }\n            else if (size == -4 /* SpecialRecord.LookAhead */) {\n                lookAhead = id;\n                return;\n            }\n            else {\n                throw new RangeError(`Unrecognized record size: ${size}`);\n            }\n        }\n        let type = types[id], node, buffer;\n        let startPos = start - parentStart;\n        if (end - start <= maxBufferLength && (buffer = findBufferSize(cursor.pos - minPos, inRepeat))) {\n            // Small enough for a buffer, and no reused nodes inside\n            let data = new Uint16Array(buffer.size - buffer.skip);\n            let endPos = cursor.pos - buffer.size, index = data.length;\n            while (cursor.pos > endPos)\n                index = copyToBuffer(buffer.start, data, index);\n            node = new TreeBuffer(data, end - buffer.start, nodeSet);\n            startPos = buffer.start - parentStart;\n        }\n        else { // Make it a node\n            let endPos = cursor.pos - size;\n            cursor.next();\n            let localChildren = [], localPositions = [];\n            let localInRepeat = id >= minRepeatType ? id : -1;\n            let lastGroup = 0, lastEnd = end;\n            while (cursor.pos > endPos) {\n                if (localInRepeat >= 0 && cursor.id == localInRepeat && cursor.size >= 0) {\n                    if (cursor.end <= lastEnd - maxBufferLength) {\n                        makeRepeatLeaf(localChildren, localPositions, start, lastGroup, cursor.end, lastEnd, localInRepeat, lookAheadAtStart);\n                        lastGroup = localChildren.length;\n                        lastEnd = cursor.end;\n                    }\n                    cursor.next();\n                }\n                else {\n                    takeNode(start, endPos, localChildren, localPositions, localInRepeat);\n                }\n            }\n            if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length)\n                makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart);\n            localChildren.reverse();\n            localPositions.reverse();\n            if (localInRepeat > -1 && lastGroup > 0) {\n                let make = makeBalanced(type);\n                node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);\n            }\n            else {\n                node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end);\n            }\n        }\n        children.push(node);\n        positions.push(startPos);\n    }\n    function makeBalanced(type) {\n        return (children, positions, length) => {\n            let lookAhead = 0, lastI = children.length - 1, last, lookAheadProp;\n            if (lastI >= 0 && (last = children[lastI]) instanceof Tree) {\n                if (!lastI && last.type == type && last.length == length)\n                    return last;\n                if (lookAheadProp = last.prop(NodeProp.lookAhead))\n                    lookAhead = positions[lastI] + last.length + lookAheadProp;\n            }\n            return makeTree(type, children, positions, length, lookAhead);\n        };\n    }\n    function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead) {\n        let localChildren = [], localPositions = [];\n        while (children.length > i) {\n            localChildren.push(children.pop());\n            localPositions.push(positions.pop() + base - from);\n        }\n        children.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead - to));\n        positions.push(from - base);\n    }\n    function makeTree(type, children, positions, length, lookAhead = 0, props) {\n        if (contextHash) {\n            let pair = [NodeProp.contextHash, contextHash];\n            props = props ? [pair].concat(props) : [pair];\n        }\n        if (lookAhead > 25) {\n            let pair = [NodeProp.lookAhead, lookAhead];\n            props = props ? [pair].concat(props) : [pair];\n        }\n        return new Tree(type, children, positions, length, props);\n    }\n    function findBufferSize(maxSize, inRepeat) {\n        // Scan through the buffer to find previous siblings that fit\n        // together in a TreeBuffer, and don't contain any reused nodes\n        // (which can't be stored in a buffer).\n        // If `inRepeat` is > -1, ignore node boundaries of that type for\n        // nesting, but make sure the end falls either at the start\n        // (`maxSize`) or before such a node.\n        let fork = cursor.fork();\n        let size = 0, start = 0, skip = 0, minStart = fork.end - maxBufferLength;\n        let result = { size: 0, start: 0, skip: 0 };\n        scan: for (let minPos = fork.pos - maxSize; fork.pos > minPos;) {\n            let nodeSize = fork.size;\n            // Pretend nested repeat nodes of the same type don't exist\n            if (fork.id == inRepeat && nodeSize >= 0) {\n                // Except that we store the current state as a valid return\n                // value.\n                result.size = size;\n                result.start = start;\n                result.skip = skip;\n                skip += 4;\n                size += 4;\n                fork.next();\n                continue;\n            }\n            let startPos = fork.pos - nodeSize;\n            if (nodeSize < 0 || startPos < minPos || fork.start < minStart)\n                break;\n            let localSkipped = fork.id >= minRepeatType ? 4 : 0;\n            let nodeStart = fork.start;\n            fork.next();\n            while (fork.pos > startPos) {\n                if (fork.size < 0) {\n                    if (fork.size == -3 /* SpecialRecord.ContextChange */)\n                        localSkipped += 4;\n                    else\n                        break scan;\n                }\n                else if (fork.id >= minRepeatType) {\n                    localSkipped += 4;\n                }\n                fork.next();\n            }\n            start = nodeStart;\n            size += nodeSize;\n            skip += localSkipped;\n        }\n        if (inRepeat < 0 || size == maxSize) {\n            result.size = size;\n            result.start = start;\n            result.skip = skip;\n        }\n        return result.size > 4 ? result : undefined;\n    }\n    function copyToBuffer(bufferStart, buffer, index) {\n        let { id, start, end, size } = cursor;\n        cursor.next();\n        if (size >= 0 && id < minRepeatType) {\n            let startIndex = index;\n            if (size > 4) {\n                let endPos = cursor.pos - (size - 4);\n                while (cursor.pos > endPos)\n                    index = copyToBuffer(bufferStart, buffer, index);\n            }\n            buffer[--index] = startIndex;\n            buffer[--index] = end - bufferStart;\n            buffer[--index] = start - bufferStart;\n            buffer[--index] = id;\n        }\n        else if (size == -3 /* SpecialRecord.ContextChange */) {\n            contextHash = id;\n        }\n        else if (size == -4 /* SpecialRecord.LookAhead */) {\n            lookAhead = id;\n        }\n        return index;\n    }\n    let children = [], positions = [];\n    while (cursor.pos > 0)\n        takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1);\n    let length = (_a = data.length) !== null && _a !== void 0 ? _a : (children.length ? positions[0] + children[0].length : 0);\n    return new Tree(types[data.topID], children.reverse(), positions.reverse(), length);\n}\nconst nodeSizeCache = new WeakMap;\nfunction nodeSize(balanceType, node) {\n    if (!balanceType.isAnonymous || node instanceof TreeBuffer || node.type != balanceType)\n        return 1;\n    let size = nodeSizeCache.get(node);\n    if (size == null) {\n        size = 1;\n        for (let child of node.children) {\n            if (child.type != balanceType || !(child instanceof Tree)) {\n                size = 1;\n                break;\n            }\n            size += nodeSize(balanceType, child);\n        }\n        nodeSizeCache.set(node, size);\n    }\n    return size;\n}\nfunction balanceRange(\n// The type the balanced tree's inner nodes.\nbalanceType, \n// The direct children and their positions\nchildren, positions, \n// The index range in children/positions to use\nfrom, to, \n// The start position of the nodes, relative to their parent.\nstart, \n// Length of the outer node\nlength, \n// Function to build the top node of the balanced tree\nmkTop, \n// Function to build internal nodes for the balanced tree\nmkTree) {\n    let total = 0;\n    for (let i = from; i < to; i++)\n        total += nodeSize(balanceType, children[i]);\n    let maxChild = Math.ceil((total * 1.5) / 8 /* Balance.BranchFactor */);\n    let localChildren = [], localPositions = [];\n    function divide(children, positions, from, to, offset) {\n        for (let i = from; i < to;) {\n            let groupFrom = i, groupStart = positions[i], groupSize = nodeSize(balanceType, children[i]);\n            i++;\n            for (; i < to; i++) {\n                let nextSize = nodeSize(balanceType, children[i]);\n                if (groupSize + nextSize >= maxChild)\n                    break;\n                groupSize += nextSize;\n            }\n            if (i == groupFrom + 1) {\n                if (groupSize > maxChild) {\n                    let only = children[groupFrom]; // Only trees can have a size > 1\n                    divide(only.children, only.positions, 0, only.children.length, positions[groupFrom] + offset);\n                    continue;\n                }\n                localChildren.push(children[groupFrom]);\n            }\n            else {\n                let length = positions[i - 1] + children[i - 1].length - groupStart;\n                localChildren.push(balanceRange(balanceType, children, positions, groupFrom, i, groupStart, length, null, mkTree));\n            }\n            localPositions.push(groupStart + offset - start);\n        }\n    }\n    divide(children, positions, from, to, 0);\n    return (mkTop || mkTree)(localChildren, localPositions, length);\n}\n/// Provides a way to associate values with pieces of trees. As long\n/// as that part of the tree is reused, the associated values can be\n/// retrieved from an updated tree.\nclass NodeWeakMap {\n    constructor() {\n        this.map = new WeakMap();\n    }\n    setBuffer(buffer, index, value) {\n        let inner = this.map.get(buffer);\n        if (!inner)\n            this.map.set(buffer, inner = new Map);\n        inner.set(index, value);\n    }\n    getBuffer(buffer, index) {\n        let inner = this.map.get(buffer);\n        return inner && inner.get(index);\n    }\n    /// Set the value for this syntax node.\n    set(node, value) {\n        if (node instanceof BufferNode)\n            this.setBuffer(node.context.buffer, node.index, value);\n        else if (node instanceof TreeNode)\n            this.map.set(node.tree, value);\n    }\n    /// Retrieve value for this syntax node, if it exists in the map.\n    get(node) {\n        return node instanceof BufferNode ? this.getBuffer(node.context.buffer, node.index)\n            : node instanceof TreeNode ? this.map.get(node.tree) : undefined;\n    }\n    /// Set the value for the node that a cursor currently points to.\n    cursorSet(cursor, value) {\n        if (cursor.buffer)\n            this.setBuffer(cursor.buffer.buffer, cursor.index, value);\n        else\n            this.map.set(cursor.tree, value);\n    }\n    /// Retrieve the value for the node that a cursor currently points\n    /// to.\n    cursorGet(cursor) {\n        return cursor.buffer ? this.getBuffer(cursor.buffer.buffer, cursor.index) : this.map.get(cursor.tree);\n    }\n}\n\n/// Tree fragments are used during [incremental\n/// parsing](#common.Parser.startParse) to track parts of old trees\n/// that can be reused in a new parse. An array of fragments is used\n/// to track regions of an old tree whose nodes might be reused in new\n/// parses. Use the static\n/// [`applyChanges`](#common.TreeFragment^applyChanges) method to\n/// update fragments for document changes.\nclass TreeFragment {\n    /// Construct a tree fragment. You'll usually want to use\n    /// [`addTree`](#common.TreeFragment^addTree) and\n    /// [`applyChanges`](#common.TreeFragment^applyChanges) instead of\n    /// calling this directly.\n    constructor(\n    /// The start of the unchanged range pointed to by this fragment.\n    /// This refers to an offset in the _updated_ document (as opposed\n    /// to the original tree).\n    from, \n    /// The end of the unchanged range.\n    to, \n    /// The tree that this fragment is based on.\n    tree, \n    /// The offset between the fragment's tree and the document that\n    /// this fragment can be used against. Add this when going from\n    /// document to tree positions, subtract it to go from tree to\n    /// document positions.\n    offset, openStart = false, openEnd = false) {\n        this.from = from;\n        this.to = to;\n        this.tree = tree;\n        this.offset = offset;\n        this.open = (openStart ? 1 /* Open.Start */ : 0) | (openEnd ? 2 /* Open.End */ : 0);\n    }\n    /// Whether the start of the fragment represents the start of a\n    /// parse, or the end of a change. (In the second case, it may not\n    /// be safe to reuse some nodes at the start, depending on the\n    /// parsing algorithm.)\n    get openStart() { return (this.open & 1 /* Open.Start */) > 0; }\n    /// Whether the end of the fragment represents the end of a\n    /// full-document parse, or the start of a change.\n    get openEnd() { return (this.open & 2 /* Open.End */) > 0; }\n    /// Create a set of fragments from a freshly parsed tree, or update\n    /// an existing set of fragments by replacing the ones that overlap\n    /// with a tree with content from the new tree. When `partial` is\n    /// true, the parse is treated as incomplete, and the resulting\n    /// fragment has [`openEnd`](#common.TreeFragment.openEnd) set to\n    /// true.\n    static addTree(tree, fragments = [], partial = false) {\n        let result = [new TreeFragment(0, tree.length, tree, 0, false, partial)];\n        for (let f of fragments)\n            if (f.to > tree.length)\n                result.push(f);\n        return result;\n    }\n    /// Apply a set of edits to an array of fragments, removing or\n    /// splitting fragments as necessary to remove edited ranges, and\n    /// adjusting offsets for fragments that moved.\n    static applyChanges(fragments, changes, minGap = 128) {\n        if (!changes.length)\n            return fragments;\n        let result = [];\n        let fI = 1, nextF = fragments.length ? fragments[0] : null;\n        for (let cI = 0, pos = 0, off = 0;; cI++) {\n            let nextC = cI < changes.length ? changes[cI] : null;\n            let nextPos = nextC ? nextC.fromA : 1e9;\n            if (nextPos - pos >= minGap)\n                while (nextF && nextF.from < nextPos) {\n                    let cut = nextF;\n                    if (pos >= cut.from || nextPos <= cut.to || off) {\n                        let fFrom = Math.max(cut.from, pos) - off, fTo = Math.min(cut.to, nextPos) - off;\n                        cut = fFrom >= fTo ? null : new TreeFragment(fFrom, fTo, cut.tree, cut.offset + off, cI > 0, !!nextC);\n                    }\n                    if (cut)\n                        result.push(cut);\n                    if (nextF.to > nextPos)\n                        break;\n                    nextF = fI < fragments.length ? fragments[fI++] : null;\n                }\n            if (!nextC)\n                break;\n            pos = nextC.toA;\n            off = nextC.toA - nextC.toB;\n        }\n        return result;\n    }\n}\n/// A superclass that parsers should extend.\nclass Parser {\n    /// Start a parse, returning a [partial parse](#common.PartialParse)\n    /// object. [`fragments`](#common.TreeFragment) can be passed in to\n    /// make the parse incremental.\n    ///\n    /// By default, the entire input is parsed. You can pass `ranges`,\n    /// which should be a sorted array of non-empty, non-overlapping\n    /// ranges, to parse only those ranges. The tree returned in that\n    /// case will start at `ranges[0].from`.\n    startParse(input, fragments, ranges) {\n        if (typeof input == \"string\")\n            input = new StringInput(input);\n        ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map(r => new Range(r.from, r.to)) : [new Range(0, 0)];\n        return this.createParse(input, fragments || [], ranges);\n    }\n    /// Run a full parse, returning the resulting tree.\n    parse(input, fragments, ranges) {\n        let parse = this.startParse(input, fragments, ranges);\n        for (;;) {\n            let done = parse.advance();\n            if (done)\n                return done;\n        }\n    }\n}\nclass StringInput {\n    constructor(string) {\n        this.string = string;\n    }\n    get length() { return this.string.length; }\n    chunk(from) { return this.string.slice(from); }\n    get lineChunks() { return false; }\n    read(from, to) { return this.string.slice(from, to); }\n}\n\n/// Create a parse wrapper that, after the inner parse completes,\n/// scans its tree for mixed language regions with the `nest`\n/// function, runs the resulting [inner parses](#common.NestedParse),\n/// and then [mounts](#common.NodeProp^mounted) their results onto the\n/// tree.\nfunction parseMixed(nest) {\n    return (parse, input, fragments, ranges) => new MixedParse(parse, nest, input, fragments, ranges);\n}\nclass InnerParse {\n    constructor(parser, parse, overlay, target, ranges) {\n        this.parser = parser;\n        this.parse = parse;\n        this.overlay = overlay;\n        this.target = target;\n        this.ranges = ranges;\n        if (!ranges.length || ranges.some(r => r.from >= r.to))\n            throw new RangeError(\"Invalid inner parse ranges given: \" + JSON.stringify(ranges));\n    }\n}\nclass ActiveOverlay {\n    constructor(parser, predicate, mounts, index, start, target, prev) {\n        this.parser = parser;\n        this.predicate = predicate;\n        this.mounts = mounts;\n        this.index = index;\n        this.start = start;\n        this.target = target;\n        this.prev = prev;\n        this.depth = 0;\n        this.ranges = [];\n    }\n}\nconst stoppedInner = new NodeProp({ perNode: true });\nclass MixedParse {\n    constructor(base, nest, input, fragments, ranges) {\n        this.nest = nest;\n        this.input = input;\n        this.fragments = fragments;\n        this.ranges = ranges;\n        this.inner = [];\n        this.innerDone = 0;\n        this.baseTree = null;\n        this.stoppedAt = null;\n        this.baseParse = base;\n    }\n    advance() {\n        if (this.baseParse) {\n            let done = this.baseParse.advance();\n            if (!done)\n                return null;\n            this.baseParse = null;\n            this.baseTree = done;\n            this.startInner();\n            if (this.stoppedAt != null)\n                for (let inner of this.inner)\n                    inner.parse.stopAt(this.stoppedAt);\n        }\n        if (this.innerDone == this.inner.length) {\n            let result = this.baseTree;\n            if (this.stoppedAt != null)\n                result = new Tree(result.type, result.children, result.positions, result.length, result.propValues.concat([[stoppedInner, this.stoppedAt]]));\n            return result;\n        }\n        let inner = this.inner[this.innerDone], done = inner.parse.advance();\n        if (done) {\n            this.innerDone++;\n            // This is a somewhat dodgy but super helpful hack where we\n            // patch up nodes created by the inner parse (and thus\n            // presumably not aliased anywhere else) to hold the information\n            // about the inner parse.\n            let props = Object.assign(Object.create(null), inner.target.props);\n            props[NodeProp.mounted.id] = new MountedTree(done, inner.overlay, inner.parser);\n            inner.target.props = props;\n        }\n        return null;\n    }\n    get parsedPos() {\n        if (this.baseParse)\n            return 0;\n        let pos = this.input.length;\n        for (let i = this.innerDone; i < this.inner.length; i++) {\n            if (this.inner[i].ranges[0].from < pos)\n                pos = Math.min(pos, this.inner[i].parse.parsedPos);\n        }\n        return pos;\n    }\n    stopAt(pos) {\n        this.stoppedAt = pos;\n        if (this.baseParse)\n            this.baseParse.stopAt(pos);\n        else\n            for (let i = this.innerDone; i < this.inner.length; i++)\n                this.inner[i].parse.stopAt(pos);\n    }\n    startInner() {\n        let fragmentCursor = new FragmentCursor(this.fragments);\n        let overlay = null;\n        let covered = null;\n        let cursor = new TreeCursor(new TreeNode(this.baseTree, this.ranges[0].from, 0, null), IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n        scan: for (let nest, isCovered; this.stoppedAt == null || cursor.from < this.stoppedAt;) {\n            let enter = true, range;\n            if (fragmentCursor.hasNode(cursor)) {\n                if (overlay) {\n                    let match = overlay.mounts.find(m => m.frag.from <= cursor.from && m.frag.to >= cursor.to && m.mount.overlay);\n                    if (match)\n                        for (let r of match.mount.overlay) {\n                            let from = r.from + match.pos, to = r.to + match.pos;\n                            if (from >= cursor.from && to <= cursor.to && !overlay.ranges.some(r => r.from < to && r.to > from))\n                                overlay.ranges.push({ from, to });\n                        }\n                }\n                enter = false;\n            }\n            else if (covered && (isCovered = checkCover(covered.ranges, cursor.from, cursor.to))) {\n                enter = isCovered != 2 /* Cover.Full */;\n            }\n            else if (!cursor.type.isAnonymous && cursor.from < cursor.to && (nest = this.nest(cursor, this.input))) {\n                if (!cursor.tree)\n                    materialize(cursor);\n                let oldMounts = fragmentCursor.findMounts(cursor.from, nest.parser);\n                if (typeof nest.overlay == \"function\") {\n                    overlay = new ActiveOverlay(nest.parser, nest.overlay, oldMounts, this.inner.length, cursor.from, cursor.tree, overlay);\n                }\n                else {\n                    let ranges = punchRanges(this.ranges, nest.overlay || [new Range(cursor.from, cursor.to)]);\n                    if (ranges.length)\n                        this.inner.push(new InnerParse(nest.parser, nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, cursor.tree, ranges));\n                    if (!nest.overlay)\n                        enter = false;\n                    else if (ranges.length)\n                        covered = { ranges, depth: 0, prev: covered };\n                }\n            }\n            else if (overlay && (range = overlay.predicate(cursor))) {\n                if (range === true)\n                    range = new Range(cursor.from, cursor.to);\n                if (range.from < range.to)\n                    overlay.ranges.push(range);\n            }\n            if (enter && cursor.firstChild()) {\n                if (overlay)\n                    overlay.depth++;\n                if (covered)\n                    covered.depth++;\n            }\n            else {\n                for (;;) {\n                    if (cursor.nextSibling())\n                        break;\n                    if (!cursor.parent())\n                        break scan;\n                    if (overlay && !--overlay.depth) {\n                        let ranges = punchRanges(this.ranges, overlay.ranges);\n                        if (ranges.length)\n                            this.inner.splice(overlay.index, 0, new InnerParse(overlay.parser, overlay.parser.startParse(this.input, enterFragments(overlay.mounts, ranges), ranges), overlay.ranges.map(r => new Range(r.from - overlay.start, r.to - overlay.start)), overlay.target, ranges));\n                        overlay = overlay.prev;\n                    }\n                    if (covered && !--covered.depth)\n                        covered = covered.prev;\n                }\n            }\n        }\n    }\n}\nfunction checkCover(covered, from, to) {\n    for (let range of covered) {\n        if (range.from >= to)\n            break;\n        if (range.to > from)\n            return range.from <= from && range.to >= to ? 2 /* Cover.Full */ : 1 /* Cover.Partial */;\n    }\n    return 0 /* Cover.None */;\n}\n// Take a piece of buffer and convert it into a stand-alone\n// TreeBuffer.\nfunction sliceBuf(buf, startI, endI, nodes, positions, off) {\n    if (startI < endI) {\n        let from = buf.buffer[startI + 1];\n        nodes.push(buf.slice(startI, endI, from));\n        positions.push(from - off);\n    }\n}\n// This function takes a node that's in a buffer, and converts it, and\n// its parent buffer nodes, into a Tree. This is again acting on the\n// assumption that the trees and buffers have been constructed by the\n// parse that was ran via the mix parser, and thus aren't shared with\n// any other code, making violations of the immutability safe.\nfunction materialize(cursor) {\n    let { node } = cursor, depth = 0;\n    // Scan up to the nearest tree\n    do {\n        cursor.parent();\n        depth++;\n    } while (!cursor.tree);\n    // Find the index of the buffer in that tree\n    let i = 0, base = cursor.tree, off = 0;\n    for (;; i++) {\n        off = base.positions[i] + cursor.from;\n        if (off <= node.from && off + base.children[i].length >= node.to)\n            break;\n    }\n    let buf = base.children[i], b = buf.buffer;\n    // Split a level in the buffer, putting the nodes before and after\n    // the child that contains `node` into new buffers.\n    function split(startI, endI, type, innerOffset, length) {\n        let i = startI;\n        while (b[i + 2] + off <= node.from)\n            i = b[i + 3];\n        let children = [], positions = [];\n        sliceBuf(buf, startI, i, children, positions, innerOffset);\n        let from = b[i + 1], to = b[i + 2];\n        let isTarget = from + off == node.from && to + off == node.to && b[i] == node.type.id;\n        children.push(isTarget ? node.toTree() : split(i + 4, b[i + 3], buf.set.types[b[i]], from, to - from));\n        positions.push(from - innerOffset);\n        sliceBuf(buf, b[i + 3], endI, children, positions, innerOffset);\n        return new Tree(type, children, positions, length);\n    }\n    base.children[i] = split(0, b.length, NodeType.none, 0, buf.length);\n    // Move the cursor back to the target node\n    for (let d = 0; d <= depth; d++)\n        cursor.childAfter(node.from);\n}\nclass StructureCursor {\n    constructor(root, offset) {\n        this.offset = offset;\n        this.done = false;\n        this.cursor = root.cursor(IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n    }\n    // Move to the first node (in pre-order) that starts at or after `pos`.\n    moveTo(pos) {\n        let { cursor } = this, p = pos - this.offset;\n        while (!this.done && cursor.from < p) {\n            if (cursor.to >= pos && cursor.enter(p, 1, IterMode.IgnoreOverlays | IterMode.ExcludeBuffers)) ;\n            else if (!cursor.next(false))\n                this.done = true;\n        }\n    }\n    hasNode(cursor) {\n        this.moveTo(cursor.from);\n        if (!this.done && this.cursor.from + this.offset == cursor.from && this.cursor.tree) {\n            for (let tree = this.cursor.tree;;) {\n                if (tree == cursor.tree)\n                    return true;\n                if (tree.children.length && tree.positions[0] == 0 && tree.children[0] instanceof Tree)\n                    tree = tree.children[0];\n                else\n                    break;\n            }\n        }\n        return false;\n    }\n}\nclass FragmentCursor {\n    constructor(fragments) {\n        var _a;\n        this.fragments = fragments;\n        this.curTo = 0;\n        this.fragI = 0;\n        if (fragments.length) {\n            let first = this.curFrag = fragments[0];\n            this.curTo = (_a = first.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : first.to;\n            this.inner = new StructureCursor(first.tree, -first.offset);\n        }\n        else {\n            this.curFrag = this.inner = null;\n        }\n    }\n    hasNode(node) {\n        while (this.curFrag && node.from >= this.curTo)\n            this.nextFrag();\n        return this.curFrag && this.curFrag.from <= node.from && this.curTo >= node.to && this.inner.hasNode(node);\n    }\n    nextFrag() {\n        var _a;\n        this.fragI++;\n        if (this.fragI == this.fragments.length) {\n            this.curFrag = this.inner = null;\n        }\n        else {\n            let frag = this.curFrag = this.fragments[this.fragI];\n            this.curTo = (_a = frag.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : frag.to;\n            this.inner = new StructureCursor(frag.tree, -frag.offset);\n        }\n    }\n    findMounts(pos, parser) {\n        var _a;\n        let result = [];\n        if (this.inner) {\n            this.inner.cursor.moveTo(pos, 1);\n            for (let pos = this.inner.cursor.node; pos; pos = pos.parent) {\n                let mount = (_a = pos.tree) === null || _a === void 0 ? void 0 : _a.prop(NodeProp.mounted);\n                if (mount && mount.parser == parser) {\n                    for (let i = this.fragI; i < this.fragments.length; i++) {\n                        let frag = this.fragments[i];\n                        if (frag.from >= pos.to)\n                            break;\n                        if (frag.tree == this.curFrag.tree)\n                            result.push({\n                                frag,\n                                pos: pos.from - frag.offset,\n                                mount\n                            });\n                    }\n                }\n            }\n        }\n        return result;\n    }\n}\nfunction punchRanges(outer, ranges) {\n    let copy = null, current = ranges;\n    for (let i = 1, j = 0; i < outer.length; i++) {\n        let gapFrom = outer[i - 1].to, gapTo = outer[i].from;\n        for (; j < current.length; j++) {\n            let r = current[j];\n            if (r.from >= gapTo)\n                break;\n            if (r.to <= gapFrom)\n                continue;\n            if (!copy)\n                current = copy = ranges.slice();\n            if (r.from < gapFrom) {\n                copy[j] = new Range(r.from, gapFrom);\n                if (r.to > gapTo)\n                    copy.splice(j + 1, 0, new Range(gapTo, r.to));\n            }\n            else if (r.to > gapTo) {\n                copy[j--] = new Range(gapTo, r.to);\n            }\n            else {\n                copy.splice(j--, 1);\n            }\n        }\n    }\n    return current;\n}\nfunction findCoverChanges(a, b, from, to) {\n    let iA = 0, iB = 0, inA = false, inB = false, pos = -1e9;\n    let result = [];\n    for (;;) {\n        let nextA = iA == a.length ? 1e9 : inA ? a[iA].to : a[iA].from;\n        let nextB = iB == b.length ? 1e9 : inB ? b[iB].to : b[iB].from;\n        if (inA != inB) {\n            let start = Math.max(pos, from), end = Math.min(nextA, nextB, to);\n            if (start < end)\n                result.push(new Range(start, end));\n        }\n        pos = Math.min(nextA, nextB);\n        if (pos == 1e9)\n            break;\n        if (nextA == pos) {\n            if (!inA)\n                inA = true;\n            else {\n                inA = false;\n                iA++;\n            }\n        }\n        if (nextB == pos) {\n            if (!inB)\n                inB = true;\n            else {\n                inB = false;\n                iB++;\n            }\n        }\n    }\n    return result;\n}\n// Given a number of fragments for the outer tree, and a set of ranges\n// to parse, find fragments for inner trees mounted around those\n// ranges, if any.\nfunction enterFragments(mounts, ranges) {\n    let result = [];\n    for (let { pos, mount, frag } of mounts) {\n        let startPos = pos + (mount.overlay ? mount.overlay[0].from : 0), endPos = startPos + mount.tree.length;\n        let from = Math.max(frag.from, startPos), to = Math.min(frag.to, endPos);\n        if (mount.overlay) {\n            let overlay = mount.overlay.map(r => new Range(r.from + pos, r.to + pos));\n            let changes = findCoverChanges(ranges, overlay, from, to);\n            for (let i = 0, pos = from;; i++) {\n                let last = i == changes.length, end = last ? to : changes[i].from;\n                if (end > pos)\n                    result.push(new TreeFragment(pos, end, mount.tree, -startPos, frag.from >= pos || frag.openStart, frag.to <= end || frag.openEnd));\n                if (last)\n                    break;\n                pos = changes[i].to;\n            }\n        }\n        else {\n            result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos || frag.openStart, frag.to <= endPos || frag.openEnd));\n        }\n    }\n    return result;\n}\n\nexport { DefaultBufferLength, IterMode, MountedTree, NodeProp, NodeSet, NodeType, NodeWeakMap, Parser, Tree, TreeBuffer, TreeCursor, TreeFragment, parseMixed };\n", "import { Parser, NodeProp, NodeSet, NodeType, DefaultBufferLength, Tree, IterMode } from '@lezer/common';\n\n/// A parse stack. These are used internally by the parser to track\n/// parsing progress. They also provide some properties and methods\n/// that external code such as a tokenizer can use to get information\n/// about the parse state.\nclass Stack {\n    /// @internal\n    constructor(\n    /// The parse that this stack is part of @internal\n    p, \n    /// Holds state, input pos, buffer index triplets for all but the\n    /// top state @internal\n    stack, \n    /// The current parse state @internal\n    state, \n    // The position at which the next reduce should take place. This\n    // can be less than `this.pos` when skipped expressions have been\n    // added to the stack (which should be moved outside of the next\n    // reduction)\n    /// @internal\n    reducePos, \n    /// The input position up to which this stack has parsed.\n    pos, \n    /// The dynamic score of the stack, including dynamic precedence\n    /// and error-recovery penalties\n    /// @internal\n    score, \n    // The output buffer. Holds (type, start, end, size) quads\n    // representing nodes created by the parser, where `size` is\n    // amount of buffer array entries covered by this node.\n    /// @internal\n    buffer, \n    // The base offset of the buffer. When stacks are split, the split\n    // instance shared the buffer history with its parent up to\n    // `bufferBase`, which is the absolute offset (including the\n    // offset of previous splits) into the buffer at which this stack\n    // starts writing.\n    /// @internal\n    bufferBase, \n    /// @internal\n    curContext, \n    /// @internal\n    lookAhead = 0, \n    // A parent stack from which this was split off, if any. This is\n    // set up so that it always points to a stack that has some\n    // additional buffer content, never to a stack with an equal\n    // `bufferBase`.\n    /// @internal\n    parent) {\n        this.p = p;\n        this.stack = stack;\n        this.state = state;\n        this.reducePos = reducePos;\n        this.pos = pos;\n        this.score = score;\n        this.buffer = buffer;\n        this.bufferBase = bufferBase;\n        this.curContext = curContext;\n        this.lookAhead = lookAhead;\n        this.parent = parent;\n    }\n    /// @internal\n    toString() {\n        return `[${this.stack.filter((_, i) => i % 3 == 0).concat(this.state)}]@${this.pos}${this.score ? \"!\" + this.score : \"\"}`;\n    }\n    // Start an empty stack\n    /// @internal\n    static start(p, state, pos = 0) {\n        let cx = p.parser.context;\n        return new Stack(p, [], state, pos, pos, 0, [], 0, cx ? new StackContext(cx, cx.start) : null, 0, null);\n    }\n    /// The stack's current [context](#lr.ContextTracker) value, if\n    /// any. Its type will depend on the context tracker's type\n    /// parameter, or it will be `null` if there is no context\n    /// tracker.\n    get context() { return this.curContext ? this.curContext.context : null; }\n    // Push a state onto the stack, tracking its start position as well\n    // as the buffer base at that point.\n    /// @internal\n    pushState(state, start) {\n        this.stack.push(this.state, start, this.bufferBase + this.buffer.length);\n        this.state = state;\n    }\n    // Apply a reduce action\n    /// @internal\n    reduce(action) {\n        var _a;\n        let depth = action >> 19 /* Action.ReduceDepthShift */, type = action & 65535 /* Action.ValueMask */;\n        let { parser } = this.p;\n        let dPrec = parser.dynamicPrecedence(type);\n        if (dPrec)\n            this.score += dPrec;\n        if (depth == 0) {\n            this.pushState(parser.getGoto(this.state, type, true), this.reducePos);\n            // Zero-depth reductions are a special case\u2014they add stuff to\n            // the stack without popping anything off.\n            if (type < parser.minRepeatTerm)\n                this.storeNode(type, this.reducePos, this.reducePos, 4, true);\n            this.reduceContext(type, this.reducePos);\n            return;\n        }\n        // Find the base index into `this.stack`, content after which will\n        // be dropped. Note that with `StayFlag` reductions we need to\n        // consume two extra frames (the dummy parent node for the skipped\n        // expression and the state that we'll be staying in, which should\n        // be moved to `this.state`).\n        let base = this.stack.length - ((depth - 1) * 3) - (action & 262144 /* Action.StayFlag */ ? 6 : 0);\n        let start = base ? this.stack[base - 2] : this.p.ranges[0].from, size = this.reducePos - start;\n        // This is a kludge to try and detect overly deep left-associative\n        // trees, which will not increase the parse stack depth and thus\n        // won't be caught by the regular stack-depth limit check.\n        if (size >= 2000 /* Recover.MinBigReduction */ && !((_a = this.p.parser.nodeSet.types[type]) === null || _a === void 0 ? void 0 : _a.isAnonymous)) {\n            if (start == this.p.lastBigReductionStart) {\n                this.p.bigReductionCount++;\n                this.p.lastBigReductionSize = size;\n            }\n            else if (this.p.lastBigReductionSize < size) {\n                this.p.bigReductionCount = 1;\n                this.p.lastBigReductionStart = start;\n                this.p.lastBigReductionSize = size;\n            }\n        }\n        let bufferBase = base ? this.stack[base - 1] : 0, count = this.bufferBase + this.buffer.length - bufferBase;\n        // Store normal terms or `R -> R R` repeat reductions\n        if (type < parser.minRepeatTerm || (action & 131072 /* Action.RepeatFlag */)) {\n            let pos = parser.stateFlag(this.state, 1 /* StateFlag.Skipped */) ? this.pos : this.reducePos;\n            this.storeNode(type, start, pos, count + 4, true);\n        }\n        if (action & 262144 /* Action.StayFlag */) {\n            this.state = this.stack[base];\n        }\n        else {\n            let baseStateID = this.stack[base - 3];\n            this.state = parser.getGoto(baseStateID, type, true);\n        }\n        while (this.stack.length > base)\n            this.stack.pop();\n        this.reduceContext(type, start);\n    }\n    // Shift a value into the buffer\n    /// @internal\n    storeNode(term, start, end, size = 4, isReduce = false) {\n        if (term == 0 /* Term.Err */ &&\n            (!this.stack.length || this.stack[this.stack.length - 1] < this.buffer.length + this.bufferBase)) {\n            // Try to omit/merge adjacent error nodes\n            let cur = this, top = this.buffer.length;\n            if (top == 0 && cur.parent) {\n                top = cur.bufferBase - cur.parent.bufferBase;\n                cur = cur.parent;\n            }\n            if (top > 0 && cur.buffer[top - 4] == 0 /* Term.Err */ && cur.buffer[top - 1] > -1) {\n                if (start == end)\n                    return;\n                if (cur.buffer[top - 2] >= start) {\n                    cur.buffer[top - 2] = end;\n                    return;\n                }\n            }\n        }\n        if (!isReduce || this.pos == end) { // Simple case, just append\n            this.buffer.push(term, start, end, size);\n        }\n        else { // There may be skipped nodes that have to be moved forward\n            let index = this.buffer.length;\n            if (index > 0 && this.buffer[index - 4] != 0 /* Term.Err */)\n                while (index > 0 && this.buffer[index - 2] > end) {\n                    // Move this record forward\n                    this.buffer[index] = this.buffer[index - 4];\n                    this.buffer[index + 1] = this.buffer[index - 3];\n                    this.buffer[index + 2] = this.buffer[index - 2];\n                    this.buffer[index + 3] = this.buffer[index - 1];\n                    index -= 4;\n                    if (size > 4)\n                        size -= 4;\n                }\n            this.buffer[index] = term;\n            this.buffer[index + 1] = start;\n            this.buffer[index + 2] = end;\n            this.buffer[index + 3] = size;\n        }\n    }\n    // Apply a shift action\n    /// @internal\n    shift(action, next, nextEnd) {\n        let start = this.pos;\n        if (action & 131072 /* Action.GotoFlag */) {\n            this.pushState(action & 65535 /* Action.ValueMask */, this.pos);\n        }\n        else if ((action & 262144 /* Action.StayFlag */) == 0) { // Regular shift\n            let nextState = action, { parser } = this.p;\n            if (nextEnd > this.pos || next <= parser.maxNode) {\n                this.pos = nextEnd;\n                if (!parser.stateFlag(nextState, 1 /* StateFlag.Skipped */))\n                    this.reducePos = nextEnd;\n            }\n            this.pushState(nextState, start);\n            this.shiftContext(next, start);\n            if (next <= parser.maxNode)\n                this.buffer.push(next, start, nextEnd, 4);\n        }\n        else { // Shift-and-stay, which means this is a skipped token\n            this.pos = nextEnd;\n            this.shiftContext(next, start);\n            if (next <= this.p.parser.maxNode)\n                this.buffer.push(next, start, nextEnd, 4);\n        }\n    }\n    // Apply an action\n    /// @internal\n    apply(action, next, nextEnd) {\n        if (action & 65536 /* Action.ReduceFlag */)\n            this.reduce(action);\n        else\n            this.shift(action, next, nextEnd);\n    }\n    // Add a prebuilt (reused) node into the buffer.\n    /// @internal\n    useNode(value, next) {\n        let index = this.p.reused.length - 1;\n        if (index < 0 || this.p.reused[index] != value) {\n            this.p.reused.push(value);\n            index++;\n        }\n        let start = this.pos;\n        this.reducePos = this.pos = start + value.length;\n        this.pushState(next, start);\n        this.buffer.push(index, start, this.reducePos, -1 /* size == -1 means this is a reused value */);\n        if (this.curContext)\n            this.updateContext(this.curContext.tracker.reuse(this.curContext.context, value, this, this.p.stream.reset(this.pos - value.length)));\n    }\n    // Split the stack. Due to the buffer sharing and the fact\n    // that `this.stack` tends to stay quite shallow, this isn't very\n    // expensive.\n    /// @internal\n    split() {\n        let parent = this;\n        let off = parent.buffer.length;\n        // Because the top of the buffer (after this.pos) may be mutated\n        // to reorder reductions and skipped tokens, and shared buffers\n        // should be immutable, this copies any outstanding skipped tokens\n        // to the new buffer, and puts the base pointer before them.\n        while (off > 0 && parent.buffer[off - 2] > parent.reducePos)\n            off -= 4;\n        let buffer = parent.buffer.slice(off), base = parent.bufferBase + off;\n        // Make sure parent points to an actual parent with content, if there is such a parent.\n        while (parent && base == parent.bufferBase)\n            parent = parent.parent;\n        return new Stack(this.p, this.stack.slice(), this.state, this.reducePos, this.pos, this.score, buffer, base, this.curContext, this.lookAhead, parent);\n    }\n    // Try to recover from an error by 'deleting' (ignoring) one token.\n    /// @internal\n    recoverByDelete(next, nextEnd) {\n        let isNode = next <= this.p.parser.maxNode;\n        if (isNode)\n            this.storeNode(next, this.pos, nextEnd, 4);\n        this.storeNode(0 /* Term.Err */, this.pos, nextEnd, isNode ? 8 : 4);\n        this.pos = this.reducePos = nextEnd;\n        this.score -= 190 /* Recover.Delete */;\n    }\n    /// Check if the given term would be able to be shifted (optionally\n    /// after some reductions) on this stack. This can be useful for\n    /// external tokenizers that want to make sure they only provide a\n    /// given token when it applies.\n    canShift(term) {\n        for (let sim = new SimulatedStack(this);;) {\n            let action = this.p.parser.stateSlot(sim.state, 4 /* ParseState.DefaultReduce */) || this.p.parser.hasAction(sim.state, term);\n            if (action == 0)\n                return false;\n            if ((action & 65536 /* Action.ReduceFlag */) == 0)\n                return true;\n            sim.reduce(action);\n        }\n    }\n    // Apply up to Recover.MaxNext recovery actions that conceptually\n    // inserts some missing token or rule.\n    /// @internal\n    recoverByInsert(next) {\n        if (this.stack.length >= 300 /* Recover.MaxInsertStackDepth */)\n            return [];\n        let nextStates = this.p.parser.nextStates(this.state);\n        if (nextStates.length > 4 /* Recover.MaxNext */ << 1 || this.stack.length >= 120 /* Recover.DampenInsertStackDepth */) {\n            let best = [];\n            for (let i = 0, s; i < nextStates.length; i += 2) {\n                if ((s = nextStates[i + 1]) != this.state && this.p.parser.hasAction(s, next))\n                    best.push(nextStates[i], s);\n            }\n            if (this.stack.length < 120 /* Recover.DampenInsertStackDepth */)\n                for (let i = 0; best.length < 4 /* Recover.MaxNext */ << 1 && i < nextStates.length; i += 2) {\n                    let s = nextStates[i + 1];\n                    if (!best.some((v, i) => (i & 1) && v == s))\n                        best.push(nextStates[i], s);\n                }\n            nextStates = best;\n        }\n        let result = [];\n        for (let i = 0; i < nextStates.length && result.length < 4 /* Recover.MaxNext */; i += 2) {\n            let s = nextStates[i + 1];\n            if (s == this.state)\n                continue;\n            let stack = this.split();\n            stack.pushState(s, this.pos);\n            stack.storeNode(0 /* Term.Err */, stack.pos, stack.pos, 4, true);\n            stack.shiftContext(nextStates[i], this.pos);\n            stack.score -= 200 /* Recover.Insert */;\n            result.push(stack);\n        }\n        return result;\n    }\n    // Force a reduce, if possible. Return false if that can't\n    // be done.\n    /// @internal\n    forceReduce() {\n        let { parser } = this.p;\n        let reduce = parser.stateSlot(this.state, 5 /* ParseState.ForcedReduce */);\n        if ((reduce & 65536 /* Action.ReduceFlag */) == 0)\n            return false;\n        if (!parser.validAction(this.state, reduce)) {\n            let depth = reduce >> 19 /* Action.ReduceDepthShift */, term = reduce & 65535 /* Action.ValueMask */;\n            let target = this.stack.length - depth * 3;\n            if (target < 0 || parser.getGoto(this.stack[target], term, false) < 0) {\n                let backup = this.findForcedReduction();\n                if (backup == null)\n                    return false;\n                reduce = backup;\n            }\n            this.storeNode(0 /* Term.Err */, this.pos, this.pos, 4, true);\n            this.score -= 100 /* Recover.Reduce */;\n        }\n        this.reducePos = this.pos;\n        this.reduce(reduce);\n        return true;\n    }\n    /// Try to scan through the automaton to find some kind of reduction\n    /// that can be applied. Used when the regular ForcedReduce field\n    /// isn't a valid action. @internal\n    findForcedReduction() {\n        let { parser } = this.p, seen = [];\n        let explore = (state, depth) => {\n            if (seen.includes(state))\n                return;\n            seen.push(state);\n            return parser.allActions(state, (action) => {\n                if (action & (262144 /* Action.StayFlag */ | 131072 /* Action.GotoFlag */)) ;\n                else if (action & 65536 /* Action.ReduceFlag */) {\n                    let rDepth = (action >> 19 /* Action.ReduceDepthShift */) - depth;\n                    if (rDepth > 1) {\n                        let term = action & 65535 /* Action.ValueMask */, target = this.stack.length - rDepth * 3;\n                        if (target >= 0 && parser.getGoto(this.stack[target], term, false) >= 0)\n                            return (rDepth << 19 /* Action.ReduceDepthShift */) | 65536 /* Action.ReduceFlag */ | term;\n                    }\n                }\n                else {\n                    let found = explore(action, depth + 1);\n                    if (found != null)\n                        return found;\n                }\n            });\n        };\n        return explore(this.state, 0);\n    }\n    /// @internal\n    forceAll() {\n        while (!this.p.parser.stateFlag(this.state, 2 /* StateFlag.Accepting */)) {\n            if (!this.forceReduce()) {\n                this.storeNode(0 /* Term.Err */, this.pos, this.pos, 4, true);\n                break;\n            }\n        }\n        return this;\n    }\n    /// Check whether this state has no further actions (assumed to be a direct descendant of the\n    /// top state, since any other states must be able to continue\n    /// somehow). @internal\n    get deadEnd() {\n        if (this.stack.length != 3)\n            return false;\n        let { parser } = this.p;\n        return parser.data[parser.stateSlot(this.state, 1 /* ParseState.Actions */)] == 65535 /* Seq.End */ &&\n            !parser.stateSlot(this.state, 4 /* ParseState.DefaultReduce */);\n    }\n    /// Restart the stack (put it back in its start state). Only safe\n    /// when this.stack.length == 3 (state is directly below the top\n    /// state). @internal\n    restart() {\n        this.state = this.stack[0];\n        this.stack.length = 0;\n    }\n    /// @internal\n    sameState(other) {\n        if (this.state != other.state || this.stack.length != other.stack.length)\n            return false;\n        for (let i = 0; i < this.stack.length; i += 3)\n            if (this.stack[i] != other.stack[i])\n                return false;\n        return true;\n    }\n    /// Get the parser used by this stack.\n    get parser() { return this.p.parser; }\n    /// Test whether a given dialect (by numeric ID, as exported from\n    /// the terms file) is enabled.\n    dialectEnabled(dialectID) { return this.p.parser.dialect.flags[dialectID]; }\n    shiftContext(term, start) {\n        if (this.curContext)\n            this.updateContext(this.curContext.tracker.shift(this.curContext.context, term, this, this.p.stream.reset(start)));\n    }\n    reduceContext(term, start) {\n        if (this.curContext)\n            this.updateContext(this.curContext.tracker.reduce(this.curContext.context, term, this, this.p.stream.reset(start)));\n    }\n    /// @internal\n    emitContext() {\n        let last = this.buffer.length - 1;\n        if (last < 0 || this.buffer[last] != -3)\n            this.buffer.push(this.curContext.hash, this.pos, this.pos, -3);\n    }\n    /// @internal\n    emitLookAhead() {\n        let last = this.buffer.length - 1;\n        if (last < 0 || this.buffer[last] != -4)\n            this.buffer.push(this.lookAhead, this.pos, this.pos, -4);\n    }\n    updateContext(context) {\n        if (context != this.curContext.context) {\n            let newCx = new StackContext(this.curContext.tracker, context);\n            if (newCx.hash != this.curContext.hash)\n                this.emitContext();\n            this.curContext = newCx;\n        }\n    }\n    /// @internal\n    setLookAhead(lookAhead) {\n        if (lookAhead > this.lookAhead) {\n            this.emitLookAhead();\n            this.lookAhead = lookAhead;\n        }\n    }\n    /// @internal\n    close() {\n        if (this.curContext && this.curContext.tracker.strict)\n            this.emitContext();\n        if (this.lookAhead > 0)\n            this.emitLookAhead();\n    }\n}\nclass StackContext {\n    constructor(tracker, context) {\n        this.tracker = tracker;\n        this.context = context;\n        this.hash = tracker.strict ? tracker.hash(context) : 0;\n    }\n}\nvar Recover;\n(function (Recover) {\n    Recover[Recover[\"Insert\"] = 200] = \"Insert\";\n    Recover[Recover[\"Delete\"] = 190] = \"Delete\";\n    Recover[Recover[\"Reduce\"] = 100] = \"Reduce\";\n    Recover[Recover[\"MaxNext\"] = 4] = \"MaxNext\";\n    Recover[Recover[\"MaxInsertStackDepth\"] = 300] = \"MaxInsertStackDepth\";\n    Recover[Recover[\"DampenInsertStackDepth\"] = 120] = \"DampenInsertStackDepth\";\n    Recover[Recover[\"MinBigReduction\"] = 2000] = \"MinBigReduction\";\n})(Recover || (Recover = {}));\n// Used to cheaply run some reductions to scan ahead without mutating\n// an entire stack\nclass SimulatedStack {\n    constructor(start) {\n        this.start = start;\n        this.state = start.state;\n        this.stack = start.stack;\n        this.base = this.stack.length;\n    }\n    reduce(action) {\n        let term = action & 65535 /* Action.ValueMask */, depth = action >> 19 /* Action.ReduceDepthShift */;\n        if (depth == 0) {\n            if (this.stack == this.start.stack)\n                this.stack = this.stack.slice();\n            this.stack.push(this.state, 0, 0);\n            this.base += 3;\n        }\n        else {\n            this.base -= (depth - 1) * 3;\n        }\n        let goto = this.start.p.parser.getGoto(this.stack[this.base - 3], term, true);\n        this.state = goto;\n    }\n}\n// This is given to `Tree.build` to build a buffer, and encapsulates\n// the parent-stack-walking necessary to read the nodes.\nclass StackBufferCursor {\n    constructor(stack, pos, index) {\n        this.stack = stack;\n        this.pos = pos;\n        this.index = index;\n        this.buffer = stack.buffer;\n        if (this.index == 0)\n            this.maybeNext();\n    }\n    static create(stack, pos = stack.bufferBase + stack.buffer.length) {\n        return new StackBufferCursor(stack, pos, pos - stack.bufferBase);\n    }\n    maybeNext() {\n        let next = this.stack.parent;\n        if (next != null) {\n            this.index = this.stack.bufferBase - next.bufferBase;\n            this.stack = next;\n            this.buffer = next.buffer;\n        }\n    }\n    get id() { return this.buffer[this.index - 4]; }\n    get start() { return this.buffer[this.index - 3]; }\n    get end() { return this.buffer[this.index - 2]; }\n    get size() { return this.buffer[this.index - 1]; }\n    next() {\n        this.index -= 4;\n        this.pos -= 4;\n        if (this.index == 0)\n            this.maybeNext();\n    }\n    fork() {\n        return new StackBufferCursor(this.stack, this.pos, this.index);\n    }\n}\n\n// See lezer-generator/src/encode.ts for comments about the encoding\n// used here\nfunction decodeArray(input, Type = Uint16Array) {\n    if (typeof input != \"string\")\n        return input;\n    let array = null;\n    for (let pos = 0, out = 0; pos < input.length;) {\n        let value = 0;\n        for (;;) {\n            let next = input.charCodeAt(pos++), stop = false;\n            if (next == 126 /* Encode.BigValCode */) {\n                value = 65535 /* Encode.BigVal */;\n                break;\n            }\n            if (next >= 92 /* Encode.Gap2 */)\n                next--;\n            if (next >= 34 /* Encode.Gap1 */)\n                next--;\n            let digit = next - 32 /* Encode.Start */;\n            if (digit >= 46 /* Encode.Base */) {\n                digit -= 46 /* Encode.Base */;\n                stop = true;\n            }\n            value += digit;\n            if (stop)\n                break;\n            value *= 46 /* Encode.Base */;\n        }\n        if (array)\n            array[out++] = value;\n        else\n            array = new Type(value);\n    }\n    return array;\n}\n\nclass CachedToken {\n    constructor() {\n        this.start = -1;\n        this.value = -1;\n        this.end = -1;\n        this.extended = -1;\n        this.lookAhead = 0;\n        this.mask = 0;\n        this.context = 0;\n    }\n}\nconst nullToken = new CachedToken;\n/// [Tokenizers](#lr.ExternalTokenizer) interact with the input\n/// through this interface. It presents the input as a stream of\n/// characters, tracking lookahead and hiding the complexity of\n/// [ranges](#common.Parser.parse^ranges) from tokenizer code.\nclass InputStream {\n    /// @internal\n    constructor(\n    /// @internal\n    input, \n    /// @internal\n    ranges) {\n        this.input = input;\n        this.ranges = ranges;\n        /// @internal\n        this.chunk = \"\";\n        /// @internal\n        this.chunkOff = 0;\n        /// Backup chunk\n        this.chunk2 = \"\";\n        this.chunk2Pos = 0;\n        /// The character code of the next code unit in the input, or -1\n        /// when the stream is at the end of the input.\n        this.next = -1;\n        /// @internal\n        this.token = nullToken;\n        this.rangeIndex = 0;\n        this.pos = this.chunkPos = ranges[0].from;\n        this.range = ranges[0];\n        this.end = ranges[ranges.length - 1].to;\n        this.readNext();\n    }\n    /// @internal\n    resolveOffset(offset, assoc) {\n        let range = this.range, index = this.rangeIndex;\n        let pos = this.pos + offset;\n        while (pos < range.from) {\n            if (!index)\n                return null;\n            let next = this.ranges[--index];\n            pos -= range.from - next.to;\n            range = next;\n        }\n        while (assoc < 0 ? pos > range.to : pos >= range.to) {\n            if (index == this.ranges.length - 1)\n                return null;\n            let next = this.ranges[++index];\n            pos += next.from - range.to;\n            range = next;\n        }\n        return pos;\n    }\n    /// @internal\n    clipPos(pos) {\n        if (pos >= this.range.from && pos < this.range.to)\n            return pos;\n        for (let range of this.ranges)\n            if (range.to > pos)\n                return Math.max(pos, range.from);\n        return this.end;\n    }\n    /// Look at a code unit near the stream position. `.peek(0)` equals\n    /// `.next`, `.peek(-1)` gives you the previous character, and so\n    /// on.\n    ///\n    /// Note that looking around during tokenizing creates dependencies\n    /// on potentially far-away content, which may reduce the\n    /// effectiveness incremental parsing\u2014when looking forward\u2014or even\n    /// cause invalid reparses when looking backward more than 25 code\n    /// units, since the library does not track lookbehind.\n    peek(offset) {\n        let idx = this.chunkOff + offset, pos, result;\n        if (idx >= 0 && idx < this.chunk.length) {\n            pos = this.pos + offset;\n            result = this.chunk.charCodeAt(idx);\n        }\n        else {\n            let resolved = this.resolveOffset(offset, 1);\n            if (resolved == null)\n                return -1;\n            pos = resolved;\n            if (pos >= this.chunk2Pos && pos < this.chunk2Pos + this.chunk2.length) {\n                result = this.chunk2.charCodeAt(pos - this.chunk2Pos);\n            }\n            else {\n                let i = this.rangeIndex, range = this.range;\n                while (range.to <= pos)\n                    range = this.ranges[++i];\n                this.chunk2 = this.input.chunk(this.chunk2Pos = pos);\n                if (pos + this.chunk2.length > range.to)\n                    this.chunk2 = this.chunk2.slice(0, range.to - pos);\n                result = this.chunk2.charCodeAt(0);\n            }\n        }\n        if (pos >= this.token.lookAhead)\n            this.token.lookAhead = pos + 1;\n        return result;\n    }\n    /// Accept a token. By default, the end of the token is set to the\n    /// current stream position, but you can pass an offset (relative to\n    /// the stream position) to change that.\n    acceptToken(token, endOffset = 0) {\n        let end = endOffset ? this.resolveOffset(endOffset, -1) : this.pos;\n        if (end == null || end < this.token.start)\n            throw new RangeError(\"Token end out of bounds\");\n        this.token.value = token;\n        this.token.end = end;\n    }\n    getChunk() {\n        if (this.pos >= this.chunk2Pos && this.pos < this.chunk2Pos + this.chunk2.length) {\n            let { chunk, chunkPos } = this;\n            this.chunk = this.chunk2;\n            this.chunkPos = this.chunk2Pos;\n            this.chunk2 = chunk;\n            this.chunk2Pos = chunkPos;\n            this.chunkOff = this.pos - this.chunkPos;\n        }\n        else {\n            this.chunk2 = this.chunk;\n            this.chunk2Pos = this.chunkPos;\n            let nextChunk = this.input.chunk(this.pos);\n            let end = this.pos + nextChunk.length;\n            this.chunk = end > this.range.to ? nextChunk.slice(0, this.range.to - this.pos) : nextChunk;\n            this.chunkPos = this.pos;\n            this.chunkOff = 0;\n        }\n    }\n    readNext() {\n        if (this.chunkOff >= this.chunk.length) {\n            this.getChunk();\n            if (this.chunkOff == this.chunk.length)\n                return this.next = -1;\n        }\n        return this.next = this.chunk.charCodeAt(this.chunkOff);\n    }\n    /// Move the stream forward N (defaults to 1) code units. Returns\n    /// the new value of [`next`](#lr.InputStream.next).\n    advance(n = 1) {\n        this.chunkOff += n;\n        while (this.pos + n >= this.range.to) {\n            if (this.rangeIndex == this.ranges.length - 1)\n                return this.setDone();\n            n -= this.range.to - this.pos;\n            this.range = this.ranges[++this.rangeIndex];\n            this.pos = this.range.from;\n        }\n        this.pos += n;\n        if (this.pos >= this.token.lookAhead)\n            this.token.lookAhead = this.pos + 1;\n        return this.readNext();\n    }\n    setDone() {\n        this.pos = this.chunkPos = this.end;\n        this.range = this.ranges[this.rangeIndex = this.ranges.length - 1];\n        this.chunk = \"\";\n        return this.next = -1;\n    }\n    /// @internal\n    reset(pos, token) {\n        if (token) {\n            this.token = token;\n            token.start = pos;\n            token.lookAhead = pos + 1;\n            token.value = token.extended = -1;\n        }\n        else {\n            this.token = nullToken;\n        }\n        if (this.pos != pos) {\n            this.pos = pos;\n            if (pos == this.end) {\n                this.setDone();\n                return this;\n            }\n            while (pos < this.range.from)\n                this.range = this.ranges[--this.rangeIndex];\n            while (pos >= this.range.to)\n                this.range = this.ranges[++this.rangeIndex];\n            if (pos >= this.chunkPos && pos < this.chunkPos + this.chunk.length) {\n                this.chunkOff = pos - this.chunkPos;\n            }\n            else {\n                this.chunk = \"\";\n                this.chunkOff = 0;\n            }\n            this.readNext();\n        }\n        return this;\n    }\n    /// @internal\n    read(from, to) {\n        if (from >= this.chunkPos && to <= this.chunkPos + this.chunk.length)\n            return this.chunk.slice(from - this.chunkPos, to - this.chunkPos);\n        if (from >= this.chunk2Pos && to <= this.chunk2Pos + this.chunk2.length)\n            return this.chunk2.slice(from - this.chunk2Pos, to - this.chunk2Pos);\n        if (from >= this.range.from && to <= this.range.to)\n            return this.input.read(from, to);\n        let result = \"\";\n        for (let r of this.ranges) {\n            if (r.from >= to)\n                break;\n            if (r.to > from)\n                result += this.input.read(Math.max(r.from, from), Math.min(r.to, to));\n        }\n        return result;\n    }\n}\n/// @internal\nclass TokenGroup {\n    constructor(data, id) {\n        this.data = data;\n        this.id = id;\n    }\n    token(input, stack) {\n        let { parser } = stack.p;\n        readToken(this.data, input, stack, this.id, parser.data, parser.tokenPrecTable);\n    }\n}\nTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;\n/// @hide\nclass LocalTokenGroup {\n    constructor(data, precTable, elseToken) {\n        this.precTable = precTable;\n        this.elseToken = elseToken;\n        this.data = typeof data == \"string\" ? decodeArray(data) : data;\n    }\n    token(input, stack) {\n        let start = input.pos, skipped = 0;\n        for (;;) {\n            let atEof = input.next < 0, nextPos = input.resolveOffset(1, 1);\n            readToken(this.data, input, stack, 0, this.data, this.precTable);\n            if (input.token.value > -1)\n                break;\n            if (this.elseToken == null)\n                return;\n            if (!atEof)\n                skipped++;\n            if (nextPos == null)\n                break;\n            input.reset(nextPos, input.token);\n        }\n        if (skipped) {\n            input.reset(start, input.token);\n            input.acceptToken(this.elseToken, skipped);\n        }\n    }\n}\nLocalTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;\n/// `@external tokens` declarations in the grammar should resolve to\n/// an instance of this class.\nclass ExternalTokenizer {\n    /// Create a tokenizer. The first argument is the function that,\n    /// given an input stream, scans for the types of tokens it\n    /// recognizes at the stream's position, and calls\n    /// [`acceptToken`](#lr.InputStream.acceptToken) when it finds\n    /// one.\n    constructor(\n    /// @internal\n    token, options = {}) {\n        this.token = token;\n        this.contextual = !!options.contextual;\n        this.fallback = !!options.fallback;\n        this.extend = !!options.extend;\n    }\n}\n// Tokenizer data is stored a big uint16 array containing, for each\n// state:\n//\n//  - A group bitmask, indicating what token groups are reachable from\n//    this state, so that paths that can only lead to tokens not in\n//    any of the current groups can be cut off early.\n//\n//  - The position of the end of the state's sequence of accepting\n//    tokens\n//\n//  - The number of outgoing edges for the state\n//\n//  - The accepting tokens, as (token id, group mask) pairs\n//\n//  - The outgoing edges, as (start character, end character, state\n//    index) triples, with end character being exclusive\n//\n// This function interprets that data, running through a stream as\n// long as new states with the a matching group mask can be reached,\n// and updating `input.token` when it matches a token.\nfunction readToken(data, input, stack, group, precTable, precOffset) {\n    let state = 0, groupMask = 1 << group, { dialect } = stack.p.parser;\n    scan: for (;;) {\n        if ((groupMask & data[state]) == 0)\n            break;\n        let accEnd = data[state + 1];\n        // Check whether this state can lead to a token in the current group\n        // Accept tokens in this state, possibly overwriting\n        // lower-precedence / shorter tokens\n        for (let i = state + 3; i < accEnd; i += 2)\n            if ((data[i + 1] & groupMask) > 0) {\n                let term = data[i];\n                if (dialect.allows(term) &&\n                    (input.token.value == -1 || input.token.value == term ||\n                        overrides(term, input.token.value, precTable, precOffset))) {\n                    input.acceptToken(term);\n                    break;\n                }\n            }\n        let next = input.next, low = 0, high = data[state + 2];\n        // Special case for EOF\n        if (input.next < 0 && high > low && data[accEnd + high * 3 - 3] == 65535 /* Seq.End */ && data[accEnd + high * 3 - 3] == 65535 /* Seq.End */) {\n            state = data[accEnd + high * 3 - 1];\n            continue scan;\n        }\n        // Do a binary search on the state's edges\n        for (; low < high;) {\n            let mid = (low + high) >> 1;\n            let index = accEnd + mid + (mid << 1);\n            let from = data[index], to = data[index + 1] || 0x10000;\n            if (next < from)\n                high = mid;\n            else if (next >= to)\n                low = mid + 1;\n            else {\n                state = data[index + 2];\n                input.advance();\n                continue scan;\n            }\n        }\n        break;\n    }\n}\nfunction findOffset(data, start, term) {\n    for (let i = start, next; (next = data[i]) != 65535 /* Seq.End */; i++)\n        if (next == term)\n            return i - start;\n    return -1;\n}\nfunction overrides(token, prev, tableData, tableOffset) {\n    let iPrev = findOffset(tableData, tableOffset, prev);\n    return iPrev < 0 || findOffset(tableData, tableOffset, token) < iPrev;\n}\n\n// Environment variable used to control console output\nconst verbose = typeof process != \"undefined\" && process.env && /\\bparse\\b/.test(process.env.LOG);\nlet stackIDs = null;\nvar Safety;\n(function (Safety) {\n    Safety[Safety[\"Margin\"] = 25] = \"Margin\";\n})(Safety || (Safety = {}));\nfunction cutAt(tree, pos, side) {\n    let cursor = tree.cursor(IterMode.IncludeAnonymous);\n    cursor.moveTo(pos);\n    for (;;) {\n        if (!(side < 0 ? cursor.childBefore(pos) : cursor.childAfter(pos)))\n            for (;;) {\n                if ((side < 0 ? cursor.to < pos : cursor.from > pos) && !cursor.type.isError)\n                    return side < 0 ? Math.max(0, Math.min(cursor.to - 1, pos - 25 /* Safety.Margin */))\n                        : Math.min(tree.length, Math.max(cursor.from + 1, pos + 25 /* Safety.Margin */));\n                if (side < 0 ? cursor.prevSibling() : cursor.nextSibling())\n                    break;\n                if (!cursor.parent())\n                    return side < 0 ? 0 : tree.length;\n            }\n    }\n}\nclass FragmentCursor {\n    constructor(fragments, nodeSet) {\n        this.fragments = fragments;\n        this.nodeSet = nodeSet;\n        this.i = 0;\n        this.fragment = null;\n        this.safeFrom = -1;\n        this.safeTo = -1;\n        this.trees = [];\n        this.start = [];\n        this.index = [];\n        this.nextFragment();\n    }\n    nextFragment() {\n        let fr = this.fragment = this.i == this.fragments.length ? null : this.fragments[this.i++];\n        if (fr) {\n            this.safeFrom = fr.openStart ? cutAt(fr.tree, fr.from + fr.offset, 1) - fr.offset : fr.from;\n            this.safeTo = fr.openEnd ? cutAt(fr.tree, fr.to + fr.offset, -1) - fr.offset : fr.to;\n            while (this.trees.length) {\n                this.trees.pop();\n                this.start.pop();\n                this.index.pop();\n            }\n            this.trees.push(fr.tree);\n            this.start.push(-fr.offset);\n            this.index.push(0);\n            this.nextStart = this.safeFrom;\n        }\n        else {\n            this.nextStart = 1e9;\n        }\n    }\n    // `pos` must be >= any previously given `pos` for this cursor\n    nodeAt(pos) {\n        if (pos < this.nextStart)\n            return null;\n        while (this.fragment && this.safeTo <= pos)\n            this.nextFragment();\n        if (!this.fragment)\n            return null;\n        for (;;) {\n            let last = this.trees.length - 1;\n            if (last < 0) { // End of tree\n                this.nextFragment();\n                return null;\n            }\n            let top = this.trees[last], index = this.index[last];\n            if (index == top.children.length) {\n                this.trees.pop();\n                this.start.pop();\n                this.index.pop();\n                continue;\n            }\n            let next = top.children[index];\n            let start = this.start[last] + top.positions[index];\n            if (start > pos) {\n                this.nextStart = start;\n                return null;\n            }\n            if (next instanceof Tree) {\n                if (start == pos) {\n                    if (start < this.safeFrom)\n                        return null;\n                    let end = start + next.length;\n                    if (end <= this.safeTo) {\n                        let lookAhead = next.prop(NodeProp.lookAhead);\n                        if (!lookAhead || end + lookAhead < this.fragment.to)\n                            return next;\n                    }\n                }\n                this.index[last]++;\n                if (start + next.length >= Math.max(this.safeFrom, pos)) { // Enter this node\n                    this.trees.push(next);\n                    this.start.push(start);\n                    this.index.push(0);\n                }\n            }\n            else {\n                this.index[last]++;\n                this.nextStart = start + next.length;\n            }\n        }\n    }\n}\nclass TokenCache {\n    constructor(parser, stream) {\n        this.stream = stream;\n        this.tokens = [];\n        this.mainToken = null;\n        this.actions = [];\n        this.tokens = parser.tokenizers.map(_ => new CachedToken);\n    }\n    getActions(stack) {\n        let actionIndex = 0;\n        let main = null;\n        let { parser } = stack.p, { tokenizers } = parser;\n        let mask = parser.stateSlot(stack.state, 3 /* ParseState.TokenizerMask */);\n        let context = stack.curContext ? stack.curContext.hash : 0;\n        let lookAhead = 0;\n        for (let i = 0; i < tokenizers.length; i++) {\n            if (((1 << i) & mask) == 0)\n                continue;\n            let tokenizer = tokenizers[i], token = this.tokens[i];\n            if (main && !tokenizer.fallback)\n                continue;\n            if (tokenizer.contextual || token.start != stack.pos || token.mask != mask || token.context != context) {\n                this.updateCachedToken(token, tokenizer, stack);\n                token.mask = mask;\n                token.context = context;\n            }\n            if (token.lookAhead > token.end + 25 /* Safety.Margin */)\n                lookAhead = Math.max(token.lookAhead, lookAhead);\n            if (token.value != 0 /* Term.Err */) {\n                let startIndex = actionIndex;\n                if (token.extended > -1)\n                    actionIndex = this.addActions(stack, token.extended, token.end, actionIndex);\n                actionIndex = this.addActions(stack, token.value, token.end, actionIndex);\n                if (!tokenizer.extend) {\n                    main = token;\n                    if (actionIndex > startIndex)\n                        break;\n                }\n            }\n        }\n        while (this.actions.length > actionIndex)\n            this.actions.pop();\n        if (lookAhead)\n            stack.setLookAhead(lookAhead);\n        if (!main && stack.pos == this.stream.end) {\n            main = new CachedToken;\n            main.value = stack.p.parser.eofTerm;\n            main.start = main.end = stack.pos;\n            actionIndex = this.addActions(stack, main.value, main.end, actionIndex);\n        }\n        this.mainToken = main;\n        return this.actions;\n    }\n    getMainToken(stack) {\n        if (this.mainToken)\n            return this.mainToken;\n        let main = new CachedToken, { pos, p } = stack;\n        main.start = pos;\n        main.end = Math.min(pos + 1, p.stream.end);\n        main.value = pos == p.stream.end ? p.parser.eofTerm : 0 /* Term.Err */;\n        return main;\n    }\n    updateCachedToken(token, tokenizer, stack) {\n        let start = this.stream.clipPos(stack.pos);\n        tokenizer.token(this.stream.reset(start, token), stack);\n        if (token.value > -1) {\n            let { parser } = stack.p;\n            for (let i = 0; i < parser.specialized.length; i++)\n                if (parser.specialized[i] == token.value) {\n                    let result = parser.specializers[i](this.stream.read(token.start, token.end), stack);\n                    if (result >= 0 && stack.p.parser.dialect.allows(result >> 1)) {\n                        if ((result & 1) == 0 /* Specialize.Specialize */)\n                            token.value = result >> 1;\n                        else\n                            token.extended = result >> 1;\n                        break;\n                    }\n                }\n        }\n        else {\n            token.value = 0 /* Term.Err */;\n            token.end = this.stream.clipPos(start + 1);\n        }\n    }\n    putAction(action, token, end, index) {\n        // Don't add duplicate actions\n        for (let i = 0; i < index; i += 3)\n            if (this.actions[i] == action)\n                return index;\n        this.actions[index++] = action;\n        this.actions[index++] = token;\n        this.actions[index++] = end;\n        return index;\n    }\n    addActions(stack, token, end, index) {\n        let { state } = stack, { parser } = stack.p, { data } = parser;\n        for (let set = 0; set < 2; set++) {\n            for (let i = parser.stateSlot(state, set ? 2 /* ParseState.Skip */ : 1 /* ParseState.Actions */);; i += 3) {\n                if (data[i] == 65535 /* Seq.End */) {\n                    if (data[i + 1] == 1 /* Seq.Next */) {\n                        i = pair(data, i + 2);\n                    }\n                    else {\n                        if (index == 0 && data[i + 1] == 2 /* Seq.Other */)\n                            index = this.putAction(pair(data, i + 2), token, end, index);\n                        break;\n                    }\n                }\n                if (data[i] == token)\n                    index = this.putAction(pair(data, i + 1), token, end, index);\n            }\n        }\n        return index;\n    }\n}\nvar Rec;\n(function (Rec) {\n    Rec[Rec[\"Distance\"] = 5] = \"Distance\";\n    Rec[Rec[\"MaxRemainingPerStep\"] = 3] = \"MaxRemainingPerStep\";\n    // When two stacks have been running independently long enough to\n    // add this many elements to their buffers, prune one.\n    Rec[Rec[\"MinBufferLengthPrune\"] = 500] = \"MinBufferLengthPrune\";\n    Rec[Rec[\"ForceReduceLimit\"] = 10] = \"ForceReduceLimit\";\n    // Once a stack reaches this depth (in .stack.length) force-reduce\n    // it back to CutTo to avoid creating trees that overflow the stack\n    // on recursive traversal.\n    Rec[Rec[\"CutDepth\"] = 15000] = \"CutDepth\";\n    Rec[Rec[\"CutTo\"] = 9000] = \"CutTo\";\n    Rec[Rec[\"MaxLeftAssociativeReductionCount\"] = 300] = \"MaxLeftAssociativeReductionCount\";\n    // The maximum number of non-recovering stacks to explore (to avoid\n    // getting bogged down with exponentially multiplying stacks in\n    // ambiguous content)\n    Rec[Rec[\"MaxStackCount\"] = 12] = \"MaxStackCount\";\n})(Rec || (Rec = {}));\nclass Parse {\n    constructor(parser, input, fragments, ranges) {\n        this.parser = parser;\n        this.input = input;\n        this.ranges = ranges;\n        this.recovering = 0;\n        this.nextStackID = 0x2654; // \u2654, \u2655, \u2656, \u2657, \u2658, \u2659, \u2660, \u2661, \u2662, \u2663, \u2664, \u2665, \u2666, \u2667\n        this.minStackPos = 0;\n        this.reused = [];\n        this.stoppedAt = null;\n        this.lastBigReductionStart = -1;\n        this.lastBigReductionSize = 0;\n        this.bigReductionCount = 0;\n        this.stream = new InputStream(input, ranges);\n        this.tokens = new TokenCache(parser, this.stream);\n        this.topTerm = parser.top[1];\n        let { from } = ranges[0];\n        this.stacks = [Stack.start(this, parser.top[0], from)];\n        this.fragments = fragments.length && this.stream.end - from > parser.bufferLength * 4\n            ? new FragmentCursor(fragments, parser.nodeSet) : null;\n    }\n    get parsedPos() {\n        return this.minStackPos;\n    }\n    // Move the parser forward. This will process all parse stacks at\n    // `this.pos` and try to advance them to a further position. If no\n    // stack for such a position is found, it'll start error-recovery.\n    //\n    // When the parse is finished, this will return a syntax tree. When\n    // not, it returns `null`.\n    advance() {\n        let stacks = this.stacks, pos = this.minStackPos;\n        // This will hold stacks beyond `pos`.\n        let newStacks = this.stacks = [];\n        let stopped, stoppedTokens;\n        // If a large amount of reductions happened with the same start\n        // position, force the stack out of that production in order to\n        // avoid creating a tree too deep to recurse through.\n        // (This is an ugly kludge, because unfortunately there is no\n        // straightforward, cheap way to check for this happening, due to\n        // the history of reductions only being available in an\n        // expensive-to-access format in the stack buffers.)\n        if (this.bigReductionCount > 300 /* Rec.MaxLeftAssociativeReductionCount */ && stacks.length == 1) {\n            let [s] = stacks;\n            while (s.forceReduce() && s.stack.length && s.stack[s.stack.length - 2] >= this.lastBigReductionStart) { }\n            this.bigReductionCount = this.lastBigReductionSize = 0;\n        }\n        // Keep advancing any stacks at `pos` until they either move\n        // forward or can't be advanced. Gather stacks that can't be\n        // advanced further in `stopped`.\n        for (let i = 0; i < stacks.length; i++) {\n            let stack = stacks[i];\n            for (;;) {\n                this.tokens.mainToken = null;\n                if (stack.pos > pos) {\n                    newStacks.push(stack);\n                }\n                else if (this.advanceStack(stack, newStacks, stacks)) {\n                    continue;\n                }\n                else {\n                    if (!stopped) {\n                        stopped = [];\n                        stoppedTokens = [];\n                    }\n                    stopped.push(stack);\n                    let tok = this.tokens.getMainToken(stack);\n                    stoppedTokens.push(tok.value, tok.end);\n                }\n                break;\n            }\n        }\n        if (!newStacks.length) {\n            let finished = stopped && findFinished(stopped);\n            if (finished)\n                return this.stackToTree(finished);\n            if (this.parser.strict) {\n                if (verbose && stopped)\n                    console.log(\"Stuck with token \" + (this.tokens.mainToken ? this.parser.getName(this.tokens.mainToken.value) : \"none\"));\n                throw new SyntaxError(\"No parse at \" + pos);\n            }\n            if (!this.recovering)\n                this.recovering = 5 /* Rec.Distance */;\n        }\n        if (this.recovering && stopped) {\n            let finished = this.stoppedAt != null && stopped[0].pos > this.stoppedAt ? stopped[0]\n                : this.runRecovery(stopped, stoppedTokens, newStacks);\n            if (finished)\n                return this.stackToTree(finished.forceAll());\n        }\n        if (this.recovering) {\n            let maxRemaining = this.recovering == 1 ? 1 : this.recovering * 3 /* Rec.MaxRemainingPerStep */;\n            if (newStacks.length > maxRemaining) {\n                newStacks.sort((a, b) => b.score - a.score);\n                while (newStacks.length > maxRemaining)\n                    newStacks.pop();\n            }\n            if (newStacks.some(s => s.reducePos > pos))\n                this.recovering--;\n        }\n        else if (newStacks.length > 1) {\n            // Prune stacks that are in the same state, or that have been\n            // running without splitting for a while, to avoid getting stuck\n            // with multiple successful stacks running endlessly on.\n            outer: for (let i = 0; i < newStacks.length - 1; i++) {\n                let stack = newStacks[i];\n                for (let j = i + 1; j < newStacks.length; j++) {\n                    let other = newStacks[j];\n                    if (stack.sameState(other) ||\n                        stack.buffer.length > 500 /* Rec.MinBufferLengthPrune */ && other.buffer.length > 500 /* Rec.MinBufferLengthPrune */) {\n                        if (((stack.score - other.score) || (stack.buffer.length - other.buffer.length)) > 0) {\n                            newStacks.splice(j--, 1);\n                        }\n                        else {\n                            newStacks.splice(i--, 1);\n                            continue outer;\n                        }\n                    }\n                }\n            }\n            if (newStacks.length > 12 /* Rec.MaxStackCount */)\n                newStacks.splice(12 /* Rec.MaxStackCount */, newStacks.length - 12 /* Rec.MaxStackCount */);\n        }\n        this.minStackPos = newStacks[0].pos;\n        for (let i = 1; i < newStacks.length; i++)\n            if (newStacks[i].pos < this.minStackPos)\n                this.minStackPos = newStacks[i].pos;\n        return null;\n    }\n    stopAt(pos) {\n        if (this.stoppedAt != null && this.stoppedAt < pos)\n            throw new RangeError(\"Can't move stoppedAt forward\");\n        this.stoppedAt = pos;\n    }\n    // Returns an updated version of the given stack, or null if the\n    // stack can't advance normally. When `split` and `stacks` are\n    // given, stacks split off by ambiguous operations will be pushed to\n    // `split`, or added to `stacks` if they move `pos` forward.\n    advanceStack(stack, stacks, split) {\n        let start = stack.pos, { parser } = this;\n        let base = verbose ? this.stackID(stack) + \" -> \" : \"\";\n        if (this.stoppedAt != null && start > this.stoppedAt)\n            return stack.forceReduce() ? stack : null;\n        if (this.fragments) {\n            let strictCx = stack.curContext && stack.curContext.tracker.strict, cxHash = strictCx ? stack.curContext.hash : 0;\n            for (let cached = this.fragments.nodeAt(start); cached;) {\n                let match = this.parser.nodeSet.types[cached.type.id] == cached.type ? parser.getGoto(stack.state, cached.type.id) : -1;\n                if (match > -1 && cached.length && (!strictCx || (cached.prop(NodeProp.contextHash) || 0) == cxHash)) {\n                    stack.useNode(cached, match);\n                    if (verbose)\n                        console.log(base + this.stackID(stack) + ` (via reuse of ${parser.getName(cached.type.id)})`);\n                    return true;\n                }\n                if (!(cached instanceof Tree) || cached.children.length == 0 || cached.positions[0] > 0)\n                    break;\n                let inner = cached.children[0];\n                if (inner instanceof Tree && cached.positions[0] == 0)\n                    cached = inner;\n                else\n                    break;\n            }\n        }\n        let defaultReduce = parser.stateSlot(stack.state, 4 /* ParseState.DefaultReduce */);\n        if (defaultReduce > 0) {\n            stack.reduce(defaultReduce);\n            if (verbose)\n                console.log(base + this.stackID(stack) + ` (via always-reduce ${parser.getName(defaultReduce & 65535 /* Action.ValueMask */)})`);\n            return true;\n        }\n        if (stack.stack.length >= 15000 /* Rec.CutDepth */) {\n            while (stack.stack.length > 9000 /* Rec.CutTo */ && stack.forceReduce()) { }\n        }\n        let actions = this.tokens.getActions(stack);\n        for (let i = 0; i < actions.length;) {\n            let action = actions[i++], term = actions[i++], end = actions[i++];\n            let last = i == actions.length || !split;\n            let localStack = last ? stack : stack.split();\n            localStack.apply(action, term, end);\n            if (verbose)\n                console.log(base + this.stackID(localStack) + ` (via ${(action & 65536 /* Action.ReduceFlag */) == 0 ? \"shift\"\n                    : `reduce of ${parser.getName(action & 65535 /* Action.ValueMask */)}`} for ${parser.getName(term)} @ ${start}${localStack == stack ? \"\" : \", split\"})`);\n            if (last)\n                return true;\n            else if (localStack.pos > start)\n                stacks.push(localStack);\n            else\n                split.push(localStack);\n        }\n        return false;\n    }\n    // Advance a given stack forward as far as it will go. Returns the\n    // (possibly updated) stack if it got stuck, or null if it moved\n    // forward and was given to `pushStackDedup`.\n    advanceFully(stack, newStacks) {\n        let pos = stack.pos;\n        for (;;) {\n            if (!this.advanceStack(stack, null, null))\n                return false;\n            if (stack.pos > pos) {\n                pushStackDedup(stack, newStacks);\n                return true;\n            }\n        }\n    }\n    runRecovery(stacks, tokens, newStacks) {\n        let finished = null, restarted = false;\n        for (let i = 0; i < stacks.length; i++) {\n            let stack = stacks[i], token = tokens[i << 1], tokenEnd = tokens[(i << 1) + 1];\n            let base = verbose ? this.stackID(stack) + \" -> \" : \"\";\n            if (stack.deadEnd) {\n                if (restarted)\n                    continue;\n                restarted = true;\n                stack.restart();\n                if (verbose)\n                    console.log(base + this.stackID(stack) + \" (restarted)\");\n                let done = this.advanceFully(stack, newStacks);\n                if (done)\n                    continue;\n            }\n            let force = stack.split(), forceBase = base;\n            for (let j = 0; force.forceReduce() && j < 10 /* Rec.ForceReduceLimit */; j++) {\n                if (verbose)\n                    console.log(forceBase + this.stackID(force) + \" (via force-reduce)\");\n                let done = this.advanceFully(force, newStacks);\n                if (done)\n                    break;\n                if (verbose)\n                    forceBase = this.stackID(force) + \" -> \";\n            }\n            for (let insert of stack.recoverByInsert(token)) {\n                if (verbose)\n                    console.log(base + this.stackID(insert) + \" (via recover-insert)\");\n                this.advanceFully(insert, newStacks);\n            }\n            if (this.stream.end > stack.pos) {\n                if (tokenEnd == stack.pos) {\n                    tokenEnd++;\n                    token = 0 /* Term.Err */;\n                }\n                stack.recoverByDelete(token, tokenEnd);\n                if (verbose)\n                    console.log(base + this.stackID(stack) + ` (via recover-delete ${this.parser.getName(token)})`);\n                pushStackDedup(stack, newStacks);\n            }\n            else if (!finished || finished.score < stack.score) {\n                finished = stack;\n            }\n        }\n        return finished;\n    }\n    // Convert the stack's buffer to a syntax tree.\n    stackToTree(stack) {\n        stack.close();\n        return Tree.build({ buffer: StackBufferCursor.create(stack),\n            nodeSet: this.parser.nodeSet,\n            topID: this.topTerm,\n            maxBufferLength: this.parser.bufferLength,\n            reused: this.reused,\n            start: this.ranges[0].from,\n            length: stack.pos - this.ranges[0].from,\n            minRepeatType: this.parser.minRepeatTerm });\n    }\n    stackID(stack) {\n        let id = (stackIDs || (stackIDs = new WeakMap)).get(stack);\n        if (!id)\n            stackIDs.set(stack, id = String.fromCodePoint(this.nextStackID++));\n        return id + stack;\n    }\n}\nfunction pushStackDedup(stack, newStacks) {\n    for (let i = 0; i < newStacks.length; i++) {\n        let other = newStacks[i];\n        if (other.pos == stack.pos && other.sameState(stack)) {\n            if (newStacks[i].score < stack.score)\n                newStacks[i] = stack;\n            return;\n        }\n    }\n    newStacks.push(stack);\n}\nclass Dialect {\n    constructor(source, flags, disabled) {\n        this.source = source;\n        this.flags = flags;\n        this.disabled = disabled;\n    }\n    allows(term) { return !this.disabled || this.disabled[term] == 0; }\n}\nconst id = x => x;\n/// Context trackers are used to track stateful context (such as\n/// indentation in the Python grammar, or parent elements in the XML\n/// grammar) needed by external tokenizers. You declare them in a\n/// grammar file as `@context exportName from \"module\"`.\n///\n/// Context values should be immutable, and can be updated (replaced)\n/// on shift or reduce actions.\n///\n/// The export used in a `@context` declaration should be of this\n/// type.\nclass ContextTracker {\n    /// Define a context tracker.\n    constructor(spec) {\n        this.start = spec.start;\n        this.shift = spec.shift || id;\n        this.reduce = spec.reduce || id;\n        this.reuse = spec.reuse || id;\n        this.hash = spec.hash || (() => 0);\n        this.strict = spec.strict !== false;\n    }\n}\n/// Holds the parse tables for a given grammar, as generated by\n/// `lezer-generator`, and provides [methods](#common.Parser) to parse\n/// content with.\nclass LRParser extends Parser {\n    /// @internal\n    constructor(spec) {\n        super();\n        /// @internal\n        this.wrappers = [];\n        if (spec.version != 14 /* File.Version */)\n            throw new RangeError(`Parser version (${spec.version}) doesn't match runtime version (${14 /* File.Version */})`);\n        let nodeNames = spec.nodeNames.split(\" \");\n        this.minRepeatTerm = nodeNames.length;\n        for (let i = 0; i < spec.repeatNodeCount; i++)\n            nodeNames.push(\"\");\n        let topTerms = Object.keys(spec.topRules).map(r => spec.topRules[r][1]);\n        let nodeProps = [];\n        for (let i = 0; i < nodeNames.length; i++)\n            nodeProps.push([]);\n        function setProp(nodeID, prop, value) {\n            nodeProps[nodeID].push([prop, prop.deserialize(String(value))]);\n        }\n        if (spec.nodeProps)\n            for (let propSpec of spec.nodeProps) {\n                let prop = propSpec[0];\n                if (typeof prop == \"string\")\n                    prop = NodeProp[prop];\n                for (let i = 1; i < propSpec.length;) {\n                    let next = propSpec[i++];\n                    if (next >= 0) {\n                        setProp(next, prop, propSpec[i++]);\n                    }\n                    else {\n                        let value = propSpec[i + -next];\n                        for (let j = -next; j > 0; j--)\n                            setProp(propSpec[i++], prop, value);\n                        i++;\n                    }\n                }\n            }\n        this.nodeSet = new NodeSet(nodeNames.map((name, i) => NodeType.define({\n            name: i >= this.minRepeatTerm ? undefined : name,\n            id: i,\n            props: nodeProps[i],\n            top: topTerms.indexOf(i) > -1,\n            error: i == 0,\n            skipped: spec.skippedNodes && spec.skippedNodes.indexOf(i) > -1\n        })));\n        if (spec.propSources)\n            this.nodeSet = this.nodeSet.extend(...spec.propSources);\n        this.strict = false;\n        this.bufferLength = DefaultBufferLength;\n        let tokenArray = decodeArray(spec.tokenData);\n        this.context = spec.context;\n        this.specializerSpecs = spec.specialized || [];\n        this.specialized = new Uint16Array(this.specializerSpecs.length);\n        for (let i = 0; i < this.specializerSpecs.length; i++)\n            this.specialized[i] = this.specializerSpecs[i].term;\n        this.specializers = this.specializerSpecs.map(getSpecializer);\n        this.states = decodeArray(spec.states, Uint32Array);\n        this.data = decodeArray(spec.stateData);\n        this.goto = decodeArray(spec.goto);\n        this.maxTerm = spec.maxTerm;\n        this.tokenizers = spec.tokenizers.map(value => typeof value == \"number\" ? new TokenGroup(tokenArray, value) : value);\n        this.topRules = spec.topRules;\n        this.dialects = spec.dialects || {};\n        this.dynamicPrecedences = spec.dynamicPrecedences || null;\n        this.tokenPrecTable = spec.tokenPrec;\n        this.termNames = spec.termNames || null;\n        this.maxNode = this.nodeSet.types.length - 1;\n        this.dialect = this.parseDialect();\n        this.top = this.topRules[Object.keys(this.topRules)[0]];\n    }\n    createParse(input, fragments, ranges) {\n        let parse = new Parse(this, input, fragments, ranges);\n        for (let w of this.wrappers)\n            parse = w(parse, input, fragments, ranges);\n        return parse;\n    }\n    /// Get a goto table entry @internal\n    getGoto(state, term, loose = false) {\n        let table = this.goto;\n        if (term >= table[0])\n            return -1;\n        for (let pos = table[term + 1];;) {\n            let groupTag = table[pos++], last = groupTag & 1;\n            let target = table[pos++];\n            if (last && loose)\n                return target;\n            for (let end = pos + (groupTag >> 1); pos < end; pos++)\n                if (table[pos] == state)\n                    return target;\n            if (last)\n                return -1;\n        }\n    }\n    /// Check if this state has an action for a given terminal @internal\n    hasAction(state, terminal) {\n        let data = this.data;\n        for (let set = 0; set < 2; set++) {\n            for (let i = this.stateSlot(state, set ? 2 /* ParseState.Skip */ : 1 /* ParseState.Actions */), next;; i += 3) {\n                if ((next = data[i]) == 65535 /* Seq.End */) {\n                    if (data[i + 1] == 1 /* Seq.Next */)\n                        next = data[i = pair(data, i + 2)];\n                    else if (data[i + 1] == 2 /* Seq.Other */)\n                        return pair(data, i + 2);\n                    else\n                        break;\n                }\n                if (next == terminal || next == 0 /* Term.Err */)\n                    return pair(data, i + 1);\n            }\n        }\n        return 0;\n    }\n    /// @internal\n    stateSlot(state, slot) {\n        return this.states[(state * 6 /* ParseState.Size */) + slot];\n    }\n    /// @internal\n    stateFlag(state, flag) {\n        return (this.stateSlot(state, 0 /* ParseState.Flags */) & flag) > 0;\n    }\n    /// @internal\n    validAction(state, action) {\n        return !!this.allActions(state, a => a == action ? true : null);\n    }\n    /// @internal\n    allActions(state, action) {\n        let deflt = this.stateSlot(state, 4 /* ParseState.DefaultReduce */);\n        let result = deflt ? action(deflt) : undefined;\n        for (let i = this.stateSlot(state, 1 /* ParseState.Actions */); result == null; i += 3) {\n            if (this.data[i] == 65535 /* Seq.End */) {\n                if (this.data[i + 1] == 1 /* Seq.Next */)\n                    i = pair(this.data, i + 2);\n                else\n                    break;\n            }\n            result = action(pair(this.data, i + 1));\n        }\n        return result;\n    }\n    /// Get the states that can follow this one through shift actions or\n    /// goto jumps. @internal\n    nextStates(state) {\n        let result = [];\n        for (let i = this.stateSlot(state, 1 /* ParseState.Actions */);; i += 3) {\n            if (this.data[i] == 65535 /* Seq.End */) {\n                if (this.data[i + 1] == 1 /* Seq.Next */)\n                    i = pair(this.data, i + 2);\n                else\n                    break;\n            }\n            if ((this.data[i + 2] & (65536 /* Action.ReduceFlag */ >> 16)) == 0) {\n                let value = this.data[i + 1];\n                if (!result.some((v, i) => (i & 1) && v == value))\n                    result.push(this.data[i], value);\n            }\n        }\n        return result;\n    }\n    /// Configure the parser. Returns a new parser instance that has the\n    /// given settings modified. Settings not provided in `config` are\n    /// kept from the original parser.\n    configure(config) {\n        // Hideous reflection-based kludge to make it easy to create a\n        // slightly modified copy of a parser.\n        let copy = Object.assign(Object.create(LRParser.prototype), this);\n        if (config.props)\n            copy.nodeSet = this.nodeSet.extend(...config.props);\n        if (config.top) {\n            let info = this.topRules[config.top];\n            if (!info)\n                throw new RangeError(`Invalid top rule name ${config.top}`);\n            copy.top = info;\n        }\n        if (config.tokenizers)\n            copy.tokenizers = this.tokenizers.map(t => {\n                let found = config.tokenizers.find(r => r.from == t);\n                return found ? found.to : t;\n            });\n        if (config.specializers) {\n            copy.specializers = this.specializers.slice();\n            copy.specializerSpecs = this.specializerSpecs.map((s, i) => {\n                let found = config.specializers.find(r => r.from == s.external);\n                if (!found)\n                    return s;\n                let spec = Object.assign(Object.assign({}, s), { external: found.to });\n                copy.specializers[i] = getSpecializer(spec);\n                return spec;\n            });\n        }\n        if (config.contextTracker)\n            copy.context = config.contextTracker;\n        if (config.dialect)\n            copy.dialect = this.parseDialect(config.dialect);\n        if (config.strict != null)\n            copy.strict = config.strict;\n        if (config.wrap)\n            copy.wrappers = copy.wrappers.concat(config.wrap);\n        if (config.bufferLength != null)\n            copy.bufferLength = config.bufferLength;\n        return copy;\n    }\n    /// Tells you whether any [parse wrappers](#lr.ParserConfig.wrap)\n    /// are registered for this parser.\n    hasWrappers() {\n        return this.wrappers.length > 0;\n    }\n    /// Returns the name associated with a given term. This will only\n    /// work for all terms when the parser was generated with the\n    /// `--names` option. By default, only the names of tagged terms are\n    /// stored.\n    getName(term) {\n        return this.termNames ? this.termNames[term] : String(term <= this.maxNode && this.nodeSet.types[term].name || term);\n    }\n    /// The eof term id is always allocated directly after the node\n    /// types. @internal\n    get eofTerm() { return this.maxNode + 1; }\n    /// The type of top node produced by the parser.\n    get topNode() { return this.nodeSet.types[this.top[1]]; }\n    /// @internal\n    dynamicPrecedence(term) {\n        let prec = this.dynamicPrecedences;\n        return prec == null ? 0 : prec[term] || 0;\n    }\n    /// @internal\n    parseDialect(dialect) {\n        let values = Object.keys(this.dialects), flags = values.map(() => false);\n        if (dialect)\n            for (let part of dialect.split(\" \")) {\n                let id = values.indexOf(part);\n                if (id >= 0)\n                    flags[id] = true;\n            }\n        let disabled = null;\n        for (let i = 0; i < values.length; i++)\n            if (!flags[i]) {\n                for (let j = this.dialects[values[i]], id; (id = this.data[j++]) != 65535 /* Seq.End */;)\n                    (disabled || (disabled = new Uint8Array(this.maxTerm + 1)))[id] = 1;\n            }\n        return new Dialect(dialect, flags, disabled);\n    }\n    /// Used by the output of the parser generator. Not available to\n    /// user code. @hide\n    static deserialize(spec) {\n        return new LRParser(spec);\n    }\n}\nfunction pair(data, off) { return data[off] | (data[off + 1] << 16); }\nfunction findFinished(stacks) {\n    let best = null;\n    for (let stack of stacks) {\n        let stopped = stack.p.stoppedAt;\n        if ((stack.pos == stack.p.stream.end || stopped != null && stack.pos > stopped) &&\n            stack.p.parser.stateFlag(stack.state, 2 /* StateFlag.Accepting */) &&\n            (!best || best.score < stack.score))\n            best = stack;\n    }\n    return best;\n}\nfunction getSpecializer(spec) {\n    if (spec.external) {\n        let mask = spec.extend ? 1 /* Specialize.Extend */ : 0 /* Specialize.Specialize */;\n        return (value, stack) => (spec.external(value, stack) << 1) | mask;\n    }\n    return spec.get;\n}\n\nexport { ContextTracker, ExternalTokenizer, InputStream, LRParser, LocalTokenGroup, Stack };\n", "// This file was generated by lezer-generator. You probably shouldn't edit it.\nimport { LRParser } from \"@lezer/lr\";\nexport const parser = LRParser.deserialize({\n  version: 14,\n  states: \"%QOVQPOOOOQO'#C_'#C_O_QQO'#C^OOQO'#DO'#DOOvQQO'#C|OOQO'#DR'#DROVQPO'#CuOOQO'#C}'#C}QOQPOOOOQO'#C`'#C`O!UQQO,58xO!dQPO,59VOVQPO,59]OVQPO,59_O!iQPO,59hO!nQQO,59aOOQO'#DQ'#DQOOQO1G.d1G.dO!UQQO1G.qO!yQQO1G.wOOQO1G.y1G.yOOQO'#Cw'#CwOOQO1G/S1G/SOOQO1G.{1G.{O#[QPO'#CnO#dQPO7+$]O!UQQO'#CxO#iQPO,59YOOQO<<Gw<<GwOOQO,59d,59dOOQO-E6v-E6v\",\n  stateData: \"#q~OoOS~OsPOvUO~OTXOUXOVXOWXOXXOYXO`ZO~Of[Oh]Oj^OmpX~OZ`O[`O]`O^`O~OabO~OseO~Of[Oh]OwgO~Oh]Ofeijeimeiwei~OcjOdbX~OdlO~OcjOdba~O\",\n  goto: \"#YvPPw}!TPPPPPPPPPPwPP!WPP!ZP!ZP!aP!g!jPPP!p!s!aP#P!aXROU[]XQOU[]RYQRibXTOU[]XVOU[]Rf^QkhRnkRWOQSOQ_UQc[Rd]QaYQhbRmj\",\n  nodeNames: \"\u26A0 Filter ColumnValueExpression Column Operator Eq NotEq Gt Lt Starts Ends Number String True False ColumnSetExpression In LBrack Values Comma RBrack AndExpression And OrExpression Or ParenthesizedExpression As FilterName\",\n  maxTerm: 39,\n  skippedNodes: [0],\n  repeatNodeCount: 1,\n  tokenData: \"6p~RnXY#PYZ#P]^#Ppq#Pqr#brs#mxy$eyz$j|}$o!O!P$t!Q![%S!^!_%_!_!`%d!`!a%i!c!}%n!}#O&V#P#Q&[#R#S%n#T#U&a#U#X%n#X#Y(w#Y#Z+]#Z#]%n#]#^.]#^#c%n#c#d/e#d#g%n#g#h0m#h#i4[#i#o%n~#USo~XY#PYZ#P]^#Ppq#P~#eP!_!`#h~#mOU~~#pWOX#mZ]#m^r#mrs$Ys#O#m#P;'S#m;'S;=`$_<%lO#m~$_O[~~$bP;=`<%l#m~$jOv~~$oOw~~$tOc~~$wP!Q![$z~%PPZ~!Q![$z~%XQZ~!O!P$t!Q![%S~%dOW~~%iOT~~%nOV~P%sUsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%n~&[Oa~~&aOd~R&fYsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c'U#c#g%n#g#h(^#h#o%nR'ZWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#W%n#W#X's#X#o%nR'zUfQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR(eUjQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR(|WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c)f#c#o%nR)kWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#W%n#W#X*T#X#o%nR*YWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h*r#h#o%nR*yUYQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR+bVsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#U+w#U#o%nR+|WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#`%n#`#a,f#a#o%nR,kWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h-T#h#o%nR-YWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#X%n#X#Y-r#Y#o%nR-yU^QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR.bWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#b%n#b#c.z#c#o%nR/RU`QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR/jWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g0S#g#o%nR0ZUhQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR0rWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#h%n#h#i1[#i#o%nR1aVsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#U1v#U#o%nR1{WsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g2e#g#o%nR2jWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#h%n#h#i3S#i#o%nR3XWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#g%n#g#h3q#h#o%nR3xUXQsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%nR4aWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#f%n#f#g4y#g#o%nR5OWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#i%n#i#j5h#j#o%nR5mWsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#X%n#X#Y6V#Y#o%nR6^U]QsP}!O%n!O!P%n!Q![%n!c!}%n#R#S%n#T#o%n\",\n  tokenizers: [0, 1],\n  topRules: {\"Filter\":[0,1]},\n  tokenPrec: 0\n})\n", "export type PartitionTest<T> = (value: T, index: number) => boolean;\n\nexport function partition<T>(\n  array: T[],\n  test: PartitionTest<T>,\n  pass: T[] = [],\n  fail: T[] = []\n): [T[], T[]] {\n  for (let i = 0, len = array.length; i < len; i++) {\n    (test(array[i], i) ? pass : fail).push(array[i]);\n  }\n  return [pass, fail];\n}\n\n// Note order of items can be different between arrays\n// If an identityProperty is not defined, item identity is used\nexport function itemsChanged<T = unknown>(\n  currentItems: T[],\n  newItems: T[],\n  identityProperty?: string\n) {\n  if (currentItems.length !== newItems.length) {\n    return true;\n  }\n  if (identityProperty === undefined) {\n    return !currentItems.every((item) => newItems.includes(item));\n  } else {\n    return currentItems.some(\n      (currentItem) =>\n        newItems.findIndex(\n          (newItem) =>\n            (newItem as { [key: string]: unknown })[identityProperty] ===\n            (currentItem as { [key: string]: unknown })[identityProperty]\n        ) === -1\n    );\n  }\n}\n\nexport function itemsOrOrderChanged<T = unknown>(\n  currentItems: T[],\n  newItems: T[],\n  identityProperty?: string\n) {\n  if (currentItems.length !== newItems.length) {\n    return true;\n  }\n  if (identityProperty === undefined) {\n    return currentItems.some((item, index) => newItems[index] !== item);\n  } else {\n    return currentItems.some(\n      (currentItem, index) =>\n        (newItems[index] as { [key: string]: unknown })[identityProperty] !==\n        (currentItem as { [key: string]: unknown })[identityProperty]\n    );\n  }\n}\n\nexport const moveItemDeprecated = <T = unknown>(\n  items: T[],\n  item: T,\n  moveTo: number\n): T[] => {\n  const fromIndex = items.indexOf(item);\n  if (fromIndex === moveTo) {\n    return items;\n  }\n  const newItems = items.slice();\n  if (fromIndex === -1) {\n    throw Error(\"moveItem, item to be moved not found\");\n  }\n  newItems.splice(fromIndex, 1);\n  if (moveTo === -1) {\n    newItems.push(item);\n  } else {\n    const offset = moveTo > fromIndex ? 0 : 0;\n    newItems.splice(moveTo + offset, 0, item);\n  }\n  return newItems;\n};\n\nexport const moveItem = <T = unknown>(\n  items: T[],\n  fromIndex: number,\n  toIndex: number\n): T[] => {\n  if (fromIndex === toIndex) {\n    return items;\n  } else {\n    const newItems = items.slice();\n    const [item] = newItems.splice(fromIndex, 1);\n    if (toIndex === -1) {\n      return newItems.concat(item);\n    } else {\n      const offset = toIndex > fromIndex ? 0 : 0;\n      newItems.splice(toIndex + offset, 0, item);\n      return newItems;\n    }\n  }\n};\n\nexport const getAddedItems = <T>(values: undefined | T[], newValues: T[]) => {\n  const isNew = (v: T) => !values?.includes(v);\n  if (values === undefined) {\n    return newValues;\n  } else if (newValues.some(isNew)) {\n    return newValues.filter(isNew);\n  } else {\n    return [] as T[];\n  }\n};\n\nexport const getMissingItems = <T, I>(\n  sourceItems: T[],\n  items: I[],\n  identity: (s: T) => I\n) =>\n  items.filter((i) => sourceItems.findIndex((s) => identity(s) === i) === -1);\n", "//Note these are duplicated in vuu-filter, those should probably be removed.\n\nimport { RuntimeColumnDescriptor } from \"@vuu-ui/vuu-table-types\";\nimport {\n  AndFilter,\n  Filter,\n  FilterClauseOp,\n  FilterWithPartialClause,\n  MultiClauseFilter,\n  MultiValueFilterClause,\n  OrFilter,\n  SingleValueFilterClause,\n  SingleValueFilterClauseOp,\n} from \"@vuu-ui/vuu-filter-types\";\n\nconst singleValueFilterOps = new Set<SingleValueFilterClauseOp>([\n  \"=\",\n  \"!=\",\n  \">\",\n  \">=\",\n  \"<\",\n  \"<=\",\n  \"starts\",\n  \"ends\",\n]);\n\nexport const isValidFilterClauseOp = (op?: string): op is FilterClauseOp =>\n  op === \"in\" || singleValueFilterOps.has(op as SingleValueFilterClauseOp);\n\nexport const isNamedFilter = (f?: Filter) =>\n  f !== undefined && f.name !== undefined;\n\n// ... with type constraints\nexport const isSingleValueFilter = (\n  f?: Partial<Filter>\n): f is SingleValueFilterClause =>\n  f !== undefined &&\n  singleValueFilterOps.has(f.op as SingleValueFilterClauseOp);\n\nexport const isFilterClause = (\n  f?: Partial<Filter>\n): f is SingleValueFilterClause | MultiValueFilterClause =>\n  f !== undefined && (isSingleValueFilter(f) || isMultiValueFilter(f));\n\nexport const isMultiValueFilter = (\n  f?: Partial<Filter>\n): f is MultiValueFilterClause => f !== undefined && f.op === \"in\";\n\nexport const isInFilter = (f: Partial<Filter>): f is MultiValueFilterClause =>\n  f.op === \"in\";\nexport const isAndFilter = (f: Partial<Filter>): f is AndFilter =>\n  f.op === \"and\";\nexport const isOrFilter = (f: Partial<Filter>): f is OrFilter => f.op === \"or\";\n\nexport const isCompleteFilter = (filter: Partial<Filter>): filter is Filter =>\n  isSingleValueFilter(filter) &&\n  filter.column !== undefined &&\n  filter.op !== undefined &&\n  filter.value !== undefined;\n\nexport function isMultiClauseFilter(\n  f?: Partial<Filter> | FilterWithPartialClause\n): f is MultiClauseFilter {\n  return f !== undefined && (f.op === \"and\" || f.op === \"or\");\n}\n\nexport const filterValue = (value: string | number | boolean) =>\n  typeof value === \"string\" ? `\"${value}\"` : value;\n\nexport const quotedStrings = (value: string | number | boolean) =>\n  typeof value === \"string\" ? `\"${value}\"` : value;\n\nexport const filterAsQuery = (f: Filter): string => {\n  if (isMultiClauseFilter(f)) {\n    return f.filters.map((filter) => filterAsQuery(filter)).join(` ${f.op} `);\n  } else if (isMultiValueFilter(f)) {\n    return `${f.column} ${f.op} [${f.values.map(quotedStrings).join(\",\")}]`;\n  } else {\n    return `${f.column} ${f.op} ${filterValue(f.value)}`;\n  }\n};\n\nexport const removeColumnFromFilter = (\n  column: RuntimeColumnDescriptor,\n  filter: Filter\n): [Filter | undefined, string] => {\n  if (isMultiClauseFilter(filter)) {\n    const [clause1, clause2] = filter.filters;\n    if (clause1.column === column.name) {\n      return [clause2, filterAsQuery(clause2)];\n    }\n    if (clause2.column === column.name) {\n      return [clause1, filterAsQuery(clause1)];\n    }\n  }\n  return [undefined, \"\"];\n};\n", "import type {\n  DataSourceFilter,\n  DataSourceRow,\n  SchemaColumn,\n  TableSchema,\n} from \"@vuu-ui/vuu-data-types\";\nimport type { Filter, MultiClauseFilter } from \"@vuu-ui/vuu-filter-types\";\nimport type {\n  VuuAggregation,\n  VuuAggType,\n  VuuColumnDataType,\n  VuuDataRow,\n  VuuGroupBy,\n  VuuRowRecord,\n  VuuSort,\n} from \"@vuu-ui/vuu-protocol-types\";\nimport type {\n  ColumnAlignment,\n  ColumnDescriptor,\n  ColumnType,\n  ColumnTypeDescriptor,\n  ColumnTypeFormatting,\n  ColumnTypeRendering,\n  ColumnTypeSimple,\n  ColumnTypeWithValidationRules,\n  DefaultColumnConfiguration,\n  GroupColumnDescriptor,\n  LookupRenderer,\n  MappedValueTypeRenderer,\n  PinLocation,\n  RuntimeColumnDescriptor,\n  TableHeading,\n  TableHeadings,\n  ValueListRenderer,\n  DateTimeColumnDescriptor,\n} from \"@vuu-ui/vuu-table-types\";\nimport type { CSSProperties } from \"react\";\nimport { moveItem } from \"./array-utils\";\nimport { isFilterClause, isMultiClauseFilter } from \"./filter-utils\";\n\n/**\n * ColumnMap provides a lookup of the index position of a data item within a row\n * by column name.\n */\nexport interface ColumnMap {\n  [columnName: string]: number;\n}\n\nconst SORT_ASC = \"asc\";\nconst NO_HEADINGS: TableHeadings = [];\n\nexport type SortCriteriaItem = string | [string, \"asc\"]; // TODO where is 'desc'?\n\nexport const AggregationType: { [key: string]: VuuAggType } = {\n  Average: 2,\n  Count: 3,\n  Distinct: 6,\n  Sum: 1,\n  High: 4,\n  Low: 5,\n};\n\nexport function mapSortCriteria(\n  sortCriteria: SortCriteriaItem[],\n  columnMap: ColumnMap,\n  metadataOffset = 0\n): [number, \"asc\"][] {\n  return sortCriteria.map((s) => {\n    if (typeof s === \"string\") {\n      return [columnMap[s] + metadataOffset, \"asc\"];\n    } else if (Array.isArray(s)) {\n      const [columnName, sortDir] = s;\n      return [columnMap[columnName] + metadataOffset, sortDir || SORT_ASC];\n    } else {\n      throw Error(\"columnUtils.mapSortCriteria invalid input\");\n    }\n  });\n}\n\nconst numericTypes = [\"int\", \"long\", \"double\"];\nexport const getDefaultAlignment = (\n  serverDataType?: VuuColumnDataType\n): ColumnAlignment =>\n  serverDataType === undefined\n    ? \"left\"\n    : numericTypes.includes(serverDataType)\n    ? \"right\"\n    : \"left\";\n\nexport const isValidColumnAlignment = (v: string): v is ColumnAlignment =>\n  v === \"left\" || v === \"right\";\n\nexport const isValidPinLocation = (v: string): v is PinLocation =>\n  isValidColumnAlignment(v) || v === \"floating\" || v === \"\";\n\nexport const isKeyedColumn = (\n  column: ColumnDescriptor\n): column is RuntimeColumnDescriptor => {\n  return typeof (column as RuntimeColumnDescriptor).key === \"number\";\n};\n\nexport const fromServerDataType = (\n  serverDataType: VuuColumnDataType\n): ColumnTypeSimple => {\n  switch (serverDataType) {\n    case \"double\":\n    case \"int\":\n    case \"long\":\n      return \"number\";\n    case \"boolean\":\n      return \"boolean\";\n    default:\n      return \"string\";\n  }\n};\n\nexport const isNumericColumn = ({ serverDataType, type }: ColumnDescriptor) => {\n  if (\n    serverDataType === \"int\" ||\n    serverDataType === \"long\" ||\n    serverDataType === \"double\"\n  ) {\n    return true;\n  }\n  if (typeof type === \"string\") {\n    return type === \"number\";\n  }\n  if (typeof type?.name === \"string\") {\n    return type?.name === \"number\";\n  }\n\n  return false;\n};\n\nexport const isDateTimeColumn = (\n  column: ColumnDescriptor\n): column is DateTimeColumnDescriptor =>\n  (isTypeDescriptor(column.type) ? column.type.name : column.type) ===\n  \"date/time\";\n\nexport const isPinned = (column: ColumnDescriptor) =>\n  typeof column.pin === \"string\";\n\nexport const hasHeadings = (column: ColumnDescriptor) =>\n  Array.isArray(column.heading) && column.heading.length > 0;\n\nexport const isResizing = (column: RuntimeColumnDescriptor) => column.resizing;\n\nexport const isTextColumn = ({ serverDataType }: ColumnDescriptor) =>\n  serverDataType === undefined\n    ? false\n    : serverDataType === \"char\" || serverDataType === \"string\";\n\nexport const toColumnDescriptor = (name: string): ColumnDescriptor => ({\n  name,\n});\n\n/**\n *\n */\nexport const isTypeDescriptor = (\n  type?: ColumnType\n): type is ColumnTypeDescriptor =>\n  typeof type !== \"undefined\" && typeof type !== \"string\";\n\nconst EMPTY_COLUMN_MAP = {} as const;\n\nexport const isColumnTypeRenderer = (\n  renderer?: unknown\n): renderer is ColumnTypeRendering =>\n  typeof (renderer as ColumnTypeRendering)?.name !== \"undefined\";\n\nexport const isLookupRenderer = (\n  renderer?: unknown\n): renderer is LookupRenderer =>\n  typeof (renderer as LookupRenderer)?.name !== \"undefined\" &&\n  \"lookup\" in (renderer as LookupRenderer);\n\nexport const isValueListRenderer = (\n  renderer?: unknown\n): renderer is ValueListRenderer =>\n  typeof (renderer as ValueListRenderer)?.name !== \"undefined\" &&\n  Array.isArray((renderer as ValueListRenderer).values);\n\nexport const hasValidationRules = (\n  type?: ColumnType\n): type is ColumnTypeWithValidationRules =>\n  isTypeDescriptor(type) &&\n  isColumnTypeRenderer(type.renderer) &&\n  Array.isArray(type.renderer.rules) &&\n  type.renderer.rules.length > 0;\n\nexport const isMappedValueTypeRenderer = (\n  renderer?: unknown\n): renderer is MappedValueTypeRenderer =>\n  renderer !== undefined &&\n  typeof (renderer as MappedValueTypeRenderer)?.map !== \"undefined\";\n\nexport function buildColumnMap(\n  columns?: (RuntimeColumnDescriptor | SchemaColumn | string)[]\n): ColumnMap {\n  const start = metadataKeys.count;\n  if (columns) {\n    return columns.reduce((map, column, i) => {\n      if (typeof column === \"string\") {\n        map[column] = start + i;\n      } else if (isKeyedColumn(column)) {\n        map[column.name] = column.key;\n      } else {\n        map[column.name] = start + i;\n      }\n      return map;\n    }, {} as ColumnMap);\n  } else {\n    return EMPTY_COLUMN_MAP;\n  }\n}\n\nexport function projectUpdates(updates: number[]): number[] {\n  const results: number[] = [];\n  const metadataOffset = metadataKeys.count - 2;\n  for (let i = 0; i < updates.length; i += 3) {\n    results[i] = updates[i] + metadataOffset;\n    results[i + 1] = updates[i + 1];\n    results[i + 2] = updates[i + 2];\n  }\n  return results;\n}\n\nexport const metadataKeys = {\n  IDX: 0,\n  RENDER_IDX: 1,\n  IS_LEAF: 2,\n  IS_EXPANDED: 3,\n  DEPTH: 4,\n  COUNT: 5,\n  KEY: 6,\n  SELECTED: 7,\n  count: 8,\n  // TODO following only used in datamodel\n  PARENT_IDX: \"parent_idx\",\n  IDX_POINTER: \"idx_pointer\",\n  FILTER_COUNT: \"filter_count\",\n  NEXT_FILTER_IDX: \"next_filter_idx\",\n} as const;\n\n// This method mutates the passed columns array\nconst insertColumn = (\n  columns: RuntimeColumnDescriptor[],\n  column: RuntimeColumnDescriptor\n) => {\n  const { originalIdx } = column;\n  if (typeof originalIdx === \"number\") {\n    for (let i = 0; i < columns.length; i++) {\n      const { originalIdx: colIdx = -1 } = columns[i];\n      if (colIdx > originalIdx) {\n        columns.splice(i, 0, column);\n        return columns;\n      }\n    }\n  }\n  columns.push(column);\n  return columns;\n};\n\nexport const flattenColumnGroup = (\n  columns: RuntimeColumnDescriptor[]\n): RuntimeColumnDescriptor[] => {\n  if (columns[0]?.isGroup) {\n    const [groupColumn, ...nonGroupedColumns] = columns as [\n      GroupColumnDescriptor,\n      ...RuntimeColumnDescriptor[]\n    ];\n    groupColumn.columns.forEach((groupColumn) => {\n      insertColumn(nonGroupedColumns, groupColumn);\n    });\n    return nonGroupedColumns;\n  } else {\n    return columns;\n  }\n};\n\nexport function extractGroupColumn(\n  columns: RuntimeColumnDescriptor[],\n  groupBy?: VuuGroupBy,\n  confirmed = true\n): [GroupColumnDescriptor | null, RuntimeColumnDescriptor[]] {\n  if (groupBy && groupBy.length > 0) {\n    const flattenedColumns = flattenColumnGroup(columns);\n    // Note: groupedColumns will be in column order, not groupBy order\n    const [groupedColumns, rest] = flattenedColumns.reduce(\n      (result, column, i) => {\n        const [g, r] = result;\n        if (groupBy.includes(column.name)) {\n          g.push({\n            ...column,\n            originalIdx: i,\n          });\n        } else {\n          r.push(column);\n        }\n\n        return result;\n      },\n      [[], []] as [RuntimeColumnDescriptor[], RuntimeColumnDescriptor[]]\n    );\n    if (groupedColumns.length !== groupBy.length) {\n      throw Error(\n        `extractGroupColumn: no column definition found for all groupBy cols ${JSON.stringify(\n          groupBy\n        )} `\n      );\n    }\n    const groupCount = groupBy.length;\n    const groupCols: RuntimeColumnDescriptor[] = groupBy.map((name, idx) => {\n      // Keep the cols in same order defined on groupBy\n      const column = groupedColumns.find(\n        (col) => col.name === name\n      ) as RuntimeColumnDescriptor;\n      return {\n        ...column,\n        groupLevel: groupCount - idx,\n      };\n    });\n\n    const groupCol = {\n      key: -1,\n      name: \"group-col\",\n      heading: [\"group-col\"],\n      isGroup: true,\n      columns: groupCols,\n      groupConfirmed: confirmed,\n      width: groupCols.map((c) => c.width).reduce((a, b) => a + b) + 100,\n    } as GroupColumnDescriptor;\n\n    return [groupCol, rest];\n  }\n  return [null, flattenColumnGroup(columns)];\n}\n\nexport const isGroupColumn = (\n  column: RuntimeColumnDescriptor\n): column is GroupColumnDescriptor => column.isGroup === true;\n\nexport const isJsonAttribute = (value: unknown) =>\n  typeof value === \"string\" && value.endsWith(\"+\");\n\nexport const isJsonGroup = (column: RuntimeColumnDescriptor, row: VuuDataRow) =>\n  (column.type as ColumnTypeDescriptor)?.name === \"json\" &&\n  isJsonAttribute(row[column.key]);\n\nexport const isJsonColumn = (column: RuntimeColumnDescriptor) =>\n  (column.type as ColumnTypeDescriptor)?.name === \"json\";\n\nexport const sortPinnedColumns = (\n  columns: RuntimeColumnDescriptor[]\n): RuntimeColumnDescriptor[] => {\n  const leftPinnedColumns: RuntimeColumnDescriptor[] = [];\n  const rightPinnedColumns: RuntimeColumnDescriptor[] = [];\n  const restColumns: RuntimeColumnDescriptor[] = [];\n  // let pinnedWidthLeft = 0;\n  let pinnedWidthLeft = 4;\n  for (const column of columns) {\n    // prettier-ignore\n    switch(column.pin){\n      case \"left\": {\n        leftPinnedColumns.push({\n          ...column,\n          endPin: undefined,\n          pinnedOffset: pinnedWidthLeft\n        });\n        pinnedWidthLeft += column.width;\n      }\n      break;\n    // store right pinned columns initially in reverse order\n      case \"right\": rightPinnedColumns.unshift(column); break;\n      default: restColumns.push(column)\n    }\n  }\n\n  if (leftPinnedColumns.length) {\n    leftPinnedColumns.push({\n      ...(leftPinnedColumns.pop() as RuntimeColumnDescriptor),\n      endPin: true,\n    });\n  }\n\n  const allColumns = leftPinnedColumns.length\n    ? leftPinnedColumns.concat(restColumns)\n    : restColumns;\n\n  if (rightPinnedColumns.length) {\n    const measuredRightPinnedColumns: RuntimeColumnDescriptor[] = [];\n    let pinnedWidthRight = 0;\n    for (const column of rightPinnedColumns) {\n      measuredRightPinnedColumns.unshift({\n        ...column,\n        pinnedOffset: pinnedWidthRight,\n      });\n      pinnedWidthRight += column.width;\n    }\n    measuredRightPinnedColumns[0].endPin = true;\n    return allColumns.concat(measuredRightPinnedColumns);\n  } else {\n    return allColumns;\n  }\n};\n\nexport const getTableHeadings = (\n  columns: RuntimeColumnDescriptor[]\n): TableHeadings => {\n  if (columns.some(hasHeadings)) {\n    const maxHeadingDepth = columns.reduce<number>(\n      (max, { heading }) => Math.max(max, heading?.length ?? 0),\n      0\n    );\n\n    let heading: TableHeading | undefined = undefined;\n    const tableHeadings: TableHeadings = [];\n    let tableHeadingsRow: TableHeading[];\n    for (let level = 0; level < maxHeadingDepth; level++) {\n      tableHeadingsRow = [];\n      columns.forEach(({ heading: columnHeading = NO_HEADINGS, width }) => {\n        const label = columnHeading[level] ?? \"\";\n        if (heading && heading.label === label) {\n          heading.width += width;\n        } else {\n          heading = { label, width } as TableHeading;\n          tableHeadingsRow.push(heading);\n        }\n      });\n      tableHeadings.push(tableHeadingsRow);\n    }\n\n    return tableHeadings;\n  }\n  return NO_HEADINGS;\n};\n\nexport const getColumnStyle = ({\n  pin,\n  pinnedOffset = pin === \"left\" ? 0 : 4,\n  width,\n}: RuntimeColumnDescriptor) =>\n  pin === \"left\"\n    ? ({\n        left: pinnedOffset,\n        width,\n        \"--pin-width\": `${pinnedOffset + width - 3}px`,\n      } as CSSProperties)\n    : pin === \"right\"\n    ? ({\n        right: pinnedOffset,\n        width,\n        \"--pin-width\": `${pinnedOffset + width}px`,\n      } as CSSProperties)\n    : { width };\n\nexport const setAggregations = (\n  aggregations: VuuAggregation[],\n  column: RuntimeColumnDescriptor,\n  aggType: VuuAggType\n) => {\n  return aggregations\n    .filter((agg) => agg.column !== column.name)\n    .concat({ column: column.name, aggType });\n};\n\nexport const extractFilterForColumn = (\n  filter: Filter | undefined,\n  columnName: string\n) => {\n  if (isMultiClauseFilter(filter)) {\n    return collectFiltersForColumn(filter, columnName);\n  }\n  if (isFilterClause(filter)) {\n    return filter.column === columnName ? filter : undefined;\n  }\n  return undefined;\n};\n\nconst collectFiltersForColumn = (\n  filter: MultiClauseFilter,\n  columnName: string\n) => {\n  const { filters, op } = filter;\n  const results: Filter[] = [];\n  filters.forEach((filter) => {\n    const ffc = extractFilterForColumn(filter, columnName);\n    if (ffc) {\n      results.push(ffc);\n    }\n  });\n  if (results.length === 0) {\n    return undefined;\n  } else if (results.length === 1) {\n    return results[0];\n  }\n  return {\n    op,\n    filters: results,\n  };\n};\n\nexport const applyGroupByToColumns = (\n  columns: RuntimeColumnDescriptor[],\n  groupBy: VuuGroupBy,\n  confirmed = true\n) => {\n  if (groupBy.length) {\n    const [groupColumn, nonGroupedColumns] = extractGroupColumn(\n      columns,\n      groupBy,\n      confirmed\n    );\n    if (groupColumn) {\n      return [groupColumn as RuntimeColumnDescriptor].concat(nonGroupedColumns);\n    }\n  } else if (columns[0]?.isGroup) {\n    return flattenColumnGroup(columns);\n  }\n  return columns;\n};\n\nexport const applySortToColumns = (\n  colunms: RuntimeColumnDescriptor[],\n  sort: VuuSort\n) =>\n  colunms.map((column) => {\n    const sorted = getSortType(column, sort);\n    if (sorted !== undefined) {\n      return {\n        ...column,\n        sorted,\n      };\n    } else if (column.sorted) {\n      return {\n        ...column,\n        sorted: undefined,\n      };\n    } else {\n      return column;\n    }\n  });\n\nexport const applyFilterToColumns = (\n  columns: RuntimeColumnDescriptor[],\n  { filterStruct }: DataSourceFilter\n) =>\n  columns.map((column) => {\n    // TODO this gives us a dependency on vuu-filters\n    const filter = extractFilterForColumn(filterStruct, column.name);\n    if (filter !== undefined) {\n      return {\n        ...column,\n        filter,\n      };\n    } else if (column.filter) {\n      return {\n        ...column,\n        filter: undefined,\n      };\n    } else {\n      return column;\n    }\n  });\n\nexport const isFilteredColumn = (column: RuntimeColumnDescriptor) =>\n  column.filter !== undefined;\n\nexport const stripFilterFromColumns = (columns: RuntimeColumnDescriptor[]) =>\n  columns.map((col) => {\n    const { filter, ...rest } = col;\n    return filter ? rest : col;\n  });\n\nconst getSortType = (column: ColumnDescriptor, { sortDefs }: VuuSort) => {\n  const sortDef = sortDefs.find((sortCol) => sortCol.column === column.name);\n  if (sortDef) {\n    return sortDefs.length > 1\n      ? (sortDefs.indexOf(sortDef) + 1) * (sortDef.sortType === \"A\" ? 1 : -1)\n      : sortDef.sortType;\n  }\n};\n\n// Calculated columns have the formal 'name:datatype:expression'\nexport const getColumnName = (name: string) => {\n  const pos = name.indexOf(\":\");\n  if (pos === -1) {\n    return name;\n  } else {\n    return name.slice(0, pos);\n  }\n};\n\nexport const getColumnLabel = (column: ColumnDescriptor) => {\n  if (column.label) {\n    return column.label;\n  } else if (isCalculatedColumn(column.name)) {\n    return getCalculatedColumnName(column);\n  } else {\n    return column.name;\n  }\n};\n\nexport const findColumn = (\n  columns: RuntimeColumnDescriptor[],\n  columnName: string\n): RuntimeColumnDescriptor | undefined => {\n  const column = columns.find((col) => col.name === columnName);\n  if (column) {\n    return column;\n  } else {\n    const groupColumn = columns.find(\n      (col) => col.isGroup\n    ) as GroupColumnDescriptor;\n    if (groupColumn) {\n      return findColumn(groupColumn.columns, columnName);\n    }\n  }\n};\n\nexport function updateColumn<T extends ColumnDescriptor>(\n  columns: T[],\n  column: T\n): T[];\nexport function updateColumn(\n  columns: RuntimeColumnDescriptor[],\n  column: string,\n  options: Partial<ColumnDescriptor>\n): RuntimeColumnDescriptor[];\nexport function updateColumn(\n  columns: RuntimeColumnDescriptor[],\n  column: string | RuntimeColumnDescriptor,\n  options?: Partial<ColumnDescriptor>\n) {\n  const targetColumn =\n    typeof column === \"string\"\n      ? columns.find((col) => col.name === column)\n      : column;\n  if (targetColumn) {\n    const replacementColumn = options\n      ? { ...targetColumn, ...options }\n      : targetColumn;\n    return columns.map((col) =>\n      col.name === replacementColumn.name ? replacementColumn : col\n    );\n  } else {\n    throw Error(\"column-utils.replaceColun, column not found\");\n  }\n}\n\nexport const toDataSourceColumns = (column: ColumnDescriptor) => column.name;\n\nexport const getRowRecord = (\n  row: DataSourceRow,\n  columnMap: ColumnMap\n): VuuRowRecord => {\n  return Object.entries(columnMap).reduce<VuuRowRecord>(\n    (map, [colName, key]) => {\n      map[colName] = row[key];\n      return map;\n    },\n    {}\n  );\n};\n\nexport const isDataLoading = (columns: RuntimeColumnDescriptor[]) => {\n  return isGroupColumn(columns[0]) && columns[0].groupConfirmed === false;\n};\n\nexport const getColumnsInViewport = (\n  columns: RuntimeColumnDescriptor[],\n  vpStart: number,\n  vpEnd: number\n): [RuntimeColumnDescriptor[], number] => {\n  const visibleColumns: RuntimeColumnDescriptor[] = [];\n  let preSpan = 0;\n\n  for (let offset = 0, i = 0; i < columns.length; i++) {\n    const column = columns[i];\n    // TODO we need to measure the pinned columns first\n    if (column.hidden) {\n      continue;\n    } else if (offset + column.width < vpStart) {\n      if (column.pin === \"left\") {\n        visibleColumns.push(column);\n      } else if (offset + column.width + columns[i + 1]?.width > vpStart) {\n        visibleColumns.push(column);\n      } else {\n        preSpan += column.width;\n      }\n    } else if (offset > vpEnd) {\n      visibleColumns.push(column);\n      break;\n    } else {\n      visibleColumns.push(column);\n    }\n    offset += column.width;\n  }\n\n  return [visibleColumns, preSpan];\n};\n\nexport const isNotHidden = (column: RuntimeColumnDescriptor) =>\n  column.hidden !== true;\n\nexport const visibleColumnAtIndex = (\n  columns: RuntimeColumnDescriptor[],\n  index: number\n) => {\n  if (columns.every(isNotHidden)) {\n    return columns[index];\n  } else {\n    return columns.filter(isNotHidden).at(index);\n  }\n};\n\nconst { DEPTH, IS_LEAF } = metadataKeys;\n// Get the value for a specific columns within a grouped column\nexport const getGroupValueAndOffset = (\n  columns: RuntimeColumnDescriptor[],\n  row: DataSourceRow\n): [unknown, number] => {\n  const { [DEPTH]: depth, [IS_LEAF]: isLeaf } = row;\n  // Depth can be greater tha group columns when we have just removed a column from groupby\n  // but new data has not yet been received.\n  if (isLeaf || depth > columns.length) {\n    return [null, depth === null ? 0 : Math.max(0, depth - 1)];\n  } else if (depth === 0) {\n    return [\"$root\", 0];\n  } else {\n    // offset 1 for now to allow for $root\n    const { key, valueFormatter } = columns[depth - 1];\n    const value = valueFormatter(row[key]);\n    return [value, depth - 1];\n  }\n};\n\nexport const getDefaultColumnType = (\n  serverDataType?: VuuColumnDataType\n): ColumnTypeSimple => {\n  switch (serverDataType) {\n    case \"int\":\n    case \"long\":\n    case \"double\":\n      return \"number\";\n    case \"boolean\":\n      return \"boolean\";\n    default:\n      return \"string\";\n  }\n};\n\nexport const updateColumnFormatting = <\n  T extends ColumnDescriptor = ColumnDescriptor\n>(\n  column: T,\n  formatting: ColumnTypeFormatting\n): T => {\n  const { serverDataType, type = getDefaultColumnType(serverDataType) } =\n    column;\n\n  if (isTypeDescriptor(type)) {\n    return { ...column, type: { ...type, formatting } };\n  } else {\n    return { ...column, type: { name: type, formatting } };\n  }\n};\n\nexport function updateColumnType<T extends ColumnDescriptor = ColumnDescriptor>(\n  column: T,\n  type: ColumnTypeSimple\n): T {\n  return isTypeDescriptor(column.type)\n    ? { ...column, type: { ...column.type, name: type } }\n    : { ...column, type };\n}\n\nexport const updateColumnRenderProps = <\n  T extends ColumnDescriptor = ColumnDescriptor\n>(\n  column: T,\n  renderer: ColumnTypeRendering\n): T => {\n  const { serverDataType, type = getDefaultColumnType(serverDataType) } =\n    column;\n\n  if (isTypeDescriptor(type)) {\n    return {\n      ...column,\n      type: {\n        ...type,\n        // TODO do we need to preserve any existing attributes from renderer ?\n        renderer,\n      },\n    };\n  } else {\n    return { ...column, type: { name: type, renderer } };\n  }\n};\n\nconst NO_TYPE_SETTINGS = {};\nexport const getTypeFormattingFromColumn = (\n  column: ColumnDescriptor\n): ColumnTypeFormatting => {\n  if (isTypeDescriptor(column.type)) {\n    return column.type.formatting ?? NO_TYPE_SETTINGS;\n  } else {\n    return NO_TYPE_SETTINGS;\n  }\n};\n\n/**\n *\n * return a filter predicate that will reject columns, names of which\n * are not in provided list.\n */\nexport const subscribedOnly =\n  (columnNames?: string[]) => (column: ColumnDescriptor) =>\n    columnNames?.includes(column.name);\n\nexport const addColumnToSubscribedColumns = (\n  subscribedColumns: ColumnDescriptor[],\n  availableColumns: SchemaColumn[],\n  columnName: string\n) => {\n  const byColName =\n    (n = columnName) =>\n    (column: { name: string }) =>\n      column.name === n;\n  if (subscribedColumns.findIndex(byColName()) !== -1) {\n    throw Error(\n      `column-utils, addColumnToSubscribedColumns column ${columnName} is already subscribed`\n    );\n  }\n  const indexOfAvailableColumn = availableColumns.findIndex(byColName());\n  if (indexOfAvailableColumn === -1) {\n    throw Error(\n      `column-utils, addColumnToSubscribedColumns column ${columnName} is not available`\n    );\n  }\n\n  const newColumn = {\n    ...availableColumns[indexOfAvailableColumn],\n  } as ColumnDescriptor;\n\n  // find the nearest preceding available column which is subscribed\n  let index = -1;\n  for (let i = indexOfAvailableColumn - 1; i >= 0; i--) {\n    const { name } = availableColumns[i];\n    index = subscribedColumns.findIndex(byColName(name));\n    if (index !== -1) {\n      break;\n    }\n  }\n\n  if (index === -1) {\n    return [newColumn].concat(subscribedColumns);\n  } else {\n    const results: ColumnDescriptor[] = [];\n    for (let i = 0; i < subscribedColumns.length; i++) {\n      results.push(subscribedColumns[i]);\n      if (i === index) {\n        results.push(newColumn);\n        index = Number.MAX_SAFE_INTEGER;\n      }\n    }\n    return results;\n  }\n};\n\nconst CalculatedColumnPattern = /.*:.*:.*/;\n\nexport const isCalculatedColumn = (columnName?: string) =>\n  columnName !== undefined && CalculatedColumnPattern.test(columnName);\n\nexport const getCalculatedColumnDetails = (column: ColumnDescriptor) => {\n  if (isCalculatedColumn(column.name)) {\n    return column.name.split(/:=?/);\n  } else {\n    throw Error(\n      `column-utils, getCalculatedColumnDetails column name ${column.name} is not valid calculated column`\n    );\n  }\n};\n\nexport const getCalculatedColumnName = (column: ColumnDescriptor) =>\n  getCalculatedColumnDetails(column)[0];\nexport const getCalculatedColumnType = (column: ColumnDescriptor) =>\n  getCalculatedColumnDetails(column)[1] as VuuColumnDataType;\nexport const getCalculatedColumnExpression = (column: ColumnDescriptor) =>\n  getCalculatedColumnDetails(column)[2];\n\nexport const setCalculatedColumnName = (\n  column: ColumnDescriptor,\n  name: string\n): ColumnDescriptor => {\n  const [, type, expression] = column.name.split(\":\");\n  return {\n    ...column,\n    name: `${name}:${type}:${expression}`,\n  };\n};\n\nexport const setCalculatedColumnType = (\n  column: ColumnDescriptor,\n  type: string\n): ColumnDescriptor => {\n  const [name, , expression] = column.name.split(\":\");\n  return {\n    ...column,\n    name: `${name}:${type}:${expression}`,\n  };\n};\n\n// TODO should we validate the expression here ?\nexport const setCalculatedColumnExpression = (\n  column: ColumnDescriptor,\n  expression: string\n): ColumnDescriptor => {\n  const [name, type] = column.name.split(\":\");\n  return {\n    ...column,\n    name: `${name}:${type}:=${expression}`,\n  };\n};\n\nexport const moveColumnTo = (\n  columns: ColumnDescriptor[],\n  column: ColumnDescriptor,\n  newIndex: number\n) => {\n  const index = columns.findIndex((col) => col.name === column.name);\n  return moveItem(columns, index, newIndex);\n};\n\nexport function replaceColumn<\n  C extends ColumnDescriptor = RuntimeColumnDescriptor\n>(columns: C[], column: C) {\n  return columns.map((col) => (col.name === column.name ? column : col));\n}\n\nexport const applyDefaultColumnConfig = (\n  { columns, table }: TableSchema,\n  getDefaultColumnConfig?: DefaultColumnConfiguration\n) => {\n  if (typeof getDefaultColumnConfig === \"function\") {\n    return columns.map((column) => {\n      const config = getDefaultColumnConfig(table.table, column.name);\n      if (config) {\n        return {\n          ...column,\n          ...config,\n        };\n      } else {\n        return column;\n      }\n    });\n  } else {\n    return columns;\n  }\n};\n", "export const getCookieValue = (name: string): string | number | undefined => {\n  if (globalThis.document?.cookie !== undefined) {\n    return globalThis.document.cookie\n      .split(\"; \")\n      .find((row) => row.startsWith(`${name}=`))\n      ?.split(\"=\")[1];\n  }\n};\n", "export interface VuuRange {\n  from: number;\n  to: number;\n  bufferSize?: number;\n  reset?: boolean;\n}\n\ninterface FromToRange {\n  from: number;\n  to: number;\n}\n\nexport const NULL_RANGE: VuuRange = { from: 0, to: 0 } as const;\n\nexport function getFullRange(\n  { from, to }: VuuRange,\n  bufferSize = 0,\n  rowCount: number = Number.MAX_SAFE_INTEGER\n): FromToRange {\n  if (bufferSize === 0) {\n    if (rowCount < from) {\n      return { from: 0, to: 0 };\n    } else {\n      return { from, to: Math.min(to, rowCount) };\n    }\n  } else if (from === 0) {\n    return { from, to: Math.min(to + bufferSize, rowCount) };\n  } else {\n    const rangeSize = to - from;\n    const buff = Math.round(bufferSize / 2);\n    const shortfallBefore = from - buff < 0;\n    const shortFallAfter = rowCount - (to + buff) < 0;\n\n    if (shortfallBefore && shortFallAfter) {\n      return { from: 0, to: rowCount };\n    } else if (shortfallBefore) {\n      return { from: 0, to: rangeSize + bufferSize };\n    } else if (shortFallAfter) {\n      return {\n        from: Math.max(0, rowCount - (rangeSize + bufferSize)),\n        to: rowCount,\n      };\n    } else {\n      return { from: from - buff, to: to + buff };\n    }\n  }\n}\n\nexport function resetRange({ from, to, bufferSize = 0 }: VuuRange): VuuRange {\n  return {\n    from: 0,\n    to: to - from,\n    bufferSize,\n    reset: true,\n  };\n}\n\nexport const withinRange = (value: number, { from, to }: VuuRange) =>\n  value >= from && value < to;\n\n// export const rangeOverlap = (\n//   { from: from1, to: to1 }: VuuRange,\n//   { from: from2, to: to2 }: VuuRange\n// ): VuuRange => {\n//   return from2 >= to1 || to2 < from1\n//     ? { from: 0, to: 0 }\n//     : { from: Math.max(from2, from1), to: Math.min(to2, to1) };\n// };\n\nexport const rangeNewItems = (\n  { from: from1, to: to1 }: VuuRange,\n  newRange: VuuRange\n): VuuRange => {\n  const { from: from2, to: to2 } = newRange;\n  const noOverlap = from2 >= to1 || to2 <= from1;\n  const newFullySubsumesOld = from2 < from1 && to2 > to1;\n  return noOverlap || newFullySubsumesOld\n    ? newRange\n    : to2 > to1\n    ? { from: to1, to: to2 }\n    : { from: from2, to: from1 };\n};\n\nexport class WindowRange {\n  public from: number;\n  public to: number;\n\n  constructor(from: number, to: number) {\n    this.from = from;\n    this.to = to;\n  }\n\n  public isWithin(index: number) {\n    return withinRange(index, this);\n  }\n\n  //find the overlap of this range and a new one\n  public overlap(from: number, to: number): [number, number] {\n    return from >= this.to || to < this.from\n      ? [0, 0]\n      : [Math.max(from, this.from), Math.min(to, this.to)];\n  }\n\n  public copy(): WindowRange {\n    return new WindowRange(this.from, this.to);\n  }\n}\n", "import {\n  ConnectionQualityMetrics,\n  ConnectionStatusMessage,\n  DataSourceConfig,\n  MenuRpcResponse,\n  RpcResponse,\n  TypeaheadSuggestionProvider,\n  VuuUIMessageIn,\n  VuuUIMessageInRPC,\n  VuuUIMessageInRPCEditReject,\n  VuuUIMessageInRPCEditResponse,\n  VuuUIMessageInTableMeta,\n  VuuUIMessageOutViewport,\n  WithFilter,\n  WithFullConfig,\n  WithGroupBy,\n  WithSort,\n} from \"@vuu-ui/vuu-data-types\";\nimport {\n  LinkDescriptorWithLabel,\n  VuuFilter,\n  VuuSort,\n} from \"@vuu-ui/vuu-protocol-types\";\n\nexport const NoFilter: VuuFilter = { filter: \"\" };\nexport const NoSort: VuuSort = { sortDefs: [] };\n\nexport const vanillaConfig: WithFullConfig = {\n  aggregations: [],\n  columns: [],\n  filter: NoFilter,\n  groupBy: [],\n  sort: NoSort,\n};\n\ntype DataConfigPredicate = (\n  config: DataSourceConfig,\n  newConfig: DataSourceConfig\n) => boolean;\n\nconst equivalentAggregations: DataConfigPredicate = (\n  { aggregations: agg1 },\n  { aggregations: agg2 }\n) =>\n  (agg1 === undefined && agg2?.length === 0) ||\n  (agg2 === undefined && agg1?.length === 0);\n\nconst equivalentColumns: DataConfigPredicate = (\n  { columns: cols1 },\n  { columns: cols2 }\n) =>\n  (cols1 === undefined && cols2?.length === 0) ||\n  (cols2 === undefined && cols1?.length === 0);\n\nconst equivalentFilter: DataConfigPredicate = (\n  { filter: f1 },\n  { filter: f2 }\n) =>\n  (f1 === undefined && f2?.filter === \"\") ||\n  (f2 === undefined && f1?.filter === \"\");\n\nconst equivalentGroupBy: DataConfigPredicate = (\n  { groupBy: val1 },\n  { groupBy: val2 }\n) =>\n  (val1 === undefined && val2?.length === 0) ||\n  (val2 === undefined && val1?.length === 0);\n\nconst equivalentSort: DataConfigPredicate = ({ sort: s1 }, { sort: s2 }) =>\n  (s1 === undefined && s2?.sortDefs.length === 0) ||\n  (s2 === undefined && s1?.sortDefs.length === 0);\n\nconst exactlyTheSame = (a: unknown, b: unknown) => {\n  if (a === b) {\n    return true;\n  } else if (a === undefined && b === undefined) {\n    return true;\n  } else {\n    return false;\n  }\n};\n\nconst aggregationsChanged: DataConfigPredicate = (config, newConfig) => {\n  const { aggregations: agg1 } = config;\n  const { aggregations: agg2 } = newConfig;\n  if (exactlyTheSame(agg1, agg2) || equivalentAggregations(config, newConfig)) {\n    return false;\n  } else if (agg1 === undefined || agg2 === undefined) {\n    return true;\n  } else if (agg1.length !== agg2.length) {\n    return true;\n  }\n  return agg1.some(\n    ({ column, aggType }, i) =>\n      column !== agg2[i].column || aggType !== agg2[i].aggType\n  );\n};\n\nexport const columnsChanged: DataConfigPredicate = (config, newConfig) => {\n  const { columns: cols1 } = config;\n  const { columns: cols2 } = newConfig;\n\n  if (exactlyTheSame(cols1, cols2) || equivalentColumns(config, newConfig)) {\n    return false;\n  } else if (cols1 === undefined || cols2 === undefined) {\n    return true;\n  } else if (cols1?.length !== cols2?.length) {\n    return true;\n  }\n  return cols1.some((column, i) => column !== cols2?.[i]);\n};\n\nexport const filterChanged: DataConfigPredicate = (c1, c2) => {\n  if (equivalentFilter(c1, c2)) {\n    return false;\n  } else {\n    return c1.filter?.filter !== c2.filter?.filter;\n  }\n};\n\nexport const groupByChanged: DataConfigPredicate = (config, newConfig) => {\n  const { groupBy: g1 } = config;\n  const { groupBy: g2 } = newConfig;\n  if (exactlyTheSame(g1, g2) || equivalentGroupBy(config, newConfig)) {\n    return false;\n  } else if (g1 === undefined || g2 === undefined) {\n    return true;\n  } else if (g1?.length !== g2?.length) {\n    return true;\n  }\n  return g1.some((column, i) => column !== g2?.[i]);\n};\n\nconst sortChanged: DataConfigPredicate = (config, newConfig) => {\n  const { sort: s1 } = config;\n  const { sort: s2 } = newConfig;\n  if (exactlyTheSame(s1, s2) || equivalentSort(config, newConfig)) {\n    return false;\n  } else if (s1 === undefined || s2 === undefined) {\n    return true;\n  } else if (s1?.sortDefs.length !== s2?.sortDefs.length) {\n    return true;\n  }\n  return s1.sortDefs.some(\n    ({ column, sortType }, i) =>\n      column !== s2.sortDefs[i].column || sortType !== s2.sortDefs[i].sortType\n  );\n};\n\nconst visualLinkChanged: DataConfigPredicate = () => {\n  // TODO\n  return false;\n};\n\nexport const configChanged = (\n  config: DataSourceConfig | undefined,\n  newConfig: DataSourceConfig | undefined\n) => {\n  if (exactlyTheSame(config, newConfig)) {\n    return false;\n  }\n\n  if (config === undefined || newConfig === undefined) {\n    return true;\n  }\n\n  return (\n    aggregationsChanged(config, newConfig) ||\n    columnsChanged(config, newConfig) ||\n    filterChanged(config, newConfig) ||\n    groupByChanged(config, newConfig) ||\n    sortChanged(config, newConfig) ||\n    visualLinkChanged(config, newConfig)\n  );\n};\n\nexport const hasGroupBy = (config?: DataSourceConfig): config is WithGroupBy =>\n  config !== undefined &&\n  config.groupBy !== undefined &&\n  config.groupBy.length > 0;\n\nexport const hasFilter = (config?: DataSourceConfig): config is WithFilter =>\n  config?.filter !== undefined && config.filter.filter.length > 0;\n\nexport const hasSort = (config?: DataSourceConfig): config is WithSort =>\n  config?.sort !== undefined &&\n  Array.isArray(config.sort?.sortDefs) &&\n  config.sort.sortDefs.length > 0;\n\nexport const isTypeaheadSuggestionProvider = (\n  source: unknown\n): source is TypeaheadSuggestionProvider =>\n  typeof (source as TypeaheadSuggestionProvider)[\"getTypeaheadSuggestions\"] ===\n  \"function\";\n\nexport const isTableSchema = (\n  message: VuuUIMessageIn\n): message is VuuUIMessageInTableMeta => message.type === \"TABLE_META_RESP\";\n\nexport const isConnectionStatusMessage = (\n  msg: object | ConnectionStatusMessage\n): msg is ConnectionStatusMessage =>\n  (msg as ConnectionStatusMessage).type === \"connection-status\";\n\nexport const isConnectionQualityMetrics = (\n  msg: object\n): msg is ConnectionQualityMetrics =>\n  (msg as ConnectionQualityMetrics).type === \"connection-metrics\";\n\nexport const messageHasResult = (msg: object): msg is VuuUIMessageInRPC =>\n  typeof (msg as VuuUIMessageInRPC).result !== \"undefined\";\n\nexport const isErrorResponse = (\n  response?: RpcResponse\n): response is VuuUIMessageInRPCEditReject =>\n  response !== undefined && \"error\" in response;\n\nexport const hasAction = (\n  response?: RpcResponse\n): response is MenuRpcResponse | VuuUIMessageInRPCEditResponse =>\n  response != undefined && \"action\" in response;\n\nexport const isViewporttMessage = (\n  msg: object\n): msg is VuuUIMessageOutViewport => \"viewport\" in msg;\n\nexport const withConfigDefaults = (\n  config: DataSourceConfig\n): WithFullConfig & { visualLink?: LinkDescriptorWithLabel } => {\n  if (\n    config.aggregations &&\n    config.columns &&\n    config.filter &&\n    config.groupBy &&\n    config.sort\n  ) {\n    return config as WithFullConfig;\n  } else {\n    const {\n      aggregations = [],\n      columns = [],\n      filter = { filter: \"\" },\n      groupBy = [],\n      sort = { sortDefs: [] },\n      visualLink,\n    } = config;\n\n    return {\n      aggregations,\n      columns,\n      filter,\n      groupBy,\n      sort,\n      visualLink,\n    };\n  }\n};\n", "import { getCookieValue } from \"./cookie-utils\";\n\ndeclare global {\n  const loggingSettings: loggingSettings;\n}\n\nexport interface LogFn {\n  (message?: unknown, ...optionalParams: unknown[]): void;\n}\nexport interface AssertLogFn {\n  (condition: boolean, message?: unknown, errorMessaage?: unknown): void;\n}\n\nexport interface TableLogFn {\n  (properties?: object): void;\n}\n\ntype loggingSettings = {\n  loggingLevel: LogLevel;\n};\n\nexport interface Logger {\n  warn: LogFn;\n  error: LogFn;\n  debug: LogFn;\n  info: LogFn;\n}\n\nexport type LogLevel = keyof Logger;\n\nconst logLevels = [\"error\", \"warn\", \"info\", \"debug\"];\nconst isValidLogLevel = (value: unknown): value is LogLevel =>\n  typeof value === \"string\" && logLevels.includes(value);\n\nconst DEFAULT_LOG_LEVEL: LogLevel = \"error\";\n\nexport type BuildEnv = \"production\" | \"development\";\n\nconst NO_OP = () => undefined;\n\nconst DEFAULT_DEBUG_LEVEL: LogLevel =\n  process.env.NODE_ENV === \"production\" ? \"error\" : \"info\";\n\nconst { loggingLevel = DEFAULT_DEBUG_LEVEL } = getLoggingSettings();\n// typeof loggingSettings !== \"undefined\" ? loggingSettings : {};\n// const { loggingLevel = DEFAULT_DEBUG_LEVEL } =\n//   typeof loggingSettings !== \"undefined\" ? loggingSettings : {};\n\nexport const logger = (category: string) => {\n  const debugEnabled = loggingLevel === \"debug\";\n  const infoEnabled = debugEnabled || loggingLevel === \"info\";\n  const warnEnabled = infoEnabled || loggingLevel === \"warn\";\n  const errorEnabled = warnEnabled || loggingLevel === \"error\";\n\n  const info = infoEnabled\n    ? (message: string) => console.info(`[${category}] ${message}`)\n    : NO_OP;\n  const warn = warnEnabled\n    ? (message: string) => console.warn(`[${category}] ${message}`)\n    : NO_OP;\n  const debug = debugEnabled\n    ? (message: string) => console.debug(`[${category}] ${message}`)\n    : NO_OP;\n  const error = errorEnabled\n    ? (message: string) => console.error(`[${category}] ${message}`)\n    : NO_OP;\n\n  if (process.env.NODE_ENV === \"production\") {\n    return {\n      errorEnabled,\n      error,\n    };\n  } else {\n    return {\n      debugEnabled,\n      infoEnabled,\n      warnEnabled,\n      errorEnabled,\n      info,\n      warn,\n      debug,\n      error,\n    };\n  }\n};\n\nfunction getLoggingSettings() {\n  if (typeof loggingSettings !== \"undefined\") {\n    return loggingSettings;\n  } else {\n    return {\n      loggingLevel: getLoggingLevelFromCookie(),\n    };\n  }\n}\n\nfunction getLoggingLevelFromCookie(): LogLevel {\n  const value = getCookieValue(\"vuu-logging-level\");\n  if (isValidLogLevel(value)) {\n    return value;\n  } else {\n    return DEFAULT_LOG_LEVEL;\n  }\n}\n\nexport const getLoggingConfigForWorker = () => {\n  return `const loggingSettings = { loggingLevel: \"${getLoggingLevelFromCookie()}\"};`;\n};\n", "type Listener = (...args: any[]) => void;\nexport type EmittedEvents = Record<string, Listener>;\n\nfunction isArrayOfListeners(\n  listeners: EventListener | EventListener[]\n): listeners is EventListener[] {\n  return Array.isArray(listeners);\n}\n\nfunction isOnlyListener(\n  listeners: EventListener | EventListener[]\n): listeners is EventListener {\n  return !Array.isArray(listeners);\n}\n\nexport interface IEventEmitter<Events extends EmittedEvents> {\n  addListener<E extends keyof Events>(event: E, listener: Events[E]): void;\n  emit<E extends keyof Events>(event: E, ...args: Parameters<Events[E]>): void;\n  on<E extends keyof Events>(event: E, listener: Events[E]): void;\n  removeListener<E extends keyof Events>(event: E, listener: Events[E]): void;\n  removeAllListeners<E extends keyof Events>(event?: E): void;\n}\n\nexport class EventEmitter<Events extends EmittedEvents>\n  implements IEventEmitter<Events>\n{\n  #events: Map<keyof Events, Listener | Listener[]> = new Map();\n\n  addListener<E extends keyof Events>(event: E, listener: Events[E]) {\n    const listeners = this.#events.get(event);\n\n    if (!listeners) {\n      this.#events.set(event, listener);\n    } else if (isArrayOfListeners(listeners)) {\n      listeners.push(listener);\n    } else if (isOnlyListener(listeners)) {\n      this.#events.set(event, [listeners, listener]);\n    }\n  }\n\n  removeListener<E extends keyof Events>(event: E, listener: Events[E]) {\n    if (!this.#events.has(event)) {\n      return;\n    }\n\n    const listenerOrListeners = this.#events.get(event);\n    let position = -1;\n\n    if (listenerOrListeners === listener) {\n      this.#events.delete(event);\n    } else if (Array.isArray(listenerOrListeners)) {\n      for (let i = length; i-- > 0; ) {\n        if (listenerOrListeners[i] === listener) {\n          position = i;\n          break;\n        }\n      }\n\n      if (position < 0) {\n        return;\n      }\n\n      if (listenerOrListeners.length === 1) {\n        listenerOrListeners.length = 0;\n        this.#events.delete(event);\n      } else {\n        listenerOrListeners.splice(position, 1);\n      }\n    }\n  }\n\n  removeAllListeners<E extends keyof Events>(event?: E) {\n    if (event && this.#events.has(event)) {\n      this.#events.delete(event);\n    } else if (event === undefined) {\n      this.#events.clear();\n    }\n  }\n\n  emit<E extends keyof Events>(event: E, ...args: Parameters<Events[E]>) {\n    if (this.#events) {\n      const handler = this.#events.get(event);\n      if (handler) {\n        this.invokeHandler(handler, args);\n      }\n    }\n  }\n\n  once<E extends keyof Events>(event: E, listener: Events[E]) {\n    const handler = ((...args) => {\n      this.removeListener(event, handler);\n      listener(...args);\n    }) as Events[E];\n\n    this.on(event, handler);\n  }\n\n  on<E extends keyof Events>(event: E, listener: Events[E]) {\n    this.addListener(event, listener);\n  }\n\n  hasListener<E extends keyof Events>(event: E, listener: Events[E]) {\n    const listeners = this.#events.get(event);\n    if (Array.isArray(listeners)) {\n      return listeners.includes(listener);\n    } else {\n      return listeners === listener;\n    }\n  }\n\n  private invokeHandler(handler: Listener | Array<Listener>, args: unknown[]) {\n    if (isArrayOfListeners(handler)) {\n      handler.slice().forEach((listener) => this.invokeHandler(listener, args));\n    } else {\n      switch (args.length) {\n        case 0:\n          handler();\n          break;\n        case 1:\n          handler(args[0]);\n          break;\n        case 2:\n          handler(args[0], args[1]);\n          break;\n        // slower\n        default:\n          handler.call(null, ...args);\n      }\n    }\n  }\n}\n", "import { VuuRange } from \"@vuu-ui/vuu-protocol-types\";\n\nexport class KeySet {\n  private keys: Map<number, number>;\n  private free: number[];\n  private nextKeyValue: number;\n\n  constructor(range: VuuRange) {\n    this.keys = new Map<number, number>();\n    this.free = [];\n    this.nextKeyValue = 0;\n    this.reset(range);\n  }\n\n  public next(): number {\n    if (this.free.length > 0) {\n      return this.free.pop() as number;\n    } else {\n      return this.nextKeyValue++;\n    }\n  }\n\n  public reset({ from, to }: VuuRange) {\n    this.keys.forEach((keyValue, rowIndex) => {\n      if (rowIndex < from || rowIndex >= to) {\n        this.free.push(keyValue);\n        this.keys.delete(rowIndex);\n      }\n    });\n\n    const size = to - from;\n    if (this.keys.size + this.free.length > size) {\n      this.free.length = Math.max(0, size - this.keys.size);\n    }\n\n    for (let rowIndex = from; rowIndex < to; rowIndex++) {\n      if (!this.keys.has(rowIndex)) {\n        const nextKeyValue = this.next();\n        this.keys.set(rowIndex, nextKeyValue);\n      }\n    }\n\n    if (this.nextKeyValue > this.keys.size) {\n      this.nextKeyValue = this.keys.size;\n    }\n  }\n\n  public keyFor(rowIndex: number): number {\n    const key = this.keys.get(rowIndex);\n    if (key === undefined) {\n      console.log(`key not found\n        keys: ${this.toDebugString()}\n        free : ${this.free.join(\",\")}  \n      `);\n      throw Error(`KeySet, no key found for rowIndex ${rowIndex}`);\n    }\n    return key;\n  }\n\n  public toDebugString() {\n    return Array.from(this.keys.entries())\n      .map<string>((k, v) => `${k}=>${v}`)\n      .join(\",\");\n  }\n}\n", "// This is the index.browser.js file from nanoid\n// couldn't get original code to work as npm import without crypro warnings -\n// seemed to be picking up node version, not browser version\n\nexport const uuid = (size = 21): string => {\n  let id = '';\n  const bytes = crypto.getRandomValues(new Uint8Array(size));\n\n  // A compact alternative for `for (var i = 0; i < step; i++)`.\n  while (size--) {\n    // It is incorrect to use bytes exceeding the alphabet size.\n    // The following mask reduces the random byte in the 0-255 value\n    // range to the 0-63 value range. Therefore, adding hacks, such\n    // as empty string fallback or magic numbers, is unneccessary because\n    // the bitmask trims bytes down to the alphabet size.\n    const byte = bytes[size] & 63;\n    if (byte < 36) {\n      // `0-9a-z`\n      id += byte.toString(36);\n    } else if (byte < 62) {\n      // `A-Z`\n      id += (byte - 26).toString(36).toUpperCase();\n    } else if (byte < 63) {\n      id += '_';\n    } else {\n      id += '-';\n    }\n  }\n  return id;\n};\n", "import {\n  DataSourceRow,\n  RangeTuple,\n  Selection,\n  SelectionItem,\n} from \"@vuu-ui/vuu-data-types\";\nimport { TableSelectionModel } from \"@vuu-ui/vuu-table-types\";\nimport { metadataKeys } from \"./column-utils\";\n\nconst NO_SELECTION: number[] = [];\n\nconst { SELECTED } = metadataKeys;\n\nexport const RowSelected = {\n  False: 0,\n  True: 1,\n  First: 2,\n  Last: 4,\n};\n\nexport const isRowSelected = (row: DataSourceRow): boolean =>\n  (row[SELECTED] & RowSelected.True) === RowSelected.True;\nexport const isRowSelectedLast = (row?: DataSourceRow): boolean =>\n  row !== undefined && (row[SELECTED] & RowSelected.Last) === RowSelected.Last;\n\nconst inAscendingOrder = (item1: SelectionItem, item2: SelectionItem) => {\n  const n1: number = typeof item1 === \"number\" ? item1 : item1[0];\n  const n2: number = typeof item2 === \"number\" ? item2 : item2[0];\n  return n1 - n2;\n};\n\nexport const deselectItem = (\n  selectionModel: TableSelectionModel,\n  selected: Selection,\n  itemIndex: number,\n  rangeSelect: boolean,\n  keepExistingSelection = false\n): Selection => {\n  const singleSelect = selectionModel === \"single\";\n  const multiSelect =\n    selectionModel === \"extended\" || selectionModel === \"checkbox\";\n  const actsLikeSingleSelect =\n    singleSelect || (multiSelect && !keepExistingSelection && !rangeSelect);\n\n  if (actsLikeSingleSelect || (!rangeSelect && !keepExistingSelection)) {\n    return NO_SELECTION;\n  } else if (!rangeSelect && keepExistingSelection) {\n    return removeSelectedItem(selected, itemIndex);\n  }\n  return NO_SELECTION;\n};\n\nconst newSelectedFillsGapOrExtends = (\n  selection: Selection,\n  itemIndex: number\n): boolean => {\n  for (let i = 0; i < selection.length; i++) {\n    const item = selection[i];\n    if (typeof item === \"number\") {\n      if (item === itemIndex - 1) {\n        return true;\n      } else if (item > itemIndex) {\n        return false;\n      }\n    } else if (item[0] === itemIndex + 1 || item[1] === itemIndex - 1) {\n      return true;\n    } else if (item[0] > itemIndex) {\n      return false;\n    }\n  }\n  return false;\n};\n\nconst fillGapOrExtendSelection = (\n  selection: Selection,\n  itemIndex: number\n): Selection => {\n  for (let i = 0; i < selection.length; i++) {\n    const item = selection[i];\n    if (typeof item === \"number\") {\n      if (item === itemIndex - 1) {\n        const nextSelectionItem = selection[i + 1];\n        if (nextSelectionItem === itemIndex + 1) {\n          const newRange: SelectionItem = [item, nextSelectionItem];\n          return selection\n            .slice(0, i)\n            .concat([newRange])\n            .concat(selection.slice(i + 2));\n        } else {\n          const newRange: SelectionItem = [item, itemIndex];\n          return selection\n            .slice(0, i)\n            .concat([newRange])\n            .concat(selection.slice(i + 1));\n        }\n      } else if (item > itemIndex) {\n        break;\n      }\n    } else if (item[0] === itemIndex + 1) {\n      const newRange: SelectionItem = [itemIndex, item[1]];\n      return selection\n        .slice(0, i)\n        .concat([newRange])\n        .concat(selection.slice(i + 1));\n    } else if (item[1] === itemIndex - 1) {\n      // check to see whether another contiguous range follows\n      const nextItem = selection[i + 1];\n      if (Array.isArray(nextItem) && nextItem[0] === itemIndex + 1) {\n        const newRange: SelectionItem = [item[0], nextItem[1]];\n        return selection\n          .slice(0, i)\n          .concat([newRange])\n          .concat(selection.slice(i + 2));\n      } else if (typeof nextItem === \"number\" && nextItem === itemIndex + 1) {\n        const newRange: SelectionItem = [item[0], nextItem];\n        return selection\n          .slice(0, i)\n          .concat([newRange])\n          .concat(selection.slice(i + 2));\n      } else {\n        const newRange: SelectionItem = [item[0], itemIndex];\n        return selection\n          .slice(0, i)\n          .concat([newRange])\n          .concat(selection.slice(i + 1));\n      }\n    }\n  }\n\n  return selection;\n};\n\nexport const selectItem = (\n  selectionModel: TableSelectionModel,\n  selected: Selection,\n  itemIndex: number,\n  rangeSelect: boolean,\n  keepExistingSelection = false,\n  activeItemIndex = -1\n): Selection => {\n  const singleSelect = selectionModel === \"single\";\n  const multiSelect =\n    selectionModel === \"extended\" || selectionModel === \"checkbox\";\n  const actsLikeSingleSelect =\n    singleSelect || (multiSelect && !keepExistingSelection && !rangeSelect);\n\n  if (selectionModel === \"none\") {\n    return NO_SELECTION;\n  } else if (actsLikeSingleSelect) {\n    return [itemIndex];\n  } else if (rangeSelect) {\n    if (selected.length === 0) {\n      return [itemIndex];\n    } else {\n      const range: RangeTuple =\n        itemIndex > activeItemIndex\n          ? [activeItemIndex, itemIndex]\n          : [itemIndex, activeItemIndex];\n      return insertRange(selected, range);\n    }\n  } else if (!rangeSelect) {\n    // what if we now have a range because we just filled  agap between 2\n    if (newSelectedFillsGapOrExtends(selected, itemIndex)) {\n      return fillGapOrExtendSelection(selected, itemIndex);\n    } else {\n      return selected?.concat(itemIndex).sort(inAscendingOrder);\n    }\n  } else if (multiSelect) {\n    // const [from, to] = idx > active ? [active, idx] : [idx, active];\n    // newSelected = selected?.slice();\n    // for (let i = from; i <= to; i++) {\n    //   if (!selected?.includes(i)) {\n    //     newSelected.push(i);\n    //   }\n    // }\n  }\n  return NO_SELECTION;\n};\n\nfunction removeSelectedItem(selected: Selection, itemIndex: number) {\n  if (selected.includes(itemIndex)) {\n    return selected.filter((selectedItem) => selectedItem !== itemIndex);\n  } else {\n    const newSelected: Selection = [];\n    for (const selectedItem of selected) {\n      if (Array.isArray(selectedItem)) {\n        if (rangeIncludes(selectedItem, itemIndex)) {\n          newSelected.push(...splitRange(selectedItem, itemIndex));\n        } else {\n          newSelected.push(selectedItem);\n        }\n      } else {\n        newSelected.push(selectedItem);\n      }\n    }\n    return newSelected;\n  }\n}\n\nfunction insertRange(selected: Selection, range: RangeTuple): Selection {\n  const [from, to] = range;\n  return selected.reduce<Selection>((newSelected, selectedItem) => {\n    if (typeof selectedItem === \"number\") {\n      if (selectedItem < from || selectedItem > to) {\n        newSelected.push(selectedItem);\n      } else if (!includedInRange(newSelected.at(-1), selectedItem)) {\n        newSelected.push(range);\n      }\n    } else if (overlappingRange(selectedItem, range)) {\n      newSelected.push(mergeRanges(selectedItem, range));\n    } else {\n      if (range[1] < selectedItem[0]) {\n        newSelected.push(range);\n      }\n      newSelected.push(selectedItem);\n    }\n\n    return newSelected;\n  }, []);\n}\n\nconst overlappingRange = (r1: RangeTuple, r2: RangeTuple) =>\n  (r1[1] >= r2[0] && r1[1] <= r2[1]) || (r1[0] >= r2[0] && r1[0] <= r2[1]);\nconst mergeRanges = (r1: RangeTuple, r2: RangeTuple): RangeTuple => [\n  Math.min(r1[0], r2[0]),\n  Math.max(r1[1], r2[1]),\n];\n\nconst includedInRange = (\n  selectedItem: SelectionItem | undefined,\n  index: number\n) => {\n  if (typeof selectedItem === \"undefined\" || typeof selectedItem === \"number\") {\n    return false;\n  } else return rangeIncludes(selectedItem, index);\n};\n\nconst rangeIncludes = (range: RangeTuple, index: number) =>\n  index >= range[0] && index <= range[1];\n\nconst SINGLE_SELECTED_ROW =\n  RowSelected.True + RowSelected.First + RowSelected.Last;\nconst FIRST_SELECTED_ROW_OF_BLOCK = RowSelected.True + RowSelected.First;\nconst LAST_SELECTED_ROW_OF_BLOCK = RowSelected.True + RowSelected.Last;\n\n/**\n *  Determine the value for selected. We use a bitmap to represent a number of selection states\n * a row might exhibit. selected/not-selected is the fundamental value. We also identify first\n * row of a selected block, last row of a selected block;\n */\nexport const getSelectionStatus = (\n  selected: Selection,\n  itemIndex: number\n): number => {\n  for (const item of selected) {\n    if (typeof item === \"number\") {\n      if (item === itemIndex) {\n        return SINGLE_SELECTED_ROW;\n      }\n    } else if (rangeIncludes(item, itemIndex)) {\n      if (itemIndex === item[0]) {\n        return FIRST_SELECTED_ROW_OF_BLOCK;\n      } else if (itemIndex === item[1]) {\n        return LAST_SELECTED_ROW_OF_BLOCK;\n      } else {\n        return RowSelected.True;\n      }\n    }\n  }\n  return RowSelected.False;\n};\n\nexport const isSelected = (selected: Selection, itemIndex: number) => {\n  for (const item of selected) {\n    if (typeof item === \"number\") {\n      if (item === itemIndex) {\n        return true;\n      } else if (item > itemIndex) {\n        return false;\n      }\n    } else if (rangeIncludes(item, itemIndex)) {\n      return true;\n    } else if (item[0] > itemIndex) {\n      return false;\n    }\n  }\n\n  return false;\n};\n/**\n * Vuu server expects a full list if indexes of selected rows. Client represents selection in a more\n * efficient structure. This converts client structure to full server format.\n */\nexport const expandSelection = (selected: Selection): number[] => {\n  if (selected.every((selectedItem) => typeof selectedItem === \"number\")) {\n    return selected as number[];\n  }\n  const expandedSelected = [];\n  for (const selectedItem of selected) {\n    if (typeof selectedItem === \"number\") {\n      expandedSelected.push(selectedItem);\n    } else {\n      for (let i = selectedItem[0]; i <= selectedItem[1]; i++) {\n        expandedSelected.push(i);\n      }\n    }\n  }\n  return expandedSelected;\n};\n\nfunction splitRange([from, to]: RangeTuple, itemIndex: number): Selection {\n  if (itemIndex === from) {\n    return [[from + 1, to]];\n  } else if (itemIndex === to) {\n    return [[from, to - 1]];\n  } else if (to - from === 2) {\n    return [from, to];\n  } else if (itemIndex === to - 1) {\n    return [[from, to - 2], to];\n  } else {\n    return [\n      [from, itemIndex - 1],\n      [itemIndex + 1, to],\n    ];\n  }\n}\n\nexport type SelectionDiff = {\n  added: SelectionItem[];\n  removed: SelectionItem[];\n};\n", "import { Tree } from \"@lezer/common\";\nimport {\n  Filter,\n  FilterCombinatorOp,\n  MultipleValueFilterClauseOp,\n  SingleValueFilterClauseOp,\n} from \"@vuu-ui/vuu-filter-types\";\nimport {\n  isMultiClauseFilter,\n  isMultiValueFilter,\n  isSingleValueFilter,\n} from \"@vuu-ui/vuu-utils\";\n\nclass FilterExpression {\n  public name: string | undefined;\n  #filter: Partial<Filter> | undefined = undefined;\n\n  setFilterCombinatorOp(op: string, filter = this.#filter) {\n    if (isMultiClauseFilter(filter) && filter.op === op) {\n      return;\n    } else {\n      this.#filter = {\n        op: op as FilterCombinatorOp,\n        filters: [this.#filter as Filter],\n      };\n    }\n  }\n\n  add(filter: Partial<Filter>) {\n    if (this.#filter === undefined) {\n      this.#filter = filter;\n    } else if (isMultiClauseFilter(this.#filter)) {\n      this.#filter.filters.push(filter as Filter);\n    } else {\n      throw Error(`Invalid filter passed to FilterExpression`);\n    }\n  }\n\n  setColumn(column: string, filter = this.#filter) {\n    if (isMultiClauseFilter(filter)) {\n      const target = filter.filters.at(-1);\n      if (target) {\n        this.setColumn(column, target);\n      }\n    } else if (filter) {\n      filter.column = column;\n    }\n  }\n  setOp(value: string, filter = this.#filter) {\n    if (isMultiClauseFilter(filter)) {\n      const target = filter.filters.at(-1);\n      if (target) {\n        this.setOp(value, target);\n      }\n    } else if (filter) {\n      filter.op = value as\n        | SingleValueFilterClauseOp\n        | MultipleValueFilterClauseOp;\n    }\n  }\n  setValue(value: string | number | boolean, filter = this.#filter) {\n    if (isMultiClauseFilter(filter)) {\n      const target = filter.filters.at(-1);\n      if (target) {\n        this.setValue(value, target);\n      }\n    } else if (isMultiValueFilter(filter)) {\n      filter.values ??= [];\n      // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n      // @ts-ignore\n      filter.values.push(value);\n    } else if (isSingleValueFilter(filter)) {\n      filter.value = value;\n    }\n  }\n\n  toJSON(filter = this.#filter) {\n    if (this.name) {\n      return {\n        ...filter,\n        name: this.name,\n      };\n    } else {\n      return filter;\n    }\n  }\n}\n\nexport const walkTree = (tree: Tree, source: string) => {\n  const filterExpression = new FilterExpression();\n  const cursor = tree.cursor();\n  do {\n    const { name, from, to } = cursor;\n    switch (name) {\n      case \"ColumnValueExpression\":\n        filterExpression.add({});\n        break;\n      case \"ColumnSetExpression\":\n        filterExpression.add({ op: \"in\" });\n        break;\n\n      case \"Or\":\n      case \"And\":\n        filterExpression.setFilterCombinatorOp(source.substring(from, to));\n        break;\n\n      case \"Column\":\n        filterExpression.setColumn(source.substring(from, to));\n        break;\n\n      case \"Operator\":\n        filterExpression.setOp(source.substring(from, to));\n        break;\n\n      case \"String\":\n        filterExpression.setValue(source.substring(from + 1, to - 1));\n        break;\n\n      case \"Number\":\n        filterExpression.setValue(parseFloat(source.substring(from, to)));\n        break;\n\n      case \"True\":\n        filterExpression.setValue(true);\n        break;\n\n      case \"False\":\n        filterExpression.setValue(false);\n        break;\n\n      case \"FilterName\":\n        filterExpression.name = source.substring(from, to);\n        break;\n\n      default:\n    }\n  } while (cursor.next());\n\n  return filterExpression.toJSON();\n};\n", "import { Filter } from \"@vuu-ui/vuu-filter-types\";\nimport { parser } from \"./generated/filter-parser\";\nimport { walkTree } from \"./FilterTreeWalker\";\n\nconst strictParser = parser.configure({ strict: true });\n\nexport const parseFilter = (filterQuery: string): Filter => {\n  const parseTree = strictParser.parse(filterQuery);\n  const filter = walkTree(parseTree, filterQuery) as Filter;\n  return filter;\n};\n", "import { DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport {\n  AndFilter,\n  Filter,\n  MultiValueFilterClause,\n  OrFilter,\n  SingleValueFilterClause,\n} from \"@vuu-ui/vuu-filter-types\";\nimport { ColumnMap } from \"@vuu-ui/vuu-utils\";\nimport { parseFilter } from \"./FilterParser\";\n\nconst filterPredicateMap = new Map<string, FilterPredicate>();\nconst filterReject = () => false;\n\nexport const getFilterPredicate = (\n  columnMap: ColumnMap,\n  filterQuery: string\n): FilterPredicate => {\n  let predicate = filterPredicateMap.get(filterQuery);\n  if (predicate) {\n    return predicate;\n  }\n  // TODO we need to clear cache if columns change. How do we identify this :\n  try {\n    const filter = parseFilter(filterQuery);\n    predicate = filterPredicate(columnMap, filter);\n    filterPredicateMap.set(filterQuery, predicate);\n    return predicate;\n  } catch (err) {\n    console.warn(\n      `filter-evaluation-utils, failed to parse filter \"${filterQuery}\"`\n    );\n    return filterReject;\n  }\n};\n\nexport function filterPredicate(\n  columnMap: ColumnMap,\n  filter: Filter\n): FilterPredicate {\n  //TODO convert filter to include colIdx ratherthan colName, so we don't have to pass cols\n  switch (filter.op) {\n    case \"in\":\n      return testInclude(columnMap, filter);\n    case \"=\":\n      return testEQ(columnMap, filter);\n    case \">\":\n      return testGT(columnMap, filter);\n    case \">=\":\n      return testGE(columnMap, filter);\n    case \"<\":\n      return testLT(columnMap, filter);\n    case \"<=\":\n      return testLE(columnMap, filter);\n    case \"starts\":\n      return testSW(columnMap, filter);\n    case \"and\":\n      return testAND(columnMap, filter as AndFilter);\n    case \"or\":\n      return testOR(columnMap, filter as OrFilter);\n    default:\n      console.log(`unrecognized filter type ${filter.op}`);\n      return () => true;\n  }\n}\n\nexport type FilterPredicate = (row: DataSourceRow) => boolean;\n\nconst testInclude = (\n  columnMap: ColumnMap,\n  filter: MultiValueFilterClause\n): FilterPredicate => {\n  return (row) =>\n    (filter.values as unknown[]).indexOf(row[columnMap[filter.column]]) !== -1;\n};\n\nconst testEQ = (\n  columnMap: ColumnMap,\n  filter: SingleValueFilterClause\n): FilterPredicate => {\n  return (row) => row[columnMap[filter.column]] === filter.value;\n};\n\nconst testGT = (\n  columnMap: ColumnMap,\n  filter: SingleValueFilterClause\n): FilterPredicate => {\n  return (row) => row[columnMap[filter.column]] > filter.value;\n};\nconst testGE = (\n  columnMap: ColumnMap,\n  filter: SingleValueFilterClause\n): FilterPredicate => {\n  return (row) => row[columnMap[filter.column]] >= filter.value;\n};\n\nconst testLT = (\n  columnMap: ColumnMap,\n  filter: SingleValueFilterClause\n): FilterPredicate => {\n  return (row) => row[columnMap[filter.column]] < filter.value;\n};\nconst testLE = (\n  columnMap: ColumnMap,\n  filter: SingleValueFilterClause\n): FilterPredicate => {\n  return (row) => row[columnMap[filter.column]] <= filter.value;\n};\n\nconst testSW = (\n  columnMap: ColumnMap,\n  filter: SingleValueFilterClause\n): FilterPredicate => {\n  const filterValue = filter.value as string;\n  if (typeof filterValue !== \"string\") {\n    throw Error(\"string filter applied to value of wrong type\");\n  }\n  return (row) => {\n    const rowValue = row[columnMap[filter.column]];\n    if (typeof rowValue !== \"string\") {\n      throw Error(\"string filter applied to value of wrong type\");\n    }\n    return rowValue.toLowerCase().startsWith(filterValue.toLowerCase());\n  };\n};\n\nconst testAND = (columnMap: ColumnMap, filter: AndFilter): FilterPredicate => {\n  const filters = filter.filters.map((f1) => filterPredicate(columnMap, f1));\n  return (row) => filters.every((fn) => fn(row));\n};\n\nfunction testOR(columnMap: ColumnMap, filter: OrFilter): FilterPredicate {\n  const filters = filter.filters.map((f1) => filterPredicate(columnMap, f1));\n  return (row) => filters.some((fn) => fn(row));\n}\n", "import { DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport { VuuAggregation, VuuGroupBy } from \"@vuu-ui/vuu-protocol-types\";\nimport { ColumnMap } from \"@vuu-ui/vuu-utils\";\nimport { GroupMap, KeyList } from \"./group-utils\";\n\nexport const count = (arr: any[]) => arr.length;\n\nexport const aggregateData = (\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupBy: VuuGroupBy,\n  leafData: readonly DataSourceRow[],\n  columnMap: ColumnMap,\n  groupMap: GroupMap\n) => {\n  const aggColumn = getAggColumn(columnMap, aggregations);\n  const aggType = aggregations[aggregations.length - 1].aggType;\n  const groupIndices = groupBy.map<number>((column) => columnMap[column]);\n\n  switch (aggType) {\n    case 1:\n      return aggregateSum(\n        groupMap,\n        leafData,\n        columnMap,\n        aggregations,\n        targetData,\n        groupIndices\n      );\n    case 2:\n      return aggregateAverage(\n        groupMap,\n        leafData,\n        columnMap,\n        aggregations,\n        targetData,\n        groupIndices\n      );\n    case 3:\n      return aggregateCount(\n        groupMap,\n        columnMap,\n        aggregations,\n        targetData,\n        groupIndices\n      );\n    case 4:\n      return aggregateHigh(\n        groupMap,\n        leafData,\n        columnMap,\n        aggregations,\n        targetData,\n        groupIndices\n      );\n    case 5:\n      return aggregateLow(\n        groupMap,\n        leafData,\n        columnMap,\n        aggregations,\n        targetData,\n        groupIndices\n      );\n    case 6:\n      return aggregateDistinct(\n        groupMap,\n        leafData,\n        columnMap,\n        aggregations,\n        targetData,\n        groupIndices\n      );\n  }\n};\n\nfunction aggregateCount(\n  groupMap: GroupMap,\n  columnMap: ColumnMap,\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupIndices: number[]\n): { [key: string]: number } {\n  const counts: { [key: string]: number } = {};\n  const aggColumn = getAggColumn(columnMap, aggregations);\n\n  function countRecursive(map: GroupMap | KeyList) {\n    if (Array.isArray(map)) {\n      return map.length;\n    } else {\n      let count = 0;\n      for (const key in map) {\n        count += 1 + countRecursive(map[key]);\n      }\n      return count;\n    }\n  }\n\n  for (const key in groupMap) {\n    const count = countRecursive(groupMap[key]);\n    counts[key] = count;\n  }\n\n  for (let index = 0; index < targetData.length; index++) {\n    for (const key in counts) {\n      if (targetData[index][groupIndices[0]] === key) {\n        targetData[index][aggColumn] = counts[key];\n      }\n    }\n  }\n\n  console.log(\"!!!! targetData\", targetData);\n  console.log(\"!!!! counts\", counts);\n  return counts;\n}\n\nfunction getAggColumn(columnMap: ColumnMap, aggregations: VuuAggregation[]) {\n  console.log(\"!!!! aggregation length\", aggregations.length);\n  const columnName = aggregations[aggregations.length - 1].column;\n  const columnNumber = columnMap[columnName];\n  return columnNumber;\n}\n\nfunction aggregateSum(\n  groupMap: GroupMap,\n  leafData: readonly DataSourceRow[],\n  columnMap: ColumnMap,\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupIndices: number[]\n): { [key: string]: number } {\n  const sums: { [key: string]: number } = {};\n  const aggColumn = getAggColumn(columnMap, aggregations);\n\n  function sumRecursive(\n    map: GroupMap | KeyList,\n    leafData: readonly DataSourceRow[],\n    aggColumn: number\n  ) {\n    if (Array.isArray(map)) {\n      let sum = 0;\n      for (const key of map) {\n        sum += Number(leafData[key][aggColumn]);\n      }\n      return sum;\n    } else {\n      let sum = 0;\n      for (const key in map) {\n        sum += sumRecursive(map[key], leafData, aggColumn);\n      }\n      return sum;\n    }\n  }\n\n  for (const key in groupMap) {\n    console.log(key);\n    const sum = Number(sumRecursive(groupMap[key], leafData, aggColumn));\n    sums[key] = sum;\n  }\n\n  for (let index = 0; index < targetData.length; index++) {\n    for (const key in sums) {\n      if (targetData[index][groupIndices[0]] === key) {\n        targetData[index][aggColumn] = sums[key];\n      }\n    }\n  }\n\n  console.log(\"!!!! targetData\", targetData);\n  console.log(\"!!!! sums\", sums);\n  return sums;\n}\n\nfunction aggregateAverage(\n  groupMap: GroupMap,\n  leafData: readonly DataSourceRow[],\n  columnMap: ColumnMap,\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupIndices: number[]\n): { [key: string]: number } {\n  const averages: { [key: string]: number } = {};\n  const aggColumn = getAggColumn(columnMap, aggregations);\n\n  const count = aggregateCount(\n    groupMap,\n    columnMap,\n    aggregations,\n    targetData,\n    groupIndices\n  );\n  const sum = aggregateSum(\n    groupMap,\n    leafData,\n    columnMap,\n    aggregations,\n    targetData,\n    groupIndices\n  );\n\n  for (const key in count) {\n    let average = 0;\n    average = sum[key] / count[key];\n    averages[key] = average;\n  }\n\n  for (let index = 0; index < targetData.length; index++) {\n    for (const key in averages) {\n      if (targetData[index][groupIndices[0]] === key) {\n        targetData[index][aggColumn] = averages[key];\n      }\n    }\n  }\n\n  console.log(\"!!!! targetData\", targetData);\n  console.log(\"!!!! averages\", averages);\n  return averages;\n}\n\nfunction getLeafColumnData(\n  map: GroupMap | KeyList,\n  leafData: readonly DataSourceRow[],\n  aggColumn: number\n): number[] {\n  const data: number[] = [];\n\n  if (Array.isArray(map)) {\n    for (const key of map) {\n      data.push(leafData[key][aggColumn] as number);\n    }\n  } else {\n    for (const key in map) {\n      data.push(...getLeafColumnData(map[key], leafData, aggColumn));\n    }\n  }\n\n  return data;\n}\n\nfunction aggregateDistinct(\n  groupMap: GroupMap,\n  leafData: readonly DataSourceRow[],\n  columnMap: ColumnMap,\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupIndices: number[]\n): { [key: string]: number } {\n  const distincts: { [key: string]: number } = {};\n  const aggColumn = getAggColumn(columnMap, aggregations);\n\n  for (const key in groupMap) {\n    const leafColumnData = getLeafColumnData(\n      groupMap[key],\n      leafData,\n      aggColumn\n    );\n    const distinct: any = [...new Set(leafColumnData)];\n\n    distincts[key] = distinct;\n  }\n\n  for (let index = 0; index < targetData.length; index++) {\n    for (const key in distincts) {\n      if (targetData[index][groupIndices[0]] === key) {\n        targetData[index][aggColumn] = distincts[key];\n      }\n    }\n  }\n\n  return distincts;\n}\n\nfunction aggregateHigh(\n  groupMap: GroupMap,\n  leafData: readonly DataSourceRow[],\n  columnMap: ColumnMap,\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupIndices: number[]\n): { [key: string]: number } {\n  const highs: { [key: string]: number } = {};\n  const aggColumn = getAggColumn(columnMap, aggregations);\n\n  for (const key in groupMap) {\n    const leafColumnData = getLeafColumnData(\n      groupMap[key],\n      leafData,\n      aggColumn\n    );\n    const maxNumber = Math.max(...leafColumnData);\n\n    highs[key] = maxNumber;\n  }\n  for (let index = 0; index < targetData.length; index++) {\n    for (const key in highs) {\n      if (targetData[index][groupIndices[0]] === key) {\n        targetData[index][aggColumn] = highs[key];\n      }\n    }\n  }\n\n  return highs;\n}\n\nfunction aggregateLow(\n  groupMap: GroupMap,\n  leafData: readonly DataSourceRow[],\n  columnMap: ColumnMap,\n  aggregations: VuuAggregation[],\n  targetData: readonly DataSourceRow[],\n  groupIndices: number[]\n): { [key: string]: number } {\n  const mins: { [key: string]: number } = {};\n  const aggColumn = getAggColumn(columnMap, aggregations);\n\n  for (const key in groupMap) {\n    const leafColumnData = getLeafColumnData(\n      groupMap[key],\n      leafData,\n      aggColumn\n    );\n    const minNumber = Math.min(...leafColumnData);\n    mins[key] = minNumber;\n  }\n\n  for (let index = 0; index < targetData.length; index++) {\n    for (const key in mins) {\n      if (targetData[index][groupIndices[0]] === key) {\n        targetData[index][aggColumn] = mins[key];\n      }\n    }\n  }\n\n  return mins;\n}\n", "import { DataSourceRow, Selection } from \"@vuu-ui/vuu-data-types\";\nimport {\n  ColumnMap,\n  getSelectionStatus,\n  KeySet,\n  metadataKeys,\n} from \"@vuu-ui/vuu-utils\";\n\nconst { RENDER_IDX, SELECTED } = metadataKeys;\n\nexport const toClientRow = (\n  row: DataSourceRow,\n  keys: KeySet,\n  selection: Selection,\n  dataIndices?: number[]\n) => {\n  const [rowIndex] = row;\n  let clientRow;\n  if (dataIndices) {\n    // If client has specified a different ordering of columns from the way they are\n    // ordered inn the underlying data, this is where we effect the ordering.\n    const { count } = metadataKeys;\n    clientRow = row\n      .slice(0, count)\n      .concat(dataIndices.map((idx) => row[idx])) as DataSourceRow;\n  } else {\n    clientRow = row.slice() as DataSourceRow;\n  }\n  clientRow[RENDER_IDX] = keys.keyFor(rowIndex);\n  clientRow[SELECTED] = getSelectionStatus(selection, rowIndex);\n  return clientRow;\n};\n\nconst divergentMaps = (columnMap: ColumnMap, dataMap?: ColumnMap) => {\n  if (dataMap) {\n    const { count: mapOffset } = metadataKeys;\n    for (const [columnName, index] of Object.entries(columnMap)) {\n      const dataIdx = dataMap[columnName];\n      if (dataIdx === undefined) {\n        throw Error(\n          `ArrayDataSource column ${columnName} is not in underlying data set`\n        );\n      } else if (dataIdx !== index - mapOffset) {\n        return true;\n      }\n    }\n  }\n  return false;\n};\n\nconst getDataIndices = (columnMap: ColumnMap, dataMap: ColumnMap) => {\n  const { count: mapOffset } = metadataKeys;\n  const result: number[] = [];\n  Object.entries(columnMap).forEach(([columnName]) => {\n    result.push(dataMap[columnName] + mapOffset);\n  });\n  return result;\n};\n\nexport const buildDataToClientMap = (\n  columnMap: ColumnMap,\n  dataMap?: ColumnMap\n): number[] | undefined => {\n  if (dataMap && divergentMaps(columnMap, dataMap)) {\n    return getDataIndices(columnMap, dataMap);\n  }\n  return undefined;\n};\n", "import { DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport { VuuGroupBy } from \"@vuu-ui/vuu-protocol-types\";\nimport { ColumnMap, metadataKeys } from \"@vuu-ui/vuu-utils\";\n\nexport type KeyList = number[];\nexport type GroupMap = { [key: string]: GroupMap | KeyList };\n\nconst { DEPTH, IS_EXPANDED, KEY } = metadataKeys;\n\nexport const collapseGroup = (\n  key: string,\n  groupedRows: readonly DataSourceRow[]\n): DataSourceRow[] => {\n  const rows: DataSourceRow[] = [];\n\n  for (\n    let i = 0, idx = 0, collapsed = false, len = groupedRows.length;\n    i < len;\n    i++\n  ) {\n    const row = groupedRows[i];\n    const { [DEPTH]: depth, [KEY]: rowKey } = row;\n    if (rowKey === key) {\n      const collapsedRow = row.slice() as DataSourceRow;\n      collapsedRow[IS_EXPANDED] = false;\n      rows.push(collapsedRow);\n      idx += 1;\n      collapsed = true;\n      while (i < len - 1 && groupedRows[i + 1][DEPTH] > depth) {\n        i += 1;\n      }\n    } else if (collapsed) {\n      const newRow = row.slice() as DataSourceRow;\n      newRow[0] = idx;\n      newRow[1] = idx;\n      rows.push(newRow);\n      idx += 1;\n    } else {\n      rows.push(row);\n      idx += 1;\n    }\n  }\n\n  return rows;\n};\n\nexport const expandGroup = (\n  keys: string[],\n  sourceRows: readonly DataSourceRow[],\n  groupBy: VuuGroupBy,\n  columnMap: ColumnMap,\n  groupMap: GroupMap,\n  processedData: readonly DataSourceRow[]\n): DataSourceRow[] => {\n  const groupIndices = groupBy.map<number>((column) => columnMap[column]);\n  return dataRowsFromGroups2(\n    groupMap,\n    groupIndices,\n    keys,\n    sourceRows,\n    undefined,\n    undefined,\n    undefined,\n    processedData\n  );\n};\n\nconst dataRowsFromGroups2 = (\n  groupMap: GroupMap,\n  groupIndices: number[],\n  openKeys: string[],\n  sourceRows: readonly DataSourceRow[] = [],\n  root = \"$root\",\n  depth = 1,\n  rows: DataSourceRow[] = [],\n  processedData: readonly DataSourceRow[]\n) => {\n  console.log(`dataRowsFromGroups2 1)`);\n  const keys = Object.keys(groupMap).sort();\n  for (const key of keys) {\n    const idx = rows.length;\n    const groupKey = `${root}|${key}`;\n    const row: DataSourceRow = [idx, idx, false, false, depth, 0, groupKey, 0];\n    // TODO whats this\n    row[groupIndices[depth - 1]] = key;\n    rows.push(row);\n\n    if (openKeys.includes(groupKey)) {\n      row[IS_EXPANDED] = true;\n      if (Array.isArray(groupMap[key])) {\n        pushChildren(\n          rows,\n          groupMap[key] as KeyList,\n          sourceRows,\n          groupKey,\n          depth + 1\n        );\n      } else {\n        dataRowsFromGroups2(\n          groupMap[key] as GroupMap,\n          groupIndices,\n          openKeys,\n          sourceRows,\n          groupKey,\n          depth + 1,\n          rows,\n          processedData\n        );\n      }\n    }\n  }\n  console.log(`dataRowsFromGroups2 2)`);\n\n  for (const key in rows) {\n    for (const index in rows) {\n      if (rows[key][2] === false && processedData[index] != undefined) {\n        if (\n          rows[key][groupIndices[0]] === processedData[index][groupIndices[0]]\n        ) {\n          rows[key] = rows[key].splice(0, 8).concat(\n            processedData[index].slice(\n              8, // groupIndices[0] + 1,\n              processedData[index].length\n            )\n          ) as DataSourceRow;\n          break;\n        }\n      }\n    }\n  }\n  console.log(`dataRowsFromGroups2 3)`);\n\n  return rows;\n};\n\nconst pushChildren = (\n  rows: DataSourceRow[],\n  tree: KeyList,\n  sourceRows: readonly DataSourceRow[],\n  parentKey: string,\n  depth: number\n) => {\n  for (const rowIdx of tree) {\n    const idx = rows.length;\n    const sourceRow = sourceRows[rowIdx].slice() as DataSourceRow;\n    sourceRow[0] = idx;\n    sourceRow[1] = idx;\n    sourceRow[DEPTH] = depth;\n    sourceRow[KEY] = `${parentKey}|${sourceRow[KEY]}`;\n    rows.push(sourceRow);\n  }\n};\n\nexport const groupRows = (\n  rows: readonly DataSourceRow[],\n  groupBy: VuuGroupBy,\n  columnMap: ColumnMap\n): [DataSourceRow[], GroupMap] => {\n  const groupIndices = groupBy.map<number>((column) => columnMap[column]);\n  const groupTree = groupLeafRows(rows, groupIndices);\n  const groupedDataRows = dataRowsFromGroups(groupTree, groupIndices);\n  // 2) collapse int groups\n\n  return [groupedDataRows, groupTree];\n};\n\nconst dataRowsFromGroups = (groupTree: GroupMap, groupIndices: number[]) => {\n  const depth = 0;\n  const rows: DataSourceRow[] = [];\n  let idx = 0;\n  const keys = Object.keys(groupTree).sort();\n  for (const key of keys) {\n    const row: DataSourceRow = [\n      idx,\n      idx,\n      false,\n      false,\n      1,\n      0,\n      `$root|${key}`,\n      0,\n    ];\n    row[groupIndices[depth]] = key;\n    rows.push(row);\n    idx += 1;\n  }\n  return rows;\n};\n\nfunction groupLeafRows(leafRows: readonly DataSourceRow[], groupby: number[]) {\n  const groups: GroupMap = {};\n  const levels = groupby.length;\n  const lastLevel = levels - 1;\n  for (let i = 0, len = leafRows.length; i < len; i++) {\n    const leafRow = leafRows[i];\n    let target: GroupMap | KeyList = groups;\n    let targetNode;\n    let key;\n    for (let level = 0; level < levels; level++) {\n      const colIdx = groupby[level];\n      key = leafRow[colIdx].toString();\n      targetNode = (target as GroupMap)[key];\n      if (targetNode && level === lastLevel) {\n        // we're at leaf level, targetNode can only be a KeyList\n        (targetNode as KeyList).push(i);\n      } else if (targetNode) {\n        target = targetNode;\n      } else if (!targetNode && level < lastLevel) {\n        // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n        // @ts-ignore\n        target = target[key] = {};\n      } else if (!targetNode) {\n        (target as GroupMap)[key] = [i];\n      }\n    }\n  }\n  console.log(\"!! groups\", groups);\n  return groups;\n}\n", "import { DataSourceRow } from \"@vuu-ui/vuu-data-types\";\nimport { VuuSort, VuuSortType } from \"@vuu-ui/vuu-protocol-types\";\nimport { ColumnMap } from \"@vuu-ui/vuu-utils\";\n\ntype SortDef = [number, VuuSortType];\ntype SortPredicate = (\n  r1: DataSourceRow,\n  r2: DataSourceRow,\n  sortDefDef: SortDef\n) => SortCompareResult;\ntype SortCompareResult = 0 | 1 | -1;\ntype RowSortComparatorFactory = (\n  sortDefs: SortDef[],\n  test?: SortPredicate\n) => RowSortComparator;\ntype RowSortComparator = (\n  item1: DataSourceRow,\n  item2: DataSourceRow\n) => SortCompareResult;\n\nconst defaultSortPredicate: SortPredicate = (r1, r2, [i, direction]) => {\n  const val1 = direction === \"D\" ? r2[i] : r1[i];\n  const val2 = direction === \"D\" ? r1[i] : r2[i];\n  if (val1 === val2) {\n    return 0;\n  } else if (val2 === null || val1 > val2) {\n    return 1;\n  } else {\n    return -1;\n  }\n};\n\nconst sortComparator = (sortDefs: SortDef[]): RowSortComparator => {\n  if (sortDefs.length === 1) {\n    return singleColComparator(sortDefs);\n  } else if (sortDefs.length === 2) {\n    return twoColComparator(sortDefs);\n  } else {\n    return multiColComparator(sortDefs);\n  }\n};\n\nconst singleColComparator: RowSortComparatorFactory =\n  ([[i, direction]]) =>\n  (r1, r2) => {\n    const v1 = direction === \"D\" ? r2[i] : r1[i];\n    const v2 = direction === \"D\" ? r1[i] : r2[i];\n    return v1 > v2 ? 1 : v2 > v1 ? -1 : 0;\n  };\n\nconst twoColComparator: RowSortComparatorFactory =\n  ([[idx1, direction1], [idx2, direction2]]) =>\n  (r1, r2) => {\n    const v1 = direction1 === \"D\" ? r2[idx1] : r1[idx1];\n    const v2 = direction1 === \"D\" ? r1[idx1] : r2[idx1];\n    const v3 = direction2 === \"D\" ? r2[idx2] : r1[idx2];\n    const v4 = direction2 === \"D\" ? r1[idx2] : r2[idx2];\n    return v1 > v2 ? 1 : v2 > v1 ? -1 : v3 > v4 ? 1 : v4 > v3 ? -1 : 0;\n  };\n\nconst multiColComparator: RowSortComparatorFactory =\n  (sortDefs, test = defaultSortPredicate) =>\n  (r1, r2) => {\n    for (const sortDef of sortDefs) {\n      const result = test(r1, r2, sortDef);\n      if (result !== 0) {\n        return result;\n      }\n    }\n    return 0;\n  };\n\nexport const sortRows = (\n  rows: readonly DataSourceRow[],\n  { sortDefs }: VuuSort,\n  columnMap: ColumnMap\n) => {\n  const indexedSortDefs = sortDefs.map<SortDef>(({ column, sortType }) => [\n    columnMap[column],\n    sortType,\n  ]);\n  const comparator = sortComparator(indexedSortDefs);\n  return rows.slice().sort(comparator);\n};\n", "import {\n  DataSource,\n  DataSourceConfig,\n  DataSourceConstructorProps,\n  DataSourceEvents,\n  DataSourceFilter,\n  DataSourceRow,\n  DataSourceStatus,\n  MenuRpcResponse,\n  Selection,\n  SubscribeCallback,\n  SubscribeProps,\n  TableSchema,\n  VuuUIMessageInRPCEditReject,\n  VuuUIMessageInRPCEditResponse,\n  WithFullConfig,\n} from \"@vuu-ui/vuu-data-types\";\nimport { filterPredicate, parseFilter } from \"@vuu-ui/vuu-filter-parser\";\nimport {\n  ClientToServerEditRpc,\n  ClientToServerMenuRPC,\n  LinkDescriptorWithLabel,\n  VuuAggregation,\n  VuuGroupBy,\n  VuuMenu,\n  VuuRange,\n  VuuRowDataItemType,\n  VuuSort,\n} from \"@vuu-ui/vuu-protocol-types\";\nimport { ColumnDescriptor } from \"@vuu-ui/vuu-table-types\";\nimport {\n  buildColumnMap,\n  ColumnMap,\n  configChanged,\n  EventEmitter,\n  getAddedItems,\n  getMissingItems,\n  groupByChanged,\n  hasFilter,\n  hasGroupBy,\n  hasSort,\n  KeySet,\n  logger,\n  metadataKeys,\n  NULL_RANGE,\n  rangeNewItems,\n  resetRange,\n  uuid,\n  vanillaConfig,\n  withConfigDefaults,\n} from \"@vuu-ui/vuu-utils\";\nimport { aggregateData } from \"./aggregate-utils\";\nimport { buildDataToClientMap, toClientRow } from \"./array-data-utils\";\nimport { collapseGroup, expandGroup, GroupMap, groupRows } from \"./group-utils\";\nimport { sortRows } from \"./sort-utils\";\n\nconst { KEY } = metadataKeys;\n\nexport interface ArrayDataSourceConstructorProps\n  extends Omit<DataSourceConstructorProps, \"bufferSize\" | \"table\"> {\n  columnDescriptors: ColumnDescriptor[];\n  data: Array<VuuRowDataItemType[]>;\n  dataMap?: ColumnMap;\n  keyColumn?: string;\n  rangeChangeRowset?: \"delta\" | \"full\";\n}\nconst { debug } = logger(\"ArrayDataSource\");\n\nconst toDataSourceRow =\n  (key: number) =>\n  (data: VuuRowDataItemType[], index: number): DataSourceRow => {\n    return [index, index, true, false, 1, 0, String(data[key]), 0, ...data];\n  };\n\nconst buildTableSchema = (\n  columns: ColumnDescriptor[],\n  keyColumn?: string\n): TableSchema => {\n  const schema: TableSchema = {\n    columns: columns.map(({ name, serverDataType = \"string\" }) => ({\n      name,\n      serverDataType,\n    })),\n    key: keyColumn ?? columns[0].name,\n    table: { module: \"\", table: \"Array\" },\n  };\n\n  return schema;\n};\n\nexport class ArrayDataSource\n  extends EventEmitter<DataSourceEvents>\n  implements DataSource\n{\n  private clientCallback: SubscribeCallback | undefined;\n  private columnDescriptors: ColumnDescriptor[];\n  /** sorted offsets of data within raw data, reflecting sort order\n   * of columns specified by client.\n   */\n  private dataIndices: number[] | undefined;\n  /** Map reflecting positions of data items in raw data */\n  private dataMap: ColumnMap | undefined;\n  private groupMap: undefined | GroupMap;\n  /** the index of key field within raw data row */\n  private key: number;\n  private lastRangeServed: VuuRange = { from: 0, to: 0 };\n  private rangeChangeRowset: \"delta\" | \"full\";\n  private openTreeNodes: string[] = [];\n\n  /** Map reflecting positions of columns in client data sent to user */\n  #columnMap: ColumnMap;\n  #config: WithFullConfig = vanillaConfig;\n  #data: DataSourceRow[];\n  #links: LinkDescriptorWithLabel[] | undefined;\n  #range: VuuRange = NULL_RANGE;\n  #selectedRowsCount = 0;\n  #size = 0;\n  #status: DataSourceStatus = \"initialising\";\n  #title: string | undefined;\n\n  protected _menu: VuuMenu | undefined;\n  protected selectedRows: Selection = [];\n\n  public tableSchema: TableSchema;\n  public viewport: string;\n\n  private keys = new KeySet(this.#range);\n  protected processedData: DataSourceRow[] | undefined = undefined;\n\n  constructor({\n    aggregations,\n    // different from RemoteDataSource\n    columnDescriptors,\n    data,\n    dataMap,\n    filter,\n    groupBy,\n    keyColumn,\n    rangeChangeRowset = \"delta\",\n    sort,\n    title,\n    viewport,\n  }: ArrayDataSourceConstructorProps) {\n    super();\n\n    if (!data || !columnDescriptors) {\n      throw Error(\n        \"ArrayDataSource constructor called without data or without columnDescriptors\"\n      );\n    }\n\n    this.columnDescriptors = columnDescriptors;\n    this.dataMap = dataMap;\n    this.key = keyColumn\n      ? this.columnDescriptors.findIndex((col) => col.name === keyColumn)\n      : 0;\n    this.rangeChangeRowset = rangeChangeRowset;\n    this.tableSchema = buildTableSchema(columnDescriptors, keyColumn);\n    this.viewport = viewport || uuid();\n    this.#size = data.length;\n    this.#title = title;\n\n    const columns = columnDescriptors.map((col) => col.name);\n    this.#columnMap = buildColumnMap(columns);\n    this.dataIndices = buildDataToClientMap(this.#columnMap, this.dataMap);\n    this.#data = data.map<DataSourceRow>(toDataSourceRow(this.key));\n\n    this.config = {\n      ...this.#config,\n      aggregations: aggregations || this.#config.aggregations,\n      columns,\n      filter: filter || this.#config.filter,\n      groupBy: groupBy || this.#config.groupBy,\n      sort: sort || this.#config.sort,\n    };\n\n    debug?.(`columnMap: ${JSON.stringify(this.#columnMap)}`);\n  }\n\n  async subscribe(\n    {\n      viewport = this.viewport ?? uuid(),\n      columns,\n      aggregations,\n      range,\n      sort,\n      groupBy,\n      filter,\n    }: SubscribeProps,\n    callback: SubscribeCallback\n  ) {\n    this.clientCallback = callback;\n    this.viewport = viewport;\n    this.#status = \"subscribed\";\n    this.lastRangeServed = { from: 0, to: 0 };\n\n    let config = this.#config;\n\n    const hasConfigProps = aggregations || columns || filter || groupBy || sort;\n    if (hasConfigProps) {\n      if (range) {\n        this.#range = range;\n      }\n      config = {\n        ...config,\n        aggregations: aggregations || this.#config.aggregations,\n        columns: columns || this.#config.columns,\n        filter: filter || this.#config.filter,\n        groupBy: groupBy || this.#config.groupBy,\n        sort: sort || this.#config.sort,\n      };\n    }\n\n    this.clientCallback?.({\n      ...config,\n      type: \"subscribed\",\n      clientViewportId: this.viewport,\n      range: this.#range,\n      tableSchema: this.tableSchema,\n    });\n\n    if (hasConfigProps) {\n      // invoke setter to action config\n      this.config = config;\n    } else {\n      this.clientCallback({\n        clientViewportId: this.viewport,\n        mode: \"size-only\",\n        type: \"viewport-update\",\n        size: this.#data.length,\n      });\n      if (range) {\n        // set range and trigger dispatch of initial rows\n        this.range = range;\n      } else if (this.#range !== NULL_RANGE) {\n        this.sendRowsToClient();\n      }\n    }\n  }\n\n  unsubscribe() {\n    console.log(\"unsubscribe noop\");\n  }\n\n  suspend() {\n    // console.log(\"noop\");\n    return this;\n  }\n\n  resume() {\n    // console.log(\"resume noop\");\n    return this;\n  }\n\n  disable() {\n    // console.log(\"disable noop\");\n    return this;\n  }\n\n  enable() {\n    // console.log(\"enable noop\");\n    return this;\n  }\n\n  select(selected: Selection) {\n    this.#selectedRowsCount = selected.length;\n    debug?.(`select ${JSON.stringify(selected)}`);\n    this.selectedRows = selected;\n    this.setRange(resetRange(this.#range), true);\n  }\n\n  openTreeNode(key: string) {\n    this.openTreeNodes.push(key);\n    this.processedData = expandGroup(\n      this.openTreeNodes,\n      this.#data,\n      this.#config.groupBy,\n      this.#columnMap,\n      this.groupMap as GroupMap,\n      this.processedData as DataSourceRow[]\n    );\n    this.setRange(resetRange(this.#range), true);\n  }\n\n  closeTreeNode(key: string) {\n    this.openTreeNodes = this.openTreeNodes.filter((value) => value !== key);\n    if (this.processedData) {\n      this.processedData = collapseGroup(key, this.processedData);\n      this.setRange(resetRange(this.#range), true);\n    }\n  }\n\n  get links() {\n    return this.#links;\n  }\n\n  get menu() {\n    return this._menu;\n  }\n\n  get status() {\n    return this.#status;\n  }\n\n  get data() {\n    return this.#data;\n  }\n\n  // Only used by the UpdateGenerator\n  get currentData() {\n    return this.processedData ?? this.#data;\n  }\n\n  get table() {\n    return this.tableSchema.table;\n  }\n\n  get config() {\n    return this.#config;\n  }\n\n  set config(config: DataSourceConfig) {\n    if (this.applyConfig(config)) {\n      if (config) {\n        const originalConfig = this.#config;\n        const newConfig: DataSourceConfig =\n          config?.filter?.filter && config?.filter.filterStruct === undefined\n            ? {\n                ...config,\n                filter: {\n                  filter: config.filter.filter,\n                  filterStruct: parseFilter(config.filter.filter),\n                },\n              }\n            : config;\n\n        this.#config = withConfigDefaults(newConfig);\n\n        let processedData: DataSourceRow[] | undefined;\n\n        if (hasFilter(config)) {\n          const { filter, filterStruct = parseFilter(filter) } = config.filter;\n          if (filterStruct) {\n            const fn = filterPredicate(this.#columnMap, filterStruct);\n            processedData = this.#data.filter(fn);\n          } else {\n            throw Error(\"filter must include filterStruct\");\n          }\n        }\n\n        if (hasSort(config)) {\n          processedData = sortRows(\n            processedData ?? this.#data,\n            config.sort,\n            this.#columnMap\n          );\n        }\n\n        if (\n          this.openTreeNodes.length > 0 &&\n          groupByChanged(originalConfig, config)\n        ) {\n          if (this.#config.groupBy.length === 0) {\n            this.openTreeNodes.length = 0;\n          } else {\n            //TODO purge any openTreeNodes for a no-longer-present groupBy col\n            console.log(\"adjust the openTReeNodes groupBy changed \", {\n              originalGroupBy: originalConfig.groupBy,\n              newGroupBy: newConfig.groupBy,\n            });\n          }\n        }\n\n        if (hasGroupBy(config)) {\n          const [groupedData, groupMap] = groupRows(\n            processedData ?? this.#data,\n            config.groupBy,\n            this.#columnMap\n          );\n          this.groupMap = groupMap;\n          processedData = groupedData;\n\n          if (this.openTreeNodes.length > 0) {\n            processedData = expandGroup(\n              this.openTreeNodes,\n              this.#data,\n              this.#config.groupBy,\n              this.#columnMap,\n              this.groupMap as GroupMap,\n              processedData as DataSourceRow[]\n            );\n          }\n        }\n\n        this.processedData = processedData?.map((row, i) => {\n          const dolly = row.slice() as DataSourceRow;\n          dolly[0] = i;\n          dolly[1] = i;\n          return dolly;\n        });\n      }\n\n      this.setRange(resetRange(this.#range), true);\n\n      this.emit(\"config\", this.#config);\n    }\n  }\n\n  applyConfig(config: DataSourceConfig) {\n    if (configChanged(this.#config, config)) {\n      if (config) {\n        const newConfig: DataSourceConfig =\n          config?.filter?.filter && config?.filter.filterStruct === undefined\n            ? {\n                ...config,\n                filter: {\n                  filter: config.filter.filter,\n                  filterStruct: parseFilter(config.filter.filter),\n                },\n              }\n            : config;\n        this.#config = withConfigDefaults(newConfig);\n        return true;\n      }\n    }\n  }\n\n  get selectedRowsCount() {\n    return this.#selectedRowsCount;\n  }\n\n  get size() {\n    // return this.#size;\n    return this.processedData?.length ?? this.#data.length;\n  }\n\n  get range() {\n    return this.#range;\n  }\n\n  set range(range: VuuRange) {\n    if (range.from !== this.#range.from || range.to !== this.#range.to) {\n      this.setRange(range);\n    }\n  }\n\n  protected delete(row: VuuRowDataItemType[]) {\n    console.log(`delete row ${row.join(\",\")}`);\n  }\n\n  protected insert = (row: VuuRowDataItemType[]) => {\n    // TODO take sorting, filtering. grouping into account\n    const dataSourceRow = toDataSourceRow(this.key)(row, this.size);\n    (this.#data as DataSourceRow[]).push(dataSourceRow);\n    const { from, to } = this.#range;\n    const [rowIdx] = dataSourceRow;\n    if (rowIdx >= from && rowIdx < to) {\n      this.sendRowsToClient();\n    }\n  };\n\n  protected update = (row: VuuRowDataItemType[], columnName: string) => {\n    // TODO take sorting, filtering. grouping into account\n    const keyValue = row[this.key];\n    const colIndex = this.#columnMap[columnName];\n    const dataColIndex = this.dataMap?.[columnName];\n    const dataIndex = this.#data.findIndex((row) => row[KEY] === keyValue);\n    if (dataIndex !== -1 && dataColIndex !== undefined) {\n      const dataSourceRow = this.#data[dataIndex];\n      dataSourceRow[colIndex] = row[dataColIndex];\n      const { from, to } = this.#range;\n      const [rowIdx] = dataSourceRow;\n      if (rowIdx >= from && rowIdx < to) {\n        this.sendRowsToClient(false, dataSourceRow);\n      }\n    }\n  };\n\n  protected updateRow = (row: VuuRowDataItemType[]) => {\n    // TODO take sorting, filtering. grouping into account\n    const keyValue = row[this.key];\n    const dataIndex = this.#data.findIndex((row) => row[KEY] === keyValue);\n    if (dataIndex !== -1) {\n      const dataSourceRow = toDataSourceRow(this.key)(row, dataIndex);\n      // maybe update this in place\n      this.#data[dataIndex] = dataSourceRow;\n      const { from, to } = this.#range;\n      if (dataIndex >= from && dataIndex < to) {\n        this.sendRowsToClient(false, dataSourceRow);\n      }\n    }\n  };\n\n  private setRange(range: VuuRange, forceFullRefresh = false) {\n    this.#range = range;\n    this.keys.reset(range);\n    this.sendRowsToClient(forceFullRefresh);\n  }\n\n  sendRowsToClient(forceFullRefresh = false, row?: DataSourceRow) {\n    if (row) {\n      this.clientCallback?.({\n        clientViewportId: this.viewport,\n        mode: \"update\",\n        rows: [\n          toClientRow(row, this.keys, this.selectedRows, this.dataIndices),\n        ],\n        type: \"viewport-update\",\n      });\n    } else {\n      const rowRange =\n        this.rangeChangeRowset === \"delta\" && !forceFullRefresh\n          ? rangeNewItems(this.lastRangeServed, this.#range)\n          : this.#range;\n      const data = this.processedData ?? this.#data;\n\n      const rowsWithinViewport = data\n        .slice(rowRange.from, rowRange.to)\n        .map((row) =>\n          toClientRow(row, this.keys, this.selectedRows, this.dataIndices)\n        );\n\n      this.clientCallback?.({\n        clientViewportId: this.viewport,\n        mode: \"batch\",\n        rows: rowsWithinViewport,\n        size: data.length,\n        type: \"viewport-update\",\n      });\n      this.lastRangeServed = {\n        from: this.#range.from,\n        to: Math.min(\n          this.#range.to,\n          this.#range.from + rowsWithinViewport.length\n        ),\n      };\n    }\n  }\n\n  get columns() {\n    return this.#config.columns;\n  }\n\n  set columns(columns: string[]) {\n    const addedColumns = getAddedItems(this.config.columns, columns);\n    if (addedColumns.length > 0) {\n      const columnsWithoutDescriptors = getMissingItems(\n        this.columnDescriptors,\n        addedColumns,\n        (col) => col.name\n      );\n      console.log(`columnsWithoutDescriptors`, {\n        columnsWithoutDescriptors,\n      });\n    }\n    this.#columnMap = buildColumnMap(columns);\n    this.dataIndices = buildDataToClientMap(this.#columnMap, this.dataMap);\n\n    this.config = {\n      ...this.#config,\n      columns,\n    };\n  }\n\n  get aggregations() {\n    return this.#config.aggregations;\n  }\n\n  set aggregations(aggregations: VuuAggregation[]) {\n    this.#config = {\n      ...this.#config,\n      aggregations,\n    };\n\n    const targetData = this.processedData ?? this.#data;\n    const leafData = this.#data;\n\n    aggregateData(\n      aggregations,\n      targetData,\n      this.#config.groupBy,\n      leafData,\n      this.#columnMap,\n      this.groupMap as GroupMap\n    );\n    this.setRange(resetRange(this.#range), true);\n\n    this.emit(\"config\", this.#config);\n  }\n\n  get sort() {\n    return this.#config.sort;\n  }\n\n  set sort(sort: VuuSort) {\n    debug?.(`sort ${JSON.stringify(sort)}`);\n    this.config = {\n      ...this.#config,\n      sort,\n    };\n  }\n\n  get filter() {\n    return this.#config.filter;\n  }\n\n  set filter(filter: DataSourceFilter) {\n    debug?.(`filter ${JSON.stringify(filter)}`);\n    // TODO check that filter has changed\n    this.config = {\n      ...this.#config,\n      filter,\n    };\n  }\n\n  get groupBy() {\n    return this.#config.groupBy;\n  }\n\n  set groupBy(groupBy: VuuGroupBy) {\n    this.config = {\n      ...this.#config,\n      groupBy,\n    };\n  }\n\n  get title() {\n    return this.#title;\n  }\n\n  set title(title: string | undefined) {\n    this.#title = title;\n  }\n\n  get _clientCallback() {\n    return this.clientCallback;\n  }\n\n  createLink({\n    parentVpId,\n    link: { fromColumn, toColumn },\n  }: LinkDescriptorWithLabel) {\n    console.log(\"create link\", {\n      parentVpId,\n      fromColumn,\n      toColumn,\n    });\n  }\n\n  removeLink() {\n    console.log(\"remove link\");\n  }\n\n  private findRow(rowKey: number) {\n    const row = this.#data[rowKey];\n    if (row) {\n      return row;\n    } else {\n      throw `no row found for key ${rowKey}`;\n    }\n  }\n\n  applyEdit(\n    row: DataSourceRow,\n    columnName: string,\n    value: VuuRowDataItemType\n  ): Promise<true> {\n    console.log(`ArrayDataSource applyEdit ${row[0]} ${columnName} ${value}`);\n    return Promise.resolve(true);\n  }\n\n  async menuRpcCall(\n    rpcRequest: Omit<ClientToServerMenuRPC, \"vpId\"> | ClientToServerEditRpc\n  ): Promise<\n    | MenuRpcResponse\n    | VuuUIMessageInRPCEditReject\n    | VuuUIMessageInRPCEditResponse\n    | undefined\n  > {\n    return new Promise((resolve) => {\n      const { type } = rpcRequest;\n      switch (type) {\n        case \"VP_EDIT_CELL_RPC\":\n          {\n            // TODO\n            // const { rowKey, field, value } = rpcRequest;\n            // try {\n            //   this.update(rowKey, field, value);\n            //   resolve(undefined);\n            // } catch (error) {\n            //   resolve({ error: String(error), type: \"VP_EDIT_RPC_REJECT\" });\n            // }\n          }\n\n          break;\n        default:\n          resolve(undefined);\n      }\n    });\n  }\n}\n", "import { ColumnDescriptor } from \"@vuu-ui/vuu-table-types\";\nimport {\n  LinkDescriptorWithLabel,\n  VuuGroupBy,\n  VuuAggregation,\n  VuuRange,\n  VuuSort,\n  ClientToServerMenuRPC,\n  ClientToServerEditRpc,\n  VuuRowDataItemType,\n} from \"@vuu-ui/vuu-protocol-types\";\nimport {\n  DataSourceFilter,\n  DataSourceRow,\n  DataSource,\n  DataSourceConstructorProps,\n  DataSourceEvents,\n  DataSourceStatus,\n  SubscribeCallback,\n  SubscribeProps,\n  WithFullConfig,\n  Selection,\n  MenuRpcResponse,\n  VuuUIMessageInRPCEditReject,\n  VuuUIMessageInRPCEditResponse,\n} from \"@vuu-ui/vuu-data-types\";\nimport {\n  EventEmitter,\n  isSelected,\n  JsonData,\n  jsonToDataSourceRows,\n  KeySet,\n  metadataKeys,\n  uuid,\n  vanillaConfig,\n} from \"@vuu-ui/vuu-utils\";\n\nconst NULL_SCHEMA = { columns: [], key: \"\", table: { module: \"\", table: \"\" } };\n\nexport interface JsonDataSourceConstructorProps\n  extends Omit<DataSourceConstructorProps, \"bufferSize\" | \"table\"> {\n  data: JsonData;\n}\n\nconst { DEPTH, IDX, IS_EXPANDED, IS_LEAF, KEY, SELECTED } = metadataKeys;\n\nconst toClientRow = (row: DataSourceRow, keys: KeySet) => {\n  const [rowIndex] = row;\n  const clientRow = row.slice() as DataSourceRow;\n  clientRow[1] = keys.keyFor(rowIndex);\n  return clientRow;\n};\n\nexport class JsonDataSource\n  extends EventEmitter<DataSourceEvents>\n  implements DataSource\n{\n  public columnDescriptors: ColumnDescriptor[];\n  private clientCallback: SubscribeCallback | undefined;\n  private expandedRows = new Set<string>();\n  private visibleRows: DataSourceRow[] = [];\n\n  #aggregations: VuuAggregation[] = [];\n  #config: WithFullConfig = vanillaConfig;\n  #data: DataSourceRow[];\n  #filter: DataSourceFilter = { filter: \"\" };\n  #groupBy: VuuGroupBy = [];\n  #range: VuuRange = { from: 0, to: 0 };\n  #selectedRowsCount = 0;\n  #size = 0;\n  #sort: VuuSort = { sortDefs: [] };\n  #status: DataSourceStatus = \"initialising\";\n  #title: string | undefined;\n\n  public rowCount: number | undefined;\n  public viewport: string;\n\n  private keys = new KeySet(this.#range);\n\n  constructor({\n    aggregations,\n    data,\n    filter,\n    groupBy,\n    sort,\n    title,\n    viewport,\n  }: JsonDataSourceConstructorProps) {\n    super();\n\n    if (!data) {\n      throw Error(\"JsonDataSource constructor called without data\");\n    }\n\n    [this.columnDescriptors, this.#data] = jsonToDataSourceRows(data);\n\n    this.visibleRows = this.#data\n      .filter((row) => row[DEPTH] === 0)\n      .map((row, index) =>\n        ([index, index] as Partial<DataSourceRow>).concat(row.slice(2))\n      ) as DataSourceRow[];\n    this.viewport = viewport || uuid();\n    if (aggregations) {\n      this.#aggregations = aggregations;\n    }\n    if (this.columnDescriptors) {\n      this.#config = {\n        ...this.#config,\n        columns: this.columnDescriptors.map((c) => c.name),\n      };\n    }\n    if (filter) {\n      this.#filter = filter;\n    }\n    if (groupBy) {\n      this.#groupBy = groupBy;\n    }\n    if (sort) {\n      this.#sort = sort;\n    }\n    this.#title = title;\n  }\n\n  async subscribe(\n    {\n      viewport = this.viewport ?? uuid(),\n      columns,\n      aggregations,\n      range,\n      sort,\n      groupBy,\n      filter,\n    }: SubscribeProps,\n    callback: SubscribeCallback\n  ) {\n    this.clientCallback = callback;\n\n    if (aggregations) {\n      this.#aggregations = aggregations;\n    }\n    if (columns) {\n      this.#config = {\n        ...this.#config,\n        columns,\n      };\n    }\n    if (filter) {\n      this.#filter = filter;\n    }\n    if (groupBy) {\n      this.#groupBy = groupBy;\n    }\n    if (range) {\n      this.#range = range;\n    }\n    if (sort) {\n      this.#sort = sort;\n    }\n\n    if (this.#status !== \"initialising\") {\n      //TODO check if subscription details are still the same\n      return;\n    }\n\n    this.viewport = viewport;\n\n    this.#status = \"subscribed\";\n\n    this.clientCallback?.({\n      aggregations: this.#aggregations,\n      type: \"subscribed\",\n      clientViewportId: this.viewport,\n      columns: this.#config.columns,\n      filter: this.#filter,\n      groupBy: this.#groupBy,\n      range: this.#range,\n      sort: this.#sort,\n      tableSchema: NULL_SCHEMA,\n    });\n\n    this.clientCallback({\n      clientViewportId: this.viewport,\n      mode: \"size-only\",\n      type: \"viewport-update\",\n      size: this.visibleRows.length,\n    });\n  }\n\n  unsubscribe() {\n    console.log(\"noop\");\n  }\n\n  suspend() {\n    console.log(\"noop\");\n    return this;\n  }\n\n  resume() {\n    console.log(\"noop\");\n    return this;\n  }\n\n  disable() {\n    console.log(\"noop\");\n    return this;\n  }\n\n  enable() {\n    console.log(\"noop\");\n    return this;\n  }\n  set data(data: JsonData) {\n    console.log(`set JsonDataSource data`);\n    [this.columnDescriptors, this.#data] = jsonToDataSourceRows(data);\n    this.visibleRows = this.#data\n      .filter((row) => row[DEPTH] === 0)\n      .map((row, index) =>\n        ([index, index] as Partial<DataSourceRow>).concat(row.slice(2))\n      ) as DataSourceRow[];\n\n    requestAnimationFrame(() => {\n      this.sendRowsToClient();\n    });\n  }\n\n  select(selected: Selection) {\n    const updatedRows: DataSourceRow[] = [];\n    for (const row of this.#data) {\n      const { [IDX]: rowIndex, [SELECTED]: sel } = row;\n      const wasSelected = sel === 1;\n      const nowSelected = isSelected(selected, rowIndex);\n      if (nowSelected !== wasSelected) {\n        const selectedRow = row.slice() as DataSourceRow;\n        selectedRow[SELECTED] = nowSelected ? 1 : 0;\n        this.#data[rowIndex] = selectedRow;\n        updatedRows.push(selectedRow);\n      }\n    }\n\n    if (updatedRows.length > 0) {\n      this.clientCallback?.({\n        clientViewportId: this.viewport,\n        mode: \"update\",\n        type: \"viewport-update\",\n        rows: updatedRows,\n      });\n    }\n  }\n\n  openTreeNode(key: string) {\n    this.expandedRows.add(key);\n    this.visibleRows = getVisibleRows(this.#data, this.expandedRows);\n    const { from, to } = this.#range;\n    this.clientCallback?.({\n      clientViewportId: this.viewport,\n\n      mode: \"batch\",\n      rows: this.visibleRows\n        .slice(from, to)\n        .map((row) => toClientRow(row, this.keys)),\n      size: this.visibleRows.length,\n      type: \"viewport-update\",\n    });\n  }\n\n  closeTreeNode(key: string, cascade = false) {\n    this.expandedRows.delete(key);\n    if (cascade) {\n      for (const rowKey of this.expandedRows.keys()) {\n        if (rowKey.startsWith(key)) {\n          this.expandedRows.delete(rowKey);\n        }\n      }\n    }\n    this.visibleRows = getVisibleRows(this.#data, this.expandedRows);\n    this.sendRowsToClient();\n  }\n\n  get status() {\n    return this.#status;\n  }\n\n  get config() {\n    return this.#config;\n  }\n\n  applyConfig() {\n    return true as const;\n  }\n\n  get selectedRowsCount() {\n    return this.#selectedRowsCount;\n  }\n\n  get size() {\n    return this.#size;\n  }\n\n  get range() {\n    return this.#range;\n  }\n\n  set range(range: VuuRange) {\n    this.#range = range;\n    this.keys.reset(range);\n    requestAnimationFrame(() => {\n      this.sendRowsToClient();\n    });\n  }\n\n  private sendRowsToClient() {\n    const { from, to } = this.#range;\n    this.clientCallback?.({\n      clientViewportId: this.viewport,\n      mode: \"batch\",\n      rows: this.visibleRows\n        .slice(from, to)\n        .map((row) => toClientRow(row, this.keys)),\n      size: this.visibleRows.length,\n      type: \"viewport-update\",\n    });\n  }\n\n  get columns() {\n    return this.#config.columns;\n  }\n\n  set columns(columns: string[]) {\n    // TODO use setter\n    this.#config = {\n      ...this.#config,\n      columns,\n    };\n  }\n\n  get aggregations() {\n    return this.#aggregations;\n  }\n\n  set aggregations(aggregations: VuuAggregation[]) {\n    this.#aggregations = aggregations;\n  }\n\n  get sort() {\n    return this.#sort;\n  }\n\n  set sort(sort: VuuSort) {\n    // TODO should we wait until server ACK before we assign #sort ?\n    this.#sort = sort;\n  }\n\n  get filter() {\n    return this.#filter;\n  }\n\n  set filter(filter: DataSourceFilter) {\n    // TODO should we wait until server ACK before we assign #sort ?\n    this.#filter = filter;\n  }\n\n  get groupBy() {\n    return this.#groupBy;\n  }\n\n  set groupBy(groupBy: VuuGroupBy) {\n    this.#groupBy = groupBy;\n  }\n\n  get title() {\n    return this.#title;\n  }\n\n  set title(title: string | undefined) {\n    this.#title = title;\n  }\n\n  createLink({\n    parentVpId,\n    link: { fromColumn, toColumn },\n  }: LinkDescriptorWithLabel) {\n    console.log(\"create link\", {\n      parentVpId,\n      fromColumn,\n      toColumn,\n    });\n  }\n\n  removeLink() {\n    console.log(\"remove link\");\n  }\n\n  async menuRpcCall(\n    rpcRequest: Omit<ClientToServerMenuRPC, \"vpId\"> | ClientToServerEditRpc\n  ): Promise<\n    | MenuRpcResponse\n    | VuuUIMessageInRPCEditReject\n    | VuuUIMessageInRPCEditResponse\n    | undefined\n  > {\n    console.log(\"rmenuRpcCall\", {\n      rpcRequest,\n    });\n    return undefined;\n  }\n\n  applyEdit(\n    row: DataSourceRow,\n    columnName: string,\n    value: VuuRowDataItemType\n  ): Promise<true> {\n    console.log(\n      `ArrayDataSource applyEdit ${row.join(\",\")} ${columnName} ${value}`\n    );\n    return Promise.resolve(true);\n  }\n\n  getChildRows(rowKey: string) {\n    const parentRow = this.#data.find((row) => row[KEY] === rowKey);\n    if (parentRow) {\n      const { [IDX]: parentIdx, [DEPTH]: parentDepth } = parentRow;\n      let rowIdx = parentIdx + 1;\n      const childRows = [];\n      do {\n        const { [DEPTH]: depth } = this.#data[rowIdx];\n        if (depth === parentDepth + 1) {\n          childRows.push(this.#data[rowIdx]);\n        } else if (depth <= parentDepth) {\n          break;\n        }\n        rowIdx += 1;\n      } while (rowIdx < this.#data.length);\n      return childRows;\n    } else {\n      console.warn(\n        `JsonDataSource getChildRows row not found for key ${rowKey}`\n      );\n    }\n\n    return [];\n  }\n\n  getRowsAtDepth(depth: number, visibleOnly = true) {\n    const rows = visibleOnly ? this.visibleRows : this.#data;\n    return rows.filter((row) => row[DEPTH] === depth);\n  }\n}\n\ntype Index = {\n  value: number;\n};\n\nfunction getVisibleRows(rows: DataSourceRow[], expandedKeys: Set<string>) {\n  const visibleRows: DataSourceRow[] = [];\n  const index: Index = { value: 0 };\n  for (let i = 0; i < rows.length; i++) {\n    const row = rows[i];\n    const { [DEPTH]: depth, [KEY]: key, [IS_LEAF]: isLeaf } = row;\n    const isExpanded = expandedKeys.has(key);\n    visibleRows.push(cloneRow(row, index, isExpanded));\n    if (!isLeaf && !isExpanded) {\n      do {\n        i += 1;\n      } while (i < rows.length - 1 && rows[i + 1][DEPTH] > depth);\n    }\n  }\n  return visibleRows;\n}\n\nconst cloneRow = (\n  row: DataSourceRow,\n  index: Index,\n  isExpanded: boolean\n): DataSourceRow => {\n  const dolly = row.slice() as DataSourceRow;\n  dolly[0] = index.value;\n  dolly[1] = index.value;\n  if (isExpanded) {\n    dolly[IS_EXPANDED] = true;\n  }\n  index.value += 1;\n  return dolly;\n};\n", "import { DataItem } from \"@vuu-ui/vuu-utils\";\nimport { Table } from \"./Table\";\n\nconst cachedValues = new Map<Table, Map<string, DataItem[]>>();\n\nconst getUniqueValues = (table: Table, column: string, pattern = \"\") => {\n  let uniqueValues;\n  const cachedEntry = cachedValues.get(table);\n  if (cachedEntry && cachedEntry.has(column)) {\n    uniqueValues = cachedEntry.get(column) as DataItem[];\n  } else {\n    const { data, map } = table;\n    const key = map[column];\n    uniqueValues = [];\n    const set = new Set();\n    for (const row of data) {\n      const value = row[key];\n      if (!set.has(value)) {\n        set.add(value);\n        uniqueValues.push(value);\n      }\n    }\n    uniqueValues.sort();\n    if (cachedEntry) {\n      cachedEntry.set(column, uniqueValues);\n    } else {\n      cachedValues.set(table, new Map([[column, uniqueValues]]));\n    }\n  }\n  return pattern\n    ? uniqueValues.filter((value) => value.toString().startsWith(pattern))\n    : uniqueValues;\n};\n\n// export const makeSuggestions = (\n//   table: Table,\n//   column: string,\n//   pattern?: string\n// ) => {\n//   const uniqueValues = getUniqueValues(table, column, pattern);\n//   if (uniqueValues.length > 20) {\n//     return uniqueValues?.slice(0, 20).map((v) => v.toString());\n//   } else {\n//     return uniqueValues.map((v) => v.toString());\n//   }\n// };\nexport const makeSuggestions = (\n  table: Table,\n  column: string,\n  pattern?: string\n): Promise<string[]> =>\n  new Promise((resolve) => {\n    const uniqueValues = getUniqueValues(table, column, pattern);\n    const result =\n      uniqueValues.length > 20\n        ? uniqueValues?.slice(0, 20).map((v) => v.toString())\n        : uniqueValues.map((v) => v.toString());\n    setTimeout(() => resolve(result), 100);\n  });\n", "import {\n  ArrayDataSource,\n  ArrayDataSourceConstructorProps,\n} from \"@vuu-ui/vuu-data-local\";\nimport {\n  DataSourceRow,\n  MenuRpcResponse,\n  RpcResponse,\n  SelectionItem,\n  SubscribeCallback,\n  SubscribeProps,\n  VuuUIMessageInRPCEditReject,\n  VuuUIMessageInRPCEditResponse,\n} from \"@vuu-ui/vuu-data-types\";\nimport {\n  ClientToServerEditRpc,\n  ClientToServerMenuRPC,\n  ClientToServerViewportRpcCall,\n  VuuMenu,\n  VuuRange,\n  VuuRowDataItemType,\n} from \"@vuu-ui/vuu-protocol-types\";\nimport { metadataKeys } from \"@vuu-ui/vuu-utils\";\nimport { makeSuggestions } from \"./makeSuggestions\";\nimport { Table } from \"./Table\";\n\nexport type RpcService = {\n  rpcName: string;\n  service: (rpcRequest: any) => Promise<any>;\n};\n\nexport interface TickingArrayDataSourceConstructorProps\n  extends Omit<ArrayDataSourceConstructorProps, \"data\"> {\n  data?: Array<VuuRowDataItemType[]>;\n  menu?: VuuMenu;\n  menuRpcServices?: RpcService[];\n  rpcServices?: RpcService[];\n  table?: Table;\n}\n\nexport class TickingArrayDataSource extends ArrayDataSource {\n  #menuRpcServices: RpcService[] | undefined;\n  #rpcServices: RpcService[] | undefined;\n  #table?: Table;\n\n  constructor({\n    data,\n    menuRpcServices,\n    rpcServices,\n    table,\n    menu,\n    ...arrayDataSourceProps\n  }: TickingArrayDataSourceConstructorProps) {\n    if (data === undefined && table === undefined) {\n      throw Error(\"TickingArrayDataSource must be constructed with data\");\n    }\n    super({\n      ...arrayDataSourceProps,\n      data: data ?? table?.data ?? [],\n    });\n    this._menu = menu;\n    this.#menuRpcServices = menuRpcServices;\n    this.#rpcServices = rpcServices;\n    this.#table = table;\n\n    if (table) {\n      table.on(\"insert\", this.insert);\n      table.on(\"update\", this.updateRow);\n    }\n  }\n\n  async subscribe(subscribeProps: SubscribeProps, callback: SubscribeCallback) {\n    const subscription = super.subscribe(subscribeProps, callback);\n    // if (subscribeProps.range) {\n    //   this.#updateGenerator?.setRange(subscribeProps.range);\n    // }\n    return subscription;\n  }\n\n  set range(range: VuuRange) {\n    super.range = range;\n    // this.#updateGenerator?.setRange(range);\n  }\n  get range() {\n    return super.range;\n  }\n\n  private getSelectedRows() {\n    return this.selectedRows.reduce<DataSourceRow[]>(\n      (rows: DataSourceRow[], selected: SelectionItem) => {\n        if (Array.isArray(selected)) {\n          selected.forEach((sel) => {\n            const row = this.data[sel];\n            if (row) {\n              rows.push(row);\n            }\n          });\n        } else {\n          const row = this.data[selected];\n          if (row) {\n            rows.push(row);\n          }\n        }\n        return rows;\n      },\n      []\n    );\n  }\n\n  applyEdit(\n    row: DataSourceRow,\n    columnName: string,\n    value: VuuRowDataItemType\n  ): Promise<true> {\n    const key = row[metadataKeys.KEY];\n    this.#table?.update(key, columnName, value);\n    return Promise.resolve(true);\n  }\n\n  async rpcCall<T extends RpcResponse = RpcResponse>(\n    rpcRequest: Omit<ClientToServerViewportRpcCall, \"vpId\">\n  ): Promise<T | undefined> {\n    const rpcService = this.#rpcServices?.find(\n      (service) =>\n        service.rpcName ===\n        (rpcRequest as ClientToServerViewportRpcCall).rpcName\n    );\n    if (rpcService) {\n      return rpcService.service({\n        ...rpcRequest,\n      });\n    } else {\n      console.log(`no implementation for PRC service ${rpcRequest.rpcName}`);\n    }\n  }\n\n  async menuRpcCall(\n    rpcRequest: Omit<ClientToServerMenuRPC, \"vpId\"> | ClientToServerEditRpc\n  ): Promise<\n    | MenuRpcResponse\n    | VuuUIMessageInRPCEditReject\n    | VuuUIMessageInRPCEditResponse\n    | undefined\n  > {\n    const rpcService = this.#rpcServices?.find(\n      (service) =>\n        service.rpcName === (rpcRequest as ClientToServerMenuRPC).rpcName\n    );\n\n    if (rpcService) {\n      switch (rpcRequest.type) {\n        case \"VIEW_PORT_MENUS_SELECT_RPC\": {\n          const selectedRows = this.getSelectedRows();\n          return rpcService.service({\n            ...rpcRequest,\n            selectedRows,\n          });\n        }\n\n        default:\n      }\n    }\n    return super.menuRpcCall(rpcRequest);\n  }\n\n  getTypeaheadSuggestions(column: string, pattern?: string): Promise<string[]> {\n    if (this.#table) {\n      return makeSuggestions(this.#table, column, pattern);\n    } else {\n      throw Error(\n        \"cannot call getTypeaheadSuggestions on TickingDataSOurce if table has not been provided\"\n      );\n    }\n  }\n}\n", "import { ColumnDescriptor } from \"@vuu-ui/vuu-table-types\";\nimport { VuuRowDataItemType, VuuTable } from \"@vuu-ui/vuu-protocol-types\";\nimport { UpdateGenerator } from \"./rowUpdates\";\n\ntype RowAtIndexFunc<T = unknown> = (index: number) => T | undefined;\n\nexport const VuuColumnGenerator = (columnCount: number): string[] =>\n  [\"Row No\"].concat(\n    Array(columnCount)\n      .fill(\"\")\n      .map((_, i) => `Column ${i + 1}`)\n  );\n\nexport type RowGeneratorFactory<T = VuuRowDataItemType> = (\n  columns: string[]\n) => RowAtIndexFunc<T[]>;\n\nexport type ColumnGeneratorFn = (\n  columns?: number | string[],\n  columnConfig?: { [key: string]: Partial<ColumnDescriptor> }\n) => ColumnDescriptor[];\n\nexport const DefaultRowGenerator: RowGeneratorFactory<string> =\n  (columns: string[]) => (index) => {\n    return [`row ${index + 1}`].concat(\n      Array(columns.length)\n        .fill(true)\n        .map((v, j) => `value ${j + 1} @ ${index + 1}`)\n    );\n  };\n\nexport const DefaultColumnGenerator: ColumnGeneratorFn = (\n  columns,\n  columnConfig = {}\n) => {\n  if (typeof columns === \"number\") {\n    return [{ name: \"row number\", width: 150 }].concat(\n      Array(columns)\n        .fill(true)\n        .map((_, i) => {\n          const name = `column ${i + 1}`;\n          return { name, width: 100, ...columnConfig[name] };\n        })\n    );\n  } else {\n    throw Error(\"DefaultColumnGenerator must be passed columns (number)\");\n  }\n};\n\nconst defaultGenerators = {\n  ColumnGenerator: DefaultColumnGenerator,\n  RowGenerator: DefaultRowGenerator,\n};\n\nexport const getColumnAndRowGenerator = (\n  table?: VuuTable\n):\n  | [ColumnGeneratorFn, RowGeneratorFactory]\n  | [ColumnGeneratorFn, RowGeneratorFactory, () => UpdateGenerator] => {\n  const tableName = table?.table ?? \"\";\n  // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n  // @ts-ignore\n  switch (table?.module) {\n    case \"SIMUL\": {\n      const { ColumnGenerator, RowGenerator, createUpdateGenerator } =\n        // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n        // @ts-ignore\n        simulDataGenerators[tableName] ?? defaultGenerators;\n      return [ColumnGenerator, RowGenerator, createUpdateGenerator];\n    }\n\n    case \"BASKET\": {\n      const { ColumnGenerator, RowGenerator, createUpdateGenerator } =\n        // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n        // @ts-ignore\n        basketDataGenerators[tableName] ?? defaultGenerators;\n      return [ColumnGenerator, RowGenerator, createUpdateGenerator];\n    }\n    case undefined: {\n      const { ColumnGenerator, RowGenerator } = defaultGenerators;\n      return [ColumnGenerator, RowGenerator];\n    }\n    default:\n      throw Error(\n        `vuu-row-gererator table ${table?.table} was requested but no generator is registered`\n      );\n  }\n};\n\nexport const populateArray = (\n  count: number,\n  colGen: ColumnGeneratorFn,\n  rowGen: RowGeneratorFactory,\n  columns?: number | string[]\n) => {\n  const columnDescriptors = colGen(columns);\n  const generateRow = rowGen(columnDescriptors.map((col) => col.name));\n  const data: Array<VuuRowDataItemType[]> = [];\n  for (let i = 0; i < count; i++) {\n    const row = generateRow(i);\n    if (row) {\n      data[i] = row;\n    } else {\n      break;\n    }\n  }\n  return data;\n};\n", "import { SchemaColumn, TableSchema } from \"@vuu-ui/vuu-data-types\";\nimport { VuuRowDataItemType, VuuTable } from \"@vuu-ui/vuu-protocol-types\";\nimport { ColumnMap, EventEmitter } from \"@vuu-ui/vuu-utils\";\nimport { UpdateGenerator } from \"./rowUpdates\";\n\nexport type TableEvents = {\n  delete: (row: VuuRowDataItemType[]) => void;\n  insert: (row: VuuRowDataItemType[]) => void;\n  update: (row: VuuRowDataItemType[], columnName?: string) => void;\n};\n\nexport class Table extends EventEmitter<TableEvents> {\n  #data: VuuRowDataItemType[][];\n  #dataMap: ColumnMap;\n  #indexOfKey: number;\n  #index = new Map<string, number>();\n  #schema: TableSchema;\n\n  constructor(\n    schema: TableSchema,\n    data: VuuRowDataItemType[][],\n    dataMap: ColumnMap,\n    updateGenerator?: UpdateGenerator\n  ) {\n    super();\n    this.#data = data;\n    this.#dataMap = dataMap;\n    this.#schema = schema;\n    this.#indexOfKey = dataMap[schema.key];\n    this.buildIndex();\n    updateGenerator?.setTable(this);\n    updateGenerator?.setRange({ from: 0, to: 100 });\n  }\n\n  private buildIndex() {\n    for (let i = 0; i < this.#data.length; i++) {\n      const key = this.#data[i][this.#indexOfKey] as string;\n      this.#index.set(key, i);\n    }\n  }\n\n  get data() {\n    return this.#data;\n  }\n\n  get map() {\n    return this.#dataMap;\n  }\n\n  get schema() {\n    return this.#schema;\n  }\n\n  insert(row: VuuRowDataItemType[]) {\n    const index = this.#data.length;\n    this.#data.push(row);\n    const key = row[this.#indexOfKey] as string;\n    this.#index.set(key, index);\n    this.emit(\"insert\", row);\n  }\n\n  findByKey(key: string) {\n    const index = this.#index.get(key) ?? -1;\n    return this.#data[index];\n  }\n\n  update(key: string, columnName: string, value: VuuRowDataItemType) {\n    const rowIndex = this.#data.findIndex(\n      (row) => row[this.#indexOfKey] === key\n    );\n    const colIndex = this.#dataMap[columnName];\n    if (rowIndex !== -1) {\n      const row = this.#data[rowIndex];\n      const newRow = row.slice();\n      newRow[colIndex] = value;\n      this.#data[rowIndex] = newRow;\n      this.emit(\"update\", newRow, columnName);\n    }\n  }\n  updateRow(row: VuuRowDataItemType[]) {\n    const key = row[this.#indexOfKey];\n    const rowIndex = this.#data.findIndex(\n      (row) => row[this.#indexOfKey] === key\n    );\n    if (rowIndex !== -1) {\n      this.#data[rowIndex] = row;\n      this.emit(\"update\", row);\n    }\n  }\n}\n\nexport const buildDataColumnMap = (schema: TableSchema) =>\n  Object.values(schema.columns).reduce<ColumnMap>((map, col, index) => {\n    map[col.name] = index;\n    return map;\n  }, {});\n\nconst getServerDataType = (\n  columnName: string,\n  { columns: cols1, table: t1 }: TableSchema,\n  { columns: cols2, table: t2 }: TableSchema\n) => {\n  const col1 = cols1.find((col) => col.name === columnName);\n  const col2 = cols2.find((col) => col.name === columnName);\n  if (col1 && col2) {\n    if (col1.serverDataType === col2.serverDataType) {\n      return col1.serverDataType;\n    } else {\n      throw Error(\n        `both tables ${t1.table} and ${t2.table} implement column ${columnName}, but with types differ`\n      );\n    }\n  } else if (col1) {\n    return col1.serverDataType;\n  } else if (col2) {\n    return col2.serverDataType;\n  } else {\n    throw Error(`WTF how is this possible`);\n  }\n};\n\n// Just copies source tables, then registers update listeners.\n// Not terribly efficient, but good enough for showcase\nexport const joinTables = (\n  joinTable: VuuTable,\n  table1: Table,\n  table2: Table,\n  joinColumn: string\n) => {\n  const { map: m1, schema: schema1 } = table1;\n  const { map: m2, schema: schema2 } = table2;\n  const k1 = m1[joinColumn];\n  const k2 = m2[joinColumn];\n\n  const combinedColumns = new Set(\n    [...schema1.columns, ...schema2.columns].map((col) => col.name).sort()\n  );\n\n  const combinedSchema: TableSchema = {\n    key: joinColumn,\n    table: joinTable,\n    columns: Array.from(combinedColumns).map<SchemaColumn>((columnName) => ({\n      name: columnName,\n      serverDataType: getServerDataType(columnName, schema1, schema2),\n    })),\n  };\n\n  const data: VuuRowDataItemType[][] = [];\n  const combinedColumnMap = buildDataColumnMap(combinedSchema);\n  // const start = performance.now();\n  for (const row of table1.data) {\n    const row2 = table2.findByKey(String(row[k1]));\n    if (row2) {\n      const out = [];\n      for (const column of table1.schema.columns) {\n        const value = row[m1[column.name]];\n        out[combinedColumnMap[column.name]] = value;\n      }\n      for (const column of table2.schema.columns) {\n        const value = row2[m2[column.name]];\n        out[combinedColumnMap[column.name]] = value;\n      }\n\n      data.push(out);\n    }\n  }\n  // const end = performance.now();\n  // console.log(`took ${end - start} ms to create join table ${joinTable.table}`);\n\n  const newTable = new Table(combinedSchema, data, combinedColumnMap);\n\n  table1.on(\"insert\", (row) => {\n    const row2 = table2.findByKey(String(row[k1]));\n    if (row2) {\n      const out = [];\n      for (const column of table1.schema.columns) {\n        const value = row[m1[column.name]];\n        out[combinedColumnMap[column.name]] = value;\n      }\n      for (const column of table2.schema.columns) {\n        const value = row2[m2[column.name]];\n        out[combinedColumnMap[column.name]] = value;\n      }\n      newTable.insert(out);\n    }\n  });\n\n  table2.on(\"update\", (row) => {\n    const keyValue = row[k2] as string;\n    const targetRow = newTable.findByKey(keyValue);\n    if (targetRow) {\n      const updatedRow = targetRow.slice();\n      for (const { name } of table2.schema.columns) {\n        if (row[m2[name]] !== updatedRow[combinedColumnMap[name]]) {\n          updatedRow[combinedColumnMap[name]] = row[m2[name]];\n        }\n      }\n      newTable.updateRow(updatedRow);\n    }\n  });\n\n  return newTable;\n};\n", "export function random(min: number, max: number) {\n  min = Math.ceil(min);\n  max = Math.floor(max);\n  return Math.floor(Math.random() * (max - min + 1)) + min;\n}\n\nexport function randomPercentage(value: number) {\n  const dec = random(2, 99);\n  const percentage = dec / 100;\n  return value * percentage;\n}\nexport type PriceGenerator = (min: number, max: number) => number;\n\nexport const nextRandomDouble: PriceGenerator = (min, max) =>\n  min + (max - min) * Math.random();\n\nexport const initBidAsk = (\n  priceMaxDelta: number,\n  nextRandomDouble: PriceGenerator\n) => {\n  const mid = nextRandomDouble(0, 1000);\n  const tempBid = nextRandomDouble(mid - priceMaxDelta, mid - 1);\n  const ask = nextRandomDouble(mid + 1, mid + priceMaxDelta);\n  const bid = tempBid < 0 ? mid : tempBid;\n  const newBid = Math.round(bid * 100) / 100.0;\n  const newAsk = Math.round(ask * 100) / 100.0;\n  return [newBid, newAsk];\n};\n\nconst maxAsk = (\n  bid: number,\n  ask: number,\n  spreadMultipler: number,\n  priceMaxDelta: number\n) => {\n  const spread = ask - bid;\n  return Math.min(\n    ask + spreadMultipler * spread,\n    spread / 2 + bid + priceMaxDelta\n  );\n};\n\nconst minAsk = (\n  bid: number,\n  ask: number,\n  spreadMultipler: number,\n  priceMaxDelta: number\n) => {\n  return Math.max(bid + 1, (ask - bid) / 2 + bid);\n};\n\nconst maxBid = (\n  bid: number,\n  ask: number,\n  spreadMultipler: number,\n  priceMaxDelta: number\n) => {\n  const result = Math.min(ask - 1, (ask - bid) / 2 + bid);\n  return result < 1 ? bid + 1 : result;\n};\n\nconst minBid = (\n  bid: number,\n  ask: number,\n  spreadMultipler: number,\n  priceMaxDelta: number\n) => {\n  const spread = ask - bid;\n  const mid = spread / 2 + bid;\n  const result = Math.max(\n    bid - Math.min(spreadMultipler * spread, 10),\n    mid - priceMaxDelta\n  );\n  return result < 0 ? bid : result;\n};\n\nexport const generateNextBidAsk = (\n  bid: number,\n  ask: number,\n  spreadMultipler: number,\n  priceMaxDelta: number,\n  nextRandomDouble: PriceGenerator\n) => {\n  let tempAsk = ask;\n  if (Math.abs(bid - ask) <= 1) tempAsk = ask + 1;\n  const minBidValue = minBid(bid, tempAsk, spreadMultipler, priceMaxDelta);\n  const maxBidValue = maxBid(bid, tempAsk, spreadMultipler, priceMaxDelta);\n  const minAskValue = minAsk(bid, tempAsk, spreadMultipler, priceMaxDelta);\n  const maxAskValue = maxAsk(bid, tempAsk, spreadMultipler, priceMaxDelta);\n  const newBid =\n    Math.round(nextRandomDouble(minBidValue, maxBidValue) * 100) / 100.0;\n  const newAsk =\n    Math.round(nextRandomDouble(minAskValue, maxAskValue) * 100) / 100.0;\n  return [newBid, newAsk];\n};\n", "import { VuuRange } from \"@vuu-ui/vuu-protocol-types\";\nimport { generateNextBidAsk, nextRandomDouble, random } from \"./data-utils\";\nimport type { UpdateGenerator } from \"./rowUpdates\";\nimport { Table } from \"./Table\";\n\nconst getNewValue = (value: number) => {\n  const multiplier = random(0, 100) / 1000;\n  const direction = random(0, 10) >= 5 ? 1 : -1;\n  return value + value * multiplier * direction;\n};\n\nexport class BaseUpdateGenerator implements UpdateGenerator {\n  private table: Table | undefined;\n  private range: VuuRange | undefined;\n  private updating = false;\n  private timer: number | undefined;\n  private tickingColumns: { [key: string]: number };\n\n  constructor(tickingColumns: { [key: string]: number }) {\n    this.tickingColumns = tickingColumns;\n  }\n\n  setRange(range: VuuRange) {\n    this.range = range;\n    if (!this.updating && this.table) {\n      this.startUpdating();\n    }\n  }\n\n  setTable(table: Table) {\n    this.table = table;\n  }\n\n  private startUpdating() {\n    this.updating = true;\n    this.update();\n  }\n\n  private stopUpdating() {\n    this.updating = false;\n    if (this.timer) {\n      window.clearTimeout(this.timer);\n      this.timer = undefined;\n    }\n  }\n\n  update = () => {\n    if (this.range && this.table) {\n      const data = this.table?.data;\n      const { bid, ask, last, ...rest } = this.tickingColumns;\n      if (data && data?.length > 0) {\n        const maxRange = Math.min(this.range.to, data.length);\n        for (let rowIndex = this.range.from; rowIndex < maxRange; rowIndex++) {\n          let updateCount = 0;\n          const shallUpdateRow = random(0, 10) < 2;\n          if (shallUpdateRow) {\n            // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n            // @ts-ignore\n            const rowUpdates = this.table.data[rowIndex];\n            const row = data[rowIndex];\n\n            if (bid !== undefined && ask !== undefined) {\n              const { [bid]: currentBid, [ask]: currentAsk } = row as number[];\n              const [newBid, newAsk] = generateNextBidAsk(\n                currentBid,\n                currentAsk,\n                10,\n                5,\n                nextRandomDouble\n              );\n              rowUpdates[ask] = newAsk;\n              rowUpdates[bid] = newBid;\n              if (last !== undefined) {\n                const newLast =\n                  Math.round((currentAsk + (newAsk - currentAsk) / 2) * 100) /\n                  100.0;\n                rowUpdates[last] = newLast;\n              }\n            }\n\n            for (const colIdx of Object.values(rest)) {\n              const shallUpdateColumn = random(0, 10) < 5;\n              if (shallUpdateColumn) {\n                updateCount += 1;\n                const newValue = getNewValue(row[colIdx] as number);\n                if (this.table) {\n                  rowUpdates[colIdx] = newValue;\n                }\n              }\n            }\n            if (this.table && updateCount > 0) {\n              this.table.updateRow(rowUpdates);\n            }\n          }\n        }\n      }\n    }\n\n    if (this.updating) {\n      this.timer = window.setTimeout(this.update, 500);\n    }\n  };\n}\n", "// Symbol,Name,Last Trade,Change,Volume\n// prettier-ignore\nexport default [\n    [\"AAL.L\",\"Anglo American  PLC\",\"436.35 13:13\",\"5.35 (1.24%)\",\"5,799,089\"],\n    [\"ABF.L\",\"Associated British Foods  PLC\",\"3,435.60 13:12\",\"7.40 (0.21%)\",\"86,808\"],\n    [\"ADM.L\",\"Admiral Group  PLC\",\"1,627.00 13:13\",\"\"],\n    [\"ADN.L\",\"Aberdeen Asset Management  PLC\",\"334.00 13:13\",\"2.50 (0.75%)\",\"806,880\"],\n    [\"AHT.L\",\"Ashtead Group  PLC\",\"1,027.00 13:13\",\"6.00 (0.59%)\",\"331,255\"],\n    [\"ANTO.L\",\"Antofagasta  PLC\",\"484.10 13:13\",\"11.70 (2.48%)\",\"1,753,976\"],\n    [\"ARM.L\",\"ARM Holdings  PLC\",\"1,058.00 13:13\",\"3.00 (0.28%)\",\"475,927\"],\n    [\"AV.L\",\"Aviva  PLC\",\"493.97 13:13\",\"2.23 (0.45%)\",\"2,226,835\"],\n    [\"AZN.L\",\"AstraZeneca  PLC\",\"4,399.50 13:13\",\"2.50 (0.06%)\",\"815,133\"],\n    [\"BA.L\",\"BAE Systems  PLC\",\"478.10 13:13\",\"4.30 (0.91%)\",\"2,039,934\"],\n    [\"BAB.L\",\"Babcock International Group  PLC\",\"988.00 13:13\",\"9.50 (0.97%)\",\"209,614\"],\n    [\"BARC.L\",\"Barclays  PLC\",\"226.30 13:13\", \"1.15 (0.51%)\",\"6,575,664\"],\n    [\"BATS.L\",\"British American Tobacco  PLC\",\"3,803.50 13:13\", \"8.50 (0.22%)\",\"465,110\"],\n    [\"BDEV.L\",\"Barratt Developments  PLC\",\"576.00 13:13\", \"0.50 (0.09%)\",\"1,044,365\"],\n    [\"BG.L\",\"BG Group  PLC\",\"1,013.50 13:13\", \"5.50 (0.55%)\",\"1,507,332\"],\n    [\"BKG.L\",\"Berkeley Group Holdings (The)  PLC\",\"3,126.00 13:13\", \"15.00 (0.48%)\",\"95,071\"],\n    [\"BLND.L\",\"British Land Co  PLC\",\"828.06 13:12\", \"10.44 (1.25%)\",\"1,802,548\"],\n    [\"BLT.L\",\"BHP Billiton  PLC\",\"881.40 13:13\", \"4.30 (0.49%)\",\"4,947,287\"],\n    [\"BNZL.L\",\"Bunzl  PLC\",\"1,875.40 13:05\", \"4.60 (0.24%)\",\"104,541\"],\n    [\"BP.L\",\"BP  PLC\",\"381.50 13:13\", \"2.95 (0.78%)\",\"10,493,561\"],\n    [\"BRBY.L\",\"Burberry Group  PLC\",\"1,269.00 13:13\", \"7.00 (0.55%)\",\"295,647\"],\n    [\"BT-A\",\"L,BT Group  PLC\",\"489.20 13:13\", \"3.70 (0.75%)\",\"3,914,982\"],\n    [\"CCL.L\",\"Carnival  PLC\",\"3,426.00 13:12\", \"22.00 (0.64%)\",\"86,257\"],\n    [\"CNA.L\",\"Centrica  PLC\",\"212.80 13:13\", \"0.60 (0.28%)\",\"2,144,540\"],\n    [\"CPG.L\",\"Compass Group  PLC\",\"1,054.00 13:08\", \"5.00 (0.48%)\",\"1,001,167\"],\n    [\"CPI.L\",\"Capita  PLC\",\"1,235.00 13:11\", \"1.00 (0.08%)\",\"244,591\"],\n    [\"CRH.L\",\"CRH  PLC\",\"1,783.20 13:12\", \"17.80 (0.99%)\",\"897,325\"],\n    [\"DC.L\",\"DIXONS CARPHONE\",\"462.10 13:11\",\"\"],\n    [\"DGE.L\",\"Diageo  PLC\",\"1,881.50 13:13\", \"6.50 (0.34%)\",\"756,906\"],\n    [\"DLG.L\",\"Direct Line Insurance Group  PLC\",\"403.80 13:13\", \"0.40 (0.10%)\",\"1,095,340\"],\n    [\"EXPN.L\",\"Experian  PLC\",\"1,191.00 13:12\", \"2.00 (0.17%)\",\"467,283\"],\n    [\"EZJ.L\",\"easyJet  PLC\",\"1,682.00 13:12\", \"28.00 (1.64%)\",\"1,191,230\"],\n    [\"FRES.L\",\"Fresnillo  PLC\",\"678.50 13:12\", \"6.50 (0.97%)\",\"381,871\"],\n    [\"GFS.L\",\"G4S  PLC\",\"232.30 13:03\", \"2.00 (0.85%)\",\"1,096,551\"],\n    [\"GKN.L\",\"GKN  PLC\",\"294.80 13:12\", \"2.50 (0.86%)\",\"792,247\"],\n    [\"GLEN.L\",\"Glencore  PLC\",\"90.48 13:13\", \"1.65 (1.86%)\",\"41,631,528\"],\n    [\"GSK.L\",\"GlaxoSmithKline  PLC\",\"1,345.00 13:13\", \"0.50 (0.04%)\",\"1,767,356\"],\n    [\"HIK.L\",\"Hikma Pharmaceuticals  PLC\",\"2,010.00 13:04\", \"57.00 (2.92%)\",\"261,511\"],\n    [\"HL.L\",\"Hargreaves Lansdown  PLC\",\"1,488.03 13:12\", \"9.97 (0.67%)\",\"372,261\"],\n    [\"HMSO.L\",\"Hammerson  PLC\",\"597.50 13:11\", \"3.50 (0.58%)\",\"478,301\"],\n    [\"HSBA.L\",\"HSBC Holdings  PLC\",\"519.70 13:13\", \"0.50 (0.10%)\",\"7,415,629\"],\n    [\"IAG.L\",\"International Consolidated Airlines Group SA\",\"575.40 13:12\", \"16.10 (2.72%)\",\"4,311,514\"],\n    [\"IHG.L\",\"InterContinental Hotels Group  PLC\",\"2,481.00 13:12\", \"19.00 (0.76%)\",\"219,918\"],\n    [\"III.L\",\"3i Group  PLC\",\"487.30 13:11\", \"4.50 (0.92%)\",\"189,987\"],\n    [\"IMT.L\",\"Imperial Tobacco Group  PLC\",\"3,571.00 13:13\", \"29.00 (0.81%)\",\"926,816\"],\n    [\"INTU.L\",\"intu properties  PLC\",\"319.90 13:09\", \"4.60 (1.42%)\",\"514,821\"],\n    [\"ISAT.L\",\"Inmarsat  PLC\",\"1,054.44 13:13\", \"3.44 (0.33%)\",\"988,089\"],\n    [\"ITRK.L\",\"Intertek Group  PLC\",\"2,643.00 13:14\", \"3.00 (0.11%)\",\"45,868\"],\n    [\"ITV.L\",\"ITV  PLC\",\"267.30 13:14\", \"2.60 (0.96%)\",\"3,453,208\"],\n    [\"JMAT.L\",\"Johnson Matthey  PLC\",\"2,445.00 13:14\", \"29.00 (1.20%)\",\"276,397\"],\n    [\"KGF.L\",\"Kingfisher  PLC\",\"346.20 13:14\", \"4.30 (1.23%)\",\"1,021,408\"],\n    [\"LAND.L\",\"Land Securities Group  PLC\",\"1,239.00 13:13\", \"7.00 (0.56%)\",\"384,973\"],\n    [\"LGEN.L\",\"Legal & General Group  PLC\",\"266.00 13:14\", \"1.60 (0.60%)\",\"1,998,399\"],\n    [\"LLOY.L\",\"Lloyds Banking Group  PLC\",\"73.86 13:14\", \"0.02 (0.03%)\",\"18,907,878\"],\n    [\"LSE.L\",\"London Stock Exchange Group  PLC\",\"2,544.00 13:11\", \"6.00 (0.24%)\",\"129,657\"],\n    [\"MGGT.L\",\"Meggitt  PLC\",\"386.00 13:15\", \"3.20 (0.84%)\",\"611,044\"],\n    [\"MKS.L\",\"Marks & Spencer Group  PLC\",\"514.75 13:12\", \"3.25 (0.63%)\",\"920,128\"],\n    [\"MNDI.L\",\"Mondi  PLC\",\"1,463.00 13:14\", \"7.00 (0.48%)\",\"383,546\"],\n    [\"MRW.L\",\"Morrison (Wm) Supermarkets  PLC\",\"155.20 13:14\",\"\"],\n    [\"NG.L\",\"National Grid  PLC\",\"926.40 13:14\", \"1.10 (0.12%)\",\"1,659,592\"],\n    [\"NXT.L\",\"Next  PLC\",\"7,765.00 13:11\", \"95.00 (1.21%)\",\"114,062\"],\n    [\"OML.L\",\"Old Mutual  PLC\",\"198.50 13:14\", \"0.40 (0.20%)\",\"2,040,849\"],\n    [\"PRU.L\",\"Prudential  PLC\",\"1,499.50 13:15\", \"14.00 (0.93%)\",\"580,870\"],\n    [\"PSON.L\",\"Pearson  PLC\",\"794.00 13:09\", \"5.00 (0.63%)\",\"1,177,953\"],\n    [\"RB.L\",\"Reckitt Benckiser Group  PLC\",\"6,293.00 13:14\", \"34.00 (0.54%)\",\"281,172\"],\n    [\"RBS.L\",\"Royal Bank of Scotland Group  PLC\",\"313.40 13:14\", \"2.40 (0.77%)\",\"2,100,058\"],\n    [\"RDSA.L\",\"Royal Dutch Shell  PLC\",\"1,636.00 13:14\", \"18.00 (1.11%)\",\"2,467,461\"],\n    [\"RDSB.L\",\"Royal Dutch Shell  PLC\",\"1,652.00 13:15\", \"14.50 (0.89%)\",\"1,457,434\"],\n    [\"REL.L\",\"Reed Elsevier  PLC\",\"1,170.00 13:14\",\"0.00 (0.00%)\",\"908,802\"],\n    [\"RIO.L\",\"Rio Tinto  PLC\",\"2,235.00 13:15\", \"21.00 (0.95%)\",\"2,190,722\"],\n    [\"RMG.L\",\"Royal Mail  PLC\",\"453.50 13:14\", \"1.20 (0.26%)\",\"995,316\"],\n    [\"RR.L\",\"Rolls-Royce Group  PLC\",\"546.63 13:14\", \"8.38 (1.51%)\",\"2,792,915\"],\n    [\"RRS.L\",\"Randgold Resources Ltd\",\"3,929.00 13:14\",\"0.00 (0.00%)\",\"135,524\"],\n    [\"RSA.L\",\"RSA Insurance Group  PLC\",\"437.10 13:14\", \"0.10 (0.02%)\",\"395,477\"],\n    [\"SAB.L\",\"SABMiller  PLC\",\"4,011.00 13:15\", \"1.00 (0.02%)\",\"892,451\"],\n    [\"SBRY.L\",\"Sainsbury (J)  PLC\",\"255.80 13:14\", \"7.40 (2.98%)\",\"2,395,670\"],\n    [\"SDR.L\",\"Schroders  PLC\",\"2,930.00 13:09\", \"12.00 (0.41%)\",\"44,674\"],\n    [\"SGE.L\",\"Sage Group (The)  PLC\",\"545.50 13:13\", \"0.50 (0.09%)\",\"539,717\"],\n    [\"SHP.L\",\"Shire  PLC\",\"4,685.00 13:14\", \"22.00 (0.47%)\",\"221,318\"],\n    [\"SKY.L\",\"SKY\",\"1,095.00 13:12\", \"4.00 (0.37%)\",\"925,016\"],\n    [\"SL.L\",\"Standard Life  PLC\",\"399.90 13:14\", \"3.20 (0.79%)\",\"861,636\"],\n    [\"SMIN.L\",\"Smiths Group  PLC\",\"992.50 13:14\", \"27.50 (2.70%)\",\"640,309\"],\n    [\"SN.L\",\"Smith & Nephew  PLC\",\"1,110.00 13:14\", \"9.00 (0.82%)\",\"480,018\"],\n    [\"SPD.L\",\"Sports Direct International  PLC\",\"694.50 13:11\", \"1.50 (0.22%)\",\"157,981\"],\n    [\"SSE.L\",\"SSE  PLC\",\"1,463.00 13:13\", \"2.00 (0.14%)\",\"562,454\"],\n    [\"STAN.L\",\"Standard Chartered  PLC\",\"583.00 13:14\", \"0.60 (0.10%)\",\"2,018,697\"],\n    [\"STJ.L\",\"St James's Place  PLC\",\"964.00 13:14\", \"11.00 (1.13%)\",\"418,480\"],\n    [\"SVT.L\",\"Severn Trent  PLC\",\"2,199.00 13:12\", \"1.00 (0.05%)\",\"95,342\"],\n    [\"TPK.L\",\"Travis Perkins  PLC\",\"1,945.00 13:13\", \"4.00 (0.21%)\",\"92,916\"],\n    [\"TSCO.L\",\"Tesco  PLC\",\"171.54 13:14\", \"2.54 (1.50%)\",\"9,831,136\"],\n    [\"TUI.L\",\"TUI AG\",\"1,115.00 13:10\", \"5.00 (0.45%)\",\"458,970\"],\n    [\"TW.L\",\"Taylor Wimpey  PLC\",\"183.90 13:15\", \"1.10 (0.59%)\",\"3,180,729\"],\n    [\"ULVR.L\",\"Unilever  PLC\",\"2,791.00 13:14\", \"29.00 (1.03%)\",\"824,827\"],\n    [\"UU.L\",\"United Utilities Group  PLC\",\"959.00 13:10\", \"2.50 (0.26%)\",\"436,911\"],\n    [\"VOD.L\",\"Vodafone Group  PLC\",\"224.25 13:15\", \"1.30 (0.58%)\",\"17,572,036\"],\n    [\"WOS.L\",\"Wolseley  PLC\",\"3,657.00 13:14\", \"4.00 (0.11%)\",\"179,536\"],\n    [\"WPP.L\",\"WPP  PLC\",\"1,502.00 13:15\", \"12.00 (0.79%)\",\"857,887\"],\n    [\"WTB.L\",\"Whitbread  PLC\",\"4,484.00 13:16\", \"60.00 (1.32%)\",\"141,036\"]\n]\n", "//Name,Symbol,Weight,Last Trade,Chg,% Chg\n// prettier-ignore\nexport default [\n  [\"Apple Inc\", \"AAPL\", 11.007,174.94,0.15, \"(0.09%)\"],\n  [\"Microsoft Corp\", \"MSFT\", 9.61,316.98,-0.03, \"(-0.01%)\"],\n  [\"Amazon.com Inc\", \"AMZN\", 5.401,129.31,0.19, \"(0.14%)\"],\n  [\"NVIDIA Corp\", \"NVDA\", 4.101,415.74,-0.36, \"(-0.09%)\"],\n  [\"Meta Platforms Inc\", \"META\", 3.729,299.42,0.34, \"(0.11%)\"],\n  [\"Tesla Inc\", \"TSLA\", 3.285,244.13,-0.75, \"(-0.31%)\"],\n  [\"Alphabet Inc\", \"GOOGL\", 3.133,130.49,0.24, \"(0.18%)\"],\n  [\"Alphabet Inc\", \"GOOG\", 3.085,131.49,0.24, \"(0.18%)\"],\n  [\"Broadcom Inc\", \"AVGO\", 2.896,833.04,3.96, \"(0.48%)\"],\n  [\"Costco Wholesale Corp\", \"COST\", 2.137,557.85,-0.74, \"(-0.13%)\"],\n  [\"PepsiCo Inc\", \"PEP\", 2.096,174.84,-0.43, \"(-0.25%)\"],\n  [\"Adobe Inc\", \"ADBE\", 2.033,511.42,-1.48, \"(-0.29%)\"],\n  [\"Cisco Systems Inc\", \"CSCO\", 1.887,53.68,0.11, \"(0.20%)\"],\n  [\"Comcast Corp\", \"CMCSA\", 1.633,45.30,-0.01, \"(-0.01%)\"],\n  [\"Netflix Inc\", \"NFLX\", 1.478,379.89,0.08, \"(0.02%)\"],\n  [\"T-Mobile US Inc\", \"TMUS\", 1.43,140.18,0.83, \"(0.60%)\"],\n  [\"Advanced Micro Devices Inc\", \"AMD\", 1.348,96.09,-0.11, \"(-0.12%)\"],\n  [\"Texas Instruments Inc\", \"TXN\", 1.264,161.00,0.69, \"(0.43%)\"],\n  [\"Intel Corp\", \"INTC\", 1.26,34.19,0.01, \"(0.01%)\"],\n  [\"Amgen Inc\", \"AMGN\", 1.251,271.18,3.48, \"(1.30%)\"],\n  [\"Intuit Inc\", \"INTU\", 1.226,509.00,0.43, \"(0.08%)\"],\n  [\"Honeywell International Inc\", \"HON\", 1.103,188.67,-1.12, \"(-0.59%)\"],\n  [\"QUALCOMM Inc\", \"QCOM\", 1.046,107.53,-0.16, \"(-0.14%)\"],\n  [\"Applied Materials Inc\", \"AMAT\", 0.982,136.32,0.15, \"(0.11%)\"],\n  [\"Booking Holdings Inc\", \"BKNG\", 0.941,3, 19.20,-43.30, \"(-1.42%)\"],\n  [\"Starbucks Corp\", \"SBUX\", 0.926,93.80,0.12, \"(0.12%)\"],\n  [\"Intuitive Surgical Inc\", \"ISRG\", 0.867,288.50,0.30, \"(0.10%)\"],\n  [\"Automatic Data Processing Inc\", \"ADP\", 0.854,239.45,0.10, \"(0.04%)\"],\n  [\"Mondelez International Inc\", \"MDLZ\", 0.835,71.25,0.82, \"(1.16%)\"],\n  [\"Gilead Sciences Inc\", \"GILD\", 0.814,75.47,0.46, \"(0.61%)\"],\n  [\"Vertex Pharmaceuticals Inc\", \"VRTX\", 0.794,353.67,4.14, \"(1.18%)\"],\n  [\"Regeneron Pharmaceuticals Inc\", \"REGN\", 0.763,828.09,3.25, \"(0.39%)\"],\n  [\"Analog Devices Inc\", \"ADI\", 0.752,176.82,1.34, \"(0.76%)\"],\n  [\"Lam Research Corp\", \"LRCX\", 0.702,620.00,0.89, \"(0.14%)\"],\n  [\"Micron Technology Inc\", \"MU\", 0.646,68.90,0.02, \"(0.03%)\"],\n  [\"Palo Alto Networks Inc\", \"PANW\", 0.604,228.70,0.19, \"(0.08%)\"],\n  [\"Synopsys Inc\", \"SNPS\", 0.587,447.12,0.27, \"(0.06%)\"],\n  [\"Charter Communications Inc\", \"CHTR\", 0.581,441.88,-3.33, \"(-0.75%)\"],\n  [\"MercadoLibre Inc\", \"MELI\", 0.562,1,275.50,-1.47, \"(-0.11%)\"],\n  [\"PayPal Holdings Inc\", \"PYPL\", 0.559,57.90,0.02, \"(0.03%)\"],\n  [\"CSX Corp\", \"CSX\", 0.54,31.23,0.03, \"(0.09%)\"],\n  [\"Cadence Design Systems Inc\", \"CDNS\", 0.539,230.83,0.17, \"(0.07%)\"],\n  [\"KLA Corp\", \"KLAC\", 0.53,456.11,4.29, \"(0.95%)\"],\n  [\"PDD Holdings Inc ADR\", \"PDD\", 0.521,95.93,-0.01, \"(-0.01%)\"],\n  [\"Marriott International Inc/MD\", \"MAR\", 0.505,193.90,-0.46, \"(-0.23%)\"],\n  [\"Monster Beverage Corp\", \"MNST\", 0.498,54.48,-0.04, \"(-0.08%)\"],\n  [\"Airbnb Inc\", \"ABNB\", 0.491,132.09,-0.11, \"(-0.08%)\"],\n  [\"O'Reilly Automotive Inc\", \"ORLY\", 0.485,936.67,0.65, \"(0.07%)\"],\n  [\"Cintas Corp\", \"CTAS\", 0.446,505.27,0.52, \"(0.10%)\"],\n  [\"ASML Holding NV\", \"ASML\", 0.438,585.00,-2.10, \"(-0.36%)\"],\n  [\"NXP Semiconductors NV\", \"NXPI\", 0.434,196.76,-0.04, \"(-0.02%)\"],\n  [\"Workday Inc\", \"WDAY\", 0.414,235.55,4.73, \"(2.05%)\"],\n  [\"Lululemon Athletica Inc\", \"LULU\", 0.405,386.36,-1.69, \"(-0.44%)\"],\n  [\"Keurig Dr Pepper Inc,KDP\", 0.404,33.25,0.13, \"(0.39%)\"],\n  [\"Fortinet Inc\", \"FTNT\", 0.401,58.29,0.05, \"(0.09%)\"],\n  [\"Marvell Technology Inc\", \"MRVL\", 0.388,52.38,0.08, \"(0.14%)\"],\n  [\"PACCAR Inc\", \"PCAR\", 0.38,84.97,0.04, \"(0.04%)\"],\n  [\"Old Dominion Freight Line Inc\", \"ODFL\", 0.38,401.01,0.35, \"(0.09%)\"],\n  [\"Autodesk Inc\", \"ADSK\", 0.379,204.07,0.03, \"(0.01%)\"],\n  [\"Kraft Heinz Co/The\", \"KHC\", 0.368,34.27,0.11, \"(0.31%)\"],\n  [\"Microchip Technology Inc\", \"MCHP\", 0.36,77.00,-0.08, \"(-0.10%)\"],\n  [\"Copart Inc\", \"CPRT\", 0.358,43.26,0.10, \"(0.22%)\"],\n  [\"American Electric Power Co Inc\", \"AEP\", 0.357,79.23,0.06, \"(0.08%)\"],\n  [\"Paychex Inc\", \"PAYX\", 0.355,113.01,0.06, \"(0.06%)\"],\n  [\"Exelon Corp\", \"EXC\", 0.35,40.28,0.07, \"(0.16%)\"],\n  [\"ON Semiconductor Corp\", \"ON\", 0.341,93.87,0.06, \"(0.06%)\"],\n  [\"AstraZeneca PLC ADR\", \"AZN\", 0.339,67.35,-0.49, \"(-0.72%)\"],\n  [\"Seagen Inc\", \"SGEN\", 0.336,212.18,-1.52, \"(-0.71%)\"],\n  [\"Ross Stores Inc\", \"ROST\", 0.335,111.71,0.05, \"(0.04%)\"],\n  [\"Moderna Inc\", \"MRNA\", 0.331,100.32,0.33, \"(0.33%)\"],\n  [\"Biogen Inc\", \"BIIB\", 0.326,257.93,0.25, \"(0.10%)\"],\n  [\"Crowdstrike Holdings Inc\", \"CRWD\", 0.319,162.85,0.28, \"(0.17%)\"],\n  [\"IDEXX Laboratories Inc\", \"IDXX\", 0.316,439.41,3.72, \"(0.85%)\"],\n  [\"Baker Hughes Co\", \"BKR\", 0.307,35.44,0.04, \"(0.10%)\"],\n  [\"Constellation Energy Corp\", \"CEG\",0.307,110.41,0.05, \"(0.04%)\"],\n  [\"Cognizant Technology Solutions Corp\",\"CTSH\",0.303,70.19,0.58,\"(0.83%)\"],\n  [\"Verisk Analytics Inc\", \"VRSK\", 0.303,242.05,0.10, \"(0.04%)\"],\n  [\"Dexcom Inc\", \"DXCM\", 0.3,88.30,0.80, \"(0.92%)\"],\n  [\"Trade Desk Inc/The\", \"TTD\", 0.293,76.38,0.03, \"(0.03%)\"],\n  [\"Xcel Energy Inc\", \"XEL\", 0.284,59.76,0.03, \"(0.04%)\"],\n  [\"Electronic Arts Inc\", \"EA\", 0.279,118.38,-0.63, \"(-0.53%)\"],\n  [\"CoStar Group Inc\", \"CSGP\", 0.277,78.18,0.12, \"(0.15%)\"],\n  [\"GLOBALFOUNDRIES Inc\", \"GFS\", 0.273,57.21,0.38, \"(0.67%)\"],\n  [\"Fastenal Co\", \"FAST\", 0.268,54.32,0.11, \"(0.20%)\"],\n  [\"Atlassian Corp\", \"TEAM\", 0.253,196.01,0.55, \"(0.28%)\"],\n  [\"GE HealthCare Technologies Inc\", \"GEHC\", 0.252,63.78,-0.56, \"(-0.86%)\"],\n  [\"Warner Bros Discovery Inc\", \"WBD\", 0.244,11.09,-0.02, \"(-0.14%)\"],\n  [\"Diamondback Energy Inc\", \"FANG\", 0.235,150.70,0.13, \"(0.09%)\"],\n  [\"Datadog Inc\", \"DDOG\", 0.23,88.81,0.05, \"(0.06%)\"],\n  [\"ANSYS Inc\", \"ANSS\", 0.227,300.60,-2.31, \"(-0.76%)\"],\n  [\"eBay Inc\", \"EBAY\", 0.203,43.22,0.09, \"(0.20%)\"],\n  [\"Dollar Tree Inc\", \"DLTR\", 0.201,104.77,0.27, \"(0.25%)\"],\n  [\"Align Technology Inc\", \"ALGN\", 0.2,297.25,-1.31, \"(-0.44%)\"],\n  [\"Zscaler Inc\", \"ZS\", 0.188,151.80,0.09, \"(0.06%)\"],\n  [\"Illumina Inc\", \"ILMN\", 0.183,132.31,-0.13, \"(-0.10%)\"],\n  [\"Walgreens Boots Alliance Inc\", \"WBA\", 0.161,21.18,0.06, \"(0.28%)\"],\n  [\"Zoom Video Communications Inc\", \"ZM\", 0.151,68.57,-0.29, \"(-0.41%)\"],\n  [\"Enphase Energy Inc\", \"ENPH\", 0.148,120.41,0.49, \"(0.41%)\"],\n  [\"Sirius XM Holdings Inc\", \"SIRI\", 0.137,4.05,0.02, \"(0.50%)\"],\n  [\"JD.com Inc ADR\", \"JD\", 0.117,30.43,0.02, \"(0.05%)\"],\n  [\"Lucid Group Inc\", \"LCID\", 0.102,5.14,0.03, \"(0.49%)\"],\n];\n", "//Name,Symbol,Weight,Price,Change,Change %\nexport default [\n  [\"Apple Inc\", \"AAPL\", 6.992488, 171.9, 1.47, \"(0.86%)\"],\n  [\"Microsoft Corp\", \"MSFT\", 6.487978, 314.55, 1.76, \"(0.56%)\"],\n  [\"Amazon.com Inc\", \"AMZN\", 3.193379, 126.25, 0.27, \"(0.22%)\"],\n  [\"Nvidia Corp\", \"NVDA\", 2.928461, 433.11, 8.43, \"(1.99%)\"],\n  [\"Alphabet Inc Cl A\", \"GOOGL\", 2.162218, 132.93, 2.39, \"(1.83%)\"],\n  [\"Tesla Inc\", \"TSLA\", 1.854311, 246.56, 6.06, \"(2.52%)\"],\n  [\"Alphabet Inc Cl C\", \"GOOG\", 1.85251, 133.81, 2.35, \"(1.78%)\"],\n  [\"Meta Platforms Inc Class A\", \"META\", 1.847731, 305.93, 8.19, \"(2.75%)\"],\n  [\"Berkshire Hathaway Inc Cl B\", \"BRK.B\", 1.82184, 358.67, 0.89, \"(0.25%)\"],\n  [\"Exxon Mobil Corp\", \"XOM\", 1.343563, 118.97, -1.23, \"(-1.03%)\"],\n  [\"Unitedhealth Group Inc\", \"UNH\", 1.302884, 510.04, 6.31, \"(1.25%)\"],\n  [\"Eli Lilly & Co\", \"LLY\", 1.224046, 546.65, -3.11, \"(-0.57%)\"],\n  [\"Jpmorgan Chase & Co\", \"JPM\", 1.182918, 148.23, 2.45, \"(1.68%)\"],\n  [\"Johnson & Johnson W/d\", \"JNJ\", 1.056344, 156.83, -0.28, \"(-0.18%)\"],\n  [\"Visa Inc Class a Shares\", \"V\", 1.029636, 231.97, 2.47, \"(1.08%)\"],\n  [\"Procter & Gamble Co\", \"PG\", 0.969793, 145.75, -1.59, \"(-1.08%)\"],\n  [\"Broadcom Inc\", \"AVGO\", 0.941177, 835.33, 18.52, \"(2.27%)\"],\n  [\"Mastercard Inc A\", \"MA\", 0.918779, 400.65, 5.17, \"(1.31%)\"],\n  [\"Chevron Corp\", \"CVX\", 0.847353, 170.55, -0.49, \"(-0.28%)\"],\n  [\"Home Depot Inc\", \"HD\", 0.847289, 304.35, 2.53, \"(0.84%)\"],\n  [\"Abbvie Inc\", \"BBV\", 0.754672, 152.14, -0.99, \"(-0.65%)\"],\n  [\"Merck & Co. Inc.\", \"MRK\", 0.736434, 104.2, 0.26, \"(0.25%)\"],\n  [\"Costco Wholesale Corp\", \"COST\", 0.697258, 569.05, 5.52, \"(0.98%)\"],\n  [\"Pepsico Inc\", \"PEP\", 0.651768, 168.92, -0.65, \"(-0.38%)\"],\n  [\"Walmart Inc\", \"WMT\", 0.644449, 161.87, 0.15, \"(0.09%)\"],\n  [\"Adobe Inc\", \"ADBE\", 0.639652, 507.17, 4.57, \"(0.91%)\"],\n  [\"Coca Cola Co\", \"KO\", 0.60801, 55.82, -0.13, \"(-0.23%)\"],\n  [\"Cisco Systems Inc\", \"CSCO\", 0.605326, 53.97, 0.77, \"(1.44%)\"],\n  [\"Accenture Plc Cl A\", \"ACN\", 0.55372, 298.5, -15.9, \"(-5.05%)\"],\n  [\"Salesforce Inc\", \"CRM\", 0.551342, 204.46, 1.73, \"(0.85%)\"],\n  [\"Thermo Fisher Scientific Inc\", \"TMO\", 0.536951, 503.47, 5.18, \"(1.04%)\"],\n  [\"Mcdonald S Corp\", \"MCD\", 0.536457, 265.83, 2.19, \"(0.83%)\"],\n  [\"Bank of America Corp\", \"BAC\", 0.526405, 27.51, 0.24, \"(0.86%)\"],\n  [\"Comcast Corp Class A\", \"CMCSA\", 0.512537, 45.17, 0.57, \"(1.27%)\"],\n  [\"Linde Plc\", \"LIN\", 0.506835, 375.48, 3.47, \"(0.93%)\"],\n  [\"Pfizer Inc\", \"PFE\", 0.506043, 32.09, -0.02, \"(-0.05%)\"],\n  [\"Netflix Inc\", \"NFLX\", 0.467192, 377.77, 0.18, \"(0.05%)\"],\n  [\"Abbott Laboratories\", \"ABT\", 0.462893, 97.52, 1.99, \"(2.08%)\"],\n  [\"Oracle Corp\", \"ORCL\", 0.459877, 106.29, 1.67, \"(1.60%)\"],\n];\n\n/*\n41,Danaher Corp,DHR,0.454026,248.24,0.80,(0.32%)\n42,Advanced Micro Devices,AMD,0.442473,103.74,5.67,(5.78%)\n43,Wells Fargo & Co,WFC,0.417428,41.04,0.18,(0.43%)\n44,Conocophillips,COP,0.411569,123.32,0.23,(0.18%)\n45,Walt Disney Co,DIS,0.408438,80.35,0.45,(0.56%)\n46,Intel Corp,INTC,0.404462,35.50,0.89,(2.56%)\n47,Amgen Inc,AMGN,0.401904,270.91,1.93,(0.72%)\n48,Texas Instruments Inc,TXN,0.400931,160.98,2.84,(1.80%)\n49,Intuit Inc,INTU,0.397406,515.11,6.87,(1.35%)\n50,Philip Morris International,PM,0.39143,92.66,2.34,(2.59%)\n51,Caterpillar Inc,CAT,0.388444,276.34,3.63,(1.33%)\n52,Verizon Communications Inc,VZ,0.380327,32.56,0.16,(0.48%)\n53,Intl Business Machines Corp,IBM,0.364246,140.89,-2.28,(-1.59%)\n54,Honeywell International Inc,HON,0.348317,188.68,0.80,(0.43%)\n55,Union Pacific Corp,UNP,0.344419,203.88,1.48,(0.73%)\n56,Qualcomm Inc,QCOM,0.340195,111.55,2.36,(2.16%)\n57,Nextera Energy Inc,NEE,0.338809,57.64,-2.32,(-3.88%)\n58,Lowe S Cos Inc,LOW,0.338613,209.52,2.56,(1.24%)\n59,Bristol Myers Squibb Co,BMY,0.337683,58.30,0.41,(0.70%)\n60,General Electric Co,GE,0.336989,112.43,1.54,(1.39%)\n61,S&p Global Inc,SPGI,0.32985,369.21,6.15,(1.69%)\n62,Applied Materials Inc,AMAT,0.316678,139.15,4.09,(3.03%)\n63,Servicenow Inc,NOW,0.3112,552.84,6.46,(1.18%)\n64,Boeing Co,BA,0.309673,193.12,-2.34,(-1.20%)\n65,United Parcel Service Cl B,UPS,0.307795,154.29,1.88,(1.23%)\n66,Booking Holdings Inc,BKNG,0.307126,3,086.26,3.60,(0.12%)\n67,Nike Inc Cl B,NKE,0.305871,89.63,0.21,(0.24%)\n68,At&t Inc,T,0.296603,14.94,0.07,(0.44%)\n69,Goldman Sachs Group Inc,GS,0.296356,325.72,3.77,(1.17%)\n70,Rtx Corp,RTX,0.296189,72.54,-0.34,(-0.46%)\n71,Elevance Health Inc,ELV,0.292632,448.99,4.23,(0.95%)\n72,Deere & Co,DE,0.291602,388.36,4.00,(1.04%)\n73,Starbucks Corp,SBUX,0.291579,91.21,0.04,(0.04%)\n74,Morgan Stanley,MS,0.29087,82.34,0.69,(0.84%)\n75,Medtronic Plc,MDT,0.290688,78.77,0.55,(0.71%)\n76,Prologis Inc,PLD,0.286912,112.30,1.05,(0.94%)\n77,Intuitive Surgical Inc,ISRG,0.285764,296.31,4.88,(1.67%)\n78,Tjx Companies Inc,TJX,0.282733,89.27,1.16,(1.32%)\n79,Automatic Data Processing,ADP,0.279113,243.79,1.16,(0.48%)\n80,Marsh & Mclennan Cos,MMC,0.266169,193.53,0.55,(0.29%)\n81,Mondelez International Inc A,MDLZ,0.26425,69.44,-0.56,(-0.79%)\n82,Gilead Sciences Inc,GILD,0.26285,75.96,0.41,(0.54%)\n83,Lockheed Martin Corp,LMT,0.255775,410.40,1.68,(0.41%)\n84,Blackrock Inc,BLK,0.252096,645.37,1.98,(0.31%)\n85,Vertex Pharmaceuticals Inc,VRTX,0.251521,353.91,4.26,(1.22%)\n86,Stryker Corp,SYK,0.250789,273.07,6.53,(2.45%)\n87,Cvs Health Corp,CVS,0.250255,70.11,0.33,(0.47%)\n88,Regeneron Pharmaceuticals,REGN,0.2481,835.67,3.11,(0.37%)\n89,American Express Co,AXP,0.243515,150.42,0.52,(0.34%)\n90,Chubb Ltd,CB,0.242706,212.92,1.29,(0.61%)\n91,Analog Devices Inc,ADI,0.241943,177.01,4.20,(2.43%)\n92,Schlumberger Ltd,SLB,0.241232,61.02,0.22,(0.36%)\n93,Eaton Corp Plc,ETN,0.238556,216.42,2.06,(0.96%)\n94,The Cigna Group,CI,0.238517,291.43,2.82,(0.98%)\n95,Progressive Corp,PGR,0.229854,140.76,0.14,(0.10%)\n96,Lam Research Corp,LRCX,0.228483,627.46,13.54,(2.20%)\n97,Schwab (Charles) Corp,SCHW,0.225784,54.57,0.19,(0.35%)\n98,Zoetis Inc,ZTS,0.224522,174.68,-0.00,(-0.00%)\n99,Citigroup Inc,C,0.217552,41.24,0.78,(1.92%)\n100,Boston Scientific Corp,BSX,0.213003,53.30,1.20,(2.31%)\n101,Blackstone Inc,BX,0.211158,108.88,2.33,(2.19%)\n102,Eog Resources Inc,EOG,0.21104,130.56,0.75,(0.57%)\n103,Becton Dickinson and Co,BDX,0.209627,262.60,3.80,(1.47%)\n104,Micron Technology Inc,MU,0.208276,66.25,-1.96,(-2.87%)\n105,American Tower Corp,AMT,0.207727,160.73,1.04,(0.65%)\n106,Altria Group Inc,MO,0.207666,42.11,0.20,(0.47%)\n107,T Mobile Us Inc,TMUS,0.20192,140.30,0.60,(0.43%)\n108,Cme Group Inc,CME,0.201368,200.22,-0.14,(-0.07%)\n109,Southern Co,SO,0.20116,65.04,-1.10,(-1.67%)\n110,Palo Alto Networks Inc,PANW,0.198047,236.42,4.52,(1.95%)\n111,Duke Energy Corp,DUK,0.193827,88.87,-1.23,(-1.36%)\n112,Fiserv Inc,FI,0.192662,113.67,0.48,(0.42%)\n113,Synopsys Inc,SNPS,0.189768,458.88,12.17,(2.72%)\n114,Activision Blizzard Inc,ATVI,0.18717,93.71,-0.22,(-0.23%)\n115,Aon Plc Class A,AON,0.186896,330.04,0.12,(0.04%)\n116,Equinix Inc,EQIX,0.184757,715.84,8.74,(1.24%)\n117,Illinois Tool Works,ITW,0.177501,233.17,0.77,(0.33%)\n118,Air Products & Chemicals Inc,APD,0.17678,289.15,3.89,(1.36%)\n119,Paypal Holdings Inc,PYPL,0.175802,58.30,0.96,(1.67%)\n120,Cadence Design Sys Inc,CDNS,0.175052,235.09,4.44,(1.93%)\n121,Northrop Grumman Corp,NOC,0.173654,441.30,4.06,(0.93%)\n122,Intercontinental Exchange In,ICE,0.172998,109.93,1.66,(1.53%)\n123,Humana Inc,HUM,0.170476,495.73,2.16,(0.44%)\n124,Marathon Petroleum Corp,MPC,0.170186,155.28,2.85,(1.87%)\n125,Kla Corp,KLAC,0.170079,459.61,14.05,(3.15%)\n126,Fedex Corp,FDX,0.169747,266.99,4.28,(1.63%)\n127,Csx Corp,CSX,0.169632,30.62,0.34,(1.14%)\n128,Mckesson Corp,MCK,0.167376,445.58,1.20,(0.27%)\n129,Sherwin Williams Co,SHW,0.165389,254.95,4.33,(1.73%)\n130,Colgate Palmolive Co,CL,0.164,71.11,0.06,(0.08%)\n131,Airbnb Inc Class A,ABNB,0.159553,137.66,3.63,(2.70%)\n132,Waste Management Inc,WM,0.15893,154.17,-0.25,(-0.16%)\n133,Emerson Electric Co,EMR,0.154857,97.31,0.45,(0.47%)\n134,O Reilly Automotive Inc,ORLY,0.154194,918.15,3.98,(0.44%)\n135,Pioneer Natural Resources Co,PXD,0.1524,234.43,0.34,(0.14%)\n136,Phillips 66,PSX,0.150197,122.81,2.01,(1.66%)\n137,Freeport Mcmoran Inc,FCX,0.146185,37.34,0.79,(2.17%)\n138,3m Co W/d,MMM,0.144312,93.48,0.02,(0.02%)\n139,Roper Technologies Inc,ROP,0.144165,486.61,-0.02,(-0.00%)\n140,Valero Energy Corp,VLO,0.141937,147.59,3.64,(2.53%)\n141,Nxp Semiconductors Nv,NXPI,0.141583,202.19,5.49,(2.79%)\n142,Target Corp,TGT,0.141106,109.31,-0.44,(-0.40%)\n143,Parker Hannifin Corp,PH,0.140358,396.29,5.18,(1.32%)\n144,Us Bancorp,USB,0.139291,32.59,0.07,(0.20%)\n145,General Dynamics Corp,GD,0.139193,223.44,2.44,(1.10%)\n146,Chipotle Mexican Grill Inc,CMG,0.139055,1,828.59,22.51,(1.25%)\n147,Hca Healthcare Inc,HCA,0.138966,251.59,4.33,(1.75%)\n148,Arthur J Gallagher & Co,AJG,0.138231,231.77,1.44,(0.62%)\n149,Moody S Corp,MCO,0.138162,319.07,4.56,(1.45%)\n150,Amphenol Corp Cl A,APH,0.136941,84.40,2.04,(2.47%)\n151,Ford Motor Co,F,0.1362,12.58,0.19,(1.49%)\n152,Marriott International Cl A,MAR,0.135619,199.53,5.65,(2.92%)\n153,Pnc Financial Services Group,PNC,0.135457,123.09,1.28,(1.05%)\n154,Transdigm Group Inc,TDG,0.131273,860.46,8.64,(1.01%)\n155,Carrier Global Corp,CARR,0.129065,56.83,1.75,(3.17%)\n156,Autozone Inc,AZO,0.128857,2,556.17,15.27,(0.60%)\n157,Trane Technologies Plc,TT,0.12759,207.07,7.01,(3.50%)\n158,Motorola Solutions Inc,MSI,0.127284,275.18,2.20,(0.81%)\n159,Arista Networks Inc,ANET,0.12715,184.23,2.63,(1.45%)\n160,Norfolk Southern Corp,NSC,0.124378,197.30,1.08,(0.55%)\n161,General Motors Co,GM,0.124282,33.25,0.90,(2.77%)\n162,Paccar Inc,PCAR,0.123613,86.12,1.31,(1.54%)\n163,Charter Communications Inc A,CHTR,0.123199,442.28,8.86,(2.04%)\n164,Hess Corp,HES,0.121942,157.30,-0.74,(-0.47%)\n165,Sempra,SRE,0.121909,68.15,-1.26,(-1.81%)\n166,Occidental Petroleum Corp,OXY,0.121531,66.03,0.43,(0.66%)\n167,American International Group,AIG,0.121272,61.73,0.72,(1.18%)\n168,Autodesk Inc,ADSK,0.120711,208.03,5.75,(2.84%)\n169,Edwards Lifesciences Corp,EW,0.119074,69.68,-0.43,(-0.62%)\n170,Ecolab Inc,ECL,0.118911,169.50,1.63,(0.97%)\n171,Public Storage,PSA,0.117206,266.58,1.60,(0.60%)\n172,Microchip Technology Inc,MCHP,0.116275,78.91,2.41,(3.15%)\n173,Aflac Inc,AFL,0.11627,77.65,0.62,(0.81%)\n174,Cintas Corp,CTAS,0.116227,486.83,5.75,(1.19%)\n175,Welltower Inc,WELL,0.116157,81.07,0.87,(1.08%)\n176,Williams Cos Inc,WMB,0.115685,34.65,0.55,(1.61%)\n177,Kimberly Clark Corp,KMB,0.114902,121.11,-0.55,(-0.45%)\n178,Archer Daniels Midland Co,ADM,0.114307,76.74,0.38,(0.50%)\n179,Msci Inc,MSCI,0.113047,518.97,7.03,(1.37%)\n180,Constellation Brands Inc A,STZ,0.112869,251.62,1.03,(0.41%)\n181,On Semiconductor,ON,0.111009,95.12,3.07,(3.33%)\n182,Metlife Inc,MET,0.110772,63.06,0.26,(0.41%)\n183,Monster Beverage Corp,MNST,0.110311,53.31,0.19,(0.35%)\n184,Hilton Worldwide Holdings In,HLT,0.109054,153.24,3.88,(2.60%)\n185,American Electric Power,AEP,0.108899,74.71,-1.15,(-1.51%)\n186,Crown Castle Inc,CCI,0.108512,91.35,1.65,(1.83%)\n187,Exelon Corp,EXC,0.107894,38.11,-0.69,(-1.78%)\n188,Nucor Corp,NUE,0.107787,158.31,2.60,(1.67%)\n189,Travelers Cos Inc,TRV,0.107342,167.42,-0.51,(-0.30%)\n190,Dominion Energy Inc,D,0.106001,44.61,-0.86,(-1.88%)\n191,Te Connectivity Ltd,TEL,0.105581,123.84,3.40,(2.82%)\n192,Halliburton Co,HAL,0.105449,42.18,0.15,(0.37%)\n193,Centene Corp,CNC,0.105443,69.87,0.13,(0.18%)\n194,Fortinet Inc,FTNT,0.105315,59.07,0.93,(1.59%)\n195,Oneok Inc,OKE,0.104854,64.86,0.35,(0.53%)\n196,General Mills Inc,GIS,0.104655,63.79,-0.26,(-0.40%)\n197,Copart Inc,CPRT,0.104453,43.66,0.61,(1.41%)\n198,Paychex Inc,PAYX,0.104412,117.40,0.89,(0.76%)\n199,Biogen Inc,BIIB,0.103916,258.95,1.43,(0.55%)\n200,Truist Financial Corp,TFC,0.103679,28.15,0.18,(0.63%)\n201,Ross Stores Inc,ROST,0.10361,111.18,2.26,(2.07%)\n202,Johnson Controls Internation,JCI,0.103601,53.69,-0.85,(-1.55%)\n203,Iqvia Holdings Inc,IQV,0.103397,200.11,-2.10,(-1.04%)\n204,Capital One Financial Corp,COF,0.101688,96.63,1.14,(1.20%)\n205,Baker Hughes Co,BKR,0.101425,36.62,0.37,(1.02%)\n206,Idexx Laboratories Inc,IDXX,0.101263,439.37,2.51,(0.57%)\n207,Corteva Inc,CTVA,0.100577,50.77,0.02,(0.05%)\n208,Dow Inc,DOW,0.100258,50.87,-0.13,(-0.26%)\n209,Old Dominion Freight Line,ODFL,0.100037,406.82,6.93,(1.73%)\n210,Constellation Energy,CEG,0.099445,109.94,-0.81,(-0.73%)\n211,Dexcom Inc,DXCM,0.099384,95.68,3.59,(3.90%)\n212,Simon Property Group Inc,SPG,0.098977,108.45,0.26,(0.24%)\n213,Digital Realty Trust Inc,DLR,0.098757,117.60,0.76,(0.65%)\n214,Realty Income Corp,O,0.098278,49.83,0.17,(0.33%)\n215,Kenvue Inc W/i,KVUE,0.097359,20.20,-0.02,(-0.12%)\n216,Verisk Analytics Inc,VRSK,0.097203,241.97,2.34,(0.98%)\n217,Cognizant Tech Solutions A,CTSH,0.096172,68.15,-0.05,(-0.07%)\n218,P G & E Corp,PCG,0.095995,16.36,-0.09,(-0.52%)\n219,Prudential Financial Inc,PRU,0.095804,94.93,0.41,(0.43%)\n220,Ametek Inc,AME,0.09567,150.03,1.17,(0.79%)\n221,Yum Brands Inc,YUM,0.095443,123.55,1.57,(1.29%)\n222,Dupont De Nemours Inc,DD,0.094185,74.58,1.11,(1.51%)\n223,Ameriprise Financial Inc,AMP,0.093691,332.11,5.16,(1.58%)\n224,L3harris Technologies Inc,LHX,0.092512,173.16,-2.04,(-1.16%)\n225,Fidelity National Info Serv,FIS,0.09207,56.06,0.52,(0.94%)\n226,Sysco Corp,SYY,0.091968,65.99,0.78,(1.20%)\n227,Moderna Inc,MRNA,0.091789,100.61,1.17,(1.18%)\n228,Bank of New York Mellon Corp,BK,0.091699,42.76,0.59,(1.39%)\n229,Agilent Technologies Inc,A,0.091382,111.91,1.41,(1.28%)\n230,Otis Worldwide Corp,OTIS,0.091228,80.55,1.20,(1.51%)\n231,Rockwell Automation Inc,ROK,0.091103,288.26,3.46,(1.21%)\n232,Dr Horton Inc,DHI,0.090974,108.96,1.95,(1.82%)\n233,Cummins Inc,CMI,0.090916,232.98,3.03,(1.32%)\n234,Estee Lauder Companies Cl A,EL,0.090788,139.94,-0.10,(-0.07%)\n235,Kinder Morgan Inc,KMI,0.090175,16.71,0.05,(0.27%)\n236,Keurig Dr Pepper Inc,KDP,0.088358,31.51,-0.16,(-0.51%)\n237,Fastenal Co,FAST,0.087952,55.72,0.66,(1.21%)\n238,Xcel Energy Inc,XEL,0.087474,56.50,-0.71,(-1.25%)\n239,Devon Energy Corp,DVN,0.087359,48.84,0.00,(0.01%)\n240,Ww Grainger Inc,GWW,0.086956,704.07,3.96,(0.57%)\n241,Costar Group Inc,CSGP,0.086756,77.10,0.75,(0.99%)\n242,Cencora Inc,COR,0.086188,183.99,-1.17,(-0.63%)\n243,United Rentals Inc,URI,0.085093,454.44,8.22,(1.84%)\n244,Hershey Co,HSY,0.084755,201.01,-1.55,(-0.76%)\n245,Arch Capital Group Ltd,ACGL,0.083799,81.62,0.54,(0.67%)\n246,Ppg Industries Inc,PPG,0.083787,130.49,2.46,(1.92%)\n247,Global Payments Inc,GPN,0.083671,116.72,1.47,(1.28%)\n248,Consolidated Edison Inc,ED,0.083432,85.06,-1.57,(-1.81%)\n249,Newmont Corp,NEM,0.082799,36.78,-0.50,(-1.34%)\n250,Republic Services Inc,RSG,0.082765,145.01,0.28,(0.19%)\n251,Allstate Corp,ALL,0.08254,112.77,-0.25,(-0.22%)\n252,Electronic Arts Inc,EA,0.081213,119.76,1.79,(1.51%)\n253,Vici Properties Inc,VICI,0.081127,29.28,0.40,(1.37%)\n254,Kroger Co,KR,0.080998,44.96,0.48,(1.07%)\n255,Public Service Enterprise Gp,PEG,0.080723,56.88,-1.02,(-1.75%)\n256,Lennar Corp A,LEN,0.078759,113.41,1.71,(1.53%)\n257,Diamondback Energy Inc,FANG,0.078498,158.01,0.78,(0.50%)\n258,West Pharmaceutical Services,WST,0.077362,377.15,1.97,(0.52%)\n259,Quanta Services Inc,PWR,0.077074,190.82,0.70,(0.37%)\n260,Gartner Inc,IT,0.076911,347.78,-1.41,(-0.40%)\n261,Aptiv Plc,APTV,0.0757,99.21,3.35,(3.50%)\n262,Vulcan Materials Co,VMC,0.075604,207.60,4.00,(1.97%)\n263,Kraft Heinz Co,KHC,0.075468,33.72,-0.31,(-0.90%)\n264,Ge Healthcare Technology,GEHC,0.074734,69.81,1.53,(2.24%)\n265,Cdw Corp/de,CDW,0.074375,202.53,3.84,(1.93%)\n266,Fortive Corp,FTV,0.072323,74.75,1.16,(1.58%)\n267,Ingersoll Rand Inc,IR,0.071683,64.52,1.25,(1.97%)\n268,Ansys Inc,ANSS,0.071343,299.19,4.85,(1.65%)\n269,Extra Space Storage Inc,EXR,0.071269,120.75,0.24,(0.20%)\n270,Wec Energy Group Inc,WEC,0.071007,79.67,-0.91,(-1.12%)\n271,Martin Marietta Materials,MLM,0.070759,418.00,8.05,(1.96%)\n272,Edison International,EIX,0.068887,63.92,-1.38,(-2.11%)\n273,American Water Works Co Inc,AWK,0.068233,123.27,-3.07,(-2.43%)\n274,Warner Bros Discovery Inc,WBD,0.068207,10.89,-0.15,(-1.31%)\n275,Lyondellbasell Indu Cl A,LYB,0.067294,94.86,-0.11,(-0.11%)\n276,Mettler Toledo International,MTD,0.067028,1,112.26,14.48,(1.32%)\n277,Avalonbay Communities Inc,AVB,0.066762,171.85,-0.60,(-0.35%)\n278,Delta Air Lines Inc,DAL,0.065781,37.32,0.66,(1.79%)\n279,T Rowe Price Group Inc,TROW,0.064996,104.73,1.19,(1.15%)\n280,Keysight Technologies In,KEYS,0.064934,133.51,3.11,(2.38%)\n281,Zimmer Biomet Holdings Inc,ZBH,0.064476,112.14,1.38,(1.24%)\n282,Dollar General Corp,DG,0.064042,105.04,0.70,(0.67%)\n283,Corning Inc,GLW,0.064037,30.35,0.29,(0.98%)\n284,Ebay Inc,EBAY,0.063728,43.45,0.56,(1.31%)\n285,Cbre Group Inc A,CBRE,0.063578,73.84,0.35,(0.48%)\n286,Weyerhaeuser Co,WY,0.063312,30.40,-0.64,(-2.05%)\n287,Church & Dwight Co Inc,CHD,0.062765,91.68,-0.29,(-0.31%)\n288,Cardinal Health Inc,CAH,0.062583,88.18,0.14,(0.16%)\n289,Hp Inc,HPQ,0.062013,25.73,0.09,(0.36%)\n290,Equifax Inc,EFX,0.061821,185.40,4.68,(2.59%)\n291,Tractor Supply Company,TSCO,0.061683,205.07,2.06,(1.02%)\n292,Willis Towers Watson Plc,WTW,0.06168,211.96,0.35,(0.17%)\n293,Hewlett Packard Enterprise,HPE,0.061499,17.70,0.63,(3.66%)\n294,Fair Isaac Corp,FICO,0.061481,890.19,4.58,(0.52%)\n295,Dollar Tree Inc,DLTR,0.061287,106.46,1.11,(1.05%)\n296,Hartford Financial Svcs Grp,HIG,0.061236,72.24,0.53,(0.73%)\n297,Resmed Inc,RMD,0.060853,149.81,1.16,(0.78%)\n298,Take Two Interactive Softwre,TTWO,0.060753,139.63,1.85,(1.34%)\n299,Royal Caribbean Cruises Ltd,RCL,0.060515,94.38,2.42,(2.64%)\n300,Xylem Inc,XYL,0.060192,91.40,1.09,(1.20%)\n301,Align Technology Inc,ALGN,0.060095,309.06,7.38,(2.45%)\n302,Steris Plc,STE,0.060013,221.57,3.67,(1.69%)\n303,Broadridge Financial Solutio,BR,0.059572,181.18,-0.04,(-0.02%)\n304,Discover Financial Services,DFS,0.059507,86.35,1.09,(1.28%)\n305,State Street Corp,STT,0.059411,67.81,1.03,(1.54%)\n306,Sba Communications Corp,SBAC,0.059216,198.11,2.05,(1.05%)\n307,Monolithic Power Systems Inc,MPWR,0.058699,457.69,16.51,(3.74%)\n308,Illumina Inc,ILMN,0.058584,133.02,-0.28,(-0.21%)\n309,Dte Energy Company,DTE,0.058057,98.82,-1.72,(-1.71%)\n310,M & T Bank Corp,MTB,0.057846,126.63,2.09,(1.68%)\n311,Coterra Energy Inc,CTRA,0.057589,27.48,0.34,(1.23%)\n312,Eversource Energy,ES,0.057281,57.54,-1.23,(-2.09%)\n313,Genuine Parts Co,GPC,0.055796,142.94,0.63,(0.45%)\n314,Equity Residential,EQR,0.055712,58.67,0.23,(0.40%)\n315,Entergy Corp,ETR,0.055241,92.23,-1.02,(-1.10%)\n316,Dover Corp,DOV,0.055103,141.68,1.09,(0.77%)\n317,Ameren Corporation,AEE,0.054981,74.60,-1.51,(-1.98%)\n318,Ulta Beauty Inc,ULTA,0.054585,398.17,5.73,(1.46%)\n319,Teledyne Technologies Inc,TDY,0.054228,414.36,0.92,(0.22%)\n320,Nvr Inc,NVR,0.054188,6,027.42,86.42,(1.45%)\n321,Targa Resources Corp,TRGP,0.05408,87.52,0.93,(1.08%)\n322,Molina Healthcare Inc,MOH,0.053618,333.09,2.03,(0.61%)\n323,Wabtec Corp,WAB,0.053425,108.18,1.35,(1.26%)\n324,Fleetcor Technologies Inc,FLT,0.053345,260.14,1.28,(0.49%)\n325,Albemarle Corp,ALB,0.053229,172.99,10.36,(6.37%)\n326,Baxter International Inc,BAX,0.05272,37.54,0.21,(0.57%)\n327,Raymond James Financial Inc,RJF,0.052247,101.39,1.84,(1.85%)\n328,Mccormick & Co Non Vtg Shrs,MKC,0.051871,74.55,0.46,(0.63%)\n329,Invitation Homes Inc,INVH,0.051153,31.73,0.03,(0.11%)\n330,Firstenergy Corp,FE,0.050777,34.56,-0.69,(-1.94%)\n331,Laboratory Crp of Amer Hldgs,LH,0.05072,204.23,-0.62,(-0.30%)\n332,Howmet Aerospace Inc,HWM,0.050386,46.99,0.91,(1.97%)\n333,Verisign Inc,VRSN,0.050215,202.93,2.46,(1.23%)\n334,Ppl Corp,PPL,0.04902,23.56,-0.39,(-1.61%)\n335,Iron Mountain Inc,IRM,0.047985,59.55,0.56,(0.94%)\n336,Jacobs Solutions Inc,J,0.047882,136.45,0.27,(0.20%)\n337,Intl Flavors & Fragrances,IFF,0.047868,67.84,0.64,(0.95%)\n338,Centerpoint Energy Inc,CNP,0.047827,26.68,-0.48,(-1.75%)\n339,Darden Restaurants Inc,DRI,0.047736,143.44,2.01,(1.42%)\n340,Hologic Inc,HOLX,0.047358,69.99,0.75,(1.08%)\n341,First Solar Inc,FSLR,0.047324,161.90,3.29,(2.07%)\n342,Expeditors Intl Wash Inc,EXPD,0.046936,114.74,1.08,(0.95%)\n343,Brown & Brown Inc,BRO,0.046675,71.15,0.19,(0.26%)\n344,Factset Research Systems Inc,FDS,0.046601,443.66,8.47,(1.95%)\n345,Fifth Third Bancorp,FITB,0.046598,25.05,0.19,(0.74%)\n346,Ventas Inc,VTR,0.046351,42.18,0.77,(1.85%)\n347,Marathon Oil Corp,MRO,0.046321,27.51,0.12,(0.45%)\n348,Steel Dynamics Inc,STLD,0.046096,106.96,0.52,(0.48%)\n349,Bunge Ltd,BG,0.046038,110.67,1.10,(1.00%)\n350,Ptc Inc,PTC,0.045951,140.25,1.78,(1.28%)\n351,Everest Group Ltd,EG,0.04587,381.30,-0.42,(-0.11%)\n352,Cincinnati Financial Corp,CINF,0.045852,104.40,-0.30,(-0.29%)\n353,Enphase Energy Inc,ENPH,0.045679,121.39,1.28,(1.07%)\n354,Nasdaq Inc,NDAQ,0.04562,49.07,0.74,(1.52%)\n355,Akamai Technologies Inc,AKAM,0.045578,107.75,0.79,(0.74%)\n356,Cboe Global Markets Inc,CBOE,0.045525,155.28,0.51,(0.33%)\n357,Cf Industries Holdings Inc,CF,0.04496,84.93,1.48,(1.78%)\n358,Waters Corp,WAT,0.044936,274.46,2.12,(0.78%)\n359,Pultegroup Inc,PHM,0.044848,74.85,1.65,(2.25%)\n360,Tyler Technologies Inc,TYL,0.044831,387.74,2.43,(0.63%)\n361,Principal Financial Group,PFG,0.044705,72.74,0.74,(1.02%)\n362,Clorox Company,CLX,0.04465,128.98,-0.17,(-0.13%)\n363,Southwest Airlines Co,LUV,0.044478,27.30,0.49,(1.81%)\n364,Regions Financial Corp,RF,0.044397,17.16,0.22,(1.27%)\n365,Garmin Ltd,GRMN,0.044336,104.65,1.42,(1.38%)\n366,Atmos Energy Corp,ATO,0.044128,106.32,-0.14,(-0.13%)\n367,Netapp Inc,NTAP,0.044116,76.49,1.54,(2.05%)\n368,Textron Inc,TXT,0.043659,79.27,0.33,(0.41%)\n369,Cooper Cos Inc,COO,0.04361,318.15,2.23,(0.71%)\n370,Kellogg Co,K,0.043517,58.90,-0.22,(-0.38%)\n371,Idex Corp,IEX,0.043484,210.72,3.28,(1.58%)\n372,Cms Energy Corp,CMS,0.043476,52.78,-0.57,(-1.07%)\n373,Skyworks Solutions Inc,SWKS,0.042974,98.55,2.25,(2.33%)\n374,Alexandria Real Estate Equit,ARE,0.042466,99.48,0.59,(0.60%)\n375,Hunt (Jb) Transprt Svcs Inc,JBHT,0.042319,186.54,0.95,(0.51%)\n376,Las Vegas Sands Corp,LVS,0.042222,45.63,-0.53,(-1.15%)\n377,Ball Corp,BALL,0.042202,48.27,0.04,(0.08%)\n378,Walgreens Boots Alliance Inc,WBA,0.04215,20.97,-0.06,(-0.26%)\n379,Teradyne Inc,TER,0.041494,100.04,3.56,(3.68%)\n380,Mid America Apartment Comm,MAA,0.041385,128.55,0.48,(0.37%)\n381,Epam Systems Inc,EPAM,0.041006,257.76,0.96,(0.37%)\n382,Avery Dennison Corp,AVY,0.040961,183.42,1.39,(0.76%)\n383,Omnicom Group,OMC,0.040483,74.60,1.21,(1.65%)\n384,Huntington Bancshares Inc,HBAN,0.040444,10.25,0.13,(1.24%)\n385,Eqt Corp,EQT,0.040251,40.00,0.39,(0.99%)\n386,Tyson Foods Inc Cl A,TSN,0.040042,49.74,-0.37,(-0.74%)\n387,Western Digital Corp,WDC,0.039814,45.50,0.94,(2.11%)\n388,Northern Trust Corp,NTRS,0.039557,69.29,0.84,(1.23%)\n389,Carnival Corp,CCL,0.039206,14.52,0.54,(3.88%)\n390,Expedia Group Inc,EXPE,0.038585,102.75,2.50,(2.49%)\n391,United Airlines Holdings Inc,UAL,0.038383,42.84,0.81,(1.94%)\n392,Quest Diagnostics Inc,DGX,0.038331,123.71,0.31,(0.25%)\n393,Axon Enterprise Inc,AXON,0.03828,195.69,1.04,(0.53%)\n394,Packaging Corp of America,PKG,0.038236,152.79,0.90,(0.59%)\n395,Revvity Inc,RVTY,0.0378,110.55,1.50,(1.38%)\n396,Snap on Inc,SNA,0.037774,257.97,4.00,(1.58%)\n397,Pool Corp,POOL,0.037475,353.56,9.86,(2.87%)\n398,Essex Property Trust Inc,ESS,0.03733,210.81,0.07,(0.03%)\n399,Domino S Pizza Inc,DPZ,0.037258,382.39,2.18,(0.57%)\n400,Amcor Plc,AMCR,0.037101,9.09,0.06,(0.61%)\n401,Best Buy Co Inc,BBY,0.037071,68.66,0.29,(0.43%)\n402,Apa Corp,APA,0.03662,42.49,0.11,(0.27%)\n403,Lamb Weston Holdings Inc,LW,0.036553,91.47,0.09,(0.10%)\n404,Wr Berkley Corp,WRB,0.036551,65.21,0.86,(1.33%)\n405,Conagra Brands Inc,CAG,0.036484,27.44,-0.10,(-0.35%)\n406,Lkq Corp,LKQ,0.036449,49.51,0.72,(1.47%)\n407,Jm Smucker Co,SJM,0.035767,124.48,-0.96,(-0.77%)\n408,Stanley Black & Decker Inc,SWK,0.035567,83.87,0.97,(1.17%)\n409,Synchrony Financial,SYF,0.035241,30.73,0.55,(1.84%)\n410,Carmax Inc,KMX,0.035202,71.64,-8.05,(-10.10%)\n411,Leidos Holdings Inc,LDOS,0.034943,92.20,0.21,(0.23%)\n412,Seagate Technology Holdings,STX,0.034918,65.71,1.42,(2.20%)\n413,Paycom Software Inc,PAYC,0.034914,259.42,2.34,(0.91%)\n414,Celanese Corp,CE,0.034212,127.11,3.81,(3.09%)\n415,Trimble Inc,TRMB,0.034136,52.22,3.01,(6.12%)\n416,Alliant Energy Corp,LNT,0.03411,48.06,-0.49,(-1.02%)\n417,Citizens Financial Group,CFG,0.033972,26.28,0.52,(2.00%)\n418,International Paper Co,IP,0.033961,35.10,0.15,(0.41%)\n419,Masco Corp,MAS,0.033414,54.58,1.37,(2.58%)\n420,Nordson Corp,NDSN,0.033057,223.81,3.73,(1.69%)\n421,Loews Corp,L,0.032942,64.16,0.36,(0.56%)\n422,Evergy Inc,EVRG,0.032792,50.48,-0.58,(-1.13%)\n423,Mosaic Co,MOS,0.03266,35.63,0.43,(1.22%)\n424,Molson Coors Beverage Co B,TAP,0.032624,62.29,-0.12,(-0.19%)\n425,Zebra Technologies Corp Cl A,ZBRA,0.03257,236.95,11.04,(4.89%)\n426,Viatris Inc,VTRS,0.032115,9.80,0.21,(2.14%)\n427,Live Nation Entertainment In,LYV,0.032035,83.73,2.71,(3.34%)\n428,Host Hotels & Resorts Inc,HST,0.03173,16.38,0.34,(2.11%)\n429,Insulet Corp,PODD,0.031493,166.19,4.49,(2.77%)\n430,Match Group Inc,MTCH,0.031269,40.07,0.09,(0.23%)\n431,Interpublic Group of Cos Inc,IPG,0.031184,29.12,0.39,(1.35%)\n432,Hormel Foods Corp,HRL,0.030887,38.15,-0.19,(-0.48%)\n433,Incyte Corp,INCY,0.03067,58.93,-0.18,(-0.30%)\n434,Udr Inc,UDR,0.030252,35.67,0.28,(0.79%)\n435,Jack Henry & Associates Inc,JKHY,0.030211,150.61,2.17,(1.46%)\n436,Kimco Realty Corp,KIM,0.029862,17.73,0.24,(1.34%)\n437,Aes Corp,AES,0.029775,15.29,-0.65,(-4.05%)\n438,Bio Techne Corp,TECH,0.029742,67.67,0.10,(0.15%)\n439,Pentair Plc,PNR,0.029592,65.59,0.87,(1.34%)\n440,Rollins Inc,ROL,0.029276,37.64,0.20,(0.52%)\n441,Mgm Resorts International,MGM,0.028601,36.76,0.27,(0.74%)\n442,Ceridian Hcm Holding Inc,CDAY,0.028589,67.38,0.35,(0.52%)\n443,Brown Forman Corp Class B,BF.B,0.028542,56.78,0.14,(0.25%)\n444,Nisource Inc,NI,0.028365,24.84,-0.35,(-1.37%)\n445,Gen Digital Inc,GEN,0.028124,17.83,-0.07,(-0.37%)\n446,C.H. Robinson Worldwide Inc,CHRW,0.028048,86.31,0.02,(0.02%)\n447,Camden Property Trust,CPT,0.027984,94.56,-0.32,(-0.34%)\n448,Charles River Laboratories,CRL,0.027736,195.69,0.75,(0.38%)\n449,Healthpeak Properties Inc,PEAK,0.027617,18.15,0.10,(0.58%)\n450,Caesars Entertainment Inc,CZR,0.027217,47.52,1.54,(3.36%)\n451,Regency Centers Corp,REG,0.027131,59.98,0.85,(1.43%)\n452,Keycorp,KEY,0.0269,10.52,0.22,(2.09%)\n453,Henry Schein Inc,HSIC,0.026715,73.88,0.62,(0.84%)\n454,Globe Life Inc,GL,0.026574,110.04,0.61,(0.56%)\n455,Borgwarner Inc,BWA,0.026416,40.72,0.92,(2.31%)\n456,F5 Inc,FFIV,0.026087,160.33,2.74,(1.74%)\n457,Qorvo Inc,QRVO,0.025849,96.39,1.83,(1.93%)\n458,Teleflex Inc,TFX,0.025796,199.42,2.91,(1.48%)\n459,Allegion Plc,ALLE,0.025545,104.97,1.68,(1.63%)\n460,Westrock Co,WRK,0.025292,35.98,0.23,(0.64%)\n461,Eastman Chemical Co,EMN,0.025003,76.99,2.35,(3.15%)\n462,Wynn Resorts Ltd,WYNN,0.024938,92.21,-0.00,(-0.00%)\n463,Nrg Energy Inc,NRG,0.024681,38.55,-0.03,(-0.08%)\n464,Juniper Networks Inc,JNPR,0.024655,27.92,0.42,(1.52%)\n465,Pinnacle West Capital,PNW,0.02321,73.45,-0.71,(-0.95%)\n466,Hasbro Inc,HAS,0.02308,65.23,0.24,(0.37%)\n467,Catalent Inc,CTLT,0.023069,45.85,0.07,(0.15%)\n468,American Airlines Group Inc,AAL,0.02296,13.00,0.39,(3.05%)\n469,Fmc Corp,FMC,0.022942,66.03,0.02,(0.03%)\n470,Campbell Soup Co,CPB,0.022776,41.15,-0.31,(-0.76%)\n471,Smith (a.O.) Corp,AOS,0.022769,66.99,1.54,(2.35%)\n472,Boston Properties Inc,BXP,0.02269,59.66,0.79,(1.34%)\n473,Huntington Ingalls Industrie,HII,0.022502,204.41,1.22,(0.60%)\n474,Fox Corp Class A,FOXA,0.021902,31.47,0.55,(1.76%)\n475,Robert Half Inc,RHI,0.021872,73.78,0.64,(0.87%)\n476,Assurant Inc,AIZ,0.021618,145.63,-0.13,(-0.09%)\n477,Universal Health Services B,UHS,0.021551,127.00,2.80,(2.25%)\n478,Etsy Inc,ETSY,0.021257,63.53,1.64,(2.65%)\n479,Marketaxess Holdings Inc,MKTX,0.021132,205.89,4.11,(2.04%)\n480,News Corp Class A,NWSA,0.0209,20.00,0.35,(1.76%)\n481,Bio Rad Laboratories A,BIO,0.020548,356.10,3.63,(1.03%)\n482,Bath & Body Works Inc,BBWI,0.020412,33.19,1.04,(3.23%)\n483,Dentsply Sirona Inc,XRAY,0.020079,33.94,-0.17,(-0.51%)\n484,Solaredge Technologies Inc,SEDG,0.020026,132.35,4.34,(3.39%)\n485,Whirlpool Corp,WHR,0.019812,131.66,1.03,(0.79%)\n486,Franklin Resources Inc,BEN,0.019128,24.55,0.28,(1.14%)\n487,Generac Holdings Inc,GNRC,0.018958,110.73,1.84,(1.69%)\n488,Norwegian Cruise Line Holdin,NCLH,0.018812,16.96,0.67,(4.08%)\n489,Federal Realty Invs Trust,FRT,0.018475,91.45,1.05,(1.16%)\n490,Tapestry Inc,TPR,0.01809,28.18,0.23,(0.84%)\n491,Invesco Ltd,IVZ,0.017835,14.31,0.22,(1.53%)\n492,Paramount Global Class B,PARA,0.017208,12.89,0.11,(0.89%)\n493,Vf Corp,VFC,0.015631,16.59,-0.32,(-1.89%)\n494,Comerica Inc,CMA,0.014638,41.07,1.12,(2.81%)\n495,Davita Inc,DVA,0.014395,95.75,0.01,(0.01%)\n496,Zions Bancorp Na,ZION,0.013918,33.96,0.79,(2.39%)\n497,Ralph Lauren Corp,RL,0.013127,115.52,0.26,(0.22%)\n498,Sealed Air Corp,SEE,0.012794,32.20,0.46,(1.46%)\n499,Alaska Air Group Inc,ALK,0.012574,37.04,0.63,(1.73%)\n500,Mohawk Industries Inc,MHK,0.011998,85.15,1.23,(1.46%)\n501,Organon & Co,OGN,0.011665,16.93,0.34,(2.02%)\n502,Dxc Technology Co,DXC,0.011658,20.64,0.29,(1.40%)\n503,Fox Corp Class B,FOX,0.010545,29.16,0.53,(1.85%)\n504,News Corp Class B,NWS,0.006575,20.75,0.36,(1.74%)\n*/\n", "//     Name,Symbol,Last,Change,Change %\",Volume,Turn.,P/E,P/B\",Yield,Market Cap\n\n// prettier-ignore\nexport default [\n    [\"CKH HOLDINGS\",\"00001.HK\",41.900,+1.150,\"+2.822%\",\"5.15M\",\"215.13M\",4.38,0.31,\"6.98%\",\"160.48B\"],\n    [\"CLP HOLDINGS\",\"00002.HK\",57.950,-0.100,\"-0.172%\",\"3.32M\",\"193.19M\",156.62,1.39,\"5.35%\",\"146.41B\"],\n    [\"HK & CHINA GAS\",\"00003.HK\",5.460,+0.130,\"+2.439%\",\"16.16M\",\"88.00M\",19.43,1.66,\"6.41%\",\"101.88B\"],\n    [\"HSBC HOLDINGS,00005.HK\",61.700,+1.100,\"+1.815%\",\"22.19M\",\"1.37B\",10.54,0.86,\"4.05%\",1,\"227.60B\"],\n    [\"POWER ASSETS\",\"00006.HK\",37.900,-0.250,\"-0.655%\",\"4.23M\",\"160.75M\",14.30,0.93,\"7.44%\",\"80.77B\"],\n    [\"HANG SENG BANK\",\"00011.HK\",97.450,+2.950,\"+3.122%\",\"2.54M\",\"247.44M\",19.69,1.01,\"4.21%\",\"186.31B\"],\n    [\"HENDERSON LAND\",\"00012.HK\",20.650,+0.850,\"+4.293%\",\"5.07M\",\"103.70M\",10.81,0.31,\"8.72%\",\"99.97B\"],\n    [\"SHK PPT\",\"00016.HK\",83.800,+3.250,\"+4.035%\",\"8.25M\",\"685.41M\",10.16,0.40,\"5.91%\",\"242.83B\"],\n    [\"NEW WORLD DEV\",\"00017.HK\",15.240,+0.800,\"+5.540%\",\"12.95M\",\"196.19M\",30.48,0.18,\"13.52%\",\"38.35B\"],\n    [\"GALAXY ENT\",\"00027.HK\",47.150,+1.900,\"+4.199%\",\"11.97M\",\"560.21M\",\"No Profit\",3.22,\"0.00%\",\"206.21B\"],\n    [\"MTR CORPORATION\",\"00066.HK\",31.000,+0.800,\"+2.649%\",\"4.68M\",\"144.86M\",19.50,1.07,\"4.23%\",\"192.64B\"],\n    [\"HANG LUNG PPT\",\"00101.HK\",10.720,+0.560,\"+5.512%\",\"7.68M\",\"81.99M\",12.61,0.36,\"7.28%\",\"48.23B\"],\n    [\"GEELY AUTO\",\"00175.HK\",9.240,+0.170,\"+1.874%\",\"18.77M\",\"173.30M\",16.06,1.15,\"2.27%\",\"92.99B\"],\n    [\"ALI HEALTH\",\"00241.HK\",4.880,+0.470,\"+10.658%\",\"53.62M\",\"257.82M\",108.09,3.81,\"0.00%\",\"66.04B\"],\n    [\"CITIC\",\"00267.HK\",7.200,+0.200,\"+2.857%\",\"11.54M\",\"82.96M\",2.78,0.28,\"9.04%\",\"209.45B\"],\n    [\"WH GROUP\",\"00288.HK\",4.110,+0.080,\"+1.985%\",\"18.94M\",\"77.65M\",4.93,0.70,\"7.30%\",\"52.73B\"],\n    [\"CHINA RES BEER\",\"00291.HK\",42.950,+1.200,\"+2.874%\",\"4.83M\",\"207.98M\",28.41,4.57,\"1.41%\",\"139.34B\"],\n    [\"OOIL\",\"00316.HK\",104.500,-0.400,\"-0.381%\",\"296.54K\",\"30.98M\",0.89,0.66,\"78.90%\",\"69.01B\"],\n    [\"TINGYI\",\"00322.HK\",10.940,+0.180,\"+1.673%\",\"2.91M\",\"31.81M\",20.75,4.09,\"9.39%\",\"61.64B\"],\n    [\"SINOPEC CORP\",\"00386.HK\",4.280,-0.010,\"-0.233%\",\"92.43M\",\"396.61M\",6.94,0.58,\"9.36%\",\"105.92B\"],\n    [\"HKEX\",\"00388.HK\",292.600,+9.000,\"+3.173%\",\"4.61M\",\"1.34B\",36.76,7.46,\"2.44%\",\"370.97B\"],\n    [\"TECHTRONIC IND\",\"00669.HK\",76.000,+1.350,\"+1.808%\",\"5.47M\",\"414.78M\",16.54,3.43,\"2.43%\",\"139.45B\"],\n    [\"CHINA OVERSEAS\",\"00688.HK\",16.240,+0.520,\"+3.308%\",\"13.15M\",\"212.60M\",6.76,0.44,\"4.93%\",\"177.74B\"],\n    [\"TENCENT\",\"00700.HK\",306.200,+8.800,\"+2.959%\",\"11.25M\",\"3.43B\",13.74,3.60,\"0.78%\",2,\"926.16B\"],\n    [\"CHINA UNICOM\",\"00762.HK\",5.680,-0.050,\"-0.873%\",\"9.23M\",\"52.77M\",9.16,0.45,\"5.44%\",\"173.80B\"],\n    [\"LINK REIT\",\"00823.HK\",38.400,+1.450,\"+3.924%\",\"12.04M\",\"460.96M\",5.42,0.52,\"7.03%\",\"98.38B\"],\n    [\"CHINA RES POWER\",\"00836.HK\",14.940,+0.320,\"+2.189%\",\"9.91M\",\"147.81M\",10.23,0.87,\"3.92%\",\"71.87B\"],\n    [\"PETROCHINA\",\"00857.HK\",5.900,0.000,\"0.000%\",\"64.23M\",\"380.44M\",6.38,0.70,\"8.08%\",\"124.48B\"],\n    [\"XINYI GLASS\",\"00868.HK\",10.140,+0.170,\"+1.705%\",\"3.75M\",\"38.02M\",8.01,1.30,\"6.11%\",\"42.22B\"],\n    [\"ZHONGSHENG HLDG\",\"00881.HK\",22.050,+1.450,\"+7.039%\",\"6.76M\",\"147.71M\",7.08,1.07,\"4.94%\",\"52.72B\"],\n    [\"CNOOC\",\"00883.HK\",13.780,-0.020,\"-0.145%\",\"26.37M\",\"365.08M\",4.03,0.97,\"19.09%\",\"655.47B\"],\n    [\"CCB\",\"00939.HK\",4.420,+0.060,\"+1.376%\",\"233.61M\",\"1.03B\",3.06,0.35,\"9.93%\",1,\"062.64B\"],\n    [\"CHINA MOBILE\",\"00941.HK\",65.700,+0.250,\"+0.382%\",\"7.82M\",\"516.10M\",9.91,0.96,\"6.71%\",1,\"404.46B\"],\n    [\"LONGFOR GROUP\",\"00960.HK\",14.080,+0.900,\"+6.829%\",\"10.88M\",\"150.68M\",3.06,0.55,\"9.05%\",\"92.81B\"],\n    [\"XINYI SOLAR\",\"00968.HK\",5.860,+0.280,\"+5.018%\",\"15.99M\",\"92.88M\",13.64,1.75,\"3.41%\",\"52.17B\"],\n    [\"SMIC\",\"00981.HK\",20.050,+0.250,\"+1.263%\",\"13.10M\",\"264.32M\",11.17,1.06,\"0.00%\",\"159.31B\"],\n    [\"LENOVO GROUP\",\"00992.HK\",8.070,+0.250,\"+3.197%\",\"33.60M\",\"270.50M\",7.61,2.23,\"4.71%\",\"97.87B\"],\n    [\"CKI HOLDINGS\",\"01038.HK\",37.050,-0.200,\"-0.537%\",\"1.44M\",\"53.73M\",12.03,0.78,\"6.83%\",\"93.35B\"],\n    [\"HENGAN INT'L\",\"01044.HK\",24.950,+0.200,\"+0.808%\",\"2.62M\",\"64.97M\",13.35,1.32,\"6.33%\",\"28.99B\"],\n    [\"CHINA SHENHUA\",\"01088.HK\",25.400,+0.350,\"+1.397%\",\"7.98M\",\"203.11M\",6.14,1.13,\"11.33%\",\"85.79B\"],\n    [\"CSPC PHARMA\",\"01093.HK\",5.740,+0.050,\"+0.879%\",\"29.29M\",\"167.41M\",9.96,2.01,\"3.66%\",\"68.32B\"],\n    [\"SINOPHARM\",\"01099.HK\",22.700,+0.200,\"+0.889%\",\"2.07M\",\"46.80M\",7.37,0.92,\"4.08%\",\"30.46B\"],\n    [\"CHINA RES LAND\",\"01109.HK\",31.200,+1.000,\"+3.311%\",\"9.88M\",\"305.88M\",7.02,0.81,\"5.07%\",\"222.49B\"],\n    [\"CK ASSET\",\"01113.HK\",41.250,+1.250,\"+3.125%\",\"8.57M\",\"352.44M\",6.90,0.39,\"5.53%\",\"146.47B\"],\n    [\"SINO BIOPHARM\",\"01177.HK\",2.830,+0.020,\"+0.712%\",\"26.30M\",\"74.09M\",18.37,1.59,\"4.24%\",\"53.21B\"],\n    [\"CHINA RES MIXC\",\"01209.HK\",31.600,+1.600,\"+5.333%\",\"3.07M\",\"96.42M\",28.97,4.48,\"2.87%\",\"72.13B\"],\n    [\"BYD COMPANY\",\"01211.HK\",242.000,+7.000,\"+2.979%\",\"3.90M\",\"938.50M\",37.57,5.63,\"0.53%\",\"265.72B\"],\n    [\"AIA\",\"01299.HK\",63.850,+0.950,\"+1.510%\",\"38.75M\",\"2.48B\",408.88,2.53,\"2.41%\",\"735.40B\"],\n    [\"CHINAHONGQIAO\",\"01378.HK\",7.670,+0.280,\"+3.789%\",\"13.05M\",\"99.58M\",7.27,0.76,\"6.65%\",\"72.68B\"],\n    [\"ICBC\",\"01398.HK\",3.770,+0.070,\"+1.892%\",\"233.48M\",\"881.67M\",3.45,0.36,\"9.08%\",\"327.21B\"],\n    [\"XIAOMI-W\",\"01810.HK\",12.340,+0.620,\"+5.290%\",\"78.53M\",\"960.98M\",109.39,1.90,\"0.00%\",\"308.83B\"],\n    [\"BUD APAC\",\"01876.HK\",15.460,+0.160,\"+1.046%\",\"16.17M\",\"250.45M\",28.65,2.44,\"1.91%\",\"204.74B\"],\n    [\"SANDS CHINA LTD\",\"01928.HK\",24.000,+0.950,\"+4.121%\",\"19.98M\",\"475.93M\",\"No Profit\",\"N/A\",\"0.00%\",\"194.24B\"],\n    [\"CHOW TAI FOOK\",\"01929.HK\",11.800,+0.280,\"+2.431%\",\"4.88M\",\"57.68M\",21.93,3.64,\"10.34%\",\"118.00B\"],\n    [\"WHARF REIC\",\"01997.HK\",30.250,+1.400,\"+4.853%\",\"4.23M\",\"127.31M\",\"No Profit\",0.48,\"4.33%\",\"91.85B\"],\n    [\"ANTA SPORTS\",\"02020.HK\",88.150,+4.400,\"+5.254%\",\"4.82M\",\"422.51M\",27.71,6.16,\"1.52%\",\"249.70B\"],\n    [\"WUXI BIO\",\"02269.HK\",45.650,+1.550,\"+3.515%\",\"17.91M\",\"811.49M\",38.18,4.88,\"0.00%\",\"194.01B\"],\n    [\"SHENZHOU INTL\",\"02313.HK\",75.000,+4.600,\"+6.534%\",\"5.52M\",\"410.68M\",21.87,3.25,\"2.55%\",\"112.74B\"],\n    [\"PING AN\",\"02318.HK\",44.850,+0.850,\"+1.932%\",\"23.05M\",\"1.03B\",8.28,0.85,\"6.09%\",\"334.02B\"],\n    [\"MENGNIU DAIRY\",\"02319.HK\",26.250,+1.500,\"+6.061%\",\"8.58M\",\"223.15M\",17.34,2.30,\"1.73%\",\"103.42B\"],\n    [\"LI NING\",\"02331.HK\",32.950,+1.500,\"+4.769%\",\"22.54M\",\"738.37M\",18.80,3.16,\"1.58%\",\"86.86B\"],\n    [\"SUNNY OPTICAL\",\"02382.HK\",54.700,+1.050,\"+1.957%\",\"5.62M\",\"308.60M\",22.01,2.44,\"0.91%\",\"60.00B\"],\n    [\"BOC HONG KONG\",\"02388.HK\",21.450,+0.300,\"+1.418%\",\"6.53M\",\"140.32M\",8.38,0.75,\"6.33%\",\"226.79B\"],\n    [\"CHINA LIFE\",\"02628.HK\",12.200,+0.240,\"+2.007%\",\"13.53M\",\"165.07M\",9.49,0.70,\"4.53%\",\"90.78B\"],\n    [\"ENN ENERGY\",\"02688.HK\",65.000,+1.150,\"+1.801%\",\"3.06M\",\"198.69M\",11.08,1.67,\"4.48%\",\"73.53B\"],\n    [\"ZIJIN MINING\",\"02899.HK\",11.980,+0.160,\"+1.354%\",\"16.20M\",\"194.50M\",13.97,3.14,\"1.88%\",\"68.73B\"],\n    [\"MEITUAN-W\",\"03690.HK\",114.600,+3.800,\"+3.430%\",\"19.17M\",\"2.19B\",\"No Profit\",4.89,\"0.00%\",\"715.43B\"],\n    [\"HANSOH PHARMA\",\"03692.HK\",10.660,+0.160,\"+1.524%\",\"17.56M\",\"187.72M\",21.48,2.47,\"0.94%\",\"63.25B\"],\n    [\"CM BANK\",\"03968.HK\",32.700,+0.100,\"+0.307%\",\"11.13M\",\"363.99M\",5.51,0.86,\"6.00%\",\"150.12B\"],\n    [\"BANK OF CHINA\",\"03988.HK\",2.740,+0.050,\"+1.859%\",\"275.47M\",\"754.54M\",3.33,0.33,\"9.55%\",\"229.13B\"],\n    [\"CG SERVICES\",\"06098.HK\",8.080,+0.250,\"+3.193%\",\"16.08M\",\"128.87M\",12.42,0.65,\"5.20%\",\"27.01B\"],\n    [\"JD HEALTH\",\"06618.HK\",40.600,+2.950,\"+7.835%\",\"7.75M\",\"312.36M\",299.91,2.56,\"0.00%\",\"129.12B\"],\n    [\"HAIER SMARTHOME\",\"06690.HK\",24.650,+1.150,\"+4.894%\",\"7.24M\",\"178.37M\",13.83,2.21,\"2.59%\",\"70.46B\"],\n    [\"HAIDILAO\",\"06862.HK\",21.000,+0.600,\"+2.941%\",\"6.86M\",\"143.79M\",74.46,13.94,\"0.55%\",\"117.05B\"],\n    [\"JD-SW\",\"09618.HK\",115.100,+4.000,\"+3.600%\",\"7.43M\",\"852.28M\",30.73,1.50,\"6.38%\",\"360.24B\"],\n    [\"NONGFU SPRING\",\"09633.HK\",45.000,+1.500,\"+3.448%\",\"3.69M\",\"165.62M\",52.49,18.63,\"1.71%\",\"226.56B\"],\n    [\"BIDU-SW\",\"09888.HK\",133.400,+4.600,\"+3.571%\",\"5.82M\",\"772.73M\",47.30,1.50,\"0.00%\",\"377.37B\"],\n    [\"TRIP.COM-S\",\"09961.HK\",279.200,+7.000,\"+2.572%\",\"1.25M\",\"349.59M\",114.05,1.40,\"0.00%\",\"176.65B\"],\n    [\"BABA-SW\",\"09988.HK\",85.600,+2.600,\"+3.133%\",\"34.61M\",\"2.96B\",21.65,1.62,\"0.00%\",1,\"837.13B\"],\n    [\"NTES-S\",\"09999.HK\",159.500,+8.300,\"+5.489%\",\"5.02M\",\"797.10M\",22.70,4.63,\"1.36%\",\"546.99B\"],\n]\n", "import ftse from \"./ftse100\";\nimport nasdaq from \"./nasdaq100\";\nimport sp500 from \"./sp500\";\nimport hsi from \"./hsi\";\nimport { VuuRowDataItemType } from \"@vuu-ui/vuu-protocol-types\";\n\nconst basketConstituentData = [];\nfor (const row of ftse) {\n  // prettier-ignore\n  const [ric, name, lastTrade, change, volume] = row;\n  const basketId = \".FTSE100\";\n  const side = \"BUY\";\n  const weighting = 1;\n  // prettier-ignore\n  basketConstituentData.push([ basketId, change, name, lastTrade, ric, `${ric}-${basketId}`, side, volume, weighting ]);\n}\n\nfor (const row of hsi) {\n  // prettier-ignore\n  const [name, ric, lastTrade, change, , volume] = row;\n  const basketId = \".HSI\";\n  const side = \"BUY\";\n  const weighting = 1;\n  // prettier-ignore\n  basketConstituentData.push([basketId,change,name, lastTrade,ric,`${ric}-${basketId}`,side,volume,weighting ]);\n}\n\nfor (const row of nasdaq) {\n  // prettier-ignore\n  const [name, ric, weighting, lastTrade, change] = row;\n  const basketId = \".NASDAQ100\";\n  const side = \"BUY\";\n  const volume = 1000;\n  // prettier-ignore\n  basketConstituentData.push([ basketId, change, name, lastTrade, ric, `${ric}-${basketId}`, side, volume, weighting ]);\n}\n\nfor (const row of sp500) {\n  // prettier-ignore\n  const [name, ric, weighting,,change] = row;\n  const basketId = \".SP500\";\n  const side = \"BUY\";\n  const volume = 1000;\n  const lastTrade = 0;\n  // prettier-ignore\n  basketConstituentData.push([ basketId, change, name, lastTrade, ric, `${ric}-${basketId}`, side, volume, weighting ]);\n}\n\nexport default basketConstituentData as VuuRowDataItemType[][];\n", "import { buildDataColumnMap, Table } from \"../../Table\";\nimport { BaseUpdateGenerator } from \"../../UpdateGenerator\";\nimport { schemas } from \"../../simul/simul-schemas\";\nimport basketConstituentData from \"./constituents\";\nimport { initBidAsk, nextRandomDouble, random } from \"../../data-utils\";\n\nexport type ask = number;\nexport type askSize = number;\nexport type bid = number;\nexport type bidSize = number;\nexport type close = number;\nexport type last = number;\nexport type open = number;\nexport type phase = \"C\";\nexport type ric = string;\nexport type scenario = \"close\";\n\nexport type PricesDataRow = [\n  ask,\n  askSize,\n  bid,\n  bidSize,\n  close,\n  last,\n  open,\n  phase,\n  ric,\n  scenario\n];\n\nconst { bid, bidSize, ask, askSize, last } = buildDataColumnMap(schemas.prices);\nconst pricesUpdateGenerator = new BaseUpdateGenerator({\n  bid,\n  bidSize,\n  ask,\n  askSize,\n  last,\n});\n\nconst prices: PricesDataRow[] = [];\n\n// prettier-ignore\nfor (const [,,,lastTrade,ric] of basketConstituentData) {\n  const priceSeed = parseFloat(String(lastTrade));\n  if (!isNaN(priceSeed)){\n  const [bid, ask] = initBidAsk(5,nextRandomDouble)\n  const askSize = random(1000, 3000);\n  const bidSize = random(1000, 3000);\n  const close = priceSeed + random(0, 1) / 10;\n  const last = priceSeed + random(0, 1) / 10;\n  const open = priceSeed + random(0, 1) / 10;\n  const phase = \"C\";\n  const scenario = \"close\";\n  prices.push([\n    ask,\n    askSize,\n    bid,\n    bidSize,\n    close,\n    last,\n    open,\n    phase,\n    ric as string,\n    scenario,\n  ]);\n\n  }\n}\n\nconst pricesTable = new Table(\n  schemas.prices,\n  prices,\n  buildDataColumnMap(schemas.prices),\n  pricesUpdateGenerator\n);\n\nexport default pricesTable;\n", "import {\n  ClientToServerViewportRpcCall,\n  VuuMenu,\n  VuuRowDataItemType,\n} from \"@vuu-ui/vuu-protocol-types\";\nimport { ColumnMap } from \"@vuu-ui/vuu-utils\";\nimport pricesTable from \"./reference-data/prices\";\nimport { joinTables, Table } from \"../Table\";\nimport { TickingArrayDataSource } from \"../TickingArrayDataSource\";\nimport { VuuModule } from \"../vuu-modules\";\nimport { BasketsTableName, schemas } from \"./basket-schemas\";\nimport basketConstituentData from \"./reference-data/constituents\";\n\n// This is a 'local' columnMap\nconst buildDataColumnMap = (tableName: BasketsTableName) =>\n  Object.values(schemas[tableName].columns).reduce<ColumnMap>(\n    (map, col, index) => {\n      map[col.name] = index;\n      return map;\n    },\n    {}\n  );\n\nconst tableMaps: Record<BasketsTableName, ColumnMap> = {\n  algoType: buildDataColumnMap(\"algoType\"),\n  basket: buildDataColumnMap(\"basket\"),\n  basketTrading: buildDataColumnMap(\"basketTrading\"),\n  basketTradingConstituent: buildDataColumnMap(\"basketTradingConstituent\"),\n  basketConstituent: buildDataColumnMap(\"basketConstituent\"),\n  basketTradingConstituentJoin: buildDataColumnMap(\n    \"basketTradingConstituentJoin\"\n  ),\n  priceStrategyType: buildDataColumnMap(\"priceStrategyType\"),\n};\n\n/**\n * BasketConstituent\n */\n\nconst basketConstituent = new Table(\n  schemas.basketConstituent,\n  basketConstituentData,\n  tableMaps.basketConstituent\n);\n\n/**\n * BasketTrading\n */\nconst basketTrading = new Table(\n  schemas.basketTrading,\n  [],\n  tableMaps.basketTrading\n);\n\nlet basketIncrement = 1;\n/**\n * BasketTradingConstituent\n */\nconst basketTradingConstituent = new Table(\n  schemas.basketTradingConstituent,\n  [],\n  tableMaps.basketTradingConstituent\n);\n\n// export as convenience for showcase examples\nexport const createBasketTradingRow = (\n  basketId: string,\n  basketName: string,\n  side = \"BUY\",\n  status = \"OFF MARKET\"\n) => [\n  basketId,\n  basketName,\n  0,\n  1.25,\n  `steve-${basketIncrement++}`,\n  side,\n  status,\n  1_000_000,\n  1_250_000,\n  100,\n];\n\nfunction createTradingBasket(basketId: string, basketName: string) {\n  const basketTradingRow = createBasketTradingRow(basketId, basketName);\n\n  basketTrading.insert(basketTradingRow);\n\n  const { basketId: key } = buildDataColumnMap(\"basketConstituent\");\n  const constituents = basketConstituent.data.filter(\n    (c) => c[key] === basketId\n  );\n\n  constituents.forEach(([, , description, , ric, , , quantity, weighting]) => {\n    const algo = \"\";\n    const algoParams = \"\";\n    const limitPrice = 95;\n    const notionalLocal = 0;\n    const notionalUsd = 0;\n    const pctFilled = 0;\n    const priceSpread = 0;\n    const priceStrategyId = \"\";\n    const side = \"BUY\";\n    const venue = \"venue\";\n\n    const { instanceId } = tableMaps.basketTrading;\n    const basketInstanceId = basketTradingRow[instanceId];\n    const basketTradingConstituentRow: VuuRowDataItemType[] = [\n      algo,\n      algoParams,\n      basketId,\n      description,\n      basketInstanceId,\n      `${basketInstanceId}-${ric}`,\n      limitPrice,\n      notionalLocal,\n      notionalUsd,\n      pctFilled,\n      priceSpread,\n      priceStrategyId,\n      quantity,\n      ric,\n      side,\n      venue,\n      weighting,\n    ];\n    basketTradingConstituent.insert(basketTradingConstituentRow);\n  });\n}\n\nasync function addConstituent(rpcRequest: ClientToServerViewportRpcCall) {\n  console.log(`RPC call erceived ${rpcRequest.rpcName}`);\n}\nasync function sendToMarket(rpcRequest: ClientToServerViewportRpcCall) {\n  const [basketInstanceId] = rpcRequest.params;\n  basketTrading.update(basketInstanceId, \"status\", \"ON_MARKET\");\n}\nasync function takeOffMarket(rpcRequest: ClientToServerViewportRpcCall) {\n  const [basketInstanceId] = rpcRequest.params;\n  basketTrading.update(basketInstanceId, \"status\", \"OFF-MARKET\");\n}\n\nasync function createNewBasket(rpcRequest: ClientToServerViewportRpcCall) {\n  const {\n    params: [basketId, basketName],\n  } = rpcRequest;\n  createTradingBasket(basketId, basketName);\n}\n\n//-------------------\n\nexport const tables: Record<BasketsTableName, Table> = {\n  algoType: new Table(\n    schemas.algoType,\n    [\n      [\"Sniper\", 0],\n      [\"Dark Liquidity\", 1],\n      [\"VWAP\", 2],\n      [\"POV\", 3],\n      [\"Dynamic Close\", 4],\n    ],\n    tableMaps.algoType\n  ),\n  basket: new Table(\n    schemas.basket,\n    [\n      [\".NASDAQ100\", \".NASDAQ100\", 0, 0],\n      [\".HSI\", \".HSI\", 0, 0],\n      [\".FTSE100\", \".FTSE100\", 0, 0],\n      [\".SP500\", \".SP500\", 0, 0],\n    ],\n    tableMaps.basket\n  ),\n  basketConstituent,\n  basketTrading,\n  basketTradingConstituent,\n  basketTradingConstituentJoin: joinTables(\n    { module: \"BASKET\", table: \"basketTradingConstituentJoin\" },\n    basketTradingConstituent,\n    pricesTable,\n    \"ric\"\n  ),\n  priceStrategyType: new Table(\n    schemas.priceStrategyType,\n    [\n      [\"Peg to Near Touch\", 0],\n      [\"Far Touch\", 1],\n      [\"Limit\", 2],\n      [\"Algo\", 3],\n    ],\n    tableMaps.priceStrategyType\n  ),\n};\n\nconst menus: Record<BasketsTableName, VuuMenu | undefined> = {\n  algoType: undefined,\n  basket: {\n    name: \"ROOT\",\n    menus: [\n      {\n        context: \"selected-rows\",\n        filter: \"\",\n        name: \"Add Basket\",\n        rpcName: \"CREATE_NEW_BASKET\",\n      },\n    ],\n  },\n  basketConstituent: undefined,\n  basketTrading: undefined,\n  basketTradingConstituent: undefined,\n  basketTradingConstituentJoin: undefined,\n  priceStrategyType: undefined,\n};\n\ntype RpcService = {\n  rpcName: string;\n  service: (rpcRequest: any) => Promise<unknown>;\n};\n\nconst services: Record<BasketsTableName, RpcService[] | undefined> = {\n  algoType: undefined,\n  basket: [\n    {\n      rpcName: \"createBasket\",\n      service: createNewBasket,\n    },\n  ],\n  basketConstituent: undefined,\n  basketTrading: [\n    {\n      rpcName: \"sendToMarket\",\n      service: sendToMarket,\n    },\n    {\n      rpcName: \"takeOffMarket\",\n      service: takeOffMarket,\n    },\n  ],\n  basketTradingConstituent: undefined,\n  basketTradingConstituentJoin: [\n    {\n      rpcName: \"addConstituent\",\n      service: addConstituent,\n    },\n  ],\n  priceStrategyType: undefined,\n};\n\nconst getColumnDescriptors = (tableName: BasketsTableName) => {\n  const schema = schemas[tableName];\n  return schema.columns;\n};\n\nconst createDataSource = (tableName: BasketsTableName) => {\n  const columnDescriptors = getColumnDescriptors(tableName);\n  const { key } = schemas[tableName];\n  return new TickingArrayDataSource({\n    columnDescriptors,\n    dataMap: tableMaps[tableName],\n    keyColumn: key,\n    menu: menus[tableName],\n    rpcServices: services[tableName],\n    table: tables[tableName],\n    // updateGenerator: createUpdateGenerator?.(),\n  });\n};\n\nconst nullTypeaheadHook = async () => [];\n\nconst basketModule: VuuModule<BasketsTableName> = {\n  createDataSource,\n  typeaheadHook: () => nullTypeaheadHook,\n};\n\nexport default basketModule;\n", "import { isinGenerator } from \"@thomaschaplin/isin-generator\";\nimport { currencies } from \"./currencies\";\nimport { locations, suffixes } from \"./locations\";\nimport { lotsizes } from \"./lotsizes\";\nimport { random } from \"../../data-utils\";\nimport { buildDataColumnMap, Table } from \"../../Table\";\nimport { schemas } from \"../simul-schemas\";\n\nexport type bbg = string;\nexport type currency = string;\nexport type ric = string;\nexport type description = string;\nexport type exchange = string;\n// seed for price generation\nexport type price = number;\n\nexport type InstrumentsDataRow = [\n  bbg,\n  currency,\n  description,\n  exchange,\n  string,\n  number,\n  ric,\n  price\n];\n\nexport const InstrumentColumnMap = {\n  bbg: 0,\n  currency: 1,\n  description: 2,\n  exchange: 3,\n  string: 4,\n  number: 5,\n  ric: 6,\n  price: 7,\n} as const;\n\nconst instrumentsData: InstrumentsDataRow[] = [];\n\nconst chars = Array.from(\"ABCEFGHKMNOPQRTUVWYZ\");\n\nconst randomPrice = () => {\n  const price = random(0, 10000);\n  const multiplier = random(1, 10);\n  return price / multiplier;\n};\n\n// const start = performance.now();\n// Create 10_000 Instruments\nfor (const char of chars) {\n  for (let i = 0; i < 10_00; i++) {\n    const char2 = chars[random(0, chars.length - 1)];\n    const char3 = chars[random(0, chars.length - 1)];\n    const char4 = chars[random(0, chars.length - 1)];\n\n    const suffix = suffixes[random(0, suffixes.length - 1)];\n    const ric = char + char2 + char3 + char4 + \".\" + suffix;\n    const bbg = char + char2 + char3 + char4 + \" \" + suffix;\n    const description = `${ric} description`;\n    const currency = currencies[random(0, 4)];\n    const isin = isinGenerator();\n    const lotSize = lotsizes[random(0, lotsizes.length - 1)];\n\n    const exchange = locations[suffix][1];\n    const price = randomPrice();\n\n    instrumentsData.push([\n      bbg,\n      currency,\n      description,\n      exchange,\n      String(isin),\n      lotSize,\n      ric,\n      price,\n    ]);\n  }\n}\n// const end = performance.now();\n// console.log(`generating 10,000 instruments took ${end - start} ms`);\n\nconst instrumentsTable = new Table(\n  schemas.instruments,\n  instrumentsData,\n  buildDataColumnMap(schemas.instruments)\n);\n\nexport { instrumentsData };\nexport default instrumentsTable;\n", "export const currencies = [\"CAD\", \"GBX\", \"USD\", \"EUR\", \"GBP\"];\n", "export const locations: { [key: string]: string[] } = {\n  L: [\"London PLC\", \"XLON/LSE-SETS\"],\n  N: [\"Corporation\", \"XNGS/NAS-GSM\"],\n  AS: [\"B.V.\", \"XAMS/ENA-MAIN\"],\n  OQ: [\"Co.\", \"XNYS/NYS-MAIN\"],\n  PA: [\"Paris\", \"PAR/EUR_FR\"],\n  MI: [\"Milan\", \"MIL/EUR_IT\"],\n  FR: [\"Frankfurt\", \"FR/EUR_DE\"],\n  AT: [\"Athens\", \"AT/EUR_GR\"],\n};\nexport const suffixes = [\"L\", \"N\", \"OQ\", \"AS\", \"PA\", \"MI\", \"FR\", \"AT\"];\n", "export const lotsizes = [\n  1, 2, 5, 10, 50, 50, 70, 100, 100, 100, 120, 150, 150, 200, 500, 700, 1000,\n  2000, 2500, 5000, 10000,\n];\n", "import { VuuRowDataItemType } from \"@vuu-ui/vuu-protocol-types\";\nimport { random } from \"../../data-utils\";\nimport { buildDataColumnMap, Table } from \"../../Table\";\nimport { schemas } from \"../simul-schemas\";\nimport { instrumentsData } from \"./instruments\";\n\nconst instrumentsExtendedData = instrumentsData.map((row) =>\n  (row as VuuRowDataItemType[])\n    .slice(0, -1)\n    .concat([random(0, 1) === 1, random(0, 1) === 1, new Date().getTime()])\n);\n\nconst instrumentsExtendedTable = new Table(\n  schemas.instrumentsExtended,\n  instrumentsExtendedData,\n  buildDataColumnMap(schemas.instrumentsExtended)\n);\n\nexport default instrumentsExtendedTable;\n", "import { buildDataColumnMap, Table } from \"../../Table\";\nimport { BaseUpdateGenerator } from \"../../UpdateGenerator\";\nimport { schemas } from \"../simul-schemas\";\nimport { instrumentsData, InstrumentColumnMap } from \"./instruments\";\nimport { random } from \"../../data-utils\";\nimport basketConstituentData from \"../../basket/reference-data/constituents\";\n\nexport type ask = number;\nexport type askSize = number;\nexport type bid = number;\nexport type bidSize = number;\nexport type close = number;\nexport type last = number;\nexport type open = number;\nexport type phase = \"C\";\nexport type ric = string;\nexport type scenario = \"close\";\n\nexport type PricesDataRow = [\n  ask,\n  askSize,\n  bid,\n  bidSize,\n  close,\n  last,\n  open,\n  phase,\n  ric,\n  scenario\n];\n\nconst { bid, bidSize, ask, askSize } = buildDataColumnMap(schemas.prices);\nconst pricesUpdateGenerator = new BaseUpdateGenerator({\n  bid,\n  bidSize,\n  ask,\n  askSize,\n});\n\n// const start = performance.now();\n// Create 100_000 Instruments\nconst requiredInstrumentFields = [\"ric\", \"price\"] as const;\nconst pricesData: Array<PricesDataRow> = instrumentsData.map((instrument) => {\n  const { ric, price: priceSeed } = requiredInstrumentFields.reduce(\n    (obj, f) => ({ ...obj, [f]: instrument[InstrumentColumnMap[f]] }),\n    {} as { ric: string; price: number }\n  );\n  const spread = random(0, 10);\n\n  const ask = priceSeed + spread / 2;\n  const askSize = random(1000, 3000);\n  const bid = priceSeed - spread / 2;\n  const bidSize = random(1000, 3000);\n  const close = priceSeed + random(0, 1) / 10;\n  const last = priceSeed + random(0, 1) / 10;\n  const open = priceSeed + random(0, 1) / 10;\n  const phase = \"C\";\n  const scenario = \"close\";\n  return [ask, askSize, bid, bidSize, close, last, open, phase, ric, scenario];\n});\n\n// prettier-ignore\nfor (const [,,,lastTrade,ric] of basketConstituentData) {\n  const priceSeed = parseFloat(String(lastTrade));\n  if (!isNaN(priceSeed)) {\n    const spread = random(0, 10);\n    const ask = priceSeed + spread / 2;\n    const askSize = random(1000, 3000);\n    const bid = priceSeed - spread / 2;\n    const bidSize = random(1000, 3000);\n    const close = priceSeed + random(0, 1) / 10;\n    const last = priceSeed + random(0, 1) / 10;\n    const open = priceSeed + random(0, 1) / 10;\n    const phase = \"C\";\n    const scenario = \"close\";\n    pricesData.push([\n      ask,\n      askSize,\n      bid,\n      bidSize,\n      close,\n      last,\n      open,\n      phase,\n      ric as string,\n      scenario,\n    ]);\n  }\n}\n\n// const end = performance.now();\n// console.log(`generating 100,000 prices took ${end - start} ms`);\n\nconst pricesTable = new Table(\n  schemas.prices,\n  pricesData,\n  buildDataColumnMap(schemas.prices),\n  pricesUpdateGenerator\n);\n\nexport { pricesData };\nexport default pricesTable;\n", "import { TickingArrayDataSource } from \"../TickingArrayDataSource\";\nimport { VuuModule } from \"../vuu-modules\";\nimport instrumentsTable from \"./reference-data/instruments\";\nimport instrumentsExtendedTable from \"./reference-data/instruments-extended\";\nimport pricesTable from \"./reference-data/prices\";\nimport { schemas, SimulTableName } from \"./simul-schemas\";\nimport { buildDataColumnMap, joinTables, Table } from \"../Table\";\nimport { TypeaheadParams } from \"@vuu-ui/vuu-protocol-types\";\nimport { SuggestionFetcher } from \"@vuu-ui/vuu-data-react\";\nimport { makeSuggestions } from \"../makeSuggestions\";\n\nconst tables: Record<SimulTableName, Table> = {\n  childOrders: new Table(\n    schemas.childOrders,\n    [],\n    buildDataColumnMap(schemas.childOrders)\n  ),\n  instruments: instrumentsTable,\n  instrumentsExtended: instrumentsExtendedTable,\n  instrumentPrices: joinTables(\n    { module: \"SIMUL\", table: \"instrumentPrices\" },\n    instrumentsTable,\n    pricesTable,\n    \"ric\"\n  ),\n  orders: new Table(schemas.orders, [], buildDataColumnMap(schemas.orders)),\n  parentOrders: new Table(\n    schemas.parentOrders,\n    [],\n    buildDataColumnMap(schemas.parentOrders)\n  ),\n  prices: pricesTable,\n};\n\nconst getColumnDescriptors = (tableName: SimulTableName) => {\n  const schema = schemas[tableName];\n  if (schema) {\n    return schema.columns;\n  } else {\n    throw Error(`simul-module no schema found for table SIMUL ${tableName}`);\n  }\n};\n\nconst createDataSource = (tableName: SimulTableName) => {\n  const columnDescriptors = getColumnDescriptors(tableName);\n  return new TickingArrayDataSource({\n    columnDescriptors,\n    keyColumn: schemas[tableName].key,\n    table: tables[tableName],\n    // menu: menus[tableName],\n    // rpcServices: services[tableName],\n  });\n};\n\nconst suggestionFetcher: SuggestionFetcher = ([\n  vuuTable,\n  column,\n  pattern,\n]: TypeaheadParams) => {\n  const table = tables[vuuTable.table as SimulTableName];\n  if (table) {\n    return makeSuggestions(table, column, pattern);\n  } else {\n    throw Error(\n      `SIMUL suggestionFetcher, unknown table ${vuuTable.module} ${vuuTable.table}`\n    );\n  }\n};\n\nconst simulModule: VuuModule<SimulTableName> = {\n  createDataSource,\n  typeaheadHook: () => suggestionFetcher,\n};\n\nexport default simulModule;\n", "import { DataSource } from \"@vuu-ui/vuu-data-types\";\nimport { SuggestionFetcher } from \"@vuu-ui/vuu-data-react\";\nimport basketModule from \"./basket/basket-module\";\nimport { BasketsTableName } from \"./basket/basket-schemas\";\nimport simulModule from \"./simul/simul-module\";\nimport { SimulTableName } from \"./simul/simul-schemas\";\n\nexport type VuuModuleName = \"BASKET\" | \"SIMUL\";\n\nexport interface VuuModule<T extends string = string> {\n  createDataSource: (tableName: T) => DataSource;\n  typeaheadHook: () => SuggestionFetcher;\n}\n\nconst vuuModules: Record<\n  VuuModuleName,\n  VuuModule<BasketsTableName> | VuuModule<SimulTableName>\n> = {\n  BASKET: basketModule,\n  SIMUL: simulModule,\n};\n\nexport const vuuModule = <T extends string = string>(\n  moduleName: VuuModuleName\n) => vuuModules[moduleName] as VuuModule<T>;\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA,iFAAAA,SAAA;AAAA,IAAAA,QAAA;AAAA,MACI;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACJ;AAAA;AAAA;;;;;;;;AC1PO,QAAM,+BAA+B,SAAC,OAAa;AACxD,aAAA,SAAS,OAAO,EAAE;IAAlB;AADW,YAAA,+BAA4B;;;;;;;;;;ACAlC,QAAM,QAAQ,SAAC,OAAa;AAAc,aAAA,QAAQ,MAAM;IAAd;AAApC,YAAA,QAAK;;;;;;;;;;ACAlB,QAAA,sCAAA;AACA,QAAA,WAAA;AAEO,QAAM,yBAAyB,SAAC,OAAa;AAClD,UAAM,cAAc,MAAM;AAC1B,UAAI;AACJ,UAAI,QAAQ;AACZ,UAAI;AAEJ,eAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,uBAAe,MAAM,CAAC;AAEtB,YAAM,0BAAyB,GAAA,oCAAA,8BAA6B,YAAY;AAExE,YAAI,0BAA0B,MAAM,sBAAsB,IACtD,aAAa,WAAW,CAAC,IAAI,IAAI,WAAW,CAAC,IAAI,KACjD;AAEJ,aAAI,GAAA,SAAA,OAAM,CAAC,GAAG;AACZ,oCAA0B,0BAA0B;;AAGtD,gBAAQ,QAAQ,KAAK,MAAM,0BAA0B,EAAE,IACpD,0BAA0B;;AAE/B,eAAS,KAAM,QAAQ,MAAO;AAC9B,aAAO;IACT;AAxBa,YAAA,yBAAsB;;;;;;;;;;ACHtB,YAAA,WAAW;MACtB;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;;;;;;;;;;;ACxBW,YAAA,iBAAiB;MAC5B;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACVF,QAAA,aAAA;AACA,QAAA,qBAAA;AAEa,YAAA,eAAY,cAAA,cAAA,CAAA,GAAA,OAAO,WAAA,QAAQ,GAAA,KAAA,GAAA,OAAK,mBAAA,cAAc,GAAA,KAAA;;;;;;;;;;ACH3D,QAAA,wBAAA;AAEO,QAAM,6BAA6B,WAAA;AACxC,aAAA,sBAAA,aAAa,KAAK,MAAM,KAAK,OAAM,IAAK,sBAAA,aAAa,MAAM,CAAC;IAA5D;AADW,YAAA,6BAA0B;;;;;;;;;;ACFvC,QAAA,iCAAA;AAEO,QAAM,0CAA0C,WAAA;AACrD,UAAI,SAAS;AACb,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,iBAAS,UAAS,GAAA,+BAAA,4BAA0B;;AAE9C,aAAO;IACT;AANa,YAAA,0CAAuC;;;;;;;;;;ACF7C,QAAM,8BAA8B,WAAA;AACzC,aAAA,KAAK,MAAM,KAAK,OAAM,IAAK,EAAE;IAA7B;AADW,YAAA,8BAA2B;;;;;;;;;;ACAxC,QAAA,oCAAA;AAEO,QAAM,qCAAqC,WAAA;AAChD,UAAI,SAAS;AACb,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,iBAAS,UAAS,GAAA,kCAAA,6BAA2B;;AAE/C,aAAO;IACT;AANa,YAAA,qCAAkC;;;;;;;;;;ACF/C,QAAA,iDAAA;AACA,QAAA,6CAAA;AAEO,QAAM,gCAAgC,WAAA;AAC3C,UAAM,uBAAsB,GAAA,2CAAA,oCAAkC;AAC9D,UAAM,4BAA2B,GAAA,+CAAA,yCAAuC;AACxE,aAAO,sBAAsB;IAC/B;AAJa,YAAA,gCAA6B;;;;;;;;;;ACH1C,QAAA,8BAAA;AACA,QAAA,sCAAA;AAEO,QAAM,gBAAgB,WAAA;AAC3B,UAAM,SAAQ,GAAA,oCAAA,+BAA6B;AAC3C,UAAM,SAAQ,GAAA,4BAAA,wBAAuB,KAAK;AAE1C,aAAO,QAAQ;IACjB;AALa,YAAA,gBAAa;;;;;;;;;;ACH1B,QAAA,mBAAA;AAAS,WAAA,eAAA,SAAA,iBAAA,EAAA,YAAA,MAAA,KAAA,WAAA;AAAA,aAAA,iBAAA;IAAa,EAAA,CAAA;;;;;ACAtB;AAAA;AAAA;AAEA,QAAM,eAAe;AACrB,QAAM,QAAQ,gBAA0C,cAAc;AAGtE,QAAM,eAAe,CAAAC,WAAS;AAC1B,UAAI,OAAO,aAAa,KAAK,MAAM,KAAK,OAAO,IAAI,aAAa,MAAM,CAAC;AACvE,UAAI,OAAO,OAAOA,SAAQ,uBAAuB,OAAOA,SAAQ,GAAG;AACnE,aAAO;AAAA,IACX;AAEA,QAAM,yBAAyB,UAAQ;AACnC,UAAI,KAAK,UAAU;AAAI,eAAO;AAC9B,UAAI,IAAI,CAAC;AACT,eAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACvC,YAAI,IAAI,KAAK,OAAO,CAAC;AACrB,YAAI,MAAM,CAAC,GAAG;AACV,cAAI,aAAa,KAAK,WAAW,CAAC,IAAI;AACtC,YAAE,KAAK,aAAa,EAAE;AACtB,cAAI,aAAa,GAAG;AAChB,cAAE,KAAK,KAAK,MAAM,aAAa,EAAE,CAAC;AAAA,UACtC;AAAA,QACJ,OAAO;AACH,YAAE,KAAK,OAAO,CAAC,CAAC;AAAA,QACpB;AAAA,MACJ;AACA,UAAI,MAAM;AACV,UAAI,IAAI,EAAE;AACV,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,YAAI,IAAI,KAAK,GAAG;AACZ,cAAI,IAAI,EAAE,CAAC,IAAI;AACf,iBAAO,KAAK,MAAM,IAAI,EAAE;AACxB,iBAAO,IAAI;AAAA,QACf,OAAO;AACH,iBAAO,EAAE,CAAC;AAAA,QACd;AAAA,MACJ;AACA,cAAQ,KAAM,MAAM,MAAO;AAAA,IAC/B;AAGA,YAAQ,gBAAgB,SAASC,iBAAgB;AAC7C,aAAO,aAAa,KAAK;AAAA,IAC7B;AAAA;AAAA;;;AC5CA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAAAC;AAAA,EAAA;AAAA;AAAA;;;ACWO,IAAM,UAET;AAAA,EACF,UAAU;AAAA,IACR,SAAS;AAAA,MACP,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,MAAM,gBAAgB,MAAM;AAAA,IACtC;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,WAAW;AAAA,EAC/C;AAAA,EACA,QAAQ;AAAA,IACN,SAAS;AAAA,MACP,EAAE,MAAM,MAAM,gBAAgB,SAAS;AAAA,MACvC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,oBAAoB,gBAAgB,SAAS;AAAA,IACvD;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,SAAS;AAAA,EAC7C;AAAA,EACA,mBAAmB;AAAA,IACjB,SAAS;AAAA,MACP,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,MAC9C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,IAChD;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,oBAAoB;AAAA,EACxD;AAAA,EACA,eAAe;AAAA,IACb,SAAS;AAAA,MACP,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,MAC9C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,oBAAoB,gBAAgB,SAAS;AAAA,MACrD,EAAE,MAAM,SAAS,gBAAgB,MAAM;AAAA,IACzC;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,gBAAgB;AAAA,EACpD;AAAA,EACA,0BAA0B;AAAA,IACxB,SAAS;AAAA,MACP,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,MAC9C,EAAE,MAAM,eAAe,gBAAgB,MAAM;AAAA,MAC7C,EAAE,MAAM,mBAAmB,gBAAgB,MAAM;AAAA,MACjD,EAAE,MAAM,YAAY,gBAAgB,OAAO;AAAA,MAC3C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,IAChD;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,2BAA2B;AAAA,EAC/D;AAAA,EAEA,8BAA8B;AAAA,IAC5B,SAAS;AAAA,MACP,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,cAAc,gBAAgB,SAAS;AAAA,MAC/C,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,MAC9C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,eAAe,gBAAgB,MAAM;AAAA,MAC7C,EAAE,MAAM,mBAAmB,gBAAgB,MAAM;AAAA,MACjD,EAAE,MAAM,YAAY,gBAAgB,OAAO;AAAA,MAC3C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,IAChD;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,+BAA+B;AAAA,EACnE;AAAA,EACA,mBAAmB;AAAA,IACjB,SAAS;AAAA,MACP,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,MAAM,gBAAgB,MAAM;AAAA,IACtC;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,UAAU,OAAO,oBAAoB;AAAA,EACxD;AACF;;;ACnHO,IAAMC,WACX;AAAA,EACE,aAAa;AAAA,IACX,SAAS;AAAA,MACP,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,WAAW,gBAAgB,MAAM;AAAA,MACzC,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,IAC1C;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,cAAc;AAAA,EACjD;AAAA,EACA,qBAAqB;AAAA,IACnB,SAAS;AAAA,MACP,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,WAAW,gBAAgB,MAAM;AAAA,MACzC,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,aAAa,gBAAgB,UAAU;AAAA,MAC/C,EAAE,MAAM,YAAY,gBAAgB,UAAU;AAAA,MAC9C,EAAE,MAAM,eAAe,gBAAgB,OAAO;AAAA,IAChD;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,cAAc;AAAA,EACjD;AAAA,EACA,kBAAkB;AAAA,IAChB,SAAS;AAAA,MACP,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA;AAAA,MAC5C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,eAAe,gBAAgB,SAAS;AAAA,MAChD,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,WAAW,gBAAgB,MAAM;AAAA,MACzC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,IAC/C;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,mBAAmB;AAAA,EACtD;AAAA,EACA,QAAQ;AAAA,IACN,SAAS;AAAA,MACP,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,OAAO;AAAA,MAC1C,EAAE,MAAM,kBAAkB,gBAAgB,SAAS;AAAA,MACnD,EAAE,MAAM,cAAc,gBAAgB,OAAO;AAAA,MAC7C,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,IAC7C;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,SAAS;AAAA,EAC5C;AAAA,EACA,aAAa;AAAA,IACX,SAAS;AAAA,MACP,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,gBAAgB,gBAAgB,SAAS;AAAA,MACjD,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,MAC9C,EAAE,MAAM,MAAM,gBAAgB,SAAS;AAAA,MACvC,EAAE,MAAM,WAAW,gBAAgB,MAAM;AAAA,MACzC,EAAE,MAAM,cAAc,gBAAgB,OAAO;AAAA,MAC7C,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,iBAAiB,gBAAgB,SAAS;AAAA,MAClD,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,YAAY,gBAAgB,MAAM;AAAA,IAC5C;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,cAAc;AAAA,EACjD;AAAA,EACA,cAAc;AAAA,IACZ,SAAS;AAAA,MACP,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,gBAAgB,gBAAgB,SAAS;AAAA,MACjD,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,cAAc,gBAAgB,MAAM;AAAA,MAC5C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,aAAa,gBAAgB,SAAS;AAAA,MAC9C,EAAE,MAAM,MAAM,gBAAgB,SAAS;AAAA,MACvC,EAAE,MAAM,WAAW,gBAAgB,MAAM;AAAA,MACzC,EAAE,MAAM,cAAc,gBAAgB,OAAO;AAAA,MAC7C,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,MAC7C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,UAAU,gBAAgB,SAAS;AAAA,MAC3C,EAAE,MAAM,YAAY,gBAAgB,MAAM;AAAA,IAC5C;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,eAAe;AAAA,EAClD;AAAA,EACA,QAAQ;AAAA,IACN,SAAS;AAAA,MACP,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA;AAAA,MAC5C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,WAAW,gBAAgB,SAAS;AAAA,MAC5C,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,QAAQ,gBAAgB,SAAS;AAAA,MACzC,EAAE,MAAM,SAAS,gBAAgB,SAAS;AAAA,MAC1C,EAAE,MAAM,OAAO,gBAAgB,SAAS;AAAA,MACxC,EAAE,MAAM,YAAY,gBAAgB,SAAS;AAAA,IAC/C;AAAA,IACA,KAAK;AAAA,IACL,OAAO,EAAE,QAAQ,SAAS,OAAO,SAAS;AAAA,EAC5C;AACF;;;ACrIK,IAAMC,WAA6C;AAAA,EACxD,GAAG;AAAA,EACH,GAAGA;AACL;AAEA,IAAM,aAAoE;AAAA,EACxE,GAAG;AAAA,EACH,GAAGA;AACL;AAEO,IAAM,gBAAgB,MAAMA;AAE5B,IAAM,YAAY,CAAC,cAA4B;AACpD,MAAI,WAAW,SAAS,GAAG;AACzB,WAAO,WAAW,SAAS;AAAA,EAC7B;AACA,QAAM,MAAM,iCAAiC,SAAS,EAAE;AAC1D;;;ACzBA,IAAM,sBAAsB;AAC5B,IAAI,aAAa;AACjB,IAAM,QAAN,MAAY;AAAA,EACR,YAAY,MAAM,IAAI;AAClB,SAAK,OAAO;AACZ,SAAK,KAAK;AAAA,EACd;AACJ;AAIA,IAAM,WAAN,MAAe;AAAA;AAAA,EAEX,YAAY,SAAS,CAAC,GAAG;AACrB,SAAK,KAAK;AACV,SAAK,UAAU,CAAC,CAAC,OAAO;AACxB,SAAK,cAAc,OAAO,gBAAgB,MAAM;AAC5C,YAAM,IAAI,MAAM,sDAAsD;AAAA,IAC1E;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,OAAO;AACP,QAAI,KAAK;AACL,YAAM,IAAI,WAAW,wCAAwC;AACjE,QAAI,OAAO,SAAS;AAChB,cAAQ,SAAS,MAAM,KAAK;AAChC,WAAO,CAAC,SAAS;AACb,UAAI,SAAS,MAAM,IAAI;AACvB,aAAO,WAAW,SAAY,OAAO,CAAC,MAAM,MAAM;AAAA,IACtD;AAAA,EACJ;AACJ;AAKA,SAAS,WAAW,IAAI,SAAS,EAAE,aAAa,SAAO,IAAI,MAAM,GAAG,EAAE,CAAC;AAIvE,SAAS,WAAW,IAAI,SAAS,EAAE,aAAa,SAAO,IAAI,MAAM,GAAG,EAAE,CAAC;AAIvE,SAAS,QAAQ,IAAI,SAAS,EAAE,aAAa,SAAO,IAAI,MAAM,GAAG,EAAE,CAAC;AAIpE,SAAS,cAAc,IAAI,SAAS,EAAE,SAAS,KAAK,CAAC;AAKrD,SAAS,YAAY,IAAI,SAAS,EAAE,SAAS,KAAK,CAAC;AAInD,SAAS,UAAU,IAAI,SAAS,EAAE,SAAS,KAAK,CAAC;AAuBjD,IAAM,UAAU,uBAAO,OAAO,IAAI;AAElC,IAAM,WAAN,MAAM,UAAS;AAAA;AAAA,EAEX,YAKA,MAEA,OAGA,IAEA,QAAQ,GAAG;AACP,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,KAAK;AACV,SAAK,QAAQ;AAAA,EACjB;AAAA;AAAA,EAEA,OAAO,OAAO,MAAM;AAChB,QAAI,QAAQ,KAAK,SAAS,KAAK,MAAM,SAAS,uBAAO,OAAO,IAAI,IAAI;AACpE,QAAI,SAAS,KAAK,MAAM,IAAuB,MAAM,KAAK,UAAU,IAA2B,MAC1F,KAAK,QAAQ,IAAyB,MAAM,KAAK,QAAQ,OAAO,IAA6B;AAClG,QAAI,OAAO,IAAI,UAAS,KAAK,QAAQ,IAAI,OAAO,KAAK,IAAI,KAAK;AAC9D,QAAI,KAAK;AACL,eAAS,OAAO,KAAK,OAAO;AACxB,YAAI,CAAC,MAAM,QAAQ,GAAG;AAClB,gBAAM,IAAI,IAAI;AAClB,YAAI,KAAK;AACL,cAAI,IAAI,CAAC,EAAE;AACP,kBAAM,IAAI,WAAW,4CAA4C;AACrE,gBAAM,IAAI,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC;AAAA,QAC5B;AAAA,MACJ;AACJ,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAGA,KAAK,MAAM;AAAE,WAAO,KAAK,MAAM,KAAK,EAAE;AAAA,EAAG;AAAA;AAAA,EAEzC,IAAI,QAAQ;AAAE,YAAQ,KAAK,QAAQ,KAAwB;AAAA,EAAG;AAAA;AAAA,EAE9D,IAAI,YAAY;AAAE,YAAQ,KAAK,QAAQ,KAA4B;AAAA,EAAG;AAAA;AAAA,EAEtE,IAAI,UAAU;AAAE,YAAQ,KAAK,QAAQ,KAA0B;AAAA,EAAG;AAAA;AAAA;AAAA,EAGlE,IAAI,cAAc;AAAE,YAAQ,KAAK,QAAQ,KAA8B;AAAA,EAAG;AAAA;AAAA;AAAA,EAG1E,GAAG,MAAM;AACL,QAAI,OAAO,QAAQ,UAAU;AACzB,UAAI,KAAK,QAAQ;AACb,eAAO;AACX,UAAI,QAAQ,KAAK,KAAK,SAAS,KAAK;AACpC,aAAO,QAAQ,MAAM,QAAQ,IAAI,IAAI,KAAK;AAAA,IAC9C;AACA,WAAO,KAAK,MAAM;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,MAAM,KAAK;AACd,QAAI,SAAS,uBAAO,OAAO,IAAI;AAC/B,aAAS,QAAQ;AACb,eAAS,QAAQ,KAAK,MAAM,GAAG;AAC3B,eAAO,IAAI,IAAI,IAAI,IAAI;AAC/B,WAAO,CAAC,SAAS;AACb,eAAS,SAAS,KAAK,KAAK,SAAS,KAAK,GAAG,IAAI,IAAI,KAAK,SAAS,OAAO,SAAS,IAAI,KAAK;AACxF,YAAI,QAAQ,OAAO,IAAI,IAAI,KAAK,OAAO,OAAO,CAAC,CAAC;AAChD,YAAI;AACA,iBAAO;AAAA,MACf;AAAA,IACJ;AAAA,EACJ;AACJ;AAEA,SAAS,OAAO,IAAI;AAAA,EAAS;AAAA,EAAI,uBAAO,OAAO,IAAI;AAAA,EAAG;AAAA,EAAG;AAAA;AAA0B;AAQnF,IAAM,UAAN,MAAM,SAAQ;AAAA;AAAA;AAAA,EAGV,YAEA,OAAO;AACH,SAAK,QAAQ;AACb,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ;AAC9B,UAAI,MAAM,CAAC,EAAE,MAAM;AACf,cAAM,IAAI,WAAW,6EAA6E;AAAA,EAC9G;AAAA;AAAA;AAAA;AAAA,EAIA,UAAU,OAAO;AACb,QAAI,WAAW,CAAC;AAChB,aAAS,QAAQ,KAAK,OAAO;AACzB,UAAI,WAAW;AACf,eAAS,UAAU,OAAO;AACtB,YAAI,MAAM,OAAO,IAAI;AACrB,YAAI,KAAK;AACL,cAAI,CAAC;AACD,uBAAW,OAAO,OAAO,CAAC,GAAG,KAAK,KAAK;AAC3C,mBAAS,IAAI,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC;AAAA,QAC/B;AAAA,MACJ;AACA,eAAS,KAAK,WAAW,IAAI,SAAS,KAAK,MAAM,UAAU,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI;AAAA,IAC1F;AACA,WAAO,IAAI,SAAQ,QAAQ;AAAA,EAC/B;AACJ;AACA,IAAM,aAAa,oBAAI,QAAQ;AAA/B,IAAkC,kBAAkB,oBAAI,QAAQ;AAGhE,IAAI;AAAA,CACH,SAAUC,WAAU;AAIjB,EAAAA,UAASA,UAAS,gBAAgB,IAAI,CAAC,IAAI;AAI3C,EAAAA,UAASA,UAAS,kBAAkB,IAAI,CAAC,IAAI;AAI7C,EAAAA,UAASA,UAAS,cAAc,IAAI,CAAC,IAAI;AAKzC,EAAAA,UAASA,UAAS,gBAAgB,IAAI,CAAC,IAAI;AAC/C,GAAG,aAAa,WAAW,CAAC,EAAE;AAe9B,IAAM,OAAN,MAAM,MAAK;AAAA;AAAA,EAEP,YAEA,MAEA,UAGA,WAEAC,SAEA,OAAO;AACH,SAAK,OAAO;AACZ,SAAK,WAAW;AAChB,SAAK,YAAY;AACjB,SAAK,SAASA;AAEd,SAAK,QAAQ;AACb,QAAI,SAAS,MAAM,QAAQ;AACvB,WAAK,QAAQ,uBAAO,OAAO,IAAI;AAC/B,eAAS,CAAC,MAAM,KAAK,KAAK;AACtB,aAAK,MAAM,OAAO,QAAQ,WAAW,OAAO,KAAK,EAAE,IAAI;AAAA,IAC/D;AAAA,EACJ;AAAA;AAAA,EAEA,WAAW;AACP,QAAI,UAAU,KAAK,KAAK,SAAS,OAAO;AACxC,QAAI,WAAW,CAAC,QAAQ;AACpB,aAAO,QAAQ,KAAK,SAAS;AACjC,QAAI,WAAW;AACf,aAAS,MAAM,KAAK,UAAU;AAC1B,UAAI,MAAM,GAAG,SAAS;AACtB,UAAI,KAAK;AACL,YAAI;AACA,sBAAY;AAChB,oBAAY;AAAA,MAChB;AAAA,IACJ;AACA,WAAO,CAAC,KAAK,KAAK,OAAO,YACpB,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,KAAK,KAAK,UAAU,KAAK,UAAU,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SACzF,SAAS,SAAS,MAAM,WAAW,MAAM;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA,EAIA,OAAO,OAAO,GAAG;AACb,WAAO,IAAI,WAAW,KAAK,SAAS,IAAI;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAIA,SAAS,KAAK,OAAO,GAAG,OAAO,GAAG;AAC9B,QAAI,QAAQ,WAAW,IAAI,IAAI,KAAK,KAAK;AACzC,QAAI,SAAS,IAAI,WAAW,KAAK;AACjC,WAAO,OAAO,KAAK,IAAI;AACvB,eAAW,IAAI,MAAM,OAAO,KAAK;AACjC,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAGA,IAAI,UAAU;AACV,WAAO,IAAI,SAAS,MAAM,GAAG,GAAG,IAAI;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAQ,KAAK,OAAO,GAAG;AACnB,QAAI,OAAO,YAAY,WAAW,IAAI,IAAI,KAAK,KAAK,SAAS,KAAK,MAAM,KAAK;AAC7E,eAAW,IAAI,MAAM,IAAI;AACzB,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAa,KAAK,OAAO,GAAG;AACxB,QAAI,OAAO,YAAY,gBAAgB,IAAI,IAAI,KAAK,KAAK,SAAS,KAAK,MAAM,IAAI;AACjF,oBAAgB,IAAI,MAAM,IAAI;AAC9B,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,MAAM;AACV,QAAI,EAAE,OAAO,OAAO,OAAO,GAAG,KAAK,KAAK,OAAO,IAAI;AACnD,QAAI,OAAO,KAAK,QAAQ,GAAG,QAAQ,OAAO,SAAS,oBAAoB;AACvE,aAAS,IAAI,KAAK,OAAO,OAAO,SAAS,gBAAgB,OAAK;AAC1D,UAAI,UAAU;AACd,UAAI,EAAE,QAAQ,MAAM,EAAE,MAAM,SAAS,CAAC,QAAQ,EAAE,KAAK,eAAe,MAAM,CAAC,MAAM,QAAQ;AACrF,YAAI,EAAE,WAAW;AACb;AACJ,kBAAU;AAAA,MACd;AACA,iBAAS;AACL,YAAI,WAAW,UAAU,QAAQ,CAAC,EAAE,KAAK;AACrC,gBAAM,CAAC;AACX,YAAI,EAAE,YAAY;AACd;AACJ,YAAI,CAAC,EAAE,OAAO;AACV;AACJ,kBAAU;AAAA,MACd;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA,EAGA,KAAK,MAAM;AACP,WAAO,CAAC,KAAK,UAAU,KAAK,KAAK,KAAK,IAAI,IAAI,KAAK,QAAQ,KAAK,MAAM,KAAK,EAAE,IAAI;AAAA,EACrF;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,aAAa;AACb,QAAI,SAAS,CAAC;AACd,QAAI,KAAK;AACL,eAAS,MAAM,KAAK;AAChB,eAAO,KAAK,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC,CAAC;AACzC,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,QAAQ,SAAS,CAAC,GAAG;AACjB,WAAO,KAAK,SAAS,UAAU,IAA+B,OAC1D,aAAa,SAAS,MAAM,KAAK,UAAU,KAAK,WAAW,GAAG,KAAK,SAAS,QAAQ,GAAG,KAAK,QAAQ,CAAC,UAAU,WAAWA,YAAW,IAAI,MAAK,KAAK,MAAM,UAAU,WAAWA,SAAQ,KAAK,UAAU,GAAG,OAAO,aAAa,CAAC,UAAU,WAAWA,YAAW,IAAI,MAAK,SAAS,MAAM,UAAU,WAAWA,OAAM,EAAE;AAAA,EAC1T;AAAA;AAAA;AAAA,EAGA,OAAO,MAAM,MAAM;AAAE,WAAO,UAAU,IAAI;AAAA,EAAG;AACjD;AAEA,KAAK,QAAQ,IAAI,KAAK,SAAS,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;AAC9C,IAAM,mBAAN,MAAM,kBAAiB;AAAA,EACnB,YAAY,QAAQ,OAAO;AACvB,SAAK,SAAS;AACd,SAAK,QAAQ;AAAA,EACjB;AAAA,EACA,IAAI,KAAK;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EAC/C,IAAI,QAAQ;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EAClD,IAAI,MAAM;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EAChD,IAAI,OAAO;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EACjD,IAAI,MAAM;AAAE,WAAO,KAAK;AAAA,EAAO;AAAA,EAC/B,OAAO;AAAE,SAAK,SAAS;AAAA,EAAG;AAAA,EAC1B,OAAO;AAAE,WAAO,IAAI,kBAAiB,KAAK,QAAQ,KAAK,KAAK;AAAA,EAAG;AACnE;AAKA,IAAM,aAAN,MAAM,YAAW;AAAA;AAAA,EAEb,YAEA,QAEAA,SAEA,KAAK;AACD,SAAK,SAAS;AACd,SAAK,SAASA;AACd,SAAK,MAAM;AAAA,EACf;AAAA;AAAA,EAEA,IAAI,OAAO;AAAE,WAAO,SAAS;AAAA,EAAM;AAAA;AAAA,EAEnC,WAAW;AACP,QAAI,SAAS,CAAC;AACd,aAAS,QAAQ,GAAG,QAAQ,KAAK,OAAO,UAAS;AAC7C,aAAO,KAAK,KAAK,YAAY,KAAK,CAAC;AACnC,cAAQ,KAAK,OAAO,QAAQ,CAAC;AAAA,IACjC;AACA,WAAO,OAAO,KAAK,GAAG;AAAA,EAC1B;AAAA;AAAA,EAEA,YAAY,OAAO;AACf,QAAI,KAAK,KAAK,OAAO,KAAK,GAAG,WAAW,KAAK,OAAO,QAAQ,CAAC;AAC7D,QAAI,OAAO,KAAK,IAAI,MAAM,EAAE,GAAG,SAAS,KAAK;AAC7C,QAAI,KAAK,KAAK,MAAM,KAAK,CAAC,KAAK;AAC3B,eAAS,KAAK,UAAU,MAAM;AAClC,aAAS;AACT,QAAI,YAAY;AACZ,aAAO;AACX,QAAI,WAAW,CAAC;AAChB,WAAO,QAAQ,UAAU;AACrB,eAAS,KAAK,KAAK,YAAY,KAAK,CAAC;AACrC,cAAQ,KAAK,OAAO,QAAQ,CAAC;AAAA,IACjC;AACA,WAAO,SAAS,MAAM,SAAS,KAAK,GAAG,IAAI;AAAA,EAC/C;AAAA;AAAA,EAEA,UAAU,YAAY,UAAU,KAAK,KAAK,MAAM;AAC5C,QAAI,EAAE,OAAO,IAAI,MAAM,OAAO;AAC9B,aAAS,IAAI,YAAY,KAAK,UAAU,IAAI,OAAO,IAAI,CAAC,GAAG;AACvD,UAAI,UAAU,MAAM,KAAK,OAAO,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,GAAG;AACpD,eAAO;AACP,YAAI,MAAM;AACN;AAAA,MACR;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,MAAM,QAAQ,MAAM,MAAM;AACtB,QAAI,IAAI,KAAK;AACb,QAAI,OAAO,IAAI,YAAY,OAAO,MAAM,GAAG,MAAM;AACjD,aAAS,IAAI,QAAQ,IAAI,GAAG,IAAI,QAAO;AACnC,WAAK,GAAG,IAAI,EAAE,GAAG;AACjB,WAAK,GAAG,IAAI,EAAE,GAAG,IAAI;AACrB,UAAI,KAAK,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI;AAC9B,WAAK,GAAG,IAAI,EAAE,GAAG,IAAI;AACrB,YAAM,KAAK,IAAI,KAAK,EAAE;AAAA,IAC1B;AACA,WAAO,IAAI,YAAW,MAAM,KAAK,KAAK,GAAG;AAAA,EAC7C;AACJ;AACA,SAAS,UAAU,MAAM,KAAK,MAAM,IAAI;AACpC,UAAQ,MAAM;AAAA,IACV,KAAK;AAAsB,aAAO,OAAO;AAAA,IACzC,KAAK;AAA0B,aAAO,MAAM,OAAO,OAAO;AAAA,IAC1D,KAAK;AAAqB,aAAO,OAAO,OAAO,KAAK;AAAA,IACpD,KAAK;AAAwB,aAAO,QAAQ,OAAO,KAAK;AAAA,IACxD,KAAK;AAAoB,aAAO,KAAK;AAAA,IACrC,KAAK;AAAuB,aAAO;AAAA,EACvC;AACJ;AACA,SAAS,2BAA2B,MAAM,KAAK;AAC3C,MAAI,OAAO,KAAK,YAAY,GAAG;AAC/B,SAAO,MAAM;AACT,QAAIC,QAAO,KAAK;AAChB,QAAI,CAACA,SAAQA,MAAK,MAAM,KAAK;AACzB;AACJ,QAAIA,MAAK,KAAK,WAAWA,MAAK,QAAQA,MAAK,IAAI;AAC3C,aAAO;AACP,aAAOA,MAAK;AAAA,IAChB,OACK;AACD,aAAOA;AAAA,IACX;AAAA,EACJ;AACA,SAAO;AACX;AACA,SAAS,YAAY,MAAM,KAAK,MAAM,UAAU;AAC5C,MAAI;AAEJ,SAAO,KAAK,QAAQ,KAAK,OACpB,OAAO,IAAI,KAAK,QAAQ,MAAM,KAAK,OAAO,SAC1C,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM;AAC9C,QAAI,SAAS,CAAC,YAAY,gBAAgB,YAAY,KAAK,QAAQ,IAAI,OAAO,KAAK;AACnF,QAAI,CAAC;AACD,aAAO;AACX,WAAO;AAAA,EACX;AACA,MAAI,OAAO,WAAW,IAAI,SAAS;AAEnC,MAAI;AACA,aAAS,OAAO,MAAM,SAAS,KAAK,QAAQ,QAAQ,OAAO,QAAQ,SAAS,KAAK,QAAQ;AACrF,UAAI,gBAAgB,YAAY,KAAK,QAAQ,OAAO,KAAK,OAAO,MAAM,KAAK,MAAM,IAAI,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,SAAS,KAAK;AAC1I,eAAO;AAAA,IACf;AACJ,aAAS;AACL,QAAI,QAAQ,KAAK,MAAM,KAAK,MAAM,IAAI;AACtC,QAAI,CAAC;AACD,aAAO;AACX,WAAO;AAAA,EACX;AACJ;AACA,IAAM,WAAN,MAAM,UAAS;AAAA,EACX,YAAY,OAAO,MAEnB,OAAO,SAAS;AACZ,SAAK,QAAQ;AACb,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,UAAU;AAAA,EACnB;AAAA,EACA,IAAI,OAAO;AAAE,WAAO,KAAK,MAAM;AAAA,EAAM;AAAA,EACrC,IAAI,OAAO;AAAE,WAAO,KAAK,MAAM,KAAK;AAAA,EAAM;AAAA,EAC1C,IAAI,KAAK;AAAE,WAAO,KAAK,OAAO,KAAK,MAAM;AAAA,EAAQ;AAAA,EACjD,UAAU,GAAG,KAAK,KAAK,MAAM,OAAO,GAAG;AACnC,aAAS,SAAS,UAAQ;AACtB,eAAS,EAAE,UAAU,UAAU,IAAI,OAAO,OAAO,IAAI,MAAM,IAAI,SAAS,SAAS,IAAI,KAAK,GAAG,KAAK,KAAK;AACnG,YAAI,OAAO,SAAS,CAAC,GAAG,QAAQ,UAAU,CAAC,IAAI,OAAO;AACtD,YAAI,CAAC,UAAU,MAAM,KAAK,OAAO,QAAQ,KAAK,MAAM;AAChD;AACJ,YAAI,gBAAgB,YAAY;AAC5B,cAAI,OAAO,SAAS;AAChB;AACJ,cAAI,QAAQ,KAAK,UAAU,GAAG,KAAK,OAAO,QAAQ,KAAK,MAAM,OAAO,IAAI;AACxE,cAAI,QAAQ;AACR,mBAAO,IAAI,WAAW,IAAI,cAAc,QAAQ,MAAM,GAAG,KAAK,GAAG,MAAM,KAAK;AAAA,QACpF,WACU,OAAO,SAAS,qBAAsB,CAAC,KAAK,KAAK,eAAe,SAAS,IAAI,IAAI;AACvF,cAAI;AACJ,cAAI,EAAE,OAAO,SAAS,iBAClB,KAAK,UAAU,UAAU,KAAK,KAAK,SAAS,OAAO,MAAM,CAAC,QAAQ;AAClE,mBAAO,IAAI,UAAS,QAAQ,MAAM,OAAO,GAAG,MAAM;AACtD,cAAI,QAAQ,IAAI,UAAS,MAAM,OAAO,GAAG,MAAM;AAC/C,iBAAQ,OAAO,SAAS,oBAAqB,CAAC,MAAM,KAAK,cAAc,QACjE,MAAM,UAAU,MAAM,IAAI,KAAK,SAAS,SAAS,IAAI,GAAG,KAAK,KAAK,IAAI;AAAA,QAChF;AAAA,MACJ;AACA,UAAK,OAAO,SAAS,oBAAqB,CAAC,OAAO,KAAK;AACnD,eAAO;AACX,UAAI,OAAO,SAAS;AAChB,YAAI,OAAO,QAAQ;AAAA;AAEnB,YAAI,MAAM,IAAI,KAAK,OAAO,QAAQ,MAAM,SAAS;AACrD,eAAS,OAAO;AAChB,UAAI,CAAC;AACD,eAAO;AAAA,IACf;AAAA,EACJ;AAAA,EACA,IAAI,aAAa;AAAE,WAAO,KAAK;AAAA,MAAU;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EAAG;AAAA,EAC1E,IAAI,YAAY;AAAE,WAAO,KAAK;AAAA,MAAU,KAAK,MAAM,SAAS,SAAS;AAAA,MAAG;AAAA,MAAI;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EAAG;AAAA,EACvG,WAAW,KAAK;AAAE,WAAO,KAAK;AAAA,MAAU;AAAA,MAAG;AAAA,MAAG;AAAA,MAAK;AAAA;AAAA,IAAkB;AAAA,EAAG;AAAA,EACxE,YAAY,KAAK;AAAE,WAAO,KAAK;AAAA,MAAU,KAAK,MAAM,SAAS,SAAS;AAAA,MAAG;AAAA,MAAI;AAAA,MAAK;AAAA;AAAA,IAAoB;AAAA,EAAG;AAAA,EACzG,MAAM,KAAK,MAAM,OAAO,GAAG;AACvB,QAAI;AACJ,QAAI,EAAE,OAAO,SAAS,oBAAoB,UAAU,KAAK,MAAM,KAAK,SAAS,OAAO,MAAM,QAAQ,SAAS;AACvG,UAAI,OAAO,MAAM,KAAK;AACtB,eAAS,EAAE,MAAM,GAAG,KAAK,QAAQ,SAAS;AACtC,aAAK,OAAO,IAAI,QAAQ,OAAO,OAAO,UACjC,OAAO,IAAI,MAAM,OAAO,KAAK;AAC9B,iBAAO,IAAI,UAAS,QAAQ,MAAM,QAAQ,QAAQ,CAAC,EAAE,OAAO,KAAK,MAAM,IAAI,IAAI;AAAA,MACvF;AAAA,IACJ;AACA,WAAO,KAAK,UAAU,GAAG,GAAG,KAAK,MAAM,IAAI;AAAA,EAC/C;AAAA,EACA,wBAAwB;AACpB,QAAI,MAAM;AACV,WAAO,IAAI,KAAK,eAAe,IAAI;AAC/B,YAAM,IAAI;AACd,WAAO;AAAA,EACX;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK,UAAU,KAAK,QAAQ,sBAAsB,IAAI;AAAA,EACjE;AAAA,EACA,IAAI,cAAc;AACd,WAAO,KAAK,WAAW,KAAK,SAAS,IAAI,KAAK,QAAQ;AAAA,MAAU,KAAK,QAAQ;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA;AAAA,IAAqB,IAAI;AAAA,EACnH;AAAA,EACA,IAAI,cAAc;AACd,WAAO,KAAK,WAAW,KAAK,SAAS,IAAI,KAAK,QAAQ;AAAA,MAAU,KAAK,QAAQ;AAAA,MAAG;AAAA,MAAI;AAAA,MAAG;AAAA;AAAA,IAAqB,IAAI;AAAA,EACpH;AAAA,EACA,OAAO,OAAO,GAAG;AAAE,WAAO,IAAI,WAAW,MAAM,IAAI;AAAA,EAAG;AAAA,EACtD,IAAI,OAAO;AAAE,WAAO,KAAK;AAAA,EAAO;AAAA,EAChC,SAAS;AAAE,WAAO,KAAK;AAAA,EAAO;AAAA,EAC9B,QAAQ,KAAK,OAAO,GAAG;AACnB,WAAO,YAAY,MAAM,KAAK,MAAM,KAAK;AAAA,EAC7C;AAAA,EACA,aAAa,KAAK,OAAO,GAAG;AACxB,WAAO,YAAY,MAAM,KAAK,MAAM,IAAI;AAAA,EAC5C;AAAA,EACA,2BAA2B,KAAK;AAAE,WAAO,2BAA2B,MAAM,GAAG;AAAA,EAAG;AAAA,EAChF,SAAS,MAAM,SAAS,MAAM,QAAQ,MAAM;AACxC,QAAI,IAAI,YAAY,MAAM,MAAM,QAAQ,KAAK;AAC7C,WAAO,EAAE,SAAS,EAAE,CAAC,IAAI;AAAA,EAC7B;AAAA,EACA,YAAY,MAAM,SAAS,MAAM,QAAQ,MAAM;AAC3C,WAAO,YAAY,MAAM,MAAM,QAAQ,KAAK;AAAA,EAChD;AAAA;AAAA,EAEA,WAAW;AAAE,WAAO,KAAK,MAAM,SAAS;AAAA,EAAG;AAAA,EAC3C,IAAI,OAAO;AAAE,WAAO;AAAA,EAAM;AAAA,EAC1B,aAAa,SAAS;AAAE,WAAO,iBAAiB,MAAM,OAAO;AAAA,EAAG;AACpE;AACA,SAAS,YAAY,MAAM,MAAM,QAAQ,OAAO;AAC5C,MAAI,MAAM,KAAK,OAAO,GAAG,SAAS,CAAC;AACnC,MAAI,CAAC,IAAI,WAAW;AAChB,WAAO;AACX,MAAI,UAAU;AACV,WAAO,CAAC,IAAI,KAAK,GAAG,MAAM;AACtB,UAAI,CAAC,IAAI,YAAY;AACjB,eAAO;AAAA;AACnB,aAAS;AACL,QAAI,SAAS,QAAQ,IAAI,KAAK,GAAG,KAAK;AAClC,aAAO;AACX,QAAI,IAAI,KAAK,GAAG,IAAI;AAChB,aAAO,KAAK,IAAI,IAAI;AACxB,QAAI,CAAC,IAAI,YAAY;AACjB,aAAO,SAAS,OAAO,SAAS,CAAC;AAAA,EACzC;AACJ;AACA,SAAS,iBAAiB,MAAM,SAAS,IAAI,QAAQ,SAAS,GAAG;AAC7D,WAAS,IAAI,KAAK,QAAQ,KAAK,GAAG,IAAI,EAAE,QAAQ;AAC5C,QAAI,CAAC;AACD,aAAO;AACX,QAAI,CAAC,EAAE,KAAK,aAAa;AACrB,UAAI,QAAQ,CAAC,KAAK,QAAQ,CAAC,KAAK,EAAE;AAC9B,eAAO;AACX;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;AACA,IAAM,gBAAN,MAAoB;AAAA,EAChB,YAAY,QAAQ,QAAQ,OAAO,OAAO;AACtC,SAAK,SAAS;AACd,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,SAAK,QAAQ;AAAA,EACjB;AACJ;AACA,IAAM,aAAN,MAAM,YAAW;AAAA,EACb,IAAI,OAAO;AAAE,WAAO,KAAK,KAAK;AAAA,EAAM;AAAA,EACpC,IAAI,OAAO;AAAE,WAAO,KAAK,QAAQ,QAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EACrF,IAAI,KAAK;AAAE,WAAO,KAAK,QAAQ,QAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EACnF,YAAY,SAAS,SAAS,OAAO;AACjC,SAAK,UAAU;AACf,SAAK,UAAU;AACf,SAAK,QAAQ;AACb,SAAK,OAAO,QAAQ,OAAO,IAAI,MAAM,QAAQ,OAAO,OAAO,KAAK,CAAC;AAAA,EACrE;AAAA,EACA,MAAM,KAAK,KAAK,MAAM;AAClB,QAAI,EAAE,OAAO,IAAI,KAAK;AACtB,QAAI,QAAQ,OAAO,UAAU,KAAK,QAAQ,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,GAAG,KAAK,MAAM,KAAK,QAAQ,OAAO,IAAI;AAC/G,WAAO,QAAQ,IAAI,OAAO,IAAI,YAAW,KAAK,SAAS,MAAM,KAAK;AAAA,EACtE;AAAA,EACA,IAAI,aAAa;AAAE,WAAO,KAAK;AAAA,MAAM;AAAA,MAAG;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EAAG;AAAA,EACnE,IAAI,YAAY;AAAE,WAAO,KAAK;AAAA,MAAM;AAAA,MAAI;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EAAG;AAAA,EACnE,WAAW,KAAK;AAAE,WAAO,KAAK;AAAA,MAAM;AAAA,MAAG;AAAA,MAAK;AAAA;AAAA,IAAkB;AAAA,EAAG;AAAA,EACjE,YAAY,KAAK;AAAE,WAAO,KAAK;AAAA,MAAM;AAAA,MAAI;AAAA,MAAK;AAAA;AAAA,IAAoB;AAAA,EAAG;AAAA,EACrE,MAAM,KAAK,MAAM,OAAO,GAAG;AACvB,QAAI,OAAO,SAAS;AAChB,aAAO;AACX,QAAI,EAAE,OAAO,IAAI,KAAK;AACtB,QAAI,QAAQ,OAAO,UAAU,KAAK,QAAQ,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,GAAG,OAAO,IAAI,IAAI,IAAI,MAAM,KAAK,QAAQ,OAAO,IAAI;AAC7H,WAAO,QAAQ,IAAI,OAAO,IAAI,YAAW,KAAK,SAAS,MAAM,KAAK;AAAA,EACtE;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK,WAAW,KAAK,QAAQ,OAAO,sBAAsB;AAAA,EACrE;AAAA,EACA,gBAAgB,KAAK;AACjB,WAAO,KAAK,UAAU,OAAO,KAAK,QAAQ,OAAO;AAAA,MAAU,KAAK,QAAQ,QAAQ;AAAA,MAAK;AAAA,MAAK;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EACtH;AAAA,EACA,IAAI,cAAc;AACd,QAAI,EAAE,OAAO,IAAI,KAAK;AACtB,QAAI,QAAQ,OAAO,OAAO,KAAK,QAAQ,CAAC;AACxC,QAAI,SAAS,KAAK,UAAU,OAAO,OAAO,KAAK,QAAQ,QAAQ,CAAC,IAAI,OAAO,OAAO;AAC9E,aAAO,IAAI,YAAW,KAAK,SAAS,KAAK,SAAS,KAAK;AAC3D,WAAO,KAAK,gBAAgB,CAAC;AAAA,EACjC;AAAA,EACA,IAAI,cAAc;AACd,QAAI,EAAE,OAAO,IAAI,KAAK;AACtB,QAAI,cAAc,KAAK,UAAU,KAAK,QAAQ,QAAQ,IAAI;AAC1D,QAAI,KAAK,SAAS;AACd,aAAO,KAAK,gBAAgB,EAAE;AAClC,WAAO,IAAI,YAAW,KAAK,SAAS,KAAK,SAAS,OAAO;AAAA,MAAU;AAAA,MAAa,KAAK;AAAA,MAAO;AAAA,MAAI;AAAA,MAAG;AAAA;AAAA,IAAqB,CAAC;AAAA,EAC7H;AAAA,EACA,OAAO,OAAO,GAAG;AAAE,WAAO,IAAI,WAAW,MAAM,IAAI;AAAA,EAAG;AAAA,EACtD,IAAI,OAAO;AAAE,WAAO;AAAA,EAAM;AAAA,EAC1B,SAAS;AACL,QAAI,WAAW,CAAC,GAAG,YAAY,CAAC;AAChC,QAAI,EAAE,OAAO,IAAI,KAAK;AACtB,QAAI,SAAS,KAAK,QAAQ,GAAG,OAAO,OAAO,OAAO,KAAK,QAAQ,CAAC;AAChE,QAAI,OAAO,QAAQ;AACf,UAAI,OAAO,OAAO,OAAO,KAAK,QAAQ,CAAC;AACvC,eAAS,KAAK,OAAO,MAAM,QAAQ,MAAM,IAAI,CAAC;AAC9C,gBAAU,KAAK,CAAC;AAAA,IACpB;AACA,WAAO,IAAI,KAAK,KAAK,MAAM,UAAU,WAAW,KAAK,KAAK,KAAK,IAAI;AAAA,EACvE;AAAA,EACA,QAAQ,KAAK,OAAO,GAAG;AACnB,WAAO,YAAY,MAAM,KAAK,MAAM,KAAK;AAAA,EAC7C;AAAA,EACA,aAAa,KAAK,OAAO,GAAG;AACxB,WAAO,YAAY,MAAM,KAAK,MAAM,IAAI;AAAA,EAC5C;AAAA,EACA,2BAA2B,KAAK;AAAE,WAAO,2BAA2B,MAAM,GAAG;AAAA,EAAG;AAAA;AAAA,EAEhF,WAAW;AAAE,WAAO,KAAK,QAAQ,OAAO,YAAY,KAAK,KAAK;AAAA,EAAG;AAAA,EACjE,SAAS,MAAM,SAAS,MAAM,QAAQ,MAAM;AACxC,QAAI,IAAI,YAAY,MAAM,MAAM,QAAQ,KAAK;AAC7C,WAAO,EAAE,SAAS,EAAE,CAAC,IAAI;AAAA,EAC7B;AAAA,EACA,YAAY,MAAM,SAAS,MAAM,QAAQ,MAAM;AAC3C,WAAO,YAAY,MAAM,MAAM,QAAQ,KAAK;AAAA,EAChD;AAAA,EACA,IAAI,OAAO;AAAE,WAAO;AAAA,EAAM;AAAA,EAC1B,aAAa,SAAS;AAAE,WAAO,iBAAiB,MAAM,OAAO;AAAA,EAAG;AACpE;AAGA,IAAM,aAAN,MAAiB;AAAA;AAAA,EAEb,IAAI,OAAO;AAAE,WAAO,KAAK,KAAK;AAAA,EAAM;AAAA;AAAA,EAEpC,YAAY,MAEZ,OAAO,GAAG;AACN,SAAK,OAAO;AAEZ,SAAK,SAAS;AACd,SAAK,QAAQ,CAAC;AAEd,SAAK,QAAQ;AACb,SAAK,aAAa;AAClB,QAAI,gBAAgB,UAAU;AAC1B,WAAK,UAAU,IAAI;AAAA,IACvB,OACK;AACD,WAAK,QAAQ,KAAK,QAAQ;AAC1B,WAAK,SAAS,KAAK;AACnB,eAAS,IAAI,KAAK,SAAS,GAAG,IAAI,EAAE;AAChC,aAAK,MAAM,QAAQ,EAAE,KAAK;AAC9B,WAAK,aAAa;AAClB,WAAK,SAAS,KAAK,KAAK;AAAA,IAC5B;AAAA,EACJ;AAAA,EACA,UAAU,MAAM;AACZ,QAAI,CAAC;AACD,aAAO;AACX,SAAK,QAAQ;AACb,SAAK,OAAO,KAAK;AACjB,SAAK,OAAO,KAAK;AACjB,SAAK,KAAK,KAAK;AACf,WAAO;AAAA,EACX;AAAA,EACA,SAAS,OAAO,MAAM;AAClB,SAAK,QAAQ;AACb,QAAI,EAAE,OAAO,OAAO,IAAI,KAAK;AAC7B,SAAK,OAAO,QAAQ,OAAO,IAAI,MAAM,OAAO,OAAO,KAAK,CAAC;AACzD,SAAK,OAAO,QAAQ,OAAO,OAAO,QAAQ,CAAC;AAC3C,SAAK,KAAK,QAAQ,OAAO,OAAO,QAAQ,CAAC;AACzC,WAAO;AAAA,EACX;AAAA,EACA,MAAM,MAAM;AACR,QAAI,CAAC;AACD,aAAO;AACX,QAAI,gBAAgB,UAAU;AAC1B,WAAK,SAAS;AACd,aAAO,KAAK,UAAU,IAAI;AAAA,IAC9B;AACA,SAAK,SAAS,KAAK;AACnB,WAAO,KAAK,SAAS,KAAK,OAAO,KAAK,IAAI;AAAA,EAC9C;AAAA;AAAA,EAEA,WAAW;AACP,WAAO,KAAK,SAAS,KAAK,OAAO,OAAO,YAAY,KAAK,KAAK,IAAI,KAAK,MAAM,SAAS;AAAA,EAC1F;AAAA;AAAA,EAEA,WAAW,KAAK,KAAK,MAAM;AACvB,QAAI,CAAC,KAAK;AACN,aAAO,KAAK,MAAM,KAAK,MAAM,UAAU,MAAM,IAAI,KAAK,MAAM,MAAM,SAAS,SAAS,IAAI,GAAG,KAAK,KAAK,MAAM,KAAK,IAAI,CAAC;AACzH,QAAI,EAAE,OAAO,IAAI,KAAK;AACtB,QAAI,QAAQ,OAAO,UAAU,KAAK,QAAQ,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,GAAG,KAAK,MAAM,KAAK,OAAO,OAAO,IAAI;AAC9G,QAAI,QAAQ;AACR,aAAO;AACX,SAAK,MAAM,KAAK,KAAK,KAAK;AAC1B,WAAO,KAAK,SAAS,KAAK;AAAA,EAC9B;AAAA;AAAA;AAAA,EAGA,aAAa;AAAE,WAAO,KAAK;AAAA,MAAW;AAAA,MAAG;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EAAG;AAAA;AAAA,EAEpE,YAAY;AAAE,WAAO,KAAK;AAAA,MAAW;AAAA,MAAI;AAAA,MAAG;AAAA;AAAA,IAAqB;AAAA,EAAG;AAAA;AAAA,EAEpE,WAAW,KAAK;AAAE,WAAO,KAAK;AAAA,MAAW;AAAA,MAAG;AAAA,MAAK;AAAA;AAAA,IAAkB;AAAA,EAAG;AAAA;AAAA,EAEtE,YAAY,KAAK;AAAE,WAAO,KAAK;AAAA,MAAW;AAAA,MAAI;AAAA,MAAK;AAAA;AAAA,IAAoB;AAAA,EAAG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM1E,MAAM,KAAK,MAAM,OAAO,KAAK,MAAM;AAC/B,QAAI,CAAC,KAAK;AACN,aAAO,KAAK,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM,IAAI,CAAC;AACvD,WAAO,OAAO,SAAS,iBAAiB,QAAQ,KAAK,WAAW,GAAG,KAAK,IAAI;AAAA,EAChF;AAAA;AAAA,EAEA,SAAS;AACL,QAAI,CAAC,KAAK;AACN,aAAO,KAAK,UAAW,KAAK,OAAO,SAAS,mBAAoB,KAAK,MAAM,UAAU,KAAK,MAAM,MAAM;AAC1G,QAAI,KAAK,MAAM;AACX,aAAO,KAAK,SAAS,KAAK,MAAM,IAAI,CAAC;AACzC,QAAI,SAAU,KAAK,OAAO,SAAS,mBAAoB,KAAK,OAAO,SAAS,KAAK,OAAO,OAAO,sBAAsB;AACrH,SAAK,SAAS;AACd,WAAO,KAAK,UAAU,MAAM;AAAA,EAChC;AAAA;AAAA,EAEA,QAAQ,KAAK;AACT,QAAI,CAAC,KAAK;AACN,aAAO,CAAC,KAAK,MAAM,UAAU,QACvB,KAAK,MAAM,KAAK,MAAM,QAAQ,IAAI,OAC9B,KAAK,MAAM,QAAQ,UAAU,KAAK,MAAM,QAAQ,KAAK,KAAK,GAAG,GAAuB,KAAK,IAAI,CAAC;AAC5G,QAAI,EAAE,OAAO,IAAI,KAAK,QAAQ,IAAI,KAAK,MAAM,SAAS;AACtD,QAAI,MAAM,GAAG;AACT,UAAI,cAAc,IAAI,IAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AAC9C,UAAI,KAAK,SAAS;AACd,eAAO,KAAK,SAAS,OAAO;AAAA,UAAU;AAAA,UAAa,KAAK;AAAA,UAAO;AAAA,UAAI;AAAA,UAAG;AAAA;AAAA,QAAqB,CAAC;AAAA,IACpG,OACK;AACD,UAAI,QAAQ,OAAO,OAAO,KAAK,QAAQ,CAAC;AACxC,UAAI,SAAS,IAAI,IAAI,OAAO,OAAO,SAAS,OAAO,OAAO,KAAK,MAAM,CAAC,IAAI,CAAC;AACvE,eAAO,KAAK,SAAS,KAAK;AAAA,IAClC;AACA,WAAO,IAAI,IAAI,KAAK,MAAM,KAAK,OAAO,OAAO,UAAU,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG,GAAuB,KAAK,IAAI,CAAC,IAAI;AAAA,EACjI;AAAA;AAAA,EAEA,cAAc;AAAE,WAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA;AAAA,EAExC,cAAc;AAAE,WAAO,KAAK,QAAQ,EAAE;AAAA,EAAG;AAAA,EACzC,WAAW,KAAK;AACZ,QAAI,OAAO,QAAQ,EAAE,OAAO,IAAI;AAChC,QAAI,QAAQ;AACR,UAAI,MAAM,GAAG;AACT,YAAI,KAAK,QAAQ,OAAO,OAAO,OAAO;AAClC,iBAAO;AAAA,MACf,OACK;AACD,iBAAS,IAAI,GAAG,IAAI,KAAK,OAAO;AAC5B,cAAI,OAAO,OAAO,OAAO,IAAI,CAAC,IAAI,KAAK;AACnC,mBAAO;AAAA,MACnB;AACA,OAAC,EAAE,OAAO,OAAO,IAAI;AAAA,IACzB,OACK;AACD,OAAC,EAAE,OAAO,SAAS,OAAO,IAAI,KAAK;AAAA,IACvC;AACA,WAAO,QAAQ,EAAE,OAAO,SAAS,OAAO,IAAI,QAAQ;AAChD,UAAI,QAAQ;AACR,iBAAS,IAAI,QAAQ,KAAK,IAAI,MAAM,IAAI,KAAK,OAAO,MAAM,SAAS,QAAQ,KAAK,GAAG,KAAK,KAAK;AACzF,cAAI,QAAQ,OAAO,MAAM,SAAS,CAAC;AACnC,cAAK,KAAK,OAAO,SAAS,oBACtB,iBAAiB,cACjB,CAAC,MAAM,KAAK,eACZ,SAAS,KAAK;AACd,mBAAO;AAAA,QACf;AAAA,IACR;AACA,WAAO;AAAA,EACX;AAAA,EACA,KAAK,KAAK,OAAO;AACb,QAAI,SAAS,KAAK;AAAA,MAAW;AAAA,MAAK;AAAA,MAAG;AAAA;AAAA,IAAqB;AACtD,aAAO;AACX,eAAS;AACL,UAAI,KAAK,QAAQ,GAAG;AAChB,eAAO;AACX,UAAI,KAAK,WAAW,GAAG,KAAK,CAAC,KAAK,OAAO;AACrC,eAAO;AAAA,IACf;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,KAAK,QAAQ,MAAM;AAAE,WAAO,KAAK,KAAK,GAAG,KAAK;AAAA,EAAG;AAAA;AAAA;AAAA;AAAA;AAAA,EAKjD,KAAK,QAAQ,MAAM;AAAE,WAAO,KAAK,KAAK,IAAI,KAAK;AAAA,EAAG;AAAA;AAAA;AAAA;AAAA,EAIlD,OAAO,KAAK,OAAO,GAAG;AAElB,WAAO,KAAK,QAAQ,KAAK,OACpB,OAAO,IAAI,KAAK,QAAQ,MAAM,KAAK,OAAO,SAC1C,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK;AACxC,UAAI,CAAC,KAAK,OAAO;AACb;AAER,WAAO,KAAK,WAAW,GAAG,KAAK,IAAI,GAAG;AAAA,IAAE;AACxC,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAGA,IAAI,OAAO;AACP,QAAI,CAAC,KAAK;AACN,aAAO,KAAK;AAChB,QAAI,QAAQ,KAAK,YAAY,SAAS,MAAM,QAAQ;AACpD,QAAI,SAAS,MAAM,WAAW,KAAK,QAAQ;AACvC;AAAM,iBAAS,QAAQ,KAAK,OAAO,IAAI,KAAK,MAAM,QAAQ,KAAK,KAAI;AAC/D,mBAAS,IAAI,OAAO,GAAG,IAAI,EAAE;AACzB,gBAAI,EAAE,SAAS,OAAO;AAClB,kBAAI,SAAS,KAAK;AACd,uBAAO;AACX,uBAAS;AACT,sBAAQ,IAAI;AACZ,oBAAM;AAAA,YACV;AACJ,kBAAQ,KAAK,MAAM,EAAE,CAAC;AAAA,QAC1B;AAAA,IACJ;AACA,aAAS,IAAI,OAAO,IAAI,KAAK,MAAM,QAAQ;AACvC,eAAS,IAAI,WAAW,KAAK,QAAQ,QAAQ,KAAK,MAAM,CAAC,CAAC;AAC9D,WAAO,KAAK,aAAa,IAAI,WAAW,KAAK,QAAQ,QAAQ,KAAK,KAAK;AAAA,EAC3E;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,OAAO;AACP,WAAO,KAAK,SAAS,OAAO,KAAK,MAAM;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,OAAO,OAAO;AAClB,aAAS,QAAQ,OAAK;AAClB,UAAI,YAAY;AAChB,UAAI,KAAK,KAAK,eAAe,MAAM,IAAI,MAAM,OAAO;AAChD,YAAI,KAAK,WAAW,GAAG;AACnB;AACA;AAAA,QACJ;AACA,YAAI,CAAC,KAAK,KAAK;AACX,sBAAY;AAAA,MACpB;AACA,iBAAS;AACL,YAAI,aAAa;AACb,gBAAM,IAAI;AACd,oBAAY,KAAK,KAAK;AACtB,YAAI,KAAK,YAAY;AACjB;AACJ,YAAI,CAAC;AACD;AACJ,aAAK,OAAO;AACZ;AACA,oBAAY;AAAA,MAChB;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAIA,aAAa,SAAS;AAClB,QAAI,CAAC,KAAK;AACN,aAAO,iBAAiB,KAAK,MAAM,OAAO;AAC9C,QAAI,EAAE,OAAO,IAAI,KAAK,QAAQ,EAAE,MAAM,IAAI,OAAO;AACjD,aAAS,IAAI,QAAQ,SAAS,GAAG,IAAI,KAAK,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AACrE,UAAI,IAAI;AACJ,eAAO,iBAAiB,KAAK,MAAM,SAAS,CAAC;AACjD,UAAI,OAAO,MAAM,OAAO,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC;AAC7C,UAAI,CAAC,KAAK,aAAa;AACnB,YAAI,QAAQ,CAAC,KAAK,QAAQ,CAAC,KAAK,KAAK;AACjC,iBAAO;AACX;AAAA,MACJ;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ;AACA,SAAS,SAAS,MAAM;AACpB,SAAO,KAAK,SAAS,KAAK,QAAM,cAAc,cAAc,CAAC,GAAG,KAAK,eAAe,SAAS,EAAE,CAAC;AACpG;AACA,SAAS,UAAU,MAAM;AACrB,MAAI;AACJ,MAAI,EAAE,QAAQ,SAAS,kBAAkB,qBAAqB,SAAS,CAAC,GAAG,gBAAgB,QAAQ,MAAM,OAAO,IAAI;AACpH,MAAI,SAAS,MAAM,QAAQ,MAAM,IAAI,IAAI,iBAAiB,QAAQ,OAAO,MAAM,IAAI;AACnF,MAAI,QAAQ,QAAQ;AACpB,MAAI,cAAc,GAAG,YAAY;AACjC,WAAS,SAAS,aAAa,QAAQC,WAAUC,YAAW,UAAU;AAClE,QAAI,EAAE,IAAI,OAAO,KAAK,KAAK,IAAI;AAC/B,QAAI,mBAAmB;AACvB,WAAO,OAAO,GAAG;AACb,aAAO,KAAK;AACZ,UAAI,QAAQ,IAA8B;AACtC,YAAIC,QAAO,OAAO,EAAE;AACpB,QAAAF,UAAS,KAAKE,KAAI;AAClB,QAAAD,WAAU,KAAK,QAAQ,WAAW;AAClC;AAAA,MACJ,WACS,QAAQ,IAAsC;AACnD,sBAAc;AACd;AAAA,MACJ,WACS,QAAQ,IAAkC;AAC/C,oBAAY;AACZ;AAAA,MACJ,OACK;AACD,cAAM,IAAI,WAAW,6BAA6B,IAAI,EAAE;AAAA,MAC5D;AAAA,IACJ;AACA,QAAI,OAAO,MAAM,EAAE,GAAG,MAAME;AAC5B,QAAI,WAAW,QAAQ;AACvB,QAAI,MAAM,SAAS,oBAAoBA,UAAS,eAAe,OAAO,MAAM,QAAQ,QAAQ,IAAI;AAE5F,UAAIC,QAAO,IAAI,YAAYD,QAAO,OAAOA,QAAO,IAAI;AACpD,UAAI,SAAS,OAAO,MAAMA,QAAO,MAAM,QAAQC,MAAK;AACpD,aAAO,OAAO,MAAM;AAChB,gBAAQ,aAAaD,QAAO,OAAOC,OAAM,KAAK;AAClD,aAAO,IAAI,WAAWA,OAAM,MAAMD,QAAO,OAAO,OAAO;AACvD,iBAAWA,QAAO,QAAQ;AAAA,IAC9B,OACK;AACD,UAAI,SAAS,OAAO,MAAM;AAC1B,aAAO,KAAK;AACZ,UAAI,gBAAgB,CAAC,GAAG,iBAAiB,CAAC;AAC1C,UAAI,gBAAgB,MAAM,gBAAgB,KAAK;AAC/C,UAAI,YAAY,GAAG,UAAU;AAC7B,aAAO,OAAO,MAAM,QAAQ;AACxB,YAAI,iBAAiB,KAAK,OAAO,MAAM,iBAAiB,OAAO,QAAQ,GAAG;AACtE,cAAI,OAAO,OAAO,UAAU,iBAAiB;AACzC,2BAAe,eAAe,gBAAgB,OAAO,WAAW,OAAO,KAAK,SAAS,eAAe,gBAAgB;AACpH,wBAAY,cAAc;AAC1B,sBAAU,OAAO;AAAA,UACrB;AACA,iBAAO,KAAK;AAAA,QAChB,OACK;AACD,mBAAS,OAAO,QAAQ,eAAe,gBAAgB,aAAa;AAAA,QACxE;AAAA,MACJ;AACA,UAAI,iBAAiB,KAAK,YAAY,KAAK,YAAY,cAAc;AACjE,uBAAe,eAAe,gBAAgB,OAAO,WAAW,OAAO,SAAS,eAAe,gBAAgB;AACnH,oBAAc,QAAQ;AACtB,qBAAe,QAAQ;AACvB,UAAI,gBAAgB,MAAM,YAAY,GAAG;AACrC,YAAI,OAAO,aAAa,IAAI;AAC5B,eAAO,aAAa,MAAM,eAAe,gBAAgB,GAAG,cAAc,QAAQ,GAAG,MAAM,OAAO,MAAM,IAAI;AAAA,MAChH,OACK;AACD,eAAO,SAAS,MAAM,eAAe,gBAAgB,MAAM,OAAO,mBAAmB,GAAG;AAAA,MAC5F;AAAA,IACJ;AACA,IAAAH,UAAS,KAAK,IAAI;AAClB,IAAAC,WAAU,KAAK,QAAQ;AAAA,EAC3B;AACA,WAAS,aAAa,MAAM;AACxB,WAAO,CAACD,WAAUC,YAAWH,YAAW;AACpC,UAAIO,aAAY,GAAG,QAAQL,UAAS,SAAS,GAAGD,OAAM;AACtD,UAAI,SAAS,MAAMA,QAAOC,UAAS,KAAK,cAAc,MAAM;AACxD,YAAI,CAAC,SAASD,MAAK,QAAQ,QAAQA,MAAK,UAAUD;AAC9C,iBAAOC;AACX,YAAI,gBAAgBA,MAAK,KAAK,SAAS,SAAS;AAC5C,UAAAM,aAAYJ,WAAU,KAAK,IAAIF,MAAK,SAAS;AAAA,MACrD;AACA,aAAO,SAAS,MAAMC,WAAUC,YAAWH,SAAQO,UAAS;AAAA,IAChE;AAAA,EACJ;AACA,WAAS,eAAeL,WAAUC,YAAW,MAAM,GAAG,MAAM,IAAI,MAAMI,YAAW;AAC7E,QAAI,gBAAgB,CAAC,GAAG,iBAAiB,CAAC;AAC1C,WAAOL,UAAS,SAAS,GAAG;AACxB,oBAAc,KAAKA,UAAS,IAAI,CAAC;AACjC,qBAAe,KAAKC,WAAU,IAAI,IAAI,OAAO,IAAI;AAAA,IACrD;AACA,IAAAD,UAAS,KAAK,SAAS,QAAQ,MAAM,IAAI,GAAG,eAAe,gBAAgB,KAAK,MAAMK,aAAY,EAAE,CAAC;AACrG,IAAAJ,WAAU,KAAK,OAAO,IAAI;AAAA,EAC9B;AACA,WAAS,SAAS,MAAMD,WAAUC,YAAWH,SAAQO,aAAY,GAAG,OAAO;AACvE,QAAI,aAAa;AACb,UAAIC,QAAO,CAAC,SAAS,aAAa,WAAW;AAC7C,cAAQ,QAAQ,CAACA,KAAI,EAAE,OAAO,KAAK,IAAI,CAACA,KAAI;AAAA,IAChD;AACA,QAAID,aAAY,IAAI;AAChB,UAAIC,QAAO,CAAC,SAAS,WAAWD,UAAS;AACzC,cAAQ,QAAQ,CAACC,KAAI,EAAE,OAAO,KAAK,IAAI,CAACA,KAAI;AAAA,IAChD;AACA,WAAO,IAAI,KAAK,MAAMN,WAAUC,YAAWH,SAAQ,KAAK;AAAA,EAC5D;AACA,WAAS,eAAe,SAAS,UAAU;AAOvC,QAAI,OAAO,OAAO,KAAK;AACvB,QAAI,OAAO,GAAG,QAAQ,GAAG,OAAO,GAAG,WAAW,KAAK,MAAM;AACzD,QAAI,SAAS,EAAE,MAAM,GAAG,OAAO,GAAG,MAAM,EAAE;AAC1C;AAAM,eAAS,SAAS,KAAK,MAAM,SAAS,KAAK,MAAM,UAAS;AAC5D,YAAIS,YAAW,KAAK;AAEpB,YAAI,KAAK,MAAM,YAAYA,aAAY,GAAG;AAGtC,iBAAO,OAAO;AACd,iBAAO,QAAQ;AACf,iBAAO,OAAO;AACd,kBAAQ;AACR,kBAAQ;AACR,eAAK,KAAK;AACV;AAAA,QACJ;AACA,YAAI,WAAW,KAAK,MAAMA;AAC1B,YAAIA,YAAW,KAAK,WAAW,UAAU,KAAK,QAAQ;AAClD;AACJ,YAAI,eAAe,KAAK,MAAM,gBAAgB,IAAI;AAClD,YAAI,YAAY,KAAK;AACrB,aAAK,KAAK;AACV,eAAO,KAAK,MAAM,UAAU;AACxB,cAAI,KAAK,OAAO,GAAG;AACf,gBAAI,KAAK,QAAQ;AACb,8BAAgB;AAAA;AAEhB,oBAAM;AAAA,UACd,WACS,KAAK,MAAM,eAAe;AAC/B,4BAAgB;AAAA,UACpB;AACA,eAAK,KAAK;AAAA,QACd;AACA,gBAAQ;AACR,gBAAQA;AACR,gBAAQ;AAAA,MACZ;AACA,QAAI,WAAW,KAAK,QAAQ,SAAS;AACjC,aAAO,OAAO;AACd,aAAO,QAAQ;AACf,aAAO,OAAO;AAAA,IAClB;AACA,WAAO,OAAO,OAAO,IAAI,SAAS;AAAA,EACtC;AACA,WAAS,aAAa,aAAaJ,SAAQ,OAAO;AAC9C,QAAI,EAAE,IAAI,OAAO,KAAK,KAAK,IAAI;AAC/B,WAAO,KAAK;AACZ,QAAI,QAAQ,KAAK,KAAK,eAAe;AACjC,UAAI,aAAa;AACjB,UAAI,OAAO,GAAG;AACV,YAAI,SAAS,OAAO,OAAO,OAAO;AAClC,eAAO,OAAO,MAAM;AAChB,kBAAQ,aAAa,aAAaA,SAAQ,KAAK;AAAA,MACvD;AACA,MAAAA,QAAO,EAAE,KAAK,IAAI;AAClB,MAAAA,QAAO,EAAE,KAAK,IAAI,MAAM;AACxB,MAAAA,QAAO,EAAE,KAAK,IAAI,QAAQ;AAC1B,MAAAA,QAAO,EAAE,KAAK,IAAI;AAAA,IACtB,WACS,QAAQ,IAAsC;AACnD,oBAAc;AAAA,IAClB,WACS,QAAQ,IAAkC;AAC/C,kBAAY;AAAA,IAChB;AACA,WAAO;AAAA,EACX;AACA,MAAI,WAAW,CAAC,GAAG,YAAY,CAAC;AAChC,SAAO,OAAO,MAAM;AAChB,aAAS,KAAK,SAAS,GAAG,KAAK,eAAe,GAAG,UAAU,WAAW,EAAE;AAC5E,MAAIL,WAAU,KAAK,KAAK,YAAY,QAAQ,OAAO,SAAS,KAAM,SAAS,SAAS,UAAU,CAAC,IAAI,SAAS,CAAC,EAAE,SAAS;AACxH,SAAO,IAAI,KAAK,MAAM,KAAK,KAAK,GAAG,SAAS,QAAQ,GAAG,UAAU,QAAQ,GAAGA,OAAM;AACtF;AACA,IAAM,gBAAgB,oBAAI;AAC1B,SAAS,SAAS,aAAa,MAAM;AACjC,MAAI,CAAC,YAAY,eAAe,gBAAgB,cAAc,KAAK,QAAQ;AACvE,WAAO;AACX,MAAI,OAAO,cAAc,IAAI,IAAI;AACjC,MAAI,QAAQ,MAAM;AACd,WAAO;AACP,aAAS,SAAS,KAAK,UAAU;AAC7B,UAAI,MAAM,QAAQ,eAAe,EAAE,iBAAiB,OAAO;AACvD,eAAO;AACP;AAAA,MACJ;AACA,cAAQ,SAAS,aAAa,KAAK;AAAA,IACvC;AACA,kBAAc,IAAI,MAAM,IAAI;AAAA,EAChC;AACA,SAAO;AACX;AACA,SAAS,aAET,aAEA,UAAU,WAEV,MAAM,IAEN,OAEAA,SAEA,OAEA,QAAQ;AACJ,MAAI,QAAQ;AACZ,WAAS,IAAI,MAAM,IAAI,IAAI;AACvB,aAAS,SAAS,aAAa,SAAS,CAAC,CAAC;AAC9C,MAAI,WAAW,KAAK;AAAA,IAAM,QAAQ,MAAO;AAAA;AAAA,EAA4B;AACrE,MAAI,gBAAgB,CAAC,GAAG,iBAAiB,CAAC;AAC1C,WAAS,OAAOE,WAAUC,YAAWO,OAAMC,KAAI,QAAQ;AACnD,aAAS,IAAID,OAAM,IAAIC,OAAK;AACxB,UAAI,YAAY,GAAG,aAAaR,WAAU,CAAC,GAAG,YAAY,SAAS,aAAaD,UAAS,CAAC,CAAC;AAC3F;AACA,aAAO,IAAIS,KAAI,KAAK;AAChB,YAAI,WAAW,SAAS,aAAaT,UAAS,CAAC,CAAC;AAChD,YAAI,YAAY,YAAY;AACxB;AACJ,qBAAa;AAAA,MACjB;AACA,UAAI,KAAK,YAAY,GAAG;AACpB,YAAI,YAAY,UAAU;AACtB,cAAI,OAAOA,UAAS,SAAS;AAC7B,iBAAO,KAAK,UAAU,KAAK,WAAW,GAAG,KAAK,SAAS,QAAQC,WAAU,SAAS,IAAI,MAAM;AAC5F;AAAA,QACJ;AACA,sBAAc,KAAKD,UAAS,SAAS,CAAC;AAAA,MAC1C,OACK;AACD,YAAIF,UAASG,WAAU,IAAI,CAAC,IAAID,UAAS,IAAI,CAAC,EAAE,SAAS;AACzD,sBAAc,KAAK,aAAa,aAAaA,WAAUC,YAAW,WAAW,GAAG,YAAYH,SAAQ,MAAM,MAAM,CAAC;AAAA,MACrH;AACA,qBAAe,KAAK,aAAa,SAAS,KAAK;AAAA,IACnD;AAAA,EACJ;AACA,SAAO,UAAU,WAAW,MAAM,IAAI,CAAC;AACvC,UAAQ,SAAS,QAAQ,eAAe,gBAAgBA,OAAM;AAClE;AAkIA,IAAM,SAAN,MAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAST,WAAW,OAAO,WAAW,QAAQ;AACjC,QAAI,OAAO,SAAS;AAChB,cAAQ,IAAI,YAAY,KAAK;AACjC,aAAS,CAAC,SAAS,CAAC,IAAI,MAAM,GAAG,MAAM,MAAM,CAAC,IAAI,OAAO,SAAS,OAAO,IAAI,OAAK,IAAI,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC;AAC7H,WAAO,KAAK,YAAY,OAAO,aAAa,CAAC,GAAG,MAAM;AAAA,EAC1D;AAAA;AAAA,EAEA,MAAM,OAAO,WAAW,QAAQ;AAC5B,QAAI,QAAQ,KAAK,WAAW,OAAO,WAAW,MAAM;AACpD,eAAS;AACL,UAAI,OAAO,MAAM,QAAQ;AACzB,UAAI;AACA,eAAO;AAAA,IACf;AAAA,EACJ;AACJ;AACA,IAAM,cAAN,MAAkB;AAAA,EACd,YAAY,QAAQ;AAChB,SAAK,SAAS;AAAA,EAClB;AAAA,EACA,IAAI,SAAS;AAAE,WAAO,KAAK,OAAO;AAAA,EAAQ;AAAA,EAC1C,MAAM,MAAM;AAAE,WAAO,KAAK,OAAO,MAAM,IAAI;AAAA,EAAG;AAAA,EAC9C,IAAI,aAAa;AAAE,WAAO;AAAA,EAAO;AAAA,EACjC,KAAK,MAAM,IAAI;AAAE,WAAO,KAAK,OAAO,MAAM,MAAM,EAAE;AAAA,EAAG;AACzD;AAkCA,IAAM,eAAe,IAAI,SAAS,EAAE,SAAS,KAAK,CAAC;;;AC56CnD,IAAM,QAAN,MAAM,OAAM;AAAA;AAAA,EAER,YAEA,GAGA,OAEA,OAMA,WAEA,KAIA,OAKA,QAOA,YAEA,YAEA,YAAY,GAMZ,QAAQ;AACJ,SAAK,IAAI;AACT,SAAK,QAAQ;AACb,SAAK,QAAQ;AACb,SAAK,YAAY;AACjB,SAAK,MAAM;AACX,SAAK,QAAQ;AACb,SAAK,SAAS;AACd,SAAK,aAAa;AAClB,SAAK,aAAa;AAClB,SAAK,YAAY;AACjB,SAAK,SAAS;AAAA,EAClB;AAAA;AAAA,EAEA,WAAW;AACP,WAAO,IAAI,KAAK,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,KAAK,CAAC,EAAE,OAAO,KAAK,KAAK,CAAC,KAAK,KAAK,GAAG,GAAG,KAAK,QAAQ,MAAM,KAAK,QAAQ,EAAE;AAAA,EAC3H;AAAA;AAAA;AAAA,EAGA,OAAO,MAAM,GAAG,OAAO,MAAM,GAAG;AAC5B,QAAI,KAAK,EAAE,OAAO;AAClB,WAAO,IAAI,OAAM,GAAG,CAAC,GAAG,OAAO,KAAK,KAAK,GAAG,CAAC,GAAG,GAAG,KAAK,IAAI,aAAa,IAAI,GAAG,KAAK,IAAI,MAAM,GAAG,IAAI;AAAA,EAC1G;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,UAAU;AAAE,WAAO,KAAK,aAAa,KAAK,WAAW,UAAU;AAAA,EAAM;AAAA;AAAA;AAAA;AAAA,EAIzE,UAAU,OAAO,OAAO;AACpB,SAAK,MAAM,KAAK,KAAK,OAAO,OAAO,KAAK,aAAa,KAAK,OAAO,MAAM;AACvE,SAAK,QAAQ;AAAA,EACjB;AAAA;AAAA;AAAA,EAGA,OAAO,QAAQ;AACX,QAAI;AACJ,QAAI,QAAQ,UAAU,IAAkC,OAAO,SAAS;AACxE,QAAI,EAAE,QAAAY,QAAO,IAAI,KAAK;AACtB,QAAI,QAAQA,QAAO,kBAAkB,IAAI;AACzC,QAAI;AACA,WAAK,SAAS;AAClB,QAAI,SAAS,GAAG;AACZ,WAAK,UAAUA,QAAO,QAAQ,KAAK,OAAO,MAAM,IAAI,GAAG,KAAK,SAAS;AAGrE,UAAI,OAAOA,QAAO;AACd,aAAK,UAAU,MAAM,KAAK,WAAW,KAAK,WAAW,GAAG,IAAI;AAChE,WAAK,cAAc,MAAM,KAAK,SAAS;AACvC;AAAA,IACJ;AAMA,QAAI,OAAO,KAAK,MAAM,UAAW,QAAQ,KAAK,KAAM,SAAS,SAA+B,IAAI;AAChG,QAAI,QAAQ,OAAO,KAAK,MAAM,OAAO,CAAC,IAAI,KAAK,EAAE,OAAO,CAAC,EAAE,MAAM,OAAO,KAAK,YAAY;AAIzF,QAAI,QAAQ,OAAsC,GAAG,KAAK,KAAK,EAAE,OAAO,QAAQ,MAAM,IAAI,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,cAAc;AAC/I,UAAI,SAAS,KAAK,EAAE,uBAAuB;AACvC,aAAK,EAAE;AACP,aAAK,EAAE,uBAAuB;AAAA,MAClC,WACS,KAAK,EAAE,uBAAuB,MAAM;AACzC,aAAK,EAAE,oBAAoB;AAC3B,aAAK,EAAE,wBAAwB;AAC/B,aAAK,EAAE,uBAAuB;AAAA,MAClC;AAAA,IACJ;AACA,QAAI,aAAa,OAAO,KAAK,MAAM,OAAO,CAAC,IAAI,GAAG,QAAQ,KAAK,aAAa,KAAK,OAAO,SAAS;AAEjG,QAAI,OAAOA,QAAO,iBAAkB,SAAS,QAAiC;AAC1E,UAAI,MAAMA,QAAO;AAAA,QAAU,KAAK;AAAA,QAAO;AAAA;AAAA,MAAyB,IAAI,KAAK,MAAM,KAAK;AACpF,WAAK,UAAU,MAAM,OAAO,KAAK,QAAQ,GAAG,IAAI;AAAA,IACpD;AACA,QAAI,SAAS,QAA8B;AACvC,WAAK,QAAQ,KAAK,MAAM,IAAI;AAAA,IAChC,OACK;AACD,UAAI,cAAc,KAAK,MAAM,OAAO,CAAC;AACrC,WAAK,QAAQA,QAAO,QAAQ,aAAa,MAAM,IAAI;AAAA,IACvD;AACA,WAAO,KAAK,MAAM,SAAS;AACvB,WAAK,MAAM,IAAI;AACnB,SAAK,cAAc,MAAM,KAAK;AAAA,EAClC;AAAA;AAAA;AAAA,EAGA,UAAU,MAAM,OAAO,KAAK,OAAO,GAAG,WAAW,OAAO;AACpD,QAAI,QAAQ,MACP,CAAC,KAAK,MAAM,UAAU,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC,IAAI,KAAK,OAAO,SAAS,KAAK,aAAa;AAElG,UAAI,MAAM,MAAM,MAAM,KAAK,OAAO;AAClC,UAAI,OAAO,KAAK,IAAI,QAAQ;AACxB,cAAM,IAAI,aAAa,IAAI,OAAO;AAClC,cAAM,IAAI;AAAA,MACd;AACA,UAAI,MAAM,KAAK,IAAI,OAAO,MAAM,CAAC,KAAK,KAAoB,IAAI,OAAO,MAAM,CAAC,IAAI,IAAI;AAChF,YAAI,SAAS;AACT;AACJ,YAAI,IAAI,OAAO,MAAM,CAAC,KAAK,OAAO;AAC9B,cAAI,OAAO,MAAM,CAAC,IAAI;AACtB;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,CAAC,YAAY,KAAK,OAAO,KAAK;AAC9B,WAAK,OAAO,KAAK,MAAM,OAAO,KAAK,IAAI;AAAA,IAC3C,OACK;AACD,UAAI,QAAQ,KAAK,OAAO;AACxB,UAAI,QAAQ,KAAK,KAAK,OAAO,QAAQ,CAAC,KAAK;AACvC,eAAO,QAAQ,KAAK,KAAK,OAAO,QAAQ,CAAC,IAAI,KAAK;AAE9C,eAAK,OAAO,KAAK,IAAI,KAAK,OAAO,QAAQ,CAAC;AAC1C,eAAK,OAAO,QAAQ,CAAC,IAAI,KAAK,OAAO,QAAQ,CAAC;AAC9C,eAAK,OAAO,QAAQ,CAAC,IAAI,KAAK,OAAO,QAAQ,CAAC;AAC9C,eAAK,OAAO,QAAQ,CAAC,IAAI,KAAK,OAAO,QAAQ,CAAC;AAC9C,mBAAS;AACT,cAAI,OAAO;AACP,oBAAQ;AAAA,QAChB;AACJ,WAAK,OAAO,KAAK,IAAI;AACrB,WAAK,OAAO,QAAQ,CAAC,IAAI;AACzB,WAAK,OAAO,QAAQ,CAAC,IAAI;AACzB,WAAK,OAAO,QAAQ,CAAC,IAAI;AAAA,IAC7B;AAAA,EACJ;AAAA;AAAA;AAAA,EAGA,MAAM,QAAQ,MAAM,SAAS;AACzB,QAAI,QAAQ,KAAK;AACjB,QAAI,SAAS,QAA8B;AACvC,WAAK,UAAU,SAAS,OAA8B,KAAK,GAAG;AAAA,IAClE,YACU,SAAS,WAAiC,GAAG;AACnD,UAAI,YAAY,QAAQ,EAAE,QAAAA,QAAO,IAAI,KAAK;AAC1C,UAAI,UAAU,KAAK,OAAO,QAAQA,QAAO,SAAS;AAC9C,aAAK,MAAM;AACX,YAAI,CAACA,QAAO;AAAA,UAAU;AAAA,UAAW;AAAA;AAAA,QAAyB;AACtD,eAAK,YAAY;AAAA,MACzB;AACA,WAAK,UAAU,WAAW,KAAK;AAC/B,WAAK,aAAa,MAAM,KAAK;AAC7B,UAAI,QAAQA,QAAO;AACf,aAAK,OAAO,KAAK,MAAM,OAAO,SAAS,CAAC;AAAA,IAChD,OACK;AACD,WAAK,MAAM;AACX,WAAK,aAAa,MAAM,KAAK;AAC7B,UAAI,QAAQ,KAAK,EAAE,OAAO;AACtB,aAAK,OAAO,KAAK,MAAM,OAAO,SAAS,CAAC;AAAA,IAChD;AAAA,EACJ;AAAA;AAAA;AAAA,EAGA,MAAM,QAAQ,MAAM,SAAS;AACzB,QAAI,SAAS;AACT,WAAK,OAAO,MAAM;AAAA;AAElB,WAAK,MAAM,QAAQ,MAAM,OAAO;AAAA,EACxC;AAAA;AAAA;AAAA,EAGA,QAAQ,OAAO,MAAM;AACjB,QAAI,QAAQ,KAAK,EAAE,OAAO,SAAS;AACnC,QAAI,QAAQ,KAAK,KAAK,EAAE,OAAO,KAAK,KAAK,OAAO;AAC5C,WAAK,EAAE,OAAO,KAAK,KAAK;AACxB;AAAA,IACJ;AACA,QAAI,QAAQ,KAAK;AACjB,SAAK,YAAY,KAAK,MAAM,QAAQ,MAAM;AAC1C,SAAK,UAAU,MAAM,KAAK;AAC1B,SAAK,OAAO;AAAA,MAAK;AAAA,MAAO;AAAA,MAAO,KAAK;AAAA,MAAW;AAAA;AAAA,IAAgD;AAC/F,QAAI,KAAK;AACL,WAAK,cAAc,KAAK,WAAW,QAAQ,MAAM,KAAK,WAAW,SAAS,OAAO,MAAM,KAAK,EAAE,OAAO,MAAM,KAAK,MAAM,MAAM,MAAM,CAAC,CAAC;AAAA,EAC5I;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ;AACJ,QAAI,SAAS;AACb,QAAI,MAAM,OAAO,OAAO;AAKxB,WAAO,MAAM,KAAK,OAAO,OAAO,MAAM,CAAC,IAAI,OAAO;AAC9C,aAAO;AACX,QAAI,SAAS,OAAO,OAAO,MAAM,GAAG,GAAG,OAAO,OAAO,aAAa;AAElE,WAAO,UAAU,QAAQ,OAAO;AAC5B,eAAS,OAAO;AACpB,WAAO,IAAI,OAAM,KAAK,GAAG,KAAK,MAAM,MAAM,GAAG,KAAK,OAAO,KAAK,WAAW,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,KAAK,YAAY,KAAK,WAAW,MAAM;AAAA,EACxJ;AAAA;AAAA;AAAA,EAGA,gBAAgB,MAAM,SAAS;AAC3B,QAAI,SAAS,QAAQ,KAAK,EAAE,OAAO;AACnC,QAAI;AACA,WAAK,UAAU,MAAM,KAAK,KAAK,SAAS,CAAC;AAC7C,SAAK,UAAU,GAAkB,KAAK,KAAK,SAAS,SAAS,IAAI,CAAC;AAClE,SAAK,MAAM,KAAK,YAAY;AAC5B,SAAK,SAAS;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,MAAM;AACX,aAAS,MAAM,IAAI,eAAe,IAAI,OAAK;AACvC,UAAI,SAAS,KAAK,EAAE,OAAO;AAAA,QAAU,IAAI;AAAA,QAAO;AAAA;AAAA,MAAgC,KAAK,KAAK,EAAE,OAAO,UAAU,IAAI,OAAO,IAAI;AAC5H,UAAI,UAAU;AACV,eAAO;AACX,WAAK,SAAS,UAAkC;AAC5C,eAAO;AACX,UAAI,OAAO,MAAM;AAAA,IACrB;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAIA,gBAAgB,MAAM;AAClB,QAAI,KAAK,MAAM,UAAU;AACrB,aAAO,CAAC;AACZ,QAAI,aAAa,KAAK,EAAE,OAAO,WAAW,KAAK,KAAK;AACpD,QAAI,WAAW,SAAS,KAA2B,KAAK,KAAK,MAAM,UAAU,KAA0C;AACnH,UAAI,OAAO,CAAC;AACZ,eAAS,IAAI,GAAG,GAAG,IAAI,WAAW,QAAQ,KAAK,GAAG;AAC9C,aAAK,IAAI,WAAW,IAAI,CAAC,MAAM,KAAK,SAAS,KAAK,EAAE,OAAO,UAAU,GAAG,IAAI;AACxE,eAAK,KAAK,WAAW,CAAC,GAAG,CAAC;AAAA,MAClC;AACA,UAAI,KAAK,MAAM,SAAS;AACpB,iBAAS,IAAI,GAAG,KAAK,SAAS,KAA2B,KAAK,IAAI,WAAW,QAAQ,KAAK,GAAG;AACzF,cAAI,IAAI,WAAW,IAAI,CAAC;AACxB,cAAI,CAAC,KAAK,KAAK,CAAC,GAAGC,OAAOA,KAAI,KAAM,KAAK,CAAC;AACtC,iBAAK,KAAK,WAAW,CAAC,GAAG,CAAC;AAAA,QAClC;AACJ,mBAAa;AAAA,IACjB;AACA,QAAI,SAAS,CAAC;AACd,aAAS,IAAI,GAAG,IAAI,WAAW,UAAU,OAAO,SAAS,GAAyB,KAAK,GAAG;AACtF,UAAI,IAAI,WAAW,IAAI,CAAC;AACxB,UAAI,KAAK,KAAK;AACV;AACJ,UAAI,QAAQ,KAAK,MAAM;AACvB,YAAM,UAAU,GAAG,KAAK,GAAG;AAC3B,YAAM,UAAU,GAAkB,MAAM,KAAK,MAAM,KAAK,GAAG,IAAI;AAC/D,YAAM,aAAa,WAAW,CAAC,GAAG,KAAK,GAAG;AAC1C,YAAM,SAAS;AACf,aAAO,KAAK,KAAK;AAAA,IACrB;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,cAAc;AACV,QAAI,EAAE,QAAAD,QAAO,IAAI,KAAK;AACtB,QAAI,SAASA,QAAO;AAAA,MAAU,KAAK;AAAA,MAAO;AAAA;AAAA,IAA+B;AACzE,SAAK,SAAS,UAAkC;AAC5C,aAAO;AACX,QAAI,CAACA,QAAO,YAAY,KAAK,OAAO,MAAM,GAAG;AACzC,UAAI,QAAQ,UAAU,IAAkC,OAAO,SAAS;AACxE,UAAI,SAAS,KAAK,MAAM,SAAS,QAAQ;AACzC,UAAI,SAAS,KAAKA,QAAO,QAAQ,KAAK,MAAM,MAAM,GAAG,MAAM,KAAK,IAAI,GAAG;AACnE,YAAI,SAAS,KAAK,oBAAoB;AACtC,YAAI,UAAU;AACV,iBAAO;AACX,iBAAS;AAAA,MACb;AACA,WAAK,UAAU,GAAkB,KAAK,KAAK,KAAK,KAAK,GAAG,IAAI;AAC5D,WAAK,SAAS;AAAA,IAClB;AACA,SAAK,YAAY,KAAK;AACtB,SAAK,OAAO,MAAM;AAClB,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,sBAAsB;AAClB,QAAI,EAAE,QAAAA,QAAO,IAAI,KAAK,GAAG,OAAO,CAAC;AACjC,QAAI,UAAU,CAAC,OAAO,UAAU;AAC5B,UAAI,KAAK,SAAS,KAAK;AACnB;AACJ,WAAK,KAAK,KAAK;AACf,aAAOA,QAAO,WAAW,OAAO,CAAC,WAAW;AACxC,YAAI,UAAU,SAA+B;AAA+B;AAAA,iBACnE,SAAS,OAA+B;AAC7C,cAAI,UAAU,UAAU,MAAoC;AAC5D,cAAI,SAAS,GAAG;AACZ,gBAAI,OAAO,SAAS,OAA8B,SAAS,KAAK,MAAM,SAAS,SAAS;AACxF,gBAAI,UAAU,KAAKA,QAAO,QAAQ,KAAK,MAAM,MAAM,GAAG,MAAM,KAAK,KAAK;AAClE,qBAAQ,UAAU,KAAoC,QAAgC;AAAA,UAC9F;AAAA,QACJ,OACK;AACD,cAAI,QAAQ,QAAQ,QAAQ,QAAQ,CAAC;AACrC,cAAI,SAAS;AACT,mBAAO;AAAA,QACf;AAAA,MACJ,CAAC;AAAA,IACL;AACA,WAAO,QAAQ,KAAK,OAAO,CAAC;AAAA,EAChC;AAAA;AAAA,EAEA,WAAW;AACP,WAAO,CAAC,KAAK,EAAE,OAAO;AAAA,MAAU,KAAK;AAAA,MAAO;AAAA;AAAA,IAA2B,GAAG;AACtE,UAAI,CAAC,KAAK,YAAY,GAAG;AACrB,aAAK,UAAU,GAAkB,KAAK,KAAK,KAAK,KAAK,GAAG,IAAI;AAC5D;AAAA,MACJ;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,UAAU;AACV,QAAI,KAAK,MAAM,UAAU;AACrB,aAAO;AACX,QAAI,EAAE,QAAAA,QAAO,IAAI,KAAK;AACtB,WAAOA,QAAO,KAAKA,QAAO;AAAA,MAAU,KAAK;AAAA,MAAO;AAAA;AAAA,IAA0B,CAAC,KAAK,SAC5E,CAACA,QAAO;AAAA,MAAU,KAAK;AAAA,MAAO;AAAA;AAAA,IAAgC;AAAA,EACtE;AAAA;AAAA;AAAA;AAAA,EAIA,UAAU;AACN,SAAK,QAAQ,KAAK,MAAM,CAAC;AACzB,SAAK,MAAM,SAAS;AAAA,EACxB;AAAA;AAAA,EAEA,UAAU,OAAO;AACb,QAAI,KAAK,SAAS,MAAM,SAAS,KAAK,MAAM,UAAU,MAAM,MAAM;AAC9D,aAAO;AACX,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,KAAK;AACxC,UAAI,KAAK,MAAM,CAAC,KAAK,MAAM,MAAM,CAAC;AAC9B,eAAO;AACf,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,IAAI,SAAS;AAAE,WAAO,KAAK,EAAE;AAAA,EAAQ;AAAA;AAAA;AAAA,EAGrC,eAAe,WAAW;AAAE,WAAO,KAAK,EAAE,OAAO,QAAQ,MAAM,SAAS;AAAA,EAAG;AAAA,EAC3E,aAAa,MAAM,OAAO;AACtB,QAAI,KAAK;AACL,WAAK,cAAc,KAAK,WAAW,QAAQ,MAAM,KAAK,WAAW,SAAS,MAAM,MAAM,KAAK,EAAE,OAAO,MAAM,KAAK,CAAC,CAAC;AAAA,EACzH;AAAA,EACA,cAAc,MAAM,OAAO;AACvB,QAAI,KAAK;AACL,WAAK,cAAc,KAAK,WAAW,QAAQ,OAAO,KAAK,WAAW,SAAS,MAAM,MAAM,KAAK,EAAE,OAAO,MAAM,KAAK,CAAC,CAAC;AAAA,EAC1H;AAAA;AAAA,EAEA,cAAc;AACV,QAAIE,QAAO,KAAK,OAAO,SAAS;AAChC,QAAIA,QAAO,KAAK,KAAK,OAAOA,KAAI,KAAK;AACjC,WAAK,OAAO,KAAK,KAAK,WAAW,MAAM,KAAK,KAAK,KAAK,KAAK,EAAE;AAAA,EACrE;AAAA;AAAA,EAEA,gBAAgB;AACZ,QAAIA,QAAO,KAAK,OAAO,SAAS;AAChC,QAAIA,QAAO,KAAK,KAAK,OAAOA,KAAI,KAAK;AACjC,WAAK,OAAO,KAAK,KAAK,WAAW,KAAK,KAAK,KAAK,KAAK,EAAE;AAAA,EAC/D;AAAA,EACA,cAAc,SAAS;AACnB,QAAI,WAAW,KAAK,WAAW,SAAS;AACpC,UAAI,QAAQ,IAAI,aAAa,KAAK,WAAW,SAAS,OAAO;AAC7D,UAAI,MAAM,QAAQ,KAAK,WAAW;AAC9B,aAAK,YAAY;AACrB,WAAK,aAAa;AAAA,IACtB;AAAA,EACJ;AAAA;AAAA,EAEA,aAAa,WAAW;AACpB,QAAI,YAAY,KAAK,WAAW;AAC5B,WAAK,cAAc;AACnB,WAAK,YAAY;AAAA,IACrB;AAAA,EACJ;AAAA;AAAA,EAEA,QAAQ;AACJ,QAAI,KAAK,cAAc,KAAK,WAAW,QAAQ;AAC3C,WAAK,YAAY;AACrB,QAAI,KAAK,YAAY;AACjB,WAAK,cAAc;AAAA,EAC3B;AACJ;AACA,IAAM,eAAN,MAAmB;AAAA,EACf,YAAY,SAAS,SAAS;AAC1B,SAAK,UAAU;AACf,SAAK,UAAU;AACf,SAAK,OAAO,QAAQ,SAAS,QAAQ,KAAK,OAAO,IAAI;AAAA,EACzD;AACJ;AACA,IAAI;AAAA,CACH,SAAUC,UAAS;AAChB,EAAAA,SAAQA,SAAQ,QAAQ,IAAI,GAAG,IAAI;AACnC,EAAAA,SAAQA,SAAQ,QAAQ,IAAI,GAAG,IAAI;AACnC,EAAAA,SAAQA,SAAQ,QAAQ,IAAI,GAAG,IAAI;AACnC,EAAAA,SAAQA,SAAQ,SAAS,IAAI,CAAC,IAAI;AAClC,EAAAA,SAAQA,SAAQ,qBAAqB,IAAI,GAAG,IAAI;AAChD,EAAAA,SAAQA,SAAQ,wBAAwB,IAAI,GAAG,IAAI;AACnD,EAAAA,SAAQA,SAAQ,iBAAiB,IAAI,GAAI,IAAI;AACjD,GAAG,YAAY,UAAU,CAAC,EAAE;AAG5B,IAAM,iBAAN,MAAqB;AAAA,EACjB,YAAY,OAAO;AACf,SAAK,QAAQ;AACb,SAAK,QAAQ,MAAM;AACnB,SAAK,QAAQ,MAAM;AACnB,SAAK,OAAO,KAAK,MAAM;AAAA,EAC3B;AAAA,EACA,OAAO,QAAQ;AACX,QAAI,OAAO,SAAS,OAA8B,QAAQ,UAAU;AACpE,QAAI,SAAS,GAAG;AACZ,UAAI,KAAK,SAAS,KAAK,MAAM;AACzB,aAAK,QAAQ,KAAK,MAAM,MAAM;AAClC,WAAK,MAAM,KAAK,KAAK,OAAO,GAAG,CAAC;AAChC,WAAK,QAAQ;AAAA,IACjB,OACK;AACD,WAAK,SAAS,QAAQ,KAAK;AAAA,IAC/B;AACA,QAAI,OAAO,KAAK,MAAM,EAAE,OAAO,QAAQ,KAAK,MAAM,KAAK,OAAO,CAAC,GAAG,MAAM,IAAI;AAC5E,SAAK,QAAQ;AAAA,EACjB;AACJ;AAGA,IAAM,oBAAN,MAAM,mBAAkB;AAAA,EACpB,YAAY,OAAO,KAAK,OAAO;AAC3B,SAAK,QAAQ;AACb,SAAK,MAAM;AACX,SAAK,QAAQ;AACb,SAAK,SAAS,MAAM;AACpB,QAAI,KAAK,SAAS;AACd,WAAK,UAAU;AAAA,EACvB;AAAA,EACA,OAAO,OAAO,OAAO,MAAM,MAAM,aAAa,MAAM,OAAO,QAAQ;AAC/D,WAAO,IAAI,mBAAkB,OAAO,KAAK,MAAM,MAAM,UAAU;AAAA,EACnE;AAAA,EACA,YAAY;AACR,QAAI,OAAO,KAAK,MAAM;AACtB,QAAI,QAAQ,MAAM;AACd,WAAK,QAAQ,KAAK,MAAM,aAAa,KAAK;AAC1C,WAAK,QAAQ;AACb,WAAK,SAAS,KAAK;AAAA,IACvB;AAAA,EACJ;AAAA,EACA,IAAI,KAAK;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EAC/C,IAAI,QAAQ;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EAClD,IAAI,MAAM;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EAChD,IAAI,OAAO;AAAE,WAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,EAAG;AAAA,EACjD,OAAO;AACH,SAAK,SAAS;AACd,SAAK,OAAO;AACZ,QAAI,KAAK,SAAS;AACd,WAAK,UAAU;AAAA,EACvB;AAAA,EACA,OAAO;AACH,WAAO,IAAI,mBAAkB,KAAK,OAAO,KAAK,KAAK,KAAK,KAAK;AAAA,EACjE;AACJ;AAIA,SAAS,YAAY,OAAO,OAAO,aAAa;AAC5C,MAAI,OAAO,SAAS;AAChB,WAAO;AACX,MAAI,QAAQ;AACZ,WAAS,MAAM,GAAG,MAAM,GAAG,MAAM,MAAM,UAAS;AAC5C,QAAI,QAAQ;AACZ,eAAS;AACL,UAAI,OAAO,MAAM,WAAW,KAAK,GAAG,OAAO;AAC3C,UAAI,QAAQ,KAA6B;AACrC,gBAAQ;AACR;AAAA,MACJ;AACA,UAAI,QAAQ;AACR;AACJ,UAAI,QAAQ;AACR;AACJ,UAAI,QAAQ,OAAO;AACnB,UAAI,SAAS,IAAsB;AAC/B,iBAAS;AACT,eAAO;AAAA,MACX;AACA,eAAS;AACT,UAAI;AACA;AACJ,eAAS;AAAA,IACb;AACA,QAAI;AACA,YAAM,KAAK,IAAI;AAAA;AAEf,cAAQ,IAAI,KAAK,KAAK;AAAA,EAC9B;AACA,SAAO;AACX;AAEA,IAAM,cAAN,MAAkB;AAAA,EACd,cAAc;AACV,SAAK,QAAQ;AACb,SAAK,QAAQ;AACb,SAAK,MAAM;AACX,SAAK,WAAW;AAChB,SAAK,YAAY;AACjB,SAAK,OAAO;AACZ,SAAK,UAAU;AAAA,EACnB;AACJ;AACA,IAAM,YAAY,IAAI;AAKtB,IAAM,cAAN,MAAkB;AAAA;AAAA,EAEd,YAEA,OAEA,QAAQ;AACJ,SAAK,QAAQ;AACb,SAAK,SAAS;AAEd,SAAK,QAAQ;AAEb,SAAK,WAAW;AAEhB,SAAK,SAAS;AACd,SAAK,YAAY;AAGjB,SAAK,OAAO;AAEZ,SAAK,QAAQ;AACb,SAAK,aAAa;AAClB,SAAK,MAAM,KAAK,WAAW,OAAO,CAAC,EAAE;AACrC,SAAK,QAAQ,OAAO,CAAC;AACrB,SAAK,MAAM,OAAO,OAAO,SAAS,CAAC,EAAE;AACrC,SAAK,SAAS;AAAA,EAClB;AAAA;AAAA,EAEA,cAAc,QAAQ,OAAO;AACzB,QAAI,QAAQ,KAAK,OAAO,QAAQ,KAAK;AACrC,QAAI,MAAM,KAAK,MAAM;AACrB,WAAO,MAAM,MAAM,MAAM;AACrB,UAAI,CAAC;AACD,eAAO;AACX,UAAI,OAAO,KAAK,OAAO,EAAE,KAAK;AAC9B,aAAO,MAAM,OAAO,KAAK;AACzB,cAAQ;AAAA,IACZ;AACA,WAAO,QAAQ,IAAI,MAAM,MAAM,KAAK,OAAO,MAAM,IAAI;AACjD,UAAI,SAAS,KAAK,OAAO,SAAS;AAC9B,eAAO;AACX,UAAI,OAAO,KAAK,OAAO,EAAE,KAAK;AAC9B,aAAO,KAAK,OAAO,MAAM;AACzB,cAAQ;AAAA,IACZ;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,QAAQ,KAAK;AACT,QAAI,OAAO,KAAK,MAAM,QAAQ,MAAM,KAAK,MAAM;AAC3C,aAAO;AACX,aAAS,SAAS,KAAK;AACnB,UAAI,MAAM,KAAK;AACX,eAAO,KAAK,IAAI,KAAK,MAAM,IAAI;AACvC,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,KAAK,QAAQ;AACT,QAAI,MAAM,KAAK,WAAW,QAAQ,KAAK;AACvC,QAAI,OAAO,KAAK,MAAM,KAAK,MAAM,QAAQ;AACrC,YAAM,KAAK,MAAM;AACjB,eAAS,KAAK,MAAM,WAAW,GAAG;AAAA,IACtC,OACK;AACD,UAAI,WAAW,KAAK,cAAc,QAAQ,CAAC;AAC3C,UAAI,YAAY;AACZ,eAAO;AACX,YAAM;AACN,UAAI,OAAO,KAAK,aAAa,MAAM,KAAK,YAAY,KAAK,OAAO,QAAQ;AACpE,iBAAS,KAAK,OAAO,WAAW,MAAM,KAAK,SAAS;AAAA,MACxD,OACK;AACD,YAAI,IAAI,KAAK,YAAY,QAAQ,KAAK;AACtC,eAAO,MAAM,MAAM;AACf,kBAAQ,KAAK,OAAO,EAAE,CAAC;AAC3B,aAAK,SAAS,KAAK,MAAM,MAAM,KAAK,YAAY,GAAG;AACnD,YAAI,MAAM,KAAK,OAAO,SAAS,MAAM;AACjC,eAAK,SAAS,KAAK,OAAO,MAAM,GAAG,MAAM,KAAK,GAAG;AACrD,iBAAS,KAAK,OAAO,WAAW,CAAC;AAAA,MACrC;AAAA,IACJ;AACA,QAAI,OAAO,KAAK,MAAM;AAClB,WAAK,MAAM,YAAY,MAAM;AACjC,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,YAAY,OAAO,YAAY,GAAG;AAC9B,QAAI,MAAM,YAAY,KAAK,cAAc,WAAW,EAAE,IAAI,KAAK;AAC/D,QAAI,OAAO,QAAQ,MAAM,KAAK,MAAM;AAChC,YAAM,IAAI,WAAW,yBAAyB;AAClD,SAAK,MAAM,QAAQ;AACnB,SAAK,MAAM,MAAM;AAAA,EACrB;AAAA,EACA,WAAW;AACP,QAAI,KAAK,OAAO,KAAK,aAAa,KAAK,MAAM,KAAK,YAAY,KAAK,OAAO,QAAQ;AAC9E,UAAI,EAAE,OAAO,SAAS,IAAI;AAC1B,WAAK,QAAQ,KAAK;AAClB,WAAK,WAAW,KAAK;AACrB,WAAK,SAAS;AACd,WAAK,YAAY;AACjB,WAAK,WAAW,KAAK,MAAM,KAAK;AAAA,IACpC,OACK;AACD,WAAK,SAAS,KAAK;AACnB,WAAK,YAAY,KAAK;AACtB,UAAI,YAAY,KAAK,MAAM,MAAM,KAAK,GAAG;AACzC,UAAI,MAAM,KAAK,MAAM,UAAU;AAC/B,WAAK,QAAQ,MAAM,KAAK,MAAM,KAAK,UAAU,MAAM,GAAG,KAAK,MAAM,KAAK,KAAK,GAAG,IAAI;AAClF,WAAK,WAAW,KAAK;AACrB,WAAK,WAAW;AAAA,IACpB;AAAA,EACJ;AAAA,EACA,WAAW;AACP,QAAI,KAAK,YAAY,KAAK,MAAM,QAAQ;AACpC,WAAK,SAAS;AACd,UAAI,KAAK,YAAY,KAAK,MAAM;AAC5B,eAAO,KAAK,OAAO;AAAA,IAC3B;AACA,WAAO,KAAK,OAAO,KAAK,MAAM,WAAW,KAAK,QAAQ;AAAA,EAC1D;AAAA;AAAA;AAAA,EAGA,QAAQ,IAAI,GAAG;AACX,SAAK,YAAY;AACjB,WAAO,KAAK,MAAM,KAAK,KAAK,MAAM,IAAI;AAClC,UAAI,KAAK,cAAc,KAAK,OAAO,SAAS;AACxC,eAAO,KAAK,QAAQ;AACxB,WAAK,KAAK,MAAM,KAAK,KAAK;AAC1B,WAAK,QAAQ,KAAK,OAAO,EAAE,KAAK,UAAU;AAC1C,WAAK,MAAM,KAAK,MAAM;AAAA,IAC1B;AACA,SAAK,OAAO;AACZ,QAAI,KAAK,OAAO,KAAK,MAAM;AACvB,WAAK,MAAM,YAAY,KAAK,MAAM;AACtC,WAAO,KAAK,SAAS;AAAA,EACzB;AAAA,EACA,UAAU;AACN,SAAK,MAAM,KAAK,WAAW,KAAK;AAChC,SAAK,QAAQ,KAAK,OAAO,KAAK,aAAa,KAAK,OAAO,SAAS,CAAC;AACjE,SAAK,QAAQ;AACb,WAAO,KAAK,OAAO;AAAA,EACvB;AAAA;AAAA,EAEA,MAAM,KAAK,OAAO;AACd,QAAI,OAAO;AACP,WAAK,QAAQ;AACb,YAAM,QAAQ;AACd,YAAM,YAAY,MAAM;AACxB,YAAM,QAAQ,MAAM,WAAW;AAAA,IACnC,OACK;AACD,WAAK,QAAQ;AAAA,IACjB;AACA,QAAI,KAAK,OAAO,KAAK;AACjB,WAAK,MAAM;AACX,UAAI,OAAO,KAAK,KAAK;AACjB,aAAK,QAAQ;AACb,eAAO;AAAA,MACX;AACA,aAAO,MAAM,KAAK,MAAM;AACpB,aAAK,QAAQ,KAAK,OAAO,EAAE,KAAK,UAAU;AAC9C,aAAO,OAAO,KAAK,MAAM;AACrB,aAAK,QAAQ,KAAK,OAAO,EAAE,KAAK,UAAU;AAC9C,UAAI,OAAO,KAAK,YAAY,MAAM,KAAK,WAAW,KAAK,MAAM,QAAQ;AACjE,aAAK,WAAW,MAAM,KAAK;AAAA,MAC/B,OACK;AACD,aAAK,QAAQ;AACb,aAAK,WAAW;AAAA,MACpB;AACA,WAAK,SAAS;AAAA,IAClB;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,KAAK,MAAM,IAAI;AACX,QAAI,QAAQ,KAAK,YAAY,MAAM,KAAK,WAAW,KAAK,MAAM;AAC1D,aAAO,KAAK,MAAM,MAAM,OAAO,KAAK,UAAU,KAAK,KAAK,QAAQ;AACpE,QAAI,QAAQ,KAAK,aAAa,MAAM,KAAK,YAAY,KAAK,OAAO;AAC7D,aAAO,KAAK,OAAO,MAAM,OAAO,KAAK,WAAW,KAAK,KAAK,SAAS;AACvE,QAAI,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,MAAM;AAC5C,aAAO,KAAK,MAAM,KAAK,MAAM,EAAE;AACnC,QAAI,SAAS;AACb,aAAS,KAAK,KAAK,QAAQ;AACvB,UAAI,EAAE,QAAQ;AACV;AACJ,UAAI,EAAE,KAAK;AACP,kBAAU,KAAK,MAAM,KAAK,KAAK,IAAI,EAAE,MAAM,IAAI,GAAG,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;AAAA,IAC5E;AACA,WAAO;AAAA,EACX;AACJ;AAEA,IAAM,aAAN,MAAiB;AAAA,EACb,YAAY,MAAM,IAAI;AAClB,SAAK,OAAO;AACZ,SAAK,KAAK;AAAA,EACd;AAAA,EACA,MAAM,OAAO,OAAO;AAChB,QAAI,EAAE,QAAAH,QAAO,IAAI,MAAM;AACvB,cAAU,KAAK,MAAM,OAAO,OAAO,KAAK,IAAIA,QAAO,MAAMA,QAAO,cAAc;AAAA,EAClF;AACJ;AACA,WAAW,UAAU,aAAa,WAAW,UAAU,WAAW,WAAW,UAAU,SAAS;AAEhG,IAAM,kBAAN,MAAsB;AAAA,EAClB,YAAY,MAAM,WAAW,WAAW;AACpC,SAAK,YAAY;AACjB,SAAK,YAAY;AACjB,SAAK,OAAO,OAAO,QAAQ,WAAW,YAAY,IAAI,IAAI;AAAA,EAC9D;AAAA,EACA,MAAM,OAAO,OAAO;AAChB,QAAI,QAAQ,MAAM,KAAK,UAAU;AACjC,eAAS;AACL,UAAI,QAAQ,MAAM,OAAO,GAAG,UAAU,MAAM,cAAc,GAAG,CAAC;AAC9D,gBAAU,KAAK,MAAM,OAAO,OAAO,GAAG,KAAK,MAAM,KAAK,SAAS;AAC/D,UAAI,MAAM,MAAM,QAAQ;AACpB;AACJ,UAAI,KAAK,aAAa;AAClB;AACJ,UAAI,CAAC;AACD;AACJ,UAAI,WAAW;AACX;AACJ,YAAM,MAAM,SAAS,MAAM,KAAK;AAAA,IACpC;AACA,QAAI,SAAS;AACT,YAAM,MAAM,OAAO,MAAM,KAAK;AAC9B,YAAM,YAAY,KAAK,WAAW,OAAO;AAAA,IAC7C;AAAA,EACJ;AACJ;AACA,gBAAgB,UAAU,aAAa,WAAW,UAAU,WAAW,WAAW,UAAU,SAAS;AAsCrG,SAAS,UAAU,MAAM,OAAO,OAAO,OAAO,WAAW,YAAY;AACjE,MAAI,QAAQ,GAAG,YAAY,KAAK,OAAO,EAAE,QAAQ,IAAI,MAAM,EAAE;AAC7D;AAAM,eAAS;AACX,WAAK,YAAY,KAAK,KAAK,MAAM;AAC7B;AACJ,UAAI,SAAS,KAAK,QAAQ,CAAC;AAI3B,eAAS,IAAI,QAAQ,GAAG,IAAI,QAAQ,KAAK;AACrC,aAAK,KAAK,IAAI,CAAC,IAAI,aAAa,GAAG;AAC/B,cAAI,OAAO,KAAK,CAAC;AACjB,cAAI,QAAQ,OAAO,IAAI,MAClB,MAAM,MAAM,SAAS,MAAM,MAAM,MAAM,SAAS,QAC7C,UAAU,MAAM,MAAM,MAAM,OAAO,WAAW,UAAU,IAAI;AAChE,kBAAM,YAAY,IAAI;AACtB;AAAA,UACJ;AAAA,QACJ;AACJ,UAAI,OAAO,MAAM,MAAM,MAAM,GAAG,OAAO,KAAK,QAAQ,CAAC;AAErD,UAAI,MAAM,OAAO,KAAK,OAAO,OAAO,KAAK,SAAS,OAAO,IAAI,CAAC,KAAK,SAAuB,KAAK,SAAS,OAAO,IAAI,CAAC,KAAK,OAAqB;AAC1I,gBAAQ,KAAK,SAAS,OAAO,IAAI,CAAC;AAClC,iBAAS;AAAA,MACb;AAEA,aAAO,MAAM,QAAO;AAChB,YAAI,MAAO,MAAM,QAAS;AAC1B,YAAI,QAAQ,SAAS,OAAO,OAAO;AACnC,YAAI,OAAO,KAAK,KAAK,GAAG,KAAK,KAAK,QAAQ,CAAC,KAAK;AAChD,YAAI,OAAO;AACP,iBAAO;AAAA,iBACF,QAAQ;AACb,gBAAM,MAAM;AAAA,aACX;AACD,kBAAQ,KAAK,QAAQ,CAAC;AACtB,gBAAM,QAAQ;AACd,mBAAS;AAAA,QACb;AAAA,MACJ;AACA;AAAA,IACJ;AACJ;AACA,SAAS,WAAW,MAAM,OAAO,MAAM;AACnC,WAAS,IAAI,OAAO,OAAO,OAAO,KAAK,CAAC,MAAM,OAAqB;AAC/D,QAAI,QAAQ;AACR,aAAO,IAAI;AACnB,SAAO;AACX;AACA,SAAS,UAAU,OAAO,MAAM,WAAW,aAAa;AACpD,MAAI,QAAQ,WAAW,WAAW,aAAa,IAAI;AACnD,SAAO,QAAQ,KAAK,WAAW,WAAW,aAAa,KAAK,IAAI;AACpE;AAGA,IAAM,UAAU,OAAO,WAAW,eAAe,QAAQ,OAAO,YAAY,KAAK,QAAQ,IAAI,GAAG;AAChG,IAAI,WAAW;AACf,IAAI;AAAA,CACH,SAAUI,SAAQ;AACf,EAAAA,QAAOA,QAAO,QAAQ,IAAI,EAAE,IAAI;AACpC,GAAG,WAAW,SAAS,CAAC,EAAE;AAC1B,SAAS,MAAM,MAAM,KAAK,MAAM;AAC5B,MAAI,SAAS,KAAK,OAAO,SAAS,gBAAgB;AAClD,SAAO,OAAO,GAAG;AACjB,aAAS;AACL,QAAI,EAAE,OAAO,IAAI,OAAO,YAAY,GAAG,IAAI,OAAO,WAAW,GAAG;AAC5D,iBAAS;AACL,aAAK,OAAO,IAAI,OAAO,KAAK,MAAM,OAAO,OAAO,QAAQ,CAAC,OAAO,KAAK;AACjE,iBAAO,OAAO,IAAI,KAAK,IAAI,GAAG,KAAK;AAAA,YAAI,OAAO,KAAK;AAAA,YAAG,MAAM;AAAA;AAAA,UAAsB,CAAC,IAC7E,KAAK,IAAI,KAAK,QAAQ,KAAK;AAAA,YAAI,OAAO,OAAO;AAAA,YAAG,MAAM;AAAA;AAAA,UAAsB,CAAC;AACvF,YAAI,OAAO,IAAI,OAAO,YAAY,IAAI,OAAO,YAAY;AACrD;AACJ,YAAI,CAAC,OAAO,OAAO;AACf,iBAAO,OAAO,IAAI,IAAI,KAAK;AAAA,MACnC;AAAA,EACR;AACJ;AACA,IAAM,iBAAN,MAAqB;AAAA,EACjB,YAAY,WAAW,SAAS;AAC5B,SAAK,YAAY;AACjB,SAAK,UAAU;AACf,SAAK,IAAI;AACT,SAAK,WAAW;AAChB,SAAK,WAAW;AAChB,SAAK,SAAS;AACd,SAAK,QAAQ,CAAC;AACd,SAAK,QAAQ,CAAC;AACd,SAAK,QAAQ,CAAC;AACd,SAAK,aAAa;AAAA,EACtB;AAAA,EACA,eAAe;AACX,QAAI,KAAK,KAAK,WAAW,KAAK,KAAK,KAAK,UAAU,SAAS,OAAO,KAAK,UAAU,KAAK,GAAG;AACzF,QAAI,IAAI;AACJ,WAAK,WAAW,GAAG,YAAY,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,QAAQ,CAAC,IAAI,GAAG,SAAS,GAAG;AACvF,WAAK,SAAS,GAAG,UAAU,MAAM,GAAG,MAAM,GAAG,KAAK,GAAG,QAAQ,EAAE,IAAI,GAAG,SAAS,GAAG;AAClF,aAAO,KAAK,MAAM,QAAQ;AACtB,aAAK,MAAM,IAAI;AACf,aAAK,MAAM,IAAI;AACf,aAAK,MAAM,IAAI;AAAA,MACnB;AACA,WAAK,MAAM,KAAK,GAAG,IAAI;AACvB,WAAK,MAAM,KAAK,CAAC,GAAG,MAAM;AAC1B,WAAK,MAAM,KAAK,CAAC;AACjB,WAAK,YAAY,KAAK;AAAA,IAC1B,OACK;AACD,WAAK,YAAY;AAAA,IACrB;AAAA,EACJ;AAAA;AAAA,EAEA,OAAO,KAAK;AACR,QAAI,MAAM,KAAK;AACX,aAAO;AACX,WAAO,KAAK,YAAY,KAAK,UAAU;AACnC,WAAK,aAAa;AACtB,QAAI,CAAC,KAAK;AACN,aAAO;AACX,eAAS;AACL,UAAIC,QAAO,KAAK,MAAM,SAAS;AAC/B,UAAIA,QAAO,GAAG;AACV,aAAK,aAAa;AAClB,eAAO;AAAA,MACX;AACA,UAAI,MAAM,KAAK,MAAMA,KAAI,GAAG,QAAQ,KAAK,MAAMA,KAAI;AACnD,UAAI,SAAS,IAAI,SAAS,QAAQ;AAC9B,aAAK,MAAM,IAAI;AACf,aAAK,MAAM,IAAI;AACf,aAAK,MAAM,IAAI;AACf;AAAA,MACJ;AACA,UAAI,OAAO,IAAI,SAAS,KAAK;AAC7B,UAAI,QAAQ,KAAK,MAAMA,KAAI,IAAI,IAAI,UAAU,KAAK;AAClD,UAAI,QAAQ,KAAK;AACb,aAAK,YAAY;AACjB,eAAO;AAAA,MACX;AACA,UAAI,gBAAgB,MAAM;AACtB,YAAI,SAAS,KAAK;AACd,cAAI,QAAQ,KAAK;AACb,mBAAO;AACX,cAAI,MAAM,QAAQ,KAAK;AACvB,cAAI,OAAO,KAAK,QAAQ;AACpB,gBAAI,YAAY,KAAK,KAAK,SAAS,SAAS;AAC5C,gBAAI,CAAC,aAAa,MAAM,YAAY,KAAK,SAAS;AAC9C,qBAAO;AAAA,UACf;AAAA,QACJ;AACA,aAAK,MAAMA,KAAI;AACf,YAAI,QAAQ,KAAK,UAAU,KAAK,IAAI,KAAK,UAAU,GAAG,GAAG;AACrD,eAAK,MAAM,KAAK,IAAI;AACpB,eAAK,MAAM,KAAK,KAAK;AACrB,eAAK,MAAM,KAAK,CAAC;AAAA,QACrB;AAAA,MACJ,OACK;AACD,aAAK,MAAMA,KAAI;AACf,aAAK,YAAY,QAAQ,KAAK;AAAA,MAClC;AAAA,IACJ;AAAA,EACJ;AACJ;AACA,IAAM,aAAN,MAAiB;AAAA,EACb,YAAYC,SAAQ,QAAQ;AACxB,SAAK,SAAS;AACd,SAAK,SAAS,CAAC;AACf,SAAK,YAAY;AACjB,SAAK,UAAU,CAAC;AAChB,SAAK,SAASA,QAAO,WAAW,IAAI,OAAK,IAAI,aAAW;AAAA,EAC5D;AAAA,EACA,WAAW,OAAO;AACd,QAAI,cAAc;AAClB,QAAI,OAAO;AACX,QAAI,EAAE,QAAAA,QAAO,IAAI,MAAM,GAAG,EAAE,WAAW,IAAIA;AAC3C,QAAI,OAAOA,QAAO;AAAA,MAAU,MAAM;AAAA,MAAO;AAAA;AAAA,IAAgC;AACzE,QAAI,UAAU,MAAM,aAAa,MAAM,WAAW,OAAO;AACzD,QAAI,YAAY;AAChB,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AACxC,WAAM,KAAK,IAAK,SAAS;AACrB;AACJ,UAAI,YAAY,WAAW,CAAC,GAAG,QAAQ,KAAK,OAAO,CAAC;AACpD,UAAI,QAAQ,CAAC,UAAU;AACnB;AACJ,UAAI,UAAU,cAAc,MAAM,SAAS,MAAM,OAAO,MAAM,QAAQ,QAAQ,MAAM,WAAW,SAAS;AACpG,aAAK,kBAAkB,OAAO,WAAW,KAAK;AAC9C,cAAM,OAAO;AACb,cAAM,UAAU;AAAA,MACpB;AACA,UAAI,MAAM,YAAY,MAAM,MAAM;AAC9B,oBAAY,KAAK,IAAI,MAAM,WAAW,SAAS;AACnD,UAAI,MAAM,SAAS,GAAkB;AACjC,YAAI,aAAa;AACjB,YAAI,MAAM,WAAW;AACjB,wBAAc,KAAK,WAAW,OAAO,MAAM,UAAU,MAAM,KAAK,WAAW;AAC/E,sBAAc,KAAK,WAAW,OAAO,MAAM,OAAO,MAAM,KAAK,WAAW;AACxE,YAAI,CAAC,UAAU,QAAQ;AACnB,iBAAO;AACP,cAAI,cAAc;AACd;AAAA,QACR;AAAA,MACJ;AAAA,IACJ;AACA,WAAO,KAAK,QAAQ,SAAS;AACzB,WAAK,QAAQ,IAAI;AACrB,QAAI;AACA,YAAM,aAAa,SAAS;AAChC,QAAI,CAAC,QAAQ,MAAM,OAAO,KAAK,OAAO,KAAK;AACvC,aAAO,IAAI;AACX,WAAK,QAAQ,MAAM,EAAE,OAAO;AAC5B,WAAK,QAAQ,KAAK,MAAM,MAAM;AAC9B,oBAAc,KAAK,WAAW,OAAO,KAAK,OAAO,KAAK,KAAK,WAAW;AAAA,IAC1E;AACA,SAAK,YAAY;AACjB,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,aAAa,OAAO;AAChB,QAAI,KAAK;AACL,aAAO,KAAK;AAChB,QAAI,OAAO,IAAI,eAAa,EAAE,KAAK,EAAE,IAAI;AACzC,SAAK,QAAQ;AACb,SAAK,MAAM,KAAK,IAAI,MAAM,GAAG,EAAE,OAAO,GAAG;AACzC,SAAK,QAAQ,OAAO,EAAE,OAAO,MAAM,EAAE,OAAO,UAAU;AACtD,WAAO;AAAA,EACX;AAAA,EACA,kBAAkB,OAAO,WAAW,OAAO;AACvC,QAAI,QAAQ,KAAK,OAAO,QAAQ,MAAM,GAAG;AACzC,cAAU,MAAM,KAAK,OAAO,MAAM,OAAO,KAAK,GAAG,KAAK;AACtD,QAAI,MAAM,QAAQ,IAAI;AAClB,UAAI,EAAE,QAAAA,QAAO,IAAI,MAAM;AACvB,eAAS,IAAI,GAAG,IAAIA,QAAO,YAAY,QAAQ;AAC3C,YAAIA,QAAO,YAAY,CAAC,KAAK,MAAM,OAAO;AACtC,cAAI,SAASA,QAAO,aAAa,CAAC,EAAE,KAAK,OAAO,KAAK,MAAM,OAAO,MAAM,GAAG,GAAG,KAAK;AACnF,cAAI,UAAU,KAAK,MAAM,EAAE,OAAO,QAAQ,OAAO,UAAU,CAAC,GAAG;AAC3D,iBAAK,SAAS,MAAM;AAChB,oBAAM,QAAQ,UAAU;AAAA;AAExB,oBAAM,WAAW,UAAU;AAC/B;AAAA,UACJ;AAAA,QACJ;AAAA,IACR,OACK;AACD,YAAM,QAAQ;AACd,YAAM,MAAM,KAAK,OAAO,QAAQ,QAAQ,CAAC;AAAA,IAC7C;AAAA,EACJ;AAAA,EACA,UAAU,QAAQ,OAAO,KAAK,OAAO;AAEjC,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,UAAI,KAAK,QAAQ,CAAC,KAAK;AACnB,eAAO;AACf,SAAK,QAAQ,OAAO,IAAI;AACxB,SAAK,QAAQ,OAAO,IAAI;AACxB,SAAK,QAAQ,OAAO,IAAI;AACxB,WAAO;AAAA,EACX;AAAA,EACA,WAAW,OAAO,OAAO,KAAK,OAAO;AACjC,QAAI,EAAE,MAAM,IAAI,OAAO,EAAE,QAAAA,QAAO,IAAI,MAAM,GAAG,EAAE,KAAK,IAAIA;AACxD,aAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAC9B,eAAS,IAAIA,QAAO;AAAA,QAAU;AAAA,QAAO,MAAM,IAA0B;AAAA;AAAA,MAA0B,KAAI,KAAK,GAAG;AACvG,YAAI,KAAK,CAAC,KAAK,OAAqB;AAChC,cAAI,KAAK,IAAI,CAAC,KAAK,GAAkB;AACjC,gBAAI,KAAK,MAAM,IAAI,CAAC;AAAA,UACxB,OACK;AACD,gBAAI,SAAS,KAAK,KAAK,IAAI,CAAC,KAAK;AAC7B,sBAAQ,KAAK,UAAU,KAAK,MAAM,IAAI,CAAC,GAAG,OAAO,KAAK,KAAK;AAC/D;AAAA,UACJ;AAAA,QACJ;AACA,YAAI,KAAK,CAAC,KAAK;AACX,kBAAQ,KAAK,UAAU,KAAK,MAAM,IAAI,CAAC,GAAG,OAAO,KAAK,KAAK;AAAA,MACnE;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ;AACA,IAAI;AAAA,CACH,SAAUC,MAAK;AACZ,EAAAA,KAAIA,KAAI,UAAU,IAAI,CAAC,IAAI;AAC3B,EAAAA,KAAIA,KAAI,qBAAqB,IAAI,CAAC,IAAI;AAGtC,EAAAA,KAAIA,KAAI,sBAAsB,IAAI,GAAG,IAAI;AACzC,EAAAA,KAAIA,KAAI,kBAAkB,IAAI,EAAE,IAAI;AAIpC,EAAAA,KAAIA,KAAI,UAAU,IAAI,IAAK,IAAI;AAC/B,EAAAA,KAAIA,KAAI,OAAO,IAAI,GAAI,IAAI;AAC3B,EAAAA,KAAIA,KAAI,kCAAkC,IAAI,GAAG,IAAI;AAIrD,EAAAA,KAAIA,KAAI,eAAe,IAAI,EAAE,IAAI;AACrC,GAAG,QAAQ,MAAM,CAAC,EAAE;AACpB,IAAM,QAAN,MAAY;AAAA,EACR,YAAYD,SAAQ,OAAO,WAAW,QAAQ;AAC1C,SAAK,SAASA;AACd,SAAK,QAAQ;AACb,SAAK,SAAS;AACd,SAAK,aAAa;AAClB,SAAK,cAAc;AACnB,SAAK,cAAc;AACnB,SAAK,SAAS,CAAC;AACf,SAAK,YAAY;AACjB,SAAK,wBAAwB;AAC7B,SAAK,uBAAuB;AAC5B,SAAK,oBAAoB;AACzB,SAAK,SAAS,IAAI,YAAY,OAAO,MAAM;AAC3C,SAAK,SAAS,IAAI,WAAWA,SAAQ,KAAK,MAAM;AAChD,SAAK,UAAUA,QAAO,IAAI,CAAC;AAC3B,QAAI,EAAE,KAAK,IAAI,OAAO,CAAC;AACvB,SAAK,SAAS,CAAC,MAAM,MAAM,MAAMA,QAAO,IAAI,CAAC,GAAG,IAAI,CAAC;AACrD,SAAK,YAAY,UAAU,UAAU,KAAK,OAAO,MAAM,OAAOA,QAAO,eAAe,IAC9E,IAAI,eAAe,WAAWA,QAAO,OAAO,IAAI;AAAA,EAC1D;AAAA,EACA,IAAI,YAAY;AACZ,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU;AACN,QAAI,SAAS,KAAK,QAAQ,MAAM,KAAK;AAErC,QAAI,YAAY,KAAK,SAAS,CAAC;AAC/B,QAAI,SAAS;AAQb,QAAI,KAAK,oBAAoB,OAAkD,OAAO,UAAU,GAAG;AAC/F,UAAI,CAAC,CAAC,IAAI;AACV,aAAO,EAAE,YAAY,KAAK,EAAE,MAAM,UAAU,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC,KAAK,KAAK,uBAAuB;AAAA,MAAE;AACzG,WAAK,oBAAoB,KAAK,uBAAuB;AAAA,IACzD;AAIA,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,UAAI,QAAQ,OAAO,CAAC;AACpB,iBAAS;AACL,aAAK,OAAO,YAAY;AACxB,YAAI,MAAM,MAAM,KAAK;AACjB,oBAAU,KAAK,KAAK;AAAA,QACxB,WACS,KAAK,aAAa,OAAO,WAAW,MAAM,GAAG;AAClD;AAAA,QACJ,OACK;AACD,cAAI,CAAC,SAAS;AACV,sBAAU,CAAC;AACX,4BAAgB,CAAC;AAAA,UACrB;AACA,kBAAQ,KAAK,KAAK;AAClB,cAAI,MAAM,KAAK,OAAO,aAAa,KAAK;AACxC,wBAAc,KAAK,IAAI,OAAO,IAAI,GAAG;AAAA,QACzC;AACA;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,CAAC,UAAU,QAAQ;AACnB,UAAI,WAAW,WAAW,aAAa,OAAO;AAC9C,UAAI;AACA,eAAO,KAAK,YAAY,QAAQ;AACpC,UAAI,KAAK,OAAO,QAAQ;AACpB,YAAI,WAAW;AACX,kBAAQ,IAAI,uBAAuB,KAAK,OAAO,YAAY,KAAK,OAAO,QAAQ,KAAK,OAAO,UAAU,KAAK,IAAI,OAAO;AACzH,cAAM,IAAI,YAAY,iBAAiB,GAAG;AAAA,MAC9C;AACA,UAAI,CAAC,KAAK;AACN,aAAK,aAAa;AAAA,IAC1B;AACA,QAAI,KAAK,cAAc,SAAS;AAC5B,UAAI,WAAW,KAAK,aAAa,QAAQ,QAAQ,CAAC,EAAE,MAAM,KAAK,YAAY,QAAQ,CAAC,IAC9E,KAAK,YAAY,SAAS,eAAe,SAAS;AACxD,UAAI;AACA,eAAO,KAAK,YAAY,SAAS,SAAS,CAAC;AAAA,IACnD;AACA,QAAI,KAAK,YAAY;AACjB,UAAI,eAAe,KAAK,cAAc,IAAI,IAAI,KAAK,aAAa;AAChE,UAAI,UAAU,SAAS,cAAc;AACjC,kBAAU,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC1C,eAAO,UAAU,SAAS;AACtB,oBAAU,IAAI;AAAA,MACtB;AACA,UAAI,UAAU,KAAK,OAAK,EAAE,YAAY,GAAG;AACrC,aAAK;AAAA,IACb,WACS,UAAU,SAAS,GAAG;AAI3B;AAAO,iBAAS,IAAI,GAAG,IAAI,UAAU,SAAS,GAAG,KAAK;AAClD,cAAI,QAAQ,UAAU,CAAC;AACvB,mBAAS,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAC3C,gBAAI,QAAQ,UAAU,CAAC;AACvB,gBAAI,MAAM,UAAU,KAAK,KACrB,MAAM,OAAO,SAAS,OAAsC,MAAM,OAAO,SAAS,KAAoC;AACtH,mBAAM,MAAM,QAAQ,MAAM,SAAW,MAAM,OAAO,SAAS,MAAM,OAAO,UAAW,GAAG;AAClF,0BAAU,OAAO,KAAK,CAAC;AAAA,cAC3B,OACK;AACD,0BAAU,OAAO,KAAK,CAAC;AACvB,yBAAS;AAAA,cACb;AAAA,YACJ;AAAA,UACJ;AAAA,QACJ;AACA,UAAI,UAAU,SAAS;AACnB,kBAAU;AAAA,UAAO;AAAA,UAA4B,UAAU,SAAS;AAAA;AAAA,QAA0B;AAAA,IAClG;AACA,SAAK,cAAc,UAAU,CAAC,EAAE;AAChC,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ;AAClC,UAAI,UAAU,CAAC,EAAE,MAAM,KAAK;AACxB,aAAK,cAAc,UAAU,CAAC,EAAE;AACxC,WAAO;AAAA,EACX;AAAA,EACA,OAAO,KAAK;AACR,QAAI,KAAK,aAAa,QAAQ,KAAK,YAAY;AAC3C,YAAM,IAAI,WAAW,8BAA8B;AACvD,SAAK,YAAY;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa,OAAO,QAAQ,OAAO;AAC/B,QAAI,QAAQ,MAAM,KAAK,EAAE,QAAAA,QAAO,IAAI;AACpC,QAAI,OAAO,UAAU,KAAK,QAAQ,KAAK,IAAI,SAAS;AACpD,QAAI,KAAK,aAAa,QAAQ,QAAQ,KAAK;AACvC,aAAO,MAAM,YAAY,IAAI,QAAQ;AACzC,QAAI,KAAK,WAAW;AAChB,UAAI,WAAW,MAAM,cAAc,MAAM,WAAW,QAAQ,QAAQ,SAAS,WAAW,MAAM,WAAW,OAAO;AAChH,eAAS,SAAS,KAAK,UAAU,OAAO,KAAK,GAAG,UAAS;AACrD,YAAI,QAAQ,KAAK,OAAO,QAAQ,MAAM,OAAO,KAAK,EAAE,KAAK,OAAO,OAAOA,QAAO,QAAQ,MAAM,OAAO,OAAO,KAAK,EAAE,IAAI;AACrH,YAAI,QAAQ,MAAM,OAAO,WAAW,CAAC,aAAa,OAAO,KAAK,SAAS,WAAW,KAAK,MAAM,SAAS;AAClG,gBAAM,QAAQ,QAAQ,KAAK;AAC3B,cAAI;AACA,oBAAQ,IAAI,OAAO,KAAK,QAAQ,KAAK,IAAI,kBAAkBA,QAAO,QAAQ,OAAO,KAAK,EAAE,CAAC,GAAG;AAChG,iBAAO;AAAA,QACX;AACA,YAAI,EAAE,kBAAkB,SAAS,OAAO,SAAS,UAAU,KAAK,OAAO,UAAU,CAAC,IAAI;AAClF;AACJ,YAAI,QAAQ,OAAO,SAAS,CAAC;AAC7B,YAAI,iBAAiB,QAAQ,OAAO,UAAU,CAAC,KAAK;AAChD,mBAAS;AAAA;AAET;AAAA,MACR;AAAA,IACJ;AACA,QAAI,gBAAgBA,QAAO;AAAA,MAAU,MAAM;AAAA,MAAO;AAAA;AAAA,IAAgC;AAClF,QAAI,gBAAgB,GAAG;AACnB,YAAM,OAAO,aAAa;AAC1B,UAAI;AACA,gBAAQ,IAAI,OAAO,KAAK,QAAQ,KAAK,IAAI,uBAAuBA,QAAO;AAAA,UAAQ,gBAAgB;AAAA;AAAA,QAA4B,CAAC,GAAG;AACnI,aAAO;AAAA,IACX;AACA,QAAI,MAAM,MAAM,UAAU,MAA0B;AAChD,aAAO,MAAM,MAAM,SAAS,OAAwB,MAAM,YAAY,GAAG;AAAA,MAAE;AAAA,IAC/E;AACA,QAAI,UAAU,KAAK,OAAO,WAAW,KAAK;AAC1C,aAAS,IAAI,GAAG,IAAI,QAAQ,UAAS;AACjC,UAAI,SAAS,QAAQ,GAAG,GAAG,OAAO,QAAQ,GAAG,GAAG,MAAM,QAAQ,GAAG;AACjE,UAAID,QAAO,KAAK,QAAQ,UAAU,CAAC;AACnC,UAAI,aAAaA,QAAO,QAAQ,MAAM,MAAM;AAC5C,iBAAW,MAAM,QAAQ,MAAM,GAAG;AAClC,UAAI;AACA,gBAAQ,IAAI,OAAO,KAAK,QAAQ,UAAU,IAAI,UAAU,SAAS,UAAkC,IAAI,UACjG,aAAaC,QAAO;AAAA,UAAQ,SAAS;AAAA;AAAA,QAA4B,CAAC,EAAE,QAAQA,QAAO,QAAQ,IAAI,CAAC,MAAM,KAAK,GAAG,cAAc,QAAQ,KAAK,SAAS,GAAG;AAC/J,UAAID;AACA,eAAO;AAAA,eACF,WAAW,MAAM;AACtB,eAAO,KAAK,UAAU;AAAA;AAEtB,cAAM,KAAK,UAAU;AAAA,IAC7B;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,aAAa,OAAO,WAAW;AAC3B,QAAI,MAAM,MAAM;AAChB,eAAS;AACL,UAAI,CAAC,KAAK,aAAa,OAAO,MAAM,IAAI;AACpC,eAAO;AACX,UAAI,MAAM,MAAM,KAAK;AACjB,uBAAe,OAAO,SAAS;AAC/B,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,YAAY,QAAQ,QAAQ,WAAW;AACnC,QAAI,WAAW,MAAM,YAAY;AACjC,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,UAAI,QAAQ,OAAO,CAAC,GAAG,QAAQ,OAAO,KAAK,CAAC,GAAG,WAAW,QAAQ,KAAK,KAAK,CAAC;AAC7E,UAAI,OAAO,UAAU,KAAK,QAAQ,KAAK,IAAI,SAAS;AACpD,UAAI,MAAM,SAAS;AACf,YAAI;AACA;AACJ,oBAAY;AACZ,cAAM,QAAQ;AACd,YAAI;AACA,kBAAQ,IAAI,OAAO,KAAK,QAAQ,KAAK,IAAI,cAAc;AAC3D,YAAI,OAAO,KAAK,aAAa,OAAO,SAAS;AAC7C,YAAI;AACA;AAAA,MACR;AACA,UAAI,QAAQ,MAAM,MAAM,GAAG,YAAY;AACvC,eAAS,IAAI,GAAG,MAAM,YAAY,KAAK,IAAI,IAA+B,KAAK;AAC3E,YAAI;AACA,kBAAQ,IAAI,YAAY,KAAK,QAAQ,KAAK,IAAI,qBAAqB;AACvE,YAAI,OAAO,KAAK,aAAa,OAAO,SAAS;AAC7C,YAAI;AACA;AACJ,YAAI;AACA,sBAAY,KAAK,QAAQ,KAAK,IAAI;AAAA,MAC1C;AACA,eAAS,UAAU,MAAM,gBAAgB,KAAK,GAAG;AAC7C,YAAI;AACA,kBAAQ,IAAI,OAAO,KAAK,QAAQ,MAAM,IAAI,uBAAuB;AACrE,aAAK,aAAa,QAAQ,SAAS;AAAA,MACvC;AACA,UAAI,KAAK,OAAO,MAAM,MAAM,KAAK;AAC7B,YAAI,YAAY,MAAM,KAAK;AACvB;AACA,kBAAQ;AAAA,QACZ;AACA,cAAM,gBAAgB,OAAO,QAAQ;AACrC,YAAI;AACA,kBAAQ,IAAI,OAAO,KAAK,QAAQ,KAAK,IAAI,wBAAwB,KAAK,OAAO,QAAQ,KAAK,CAAC,GAAG;AAClG,uBAAe,OAAO,SAAS;AAAA,MACnC,WACS,CAAC,YAAY,SAAS,QAAQ,MAAM,OAAO;AAChD,mBAAW;AAAA,MACf;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,YAAY,OAAO;AACf,UAAM,MAAM;AACZ,WAAO,KAAK,MAAM;AAAA,MAAE,QAAQ,kBAAkB,OAAO,KAAK;AAAA,MACtD,SAAS,KAAK,OAAO;AAAA,MACrB,OAAO,KAAK;AAAA,MACZ,iBAAiB,KAAK,OAAO;AAAA,MAC7B,QAAQ,KAAK;AAAA,MACb,OAAO,KAAK,OAAO,CAAC,EAAE;AAAA,MACtB,QAAQ,MAAM,MAAM,KAAK,OAAO,CAAC,EAAE;AAAA,MACnC,eAAe,KAAK,OAAO;AAAA,IAAc,CAAC;AAAA,EAClD;AAAA,EACA,QAAQ,OAAO;AACX,QAAI,MAAM,aAAa,WAAW,oBAAI,YAAU,IAAI,KAAK;AACzD,QAAI,CAAC;AACD,eAAS,IAAI,OAAO,KAAK,OAAO,cAAc,KAAK,aAAa,CAAC;AACrE,WAAO,KAAK;AAAA,EAChB;AACJ;AACA,SAAS,eAAe,OAAO,WAAW;AACtC,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACvC,QAAI,QAAQ,UAAU,CAAC;AACvB,QAAI,MAAM,OAAO,MAAM,OAAO,MAAM,UAAU,KAAK,GAAG;AAClD,UAAI,UAAU,CAAC,EAAE,QAAQ,MAAM;AAC3B,kBAAU,CAAC,IAAI;AACnB;AAAA,IACJ;AAAA,EACJ;AACA,YAAU,KAAK,KAAK;AACxB;AACA,IAAM,UAAN,MAAc;AAAA,EACV,YAAY,QAAQ,OAAO,UAAU;AACjC,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,SAAK,WAAW;AAAA,EACpB;AAAA,EACA,OAAO,MAAM;AAAE,WAAO,CAAC,KAAK,YAAY,KAAK,SAAS,IAAI,KAAK;AAAA,EAAG;AACtE;AA0BA,IAAM,WAAN,MAAM,kBAAiB,OAAO;AAAA;AAAA,EAE1B,YAAY,MAAM;AACd,UAAM;AAEN,SAAK,WAAW,CAAC;AACjB,QAAI,KAAK,WAAW;AAChB,YAAM,IAAI,WAAW,mBAAmB,KAAK,OAAO,oCAAoC,EAAqB,GAAG;AACpH,QAAI,YAAY,KAAK,UAAU,MAAM,GAAG;AACxC,SAAK,gBAAgB,UAAU;AAC/B,aAAS,IAAI,GAAG,IAAI,KAAK,iBAAiB;AACtC,gBAAU,KAAK,EAAE;AACrB,QAAI,WAAW,OAAO,KAAK,KAAK,QAAQ,EAAE,IAAI,OAAK,KAAK,SAAS,CAAC,EAAE,CAAC,CAAC;AACtE,QAAI,YAAY,CAAC;AACjB,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ;AAClC,gBAAU,KAAK,CAAC,CAAC;AACrB,aAAS,QAAQ,QAAQ,MAAM,OAAO;AAClC,gBAAU,MAAM,EAAE,KAAK,CAAC,MAAM,KAAK,YAAY,OAAO,KAAK,CAAC,CAAC,CAAC;AAAA,IAClE;AACA,QAAI,KAAK;AACL,eAAS,YAAY,KAAK,WAAW;AACjC,YAAI,OAAO,SAAS,CAAC;AACrB,YAAI,OAAO,QAAQ;AACf,iBAAO,SAAS,IAAI;AACxB,iBAAS,IAAI,GAAG,IAAI,SAAS,UAAS;AAClC,cAAI,OAAO,SAAS,GAAG;AACvB,cAAI,QAAQ,GAAG;AACX,oBAAQ,MAAM,MAAM,SAAS,GAAG,CAAC;AAAA,UACrC,OACK;AACD,gBAAI,QAAQ,SAAS,IAAI,CAAC,IAAI;AAC9B,qBAAS,IAAI,CAAC,MAAM,IAAI,GAAG;AACvB,sBAAQ,SAAS,GAAG,GAAG,MAAM,KAAK;AACtC;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AACJ,SAAK,UAAU,IAAI,QAAQ,UAAU,IAAI,CAAC,MAAM,MAAM,SAAS,OAAO;AAAA,MAClE,MAAM,KAAK,KAAK,gBAAgB,SAAY;AAAA,MAC5C,IAAI;AAAA,MACJ,OAAO,UAAU,CAAC;AAAA,MAClB,KAAK,SAAS,QAAQ,CAAC,IAAI;AAAA,MAC3B,OAAO,KAAK;AAAA,MACZ,SAAS,KAAK,gBAAgB,KAAK,aAAa,QAAQ,CAAC,IAAI;AAAA,IACjE,CAAC,CAAC,CAAC;AACH,QAAI,KAAK;AACL,WAAK,UAAU,KAAK,QAAQ,OAAO,GAAG,KAAK,WAAW;AAC1D,SAAK,SAAS;AACd,SAAK,eAAe;AACpB,QAAI,aAAa,YAAY,KAAK,SAAS;AAC3C,SAAK,UAAU,KAAK;AACpB,SAAK,mBAAmB,KAAK,eAAe,CAAC;AAC7C,SAAK,cAAc,IAAI,YAAY,KAAK,iBAAiB,MAAM;AAC/D,aAAS,IAAI,GAAG,IAAI,KAAK,iBAAiB,QAAQ;AAC9C,WAAK,YAAY,CAAC,IAAI,KAAK,iBAAiB,CAAC,EAAE;AACnD,SAAK,eAAe,KAAK,iBAAiB,IAAI,cAAc;AAC5D,SAAK,SAAS,YAAY,KAAK,QAAQ,WAAW;AAClD,SAAK,OAAO,YAAY,KAAK,SAAS;AACtC,SAAK,OAAO,YAAY,KAAK,IAAI;AACjC,SAAK,UAAU,KAAK;AACpB,SAAK,aAAa,KAAK,WAAW,IAAI,WAAS,OAAO,SAAS,WAAW,IAAI,WAAW,YAAY,KAAK,IAAI,KAAK;AACnH,SAAK,WAAW,KAAK;AACrB,SAAK,WAAW,KAAK,YAAY,CAAC;AAClC,SAAK,qBAAqB,KAAK,sBAAsB;AACrD,SAAK,iBAAiB,KAAK;AAC3B,SAAK,YAAY,KAAK,aAAa;AACnC,SAAK,UAAU,KAAK,QAAQ,MAAM,SAAS;AAC3C,SAAK,UAAU,KAAK,aAAa;AACjC,SAAK,MAAM,KAAK,SAAS,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC,CAAC;AAAA,EAC1D;AAAA,EACA,YAAY,OAAO,WAAW,QAAQ;AAClC,QAAI,QAAQ,IAAI,MAAM,MAAM,OAAO,WAAW,MAAM;AACpD,aAAS,KAAK,KAAK;AACf,cAAQ,EAAE,OAAO,OAAO,WAAW,MAAM;AAC7C,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,QAAQ,OAAO,MAAM,QAAQ,OAAO;AAChC,QAAI,QAAQ,KAAK;AACjB,QAAI,QAAQ,MAAM,CAAC;AACf,aAAO;AACX,aAAS,MAAM,MAAM,OAAO,CAAC,OAAK;AAC9B,UAAI,WAAW,MAAM,KAAK,GAAGG,QAAO,WAAW;AAC/C,UAAI,SAAS,MAAM,KAAK;AACxB,UAAIA,SAAQ;AACR,eAAO;AACX,eAAS,MAAM,OAAO,YAAY,IAAI,MAAM,KAAK;AAC7C,YAAI,MAAM,GAAG,KAAK;AACd,iBAAO;AACf,UAAIA;AACA,eAAO;AAAA,IACf;AAAA,EACJ;AAAA;AAAA,EAEA,UAAU,OAAO,UAAU;AACvB,QAAI,OAAO,KAAK;AAChB,aAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAC9B,eAAS,IAAI,KAAK;AAAA,QAAU;AAAA,QAAO,MAAM,IAA0B;AAAA;AAAA,MAA0B,GAAG,QAAO,KAAK,GAAG;AAC3G,aAAK,OAAO,KAAK,CAAC,MAAM,OAAqB;AACzC,cAAI,KAAK,IAAI,CAAC,KAAK;AACf,mBAAO,KAAK,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC;AAAA,mBAC5B,KAAK,IAAI,CAAC,KAAK;AACpB,mBAAO,KAAK,MAAM,IAAI,CAAC;AAAA;AAEvB;AAAA,QACR;AACA,YAAI,QAAQ,YAAY,QAAQ;AAC5B,iBAAO,KAAK,MAAM,IAAI,CAAC;AAAA,MAC/B;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,UAAU,OAAO,MAAM;AACnB,WAAO,KAAK,OAAQ,QAAQ,IAA2B,IAAI;AAAA,EAC/D;AAAA;AAAA,EAEA,UAAU,OAAO,MAAM;AACnB,YAAQ,KAAK;AAAA,MAAU;AAAA,MAAO;AAAA;AAAA,IAAwB,IAAI,QAAQ;AAAA,EACtE;AAAA;AAAA,EAEA,YAAY,OAAO,QAAQ;AACvB,WAAO,CAAC,CAAC,KAAK,WAAW,OAAO,OAAK,KAAK,SAAS,OAAO,IAAI;AAAA,EAClE;AAAA;AAAA,EAEA,WAAW,OAAO,QAAQ;AACtB,QAAI,QAAQ,KAAK;AAAA,MAAU;AAAA,MAAO;AAAA;AAAA,IAAgC;AAClE,QAAI,SAAS,QAAQ,OAAO,KAAK,IAAI;AACrC,aAAS,IAAI,KAAK;AAAA,MAAU;AAAA,MAAO;AAAA;AAAA,IAA0B,GAAG,UAAU,MAAM,KAAK,GAAG;AACpF,UAAI,KAAK,KAAK,CAAC,KAAK,OAAqB;AACrC,YAAI,KAAK,KAAK,IAAI,CAAC,KAAK;AACpB,cAAI,KAAK,KAAK,MAAM,IAAI,CAAC;AAAA;AAEzB;AAAA,MACR;AACA,eAAS,OAAO,KAAK,KAAK,MAAM,IAAI,CAAC,CAAC;AAAA,IAC1C;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAGA,WAAW,OAAO;AACd,QAAI,SAAS,CAAC;AACd,aAAS,IAAI,KAAK;AAAA,MAAU;AAAA,MAAO;AAAA;AAAA,IAA0B,KAAI,KAAK,GAAG;AACrE,UAAI,KAAK,KAAK,CAAC,KAAK,OAAqB;AACrC,YAAI,KAAK,KAAK,IAAI,CAAC,KAAK;AACpB,cAAI,KAAK,KAAK,MAAM,IAAI,CAAC;AAAA;AAEzB;AAAA,MACR;AACA,WAAK,KAAK,KAAK,IAAI,CAAC,IAAK,SAAiC,OAAQ,GAAG;AACjE,YAAI,QAAQ,KAAK,KAAK,IAAI,CAAC;AAC3B,YAAI,CAAC,OAAO,KAAK,CAAC,GAAGC,OAAOA,KAAI,KAAM,KAAK,KAAK;AAC5C,iBAAO,KAAK,KAAK,KAAK,CAAC,GAAG,KAAK;AAAA,MACvC;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,UAAU,QAAQ;AAGd,QAAI,OAAO,OAAO,OAAO,OAAO,OAAO,UAAS,SAAS,GAAG,IAAI;AAChE,QAAI,OAAO;AACP,WAAK,UAAU,KAAK,QAAQ,OAAO,GAAG,OAAO,KAAK;AACtD,QAAI,OAAO,KAAK;AACZ,UAAI,OAAO,KAAK,SAAS,OAAO,GAAG;AACnC,UAAI,CAAC;AACD,cAAM,IAAI,WAAW,yBAAyB,OAAO,GAAG,EAAE;AAC9D,WAAK,MAAM;AAAA,IACf;AACA,QAAI,OAAO;AACP,WAAK,aAAa,KAAK,WAAW,IAAI,OAAK;AACvC,YAAI,QAAQ,OAAO,WAAW,KAAK,OAAK,EAAE,QAAQ,CAAC;AACnD,eAAO,QAAQ,MAAM,KAAK;AAAA,MAC9B,CAAC;AACL,QAAI,OAAO,cAAc;AACrB,WAAK,eAAe,KAAK,aAAa,MAAM;AAC5C,WAAK,mBAAmB,KAAK,iBAAiB,IAAI,CAAC,GAAG,MAAM;AACxD,YAAI,QAAQ,OAAO,aAAa,KAAK,OAAK,EAAE,QAAQ,EAAE,QAAQ;AAC9D,YAAI,CAAC;AACD,iBAAO;AACX,YAAI,OAAO,OAAO,OAAO,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,MAAM,GAAG,CAAC;AACrE,aAAK,aAAa,CAAC,IAAI,eAAe,IAAI;AAC1C,eAAO;AAAA,MACX,CAAC;AAAA,IACL;AACA,QAAI,OAAO;AACP,WAAK,UAAU,OAAO;AAC1B,QAAI,OAAO;AACP,WAAK,UAAU,KAAK,aAAa,OAAO,OAAO;AACnD,QAAI,OAAO,UAAU;AACjB,WAAK,SAAS,OAAO;AACzB,QAAI,OAAO;AACP,WAAK,WAAW,KAAK,SAAS,OAAO,OAAO,IAAI;AACpD,QAAI,OAAO,gBAAgB;AACvB,WAAK,eAAe,OAAO;AAC/B,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAGA,cAAc;AACV,WAAO,KAAK,SAAS,SAAS;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,MAAM;AACV,WAAO,KAAK,YAAY,KAAK,UAAU,IAAI,IAAI,OAAO,QAAQ,KAAK,WAAW,KAAK,QAAQ,MAAM,IAAI,EAAE,QAAQ,IAAI;AAAA,EACvH;AAAA;AAAA;AAAA,EAGA,IAAI,UAAU;AAAE,WAAO,KAAK,UAAU;AAAA,EAAG;AAAA;AAAA,EAEzC,IAAI,UAAU;AAAE,WAAO,KAAK,QAAQ,MAAM,KAAK,IAAI,CAAC,CAAC;AAAA,EAAG;AAAA;AAAA,EAExD,kBAAkB,MAAM;AACpB,QAAI,OAAO,KAAK;AAChB,WAAO,QAAQ,OAAO,IAAI,KAAK,IAAI,KAAK;AAAA,EAC5C;AAAA;AAAA,EAEA,aAAa,SAAS;AAClB,QAAI,SAAS,OAAO,KAAK,KAAK,QAAQ,GAAG,QAAQ,OAAO,IAAI,MAAM,KAAK;AACvE,QAAI;AACA,eAAS,QAAQ,QAAQ,MAAM,GAAG,GAAG;AACjC,YAAI,KAAK,OAAO,QAAQ,IAAI;AAC5B,YAAI,MAAM;AACN,gBAAM,EAAE,IAAI;AAAA,MACpB;AACJ,QAAI,WAAW;AACf,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ;AAC/B,UAAI,CAAC,MAAM,CAAC,GAAG;AACX,iBAAS,IAAI,KAAK,SAAS,OAAO,CAAC,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,GAAG,MAAM;AAChE,WAAC,aAAa,WAAW,IAAI,WAAW,KAAK,UAAU,CAAC,IAAI,EAAE,IAAI;AAAA,MAC1E;AACJ,WAAO,IAAI,QAAQ,SAAS,OAAO,QAAQ;AAAA,EAC/C;AAAA;AAAA;AAAA,EAGA,OAAO,YAAY,MAAM;AACrB,WAAO,IAAI,UAAS,IAAI;AAAA,EAC5B;AACJ;AACA,SAAS,KAAK,MAAM,KAAK;AAAE,SAAO,KAAK,GAAG,IAAK,KAAK,MAAM,CAAC,KAAK;AAAK;AACrE,SAAS,aAAa,QAAQ;AAC1B,MAAI,OAAO;AACX,WAAS,SAAS,QAAQ;AACtB,QAAI,UAAU,MAAM,EAAE;AACtB,SAAK,MAAM,OAAO,MAAM,EAAE,OAAO,OAAO,WAAW,QAAQ,MAAM,MAAM,YACnE,MAAM,EAAE,OAAO;AAAA,MAAU,MAAM;AAAA,MAAO;AAAA;AAAA,IAA2B,MAChE,CAAC,QAAQ,KAAK,QAAQ,MAAM;AAC7B,aAAO;AAAA,EACf;AACA,SAAO;AACX;AACA,SAAS,eAAe,MAAM;AAC1B,MAAI,KAAK,UAAU;AACf,QAAI,OAAO,KAAK,SAAS,IAA4B;AACrD,WAAO,CAAC,OAAO,UAAW,KAAK,SAAS,OAAO,KAAK,KAAK,IAAK;AAAA,EAClE;AACA,SAAO,KAAK;AAChB;;;AC9rDO,IAAM,SAAS,SAAS,YAAY;AAAA,EACzC,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM;AAAA,EACN,WAAW;AAAA,EACX,SAAS;AAAA,EACT,cAAc,CAAC,CAAC;AAAA,EAChB,iBAAiB;AAAA,EACjB,WAAW;AAAA,EACX,YAAY,CAAC,GAAG,CAAC;AAAA,EACjB,UAAU,EAAC,UAAS,CAAC,GAAE,CAAC,EAAC;AAAA,EACzB,WAAW;AACb,CAAC;;;ACqFM,IAAM,gBAAgB,CAAI,QAAyB,cAAmB;AAC3E,QAAM,QAAQ,CAAC,MAAS,EAAC,iCAAQ,SAAS;AAC1C,MAAI,WAAW,QAAW;AACxB,WAAO;AAAA,EACT,WAAW,UAAU,KAAK,KAAK,GAAG;AAChC,WAAO,UAAU,OAAO,KAAK;AAAA,EAC/B,OAAO;AACL,WAAO,CAAC;AAAA,EACV;AACF;AAEO,IAAM,kBAAkB,CAC7B,aACA,OACA,aAEA,MAAM,OAAO,CAAC,MAAM,YAAY,UAAU,CAAC,MAAM,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE;;;ACrG5E,IAAM,uBAAuB,oBAAI,IAA+B;AAAA,EAC9D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AASM,IAAM,sBAAsB,CACjC,MAEA,MAAM,UACN,qBAAqB,IAAI,EAAE,EAA+B;AAOrD,IAAM,qBAAqB,CAChC,MACgC,MAAM,UAAa,EAAE,OAAO;AAcvD,SAAS,oBACd,GACwB;AACxB,SAAO,MAAM,WAAc,EAAE,OAAO,SAAS,EAAE,OAAO;AACxD;;;AC+BO,IAAM,gBAAgB,CAC3B,WACsC;AACtC,SAAO,OAAQ,OAAmC,QAAQ;AAC5D;AAkEA,IAAM,mBAAmB,CAAC;AAiCnB,SAAS,eACd,SACW;AACX,QAAM,QAAQ,aAAa;AAC3B,MAAI,SAAS;AACX,WAAO,QAAQ,OAAO,CAAC,KAAK,QAAQ,MAAM;AACxC,UAAI,OAAO,WAAW,UAAU;AAC9B,YAAI,MAAM,IAAI,QAAQ;AAAA,MACxB,WAAW,cAAc,MAAM,GAAG;AAChC,YAAI,OAAO,IAAI,IAAI,OAAO;AAAA,MAC5B,OAAO;AACL,YAAI,OAAO,IAAI,IAAI,QAAQ;AAAA,MAC7B;AACA,aAAO;AAAA,IACT,GAAG,CAAC,CAAc;AAAA,EACpB,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAaO,IAAM,eAAe;AAAA,EAC1B,KAAK;AAAA,EACL,YAAY;AAAA,EACZ,SAAS;AAAA,EACT,aAAa;AAAA,EACb,OAAO;AAAA,EACP,OAAO;AAAA,EACP,KAAK;AAAA,EACL,UAAU;AAAA,EACV,OAAO;AAAA;AAAA,EAEP,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,cAAc;AAAA,EACd,iBAAiB;AACnB;AA0dA,IAAM,EAAE,OAAO,QAAQ,IAAI;;;AC9sBpB,IAAM,iBAAiB,CAAC,SAA8C;AAA7E;AACE,QAAI,gBAAW,aAAX,mBAAqB,YAAW,QAAW;AAC7C,YAAO,gBAAW,SAAS,OACxB,MAAM,IAAI,EACV,KAAK,CAAC,QAAQ,IAAI,WAAW,GAAG,IAAI,GAAG,CAAC,MAFpC,mBAGH,MAAM,KAAK;AAAA,EACjB;AACF;;;ACKO,IAAM,aAAuB,EAAE,MAAM,GAAG,IAAI,EAAE;AAoC9C,SAAS,WAAW,EAAE,MAAM,IAAI,aAAa,EAAE,GAAuB;AAC3E,SAAO;AAAA,IACL,MAAM;AAAA,IACN,IAAI,KAAK;AAAA,IACT;AAAA,IACA,OAAO;AAAA,EACT;AACF;AAcO,IAAM,gBAAgB,CAC3B,EAAE,MAAM,OAAO,IAAI,IAAI,GACvB,aACa;AACb,QAAM,EAAE,MAAM,OAAO,IAAI,IAAI,IAAI;AACjC,QAAM,YAAY,SAAS,OAAO,OAAO;AACzC,QAAM,sBAAsB,QAAQ,SAAS,MAAM;AACnD,SAAO,aAAa,sBAChB,WACA,MAAM,MACN,EAAE,MAAM,KAAK,IAAI,IAAI,IACrB,EAAE,MAAM,OAAO,IAAI,MAAM;AAC/B;;;ACzDO,IAAM,WAAsB,EAAE,QAAQ,GAAG;AACzC,IAAM,SAAkB,EAAE,UAAU,CAAC,EAAE;AAEvC,IAAM,gBAAgC;AAAA,EAC3C,cAAc,CAAC;AAAA,EACf,SAAS,CAAC;AAAA,EACV,QAAQ;AAAA,EACR,SAAS,CAAC;AAAA,EACV,MAAM;AACR;AAOA,IAAM,yBAA8C,CAClD,EAAE,cAAc,KAAK,GACrB,EAAE,cAAc,KAAK,MAEpB,SAAS,WAAa,6BAAM,YAAW,KACvC,SAAS,WAAa,6BAAM,YAAW;AAE1C,IAAM,oBAAyC,CAC7C,EAAE,SAAS,MAAM,GACjB,EAAE,SAAS,MAAM,MAEhB,UAAU,WAAa,+BAAO,YAAW,KACzC,UAAU,WAAa,+BAAO,YAAW;AAE5C,IAAM,mBAAwC,CAC5C,EAAE,QAAQ,GAAG,GACb,EAAE,QAAQ,GAAG,MAEZ,OAAO,WAAa,yBAAI,YAAW,MACnC,OAAO,WAAa,yBAAI,YAAW;AAEtC,IAAM,oBAAyC,CAC7C,EAAE,SAAS,KAAK,GAChB,EAAE,SAAS,KAAK,MAEf,SAAS,WAAa,6BAAM,YAAW,KACvC,SAAS,WAAa,6BAAM,YAAW;AAE1C,IAAM,iBAAsC,CAAC,EAAE,MAAM,GAAG,GAAG,EAAE,MAAM,GAAG,MACnE,OAAO,WAAa,yBAAI,SAAS,YAAW,KAC5C,OAAO,WAAa,yBAAI,SAAS,YAAW;AAE/C,IAAM,iBAAiB,CAAC,GAAY,MAAe;AACjD,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT,WAAW,MAAM,UAAa,MAAM,QAAW;AAC7C,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAEA,IAAM,sBAA2C,CAAC,QAAQ,cAAc;AACtE,QAAM,EAAE,cAAc,KAAK,IAAI;AAC/B,QAAM,EAAE,cAAc,KAAK,IAAI;AAC/B,MAAI,eAAe,MAAM,IAAI,KAAK,uBAAuB,QAAQ,SAAS,GAAG;AAC3E,WAAO;AAAA,EACT,WAAW,SAAS,UAAa,SAAS,QAAW;AACnD,WAAO;AAAA,EACT,WAAW,KAAK,WAAW,KAAK,QAAQ;AACtC,WAAO;AAAA,EACT;AACA,SAAO,KAAK;AAAA,IACV,CAAC,EAAE,QAAQ,QAAQ,GAAG,MACpB,WAAW,KAAK,CAAC,EAAE,UAAU,YAAY,KAAK,CAAC,EAAE;AAAA,EACrD;AACF;AAEO,IAAM,iBAAsC,CAAC,QAAQ,cAAc;AACxE,QAAM,EAAE,SAAS,MAAM,IAAI;AAC3B,QAAM,EAAE,SAAS,MAAM,IAAI;AAE3B,MAAI,eAAe,OAAO,KAAK,KAAK,kBAAkB,QAAQ,SAAS,GAAG;AACxE,WAAO;AAAA,EACT,WAAW,UAAU,UAAa,UAAU,QAAW;AACrD,WAAO;AAAA,EACT,YAAW,+BAAO,aAAW,+BAAO,SAAQ;AAC1C,WAAO;AAAA,EACT;AACA,SAAO,MAAM,KAAK,CAAC,QAAQ,MAAM,YAAW,+BAAQ,GAAE;AACxD;AAEO,IAAM,gBAAqC,CAAC,IAAI,OAAO;AAhH9D;AAiHE,MAAI,iBAAiB,IAAI,EAAE,GAAG;AAC5B,WAAO;AAAA,EACT,OAAO;AACL,aAAO,QAAG,WAAH,mBAAW,cAAW,QAAG,WAAH,mBAAW;AAAA,EAC1C;AACF;AAEO,IAAM,iBAAsC,CAAC,QAAQ,cAAc;AACxE,QAAM,EAAE,SAAS,GAAG,IAAI;AACxB,QAAM,EAAE,SAAS,GAAG,IAAI;AACxB,MAAI,eAAe,IAAI,EAAE,KAAK,kBAAkB,QAAQ,SAAS,GAAG;AAClE,WAAO;AAAA,EACT,WAAW,OAAO,UAAa,OAAO,QAAW;AAC/C,WAAO;AAAA,EACT,YAAW,yBAAI,aAAW,yBAAI,SAAQ;AACpC,WAAO;AAAA,EACT;AACA,SAAO,GAAG,KAAK,CAAC,QAAQ,MAAM,YAAW,yBAAK,GAAE;AAClD;AAEA,IAAM,cAAmC,CAAC,QAAQ,cAAc;AAC9D,QAAM,EAAE,MAAM,GAAG,IAAI;AACrB,QAAM,EAAE,MAAM,GAAG,IAAI;AACrB,MAAI,eAAe,IAAI,EAAE,KAAK,eAAe,QAAQ,SAAS,GAAG;AAC/D,WAAO;AAAA,EACT,WAAW,OAAO,UAAa,OAAO,QAAW;AAC/C,WAAO;AAAA,EACT,YAAW,yBAAI,SAAS,aAAW,yBAAI,SAAS,SAAQ;AACtD,WAAO;AAAA,EACT;AACA,SAAO,GAAG,SAAS;AAAA,IACjB,CAAC,EAAE,QAAQ,SAAS,GAAG,MACrB,WAAW,GAAG,SAAS,CAAC,EAAE,UAAU,aAAa,GAAG,SAAS,CAAC,EAAE;AAAA,EACpE;AACF;AAEA,IAAM,oBAAyC,MAAM;AAEnD,SAAO;AACT;AAEO,IAAM,gBAAgB,CAC3B,QACA,cACG;AACH,MAAI,eAAe,QAAQ,SAAS,GAAG;AACrC,WAAO;AAAA,EACT;AAEA,MAAI,WAAW,UAAa,cAAc,QAAW;AACnD,WAAO;AAAA,EACT;AAEA,SACE,oBAAoB,QAAQ,SAAS,KACrC,eAAe,QAAQ,SAAS,KAChC,cAAc,QAAQ,SAAS,KAC/B,eAAe,QAAQ,SAAS,KAChC,YAAY,QAAQ,SAAS,KAC7B,kBAAkB,QAAQ,SAAS;AAEvC;AAEO,IAAM,aAAa,CAAC,WACzB,WAAW,UACX,OAAO,YAAY,UACnB,OAAO,QAAQ,SAAS;AAEnB,IAAM,YAAY,CAAC,YACxB,iCAAQ,YAAW,UAAa,OAAO,OAAO,OAAO,SAAS;AAEzD,IAAM,UAAU,CAAC,WAA+C;AAxLvE;AAyLE,2CAAQ,UAAS,UACjB,MAAM,SAAQ,YAAO,SAAP,mBAAa,QAAQ,KACnC,OAAO,KAAK,SAAS,SAAS;AAAA;AAuCzB,IAAM,qBAAqB,CAChC,WAC8D;AAC9D,MACE,OAAO,gBACP,OAAO,WACP,OAAO,UACP,OAAO,WACP,OAAO,MACP;AACA,WAAO;AAAA,EACT,OAAO;AACL,UAAM;AAAA,MACJ,eAAe,CAAC;AAAA,MAChB,UAAU,CAAC;AAAA,MACX,SAAS,EAAE,QAAQ,GAAG;AAAA,MACtB,UAAU,CAAC;AAAA,MACX,OAAO,EAAE,UAAU,CAAC,EAAE;AAAA,MACtB;AAAA,IACF,IAAI;AAEJ,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;AClOA,IAAM,YAAY,CAAC,SAAS,QAAQ,QAAQ,OAAO;AACnD,IAAM,kBAAkB,CAAC,UACvB,OAAO,UAAU,YAAY,UAAU,SAAS,KAAK;AAEvD,IAAM,oBAA8B;AAIpC,IAAM,QAAQ,MAAM;AAEpB,IAAM,sBACJ,QAAwC,UAAU;AAEpD,IAAM,EAAE,eAAe,oBAAoB,IAAI,mBAAmB;AAK3D,IAAM,SAAS,CAAC,aAAqB;AAC1C,QAAM,eAAe,iBAAiB;AACtC,QAAM,cAAc,gBAAgB,iBAAiB;AACrD,QAAM,cAAc,eAAe,iBAAiB;AACpD,QAAM,eAAe,eAAe,iBAAiB;AAErD,QAAM,OAAO,cACT,CAAC,YAAoB,QAAQ,KAAK,IAAI,QAAQ,KAAK,OAAO,EAAE,IAC5D;AACJ,QAAM,OAAO,cACT,CAAC,YAAoB,QAAQ,KAAK,IAAI,QAAQ,KAAK,OAAO,EAAE,IAC5D;AACJ,QAAMC,SAAQ,eACV,CAAC,YAAoB,QAAQ,MAAM,IAAI,QAAQ,KAAK,OAAO,EAAE,IAC7D;AACJ,QAAM,QAAQ,eACV,CAAC,YAAoB,QAAQ,MAAM,IAAI,QAAQ,KAAK,OAAO,EAAE,IAC7D;AAEJ,MAAI,OAAuC;AACzC,WAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF,OAAO;AACL,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAAA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,qBAAqB;AAC5B,MAAI,OAAO,oBAAoB,aAAa;AAC1C,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,MACL,cAAc,0BAA0B;AAAA,IAC1C;AAAA,EACF;AACF;AAEA,SAAS,4BAAsC;AAC7C,QAAM,QAAQ,eAAe,mBAAmB;AAChD,MAAI,gBAAgB,KAAK,GAAG;AAC1B,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,EACT;AACF;;;ACpGA,SAAS,mBACP,WAC8B;AAC9B,SAAO,MAAM,QAAQ,SAAS;AAChC;AAEA,SAAS,eACP,WAC4B;AAC5B,SAAO,CAAC,MAAM,QAAQ,SAAS;AACjC;AAbA;AAuBO,IAAM,eAAN,MAEP;AAAA,EAFO;AAGL,gCAAoD,oBAAI,IAAI;AAAA;AAAA,EAE5D,YAAoC,OAAU,UAAqB;AACjE,UAAM,YAAY,mBAAK,SAAQ,IAAI,KAAK;AAExC,QAAI,CAAC,WAAW;AACd,yBAAK,SAAQ,IAAI,OAAO,QAAQ;AAAA,IAClC,WAAW,mBAAmB,SAAS,GAAG;AACxC,gBAAU,KAAK,QAAQ;AAAA,IACzB,WAAW,eAAe,SAAS,GAAG;AACpC,yBAAK,SAAQ,IAAI,OAAO,CAAC,WAAW,QAAQ,CAAC;AAAA,IAC/C;AAAA,EACF;AAAA,EAEA,eAAuC,OAAU,UAAqB;AACpE,QAAI,CAAC,mBAAK,SAAQ,IAAI,KAAK,GAAG;AAC5B;AAAA,IACF;AAEA,UAAM,sBAAsB,mBAAK,SAAQ,IAAI,KAAK;AAClD,QAAI,WAAW;AAEf,QAAI,wBAAwB,UAAU;AACpC,yBAAK,SAAQ,OAAO,KAAK;AAAA,IAC3B,WAAW,MAAM,QAAQ,mBAAmB,GAAG;AAC7C,eAAS,IAAI,QAAQ,MAAM,KAAK;AAC9B,YAAI,oBAAoB,CAAC,MAAM,UAAU;AACvC,qBAAW;AACX;AAAA,QACF;AAAA,MACF;AAEA,UAAI,WAAW,GAAG;AAChB;AAAA,MACF;AAEA,UAAI,oBAAoB,WAAW,GAAG;AACpC,4BAAoB,SAAS;AAC7B,2BAAK,SAAQ,OAAO,KAAK;AAAA,MAC3B,OAAO;AACL,4BAAoB,OAAO,UAAU,CAAC;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,mBAA2C,OAAW;AACpD,QAAI,SAAS,mBAAK,SAAQ,IAAI,KAAK,GAAG;AACpC,yBAAK,SAAQ,OAAO,KAAK;AAAA,IAC3B,WAAW,UAAU,QAAW;AAC9B,yBAAK,SAAQ,MAAM;AAAA,IACrB;AAAA,EACF;AAAA,EAEA,KAA6B,UAAa,MAA6B;AACrE,QAAI,mBAAK,UAAS;AAChB,YAAM,UAAU,mBAAK,SAAQ,IAAI,KAAK;AACtC,UAAI,SAAS;AACX,aAAK,cAAc,SAAS,IAAI;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,KAA6B,OAAU,UAAqB;AAC1D,UAAM,UAAW,IAAI,SAAS;AAC5B,WAAK,eAAe,OAAO,OAAO;AAClC,eAAS,GAAG,IAAI;AAAA,IAClB;AAEA,SAAK,GAAG,OAAO,OAAO;AAAA,EACxB;AAAA,EAEA,GAA2B,OAAU,UAAqB;AACxD,SAAK,YAAY,OAAO,QAAQ;AAAA,EAClC;AAAA,EAEA,YAAoC,OAAU,UAAqB;AACjE,UAAM,YAAY,mBAAK,SAAQ,IAAI,KAAK;AACxC,QAAI,MAAM,QAAQ,SAAS,GAAG;AAC5B,aAAO,UAAU,SAAS,QAAQ;AAAA,IACpC,OAAO;AACL,aAAO,cAAc;AAAA,IACvB;AAAA,EACF;AAAA,EAEQ,cAAc,SAAqC,MAAiB;AAC1E,QAAI,mBAAmB,OAAO,GAAG;AAC/B,cAAQ,MAAM,EAAE,QAAQ,CAAC,aAAa,KAAK,cAAc,UAAU,IAAI,CAAC;AAAA,IAC1E,OAAO;AACL,cAAQ,KAAK,QAAQ;AAAA,QACnB,KAAK;AACH,kBAAQ;AACR;AAAA,QACF,KAAK;AACH,kBAAQ,KAAK,CAAC,CAAC;AACf;AAAA,QACF,KAAK;AACH,kBAAQ,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AACxB;AAAA,QAEF;AACE,kBAAQ,KAAK,MAAM,GAAG,IAAI;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AACF;AAxGE;;;ACxBK,IAAM,SAAN,MAAa;AAAA,EAKlB,YAAY,OAAiB;AAC3B,SAAK,OAAO,oBAAI,IAAoB;AACpC,SAAK,OAAO,CAAC;AACb,SAAK,eAAe;AACpB,SAAK,MAAM,KAAK;AAAA,EAClB;AAAA,EAEO,OAAe;AACpB,QAAI,KAAK,KAAK,SAAS,GAAG;AACxB,aAAO,KAAK,KAAK,IAAI;AAAA,IACvB,OAAO;AACL,aAAO,KAAK;AAAA,IACd;AAAA,EACF;AAAA,EAEO,MAAM,EAAE,MAAM,GAAG,GAAa;AACnC,SAAK,KAAK,QAAQ,CAAC,UAAU,aAAa;AACxC,UAAI,WAAW,QAAQ,YAAY,IAAI;AACrC,aAAK,KAAK,KAAK,QAAQ;AACvB,aAAK,KAAK,OAAO,QAAQ;AAAA,MAC3B;AAAA,IACF,CAAC;AAED,UAAM,OAAO,KAAK;AAClB,QAAI,KAAK,KAAK,OAAO,KAAK,KAAK,SAAS,MAAM;AAC5C,WAAK,KAAK,SAAS,KAAK,IAAI,GAAG,OAAO,KAAK,KAAK,IAAI;AAAA,IACtD;AAEA,aAAS,WAAW,MAAM,WAAW,IAAI,YAAY;AACnD,UAAI,CAAC,KAAK,KAAK,IAAI,QAAQ,GAAG;AAC5B,cAAM,eAAe,KAAK,KAAK;AAC/B,aAAK,KAAK,IAAI,UAAU,YAAY;AAAA,MACtC;AAAA,IACF;AAEA,QAAI,KAAK,eAAe,KAAK,KAAK,MAAM;AACtC,WAAK,eAAe,KAAK,KAAK;AAAA,IAChC;AAAA,EACF;AAAA,EAEO,OAAO,UAA0B;AACtC,UAAM,MAAM,KAAK,KAAK,IAAI,QAAQ;AAClC,QAAI,QAAQ,QAAW;AACrB,cAAQ,IAAI;AAAA,gBACF,KAAK,cAAc,CAAC;AAAA,iBACnB,KAAK,KAAK,KAAK,GAAG,CAAC;AAAA,OAC7B;AACD,YAAM,MAAM,qCAAqC,QAAQ,EAAE;AAAA,IAC7D;AACA,WAAO;AAAA,EACT;AAAA,EAEO,gBAAgB;AACrB,WAAO,MAAM,KAAK,KAAK,KAAK,QAAQ,CAAC,EAClC,IAAY,CAAC,GAAG,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,EAClC,KAAK,GAAG;AAAA,EACb;AACF;;;AC5DO,IAAM,OAAO,CAAC,OAAO,OAAe;AACzC,MAAI,KAAK;AACT,QAAM,QAAQ,OAAO,gBAAgB,IAAI,WAAW,IAAI,CAAC;AAGzD,SAAO,QAAQ;AAMb,UAAM,OAAO,MAAM,IAAI,IAAI;AAC3B,QAAI,OAAO,IAAI;AAEb,YAAM,KAAK,SAAS,EAAE;AAAA,IACxB,WAAW,OAAO,IAAI;AAEpB,aAAO,OAAO,IAAI,SAAS,EAAE,EAAE,YAAY;AAAA,IAC7C,WAAW,OAAO,IAAI;AACpB,YAAM;AAAA,IACR,OAAO;AACL,YAAM;AAAA,IACR;AAAA,EACF;AACA,SAAO;AACT;;;AClBA,IAAM,EAAE,SAAS,IAAI;AAEd,IAAM,cAAc;AAAA,EACzB,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AAAA,EACP,MAAM;AACR;AA2NA,IAAM,gBAAgB,CAAC,OAAmB,UACxC,SAAS,MAAM,CAAC,KAAK,SAAS,MAAM,CAAC;AAEvC,IAAM,sBACJ,YAAY,OAAO,YAAY,QAAQ,YAAY;AACrD,IAAM,8BAA8B,YAAY,OAAO,YAAY;AACnE,IAAM,6BAA6B,YAAY,OAAO,YAAY;AAO3D,IAAM,qBAAqB,CAChC,UACA,cACW;AACX,aAAW,QAAQ,UAAU;AAC3B,QAAI,OAAO,SAAS,UAAU;AAC5B,UAAI,SAAS,WAAW;AACtB,eAAO;AAAA,MACT;AAAA,IACF,WAAW,cAAc,MAAM,SAAS,GAAG;AACzC,UAAI,cAAc,KAAK,CAAC,GAAG;AACzB,eAAO;AAAA,MACT,WAAW,cAAc,KAAK,CAAC,GAAG;AAChC,eAAO;AAAA,MACT,OAAO;AACL,eAAO,YAAY;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AACA,SAAO,YAAY;AACrB;;;AC9QA;AAaA,IAAM,mBAAN,MAAuB;AAAA,EAAvB;AAEE,gCAAuC;AAAA;AAAA,EAEvC,sBAAsB,IAAY,SAAS,mBAAK,UAAS;AACvD,QAAI,oBAAoB,MAAM,KAAK,OAAO,OAAO,IAAI;AACnD;AAAA,IACF,OAAO;AACL,yBAAK,SAAU;AAAA,QACb;AAAA,QACA,SAAS,CAAC,mBAAK,QAAiB;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,QAAyB;AAC3B,QAAI,mBAAK,aAAY,QAAW;AAC9B,yBAAK,SAAU;AAAA,IACjB,WAAW,oBAAoB,mBAAK,QAAO,GAAG;AAC5C,yBAAK,SAAQ,QAAQ,KAAK,MAAgB;AAAA,IAC5C,OAAO;AACL,YAAM,MAAM,2CAA2C;AAAA,IACzD;AAAA,EACF;AAAA,EAEA,UAAU,QAAgB,SAAS,mBAAK,UAAS;AAC/C,QAAI,oBAAoB,MAAM,GAAG;AAC/B,YAAM,SAAS,OAAO,QAAQ,GAAG,EAAE;AACnC,UAAI,QAAQ;AACV,aAAK,UAAU,QAAQ,MAAM;AAAA,MAC/B;AAAA,IACF,WAAW,QAAQ;AACjB,aAAO,SAAS;AAAA,IAClB;AAAA,EACF;AAAA,EACA,MAAM,OAAe,SAAS,mBAAK,UAAS;AAC1C,QAAI,oBAAoB,MAAM,GAAG;AAC/B,YAAM,SAAS,OAAO,QAAQ,GAAG,EAAE;AACnC,UAAI,QAAQ;AACV,aAAK,MAAM,OAAO,MAAM;AAAA,MAC1B;AAAA,IACF,WAAW,QAAQ;AACjB,aAAO,KAAK;AAAA,IAGd;AAAA,EACF;AAAA,EACA,SAAS,OAAkC,SAAS,mBAAK,UAAS;AA5DpE;AA6DI,QAAI,oBAAoB,MAAM,GAAG;AAC/B,YAAM,SAAS,OAAO,QAAQ,GAAG,EAAE;AACnC,UAAI,QAAQ;AACV,aAAK,SAAS,OAAO,MAAM;AAAA,MAC7B;AAAA,IACF,WAAW,mBAAmB,MAAM,GAAG;AACrC,mBAAO,WAAP,mBAAO,SAAW,CAAC;AAGnB,aAAO,OAAO,KAAK,KAAK;AAAA,IAC1B,WAAW,oBAAoB,MAAM,GAAG;AACtC,aAAO,QAAQ;AAAA,IACjB;AAAA,EACF;AAAA,EAEA,OAAO,SAAS,mBAAK,UAAS;AAC5B,QAAI,KAAK,MAAM;AACb,aAAO;AAAA,QACL,GAAG;AAAA,QACH,MAAM,KAAK;AAAA,MACb;AAAA,IACF,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAvEE;AAyEK,IAAM,WAAW,CAAC,MAAY,WAAmB;AACtD,QAAM,mBAAmB,IAAI,iBAAiB;AAC9C,QAAM,SAAS,KAAK,OAAO;AAC3B,KAAG;AACD,UAAM,EAAE,MAAM,MAAM,GAAG,IAAI;AAC3B,YAAQ,MAAM;AAAA,MACZ,KAAK;AACH,yBAAiB,IAAI,CAAC,CAAC;AACvB;AAAA,MACF,KAAK;AACH,yBAAiB,IAAI,EAAE,IAAI,KAAK,CAAC;AACjC;AAAA,MAEF,KAAK;AAAA,MACL,KAAK;AACH,yBAAiB,sBAAsB,OAAO,UAAU,MAAM,EAAE,CAAC;AACjE;AAAA,MAEF,KAAK;AACH,yBAAiB,UAAU,OAAO,UAAU,MAAM,EAAE,CAAC;AACrD;AAAA,MAEF,KAAK;AACH,yBAAiB,MAAM,OAAO,UAAU,MAAM,EAAE,CAAC;AACjD;AAAA,MAEF,KAAK;AACH,yBAAiB,SAAS,OAAO,UAAU,OAAO,GAAG,KAAK,CAAC,CAAC;AAC5D;AAAA,MAEF,KAAK;AACH,yBAAiB,SAAS,WAAW,OAAO,UAAU,MAAM,EAAE,CAAC,CAAC;AAChE;AAAA,MAEF,KAAK;AACH,yBAAiB,SAAS,IAAI;AAC9B;AAAA,MAEF,KAAK;AACH,yBAAiB,SAAS,KAAK;AAC/B;AAAA,MAEF,KAAK;AACH,yBAAiB,OAAO,OAAO,UAAU,MAAM,EAAE;AACjD;AAAA,MAEF;AAAA,IACF;AAAA,EACF,SAAS,OAAO,KAAK;AAErB,SAAO,iBAAiB,OAAO;AACjC;;;ACvIA,IAAM,eAAe,OAAO,UAAU,EAAE,QAAQ,KAAK,CAAC;AAE/C,IAAM,cAAc,CAAC,gBAAgC;AAC1D,QAAM,YAAY,aAAa,MAAM,WAAW;AAChD,QAAM,SAAS,SAAS,WAAW,WAAW;AAC9C,SAAO;AACT;;;AC0BO,SAAS,gBACd,WACA,QACiB;AAEjB,UAAQ,OAAO,IAAI;AAAA,IACjB,KAAK;AACH,aAAO,YAAY,WAAW,MAAM;AAAA,IACtC,KAAK;AACH,aAAO,OAAO,WAAW,MAAM;AAAA,IACjC,KAAK;AACH,aAAO,OAAO,WAAW,MAAM;AAAA,IACjC,KAAK;AACH,aAAO,OAAO,WAAW,MAAM;AAAA,IACjC,KAAK;AACH,aAAO,OAAO,WAAW,MAAM;AAAA,IACjC,KAAK;AACH,aAAO,OAAO,WAAW,MAAM;AAAA,IACjC,KAAK;AACH,aAAO,OAAO,WAAW,MAAM;AAAA,IACjC,KAAK;AACH,aAAO,QAAQ,WAAW,MAAmB;AAAA,IAC/C,KAAK;AACH,aAAO,OAAO,WAAW,MAAkB;AAAA,IAC7C;AACE,cAAQ,IAAI,4BAA4B,OAAO,EAAE,EAAE;AACnD,aAAO,MAAM;AAAA,EACjB;AACF;AAIA,IAAM,cAAc,CAClB,WACA,WACoB;AACpB,SAAO,CAAC,QACL,OAAO,OAAqB,QAAQ,IAAI,UAAU,OAAO,MAAM,CAAC,CAAC,MAAM;AAC5E;AAEA,IAAM,SAAS,CACb,WACA,WACoB;AACpB,SAAO,CAAC,QAAQ,IAAI,UAAU,OAAO,MAAM,CAAC,MAAM,OAAO;AAC3D;AAEA,IAAM,SAAS,CACb,WACA,WACoB;AACpB,SAAO,CAAC,QAAQ,IAAI,UAAU,OAAO,MAAM,CAAC,IAAI,OAAO;AACzD;AACA,IAAM,SAAS,CACb,WACA,WACoB;AACpB,SAAO,CAAC,QAAQ,IAAI,UAAU,OAAO,MAAM,CAAC,KAAK,OAAO;AAC1D;AAEA,IAAM,SAAS,CACb,WACA,WACoB;AACpB,SAAO,CAAC,QAAQ,IAAI,UAAU,OAAO,MAAM,CAAC,IAAI,OAAO;AACzD;AACA,IAAM,SAAS,CACb,WACA,WACoB;AACpB,SAAO,CAAC,QAAQ,IAAI,UAAU,OAAO,MAAM,CAAC,KAAK,OAAO;AAC1D;AAEA,IAAM,SAAS,CACb,WACA,WACoB;AACpB,QAAM,cAAc,OAAO;AAC3B,MAAI,OAAO,gBAAgB,UAAU;AACnC,UAAM,MAAM,8CAA8C;AAAA,EAC5D;AACA,SAAO,CAAC,QAAQ;AACd,UAAM,WAAW,IAAI,UAAU,OAAO,MAAM,CAAC;AAC7C,QAAI,OAAO,aAAa,UAAU;AAChC,YAAM,MAAM,8CAA8C;AAAA,IAC5D;AACA,WAAO,SAAS,YAAY,EAAE,WAAW,YAAY,YAAY,CAAC;AAAA,EACpE;AACF;AAEA,IAAM,UAAU,CAAC,WAAsB,WAAuC;AAC5E,QAAM,UAAU,OAAO,QAAQ,IAAI,CAAC,OAAO,gBAAgB,WAAW,EAAE,CAAC;AACzE,SAAO,CAAC,QAAQ,QAAQ,MAAM,CAAC,OAAO,GAAG,GAAG,CAAC;AAC/C;AAEA,SAAS,OAAO,WAAsB,QAAmC;AACvE,QAAM,UAAU,OAAO,QAAQ,IAAI,CAAC,OAAO,gBAAgB,WAAW,EAAE,CAAC;AACzE,SAAO,CAAC,QAAQ,QAAQ,KAAK,CAAC,OAAO,GAAG,GAAG,CAAC;AAC9C;;;AC/HO,IAAM,gBAAgB,CAC3B,cACA,YACA,SACA,UACA,WACA,aACG;AACH,QAAM,YAAY,aAAa,WAAW,YAAY;AACtD,QAAM,UAAU,aAAa,aAAa,SAAS,CAAC,EAAE;AACtD,QAAM,eAAe,QAAQ,IAAY,CAAC,WAAW,UAAU,MAAM,CAAC;AAEtE,UAAQ,SAAS;AAAA,IACf,KAAK;AACH,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,KAAK;AACH,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,KAAK;AACH,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,KAAK;AACH,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,KAAK;AACH,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,KAAK;AACH,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,EACJ;AACF;AAEA,SAAS,eACP,UACA,WACA,cACA,YACA,cAC2B;AAC3B,QAAM,SAAoC,CAAC;AAC3C,QAAM,YAAY,aAAa,WAAW,YAAY;AAEtD,WAAS,eAAe,KAAyB;AAC/C,QAAI,MAAM,QAAQ,GAAG,GAAG;AACtB,aAAO,IAAI;AAAA,IACb,OAAO;AACL,UAAI,QAAQ;AACZ,iBAAW,OAAO,KAAK;AACrB,iBAAS,IAAI,eAAe,IAAI,GAAG,CAAC;AAAA,MACtC;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,aAAW,OAAO,UAAU;AAC1B,UAAM,QAAQ,eAAe,SAAS,GAAG,CAAC;AAC1C,WAAO,GAAG,IAAI;AAAA,EAChB;AAEA,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS;AACtD,eAAW,OAAO,QAAQ;AACxB,UAAI,WAAW,KAAK,EAAE,aAAa,CAAC,CAAC,MAAM,KAAK;AAC9C,mBAAW,KAAK,EAAE,SAAS,IAAI,OAAO,GAAG;AAAA,MAC3C;AAAA,IACF;AAAA,EACF;AAEA,UAAQ,IAAI,mBAAmB,UAAU;AACzC,UAAQ,IAAI,eAAe,MAAM;AACjC,SAAO;AACT;AAEA,SAAS,aAAa,WAAsB,cAAgC;AAC1E,UAAQ,IAAI,2BAA2B,aAAa,MAAM;AAC1D,QAAM,aAAa,aAAa,aAAa,SAAS,CAAC,EAAE;AACzD,QAAM,eAAe,UAAU,UAAU;AACzC,SAAO;AACT;AAEA,SAAS,aACP,UACA,UACA,WACA,cACA,YACA,cAC2B;AAC3B,QAAM,OAAkC,CAAC;AACzC,QAAM,YAAY,aAAa,WAAW,YAAY;AAEtD,WAAS,aACP,KACAC,WACAC,YACA;AACA,QAAI,MAAM,QAAQ,GAAG,GAAG;AACtB,UAAI,MAAM;AACV,iBAAW,OAAO,KAAK;AACrB,eAAO,OAAOD,UAAS,GAAG,EAAEC,UAAS,CAAC;AAAA,MACxC;AACA,aAAO;AAAA,IACT,OAAO;AACL,UAAI,MAAM;AACV,iBAAW,OAAO,KAAK;AACrB,eAAO,aAAa,IAAI,GAAG,GAAGD,WAAUC,UAAS;AAAA,MACnD;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,aAAW,OAAO,UAAU;AAC1B,YAAQ,IAAI,GAAG;AACf,UAAM,MAAM,OAAO,aAAa,SAAS,GAAG,GAAG,UAAU,SAAS,CAAC;AACnE,SAAK,GAAG,IAAI;AAAA,EACd;AAEA,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS;AACtD,eAAW,OAAO,MAAM;AACtB,UAAI,WAAW,KAAK,EAAE,aAAa,CAAC,CAAC,MAAM,KAAK;AAC9C,mBAAW,KAAK,EAAE,SAAS,IAAI,KAAK,GAAG;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,UAAQ,IAAI,mBAAmB,UAAU;AACzC,UAAQ,IAAI,aAAa,IAAI;AAC7B,SAAO;AACT;AAEA,SAAS,iBACP,UACA,UACA,WACA,cACA,YACA,cAC2B;AAC3B,QAAM,WAAsC,CAAC;AAC7C,QAAM,YAAY,aAAa,WAAW,YAAY;AAEtD,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,MAAM;AAAA,IACV;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,aAAW,OAAO,OAAO;AACvB,QAAI,UAAU;AACd,cAAU,IAAI,GAAG,IAAI,MAAM,GAAG;AAC9B,aAAS,GAAG,IAAI;AAAA,EAClB;AAEA,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS;AACtD,eAAW,OAAO,UAAU;AAC1B,UAAI,WAAW,KAAK,EAAE,aAAa,CAAC,CAAC,MAAM,KAAK;AAC9C,mBAAW,KAAK,EAAE,SAAS,IAAI,SAAS,GAAG;AAAA,MAC7C;AAAA,IACF;AAAA,EACF;AAEA,UAAQ,IAAI,mBAAmB,UAAU;AACzC,UAAQ,IAAI,iBAAiB,QAAQ;AACrC,SAAO;AACT;AAEA,SAAS,kBACP,KACA,UACA,WACU;AACV,QAAM,OAAiB,CAAC;AAExB,MAAI,MAAM,QAAQ,GAAG,GAAG;AACtB,eAAW,OAAO,KAAK;AACrB,WAAK,KAAK,SAAS,GAAG,EAAE,SAAS,CAAW;AAAA,IAC9C;AAAA,EACF,OAAO;AACL,eAAW,OAAO,KAAK;AACrB,WAAK,KAAK,GAAG,kBAAkB,IAAI,GAAG,GAAG,UAAU,SAAS,CAAC;AAAA,IAC/D;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,kBACP,UACA,UACA,WACA,cACA,YACA,cAC2B;AAC3B,QAAM,YAAuC,CAAC;AAC9C,QAAM,YAAY,aAAa,WAAW,YAAY;AAEtD,aAAW,OAAO,UAAU;AAC1B,UAAM,iBAAiB;AAAA,MACrB,SAAS,GAAG;AAAA,MACZ;AAAA,MACA;AAAA,IACF;AACA,UAAM,WAAgB,CAAC,GAAG,IAAI,IAAI,cAAc,CAAC;AAEjD,cAAU,GAAG,IAAI;AAAA,EACnB;AAEA,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS;AACtD,eAAW,OAAO,WAAW;AAC3B,UAAI,WAAW,KAAK,EAAE,aAAa,CAAC,CAAC,MAAM,KAAK;AAC9C,mBAAW,KAAK,EAAE,SAAS,IAAI,UAAU,GAAG;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,cACP,UACA,UACA,WACA,cACA,YACA,cAC2B;AAC3B,QAAM,QAAmC,CAAC;AAC1C,QAAM,YAAY,aAAa,WAAW,YAAY;AAEtD,aAAW,OAAO,UAAU;AAC1B,UAAM,iBAAiB;AAAA,MACrB,SAAS,GAAG;AAAA,MACZ;AAAA,MACA;AAAA,IACF;AACA,UAAM,YAAY,KAAK,IAAI,GAAG,cAAc;AAE5C,UAAM,GAAG,IAAI;AAAA,EACf;AACA,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS;AACtD,eAAW,OAAO,OAAO;AACvB,UAAI,WAAW,KAAK,EAAE,aAAa,CAAC,CAAC,MAAM,KAAK;AAC9C,mBAAW,KAAK,EAAE,SAAS,IAAI,MAAM,GAAG;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,aACP,UACA,UACA,WACA,cACA,YACA,cAC2B;AAC3B,QAAM,OAAkC,CAAC;AACzC,QAAM,YAAY,aAAa,WAAW,YAAY;AAEtD,aAAW,OAAO,UAAU;AAC1B,UAAM,iBAAiB;AAAA,MACrB,SAAS,GAAG;AAAA,MACZ;AAAA,MACA;AAAA,IACF;AACA,UAAM,YAAY,KAAK,IAAI,GAAG,cAAc;AAC5C,SAAK,GAAG,IAAI;AAAA,EACd;AAEA,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS;AACtD,eAAW,OAAO,MAAM;AACtB,UAAI,WAAW,KAAK,EAAE,aAAa,CAAC,CAAC,MAAM,KAAK;AAC9C,mBAAW,KAAK,EAAE,SAAS,IAAI,KAAK,GAAG;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;;;ACtUA,IAAM,EAAE,YAAY,UAAAC,UAAS,IAAI;AAE1B,IAAM,cAAc,CACzB,KACA,MACA,WACA,gBACG;AACH,QAAM,CAAC,QAAQ,IAAI;AACnB,MAAI;AACJ,MAAI,aAAa;AAGf,UAAM,EAAE,MAAM,IAAI;AAClB,gBAAY,IACT,MAAM,GAAG,KAAK,EACd,OAAO,YAAY,IAAI,CAAC,QAAQ,IAAI,GAAG,CAAC,CAAC;AAAA,EAC9C,OAAO;AACL,gBAAY,IAAI,MAAM;AAAA,EACxB;AACA,YAAU,UAAU,IAAI,KAAK,OAAO,QAAQ;AAC5C,YAAUA,SAAQ,IAAI,mBAAmB,WAAW,QAAQ;AAC5D,SAAO;AACT;AAEA,IAAM,gBAAgB,CAAC,WAAsB,YAAwB;AACnE,MAAI,SAAS;AACX,UAAM,EAAE,OAAO,UAAU,IAAI;AAC7B,eAAW,CAAC,YAAY,KAAK,KAAK,OAAO,QAAQ,SAAS,GAAG;AAC3D,YAAM,UAAU,QAAQ,UAAU;AAClC,UAAI,YAAY,QAAW;AACzB,cAAM;AAAA,UACJ,0BAA0B,UAAU;AAAA,QACtC;AAAA,MACF,WAAW,YAAY,QAAQ,WAAW;AACxC,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAM,iBAAiB,CAAC,WAAsB,YAAuB;AACnE,QAAM,EAAE,OAAO,UAAU,IAAI;AAC7B,QAAM,SAAmB,CAAC;AAC1B,SAAO,QAAQ,SAAS,EAAE,QAAQ,CAAC,CAAC,UAAU,MAAM;AAClD,WAAO,KAAK,QAAQ,UAAU,IAAI,SAAS;AAAA,EAC7C,CAAC;AACD,SAAO;AACT;AAEO,IAAM,uBAAuB,CAClC,WACA,YACyB;AACzB,MAAI,WAAW,cAAc,WAAW,OAAO,GAAG;AAChD,WAAO,eAAe,WAAW,OAAO;AAAA,EAC1C;AACA,SAAO;AACT;;;AC5DA,IAAM,EAAE,OAAAC,QAAO,aAAa,IAAI,IAAI;AAE7B,IAAM,gBAAgB,CAC3B,KACA,gBACoB;AACpB,QAAM,OAAwB,CAAC;AAE/B,WACM,IAAI,GAAG,MAAM,GAAG,YAAY,OAAO,MAAM,YAAY,QACzD,IAAI,KACJ,KACA;AACA,UAAM,MAAM,YAAY,CAAC;AACzB,UAAM,EAAE,CAACA,MAAK,GAAG,OAAO,CAAC,GAAG,GAAG,OAAO,IAAI;AAC1C,QAAI,WAAW,KAAK;AAClB,YAAM,eAAe,IAAI,MAAM;AAC/B,mBAAa,WAAW,IAAI;AAC5B,WAAK,KAAK,YAAY;AACtB,aAAO;AACP,kBAAY;AACZ,aAAO,IAAI,MAAM,KAAK,YAAY,IAAI,CAAC,EAAEA,MAAK,IAAI,OAAO;AACvD,aAAK;AAAA,MACP;AAAA,IACF,WAAW,WAAW;AACpB,YAAM,SAAS,IAAI,MAAM;AACzB,aAAO,CAAC,IAAI;AACZ,aAAO,CAAC,IAAI;AACZ,WAAK,KAAK,MAAM;AAChB,aAAO;AAAA,IACT,OAAO;AACL,WAAK,KAAK,GAAG;AACb,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAEO,IAAM,cAAc,CACzB,MACA,YACA,SACA,WACA,UACA,kBACoB;AACpB,QAAM,eAAe,QAAQ,IAAY,CAAC,WAAW,UAAU,MAAM,CAAC;AACtE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,IAAM,sBAAsB,CAC1B,UACA,cACA,UACA,aAAuC,CAAC,GACxC,OAAO,SACP,QAAQ,GACR,OAAwB,CAAC,GACzB,kBACG;AACH,UAAQ,IAAI,wBAAwB;AACpC,QAAM,OAAO,OAAO,KAAK,QAAQ,EAAE,KAAK;AACxC,aAAW,OAAO,MAAM;AACtB,UAAM,MAAM,KAAK;AACjB,UAAM,WAAW,GAAG,IAAI,IAAI,GAAG;AAC/B,UAAM,MAAqB,CAAC,KAAK,KAAK,OAAO,OAAO,OAAO,GAAG,UAAU,CAAC;AAEzE,QAAI,aAAa,QAAQ,CAAC,CAAC,IAAI;AAC/B,SAAK,KAAK,GAAG;AAEb,QAAI,SAAS,SAAS,QAAQ,GAAG;AAC/B,UAAI,WAAW,IAAI;AACnB,UAAI,MAAM,QAAQ,SAAS,GAAG,CAAC,GAAG;AAChC;AAAA,UACE;AAAA,UACA,SAAS,GAAG;AAAA,UACZ;AAAA,UACA;AAAA,UACA,QAAQ;AAAA,QACV;AAAA,MACF,OAAO;AACL;AAAA,UACE,SAAS,GAAG;AAAA,UACZ;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,QAAQ;AAAA,UACR;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,UAAQ,IAAI,wBAAwB;AAEpC,aAAW,OAAO,MAAM;AACtB,eAAW,SAAS,MAAM;AACxB,UAAI,KAAK,GAAG,EAAE,CAAC,MAAM,SAAS,cAAc,KAAK,KAAK,QAAW;AAC/D,YACE,KAAK,GAAG,EAAE,aAAa,CAAC,CAAC,MAAM,cAAc,KAAK,EAAE,aAAa,CAAC,CAAC,GACnE;AACA,eAAK,GAAG,IAAI,KAAK,GAAG,EAAE,OAAO,GAAG,CAAC,EAAE;AAAA,YACjC,cAAc,KAAK,EAAE;AAAA,cACnB;AAAA;AAAA,cACA,cAAc,KAAK,EAAE;AAAA,YACvB;AAAA,UACF;AACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,UAAQ,IAAI,wBAAwB;AAEpC,SAAO;AACT;AAEA,IAAM,eAAe,CACnB,MACA,MACA,YACA,WACA,UACG;AACH,aAAW,UAAU,MAAM;AACzB,UAAM,MAAM,KAAK;AACjB,UAAM,YAAY,WAAW,MAAM,EAAE,MAAM;AAC3C,cAAU,CAAC,IAAI;AACf,cAAU,CAAC,IAAI;AACf,cAAUA,MAAK,IAAI;AACnB,cAAU,GAAG,IAAI,GAAG,SAAS,IAAI,UAAU,GAAG,CAAC;AAC/C,SAAK,KAAK,SAAS;AAAA,EACrB;AACF;AAEO,IAAM,YAAY,CACvB,MACA,SACA,cACgC;AAChC,QAAM,eAAe,QAAQ,IAAY,CAAC,WAAW,UAAU,MAAM,CAAC;AACtE,QAAM,YAAY,cAAc,MAAM,YAAY;AAClD,QAAM,kBAAkB,mBAAmB,WAAW,YAAY;AAGlE,SAAO,CAAC,iBAAiB,SAAS;AACpC;AAEA,IAAM,qBAAqB,CAAC,WAAqB,iBAA2B;AAC1E,QAAM,QAAQ;AACd,QAAM,OAAwB,CAAC;AAC/B,MAAI,MAAM;AACV,QAAM,OAAO,OAAO,KAAK,SAAS,EAAE,KAAK;AACzC,aAAW,OAAO,MAAM;AACtB,UAAM,MAAqB;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS,GAAG;AAAA,MACZ;AAAA,IACF;AACA,QAAI,aAAa,KAAK,CAAC,IAAI;AAC3B,SAAK,KAAK,GAAG;AACb,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,cAAc,UAAoC,SAAmB;AAC5E,QAAM,SAAmB,CAAC;AAC1B,QAAM,SAAS,QAAQ;AACvB,QAAM,YAAY,SAAS;AAC3B,WAAS,IAAI,GAAG,MAAM,SAAS,QAAQ,IAAI,KAAK,KAAK;AACnD,UAAM,UAAU,SAAS,CAAC;AAC1B,QAAI,SAA6B;AACjC,QAAI;AACJ,QAAI;AACJ,aAAS,QAAQ,GAAG,QAAQ,QAAQ,SAAS;AAC3C,YAAM,SAAS,QAAQ,KAAK;AAC5B,YAAM,QAAQ,MAAM,EAAE,SAAS;AAC/B,mBAAc,OAAoB,GAAG;AACrC,UAAI,cAAc,UAAU,WAAW;AAErC,QAAC,WAAuB,KAAK,CAAC;AAAA,MAChC,WAAW,YAAY;AACrB,iBAAS;AAAA,MACX,WAAW,CAAC,cAAc,QAAQ,WAAW;AAG3C,iBAAS,OAAO,GAAG,IAAI,CAAC;AAAA,MAC1B,WAAW,CAAC,YAAY;AACtB,QAAC,OAAoB,GAAG,IAAI,CAAC,CAAC;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AACA,UAAQ,IAAI,aAAa,MAAM;AAC/B,SAAO;AACT;;;ACtMA,IAAM,uBAAsC,CAAC,IAAI,IAAI,CAAC,GAAG,SAAS,MAAM;AACtE,QAAM,OAAO,cAAc,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC;AAC7C,QAAM,OAAO,cAAc,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC;AAC7C,MAAI,SAAS,MAAM;AACjB,WAAO;AAAA,EACT,WAAW,SAAS,QAAQ,OAAO,MAAM;AACvC,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAEA,IAAM,iBAAiB,CAAC,aAA2C;AACjE,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO,oBAAoB,QAAQ;AAAA,EACrC,WAAW,SAAS,WAAW,GAAG;AAChC,WAAO,iBAAiB,QAAQ;AAAA,EAClC,OAAO;AACL,WAAO,mBAAmB,QAAQ;AAAA,EACpC;AACF;AAEA,IAAM,sBACJ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,MAChB,CAAC,IAAI,OAAO;AACV,QAAM,KAAK,cAAc,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC;AAC3C,QAAM,KAAK,cAAc,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC;AAC3C,SAAO,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK;AACtC;AAEF,IAAM,mBACJ,CAAC,CAAC,CAAC,MAAM,UAAU,GAAG,CAAC,MAAM,UAAU,CAAC,MACxC,CAAC,IAAI,OAAO;AACV,QAAM,KAAK,eAAe,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI;AAClD,QAAM,KAAK,eAAe,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI;AAClD,QAAM,KAAK,eAAe,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI;AAClD,QAAM,KAAK,eAAe,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI;AAClD,SAAO,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK;AACnE;AAEF,IAAM,qBACJ,CAAC,UAAU,OAAO,yBAClB,CAAC,IAAI,OAAO;AACV,aAAW,WAAW,UAAU;AAC9B,UAAM,SAAS,KAAK,IAAI,IAAI,OAAO;AACnC,QAAI,WAAW,GAAG;AAChB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEK,IAAM,WAAW,CACtB,MACA,EAAE,SAAS,GACX,cACG;AACH,QAAM,kBAAkB,SAAS,IAAa,CAAC,EAAE,QAAQ,SAAS,MAAM;AAAA,IACtE,UAAU,MAAM;AAAA,IAChB;AAAA,EACF,CAAC;AACD,QAAM,aAAa,eAAe,eAAe;AACjD,SAAO,KAAK,MAAM,EAAE,KAAK,UAAU;AACrC;;;AC3BA,IAAM,EAAE,KAAAC,KAAI,IAAI;AAUhB,IAAM,EAAE,MAAM,IAAI,OAAO,iBAAiB;AAE1C,IAAM,kBACJ,CAAC,QACD,CAAC,MAA4B,UAAiC;AAC5D,SAAO,CAAC,OAAO,OAAO,MAAM,OAAO,GAAG,GAAG,OAAO,KAAK,GAAG,CAAC,GAAG,GAAG,GAAG,IAAI;AACxE;AAEF,IAAM,mBAAmB,CACvB,SACA,cACgB;AAChB,QAAM,SAAsB;AAAA,IAC1B,SAAS,QAAQ,IAAI,CAAC,EAAE,MAAM,iBAAiB,SAAS,OAAO;AAAA,MAC7D;AAAA,MACA;AAAA,IACF,EAAE;AAAA,IACF,KAAK,gCAAa,QAAQ,CAAC,EAAE;AAAA,IAC7B,OAAO,EAAE,QAAQ,IAAI,OAAO,QAAQ;AAAA,EACtC;AAEA,SAAO;AACT;AAxFA;AA0FO,IAAM,kBAAN,cACG,aAEV;AAAA,EAoCE,YAAY;AAAA,IACV;AAAA;AAAA,IAEA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,oBAAoB;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,EACF,GAAoC;AAClC,UAAM;AAtCR,SAAQ,kBAA4B,EAAE,MAAM,GAAG,IAAI,EAAE;AAErD,SAAQ,gBAA0B,CAAC;AAGnC;AAAA;AACA,gCAA0B;AAC1B;AACA;AACA,+BAAmB;AACnB,2CAAqB;AACrB,8BAAQ;AACR,gCAA4B;AAC5B;AAGA,SAAU,eAA0B,CAAC;AAKrC,SAAQ,OAAO,IAAI,OAAO,mBAAK,OAAM;AACrC,SAAU,gBAA6C;AAmUvD,SAAU,SAAS,CAAC,QAA8B;AAEhD,YAAM,gBAAgB,gBAAgB,KAAK,GAAG,EAAE,KAAK,KAAK,IAAI;AAC9D,MAAC,mBAAK,OAA0B,KAAK,aAAa;AAClD,YAAM,EAAE,MAAM,GAAG,IAAI,mBAAK;AAC1B,YAAM,CAAC,MAAM,IAAI;AACjB,UAAI,UAAU,QAAQ,SAAS,IAAI;AACjC,aAAK,iBAAiB;AAAA,MACxB;AAAA,IACF;AAEA,SAAU,SAAS,CAAC,KAA2B,eAAuB;AA7cxE;AA+cI,YAAM,WAAW,IAAI,KAAK,GAAG;AAC7B,YAAM,WAAW,mBAAK,YAAW,UAAU;AAC3C,YAAM,gBAAe,UAAK,YAAL,mBAAe;AACpC,YAAM,YAAY,mBAAK,OAAM,UAAU,CAACC,SAAQA,KAAID,IAAG,MAAM,QAAQ;AACrE,UAAI,cAAc,MAAM,iBAAiB,QAAW;AAClD,cAAM,gBAAgB,mBAAK,OAAM,SAAS;AAC1C,sBAAc,QAAQ,IAAI,IAAI,YAAY;AAC1C,cAAM,EAAE,MAAM,GAAG,IAAI,mBAAK;AAC1B,cAAM,CAAC,MAAM,IAAI;AACjB,YAAI,UAAU,QAAQ,SAAS,IAAI;AACjC,eAAK,iBAAiB,OAAO,aAAa;AAAA,QAC5C;AAAA,MACF;AAAA,IACF;AAEA,SAAU,YAAY,CAAC,QAA8B;AAEnD,YAAM,WAAW,IAAI,KAAK,GAAG;AAC7B,YAAM,YAAY,mBAAK,OAAM,UAAU,CAACC,SAAQA,KAAID,IAAG,MAAM,QAAQ;AACrE,UAAI,cAAc,IAAI;AACpB,cAAM,gBAAgB,gBAAgB,KAAK,GAAG,EAAE,KAAK,SAAS;AAE9D,2BAAK,OAAM,SAAS,IAAI;AACxB,cAAM,EAAE,MAAM,GAAG,IAAI,mBAAK;AAC1B,YAAI,aAAa,QAAQ,YAAY,IAAI;AACvC,eAAK,iBAAiB,OAAO,aAAa;AAAA,QAC5C;AAAA,MACF;AAAA,IACF;AA1VE,QAAI,CAAC,QAAQ,CAAC,mBAAmB;AAC/B,YAAM;AAAA,QACJ;AAAA,MACF;AAAA,IACF;AAEA,SAAK,oBAAoB;AACzB,SAAK,UAAU;AACf,SAAK,MAAM,YACP,KAAK,kBAAkB,UAAU,CAAC,QAAQ,IAAI,SAAS,SAAS,IAChE;AACJ,SAAK,oBAAoB;AACzB,SAAK,cAAc,iBAAiB,mBAAmB,SAAS;AAChE,SAAK,WAAW,YAAY,KAAK;AACjC,uBAAK,OAAQ,KAAK;AAClB,uBAAK,QAAS;AAEd,UAAM,UAAU,kBAAkB,IAAI,CAAC,QAAQ,IAAI,IAAI;AACvD,uBAAK,YAAa,eAAe,OAAO;AACxC,SAAK,cAAc,qBAAqB,mBAAK,aAAY,KAAK,OAAO;AACrE,uBAAK,OAAQ,KAAK,IAAmB,gBAAgB,KAAK,GAAG,CAAC;AAE9D,SAAK,SAAS;AAAA,MACZ,GAAG,mBAAK;AAAA,MACR,cAAc,gBAAgB,mBAAK,SAAQ;AAAA,MAC3C;AAAA,MACA,QAAQ,UAAU,mBAAK,SAAQ;AAAA,MAC/B,SAAS,WAAW,mBAAK,SAAQ;AAAA,MACjC,MAAM,QAAQ,mBAAK,SAAQ;AAAA,IAC7B;AAEA,mCAAQ,cAAc,KAAK,UAAU,mBAAK,WAAU,CAAC;AAAA,EACvD;AAAA,EAEA,MAAM,UACJ;AAAA,IACE,YAAW,mBAAK,aAAL,YAAiB,KAAK;AAAA,IACjC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,GACA,UACA;AA9LJ,QAAAE;AA+LI,SAAK,iBAAiB;AACtB,SAAK,WAAW;AAChB,uBAAK,SAAU;AACf,SAAK,kBAAkB,EAAE,MAAM,GAAG,IAAI,EAAE;AAExC,QAAI,SAAS,mBAAK;AAElB,UAAM,iBAAiB,gBAAgB,WAAW,UAAU,WAAW;AACvE,QAAI,gBAAgB;AAClB,UAAI,OAAO;AACT,2BAAK,QAAS;AAAA,MAChB;AACA,eAAS;AAAA,QACP,GAAG;AAAA,QACH,cAAc,gBAAgB,mBAAK,SAAQ;AAAA,QAC3C,SAAS,WAAW,mBAAK,SAAQ;AAAA,QACjC,QAAQ,UAAU,mBAAK,SAAQ;AAAA,QAC/B,SAAS,WAAW,mBAAK,SAAQ;AAAA,QACjC,MAAM,QAAQ,mBAAK,SAAQ;AAAA,MAC7B;AAAA,IACF;AAEA,KAAAA,MAAA,KAAK,mBAAL,gBAAAA,IAAA,WAAsB;AAAA,MACpB,GAAG;AAAA,MACH,MAAM;AAAA,MACN,kBAAkB,KAAK;AAAA,MACvB,OAAO,mBAAK;AAAA,MACZ,aAAa,KAAK;AAAA,IACpB;AAEA,QAAI,gBAAgB;AAElB,WAAK,SAAS;AAAA,IAChB,OAAO;AACL,WAAK,eAAe;AAAA,QAClB,kBAAkB,KAAK;AAAA,QACvB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM,mBAAK,OAAM;AAAA,MACnB,CAAC;AACD,UAAI,OAAO;AAET,aAAK,QAAQ;AAAA,MACf,WAAW,mBAAK,YAAW,YAAY;AACrC,aAAK,iBAAiB;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAAA,EAEA,cAAc;AACZ,YAAQ,IAAI,kBAAkB;AAAA,EAChC;AAAA,EAEA,UAAU;AAER,WAAO;AAAA,EACT;AAAA,EAEA,SAAS;AAEP,WAAO;AAAA,EACT;AAAA,EAEA,UAAU;AAER,WAAO;AAAA,EACT;AAAA,EAEA,SAAS;AAEP,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,UAAqB;AAC1B,uBAAK,oBAAqB,SAAS;AACnC,mCAAQ,UAAU,KAAK,UAAU,QAAQ,CAAC;AAC1C,SAAK,eAAe;AACpB,SAAK,SAAS,WAAW,mBAAK,OAAM,GAAG,IAAI;AAAA,EAC7C;AAAA,EAEA,aAAa,KAAa;AACxB,SAAK,cAAc,KAAK,GAAG;AAC3B,SAAK,gBAAgB;AAAA,MACnB,KAAK;AAAA,MACL,mBAAK;AAAA,MACL,mBAAK,SAAQ;AAAA,MACb,mBAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AACA,SAAK,SAAS,WAAW,mBAAK,OAAM,GAAG,IAAI;AAAA,EAC7C;AAAA,EAEA,cAAc,KAAa;AACzB,SAAK,gBAAgB,KAAK,cAAc,OAAO,CAAC,UAAU,UAAU,GAAG;AACvE,QAAI,KAAK,eAAe;AACtB,WAAK,gBAAgB,cAAc,KAAK,KAAK,aAAa;AAC1D,WAAK,SAAS,WAAW,mBAAK,OAAM,GAAG,IAAI;AAAA,IAC7C;AAAA,EACF;AAAA,EAEA,IAAI,QAAQ;AACV,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,mBAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,cAAc;AArTpB;AAsTI,YAAO,UAAK,kBAAL,YAAsB,mBAAK;AAAA,EACpC;AAAA,EAEA,IAAI,QAAQ;AACV,WAAO,KAAK,YAAY;AAAA,EAC1B;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,OAAO,QAA0B;AAjUvC;AAkUI,QAAI,KAAK,YAAY,MAAM,GAAG;AAC5B,UAAI,QAAQ;AACV,cAAM,iBAAiB,mBAAK;AAC5B,cAAM,cACJ,sCAAQ,WAAR,mBAAgB,YAAU,iCAAQ,OAAO,kBAAiB,SACtD;AAAA,UACE,GAAG;AAAA,UACH,QAAQ;AAAA,YACN,QAAQ,OAAO,OAAO;AAAA,YACtB,cAAc,YAAY,OAAO,OAAO,MAAM;AAAA,UAChD;AAAA,QACF,IACA;AAEN,2BAAK,SAAU,mBAAmB,SAAS;AAE3C,YAAI;AAEJ,YAAI,UAAU,MAAM,GAAG;AACrB,gBAAM,EAAE,QAAQ,eAAe,YAAY,MAAM,EAAE,IAAI,OAAO;AAC9D,cAAI,cAAc;AAChB,kBAAM,KAAK,gBAAgB,mBAAK,aAAY,YAAY;AACxD,4BAAgB,mBAAK,OAAM,OAAO,EAAE;AAAA,UACtC,OAAO;AACL,kBAAM,MAAM,kCAAkC;AAAA,UAChD;AAAA,QACF;AAEA,YAAI,QAAQ,MAAM,GAAG;AACnB,0BAAgB;AAAA,YACd,wCAAiB,mBAAK;AAAA,YACtB,OAAO;AAAA,YACP,mBAAK;AAAA,UACP;AAAA,QACF;AAEA,YACE,KAAK,cAAc,SAAS,KAC5B,eAAe,gBAAgB,MAAM,GACrC;AACA,cAAI,mBAAK,SAAQ,QAAQ,WAAW,GAAG;AACrC,iBAAK,cAAc,SAAS;AAAA,UAC9B,OAAO;AAEL,oBAAQ,IAAI,6CAA6C;AAAA,cACvD,iBAAiB,eAAe;AAAA,cAChC,YAAY,UAAU;AAAA,YACxB,CAAC;AAAA,UACH;AAAA,QACF;AAEA,YAAI,WAAW,MAAM,GAAG;AACtB,gBAAM,CAAC,aAAa,QAAQ,IAAI;AAAA,YAC9B,wCAAiB,mBAAK;AAAA,YACtB,OAAO;AAAA,YACP,mBAAK;AAAA,UACP;AACA,eAAK,WAAW;AAChB,0BAAgB;AAEhB,cAAI,KAAK,cAAc,SAAS,GAAG;AACjC,4BAAgB;AAAA,cACd,KAAK;AAAA,cACL,mBAAK;AAAA,cACL,mBAAK,SAAQ;AAAA,cACb,mBAAK;AAAA,cACL,KAAK;AAAA,cACL;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,aAAK,gBAAgB,+CAAe,IAAI,CAAC,KAAK,MAAM;AAClD,gBAAM,QAAQ,IAAI,MAAM;AACxB,gBAAM,CAAC,IAAI;AACX,gBAAM,CAAC,IAAI;AACX,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,WAAK,SAAS,WAAW,mBAAK,OAAM,GAAG,IAAI;AAE3C,WAAK,KAAK,UAAU,mBAAK,QAAO;AAAA,IAClC;AAAA,EACF;AAAA,EAEA,YAAY,QAA0B;AAxZxC;AAyZI,QAAI,cAAc,mBAAK,UAAS,MAAM,GAAG;AACvC,UAAI,QAAQ;AACV,cAAM,cACJ,sCAAQ,WAAR,mBAAgB,YAAU,iCAAQ,OAAO,kBAAiB,SACtD;AAAA,UACE,GAAG;AAAA,UACH,QAAQ;AAAA,YACN,QAAQ,OAAO,OAAO;AAAA,YACtB,cAAc,YAAY,OAAO,OAAO,MAAM;AAAA,UAChD;AAAA,QACF,IACA;AACN,2BAAK,SAAU,mBAAmB,SAAS;AAC3C,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,oBAAoB;AACtB,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,OAAO;AA/ab;AAibI,YAAO,gBAAK,kBAAL,mBAAoB,WAApB,YAA8B,mBAAK,OAAM;AAAA,EAClD;AAAA,EAEA,IAAI,QAAQ;AACV,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,MAAM,OAAiB;AACzB,QAAI,MAAM,SAAS,mBAAK,QAAO,QAAQ,MAAM,OAAO,mBAAK,QAAO,IAAI;AAClE,WAAK,SAAS,KAAK;AAAA,IACrB;AAAA,EACF;AAAA,EAEU,OAAO,KAA2B;AAC1C,YAAQ,IAAI,cAAc,IAAI,KAAK,GAAG,CAAC,EAAE;AAAA,EAC3C;AAAA,EA6CQ,SAAS,OAAiB,mBAAmB,OAAO;AAC1D,uBAAK,QAAS;AACd,SAAK,KAAK,MAAM,KAAK;AACrB,SAAK,iBAAiB,gBAAgB;AAAA,EACxC;AAAA,EAEA,iBAAiB,mBAAmB,OAAO,KAAqB;AAnflE;AAofI,QAAI,KAAK;AACP,iBAAK,mBAAL,8BAAsB;AAAA,QACpB,kBAAkB,KAAK;AAAA,QACvB,MAAM;AAAA,QACN,MAAM;AAAA,UACJ,YAAY,KAAK,KAAK,MAAM,KAAK,cAAc,KAAK,WAAW;AAAA,QACjE;AAAA,QACA,MAAM;AAAA,MACR;AAAA,IACF,OAAO;AACL,YAAM,WACJ,KAAK,sBAAsB,WAAW,CAAC,mBACnC,cAAc,KAAK,iBAAiB,mBAAK,OAAM,IAC/C,mBAAK;AACX,YAAM,QAAO,UAAK,kBAAL,YAAsB,mBAAK;AAExC,YAAM,qBAAqB,KACxB,MAAM,SAAS,MAAM,SAAS,EAAE,EAChC;AAAA,QAAI,CAACD,SACJ,YAAYA,MAAK,KAAK,MAAM,KAAK,cAAc,KAAK,WAAW;AAAA,MACjE;AAEF,iBAAK,mBAAL,8BAAsB;AAAA,QACpB,kBAAkB,KAAK;AAAA,QACvB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM,KAAK;AAAA,QACX,MAAM;AAAA,MACR;AACA,WAAK,kBAAkB;AAAA,QACrB,MAAM,mBAAK,QAAO;AAAA,QAClB,IAAI,KAAK;AAAA,UACP,mBAAK,QAAO;AAAA,UACZ,mBAAK,QAAO,OAAO,mBAAmB;AAAA,QACxC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,UAAU;AACZ,WAAO,mBAAK,SAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,QAAQ,SAAmB;AAC7B,UAAM,eAAe,cAAc,KAAK,OAAO,SAAS,OAAO;AAC/D,QAAI,aAAa,SAAS,GAAG;AAC3B,YAAM,4BAA4B;AAAA,QAChC,KAAK;AAAA,QACL;AAAA,QACA,CAAC,QAAQ,IAAI;AAAA,MACf;AACA,cAAQ,IAAI,6BAA6B;AAAA,QACvC;AAAA,MACF,CAAC;AAAA,IACH;AACA,uBAAK,YAAa,eAAe,OAAO;AACxC,SAAK,cAAc,qBAAqB,mBAAK,aAAY,KAAK,OAAO;AAErE,SAAK,SAAS;AAAA,MACZ,GAAG,mBAAK;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,eAAe;AACjB,WAAO,mBAAK,SAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,aAAa,cAAgC;AAxjBnD;AAyjBI,uBAAK,SAAU;AAAA,MACb,GAAG,mBAAK;AAAA,MACR;AAAA,IACF;AAEA,UAAM,cAAa,UAAK,kBAAL,YAAsB,mBAAK;AAC9C,UAAM,WAAW,mBAAK;AAEtB;AAAA,MACE;AAAA,MACA;AAAA,MACA,mBAAK,SAAQ;AAAA,MACb;AAAA,MACA,mBAAK;AAAA,MACL,KAAK;AAAA,IACP;AACA,SAAK,SAAS,WAAW,mBAAK,OAAM,GAAG,IAAI;AAE3C,SAAK,KAAK,UAAU,mBAAK,QAAO;AAAA,EAClC;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,mBAAK,SAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,KAAK,MAAe;AACtB,mCAAQ,QAAQ,KAAK,UAAU,IAAI,CAAC;AACpC,SAAK,SAAS;AAAA,MACZ,GAAG,mBAAK;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,mBAAK,SAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,OAAO,QAA0B;AACnC,mCAAQ,UAAU,KAAK,UAAU,MAAM,CAAC;AAExC,SAAK,SAAS;AAAA,MACZ,GAAG,mBAAK;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,UAAU;AACZ,WAAO,mBAAK,SAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,QAAQ,SAAqB;AAC/B,SAAK,SAAS;AAAA,MACZ,GAAG,mBAAK;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,QAAQ;AACV,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,MAAM,OAA2B;AACnC,uBAAK,QAAS;AAAA,EAChB;AAAA,EAEA,IAAI,kBAAkB;AACpB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,WAAW;AAAA,IACT;AAAA,IACA,MAAM,EAAE,YAAY,SAAS;AAAA,EAC/B,GAA4B;AAC1B,YAAQ,IAAI,eAAe;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,aAAa;AACX,YAAQ,IAAI,aAAa;AAAA,EAC3B;AAAA,EAEQ,QAAQ,QAAgB;AAC9B,UAAM,MAAM,mBAAK,OAAM,MAAM;AAC7B,QAAI,KAAK;AACP,aAAO;AAAA,IACT,OAAO;AACL,YAAM,wBAAwB,MAAM;AAAA,IACtC;AAAA,EACF;AAAA,EAEA,UACE,KACA,YACA,OACe;AACf,YAAQ,IAAI,6BAA6B,IAAI,CAAC,CAAC,IAAI,UAAU,IAAI,KAAK,EAAE;AACxE,WAAO,QAAQ,QAAQ,IAAI;AAAA,EAC7B;AAAA,EAEA,MAAM,YACJ,YAMA;AACA,WAAO,IAAI,QAAQ,CAAC,YAAY;AAC9B,YAAM,EAAE,KAAK,IAAI;AACjB,cAAQ,MAAM;AAAA,QACZ,KAAK;AACH;AAAA,UASA;AAEA;AAAA,QACF;AACE,kBAAQ,MAAS;AAAA,MACrB;AAAA,IACF,CAAC;AAAA,EACH;AACF;AA9kBE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AC1EF,IAAM,EAAE,OAAAE,QAAO,KAAK,aAAAC,cAAa,SAAAC,UAAS,KAAAC,MAAK,UAAAC,UAAS,IAAI;;;ACzC5D,IAAM,eAAe,oBAAI,IAAoC;AAE7D,IAAM,kBAAkB,CAAC,OAAc,QAAgB,UAAU,OAAO;AACtE,MAAI;AACJ,QAAM,cAAc,aAAa,IAAI,KAAK;AAC1C,MAAI,eAAe,YAAY,IAAI,MAAM,GAAG;AAC1C,mBAAe,YAAY,IAAI,MAAM;AAAA,EACvC,OAAO;AACL,UAAM,EAAE,MAAM,IAAI,IAAI;AACtB,UAAM,MAAM,IAAI,MAAM;AACtB,mBAAe,CAAC;AAChB,UAAM,MAAM,oBAAI,IAAI;AACpB,eAAW,OAAO,MAAM;AACtB,YAAM,QAAQ,IAAI,GAAG;AACrB,UAAI,CAAC,IAAI,IAAI,KAAK,GAAG;AACnB,YAAI,IAAI,KAAK;AACb,qBAAa,KAAK,KAAK;AAAA,MACzB;AAAA,IACF;AACA,iBAAa,KAAK;AAClB,QAAI,aAAa;AACf,kBAAY,IAAI,QAAQ,YAAY;AAAA,IACtC,OAAO;AACL,mBAAa,IAAI,OAAO,oBAAI,IAAI,CAAC,CAAC,QAAQ,YAAY,CAAC,CAAC,CAAC;AAAA,IAC3D;AAAA,EACF;AACA,SAAO,UACH,aAAa,OAAO,CAAC,UAAU,MAAM,SAAS,EAAE,WAAW,OAAO,CAAC,IACnE;AACN;AAcO,IAAM,kBAAkB,CAC7B,OACA,QACA,YAEA,IAAI,QAAQ,CAAC,YAAY;AACvB,QAAM,eAAe,gBAAgB,OAAO,QAAQ,OAAO;AAC3D,QAAM,SACJ,aAAa,SAAS,KAClB,6CAAc,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,SAAS,KACjD,aAAa,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC;AAC1C,aAAW,MAAM,QAAQ,MAAM,GAAG,GAAG;AACvC,CAAC;;;AC1DH;AAwCO,IAAM,yBAAN,cAAqC,gBAAgB;AAAA,EAK1D,YAAY;AAAA,IACV;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAG;AAAA,EACL,GAA2C;AApD7C;AAqDI,QAAI,SAAS,UAAa,UAAU,QAAW;AAC7C,YAAM,MAAM,sDAAsD;AAAA,IACpE;AACA,UAAM;AAAA,MACJ,GAAG;AAAA,MACH,OAAM,2BAAQ,+BAAO,SAAf,YAAuB,CAAC;AAAA,IAChC,CAAC;AAlBH;AACA;AACA;AAiBE,SAAK,QAAQ;AACb,uBAAK,kBAAmB;AACxB,uBAAK,cAAe;AACpB,uBAAK,QAAS;AAEd,QAAI,OAAO;AACT,YAAM,GAAG,UAAU,KAAK,MAAM;AAC9B,YAAM,GAAG,UAAU,KAAK,SAAS;AAAA,IACnC;AAAA,EACF;AAAA,EAEA,MAAM,UAAU,gBAAgC,UAA6B;AAC3E,UAAM,eAAe,MAAM,UAAU,gBAAgB,QAAQ;AAI7D,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,MAAM,OAAiB;AACzB,UAAM,QAAQ;AAAA,EAEhB;AAAA,EACA,IAAI,QAAQ;AACV,WAAO,MAAM;AAAA,EACf;AAAA,EAEQ,kBAAkB;AACxB,WAAO,KAAK,aAAa;AAAA,MACvB,CAAC,MAAuB,aAA4B;AAClD,YAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,mBAAS,QAAQ,CAAC,QAAQ;AACxB,kBAAM,MAAM,KAAK,KAAK,GAAG;AACzB,gBAAI,KAAK;AACP,mBAAK,KAAK,GAAG;AAAA,YACf;AAAA,UACF,CAAC;AAAA,QACH,OAAO;AACL,gBAAM,MAAM,KAAK,KAAK,QAAQ;AAC9B,cAAI,KAAK;AACP,iBAAK,KAAK,GAAG;AAAA,UACf;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,MACA,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,UACE,KACA,YACA,OACe;AAjHnB;AAkHI,UAAM,MAAM,IAAI,aAAa,GAAG;AAChC,6BAAK,YAAL,mBAAa,OAAO,KAAK,YAAY;AACrC,WAAO,QAAQ,QAAQ,IAAI;AAAA,EAC7B;AAAA,EAEA,MAAM,QACJ,YACwB;AAzH5B;AA0HI,UAAM,cAAa,wBAAK,kBAAL,mBAAmB;AAAA,MACpC,CAAC,YACC,QAAQ,YACP,WAA6C;AAAA;AAElD,QAAI,YAAY;AACd,aAAO,WAAW,QAAQ;AAAA,QACxB,GAAG;AAAA,MACL,CAAC;AAAA,IACH,OAAO;AACL,cAAQ,IAAI,qCAAqC,WAAW,OAAO,EAAE;AAAA,IACvE;AAAA,EACF;AAAA,EAEA,MAAM,YACJ,YAMA;AA/IJ;AAgJI,UAAM,cAAa,wBAAK,kBAAL,mBAAmB;AAAA,MACpC,CAAC,YACC,QAAQ,YAAa,WAAqC;AAAA;AAG9D,QAAI,YAAY;AACd,cAAQ,WAAW,MAAM;AAAA,QACvB,KAAK,8BAA8B;AACjC,gBAAM,eAAe,KAAK,gBAAgB;AAC1C,iBAAO,WAAW,QAAQ;AAAA,YACxB,GAAG;AAAA,YACH;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QAEA;AAAA,MACF;AAAA,IACF;AACA,WAAO,MAAM,YAAY,UAAU;AAAA,EACrC;AAAA,EAEA,wBAAwB,QAAgB,SAAqC;AAC3E,QAAI,mBAAK,SAAQ;AACf,aAAO,gBAAgB,mBAAK,SAAQ,QAAQ,OAAO;AAAA,IACrD,OAAO;AACL,YAAM;AAAA,QACJ;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AArIE;AACA;AACA;;;ACrCK,IAAM,qBAAqB,CAAC,gBACjC,CAAC,QAAQ,EAAE;AAAA,EACT,MAAM,WAAW,EACd,KAAK,EAAE,EACP,IAAI,CAAC,GAAG,MAAM,UAAU,IAAI,CAAC,EAAE;AACpC;AAWK,IAAM,sBACX,CAAC,YAAsB,CAAC,UAAU;AAChC,SAAO,CAAC,OAAO,QAAQ,CAAC,EAAE,EAAE;AAAA,IAC1B,MAAM,QAAQ,MAAM,EACjB,KAAK,IAAI,EACT,IAAI,CAAC,GAAG,MAAM,SAAS,IAAI,CAAC,MAAM,QAAQ,CAAC,EAAE;AAAA,EAClD;AACF;AAEK,IAAM,yBAA4C,CACvD,SACA,eAAe,CAAC,MACb;AACH,MAAI,OAAO,YAAY,UAAU;AAC/B,WAAO,CAAC,EAAE,MAAM,cAAc,OAAO,IAAI,CAAC,EAAE;AAAA,MAC1C,MAAM,OAAO,EACV,KAAK,IAAI,EACT,IAAI,CAAC,GAAG,MAAM;AACb,cAAM,OAAO,UAAU,IAAI,CAAC;AAC5B,eAAO,EAAE,MAAM,OAAO,KAAK,GAAG,aAAa,IAAI,EAAE;AAAA,MACnD,CAAC;AAAA,IACL;AAAA,EACF,OAAO;AACL,UAAM,MAAM,wDAAwD;AAAA,EACtE;AACF;AAEA,IAAM,oBAAoB;AAAA,EACxB,iBAAiB;AAAA,EACjB,cAAc;AAChB;AAEO,IAAM,2BAA2B,CACtC,UAGqE;AA1DvE;AA2DE,QAAM,aAAY,oCAAO,UAAP,YAAgB;AAGlC,UAAQ,+BAAO,QAAQ;AAAA,IACrB,KAAK,SAAS;AACZ,YAAM,EAAE,iBAAiB,cAAc,sBAAsB;AAAA;AAAA;AAAA,SAG3D,yBAAoB,SAAS,MAA7B,YAAkC;AAAA;AACpC,aAAO,CAAC,iBAAiB,cAAc,qBAAqB;AAAA,IAC9D;AAAA,IAEA,KAAK,UAAU;AACb,YAAM,EAAE,iBAAiB,cAAc,sBAAsB;AAAA;AAAA;AAAA,SAG3D,0BAAqB,SAAS,MAA9B,YAAmC;AAAA;AACrC,aAAO,CAAC,iBAAiB,cAAc,qBAAqB;AAAA,IAC9D;AAAA,IACA,KAAK,QAAW;AACd,YAAM,EAAE,iBAAiB,aAAa,IAAI;AAC1C,aAAO,CAAC,iBAAiB,YAAY;AAAA,IACvC;AAAA,IACA;AACE,YAAM;AAAA,QACJ,2BAA2B,+BAAO,KAAK;AAAA,MACzC;AAAA,EACJ;AACF;AAEO,IAAM,gBAAgB,CAC3B,OACA,QACA,QACA,YACG;AACH,QAAM,oBAAoB,OAAO,OAAO;AACxC,QAAM,cAAc,OAAO,kBAAkB,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC;AACnE,QAAM,OAAoC,CAAC;AAC3C,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAM,MAAM,YAAY,CAAC;AACzB,QAAI,KAAK;AACP,WAAK,CAAC,IAAI;AAAA,IACZ,OAAO;AACL;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;;;AC3GA,IAAAC,QAAA;AAWO,IAAM,QAAN,cAAoB,aAA0B;AAAA,EAOnD,YACE,QACA,MACA,SACA,iBACA;AACA,UAAM;AAZR,uBAAAA,QAAA;AACA;AACA;AACA,+BAAS,oBAAI,IAAoB;AACjC;AASE,uBAAKA,QAAQ;AACb,uBAAK,UAAW;AAChB,uBAAK,SAAU;AACf,uBAAK,aAAc,QAAQ,OAAO,GAAG;AACrC,SAAK,WAAW;AAChB,uDAAiB,SAAS;AAC1B,uDAAiB,SAAS,EAAE,MAAM,GAAG,IAAI,IAAI;AAAA,EAC/C;AAAA,EAEQ,aAAa;AACnB,aAAS,IAAI,GAAG,IAAI,mBAAKA,QAAM,QAAQ,KAAK;AAC1C,YAAM,MAAM,mBAAKA,QAAM,CAAC,EAAE,mBAAK,YAAW;AAC1C,yBAAK,QAAO,IAAI,KAAK,CAAC;AAAA,IACxB;AAAA,EACF;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,mBAAKA;AAAA,EACd;AAAA,EAEA,IAAI,MAAM;AACR,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,mBAAK;AAAA,EACd;AAAA,EAEA,OAAO,KAA2B;AAChC,UAAM,QAAQ,mBAAKA,QAAM;AACzB,uBAAKA,QAAM,KAAK,GAAG;AACnB,UAAM,MAAM,IAAI,mBAAK,YAAW;AAChC,uBAAK,QAAO,IAAI,KAAK,KAAK;AAC1B,SAAK,KAAK,UAAU,GAAG;AAAA,EACzB;AAAA,EAEA,UAAU,KAAa;AA7DzB;AA8DI,UAAM,SAAQ,wBAAK,QAAO,IAAI,GAAG,MAAnB,YAAwB;AACtC,WAAO,mBAAKA,QAAM,KAAK;AAAA,EACzB;AAAA,EAEA,OAAO,KAAa,YAAoB,OAA2B;AACjE,UAAM,WAAW,mBAAKA,QAAM;AAAA,MAC1B,CAAC,QAAQ,IAAI,mBAAK,YAAW,MAAM;AAAA,IACrC;AACA,UAAM,WAAW,mBAAK,UAAS,UAAU;AACzC,QAAI,aAAa,IAAI;AACnB,YAAM,MAAM,mBAAKA,QAAM,QAAQ;AAC/B,YAAM,SAAS,IAAI,MAAM;AACzB,aAAO,QAAQ,IAAI;AACnB,yBAAKA,QAAM,QAAQ,IAAI;AACvB,WAAK,KAAK,UAAU,QAAQ,UAAU;AAAA,IACxC;AAAA,EACF;AAAA,EACA,UAAU,KAA2B;AACnC,UAAM,MAAM,IAAI,mBAAK,YAAW;AAChC,UAAM,WAAW,mBAAKA,QAAM;AAAA,MAC1B,CAACC,SAAQA,KAAI,mBAAK,YAAW,MAAM;AAAA,IACrC;AACA,QAAI,aAAa,IAAI;AACnB,yBAAKD,QAAM,QAAQ,IAAI;AACvB,WAAK,KAAK,UAAU,GAAG;AAAA,IACzB;AAAA,EACF;AACF;AA7EEA,SAAA;AACA;AACA;AACA;AACA;AA2EK,IAAM,qBAAqB,CAAC,WACjC,OAAO,OAAO,OAAO,OAAO,EAAE,OAAkB,CAAC,KAAK,KAAK,UAAU;AACnE,MAAI,IAAI,IAAI,IAAI;AAChB,SAAO;AACT,GAAG,CAAC,CAAC;AAEP,IAAM,oBAAoB,CACxB,YACA,EAAE,SAAS,OAAO,OAAO,GAAG,GAC5B,EAAE,SAAS,OAAO,OAAO,GAAG,MACzB;AACH,QAAM,OAAO,MAAM,KAAK,CAAC,QAAQ,IAAI,SAAS,UAAU;AACxD,QAAM,OAAO,MAAM,KAAK,CAAC,QAAQ,IAAI,SAAS,UAAU;AACxD,MAAI,QAAQ,MAAM;AAChB,QAAI,KAAK,mBAAmB,KAAK,gBAAgB;AAC/C,aAAO,KAAK;AAAA,IACd,OAAO;AACL,YAAM;AAAA,QACJ,eAAe,GAAG,KAAK,QAAQ,GAAG,KAAK,qBAAqB,UAAU;AAAA,MACxE;AAAA,IACF;AAAA,EACF,WAAW,MAAM;AACf,WAAO,KAAK;AAAA,EACd,WAAW,MAAM;AACf,WAAO,KAAK;AAAA,EACd,OAAO;AACL,UAAM,MAAM,0BAA0B;AAAA,EACxC;AACF;AAIO,IAAM,aAAa,CACxB,WACA,QACA,QACA,eACG;AACH,QAAM,EAAE,KAAK,IAAI,QAAQ,QAAQ,IAAI;AACrC,QAAM,EAAE,KAAK,IAAI,QAAQ,QAAQ,IAAI;AACrC,QAAM,KAAK,GAAG,UAAU;AACxB,QAAM,KAAK,GAAG,UAAU;AAExB,QAAM,kBAAkB,IAAI;AAAA,IAC1B,CAAC,GAAG,QAAQ,SAAS,GAAG,QAAQ,OAAO,EAAE,IAAI,CAAC,QAAQ,IAAI,IAAI,EAAE,KAAK;AAAA,EACvE;AAEA,QAAM,iBAA8B;AAAA,IAClC,KAAK;AAAA,IACL,OAAO;AAAA,IACP,SAAS,MAAM,KAAK,eAAe,EAAE,IAAkB,CAAC,gBAAgB;AAAA,MACtE,MAAM;AAAA,MACN,gBAAgB,kBAAkB,YAAY,SAAS,OAAO;AAAA,IAChE,EAAE;AAAA,EACJ;AAEA,QAAM,OAA+B,CAAC;AACtC,QAAM,oBAAoB,mBAAmB,cAAc;AAE3D,aAAW,OAAO,OAAO,MAAM;AAC7B,UAAM,OAAO,OAAO,UAAU,OAAO,IAAI,EAAE,CAAC,CAAC;AAC7C,QAAI,MAAM;AACR,YAAM,MAAM,CAAC;AACb,iBAAW,UAAU,OAAO,OAAO,SAAS;AAC1C,cAAM,QAAQ,IAAI,GAAG,OAAO,IAAI,CAAC;AACjC,YAAI,kBAAkB,OAAO,IAAI,CAAC,IAAI;AAAA,MACxC;AACA,iBAAW,UAAU,OAAO,OAAO,SAAS;AAC1C,cAAM,QAAQ,KAAK,GAAG,OAAO,IAAI,CAAC;AAClC,YAAI,kBAAkB,OAAO,IAAI,CAAC,IAAI;AAAA,MACxC;AAEA,WAAK,KAAK,GAAG;AAAA,IACf;AAAA,EACF;AAIA,QAAM,WAAW,IAAI,MAAM,gBAAgB,MAAM,iBAAiB;AAElE,SAAO,GAAG,UAAU,CAAC,QAAQ;AAC3B,UAAM,OAAO,OAAO,UAAU,OAAO,IAAI,EAAE,CAAC,CAAC;AAC7C,QAAI,MAAM;AACR,YAAM,MAAM,CAAC;AACb,iBAAW,UAAU,OAAO,OAAO,SAAS;AAC1C,cAAM,QAAQ,IAAI,GAAG,OAAO,IAAI,CAAC;AACjC,YAAI,kBAAkB,OAAO,IAAI,CAAC,IAAI;AAAA,MACxC;AACA,iBAAW,UAAU,OAAO,OAAO,SAAS;AAC1C,cAAM,QAAQ,KAAK,GAAG,OAAO,IAAI,CAAC;AAClC,YAAI,kBAAkB,OAAO,IAAI,CAAC,IAAI;AAAA,MACxC;AACA,eAAS,OAAO,GAAG;AAAA,IACrB;AAAA,EACF,CAAC;AAED,SAAO,GAAG,UAAU,CAAC,QAAQ;AAC3B,UAAM,WAAW,IAAI,EAAE;AACvB,UAAM,YAAY,SAAS,UAAU,QAAQ;AAC7C,QAAI,WAAW;AACb,YAAM,aAAa,UAAU,MAAM;AACnC,iBAAW,EAAE,KAAK,KAAK,OAAO,OAAO,SAAS;AAC5C,YAAI,IAAI,GAAG,IAAI,CAAC,MAAM,WAAW,kBAAkB,IAAI,CAAC,GAAG;AACzD,qBAAW,kBAAkB,IAAI,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC;AAAA,QACpD;AAAA,MACF;AACA,eAAS,UAAU,UAAU;AAAA,IAC/B;AAAA,EACF,CAAC;AAED,SAAO;AACT;;;AC1MO,SAAS,OAAO,KAAa,KAAa;AAC/C,QAAM,KAAK,KAAK,GAAG;AACnB,QAAM,KAAK,MAAM,GAAG;AACpB,SAAO,KAAK,MAAM,KAAK,OAAO,KAAK,MAAM,MAAM,EAAE,IAAI;AACvD;AASO,IAAM,mBAAmC,CAAC,KAAK,QACpD,OAAO,MAAM,OAAO,KAAK,OAAO;AAE3B,IAAM,aAAa,CACxB,eACAE,sBACG;AACH,QAAM,MAAMA,kBAAiB,GAAG,GAAI;AACpC,QAAM,UAAUA,kBAAiB,MAAM,eAAe,MAAM,CAAC;AAC7D,QAAMC,OAAMD,kBAAiB,MAAM,GAAG,MAAM,aAAa;AACzD,QAAME,OAAM,UAAU,IAAI,MAAM;AAChC,QAAM,SAAS,KAAK,MAAMA,OAAM,GAAG,IAAI;AACvC,QAAM,SAAS,KAAK,MAAMD,OAAM,GAAG,IAAI;AACvC,SAAO,CAAC,QAAQ,MAAM;AACxB;AAEA,IAAM,SAAS,CACbC,MACAD,MACA,iBACA,kBACG;AACH,QAAM,SAASA,OAAMC;AACrB,SAAO,KAAK;AAAA,IACVD,OAAM,kBAAkB;AAAA,IACxB,SAAS,IAAIC,OAAM;AAAA,EACrB;AACF;AAEA,IAAM,SAAS,CACbA,MACAD,MACA,iBACA,kBACG;AACH,SAAO,KAAK,IAAIC,OAAM,IAAID,OAAMC,QAAO,IAAIA,IAAG;AAChD;AAEA,IAAM,SAAS,CACbA,MACAD,MACA,iBACA,kBACG;AACH,QAAM,SAAS,KAAK,IAAIA,OAAM,IAAIA,OAAMC,QAAO,IAAIA,IAAG;AACtD,SAAO,SAAS,IAAIA,OAAM,IAAI;AAChC;AAEA,IAAM,SAAS,CACbA,MACAD,MACA,iBACA,kBACG;AACH,QAAM,SAASA,OAAMC;AACrB,QAAM,MAAM,SAAS,IAAIA;AACzB,QAAM,SAAS,KAAK;AAAA,IAClBA,OAAM,KAAK,IAAI,kBAAkB,QAAQ,EAAE;AAAA,IAC3C,MAAM;AAAA,EACR;AACA,SAAO,SAAS,IAAIA,OAAM;AAC5B;AAEO,IAAM,qBAAqB,CAChCA,MACAD,MACA,iBACA,eACAD,sBACG;AACH,MAAI,UAAUC;AACd,MAAI,KAAK,IAAIC,OAAMD,IAAG,KAAK;AAAG,cAAUA,OAAM;AAC9C,QAAM,cAAc,OAAOC,MAAK,SAAS,iBAAiB,aAAa;AACvE,QAAM,cAAc,OAAOA,MAAK,SAAS,iBAAiB,aAAa;AACvE,QAAM,cAAc,OAAOA,MAAK,SAAS,iBAAiB,aAAa;AACvE,QAAM,cAAc,OAAOA,MAAK,SAAS,iBAAiB,aAAa;AACvE,QAAM,SACJ,KAAK,MAAMF,kBAAiB,aAAa,WAAW,IAAI,GAAG,IAAI;AACjE,QAAM,SACJ,KAAK,MAAMA,kBAAiB,aAAa,WAAW,IAAI,GAAG,IAAI;AACjE,SAAO,CAAC,QAAQ,MAAM;AACxB;;;ACzFA,IAAM,cAAc,CAAC,UAAkB;AACrC,QAAM,aAAa,OAAO,GAAG,GAAG,IAAI;AACpC,QAAM,YAAY,OAAO,GAAG,EAAE,KAAK,IAAI,IAAI;AAC3C,SAAO,QAAQ,QAAQ,aAAa;AACtC;AAEO,IAAM,sBAAN,MAAqD;AAAA,EAO1D,YAAY,gBAA2C;AAJvD,SAAQ,WAAW;AAgCnB,kBAAS,MAAM;AA9CjB;AA+CI,UAAI,KAAK,SAAS,KAAK,OAAO;AAC5B,cAAM,QAAO,UAAK,UAAL,mBAAY;AACzB,cAAM,EAAE,KAAAG,MAAK,KAAAC,MAAK,MAAAC,OAAM,GAAG,KAAK,IAAI,KAAK;AACzC,YAAI,SAAQ,6BAAM,UAAS,GAAG;AAC5B,gBAAM,WAAW,KAAK,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM;AACpD,mBAAS,WAAW,KAAK,MAAM,MAAM,WAAW,UAAU,YAAY;AACpE,gBAAI,cAAc;AAClB,kBAAM,iBAAiB,OAAO,GAAG,EAAE,IAAI;AACvC,gBAAI,gBAAgB;AAGlB,oBAAM,aAAa,KAAK,MAAM,KAAK,QAAQ;AAC3C,oBAAM,MAAM,KAAK,QAAQ;AAEzB,kBAAIF,SAAQ,UAAaC,SAAQ,QAAW;AAC1C,sBAAM,EAAE,CAACD,IAAG,GAAG,YAAY,CAACC,IAAG,GAAG,WAAW,IAAI;AACjD,sBAAM,CAAC,QAAQ,MAAM,IAAI;AAAA,kBACvB;AAAA,kBACA;AAAA,kBACA;AAAA,kBACA;AAAA,kBACA;AAAA,gBACF;AACA,2BAAWA,IAAG,IAAI;AAClB,2BAAWD,IAAG,IAAI;AAClB,oBAAIE,UAAS,QAAW;AACtB,wBAAM,UACJ,KAAK,OAAO,cAAc,SAAS,cAAc,KAAK,GAAG,IACzD;AACF,6BAAWA,KAAI,IAAI;AAAA,gBACrB;AAAA,cACF;AAEA,yBAAW,UAAU,OAAO,OAAO,IAAI,GAAG;AACxC,sBAAM,oBAAoB,OAAO,GAAG,EAAE,IAAI;AAC1C,oBAAI,mBAAmB;AACrB,iCAAe;AACf,wBAAM,WAAW,YAAY,IAAI,MAAM,CAAW;AAClD,sBAAI,KAAK,OAAO;AACd,+BAAW,MAAM,IAAI;AAAA,kBACvB;AAAA,gBACF;AAAA,cACF;AACA,kBAAI,KAAK,SAAS,cAAc,GAAG;AACjC,qBAAK,MAAM,UAAU,UAAU;AAAA,cACjC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,UAAI,KAAK,UAAU;AACjB,aAAK,QAAQ,OAAO,WAAW,KAAK,QAAQ,GAAG;AAAA,MACjD;AAAA,IACF;AAlFE,SAAK,iBAAiB;AAAA,EACxB;AAAA,EAEA,SAAS,OAAiB;AACxB,SAAK,QAAQ;AACb,QAAI,CAAC,KAAK,YAAY,KAAK,OAAO;AAChC,WAAK,cAAc;AAAA,IACrB;AAAA,EACF;AAAA,EAEA,SAAS,OAAc;AACrB,SAAK,QAAQ;AAAA,EACf;AAAA,EAEQ,gBAAgB;AACtB,SAAK,WAAW;AAChB,SAAK,OAAO;AAAA,EACd;AAAA,EAEQ,eAAe;AACrB,SAAK,WAAW;AAChB,QAAI,KAAK,OAAO;AACd,aAAO,aAAa,KAAK,KAAK;AAC9B,WAAK,QAAQ;AAAA,IACf;AAAA,EACF;AA0DF;;;ACpGA,IAAO,kBAAQ;AAAA,EACX,CAAC,SAAQ,uBAAsB,gBAAe,gBAAe,WAAW;AAAA,EACxE,CAAC,SAAQ,iCAAgC,kBAAiB,gBAAe,QAAQ;AAAA,EACjF,CAAC,SAAQ,sBAAqB,kBAAiB,EAAE;AAAA,EACjD,CAAC,SAAQ,kCAAiC,gBAAe,gBAAe,SAAS;AAAA,EACjF,CAAC,SAAQ,sBAAqB,kBAAiB,gBAAe,SAAS;AAAA,EACvE,CAAC,UAAS,oBAAmB,gBAAe,iBAAgB,WAAW;AAAA,EACvE,CAAC,SAAQ,qBAAoB,kBAAiB,gBAAe,SAAS;AAAA,EACtE,CAAC,QAAO,cAAa,gBAAe,gBAAe,WAAW;AAAA,EAC9D,CAAC,SAAQ,oBAAmB,kBAAiB,gBAAe,SAAS;AAAA,EACrE,CAAC,QAAO,oBAAmB,gBAAe,gBAAe,WAAW;AAAA,EACpE,CAAC,SAAQ,oCAAmC,gBAAe,gBAAe,SAAS;AAAA,EACnF,CAAC,UAAS,iBAAgB,gBAAgB,gBAAe,WAAW;AAAA,EACpE,CAAC,UAAS,iCAAgC,kBAAkB,gBAAe,SAAS;AAAA,EACpF,CAAC,UAAS,6BAA4B,gBAAgB,gBAAe,WAAW;AAAA,EAChF,CAAC,QAAO,iBAAgB,kBAAkB,gBAAe,WAAW;AAAA,EACpE,CAAC,SAAQ,sCAAqC,kBAAkB,iBAAgB,QAAQ;AAAA,EACxF,CAAC,UAAS,wBAAuB,gBAAgB,iBAAgB,WAAW;AAAA,EAC5E,CAAC,SAAQ,qBAAoB,gBAAgB,gBAAe,WAAW;AAAA,EACvE,CAAC,UAAS,cAAa,kBAAkB,gBAAe,SAAS;AAAA,EACjE,CAAC,QAAO,WAAU,gBAAgB,gBAAe,YAAY;AAAA,EAC7D,CAAC,UAAS,uBAAsB,kBAAkB,gBAAe,SAAS;AAAA,EAC1E,CAAC,QAAO,mBAAkB,gBAAgB,gBAAe,WAAW;AAAA,EACpE,CAAC,SAAQ,iBAAgB,kBAAkB,iBAAgB,QAAQ;AAAA,EACnE,CAAC,SAAQ,iBAAgB,gBAAgB,gBAAe,WAAW;AAAA,EACnE,CAAC,SAAQ,sBAAqB,kBAAkB,gBAAe,WAAW;AAAA,EAC1E,CAAC,SAAQ,eAAc,kBAAkB,gBAAe,SAAS;AAAA,EACjE,CAAC,SAAQ,YAAW,kBAAkB,iBAAgB,SAAS;AAAA,EAC/D,CAAC,QAAO,mBAAkB,gBAAe,EAAE;AAAA,EAC3C,CAAC,SAAQ,eAAc,kBAAkB,gBAAe,SAAS;AAAA,EACjE,CAAC,SAAQ,oCAAmC,gBAAgB,gBAAe,WAAW;AAAA,EACtF,CAAC,UAAS,iBAAgB,kBAAkB,gBAAe,SAAS;AAAA,EACpE,CAAC,SAAQ,gBAAe,kBAAkB,iBAAgB,WAAW;AAAA,EACrE,CAAC,UAAS,kBAAiB,gBAAgB,gBAAe,SAAS;AAAA,EACnE,CAAC,SAAQ,YAAW,gBAAgB,gBAAe,WAAW;AAAA,EAC9D,CAAC,SAAQ,YAAW,gBAAgB,gBAAe,SAAS;AAAA,EAC5D,CAAC,UAAS,iBAAgB,eAAe,gBAAe,YAAY;AAAA,EACpE,CAAC,SAAQ,wBAAuB,kBAAkB,gBAAe,WAAW;AAAA,EAC5E,CAAC,SAAQ,8BAA6B,kBAAkB,iBAAgB,SAAS;AAAA,EACjF,CAAC,QAAO,4BAA2B,kBAAkB,gBAAe,SAAS;AAAA,EAC7E,CAAC,UAAS,kBAAiB,gBAAgB,gBAAe,SAAS;AAAA,EACnE,CAAC,UAAS,sBAAqB,gBAAgB,gBAAe,WAAW;AAAA,EACzE,CAAC,SAAQ,gDAA+C,gBAAgB,iBAAgB,WAAW;AAAA,EACnG,CAAC,SAAQ,sCAAqC,kBAAkB,iBAAgB,SAAS;AAAA,EACzF,CAAC,SAAQ,iBAAgB,gBAAgB,gBAAe,SAAS;AAAA,EACjE,CAAC,SAAQ,+BAA8B,kBAAkB,iBAAgB,SAAS;AAAA,EAClF,CAAC,UAAS,wBAAuB,gBAAgB,gBAAe,SAAS;AAAA,EACzE,CAAC,UAAS,iBAAgB,kBAAkB,gBAAe,SAAS;AAAA,EACpE,CAAC,UAAS,uBAAsB,kBAAkB,gBAAe,QAAQ;AAAA,EACzE,CAAC,SAAQ,YAAW,gBAAgB,gBAAe,WAAW;AAAA,EAC9D,CAAC,UAAS,wBAAuB,kBAAkB,iBAAgB,SAAS;AAAA,EAC5E,CAAC,SAAQ,mBAAkB,gBAAgB,gBAAe,WAAW;AAAA,EACrE,CAAC,UAAS,8BAA6B,kBAAkB,gBAAe,SAAS;AAAA,EACjF,CAAC,UAAS,8BAA6B,gBAAgB,gBAAe,WAAW;AAAA,EACjF,CAAC,UAAS,6BAA4B,eAAe,gBAAe,YAAY;AAAA,EAChF,CAAC,SAAQ,oCAAmC,kBAAkB,gBAAe,SAAS;AAAA,EACtF,CAAC,UAAS,gBAAe,gBAAgB,gBAAe,SAAS;AAAA,EACjE,CAAC,SAAQ,8BAA6B,gBAAgB,gBAAe,SAAS;AAAA,EAC9E,CAAC,UAAS,cAAa,kBAAkB,gBAAe,SAAS;AAAA,EACjE,CAAC,SAAQ,mCAAkC,gBAAe,EAAE;AAAA,EAC5D,CAAC,QAAO,sBAAqB,gBAAgB,gBAAe,WAAW;AAAA,EACvE,CAAC,SAAQ,aAAY,kBAAkB,iBAAgB,SAAS;AAAA,EAChE,CAAC,SAAQ,mBAAkB,gBAAgB,gBAAe,WAAW;AAAA,EACrE,CAAC,SAAQ,mBAAkB,kBAAkB,iBAAgB,SAAS;AAAA,EACtE,CAAC,UAAS,gBAAe,gBAAgB,gBAAe,WAAW;AAAA,EACnE,CAAC,QAAO,gCAA+B,kBAAkB,iBAAgB,SAAS;AAAA,EAClF,CAAC,SAAQ,qCAAoC,gBAAgB,gBAAe,WAAW;AAAA,EACvF,CAAC,UAAS,0BAAyB,kBAAkB,iBAAgB,WAAW;AAAA,EAChF,CAAC,UAAS,0BAAyB,kBAAkB,iBAAgB,WAAW;AAAA,EAChF,CAAC,SAAQ,sBAAqB,kBAAiB,gBAAe,SAAS;AAAA,EACvE,CAAC,SAAQ,kBAAiB,kBAAkB,iBAAgB,WAAW;AAAA,EACvE,CAAC,SAAQ,mBAAkB,gBAAgB,gBAAe,SAAS;AAAA,EACnE,CAAC,QAAO,0BAAyB,gBAAgB,gBAAe,WAAW;AAAA,EAC3E,CAAC,SAAQ,0BAAyB,kBAAiB,gBAAe,SAAS;AAAA,EAC3E,CAAC,SAAQ,4BAA2B,gBAAgB,gBAAe,SAAS;AAAA,EAC5E,CAAC,SAAQ,kBAAiB,kBAAkB,gBAAe,SAAS;AAAA,EACpE,CAAC,UAAS,sBAAqB,gBAAgB,gBAAe,WAAW;AAAA,EACzE,CAAC,SAAQ,kBAAiB,kBAAkB,iBAAgB,QAAQ;AAAA,EACpE,CAAC,SAAQ,yBAAwB,gBAAgB,gBAAe,SAAS;AAAA,EACzE,CAAC,SAAQ,cAAa,kBAAkB,iBAAgB,SAAS;AAAA,EACjE,CAAC,SAAQ,OAAM,kBAAkB,gBAAe,SAAS;AAAA,EACzD,CAAC,QAAO,sBAAqB,gBAAgB,gBAAe,SAAS;AAAA,EACrE,CAAC,UAAS,qBAAoB,gBAAgB,iBAAgB,SAAS;AAAA,EACvE,CAAC,QAAO,uBAAsB,kBAAkB,gBAAe,SAAS;AAAA,EACxE,CAAC,SAAQ,oCAAmC,gBAAgB,gBAAe,SAAS;AAAA,EACpF,CAAC,SAAQ,YAAW,kBAAkB,gBAAe,SAAS;AAAA,EAC9D,CAAC,UAAS,2BAA0B,gBAAgB,gBAAe,WAAW;AAAA,EAC9E,CAAC,SAAQ,yBAAwB,gBAAgB,iBAAgB,SAAS;AAAA,EAC1E,CAAC,SAAQ,qBAAoB,kBAAkB,gBAAe,QAAQ;AAAA,EACtE,CAAC,SAAQ,uBAAsB,kBAAkB,gBAAe,QAAQ;AAAA,EACxE,CAAC,UAAS,cAAa,gBAAgB,gBAAe,WAAW;AAAA,EACjE,CAAC,SAAQ,UAAS,kBAAkB,gBAAe,SAAS;AAAA,EAC5D,CAAC,QAAO,sBAAqB,gBAAgB,gBAAe,WAAW;AAAA,EACvE,CAAC,UAAS,iBAAgB,kBAAkB,iBAAgB,SAAS;AAAA,EACrE,CAAC,QAAO,+BAA8B,gBAAgB,gBAAe,SAAS;AAAA,EAC9E,CAAC,SAAQ,uBAAsB,gBAAgB,gBAAe,YAAY;AAAA,EAC1E,CAAC,SAAQ,iBAAgB,kBAAkB,gBAAe,SAAS;AAAA,EACnE,CAAC,SAAQ,YAAW,kBAAkB,iBAAgB,SAAS;AAAA,EAC/D,CAAC,SAAQ,kBAAiB,kBAAkB,iBAAgB,SAAS;AACzE;;;ACnGA,IAAO,oBAAQ;AAAA,EACb,CAAC,aAAa,QAAQ,QAAO,QAAO,MAAM,SAAS;AAAA,EACnD,CAAC,kBAAkB,QAAQ,MAAK,QAAO,OAAO,UAAU;AAAA,EACxD,CAAC,kBAAkB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACvD,CAAC,eAAe,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACtD,CAAC,sBAAsB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EAC3D,CAAC,aAAa,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACpD,CAAC,gBAAgB,SAAS,OAAM,QAAO,MAAM,SAAS;AAAA,EACtD,CAAC,gBAAgB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACrD,CAAC,gBAAgB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACrD,CAAC,yBAAyB,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EAChE,CAAC,eAAe,OAAO,OAAM,QAAO,OAAO,UAAU;AAAA,EACrD,CAAC,aAAa,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACpD,CAAC,qBAAqB,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EACzD,CAAC,gBAAgB,SAAS,OAAM,MAAM,OAAO,UAAU;AAAA,EACvD,CAAC,eAAe,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACpD,CAAC,mBAAmB,QAAQ,MAAK,QAAO,MAAM,SAAS;AAAA,EACvD,CAAC,8BAA8B,OAAO,OAAM,OAAM,OAAO,UAAU;AAAA,EACnE,CAAC,yBAAyB,OAAO,OAAM,KAAO,MAAM,SAAS;AAAA,EAC7D,CAAC,cAAc,QAAQ,MAAK,OAAM,MAAM,SAAS;AAAA,EACjD,CAAC,aAAa,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EAClD,CAAC,cAAc,QAAQ,OAAM,KAAO,MAAM,SAAS;AAAA,EACnD,CAAC,+BAA+B,OAAO,OAAM,QAAO,OAAO,UAAU;AAAA,EACrE,CAAC,gBAAgB,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACvD,CAAC,yBAAyB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EAC9D,CAAC,wBAAwB,QAAQ,OAAM,GAAG,MAAM,OAAQ,UAAU;AAAA,EAClE,CAAC,kBAAkB,QAAQ,OAAM,MAAM,MAAM,SAAS;AAAA,EACtD,CAAC,0BAA0B,QAAQ,OAAM,OAAO,KAAM,SAAS;AAAA,EAC/D,CAAC,iCAAiC,OAAO,OAAM,QAAO,KAAM,SAAS;AAAA,EACrE,CAAC,8BAA8B,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EAClE,CAAC,uBAAuB,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EAC3D,CAAC,8BAA8B,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACnE,CAAC,iCAAiC,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACtE,CAAC,sBAAsB,OAAO,OAAM,QAAO,MAAM,SAAS;AAAA,EAC1D,CAAC,qBAAqB,QAAQ,OAAM,KAAO,MAAM,SAAS;AAAA,EAC1D,CAAC,yBAAyB,MAAM,OAAM,MAAM,MAAM,SAAS;AAAA,EAC3D,CAAC,0BAA0B,QAAQ,OAAM,OAAO,MAAM,SAAS;AAAA,EAC/D,CAAC,gBAAgB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACrD,CAAC,8BAA8B,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACrE,CAAC,oBAAoB,QAAQ,OAAM,GAAE,OAAO,OAAO,UAAU;AAAA,EAC7D,CAAC,uBAAuB,QAAQ,OAAM,MAAM,MAAM,SAAS;AAAA,EAC3D,CAAC,YAAY,OAAO,MAAK,OAAM,MAAM,SAAS;AAAA,EAC9C,CAAC,8BAA8B,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACnE,CAAC,YAAY,QAAQ,MAAK,QAAO,MAAM,SAAS;AAAA,EAChD,CAAC,wBAAwB,OAAO,OAAM,OAAM,OAAO,UAAU;AAAA,EAC7D,CAAC,iCAAiC,OAAO,OAAM,OAAO,OAAO,UAAU;AAAA,EACvE,CAAC,yBAAyB,QAAQ,OAAM,OAAM,OAAO,UAAU;AAAA,EAC/D,CAAC,cAAc,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACrD,CAAC,2BAA2B,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EAChE,CAAC,eAAe,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACpD,CAAC,mBAAmB,QAAQ,OAAM,KAAO,MAAO,UAAU;AAAA,EAC1D,CAAC,yBAAyB,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EAChE,CAAC,eAAe,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACpD,CAAC,2BAA2B,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EAClE,CAAC,4BAA4B,OAAM,OAAM,MAAM,SAAS;AAAA,EACxD,CAAC,gBAAgB,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EACpD,CAAC,0BAA0B,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EAC9D,CAAC,cAAc,QAAQ,MAAK,OAAM,MAAM,SAAS;AAAA,EACjD,CAAC,iCAAiC,QAAQ,MAAK,QAAO,MAAM,SAAS;AAAA,EACrE,CAAC,gBAAgB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACrD,CAAC,sBAAsB,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EACzD,CAAC,4BAA4B,QAAQ,MAAK,IAAM,OAAO,UAAU;AAAA,EACjE,CAAC,cAAc,QAAQ,OAAM,OAAM,KAAM,SAAS;AAAA,EAClD,CAAC,kCAAkC,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EACrE,CAAC,eAAe,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACpD,CAAC,eAAe,OAAO,MAAK,OAAM,MAAM,SAAS;AAAA,EACjD,CAAC,yBAAyB,MAAM,OAAM,OAAM,MAAM,SAAS;AAAA,EAC3D,CAAC,uBAAuB,OAAO,OAAM,OAAM,OAAO,UAAU;AAAA,EAC5D,CAAC,cAAc,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACrD,CAAC,mBAAmB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACxD,CAAC,eAAe,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACpD,CAAC,cAAc,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACnD,CAAC,4BAA4B,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACjE,CAAC,0BAA0B,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EAC/D,CAAC,mBAAmB,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EACtD,CAAC,6BAA6B,OAAM,OAAM,QAAO,MAAM,SAAS;AAAA,EAChE,CAAC,uCAAsC,QAAO,OAAM,OAAM,MAAK,SAAS;AAAA,EACxE,CAAC,wBAAwB,QAAQ,OAAM,QAAO,KAAM,SAAS;AAAA,EAC7D,CAAC,cAAc,QAAQ,KAAI,MAAM,KAAM,SAAS;AAAA,EAChD,CAAC,sBAAsB,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EACzD,CAAC,mBAAmB,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EACtD,CAAC,uBAAuB,MAAM,OAAM,QAAO,OAAO,UAAU;AAAA,EAC5D,CAAC,oBAAoB,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EACxD,CAAC,uBAAuB,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EAC1D,CAAC,eAAe,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EACnD,CAAC,kBAAkB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACvD,CAAC,kCAAkC,QAAQ,OAAM,OAAM,OAAO,UAAU;AAAA,EACxE,CAAC,6BAA6B,OAAO,OAAM,OAAM,OAAO,UAAU;AAAA,EAClE,CAAC,0BAA0B,QAAQ,OAAM,OAAO,MAAM,SAAS;AAAA,EAC/D,CAAC,eAAe,QAAQ,MAAK,OAAM,MAAM,SAAS;AAAA,EAClD,CAAC,aAAa,QAAQ,OAAM,OAAO,OAAO,UAAU;AAAA,EACpD,CAAC,YAAY,QAAQ,OAAM,OAAM,MAAM,SAAS;AAAA,EAChD,CAAC,mBAAmB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EACxD,CAAC,wBAAwB,QAAQ,KAAI,QAAO,OAAO,UAAU;AAAA,EAC7D,CAAC,eAAe,MAAM,OAAM,OAAO,MAAM,SAAS;AAAA,EAClD,CAAC,gBAAgB,QAAQ,OAAM,QAAO,OAAO,UAAU;AAAA,EACvD,CAAC,gCAAgC,OAAO,OAAM,OAAM,MAAM,SAAS;AAAA,EACnE,CAAC,iCAAiC,MAAM,OAAM,OAAM,OAAO,UAAU;AAAA,EACrE,CAAC,sBAAsB,QAAQ,OAAM,QAAO,MAAM,SAAS;AAAA,EAC3D,CAAC,0BAA0B,QAAQ,OAAM,MAAK,MAAM,SAAS;AAAA,EAC7D,CAAC,kBAAkB,MAAM,OAAM,OAAM,MAAM,SAAS;AAAA,EACpD,CAAC,mBAAmB,QAAQ,OAAM,MAAK,MAAM,SAAS;AACxD;;;ACvGA,IAAO,gBAAQ;AAAA,EACb,CAAC,aAAa,QAAQ,UAAU,OAAO,MAAM,SAAS;AAAA,EACtD,CAAC,kBAAkB,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EAC5D,CAAC,kBAAkB,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EAC5D,CAAC,eAAe,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EACzD,CAAC,qBAAqB,SAAS,UAAU,QAAQ,MAAM,SAAS;AAAA,EAChE,CAAC,aAAa,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EACvD,CAAC,qBAAqB,QAAQ,SAAS,QAAQ,MAAM,SAAS;AAAA,EAC9D,CAAC,8BAA8B,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EACxE,CAAC,+BAA+B,SAAS,SAAS,QAAQ,MAAM,SAAS;AAAA,EACzE,CAAC,oBAAoB,OAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,EAC/D,CAAC,0BAA0B,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EACnE,CAAC,kBAAkB,OAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,EAC7D,CAAC,uBAAuB,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EAChE,CAAC,yBAAyB,OAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,EACpE,CAAC,2BAA2B,KAAK,UAAU,QAAQ,MAAM,SAAS;AAAA,EAClE,CAAC,uBAAuB,MAAM,UAAU,QAAQ,OAAO,UAAU;AAAA,EACjE,CAAC,gBAAgB,QAAQ,UAAU,QAAQ,OAAO,SAAS;AAAA,EAC3D,CAAC,oBAAoB,MAAM,UAAU,QAAQ,MAAM,SAAS;AAAA,EAC5D,CAAC,gBAAgB,OAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,EAC3D,CAAC,kBAAkB,MAAM,UAAU,QAAQ,MAAM,SAAS;AAAA,EAC1D,CAAC,cAAc,OAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,EACzD,CAAC,oBAAoB,OAAO,UAAU,OAAO,MAAM,SAAS;AAAA,EAC5D,CAAC,yBAAyB,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EACnE,CAAC,eAAe,OAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,EAC1D,CAAC,eAAe,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EACxD,CAAC,aAAa,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EACvD,CAAC,gBAAgB,MAAM,SAAS,OAAO,OAAO,UAAU;AAAA,EACxD,CAAC,qBAAqB,QAAQ,UAAU,OAAO,MAAM,SAAS;AAAA,EAC9D,CAAC,sBAAsB,OAAO,SAAS,OAAO,OAAO,UAAU;AAAA,EAC/D,CAAC,kBAAkB,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EAC3D,CAAC,gCAAgC,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EACzE,CAAC,mBAAmB,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EAC5D,CAAC,wBAAwB,OAAO,UAAU,OAAO,MAAM,SAAS;AAAA,EAChE,CAAC,wBAAwB,SAAS,UAAU,OAAO,MAAM,SAAS;AAAA,EAClE,CAAC,aAAa,OAAO,UAAU,QAAQ,MAAM,SAAS;AAAA,EACtD,CAAC,cAAc,OAAO,UAAU,OAAO,OAAO,UAAU;AAAA,EACxD,CAAC,eAAe,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAAA,EACzD,CAAC,uBAAuB,OAAO,UAAU,OAAO,MAAM,SAAS;AAAA,EAC/D,CAAC,eAAe,QAAQ,UAAU,QAAQ,MAAM,SAAS;AAC3D;;;ACtCA,IAAO,cAAQ;AAAA,EACX,CAAC,gBAAe,YAAW,MAAO,MAAO,WAAU,SAAQ,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EAChG,CAAC,gBAAe,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,QAAO,MAAK,SAAQ,SAAS;AAAA,EAClG,CAAC,kBAAiB,YAAW,MAAM,MAAO,WAAU,UAAS,UAAS,OAAM,MAAK,SAAQ,SAAS;AAAA,EAClG,CAAC,0BAAyB,MAAO,KAAO,WAAU,UAAS,SAAQ,OAAM,MAAK,SAAQ,GAAE,SAAS;AAAA,EACjG,CAAC,gBAAe,YAAW,MAAO,OAAO,WAAU,SAAQ,WAAU,MAAM,MAAK,SAAQ,QAAQ;AAAA,EAChG,CAAC,kBAAiB,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EACnG,CAAC,kBAAiB,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAClG,CAAC,WAAU,YAAW,MAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,KAAK,SAAQ,SAAS;AAAA,EAC5F,CAAC,iBAAgB,YAAW,OAAO,KAAO,WAAU,UAAS,WAAU,OAAM,MAAK,UAAS,QAAQ;AAAA,EACnG,CAAC,cAAa,YAAW,OAAO,KAAO,WAAU,UAAS,WAAU,aAAY,MAAK,SAAQ,SAAS;AAAA,EACtG,CAAC,mBAAkB,YAAW,IAAO,KAAO,WAAU,SAAQ,WAAU,MAAM,MAAK,SAAQ,SAAS;AAAA,EACpG,CAAC,iBAAgB,YAAW,OAAO,MAAO,WAAU,SAAQ,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAChG,CAAC,cAAa,YAAW,MAAM,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAC9F,CAAC,cAAa,YAAW,MAAM,MAAO,YAAW,UAAS,WAAU,QAAO,MAAK,SAAQ,QAAQ;AAAA,EAChG,CAAC,SAAQ,YAAW,KAAM,KAAO,WAAU,UAAS,UAAS,MAAK,MAAK,SAAQ,SAAS;AAAA,EACxF,CAAC,YAAW,YAAW,MAAM,MAAO,WAAU,UAAS,UAAS,MAAK,KAAK,SAAQ,QAAQ;AAAA,EAC1F,CAAC,kBAAiB,YAAW,OAAO,KAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EACnG,CAAC,QAAO,YAAW,OAAQ,MAAO,WAAU,WAAU,UAAS,MAAK,MAAK,UAAS,QAAQ;AAAA,EAC1F,CAAC,UAAS,YAAW,OAAO,MAAO,WAAU,SAAQ,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EACzF,CAAC,gBAAe,YAAW,MAAM,OAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EAChG,CAAC,QAAO,YAAW,OAAQ,GAAO,WAAU,SAAQ,SAAQ,OAAM,MAAK,SAAQ,SAAS;AAAA,EACxF,CAAC,kBAAiB,YAAW,IAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EACnG,CAAC,kBAAiB,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EACnG,CAAC,WAAU,YAAW,OAAQ,KAAO,WAAU,UAAS,SAAQ,OAAM,KAAK,SAAQ,GAAE,SAAS;AAAA,EAC9F,CAAC,gBAAe,YAAW,MAAM,OAAO,WAAU,SAAQ,UAAS,MAAK,MAAK,SAAQ,SAAS;AAAA,EAC9F,CAAC,aAAY,YAAW,MAAO,MAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,QAAQ;AAAA,EAC7F,CAAC,mBAAkB,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EACnG,CAAC,cAAa,YAAW,KAAM,GAAM,UAAS,UAAS,WAAU,MAAK,KAAK,SAAQ,SAAS;AAAA,EAC5F,CAAC,eAAc,YAAW,OAAO,MAAO,WAAU,SAAQ,UAAS,MAAK,KAAK,SAAQ,QAAQ;AAAA,EAC7F,CAAC,mBAAkB,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,MAAK,MAAK,SAAQ,QAAQ;AAAA,EAClG,CAAC,SAAQ,YAAW,OAAO,OAAO,WAAU,UAAS,WAAU,MAAK,MAAK,UAAS,SAAS;AAAA,EAC3F,CAAC,OAAM,YAAW,MAAM,MAAO,WAAU,WAAU,SAAQ,MAAK,MAAK,SAAQ,GAAE,SAAS;AAAA,EACxF,CAAC,gBAAe,YAAW,MAAO,MAAO,WAAU,SAAQ,WAAU,MAAK,MAAK,SAAQ,GAAE,SAAS;AAAA,EAClG,CAAC,iBAAgB,YAAW,OAAO,KAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,QAAQ;AAAA,EACjG,CAAC,eAAc,YAAW,MAAM,MAAO,WAAU,UAAS,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAC9F,CAAC,QAAO,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EAC1F,CAAC,gBAAe,YAAW,MAAM,MAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,QAAQ;AAAA,EAC/F,CAAC,gBAAe,YAAW,OAAO,MAAO,WAAU,SAAQ,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAC/F,CAAC,gBAAe,YAAW,OAAO,KAAO,WAAU,SAAQ,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAC/F,CAAC,iBAAgB,YAAW,MAAO,MAAO,WAAU,SAAQ,WAAU,MAAK,MAAK,UAAS,QAAQ;AAAA,EACjG,CAAC,eAAc,YAAW,MAAM,MAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,QAAQ;AAAA,EAC9F,CAAC,aAAY,YAAW,MAAO,KAAO,WAAU,SAAQ,UAAS,MAAK,MAAK,SAAQ,QAAQ;AAAA,EAC3F,CAAC,kBAAiB,YAAW,MAAO,GAAO,WAAU,SAAQ,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EAClG,CAAC,YAAW,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,KAAK,MAAK,SAAQ,SAAS;AAAA,EAC5F,CAAC,iBAAgB,YAAW,MAAM,MAAO,WAAU,UAAS,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAChG,CAAC,kBAAiB,YAAW,MAAO,KAAO,WAAU,SAAQ,UAAS,OAAM,MAAK,SAAQ,QAAQ;AAAA,EACjG,CAAC,eAAc,YAAW,KAAQ,GAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EACjG,CAAC,OAAM,YAAW,OAAO,MAAO,WAAU,UAAS,SAAQ,QAAO,MAAK,SAAQ,SAAS;AAAA,EACxF,CAAC,iBAAgB,YAAW,MAAM,MAAO,WAAU,UAAS,UAAS,MAAK,MAAK,SAAQ,QAAQ;AAAA,EAC/F,CAAC,QAAO,YAAW,MAAM,MAAO,WAAU,WAAU,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EACzF,CAAC,YAAW,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,QAAO,KAAK,SAAQ,SAAS;AAAA,EAC/F,CAAC,YAAW,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EAC9F,CAAC,mBAAkB,YAAW,IAAO,MAAO,WAAU,UAAS,WAAU,aAAY,OAAM,SAAQ,SAAS;AAAA,EAC5G,CAAC,iBAAgB,YAAW,MAAO,MAAO,WAAU,SAAQ,UAAS,OAAM,MAAK,UAAS,SAAS;AAAA,EAClG,CAAC,cAAa,YAAW,OAAO,KAAO,WAAU,SAAQ,WAAU,aAAY,MAAK,SAAQ,QAAQ;AAAA,EACpG,CAAC,eAAc,YAAW,OAAO,KAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EAChG,CAAC,YAAW,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EAC9F,CAAC,iBAAgB,YAAW,IAAO,KAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,SAAS;AAAA,EAClG,CAAC,WAAU,YAAW,OAAO,MAAO,WAAU,UAAS,SAAQ,MAAK,MAAK,SAAQ,SAAS;AAAA,EAC1F,CAAC,iBAAgB,YAAW,OAAO,KAAO,WAAU,SAAQ,WAAU,OAAM,KAAK,SAAQ,SAAS;AAAA,EAClG,CAAC,WAAU,YAAW,OAAO,KAAO,WAAU,UAAS,WAAU,MAAM,MAAK,SAAQ,QAAQ;AAAA,EAC5F,CAAC,iBAAgB,YAAW,MAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EACjG,CAAC,iBAAgB,YAAW,OAAO,KAAO,WAAU,SAAQ,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EACjG,CAAC,cAAa,YAAW,MAAO,MAAO,WAAU,UAAS,WAAU,MAAK,KAAK,SAAQ,QAAQ;AAAA,EAC9F,CAAC,cAAa,YAAW,IAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAC9F,CAAC,gBAAe,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EACjG,CAAC,aAAY,YAAW,OAAQ,KAAO,WAAU,UAAS,SAAQ,aAAY,MAAK,SAAQ,SAAS;AAAA,EACpG,CAAC,iBAAgB,YAAW,OAAO,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAClG,CAAC,WAAU,YAAW,MAAO,KAAO,WAAU,UAAS,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EAC5F,CAAC,iBAAgB,YAAW,MAAM,MAAO,WAAU,WAAU,WAAU,MAAK,MAAK,SAAQ,SAAS;AAAA,EAClG,CAAC,eAAc,YAAW,MAAM,MAAO,WAAU,UAAS,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EAC/F,CAAC,aAAY,YAAW,MAAO,MAAO,WAAU,SAAQ,WAAU,QAAO,MAAK,SAAQ,SAAS;AAAA,EAC/F,CAAC,mBAAkB,YAAW,OAAO,MAAO,WAAU,SAAQ,WAAU,OAAM,MAAK,SAAQ,QAAQ;AAAA,EACnG,CAAC,YAAW,YAAW,IAAO,KAAO,WAAU,SAAQ,WAAU,OAAM,OAAM,SAAQ,SAAS;AAAA,EAC9F,CAAC,SAAQ,YAAW,OAAQ,GAAO,WAAU,SAAQ,WAAU,OAAM,KAAK,SAAQ,SAAS;AAAA,EAC3F,CAAC,iBAAgB,YAAW,IAAO,KAAO,WAAU,SAAQ,WAAU,OAAM,OAAM,SAAQ,SAAS;AAAA,EACnG,CAAC,WAAU,YAAW,OAAQ,KAAO,WAAU,SAAQ,WAAU,MAAM,KAAK,SAAQ,SAAS;AAAA,EAC7F,CAAC,cAAa,YAAW,OAAQ,GAAO,WAAU,SAAQ,WAAU,QAAO,KAAK,SAAQ,SAAS;AAAA,EACjG,CAAC,WAAU,YAAW,MAAO,KAAO,WAAU,UAAS,SAAQ,OAAM,MAAK,SAAQ,GAAE,SAAS;AAAA,EAC7F,CAAC,UAAS,YAAW,OAAQ,KAAO,WAAU,SAAQ,WAAU,MAAM,MAAK,SAAQ,SAAS;AAChG;;;AC9EA,IAAM,wBAAwB,CAAC;AAC/B,WAAW,OAAO,iBAAM;AAEtB,QAAM,CAAC,KAAK,MAAM,WAAW,QAAQ,MAAM,IAAI;AAC/C,QAAM,WAAW;AACjB,QAAM,OAAO;AACb,QAAM,YAAY;AAElB,wBAAsB,KAAK,CAAE,UAAU,QAAQ,MAAM,WAAW,KAAK,GAAG,GAAG,IAAI,QAAQ,IAAI,MAAM,QAAQ,SAAU,CAAC;AACtH;AAEA,WAAW,OAAO,aAAK;AAErB,QAAM,CAAC,MAAM,KAAK,WAAW,QAAQ,EAAE,MAAM,IAAI;AACjD,QAAM,WAAW;AACjB,QAAM,OAAO;AACb,QAAM,YAAY;AAElB,wBAAsB,KAAK,CAAC,UAAS,QAAO,MAAM,WAAU,KAAI,GAAG,GAAG,IAAI,QAAQ,IAAG,MAAK,QAAO,SAAU,CAAC;AAC9G;AAEA,WAAW,OAAO,mBAAQ;AAExB,QAAM,CAAC,MAAM,KAAK,WAAW,WAAW,MAAM,IAAI;AAClD,QAAM,WAAW;AACjB,QAAM,OAAO;AACb,QAAM,SAAS;AAEf,wBAAsB,KAAK,CAAE,UAAU,QAAQ,MAAM,WAAW,KAAK,GAAG,GAAG,IAAI,QAAQ,IAAI,MAAM,QAAQ,SAAU,CAAC;AACtH;AAEA,WAAW,OAAO,eAAO;AAEvB,QAAM,CAAC,MAAM,KAAK,WAAU,EAAC,MAAM,IAAI;AACvC,QAAM,WAAW;AACjB,QAAM,OAAO;AACb,QAAM,SAAS;AACf,QAAM,YAAY;AAElB,wBAAsB,KAAK,CAAE,UAAU,QAAQ,MAAM,WAAW,KAAK,GAAG,GAAG,IAAI,QAAQ,IAAI,MAAM,QAAQ,SAAU,CAAC;AACtH;AAEA,IAAO,uBAAQ;;;AClBf,IAAM,EAAE,KAAK,SAAS,KAAK,SAAS,KAAK,IAAI,mBAAmBC,SAAQ,MAAM;AAC9E,IAAM,wBAAwB,IAAI,oBAAoB;AAAA,EACpD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,SAA0B,CAAC;AAGjC,WAAW,CAAC,EAAC,EAAC,EAAC,WAAU,GAAG,KAAK,sBAAuB;AACtD,QAAM,YAAY,WAAW,OAAO,SAAS,CAAC;AAC9C,MAAI,CAAC,MAAM,SAAS,GAAE;AACtB,UAAM,CAACC,MAAKC,IAAG,IAAI,WAAW,GAAE,gBAAgB;AAChD,UAAMC,WAAU,OAAO,KAAM,GAAI;AACjC,UAAMC,WAAU,OAAO,KAAM,GAAI;AACjC,UAAM,QAAQ,YAAY,OAAO,GAAG,CAAC,IAAI;AACzC,UAAMC,QAAO,YAAY,OAAO,GAAG,CAAC,IAAI;AACxC,UAAM,OAAO,YAAY,OAAO,GAAG,CAAC,IAAI;AACxC,UAAM,QAAQ;AACd,UAAM,WAAW;AACjB,WAAO,KAAK;AAAA,MACVH;AAAA,MACAC;AAAA,MACAF;AAAA,MACAG;AAAA,MACA;AAAA,MACAC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EAED;AACF;AAEA,IAAM,cAAc,IAAI;AAAA,EACtBL,SAAQ;AAAA,EACR;AAAA,EACA,mBAAmBA,SAAQ,MAAM;AAAA,EACjC;AACF;AAEA,IAAO,iBAAQ;;;AC9Df,IAAMM,sBAAqB,CAAC,cAC1B,OAAO,OAAO,QAAQ,SAAS,EAAE,OAAO,EAAE;AAAA,EACxC,CAAC,KAAK,KAAK,UAAU;AACnB,QAAI,IAAI,IAAI,IAAI;AAChB,WAAO;AAAA,EACT;AAAA,EACA,CAAC;AACH;AAEF,IAAM,YAAiD;AAAA,EACrD,UAAUA,oBAAmB,UAAU;AAAA,EACvC,QAAQA,oBAAmB,QAAQ;AAAA,EACnC,eAAeA,oBAAmB,eAAe;AAAA,EACjD,0BAA0BA,oBAAmB,0BAA0B;AAAA,EACvE,mBAAmBA,oBAAmB,mBAAmB;AAAA,EACzD,8BAA8BA;AAAA,IAC5B;AAAA,EACF;AAAA,EACA,mBAAmBA,oBAAmB,mBAAmB;AAC3D;AAMA,IAAM,oBAAoB,IAAI;AAAA,EAC5B,QAAQ;AAAA,EACR;AAAA,EACA,UAAU;AACZ;AAKA,IAAM,gBAAgB,IAAI;AAAA,EACxB,QAAQ;AAAA,EACR,CAAC;AAAA,EACD,UAAU;AACZ;AAEA,IAAI,kBAAkB;AAItB,IAAM,2BAA2B,IAAI;AAAA,EACnC,QAAQ;AAAA,EACR,CAAC;AAAA,EACD,UAAU;AACZ;AAGO,IAAM,yBAAyB,CACpC,UACA,YACA,OAAO,OACP,SAAS,iBACN;AAAA,EACH;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAAS,iBAAiB;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,SAAS,oBAAoB,UAAkB,YAAoB;AACjE,QAAM,mBAAmB,uBAAuB,UAAU,UAAU;AAEpE,gBAAc,OAAO,gBAAgB;AAErC,QAAM,EAAE,UAAU,IAAI,IAAIA,oBAAmB,mBAAmB;AAChE,QAAM,eAAe,kBAAkB,KAAK;AAAA,IAC1C,CAAC,MAAM,EAAE,GAAG,MAAM;AAAA,EACpB;AAEA,eAAa,QAAQ,CAAC,CAAC,EAAE,EAAE,aAAa,EAAE,KAAK,EAAE,EAAE,UAAU,SAAS,MAAM;AAC1E,UAAM,OAAO;AACb,UAAM,aAAa;AACnB,UAAM,aAAa;AACnB,UAAM,gBAAgB;AACtB,UAAM,cAAc;AACpB,UAAM,YAAY;AAClB,UAAM,cAAc;AACpB,UAAM,kBAAkB;AACxB,UAAM,OAAO;AACb,UAAM,QAAQ;AAEd,UAAM,EAAE,WAAW,IAAI,UAAU;AACjC,UAAM,mBAAmB,iBAAiB,UAAU;AACpD,UAAM,8BAAoD;AAAA,MACxD;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAG,gBAAgB,IAAI,GAAG;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,6BAAyB,OAAO,2BAA2B;AAAA,EAC7D,CAAC;AACH;AAEA,eAAe,eAAe,YAA2C;AACvE,UAAQ,IAAI,qBAAqB,WAAW,OAAO,EAAE;AACvD;AACA,eAAe,aAAa,YAA2C;AACrE,QAAM,CAAC,gBAAgB,IAAI,WAAW;AACtC,gBAAc,OAAO,kBAAkB,UAAU,WAAW;AAC9D;AACA,eAAe,cAAc,YAA2C;AACtE,QAAM,CAAC,gBAAgB,IAAI,WAAW;AACtC,gBAAc,OAAO,kBAAkB,UAAU,YAAY;AAC/D;AAEA,eAAe,gBAAgB,YAA2C;AACxE,QAAM;AAAA,IACJ,QAAQ,CAAC,UAAU,UAAU;AAAA,EAC/B,IAAI;AACJ,sBAAoB,UAAU,UAAU;AAC1C;AAIO,IAAM,SAA0C;AAAA,EACrD,UAAU,IAAI;AAAA,IACZ,QAAQ;AAAA,IACR;AAAA,MACE,CAAC,UAAU,CAAC;AAAA,MACZ,CAAC,kBAAkB,CAAC;AAAA,MACpB,CAAC,QAAQ,CAAC;AAAA,MACV,CAAC,OAAO,CAAC;AAAA,MACT,CAAC,iBAAiB,CAAC;AAAA,IACrB;AAAA,IACA,UAAU;AAAA,EACZ;AAAA,EACA,QAAQ,IAAI;AAAA,IACV,QAAQ;AAAA,IACR;AAAA,MACE,CAAC,cAAc,cAAc,GAAG,CAAC;AAAA,MACjC,CAAC,QAAQ,QAAQ,GAAG,CAAC;AAAA,MACrB,CAAC,YAAY,YAAY,GAAG,CAAC;AAAA,MAC7B,CAAC,UAAU,UAAU,GAAG,CAAC;AAAA,IAC3B;AAAA,IACA,UAAU;AAAA,EACZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,8BAA8B;AAAA,IAC5B,EAAE,QAAQ,UAAU,OAAO,+BAA+B;AAAA,IAC1D;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAAA,EACA,mBAAmB,IAAI;AAAA,IACrB,QAAQ;AAAA,IACR;AAAA,MACE,CAAC,qBAAqB,CAAC;AAAA,MACvB,CAAC,aAAa,CAAC;AAAA,MACf,CAAC,SAAS,CAAC;AAAA,MACX,CAAC,QAAQ,CAAC;AAAA,IACZ;AAAA,IACA,UAAU;AAAA,EACZ;AACF;AAEA,IAAM,QAAuD;AAAA,EAC3D,UAAU;AAAA,EACV,QAAQ;AAAA,IACN,MAAM;AAAA,IACN,OAAO;AAAA,MACL;AAAA,QACE,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,MAAM;AAAA,QACN,SAAS;AAAA,MACX;AAAA,IACF;AAAA,EACF;AAAA,EACA,mBAAmB;AAAA,EACnB,eAAe;AAAA,EACf,0BAA0B;AAAA,EAC1B,8BAA8B;AAAA,EAC9B,mBAAmB;AACrB;AAOA,IAAM,WAA+D;AAAA,EACnE,UAAU;AAAA,EACV,QAAQ;AAAA,IACN;AAAA,MACE,SAAS;AAAA,MACT,SAAS;AAAA,IACX;AAAA,EACF;AAAA,EACA,mBAAmB;AAAA,EACnB,eAAe;AAAA,IACb;AAAA,MACE,SAAS;AAAA,MACT,SAAS;AAAA,IACX;AAAA,IACA;AAAA,MACE,SAAS;AAAA,MACT,SAAS;AAAA,IACX;AAAA,EACF;AAAA,EACA,0BAA0B;AAAA,EAC1B,8BAA8B;AAAA,IAC5B;AAAA,MACE,SAAS;AAAA,MACT,SAAS;AAAA,IACX;AAAA,EACF;AAAA,EACA,mBAAmB;AACrB;AAEA,IAAM,uBAAuB,CAAC,cAAgC;AAC5D,QAAM,SAAS,QAAQ,SAAS;AAChC,SAAO,OAAO;AAChB;AAEA,IAAM,mBAAmB,CAAC,cAAgC;AACxD,QAAM,oBAAoB,qBAAqB,SAAS;AACxD,QAAM,EAAE,IAAI,IAAI,QAAQ,SAAS;AACjC,SAAO,IAAI,uBAAuB;AAAA,IAChC;AAAA,IACA,SAAS,UAAU,SAAS;AAAA,IAC5B,WAAW;AAAA,IACX,MAAM,MAAM,SAAS;AAAA,IACrB,aAAa,SAAS,SAAS;AAAA,IAC/B,OAAO,OAAO,SAAS;AAAA;AAAA,EAEzB,CAAC;AACH;AAEA,IAAM,oBAAoB,YAAY,CAAC;AAEvC,IAAM,eAA4C;AAAA,EAChD;AAAA,EACA,eAAe,MAAM;AACvB;AAEA,IAAO,wBAAQ;;;AClRf,4BAA8B;;;ACAvB,IAAM,aAAa,CAAC,OAAO,OAAO,OAAO,OAAO,KAAK;;;ACArD,IAAM,YAAyC;AAAA,EACpD,GAAG,CAAC,cAAc,eAAe;AAAA,EACjC,GAAG,CAAC,eAAe,cAAc;AAAA,EACjC,IAAI,CAAC,QAAQ,eAAe;AAAA,EAC5B,IAAI,CAAC,OAAO,eAAe;AAAA,EAC3B,IAAI,CAAC,SAAS,YAAY;AAAA,EAC1B,IAAI,CAAC,SAAS,YAAY;AAAA,EAC1B,IAAI,CAAC,aAAa,WAAW;AAAA,EAC7B,IAAI,CAAC,UAAU,WAAW;AAC5B;AACO,IAAM,WAAW,CAAC,KAAK,KAAK,MAAM,MAAM,MAAM,MAAM,MAAM,IAAI;;;ACV9D,IAAM,WAAW;AAAA,EACtB;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EACtE;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AACpB;;;AHwBO,IAAM,sBAAsB;AAAA,EACjC,KAAK;AAAA,EACL,UAAU;AAAA,EACV,aAAa;AAAA,EACb,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,KAAK;AAAA,EACL,OAAO;AACT;AAEA,IAAM,kBAAwC,CAAC;AAE/C,IAAM,QAAQ,MAAM,KAAK,sBAAsB;AAE/C,IAAM,cAAc,MAAM;AACxB,QAAM,QAAQ,OAAO,GAAG,GAAK;AAC7B,QAAM,aAAa,OAAO,GAAG,EAAE;AAC/B,SAAO,QAAQ;AACjB;AAIA,WAAW,QAAQ,OAAO;AACxB,WAAS,IAAI,GAAG,IAAI,KAAO,KAAK;AAC9B,UAAM,QAAQ,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,CAAC;AAC/C,UAAM,QAAQ,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,CAAC;AAC/C,UAAM,QAAQ,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,CAAC;AAE/C,UAAM,SAAS,SAAS,OAAO,GAAG,SAAS,SAAS,CAAC,CAAC;AACtD,UAAM,MAAM,OAAO,QAAQ,QAAQ,QAAQ,MAAM;AACjD,UAAM,MAAM,OAAO,QAAQ,QAAQ,QAAQ,MAAM;AACjD,UAAM,cAAc,GAAG,GAAG;AAC1B,UAAM,WAAW,WAAW,OAAO,GAAG,CAAC,CAAC;AACxC,UAAM,WAAO,qCAAc;AAC3B,UAAM,UAAU,SAAS,OAAO,GAAG,SAAS,SAAS,CAAC,CAAC;AAEvD,UAAM,WAAW,UAAU,MAAM,EAAE,CAAC;AACpC,UAAM,QAAQ,YAAY;AAE1B,oBAAgB,KAAK;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAO,IAAI;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AACF;AAIA,IAAM,mBAAmB,IAAI;AAAA,EAC3BC,SAAQ;AAAA,EACR;AAAA,EACA,mBAAmBA,SAAQ,WAAW;AACxC;AAGA,IAAO,sBAAQ;;;AInFf,IAAM,0BAA0B,gBAAgB;AAAA,EAAI,CAAC,QAClD,IACE,MAAM,GAAG,EAAE,EACX,OAAO,CAAC,OAAO,GAAG,CAAC,MAAM,GAAG,OAAO,GAAG,CAAC,MAAM,IAAG,oBAAI,KAAK,GAAE,QAAQ,CAAC,CAAC;AAC1E;AAEA,IAAM,2BAA2B,IAAI;AAAA,EACnCC,SAAQ;AAAA,EACR;AAAA,EACA,mBAAmBA,SAAQ,mBAAmB;AAChD;AAEA,IAAO,+BAAQ;;;ACaf,IAAM,EAAE,KAAAC,MAAK,SAAAC,UAAS,KAAAC,MAAK,SAAAC,SAAQ,IAAI,mBAAmBC,SAAQ,MAAM;AACxE,IAAMC,yBAAwB,IAAI,oBAAoB;AAAA,EACpD,KAAAL;AAAA,EACA,SAAAC;AAAA,EACA,KAAAC;AAAA,EACA,SAAAC;AACF,CAAC;AAID,IAAM,2BAA2B,CAAC,OAAO,OAAO;AAChD,IAAM,aAAmC,gBAAgB,IAAI,CAAC,eAAe;AAC3E,QAAM,EAAE,KAAK,OAAO,UAAU,IAAI,yBAAyB;AAAA,IACzD,CAAC,KAAK,OAAO,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,WAAW,oBAAoB,CAAC,CAAC,EAAE;AAAA,IAC/D,CAAC;AAAA,EACH;AACA,QAAM,SAAS,OAAO,GAAG,EAAE;AAE3B,QAAMD,OAAM,YAAY,SAAS;AACjC,QAAMC,WAAU,OAAO,KAAM,GAAI;AACjC,QAAMH,OAAM,YAAY,SAAS;AACjC,QAAMC,WAAU,OAAO,KAAM,GAAI;AACjC,QAAM,QAAQ,YAAY,OAAO,GAAG,CAAC,IAAI;AACzC,QAAMK,QAAO,YAAY,OAAO,GAAG,CAAC,IAAI;AACxC,QAAM,OAAO,YAAY,OAAO,GAAG,CAAC,IAAI;AACxC,QAAM,QAAQ;AACd,QAAM,WAAW;AACjB,SAAO,CAACJ,MAAKC,UAASH,MAAKC,UAAS,OAAOK,OAAM,MAAM,OAAO,KAAK,QAAQ;AAC7E,CAAC;AAGD,WAAW,CAAC,EAAC,EAAC,EAAC,WAAU,GAAG,KAAK,sBAAuB;AACtD,QAAM,YAAY,WAAW,OAAO,SAAS,CAAC;AAC9C,MAAI,CAAC,MAAM,SAAS,GAAG;AACrB,UAAM,SAAS,OAAO,GAAG,EAAE;AAC3B,UAAMJ,OAAM,YAAY,SAAS;AACjC,UAAMC,WAAU,OAAO,KAAM,GAAI;AACjC,UAAMH,OAAM,YAAY,SAAS;AACjC,UAAMC,WAAU,OAAO,KAAM,GAAI;AACjC,UAAM,QAAQ,YAAY,OAAO,GAAG,CAAC,IAAI;AACzC,UAAMK,QAAO,YAAY,OAAO,GAAG,CAAC,IAAI;AACxC,UAAM,OAAO,YAAY,OAAO,GAAG,CAAC,IAAI;AACxC,UAAM,QAAQ;AACd,UAAM,WAAW;AACjB,eAAW,KAAK;AAAA,MACdJ;AAAA,MACAC;AAAA,MACAH;AAAA,MACAC;AAAA,MACA;AAAA,MACAK;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AACF;AAKA,IAAMC,eAAc,IAAI;AAAA,EACtBH,SAAQ;AAAA,EACR;AAAA,EACA,mBAAmBA,SAAQ,MAAM;AAAA,EACjCC;AACF;AAGA,IAAOG,kBAAQC;;;AC1Ff,IAAMC,UAAwC;AAAA,EAC5C,aAAa,IAAI;AAAA,IACfC,SAAQ;AAAA,IACR,CAAC;AAAA,IACD,mBAAmBA,SAAQ,WAAW;AAAA,EACxC;AAAA,EACA,aAAa;AAAA,EACb,qBAAqB;AAAA,EACrB,kBAAkB;AAAA,IAChB,EAAE,QAAQ,SAAS,OAAO,mBAAmB;AAAA,IAC7C;AAAA,IACAC;AAAA,IACA;AAAA,EACF;AAAA,EACA,QAAQ,IAAI,MAAMD,SAAQ,QAAQ,CAAC,GAAG,mBAAmBA,SAAQ,MAAM,CAAC;AAAA,EACxE,cAAc,IAAI;AAAA,IAChBA,SAAQ;AAAA,IACR,CAAC;AAAA,IACD,mBAAmBA,SAAQ,YAAY;AAAA,EACzC;AAAA,EACA,QAAQC;AACV;AAEA,IAAMC,wBAAuB,CAAC,cAA8B;AAC1D,QAAM,SAASF,SAAQ,SAAS;AAChC,MAAI,QAAQ;AACV,WAAO,OAAO;AAAA,EAChB,OAAO;AACL,UAAM,MAAM,gDAAgD,SAAS,EAAE;AAAA,EACzE;AACF;AAEA,IAAMG,oBAAmB,CAAC,cAA8B;AACtD,QAAM,oBAAoBD,sBAAqB,SAAS;AACxD,SAAO,IAAI,uBAAuB;AAAA,IAChC;AAAA,IACA,WAAWF,SAAQ,SAAS,EAAE;AAAA,IAC9B,OAAOD,QAAO,SAAS;AAAA;AAAA;AAAA,EAGzB,CAAC;AACH;AAEA,IAAM,oBAAuC,CAAC;AAAA,EAC5C;AAAA,EACA;AAAA,EACA;AACF,MAAuB;AACrB,QAAM,QAAQA,QAAO,SAAS,KAAuB;AACrD,MAAI,OAAO;AACT,WAAO,gBAAgB,OAAO,QAAQ,OAAO;AAAA,EAC/C,OAAO;AACL,UAAM;AAAA,MACJ,0CAA0C,SAAS,MAAM,IAAI,SAAS,KAAK;AAAA,IAC7E;AAAA,EACF;AACF;AAEA,IAAM,cAAyC;AAAA,EAC7C,kBAAAI;AAAA,EACA,eAAe,MAAM;AACvB;AAEA,IAAO,uBAAQ;;;AC5Df,IAAM,aAGF;AAAA,EACF,QAAQ;AAAA,EACR,OAAO;AACT;AAEO,IAAM,YAAY,CACvB,eACG,WAAW,UAAU;",
+  "names": ["module", "cusip", "isinGenerator", "schemas", "schemas", "schemas", "IterMode", "length", "last", "children", "positions", "node", "buffer", "data", "lookAhead", "pair", "nodeSize", "from", "to", "parser", "i", "last", "Recover", "Safety", "last", "parser", "Rec", "last", "i", "debug", "leafData", "aggColumn", "SELECTED", "DEPTH", "KEY", "row", "_a", "DEPTH", "IS_EXPANDED", "IS_LEAF", "KEY", "SELECTED", "_data", "row", "nextRandomDouble", "ask", "bid", "bid", "ask", "last", "schemas", "bid", "ask", "askSize", "bidSize", "last", "buildDataColumnMap", "schemas", "schemas", "bid", "bidSize", "ask", "askSize", "schemas", "pricesUpdateGenerator", "last", "pricesTable", "prices_default", "pricesTable", "tables", "schemas", "prices_default", "getColumnDescriptors", "createDataSource"]
 }