docs/_assets/_static/apollo-client.js.map
{
"version": 3,
"sources": ["../../../node_modules/@apollo/client/node_modules/tslib/tslib.js", "../../../node_modules/ts-invariant/node_modules/tslib/tslib.js", "../../../node_modules/fast-json-stable-stringify/index.js", "../../../node_modules/zen-observable/lib/Observable.js", "../../../node_modules/zen-observable/index.js", "../../../node_modules/graphql-tag/node_modules/tslib/tslib.js", "../../../node_modules/@apollo/client/node_modules/tslib/modules/index.js", "../../../node_modules/ts-invariant/node_modules/tslib/modules/index.js", "../../../node_modules/ts-invariant/src/invariant.ts", "../../../node_modules/graphql/jsutils/isObjectLike.mjs", "../../../node_modules/graphql/polyfills/symbols.mjs", "../../../node_modules/graphql/language/location.mjs", "../../../node_modules/graphql/language/printLocation.mjs", "../../../node_modules/graphql/error/GraphQLError.mjs", "../../../node_modules/graphql/error/syntaxError.mjs", "../../../node_modules/graphql/language/kinds.mjs", "../../../node_modules/graphql/jsutils/invariant.mjs", "../../../node_modules/graphql/jsutils/nodejsCustomInspectSymbol.mjs", "../../../node_modules/graphql/jsutils/defineInspect.mjs", "../../../node_modules/graphql/language/ast.mjs", "../../../node_modules/graphql/language/tokenKind.mjs", "../../../node_modules/graphql/jsutils/inspect.mjs", "../../../node_modules/graphql/jsutils/devAssert.mjs", "../../../node_modules/graphql/jsutils/instanceOf.mjs", "../../../node_modules/graphql/language/source.mjs", "../../../node_modules/graphql/language/directiveLocation.mjs", "../../../node_modules/graphql/language/blockString.mjs", "../../../node_modules/graphql/language/lexer.mjs", "../../../node_modules/graphql/language/parser.mjs", "../../../node_modules/graphql/language/visitor.mjs", "../../../node_modules/graphql/language/printer.mjs", "../../../node_modules/@apollo/src/utilities/graphql/directives.ts", "../../../node_modules/@apollo/src/utilities/graphql/fragments.ts", "../../../node_modules/@apollo/src/utilities/graphql/storeUtils.ts", "../../../node_modules/@apollo/src/utilities/graphql/getFromAST.ts", "../../../node_modules/@apollo/src/utilities/common/filterInPlace.ts", "../../../node_modules/@apollo/src/utilities/graphql/transform.ts", "../../../node_modules/@apollo/src/utilities/common/mergeDeep.ts", "../../../node_modules/@apollo/src/utilities/policies/pagination.ts", "../../../node_modules/@apollo/src/utilities/observables/Observable.ts", "../../../node_modules/@apollo/client/node_modules/symbol-observable/es/ponyfill.js", "../../../node_modules/@apollo/client/node_modules/symbol-observable/es/index.js", "../../../node_modules/@apollo/src/utilities/common/cloneDeep.ts", "../../../node_modules/@apollo/src/utilities/common/environment.ts", "../../../node_modules/@apollo/src/utilities/common/maybeDeepFreeze.ts", "../../../node_modules/@apollo/src/utilities/observables/iteration.ts", "../../../node_modules/@apollo/src/utilities/observables/asyncMap.ts", "../../../node_modules/@apollo/src/utilities/observables/subclassing.ts", "../../../node_modules/@apollo/src/utilities/observables/Concast.ts", "../../../node_modules/@apollo/src/utilities/common/arrays.ts", "../../../node_modules/@apollo/src/utilities/common/errorHandling.ts", "../../../node_modules/@apollo/src/utilities/common/canUse.ts", "../../../node_modules/@apollo/src/utilities/common/compact.ts", "../../../node_modules/@apollo/src/link/utils/fromError.ts", "../../../node_modules/@apollo/src/link/utils/toPromise.ts", "../../../node_modules/@apollo/src/link/utils/fromPromise.ts", "../../../node_modules/@apollo/src/link/utils/throwServerError.ts", "../../../node_modules/@apollo/src/link/utils/validateOperation.ts", "../../../node_modules/@apollo/src/link/utils/createOperation.ts", "../../../node_modules/@apollo/src/link/utils/transformOperation.ts", "../../../node_modules/@apollo/src/link/core/ApolloLink.ts", "../../../node_modules/@apollo/src/link/core/empty.ts", "../../../node_modules/@apollo/src/link/core/from.ts", "../../../node_modules/@apollo/src/link/core/split.ts", "../../../node_modules/@apollo/src/link/core/concat.ts", "../../../node_modules/@apollo/src/link/core/execute.ts", "../../../node_modules/@apollo/src/version.ts", "../../../node_modules/@apollo/src/link/http/parseAndCheckHttpResponse.ts", "../../../node_modules/@apollo/src/link/http/serializeFetchParameter.ts", "../../../node_modules/@apollo/src/link/http/selectHttpOptionsAndBody.ts", "../../../node_modules/@apollo/src/link/http/checkFetcher.ts", "../../../node_modules/@apollo/src/link/http/createSignalIfSupported.ts", "../../../node_modules/@apollo/src/link/http/selectURI.ts", "../../../node_modules/@apollo/src/link/http/rewriteURIForGET.ts", "../../../node_modules/@apollo/src/link/http/createHttpLink.ts", "../../../node_modules/@apollo/src/link/http/HttpLink.ts", "../../../node_modules/@wry/equality/src/equality.ts", "../../../node_modules/@apollo/src/errors/index.ts", "../../../node_modules/@apollo/src/core/networkStatus.ts", "../../../node_modules/@apollo/src/core/Reobserver.ts", "../../../node_modules/@apollo/src/core/ObservableQuery.ts", "../../../node_modules/@wry/trie/src/trie.ts", "../../../node_modules/@wry/context/src/slot.ts", "../../../node_modules/@wry/context/src/context.ts", "../../../node_modules/optimism/src/cache.ts", "../../../node_modules/optimism/src/context.ts", "../../../node_modules/optimism/src/helpers.ts", "../../../node_modules/optimism/src/entry.ts", "../../../node_modules/optimism/src/dep.ts", "../../../node_modules/optimism/src/index.ts", "../../../node_modules/@apollo/src/cache/core/cache.ts", "../../../node_modules/@apollo/src/cache/core/types/Cache.ts", "../../../node_modules/@apollo/src/cache/core/types/common.ts", "../../../node_modules/@apollo/src/cache/inmemory/helpers.ts", "../../../node_modules/@apollo/src/cache/inmemory/entityStore.ts", "../../../node_modules/@apollo/src/cache/inmemory/readFromStore.ts", "../../../node_modules/@apollo/src/cache/inmemory/writeToStore.ts", "../../../node_modules/@apollo/src/cache/inmemory/reactiveVars.ts", "../../../node_modules/@apollo/src/cache/inmemory/policies.ts", "../../../node_modules/@apollo/src/cache/inmemory/inMemoryCache.ts", "../../../node_modules/@apollo/src/core/LocalState.ts", "../../../node_modules/@apollo/src/core/QueryInfo.ts", "../../../node_modules/@apollo/src/core/QueryManager.ts", "../../../node_modules/@apollo/src/core/ApolloClient.ts", "../../../node_modules/graphql-tag/node_modules/tslib/modules/index.js", "../../../node_modules/graphql-tag/src/index.ts", "../../../node_modules/@apollo/src/core/index.ts"],
"sourcesContent": ["/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\n/* global global, define, System, Reflect, Promise */\r\nvar __extends;\r\nvar __assign;\r\nvar __rest;\r\nvar __decorate;\r\nvar __param;\r\nvar __metadata;\r\nvar __awaiter;\r\nvar __generator;\r\nvar __exportStar;\r\nvar __values;\r\nvar __read;\r\nvar __spread;\r\nvar __spreadArrays;\r\nvar __await;\r\nvar __asyncGenerator;\r\nvar __asyncDelegator;\r\nvar __asyncValues;\r\nvar __makeTemplateObject;\r\nvar __importStar;\r\nvar __importDefault;\r\nvar __classPrivateFieldGet;\r\nvar __classPrivateFieldSet;\r\nvar __createBinding;\r\n(function (factory) {\r\n var root = typeof global === \"object\" ? global : typeof self === \"object\" ? self : typeof this === \"object\" ? this : {};\r\n if (typeof define === \"function\" && define.amd) {\r\n define(\"tslib\", [\"exports\"], function (exports) { factory(createExporter(root, createExporter(exports))); });\r\n }\r\n else if (typeof module === \"object\" && typeof module.exports === \"object\") {\r\n factory(createExporter(root, createExporter(module.exports)));\r\n }\r\n else {\r\n factory(createExporter(root));\r\n }\r\n function createExporter(exports, previous) {\r\n if (exports !== root) {\r\n if (typeof Object.create === \"function\") {\r\n Object.defineProperty(exports, \"__esModule\", { value: true });\r\n }\r\n else {\r\n exports.__esModule = true;\r\n }\r\n }\r\n return function (id, v) { return exports[id] = previous ? previous(id, v) : v; };\r\n }\r\n})\r\n(function (exporter) {\r\n var extendStatics = Object.setPrototypeOf ||\r\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\r\n\r\n __extends = function (d, b) {\r\n extendStatics(d, b);\r\n function __() { this.constructor = d; }\r\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n };\r\n\r\n __assign = Object.assign || function (t) {\r\n for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n s = arguments[i];\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n }\r\n return t;\r\n };\r\n\r\n __rest = function (s, e) {\r\n var t = {};\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n t[p] = s[p];\r\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n t[p[i]] = s[p[i]];\r\n }\r\n return t;\r\n };\r\n\r\n __decorate = function (decorators, target, key, desc) {\r\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n };\r\n\r\n __param = function (paramIndex, decorator) {\r\n return function (target, key) { decorator(target, key, paramIndex); }\r\n };\r\n\r\n __metadata = function (metadataKey, metadataValue) {\r\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n };\r\n\r\n __awaiter = function (thisArg, _arguments, P, generator) {\r\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n return new (P || (P = Promise))(function (resolve, reject) {\r\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n });\r\n };\r\n\r\n __generator = function (thisArg, body) {\r\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n function verb(n) { return function (v) { return step([n, v]); }; }\r\n function step(op) {\r\n if (f) throw new TypeError(\"Generator is already executing.\");\r\n while (_) try {\r\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n if (y = 0, t) op = [op[0] & 2, t.value];\r\n switch (op[0]) {\r\n case 0: case 1: t = op; break;\r\n case 4: _.label++; return { value: op[1], done: false };\r\n case 5: _.label++; y = op[1]; op = [0]; continue;\r\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n default:\r\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n if (t[2]) _.ops.pop();\r\n _.trys.pop(); continue;\r\n }\r\n op = body.call(thisArg, _);\r\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n }\r\n };\r\n\r\n __createBinding = function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n o[k2] = m[k];\r\n };\r\n\r\n __exportStar = function (m, exports) {\r\n for (var p in m) if (p !== \"default\" && !exports.hasOwnProperty(p)) exports[p] = m[p];\r\n };\r\n\r\n __values = function (o) {\r\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n if (m) return m.call(o);\r\n if (o && typeof o.length === \"number\") return {\r\n next: function () {\r\n if (o && i >= o.length) o = void 0;\r\n return { value: o && o[i++], done: !o };\r\n }\r\n };\r\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n };\r\n\r\n __read = function (o, n) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n if (!m) return o;\r\n var i = m.call(o), r, ar = [], e;\r\n try {\r\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n }\r\n catch (error) { e = { error: error }; }\r\n finally {\r\n try {\r\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n }\r\n finally { if (e) throw e.error; }\r\n }\r\n return ar;\r\n };\r\n\r\n __spread = function () {\r\n for (var ar = [], i = 0; i < arguments.length; i++)\r\n ar = ar.concat(__read(arguments[i]));\r\n return ar;\r\n };\r\n\r\n __spreadArrays = function () {\r\n for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n r[k] = a[j];\r\n return r;\r\n };\r\n\r\n __await = function (v) {\r\n return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n };\r\n\r\n __asyncGenerator = function (thisArg, _arguments, generator) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n function fulfill(value) { resume(\"next\", value); }\r\n function reject(value) { resume(\"throw\", value); }\r\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n };\r\n\r\n __asyncDelegator = function (o) {\r\n var i, p;\r\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n };\r\n\r\n __asyncValues = function (o) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var m = o[Symbol.asyncIterator], i;\r\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n };\r\n\r\n __makeTemplateObject = function (cooked, raw) {\r\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n return cooked;\r\n };\r\n\r\n __importStar = function (mod) {\r\n if (mod && mod.__esModule) return mod;\r\n var result = {};\r\n if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\r\n result[\"default\"] = mod;\r\n return result;\r\n };\r\n\r\n __importDefault = function (mod) {\r\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\r\n };\r\n\r\n __classPrivateFieldGet = function (receiver, privateMap) {\r\n if (!privateMap.has(receiver)) {\r\n throw new TypeError(\"attempted to get private field on non-instance\");\r\n }\r\n return privateMap.get(receiver);\r\n };\r\n\r\n __classPrivateFieldSet = function (receiver, privateMap, value) {\r\n if (!privateMap.has(receiver)) {\r\n throw new TypeError(\"attempted to set private field on non-instance\");\r\n }\r\n privateMap.set(receiver, value);\r\n return value;\r\n };\r\n\r\n exporter(\"__extends\", __extends);\r\n exporter(\"__assign\", __assign);\r\n exporter(\"__rest\", __rest);\r\n exporter(\"__decorate\", __decorate);\r\n exporter(\"__param\", __param);\r\n exporter(\"__metadata\", __metadata);\r\n exporter(\"__awaiter\", __awaiter);\r\n exporter(\"__generator\", __generator);\r\n exporter(\"__exportStar\", __exportStar);\r\n exporter(\"__createBinding\", __createBinding);\r\n exporter(\"__values\", __values);\r\n exporter(\"__read\", __read);\r\n exporter(\"__spread\", __spread);\r\n exporter(\"__spreadArrays\", __spreadArrays);\r\n exporter(\"__await\", __await);\r\n exporter(\"__asyncGenerator\", __asyncGenerator);\r\n exporter(\"__asyncDelegator\", __asyncDelegator);\r\n exporter(\"__asyncValues\", __asyncValues);\r\n exporter(\"__makeTemplateObject\", __makeTemplateObject);\r\n exporter(\"__importStar\", __importStar);\r\n exporter(\"__importDefault\", __importDefault);\r\n exporter(\"__classPrivateFieldGet\", __classPrivateFieldGet);\r\n exporter(\"__classPrivateFieldSet\", __classPrivateFieldSet);\r\n});\r\n", "/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global global, define, System, Reflect, Promise */\r\nvar __extends;\r\nvar __assign;\r\nvar __rest;\r\nvar __decorate;\r\nvar __param;\r\nvar __metadata;\r\nvar __awaiter;\r\nvar __generator;\r\nvar __exportStar;\r\nvar __values;\r\nvar __read;\r\nvar __spread;\r\nvar __spreadArrays;\r\nvar __spreadArray;\r\nvar __await;\r\nvar __asyncGenerator;\r\nvar __asyncDelegator;\r\nvar __asyncValues;\r\nvar __makeTemplateObject;\r\nvar __importStar;\r\nvar __importDefault;\r\nvar __classPrivateFieldGet;\r\nvar __classPrivateFieldSet;\r\nvar __createBinding;\r\n(function (factory) {\r\n var root = typeof global === \"object\" ? global : typeof self === \"object\" ? self : typeof this === \"object\" ? this : {};\r\n if (typeof define === \"function\" && define.amd) {\r\n define(\"tslib\", [\"exports\"], function (exports) { factory(createExporter(root, createExporter(exports))); });\r\n }\r\n else if (typeof module === \"object\" && typeof module.exports === \"object\") {\r\n factory(createExporter(root, createExporter(module.exports)));\r\n }\r\n else {\r\n factory(createExporter(root));\r\n }\r\n function createExporter(exports, previous) {\r\n if (exports !== root) {\r\n if (typeof Object.create === \"function\") {\r\n Object.defineProperty(exports, \"__esModule\", { value: true });\r\n }\r\n else {\r\n exports.__esModule = true;\r\n }\r\n }\r\n return function (id, v) { return exports[id] = previous ? previous(id, v) : v; };\r\n }\r\n})\r\n(function (exporter) {\r\n var extendStatics = Object.setPrototypeOf ||\r\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n\r\n __extends = function (d, b) {\r\n if (typeof b !== \"function\" && b !== null)\r\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n extendStatics(d, b);\r\n function __() { this.constructor = d; }\r\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n };\r\n\r\n __assign = Object.assign || function (t) {\r\n for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n s = arguments[i];\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n }\r\n return t;\r\n };\r\n\r\n __rest = function (s, e) {\r\n var t = {};\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n t[p] = s[p];\r\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n t[p[i]] = s[p[i]];\r\n }\r\n return t;\r\n };\r\n\r\n __decorate = function (decorators, target, key, desc) {\r\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n };\r\n\r\n __param = function (paramIndex, decorator) {\r\n return function (target, key) { decorator(target, key, paramIndex); }\r\n };\r\n\r\n __metadata = function (metadataKey, metadataValue) {\r\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n };\r\n\r\n __awaiter = function (thisArg, _arguments, P, generator) {\r\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n return new (P || (P = Promise))(function (resolve, reject) {\r\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n });\r\n };\r\n\r\n __generator = function (thisArg, body) {\r\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n function verb(n) { return function (v) { return step([n, v]); }; }\r\n function step(op) {\r\n if (f) throw new TypeError(\"Generator is already executing.\");\r\n while (_) try {\r\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n if (y = 0, t) op = [op[0] & 2, t.value];\r\n switch (op[0]) {\r\n case 0: case 1: t = op; break;\r\n case 4: _.label++; return { value: op[1], done: false };\r\n case 5: _.label++; y = op[1]; op = [0]; continue;\r\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n default:\r\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n if (t[2]) _.ops.pop();\r\n _.trys.pop(); continue;\r\n }\r\n op = body.call(thisArg, _);\r\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n }\r\n };\r\n\r\n __exportStar = function(m, o) {\r\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n };\r\n\r\n __createBinding = Object.create ? (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\r\n }) : (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n o[k2] = m[k];\r\n });\r\n\r\n __values = function (o) {\r\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n if (m) return m.call(o);\r\n if (o && typeof o.length === \"number\") return {\r\n next: function () {\r\n if (o && i >= o.length) o = void 0;\r\n return { value: o && o[i++], done: !o };\r\n }\r\n };\r\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n };\r\n\r\n __read = function (o, n) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n if (!m) return o;\r\n var i = m.call(o), r, ar = [], e;\r\n try {\r\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n }\r\n catch (error) { e = { error: error }; }\r\n finally {\r\n try {\r\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n }\r\n finally { if (e) throw e.error; }\r\n }\r\n return ar;\r\n };\r\n\r\n /** @deprecated */\r\n __spread = function () {\r\n for (var ar = [], i = 0; i < arguments.length; i++)\r\n ar = ar.concat(__read(arguments[i]));\r\n return ar;\r\n };\r\n\r\n /** @deprecated */\r\n __spreadArrays = function () {\r\n for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n r[k] = a[j];\r\n return r;\r\n };\r\n\r\n __spreadArray = function (to, from) {\r\n for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)\r\n to[j] = from[i];\r\n return to;\r\n };\r\n\r\n __await = function (v) {\r\n return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n };\r\n\r\n __asyncGenerator = function (thisArg, _arguments, generator) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n function fulfill(value) { resume(\"next\", value); }\r\n function reject(value) { resume(\"throw\", value); }\r\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n };\r\n\r\n __asyncDelegator = function (o) {\r\n var i, p;\r\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n };\r\n\r\n __asyncValues = function (o) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var m = o[Symbol.asyncIterator], i;\r\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n };\r\n\r\n __makeTemplateObject = function (cooked, raw) {\r\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n return cooked;\r\n };\r\n\r\n var __setModuleDefault = Object.create ? (function(o, v) {\r\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n }) : function(o, v) {\r\n o[\"default\"] = v;\r\n };\r\n\r\n __importStar = function (mod) {\r\n if (mod && mod.__esModule) return mod;\r\n var result = {};\r\n if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n __setModuleDefault(result, mod);\r\n return result;\r\n };\r\n\r\n __importDefault = function (mod) {\r\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\r\n };\r\n\r\n __classPrivateFieldGet = function (receiver, state, kind, f) {\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n };\r\n\r\n __classPrivateFieldSet = function (receiver, state, value, kind, f) {\r\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n };\r\n\r\n exporter(\"__extends\", __extends);\r\n exporter(\"__assign\", __assign);\r\n exporter(\"__rest\", __rest);\r\n exporter(\"__decorate\", __decorate);\r\n exporter(\"__param\", __param);\r\n exporter(\"__metadata\", __metadata);\r\n exporter(\"__awaiter\", __awaiter);\r\n exporter(\"__generator\", __generator);\r\n exporter(\"__exportStar\", __exportStar);\r\n exporter(\"__createBinding\", __createBinding);\r\n exporter(\"__values\", __values);\r\n exporter(\"__read\", __read);\r\n exporter(\"__spread\", __spread);\r\n exporter(\"__spreadArrays\", __spreadArrays);\r\n exporter(\"__spreadArray\", __spreadArray);\r\n exporter(\"__await\", __await);\r\n exporter(\"__asyncGenerator\", __asyncGenerator);\r\n exporter(\"__asyncDelegator\", __asyncDelegator);\r\n exporter(\"__asyncValues\", __asyncValues);\r\n exporter(\"__makeTemplateObject\", __makeTemplateObject);\r\n exporter(\"__importStar\", __importStar);\r\n exporter(\"__importDefault\", __importDefault);\r\n exporter(\"__classPrivateFieldGet\", __classPrivateFieldGet);\r\n exporter(\"__classPrivateFieldSet\", __classPrivateFieldSet);\r\n});\r\n", "'use strict';\n\nmodule.exports = function (data, opts) {\n if (!opts) opts = {};\n if (typeof opts === 'function') opts = { cmp: opts };\n var cycles = (typeof opts.cycles === 'boolean') ? opts.cycles : false;\n\n var cmp = opts.cmp && (function (f) {\n return function (node) {\n return function (a, b) {\n var aobj = { key: a, value: node[a] };\n var bobj = { key: b, value: node[b] };\n return f(aobj, bobj);\n };\n };\n })(opts.cmp);\n\n var seen = [];\n return (function stringify (node) {\n if (node && node.toJSON && typeof node.toJSON === 'function') {\n node = node.toJSON();\n }\n\n if (node === undefined) return;\n if (typeof node == 'number') return isFinite(node) ? '' + node : 'null';\n if (typeof node !== 'object') return JSON.stringify(node);\n\n var i, out;\n if (Array.isArray(node)) {\n out = '[';\n for (i = 0; i < node.length; i++) {\n if (i) out += ',';\n out += stringify(node[i]) || 'null';\n }\n return out + ']';\n }\n\n if (node === null) return 'null';\n\n if (seen.indexOf(node) !== -1) {\n if (cycles) return JSON.stringify('__cycle__');\n throw new TypeError('Converting circular structure to JSON');\n }\n\n var seenIndex = seen.push(node) - 1;\n var keys = Object.keys(node).sort(cmp && cmp(node));\n out = '';\n for (i = 0; i < keys.length; i++) {\n var key = keys[i];\n var value = stringify(node[key]);\n\n if (!value) continue;\n if (out) out += ',';\n out += JSON.stringify(key) + ':' + value;\n }\n seen.splice(seenIndex, 1);\n return '{' + out + '}';\n })(data);\n};\n", "\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.Observable = void 0;\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\n// === Symbol Support ===\nvar hasSymbols = function () {\n return typeof Symbol === 'function';\n};\n\nvar hasSymbol = function (name) {\n return hasSymbols() && Boolean(Symbol[name]);\n};\n\nvar getSymbol = function (name) {\n return hasSymbol(name) ? Symbol[name] : '@@' + name;\n};\n\nif (hasSymbols() && !hasSymbol('observable')) {\n Symbol.observable = Symbol('observable');\n}\n\nvar SymbolIterator = getSymbol('iterator');\nvar SymbolObservable = getSymbol('observable');\nvar SymbolSpecies = getSymbol('species'); // === Abstract Operations ===\n\nfunction getMethod(obj, key) {\n var value = obj[key];\n if (value == null) return undefined;\n if (typeof value !== 'function') throw new TypeError(value + ' is not a function');\n return value;\n}\n\nfunction getSpecies(obj) {\n var ctor = obj.constructor;\n\n if (ctor !== undefined) {\n ctor = ctor[SymbolSpecies];\n\n if (ctor === null) {\n ctor = undefined;\n }\n }\n\n return ctor !== undefined ? ctor : Observable;\n}\n\nfunction isObservable(x) {\n return x instanceof Observable; // SPEC: Brand check\n}\n\nfunction hostReportError(e) {\n if (hostReportError.log) {\n hostReportError.log(e);\n } else {\n setTimeout(function () {\n throw e;\n });\n }\n}\n\nfunction enqueue(fn) {\n Promise.resolve().then(function () {\n try {\n fn();\n } catch (e) {\n hostReportError(e);\n }\n });\n}\n\nfunction cleanupSubscription(subscription) {\n var cleanup = subscription._cleanup;\n if (cleanup === undefined) return;\n subscription._cleanup = undefined;\n\n if (!cleanup) {\n return;\n }\n\n try {\n if (typeof cleanup === 'function') {\n cleanup();\n } else {\n var unsubscribe = getMethod(cleanup, 'unsubscribe');\n\n if (unsubscribe) {\n unsubscribe.call(cleanup);\n }\n }\n } catch (e) {\n hostReportError(e);\n }\n}\n\nfunction closeSubscription(subscription) {\n subscription._observer = undefined;\n subscription._queue = undefined;\n subscription._state = 'closed';\n}\n\nfunction flushSubscription(subscription) {\n var queue = subscription._queue;\n\n if (!queue) {\n return;\n }\n\n subscription._queue = undefined;\n subscription._state = 'ready';\n\n for (var i = 0; i < queue.length; ++i) {\n notifySubscription(subscription, queue[i].type, queue[i].value);\n if (subscription._state === 'closed') break;\n }\n}\n\nfunction notifySubscription(subscription, type, value) {\n subscription._state = 'running';\n var observer = subscription._observer;\n\n try {\n var m = getMethod(observer, type);\n\n switch (type) {\n case 'next':\n if (m) m.call(observer, value);\n break;\n\n case 'error':\n closeSubscription(subscription);\n if (m) m.call(observer, value);else throw value;\n break;\n\n case 'complete':\n closeSubscription(subscription);\n if (m) m.call(observer);\n break;\n }\n } catch (e) {\n hostReportError(e);\n }\n\n if (subscription._state === 'closed') cleanupSubscription(subscription);else if (subscription._state === 'running') subscription._state = 'ready';\n}\n\nfunction onNotify(subscription, type, value) {\n if (subscription._state === 'closed') return;\n\n if (subscription._state === 'buffering') {\n subscription._queue.push({\n type: type,\n value: value\n });\n\n return;\n }\n\n if (subscription._state !== 'ready') {\n subscription._state = 'buffering';\n subscription._queue = [{\n type: type,\n value: value\n }];\n enqueue(function () {\n return flushSubscription(subscription);\n });\n return;\n }\n\n notifySubscription(subscription, type, value);\n}\n\nvar Subscription =\n/*#__PURE__*/\nfunction () {\n function Subscription(observer, subscriber) {\n _classCallCheck(this, Subscription);\n\n // ASSERT: observer is an object\n // ASSERT: subscriber is callable\n this._cleanup = undefined;\n this._observer = observer;\n this._queue = undefined;\n this._state = 'initializing';\n var subscriptionObserver = new SubscriptionObserver(this);\n\n try {\n this._cleanup = subscriber.call(undefined, subscriptionObserver);\n } catch (e) {\n subscriptionObserver.error(e);\n }\n\n if (this._state === 'initializing') this._state = 'ready';\n }\n\n _createClass(Subscription, [{\n key: \"unsubscribe\",\n value: function unsubscribe() {\n if (this._state !== 'closed') {\n closeSubscription(this);\n cleanupSubscription(this);\n }\n }\n }, {\n key: \"closed\",\n get: function () {\n return this._state === 'closed';\n }\n }]);\n\n return Subscription;\n}();\n\nvar SubscriptionObserver =\n/*#__PURE__*/\nfunction () {\n function SubscriptionObserver(subscription) {\n _classCallCheck(this, SubscriptionObserver);\n\n this._subscription = subscription;\n }\n\n _createClass(SubscriptionObserver, [{\n key: \"next\",\n value: function next(value) {\n onNotify(this._subscription, 'next', value);\n }\n }, {\n key: \"error\",\n value: function error(value) {\n onNotify(this._subscription, 'error', value);\n }\n }, {\n key: \"complete\",\n value: function complete() {\n onNotify(this._subscription, 'complete');\n }\n }, {\n key: \"closed\",\n get: function () {\n return this._subscription._state === 'closed';\n }\n }]);\n\n return SubscriptionObserver;\n}();\n\nvar Observable =\n/*#__PURE__*/\nfunction () {\n function Observable(subscriber) {\n _classCallCheck(this, Observable);\n\n if (!(this instanceof Observable)) throw new TypeError('Observable cannot be called as a function');\n if (typeof subscriber !== 'function') throw new TypeError('Observable initializer must be a function');\n this._subscriber = subscriber;\n }\n\n _createClass(Observable, [{\n key: \"subscribe\",\n value: function subscribe(observer) {\n if (typeof observer !== 'object' || observer === null) {\n observer = {\n next: observer,\n error: arguments[1],\n complete: arguments[2]\n };\n }\n\n return new Subscription(observer, this._subscriber);\n }\n }, {\n key: \"forEach\",\n value: function forEach(fn) {\n var _this = this;\n\n return new Promise(function (resolve, reject) {\n if (typeof fn !== 'function') {\n reject(new TypeError(fn + ' is not a function'));\n return;\n }\n\n function done() {\n subscription.unsubscribe();\n resolve();\n }\n\n var subscription = _this.subscribe({\n next: function (value) {\n try {\n fn(value, done);\n } catch (e) {\n reject(e);\n subscription.unsubscribe();\n }\n },\n error: reject,\n complete: resolve\n });\n });\n }\n }, {\n key: \"map\",\n value: function map(fn) {\n var _this2 = this;\n\n if (typeof fn !== 'function') throw new TypeError(fn + ' is not a function');\n var C = getSpecies(this);\n return new C(function (observer) {\n return _this2.subscribe({\n next: function (value) {\n try {\n value = fn(value);\n } catch (e) {\n return observer.error(e);\n }\n\n observer.next(value);\n },\n error: function (e) {\n observer.error(e);\n },\n complete: function () {\n observer.complete();\n }\n });\n });\n }\n }, {\n key: \"filter\",\n value: function filter(fn) {\n var _this3 = this;\n\n if (typeof fn !== 'function') throw new TypeError(fn + ' is not a function');\n var C = getSpecies(this);\n return new C(function (observer) {\n return _this3.subscribe({\n next: function (value) {\n try {\n if (!fn(value)) return;\n } catch (e) {\n return observer.error(e);\n }\n\n observer.next(value);\n },\n error: function (e) {\n observer.error(e);\n },\n complete: function () {\n observer.complete();\n }\n });\n });\n }\n }, {\n key: \"reduce\",\n value: function reduce(fn) {\n var _this4 = this;\n\n if (typeof fn !== 'function') throw new TypeError(fn + ' is not a function');\n var C = getSpecies(this);\n var hasSeed = arguments.length > 1;\n var hasValue = false;\n var seed = arguments[1];\n var acc = seed;\n return new C(function (observer) {\n return _this4.subscribe({\n next: function (value) {\n var first = !hasValue;\n hasValue = true;\n\n if (!first || hasSeed) {\n try {\n acc = fn(acc, value);\n } catch (e) {\n return observer.error(e);\n }\n } else {\n acc = value;\n }\n },\n error: function (e) {\n observer.error(e);\n },\n complete: function () {\n if (!hasValue && !hasSeed) return observer.error(new TypeError('Cannot reduce an empty sequence'));\n observer.next(acc);\n observer.complete();\n }\n });\n });\n }\n }, {\n key: \"concat\",\n value: function concat() {\n var _this5 = this;\n\n for (var _len = arguments.length, sources = new Array(_len), _key = 0; _key < _len; _key++) {\n sources[_key] = arguments[_key];\n }\n\n var C = getSpecies(this);\n return new C(function (observer) {\n var subscription;\n var index = 0;\n\n function startNext(next) {\n subscription = next.subscribe({\n next: function (v) {\n observer.next(v);\n },\n error: function (e) {\n observer.error(e);\n },\n complete: function () {\n if (index === sources.length) {\n subscription = undefined;\n observer.complete();\n } else {\n startNext(C.from(sources[index++]));\n }\n }\n });\n }\n\n startNext(_this5);\n return function () {\n if (subscription) {\n subscription.unsubscribe();\n subscription = undefined;\n }\n };\n });\n }\n }, {\n key: \"flatMap\",\n value: function flatMap(fn) {\n var _this6 = this;\n\n if (typeof fn !== 'function') throw new TypeError(fn + ' is not a function');\n var C = getSpecies(this);\n return new C(function (observer) {\n var subscriptions = [];\n\n var outer = _this6.subscribe({\n next: function (value) {\n if (fn) {\n try {\n value = fn(value);\n } catch (e) {\n return observer.error(e);\n }\n }\n\n var inner = C.from(value).subscribe({\n next: function (value) {\n observer.next(value);\n },\n error: function (e) {\n observer.error(e);\n },\n complete: function () {\n var i = subscriptions.indexOf(inner);\n if (i >= 0) subscriptions.splice(i, 1);\n completeIfDone();\n }\n });\n subscriptions.push(inner);\n },\n error: function (e) {\n observer.error(e);\n },\n complete: function () {\n completeIfDone();\n }\n });\n\n function completeIfDone() {\n if (outer.closed && subscriptions.length === 0) observer.complete();\n }\n\n return function () {\n subscriptions.forEach(function (s) {\n return s.unsubscribe();\n });\n outer.unsubscribe();\n };\n });\n }\n }, {\n key: SymbolObservable,\n value: function () {\n return this;\n }\n }], [{\n key: \"from\",\n value: function from(x) {\n var C = typeof this === 'function' ? this : Observable;\n if (x == null) throw new TypeError(x + ' is not an object');\n var method = getMethod(x, SymbolObservable);\n\n if (method) {\n var observable = method.call(x);\n if (Object(observable) !== observable) throw new TypeError(observable + ' is not an object');\n if (isObservable(observable) && observable.constructor === C) return observable;\n return new C(function (observer) {\n return observable.subscribe(observer);\n });\n }\n\n if (hasSymbol('iterator')) {\n method = getMethod(x, SymbolIterator);\n\n if (method) {\n return new C(function (observer) {\n enqueue(function () {\n if (observer.closed) return;\n var _iteratorNormalCompletion = true;\n var _didIteratorError = false;\n var _iteratorError = undefined;\n\n try {\n for (var _iterator = method.call(x)[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n var _item = _step.value;\n observer.next(_item);\n if (observer.closed) return;\n }\n } catch (err) {\n _didIteratorError = true;\n _iteratorError = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion && _iterator.return != null) {\n _iterator.return();\n }\n } finally {\n if (_didIteratorError) {\n throw _iteratorError;\n }\n }\n }\n\n observer.complete();\n });\n });\n }\n }\n\n if (Array.isArray(x)) {\n return new C(function (observer) {\n enqueue(function () {\n if (observer.closed) return;\n\n for (var i = 0; i < x.length; ++i) {\n observer.next(x[i]);\n if (observer.closed) return;\n }\n\n observer.complete();\n });\n });\n }\n\n throw new TypeError(x + ' is not observable');\n }\n }, {\n key: \"of\",\n value: function of() {\n for (var _len2 = arguments.length, items = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n items[_key2] = arguments[_key2];\n }\n\n var C = typeof this === 'function' ? this : Observable;\n return new C(function (observer) {\n enqueue(function () {\n if (observer.closed) return;\n\n for (var i = 0; i < items.length; ++i) {\n observer.next(items[i]);\n if (observer.closed) return;\n }\n\n observer.complete();\n });\n });\n }\n }, {\n key: SymbolSpecies,\n get: function () {\n return this;\n }\n }]);\n\n return Observable;\n}();\n\nexports.Observable = Observable;\n\nif (hasSymbols()) {\n Object.defineProperty(Observable, Symbol('extensions'), {\n value: {\n symbol: SymbolObservable,\n hostReportError: hostReportError\n },\n configurable: true\n });\n}", "module.exports = require('./lib/Observable.js').Observable;\n", "/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global global, define, System, Reflect, Promise */\r\nvar __extends;\r\nvar __assign;\r\nvar __rest;\r\nvar __decorate;\r\nvar __param;\r\nvar __metadata;\r\nvar __awaiter;\r\nvar __generator;\r\nvar __exportStar;\r\nvar __values;\r\nvar __read;\r\nvar __spread;\r\nvar __spreadArrays;\r\nvar __spreadArray;\r\nvar __await;\r\nvar __asyncGenerator;\r\nvar __asyncDelegator;\r\nvar __asyncValues;\r\nvar __makeTemplateObject;\r\nvar __importStar;\r\nvar __importDefault;\r\nvar __classPrivateFieldGet;\r\nvar __classPrivateFieldSet;\r\nvar __createBinding;\r\n(function (factory) {\r\n var root = typeof global === \"object\" ? global : typeof self === \"object\" ? self : typeof this === \"object\" ? this : {};\r\n if (typeof define === \"function\" && define.amd) {\r\n define(\"tslib\", [\"exports\"], function (exports) { factory(createExporter(root, createExporter(exports))); });\r\n }\r\n else if (typeof module === \"object\" && typeof module.exports === \"object\") {\r\n factory(createExporter(root, createExporter(module.exports)));\r\n }\r\n else {\r\n factory(createExporter(root));\r\n }\r\n function createExporter(exports, previous) {\r\n if (exports !== root) {\r\n if (typeof Object.create === \"function\") {\r\n Object.defineProperty(exports, \"__esModule\", { value: true });\r\n }\r\n else {\r\n exports.__esModule = true;\r\n }\r\n }\r\n return function (id, v) { return exports[id] = previous ? previous(id, v) : v; };\r\n }\r\n})\r\n(function (exporter) {\r\n var extendStatics = Object.setPrototypeOf ||\r\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n\r\n __extends = function (d, b) {\r\n if (typeof b !== \"function\" && b !== null)\r\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n extendStatics(d, b);\r\n function __() { this.constructor = d; }\r\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n };\r\n\r\n __assign = Object.assign || function (t) {\r\n for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n s = arguments[i];\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n }\r\n return t;\r\n };\r\n\r\n __rest = function (s, e) {\r\n var t = {};\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n t[p] = s[p];\r\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n t[p[i]] = s[p[i]];\r\n }\r\n return t;\r\n };\r\n\r\n __decorate = function (decorators, target, key, desc) {\r\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n };\r\n\r\n __param = function (paramIndex, decorator) {\r\n return function (target, key) { decorator(target, key, paramIndex); }\r\n };\r\n\r\n __metadata = function (metadataKey, metadataValue) {\r\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n };\r\n\r\n __awaiter = function (thisArg, _arguments, P, generator) {\r\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n return new (P || (P = Promise))(function (resolve, reject) {\r\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n });\r\n };\r\n\r\n __generator = function (thisArg, body) {\r\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n function verb(n) { return function (v) { return step([n, v]); }; }\r\n function step(op) {\r\n if (f) throw new TypeError(\"Generator is already executing.\");\r\n while (_) try {\r\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n if (y = 0, t) op = [op[0] & 2, t.value];\r\n switch (op[0]) {\r\n case 0: case 1: t = op; break;\r\n case 4: _.label++; return { value: op[1], done: false };\r\n case 5: _.label++; y = op[1]; op = [0]; continue;\r\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n default:\r\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n if (t[2]) _.ops.pop();\r\n _.trys.pop(); continue;\r\n }\r\n op = body.call(thisArg, _);\r\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n }\r\n };\r\n\r\n __exportStar = function(m, o) {\r\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n };\r\n\r\n __createBinding = Object.create ? (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\r\n }) : (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n o[k2] = m[k];\r\n });\r\n\r\n __values = function (o) {\r\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n if (m) return m.call(o);\r\n if (o && typeof o.length === \"number\") return {\r\n next: function () {\r\n if (o && i >= o.length) o = void 0;\r\n return { value: o && o[i++], done: !o };\r\n }\r\n };\r\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n };\r\n\r\n __read = function (o, n) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n if (!m) return o;\r\n var i = m.call(o), r, ar = [], e;\r\n try {\r\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n }\r\n catch (error) { e = { error: error }; }\r\n finally {\r\n try {\r\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n }\r\n finally { if (e) throw e.error; }\r\n }\r\n return ar;\r\n };\r\n\r\n /** @deprecated */\r\n __spread = function () {\r\n for (var ar = [], i = 0; i < arguments.length; i++)\r\n ar = ar.concat(__read(arguments[i]));\r\n return ar;\r\n };\r\n\r\n /** @deprecated */\r\n __spreadArrays = function () {\r\n for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n r[k] = a[j];\r\n return r;\r\n };\r\n\r\n __spreadArray = function (to, from) {\r\n for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)\r\n to[j] = from[i];\r\n return to;\r\n };\r\n\r\n __await = function (v) {\r\n return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n };\r\n\r\n __asyncGenerator = function (thisArg, _arguments, generator) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n function fulfill(value) { resume(\"next\", value); }\r\n function reject(value) { resume(\"throw\", value); }\r\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n };\r\n\r\n __asyncDelegator = function (o) {\r\n var i, p;\r\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n };\r\n\r\n __asyncValues = function (o) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var m = o[Symbol.asyncIterator], i;\r\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n };\r\n\r\n __makeTemplateObject = function (cooked, raw) {\r\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n return cooked;\r\n };\r\n\r\n var __setModuleDefault = Object.create ? (function(o, v) {\r\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n }) : function(o, v) {\r\n o[\"default\"] = v;\r\n };\r\n\r\n __importStar = function (mod) {\r\n if (mod && mod.__esModule) return mod;\r\n var result = {};\r\n if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n __setModuleDefault(result, mod);\r\n return result;\r\n };\r\n\r\n __importDefault = function (mod) {\r\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\r\n };\r\n\r\n __classPrivateFieldGet = function (receiver, state, kind, f) {\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n };\r\n\r\n __classPrivateFieldSet = function (receiver, state, value, kind, f) {\r\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n };\r\n\r\n exporter(\"__extends\", __extends);\r\n exporter(\"__assign\", __assign);\r\n exporter(\"__rest\", __rest);\r\n exporter(\"__decorate\", __decorate);\r\n exporter(\"__param\", __param);\r\n exporter(\"__metadata\", __metadata);\r\n exporter(\"__awaiter\", __awaiter);\r\n exporter(\"__generator\", __generator);\r\n exporter(\"__exportStar\", __exportStar);\r\n exporter(\"__createBinding\", __createBinding);\r\n exporter(\"__values\", __values);\r\n exporter(\"__read\", __read);\r\n exporter(\"__spread\", __spread);\r\n exporter(\"__spreadArrays\", __spreadArrays);\r\n exporter(\"__spreadArray\", __spreadArray);\r\n exporter(\"__await\", __await);\r\n exporter(\"__asyncGenerator\", __asyncGenerator);\r\n exporter(\"__asyncDelegator\", __asyncDelegator);\r\n exporter(\"__asyncValues\", __asyncValues);\r\n exporter(\"__makeTemplateObject\", __makeTemplateObject);\r\n exporter(\"__importStar\", __importStar);\r\n exporter(\"__importDefault\", __importDefault);\r\n exporter(\"__classPrivateFieldGet\", __classPrivateFieldGet);\r\n exporter(\"__classPrivateFieldSet\", __classPrivateFieldSet);\r\n});\r\n", "import tslib from '../tslib.js';\r\nconst {\r\n __extends,\r\n __assign,\r\n __rest,\r\n __decorate,\r\n __param,\r\n __metadata,\r\n __awaiter,\r\n __generator,\r\n __exportStar,\r\n __createBinding,\r\n __values,\r\n __read,\r\n __spread,\r\n __spreadArrays,\r\n __await,\r\n __asyncGenerator,\r\n __asyncDelegator,\r\n __asyncValues,\r\n __makeTemplateObject,\r\n __importStar,\r\n __importDefault,\r\n __classPrivateFieldGet,\r\n __classPrivateFieldSet,\r\n} = tslib;\r\nexport {\r\n __extends,\r\n __assign,\r\n __rest,\r\n __decorate,\r\n __param,\r\n __metadata,\r\n __awaiter,\r\n __generator,\r\n __exportStar,\r\n __createBinding,\r\n __values,\r\n __read,\r\n __spread,\r\n __spreadArrays,\r\n __await,\r\n __asyncGenerator,\r\n __asyncDelegator,\r\n __asyncValues,\r\n __makeTemplateObject,\r\n __importStar,\r\n __importDefault,\r\n __classPrivateFieldGet,\r\n __classPrivateFieldSet,\r\n};\r\n", "import tslib from '../tslib.js';\r\nconst {\r\n __extends,\r\n __assign,\r\n __rest,\r\n __decorate,\r\n __param,\r\n __metadata,\r\n __awaiter,\r\n __generator,\r\n __exportStar,\r\n __createBinding,\r\n __values,\r\n __read,\r\n __spread,\r\n __spreadArrays,\r\n __spreadArray,\r\n __await,\r\n __asyncGenerator,\r\n __asyncDelegator,\r\n __asyncValues,\r\n __makeTemplateObject,\r\n __importStar,\r\n __importDefault,\r\n __classPrivateFieldGet,\r\n __classPrivateFieldSet,\r\n} = tslib;\r\nexport {\r\n __extends,\r\n __assign,\r\n __rest,\r\n __decorate,\r\n __param,\r\n __metadata,\r\n __awaiter,\r\n __generator,\r\n __exportStar,\r\n __createBinding,\r\n __values,\r\n __read,\r\n __spread,\r\n __spreadArrays,\r\n __spreadArray,\r\n __await,\r\n __asyncGenerator,\r\n __asyncDelegator,\r\n __asyncValues,\r\n __makeTemplateObject,\r\n __importStar,\r\n __importDefault,\r\n __classPrivateFieldGet,\r\n __classPrivateFieldSet,\r\n};\r\n", "const genericMessage = \"Invariant Violation\";\nconst {\n setPrototypeOf = function (obj: any, proto: any) {\n obj.__proto__ = proto;\n return obj;\n },\n} = Object as any;\n\nexport class InvariantError extends Error {\n framesToPop = 1;\n name = genericMessage;\n constructor(message: string | number = genericMessage) {\n super(\n typeof message === \"number\"\n ? `${genericMessage}: ${message} (see https://github.com/apollographql/invariant-packages)`\n : message\n );\n setPrototypeOf(this, InvariantError.prototype);\n }\n}\n\nexport function invariant(\n condition: any,\n message?: string | number,\n): asserts condition {\n if (!condition) {\n throw new InvariantError(message);\n }\n}\n\nconst verbosityLevels = [\"log\", \"warn\", \"error\", \"silent\"] as const;\ntype VerbosityLevel = (typeof verbosityLevels)[number];\ntype ConsoleMethodName = Exclude<VerbosityLevel, \"silent\">;\nlet verbosityLevel = verbosityLevels.indexOf(\"log\");\n\nfunction wrapConsoleMethod<M extends ConsoleMethodName>(method: M) {\n return function () {\n if (verbosityLevels.indexOf(method) >= verbosityLevel) {\n return console[method].apply(console, arguments as any);\n }\n } as (typeof console)[M];\n}\n\nexport namespace invariant {\n export const log = wrapConsoleMethod(\"log\");\n export const warn = wrapConsoleMethod(\"warn\");\n export const error = wrapConsoleMethod(\"error\");\n}\n\nexport function setVerbosity(level: VerbosityLevel): VerbosityLevel {\n const old = verbosityLevels[verbosityLevel];\n verbosityLevel = Math.max(0, verbosityLevels.indexOf(level));\n return old;\n}\n\n// Code that uses ts-invariant with rollup-plugin-invariant may want to\n// import this process stub to avoid errors evaluating process.env.NODE_ENV.\n// However, because most ESM-to-CJS compilers will rewrite the process import\n// as tsInvariant.process, which prevents proper replacement by minifiers, we\n// also export processStub, so you can import { invariant, processStub } from\n// \"ts-invariant\" and assign processStub to a local variable named process.\nexport const processStub: {\n env: Record<string, any>;\n [key: string]: any;\n} = (\n typeof process === \"object\" &&\n typeof process.env === \"object\"\n) ? process : { env: {} };\n\nexport { processStub as process };\n\nexport default invariant;\n", "function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\n/**\n * Return true if `value` is object-like. A value is object-like if it's not\n * `null` and has a `typeof` result of \"object\".\n */\nexport default function isObjectLike(value) {\n return _typeof(value) == 'object' && value !== null;\n}\n", "// In ES2015 (or a polyfilled) environment, this will be Symbol.iterator\n// istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2317')\nexport var SYMBOL_ITERATOR = typeof Symbol === 'function' && Symbol.iterator != null ? Symbol.iterator : '@@iterator'; // In ES2017 (or a polyfilled) environment, this will be Symbol.asyncIterator\n// istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2317')\n\nexport var SYMBOL_ASYNC_ITERATOR = typeof Symbol === 'function' && Symbol.asyncIterator != null ? Symbol.asyncIterator : '@@asyncIterator'; // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2317')\n\nexport var SYMBOL_TO_STRING_TAG = typeof Symbol === 'function' && Symbol.toStringTag != null ? Symbol.toStringTag : '@@toStringTag';\n", "/**\n * Represents a location in a Source.\n */\n\n/**\n * Takes a Source and a UTF-8 character offset, and returns the corresponding\n * line and column as a SourceLocation.\n */\nexport function getLocation(source, position) {\n var lineRegexp = /\\r\\n|[\\n\\r]/g;\n var line = 1;\n var column = position + 1;\n var match;\n\n while ((match = lineRegexp.exec(source.body)) && match.index < position) {\n line += 1;\n column = position + 1 - (match.index + match[0].length);\n }\n\n return {\n line: line,\n column: column\n };\n}\n", "import { getLocation } from \"./location.mjs\";\n/**\n * Render a helpful description of the location in the GraphQL Source document.\n */\n\nexport function printLocation(location) {\n return printSourceLocation(location.source, getLocation(location.source, location.start));\n}\n/**\n * Render a helpful description of the location in the GraphQL Source document.\n */\n\nexport function printSourceLocation(source, sourceLocation) {\n var firstLineColumnOffset = source.locationOffset.column - 1;\n var body = whitespace(firstLineColumnOffset) + source.body;\n var lineIndex = sourceLocation.line - 1;\n var lineOffset = source.locationOffset.line - 1;\n var lineNum = sourceLocation.line + lineOffset;\n var columnOffset = sourceLocation.line === 1 ? firstLineColumnOffset : 0;\n var columnNum = sourceLocation.column + columnOffset;\n var locationStr = \"\".concat(source.name, \":\").concat(lineNum, \":\").concat(columnNum, \"\\n\");\n var lines = body.split(/\\r\\n|[\\n\\r]/g);\n var locationLine = lines[lineIndex]; // Special case for minified documents\n\n if (locationLine.length > 120) {\n var subLineIndex = Math.floor(columnNum / 80);\n var subLineColumnNum = columnNum % 80;\n var subLines = [];\n\n for (var i = 0; i < locationLine.length; i += 80) {\n subLines.push(locationLine.slice(i, i + 80));\n }\n\n return locationStr + printPrefixedLines([[\"\".concat(lineNum), subLines[0]]].concat(subLines.slice(1, subLineIndex + 1).map(function (subLine) {\n return ['', subLine];\n }), [[' ', whitespace(subLineColumnNum - 1) + '^'], ['', subLines[subLineIndex + 1]]]));\n }\n\n return locationStr + printPrefixedLines([// Lines specified like this: [\"prefix\", \"string\"],\n [\"\".concat(lineNum - 1), lines[lineIndex - 1]], [\"\".concat(lineNum), locationLine], ['', whitespace(columnNum - 1) + '^'], [\"\".concat(lineNum + 1), lines[lineIndex + 1]]]);\n}\n\nfunction printPrefixedLines(lines) {\n var existingLines = lines.filter(function (_ref) {\n var _ = _ref[0],\n line = _ref[1];\n return line !== undefined;\n });\n var padLen = Math.max.apply(Math, existingLines.map(function (_ref2) {\n var prefix = _ref2[0];\n return prefix.length;\n }));\n return existingLines.map(function (_ref3) {\n var prefix = _ref3[0],\n line = _ref3[1];\n return leftPad(padLen, prefix) + (line ? ' | ' + line : ' |');\n }).join('\\n');\n}\n\nfunction whitespace(len) {\n return Array(len + 1).join(' ');\n}\n\nfunction leftPad(len, str) {\n return whitespace(len - str.length) + str;\n}\n", "function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _wrapNativeSuper(Class) { var _cache = typeof Map === \"function\" ? new Map() : undefined; _wrapNativeSuper = function _wrapNativeSuper(Class) { if (Class === null || !_isNativeFunction(Class)) return Class; if (typeof Class !== \"function\") { throw new TypeError(\"Super expression must either be null or a function\"); } if (typeof _cache !== \"undefined\") { if (_cache.has(Class)) return _cache.get(Class); _cache.set(Class, Wrapper); } function Wrapper() { return _construct(Class, arguments, _getPrototypeOf(this).constructor); } Wrapper.prototype = Object.create(Class.prototype, { constructor: { value: Wrapper, enumerable: false, writable: true, configurable: true } }); return _setPrototypeOf(Wrapper, Class); }; return _wrapNativeSuper(Class); }\n\nfunction _construct(Parent, args, Class) { if (_isNativeReflectConstruct()) { _construct = Reflect.construct; } else { _construct = function _construct(Parent, args, Class) { var a = [null]; a.push.apply(a, args); var Constructor = Function.bind.apply(Parent, a); var instance = new Constructor(); if (Class) _setPrototypeOf(instance, Class.prototype); return instance; }; } return _construct.apply(null, arguments); }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\nfunction _isNativeFunction(fn) { return Function.toString.call(fn).indexOf(\"[native code]\") !== -1; }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\n// FIXME:\n// flowlint uninitialized-instance-property:off\nimport isObjectLike from \"../jsutils/isObjectLike.mjs\";\nimport { SYMBOL_TO_STRING_TAG } from \"../polyfills/symbols.mjs\";\nimport { getLocation } from \"../language/location.mjs\";\nimport { printLocation, printSourceLocation } from \"../language/printLocation.mjs\";\n/**\n * A GraphQLError describes an Error found during the parse, validate, or\n * execute phases of performing a GraphQL operation. In addition to a message\n * and stack trace, it also includes information about the locations in a\n * GraphQL document and/or execution result that correspond to the Error.\n */\n\nexport var GraphQLError = /*#__PURE__*/function (_Error) {\n _inherits(GraphQLError, _Error);\n\n var _super = _createSuper(GraphQLError);\n\n /**\n * A message describing the Error for debugging purposes.\n *\n * Enumerable, and appears in the result of JSON.stringify().\n *\n * Note: should be treated as readonly, despite invariant usage.\n */\n\n /**\n * An array of { line, column } locations within the source GraphQL document\n * which correspond to this error.\n *\n * Errors during validation often contain multiple locations, for example to\n * point out two things with the same name. Errors during execution include a\n * single location, the field which produced the error.\n *\n * Enumerable, and appears in the result of JSON.stringify().\n */\n\n /**\n * An array describing the JSON-path into the execution response which\n * corresponds to this error. Only included for errors during execution.\n *\n * Enumerable, and appears in the result of JSON.stringify().\n */\n\n /**\n * An array of GraphQL AST Nodes corresponding to this error.\n */\n\n /**\n * The source GraphQL document for the first location of this error.\n *\n * Note that if this Error represents more than one node, the source may not\n * represent nodes after the first node.\n */\n\n /**\n * An array of character offsets within the source GraphQL document\n * which correspond to this error.\n */\n\n /**\n * The original error thrown from a field resolver during execution.\n */\n\n /**\n * Extension fields to add to the formatted error.\n */\n function GraphQLError(message, nodes, source, positions, path, originalError, extensions) {\n var _locations2, _source2, _positions2, _extensions2;\n\n var _this;\n\n _classCallCheck(this, GraphQLError);\n\n _this = _super.call(this, message); // Compute list of blame nodes.\n\n var _nodes = Array.isArray(nodes) ? nodes.length !== 0 ? nodes : undefined : nodes ? [nodes] : undefined; // Compute locations in the source for the given nodes/positions.\n\n\n var _source = source;\n\n if (!_source && _nodes) {\n var _nodes$0$loc;\n\n _source = (_nodes$0$loc = _nodes[0].loc) === null || _nodes$0$loc === void 0 ? void 0 : _nodes$0$loc.source;\n }\n\n var _positions = positions;\n\n if (!_positions && _nodes) {\n _positions = _nodes.reduce(function (list, node) {\n if (node.loc) {\n list.push(node.loc.start);\n }\n\n return list;\n }, []);\n }\n\n if (_positions && _positions.length === 0) {\n _positions = undefined;\n }\n\n var _locations;\n\n if (positions && source) {\n _locations = positions.map(function (pos) {\n return getLocation(source, pos);\n });\n } else if (_nodes) {\n _locations = _nodes.reduce(function (list, node) {\n if (node.loc) {\n list.push(getLocation(node.loc.source, node.loc.start));\n }\n\n return list;\n }, []);\n }\n\n var _extensions = extensions;\n\n if (_extensions == null && originalError != null) {\n var originalExtensions = originalError.extensions;\n\n if (isObjectLike(originalExtensions)) {\n _extensions = originalExtensions;\n }\n }\n\n Object.defineProperties(_assertThisInitialized(_this), {\n name: {\n value: 'GraphQLError'\n },\n message: {\n value: message,\n // By being enumerable, JSON.stringify will include `message` in the\n // resulting output. This ensures that the simplest possible GraphQL\n // service adheres to the spec.\n enumerable: true,\n writable: true\n },\n locations: {\n // Coercing falsy values to undefined ensures they will not be included\n // in JSON.stringify() when not provided.\n value: (_locations2 = _locations) !== null && _locations2 !== void 0 ? _locations2 : undefined,\n // By being enumerable, JSON.stringify will include `locations` in the\n // resulting output. This ensures that the simplest possible GraphQL\n // service adheres to the spec.\n enumerable: _locations != null\n },\n path: {\n // Coercing falsy values to undefined ensures they will not be included\n // in JSON.stringify() when not provided.\n value: path !== null && path !== void 0 ? path : undefined,\n // By being enumerable, JSON.stringify will include `path` in the\n // resulting output. This ensures that the simplest possible GraphQL\n // service adheres to the spec.\n enumerable: path != null\n },\n nodes: {\n value: _nodes !== null && _nodes !== void 0 ? _nodes : undefined\n },\n source: {\n value: (_source2 = _source) !== null && _source2 !== void 0 ? _source2 : undefined\n },\n positions: {\n value: (_positions2 = _positions) !== null && _positions2 !== void 0 ? _positions2 : undefined\n },\n originalError: {\n value: originalError\n },\n extensions: {\n // Coercing falsy values to undefined ensures they will not be included\n // in JSON.stringify() when not provided.\n value: (_extensions2 = _extensions) !== null && _extensions2 !== void 0 ? _extensions2 : undefined,\n // By being enumerable, JSON.stringify will include `path` in the\n // resulting output. This ensures that the simplest possible GraphQL\n // service adheres to the spec.\n enumerable: _extensions != null\n }\n }); // Include (non-enumerable) stack trace.\n\n if (originalError !== null && originalError !== void 0 && originalError.stack) {\n Object.defineProperty(_assertThisInitialized(_this), 'stack', {\n value: originalError.stack,\n writable: true,\n configurable: true\n });\n return _possibleConstructorReturn(_this);\n } // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2317')\n\n\n if (Error.captureStackTrace) {\n Error.captureStackTrace(_assertThisInitialized(_this), GraphQLError);\n } else {\n Object.defineProperty(_assertThisInitialized(_this), 'stack', {\n value: Error().stack,\n writable: true,\n configurable: true\n });\n }\n\n return _this;\n }\n\n _createClass(GraphQLError, [{\n key: \"toString\",\n value: function toString() {\n return printError(this);\n } // FIXME: workaround to not break chai comparisons, should be remove in v16\n // $FlowFixMe[unsupported-syntax] Flow doesn't support computed properties yet\n\n }, {\n key: SYMBOL_TO_STRING_TAG,\n get: function get() {\n return 'Object';\n }\n }]);\n\n return GraphQLError;\n}( /*#__PURE__*/_wrapNativeSuper(Error));\n/**\n * Prints a GraphQLError to a string, representing useful location information\n * about the error's position in the source.\n */\n\nexport function printError(error) {\n var output = error.message;\n\n if (error.nodes) {\n for (var _i2 = 0, _error$nodes2 = error.nodes; _i2 < _error$nodes2.length; _i2++) {\n var node = _error$nodes2[_i2];\n\n if (node.loc) {\n output += '\\n\\n' + printLocation(node.loc);\n }\n }\n } else if (error.source && error.locations) {\n for (var _i4 = 0, _error$locations2 = error.locations; _i4 < _error$locations2.length; _i4++) {\n var location = _error$locations2[_i4];\n output += '\\n\\n' + printSourceLocation(error.source, location);\n }\n }\n\n return output;\n}\n", "import { GraphQLError } from \"./GraphQLError.mjs\";\n/**\n * Produces a GraphQLError representing a syntax error, containing useful\n * descriptive information about the syntax error's position in the source.\n */\n\nexport function syntaxError(source, position, description) {\n return new GraphQLError(\"Syntax Error: \".concat(description), undefined, source, [position]);\n}\n", "/**\n * The set of allowed kind values for AST nodes.\n */\nexport var Kind = Object.freeze({\n // Name\n NAME: 'Name',\n // Document\n DOCUMENT: 'Document',\n OPERATION_DEFINITION: 'OperationDefinition',\n VARIABLE_DEFINITION: 'VariableDefinition',\n SELECTION_SET: 'SelectionSet',\n FIELD: 'Field',\n ARGUMENT: 'Argument',\n // Fragments\n FRAGMENT_SPREAD: 'FragmentSpread',\n INLINE_FRAGMENT: 'InlineFragment',\n FRAGMENT_DEFINITION: 'FragmentDefinition',\n // Values\n VARIABLE: 'Variable',\n INT: 'IntValue',\n FLOAT: 'FloatValue',\n STRING: 'StringValue',\n BOOLEAN: 'BooleanValue',\n NULL: 'NullValue',\n ENUM: 'EnumValue',\n LIST: 'ListValue',\n OBJECT: 'ObjectValue',\n OBJECT_FIELD: 'ObjectField',\n // Directives\n DIRECTIVE: 'Directive',\n // Types\n NAMED_TYPE: 'NamedType',\n LIST_TYPE: 'ListType',\n NON_NULL_TYPE: 'NonNullType',\n // Type System Definitions\n SCHEMA_DEFINITION: 'SchemaDefinition',\n OPERATION_TYPE_DEFINITION: 'OperationTypeDefinition',\n // Type Definitions\n SCALAR_TYPE_DEFINITION: 'ScalarTypeDefinition',\n OBJECT_TYPE_DEFINITION: 'ObjectTypeDefinition',\n FIELD_DEFINITION: 'FieldDefinition',\n INPUT_VALUE_DEFINITION: 'InputValueDefinition',\n INTERFACE_TYPE_DEFINITION: 'InterfaceTypeDefinition',\n UNION_TYPE_DEFINITION: 'UnionTypeDefinition',\n ENUM_TYPE_DEFINITION: 'EnumTypeDefinition',\n ENUM_VALUE_DEFINITION: 'EnumValueDefinition',\n INPUT_OBJECT_TYPE_DEFINITION: 'InputObjectTypeDefinition',\n // Directive Definitions\n DIRECTIVE_DEFINITION: 'DirectiveDefinition',\n // Type System Extensions\n SCHEMA_EXTENSION: 'SchemaExtension',\n // Type Extensions\n SCALAR_TYPE_EXTENSION: 'ScalarTypeExtension',\n OBJECT_TYPE_EXTENSION: 'ObjectTypeExtension',\n INTERFACE_TYPE_EXTENSION: 'InterfaceTypeExtension',\n UNION_TYPE_EXTENSION: 'UnionTypeExtension',\n ENUM_TYPE_EXTENSION: 'EnumTypeExtension',\n INPUT_OBJECT_TYPE_EXTENSION: 'InputObjectTypeExtension'\n});\n/**\n * The enum type representing the possible kind values of AST nodes.\n */\n", "export default function invariant(condition, message) {\n var booleanCondition = Boolean(condition); // istanbul ignore else (See transformation done in './resources/inlineInvariant.js')\n\n if (!booleanCondition) {\n throw new Error(message != null ? message : 'Unexpected invariant triggered.');\n }\n}\n", "// istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2317')\nvar nodejsCustomInspectSymbol = typeof Symbol === 'function' && typeof Symbol.for === 'function' ? Symbol.for('nodejs.util.inspect.custom') : undefined;\nexport default nodejsCustomInspectSymbol;\n", "import invariant from \"./invariant.mjs\";\nimport nodejsCustomInspectSymbol from \"./nodejsCustomInspectSymbol.mjs\";\n/**\n * The `defineInspect()` function defines `inspect()` prototype method as alias of `toJSON`\n */\n\nexport default function defineInspect(classObject) {\n var fn = classObject.prototype.toJSON;\n typeof fn === 'function' || invariant(0);\n classObject.prototype.inspect = fn; // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2317')\n\n if (nodejsCustomInspectSymbol) {\n classObject.prototype[nodejsCustomInspectSymbol] = fn;\n }\n}\n", "import defineInspect from \"../jsutils/defineInspect.mjs\";\n\n/**\n * Contains a range of UTF-8 character offsets and token references that\n * identify the region of the source from which the AST derived.\n */\nexport var Location = /*#__PURE__*/function () {\n /**\n * The character offset at which this Node begins.\n */\n\n /**\n * The character offset at which this Node ends.\n */\n\n /**\n * The Token at which this Node begins.\n */\n\n /**\n * The Token at which this Node ends.\n */\n\n /**\n * The Source document the AST represents.\n */\n function Location(startToken, endToken, source) {\n this.start = startToken.start;\n this.end = endToken.end;\n this.startToken = startToken;\n this.endToken = endToken;\n this.source = source;\n }\n\n var _proto = Location.prototype;\n\n _proto.toJSON = function toJSON() {\n return {\n start: this.start,\n end: this.end\n };\n };\n\n return Location;\n}(); // Print a simplified form when appearing in `inspect` and `util.inspect`.\n\ndefineInspect(Location);\n/**\n * Represents a range of characters represented by a lexical token\n * within a Source.\n */\n\nexport var Token = /*#__PURE__*/function () {\n /**\n * The kind of Token.\n */\n\n /**\n * The character offset at which this Node begins.\n */\n\n /**\n * The character offset at which this Node ends.\n */\n\n /**\n * The 1-indexed line number on which this Token appears.\n */\n\n /**\n * The 1-indexed column number at which this Token begins.\n */\n\n /**\n * For non-punctuation tokens, represents the interpreted value of the token.\n */\n\n /**\n * Tokens exist as nodes in a double-linked-list amongst all tokens\n * including ignored tokens. <SOF> is always the first node and <EOF>\n * the last.\n */\n function Token(kind, start, end, line, column, prev, value) {\n this.kind = kind;\n this.start = start;\n this.end = end;\n this.line = line;\n this.column = column;\n this.value = value;\n this.prev = prev;\n this.next = null;\n }\n\n var _proto2 = Token.prototype;\n\n _proto2.toJSON = function toJSON() {\n return {\n kind: this.kind,\n value: this.value,\n line: this.line,\n column: this.column\n };\n };\n\n return Token;\n}(); // Print a simplified form when appearing in `inspect` and `util.inspect`.\n\ndefineInspect(Token);\n/**\n * @internal\n */\n\nexport function isNode(maybeNode) {\n return maybeNode != null && typeof maybeNode.kind === 'string';\n}\n/**\n * The list of all possible AST node types.\n */\n", "/**\n * An exported enum describing the different kinds of tokens that the\n * lexer emits.\n */\nexport var TokenKind = Object.freeze({\n SOF: '<SOF>',\n EOF: '<EOF>',\n BANG: '!',\n DOLLAR: '$',\n AMP: '&',\n PAREN_L: '(',\n PAREN_R: ')',\n SPREAD: '...',\n COLON: ':',\n EQUALS: '=',\n AT: '@',\n BRACKET_L: '[',\n BRACKET_R: ']',\n BRACE_L: '{',\n PIPE: '|',\n BRACE_R: '}',\n NAME: 'Name',\n INT: 'Int',\n FLOAT: 'Float',\n STRING: 'String',\n BLOCK_STRING: 'BlockString',\n COMMENT: 'Comment'\n});\n/**\n * The enum type representing the token kinds values.\n */\n", "function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\n/* eslint-disable flowtype/no-weak-types */\nimport nodejsCustomInspectSymbol from \"./nodejsCustomInspectSymbol.mjs\";\nvar MAX_ARRAY_LENGTH = 10;\nvar MAX_RECURSIVE_DEPTH = 2;\n/**\n * Used to print values in error messages.\n */\n\nexport default function inspect(value) {\n return formatValue(value, []);\n}\n\nfunction formatValue(value, seenValues) {\n switch (_typeof(value)) {\n case 'string':\n return JSON.stringify(value);\n\n case 'function':\n return value.name ? \"[function \".concat(value.name, \"]\") : '[function]';\n\n case 'object':\n if (value === null) {\n return 'null';\n }\n\n return formatObjectValue(value, seenValues);\n\n default:\n return String(value);\n }\n}\n\nfunction formatObjectValue(value, previouslySeenValues) {\n if (previouslySeenValues.indexOf(value) !== -1) {\n return '[Circular]';\n }\n\n var seenValues = [].concat(previouslySeenValues, [value]);\n var customInspectFn = getCustomFn(value);\n\n if (customInspectFn !== undefined) {\n var customValue = customInspectFn.call(value); // check for infinite recursion\n\n if (customValue !== value) {\n return typeof customValue === 'string' ? customValue : formatValue(customValue, seenValues);\n }\n } else if (Array.isArray(value)) {\n return formatArray(value, seenValues);\n }\n\n return formatObject(value, seenValues);\n}\n\nfunction formatObject(object, seenValues) {\n var keys = Object.keys(object);\n\n if (keys.length === 0) {\n return '{}';\n }\n\n if (seenValues.length > MAX_RECURSIVE_DEPTH) {\n return '[' + getObjectTag(object) + ']';\n }\n\n var properties = keys.map(function (key) {\n var value = formatValue(object[key], seenValues);\n return key + ': ' + value;\n });\n return '{ ' + properties.join(', ') + ' }';\n}\n\nfunction formatArray(array, seenValues) {\n if (array.length === 0) {\n return '[]';\n }\n\n if (seenValues.length > MAX_RECURSIVE_DEPTH) {\n return '[Array]';\n }\n\n var len = Math.min(MAX_ARRAY_LENGTH, array.length);\n var remaining = array.length - len;\n var items = [];\n\n for (var i = 0; i < len; ++i) {\n items.push(formatValue(array[i], seenValues));\n }\n\n if (remaining === 1) {\n items.push('... 1 more item');\n } else if (remaining > 1) {\n items.push(\"... \".concat(remaining, \" more items\"));\n }\n\n return '[' + items.join(', ') + ']';\n}\n\nfunction getCustomFn(object) {\n var customInspectFn = object[String(nodejsCustomInspectSymbol)];\n\n if (typeof customInspectFn === 'function') {\n return customInspectFn;\n }\n\n if (typeof object.inspect === 'function') {\n return object.inspect;\n }\n}\n\nfunction getObjectTag(object) {\n var tag = Object.prototype.toString.call(object).replace(/^\\[object /, '').replace(/]$/, '');\n\n if (tag === 'Object' && typeof object.constructor === 'function') {\n var name = object.constructor.name;\n\n if (typeof name === 'string' && name !== '') {\n return name;\n }\n }\n\n return tag;\n}\n", "export default function devAssert(condition, message) {\n var booleanCondition = Boolean(condition); // istanbul ignore else (See transformation done in './resources/inlineInvariant.js')\n\n if (!booleanCondition) {\n throw new Error(message);\n }\n}\n", "/**\n * A replacement for instanceof which includes an error warning when multi-realm\n * constructors are detected.\n */\n// See: https://expressjs.com/en/advanced/best-practice-performance.html#set-node_env-to-production\n// See: https://webpack.js.org/guides/production/\nexport default process.env.NODE_ENV === 'production' ? // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2317')\n// eslint-disable-next-line no-shadow\nfunction instanceOf(value, constructor) {\n return value instanceof constructor;\n} : // eslint-disable-next-line no-shadow\nfunction instanceOf(value, constructor) {\n if (value instanceof constructor) {\n return true;\n }\n\n if (value) {\n var valueClass = value.constructor;\n var className = constructor.name;\n\n if (className && valueClass && valueClass.name === className) {\n throw new Error(\"Cannot use \".concat(className, \" \\\"\").concat(value, \"\\\" from another module or realm.\\n\\nEnsure that there is only one instance of \\\"graphql\\\" in the node_modules\\ndirectory. If different versions of \\\"graphql\\\" are the dependencies of other\\nrelied on modules, use \\\"resolutions\\\" to ensure only one version is installed.\\n\\nhttps://yarnpkg.com/en/docs/selective-version-resolutions\\n\\nDuplicate \\\"graphql\\\" modules cannot be used at the same time since different\\nversions may have different capabilities and behavior. The data from one\\nversion used in the function from another could produce confusing and\\nspurious results.\"));\n }\n }\n\n return false;\n};\n", "function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nimport { SYMBOL_TO_STRING_TAG } from \"../polyfills/symbols.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport devAssert from \"../jsutils/devAssert.mjs\";\nimport instanceOf from \"../jsutils/instanceOf.mjs\";\n\n/**\n * A representation of source input to GraphQL. The `name` and `locationOffset` parameters are\n * optional, but they are useful for clients who store GraphQL documents in source files.\n * For example, if the GraphQL input starts at line 40 in a file named `Foo.graphql`, it might\n * be useful for `name` to be `\"Foo.graphql\"` and location to be `{ line: 40, column: 1 }`.\n * The `line` and `column` properties in `locationOffset` are 1-indexed.\n */\nexport var Source = /*#__PURE__*/function () {\n function Source(body) {\n var name = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'GraphQL request';\n var locationOffset = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {\n line: 1,\n column: 1\n };\n typeof body === 'string' || devAssert(0, \"Body must be a string. Received: \".concat(inspect(body), \".\"));\n this.body = body;\n this.name = name;\n this.locationOffset = locationOffset;\n this.locationOffset.line > 0 || devAssert(0, 'line in locationOffset is 1-indexed and must be positive.');\n this.locationOffset.column > 0 || devAssert(0, 'column in locationOffset is 1-indexed and must be positive.');\n } // $FlowFixMe[unsupported-syntax] Flow doesn't support computed properties yet\n\n\n _createClass(Source, [{\n key: SYMBOL_TO_STRING_TAG,\n get: function get() {\n return 'Source';\n }\n }]);\n\n return Source;\n}();\n/**\n * Test if the given value is a Source object.\n *\n * @internal\n */\n\n// eslint-disable-next-line no-redeclare\nexport function isSource(source) {\n return instanceOf(source, Source);\n}\n", "/**\n * The set of allowed directive location values.\n */\nexport var DirectiveLocation = Object.freeze({\n // Request Definitions\n QUERY: 'QUERY',\n MUTATION: 'MUTATION',\n SUBSCRIPTION: 'SUBSCRIPTION',\n FIELD: 'FIELD',\n FRAGMENT_DEFINITION: 'FRAGMENT_DEFINITION',\n FRAGMENT_SPREAD: 'FRAGMENT_SPREAD',\n INLINE_FRAGMENT: 'INLINE_FRAGMENT',\n VARIABLE_DEFINITION: 'VARIABLE_DEFINITION',\n // Type System Definitions\n SCHEMA: 'SCHEMA',\n SCALAR: 'SCALAR',\n OBJECT: 'OBJECT',\n FIELD_DEFINITION: 'FIELD_DEFINITION',\n ARGUMENT_DEFINITION: 'ARGUMENT_DEFINITION',\n INTERFACE: 'INTERFACE',\n UNION: 'UNION',\n ENUM: 'ENUM',\n ENUM_VALUE: 'ENUM_VALUE',\n INPUT_OBJECT: 'INPUT_OBJECT',\n INPUT_FIELD_DEFINITION: 'INPUT_FIELD_DEFINITION'\n});\n/**\n * The enum type representing the directive location values.\n */\n", "/**\n * Produces the value of a block string from its parsed raw value, similar to\n * CoffeeScript's block string, Python's docstring trim or Ruby's strip_heredoc.\n *\n * This implements the GraphQL spec's BlockStringValue() static algorithm.\n *\n * @internal\n */\nexport function dedentBlockStringValue(rawString) {\n // Expand a block string's raw value into independent lines.\n var lines = rawString.split(/\\r\\n|[\\n\\r]/g); // Remove common indentation from all lines but first.\n\n var commonIndent = getBlockStringIndentation(rawString);\n\n if (commonIndent !== 0) {\n for (var i = 1; i < lines.length; i++) {\n lines[i] = lines[i].slice(commonIndent);\n }\n } // Remove leading and trailing blank lines.\n\n\n var startLine = 0;\n\n while (startLine < lines.length && isBlank(lines[startLine])) {\n ++startLine;\n }\n\n var endLine = lines.length;\n\n while (endLine > startLine && isBlank(lines[endLine - 1])) {\n --endLine;\n } // Return a string of the lines joined with U+000A.\n\n\n return lines.slice(startLine, endLine).join('\\n');\n}\n\nfunction isBlank(str) {\n for (var i = 0; i < str.length; ++i) {\n if (str[i] !== ' ' && str[i] !== '\\t') {\n return false;\n }\n }\n\n return true;\n}\n/**\n * @internal\n */\n\n\nexport function getBlockStringIndentation(value) {\n var _commonIndent;\n\n var isFirstLine = true;\n var isEmptyLine = true;\n var indent = 0;\n var commonIndent = null;\n\n for (var i = 0; i < value.length; ++i) {\n switch (value.charCodeAt(i)) {\n case 13:\n // \\r\n if (value.charCodeAt(i + 1) === 10) {\n ++i; // skip \\r\\n as one symbol\n }\n\n // falls through\n\n case 10:\n // \\n\n isFirstLine = false;\n isEmptyLine = true;\n indent = 0;\n break;\n\n case 9: // \\t\n\n case 32:\n // <space>\n ++indent;\n break;\n\n default:\n if (isEmptyLine && !isFirstLine && (commonIndent === null || indent < commonIndent)) {\n commonIndent = indent;\n }\n\n isEmptyLine = false;\n }\n }\n\n return (_commonIndent = commonIndent) !== null && _commonIndent !== void 0 ? _commonIndent : 0;\n}\n/**\n * Print a block string in the indented block form by adding a leading and\n * trailing blank line. However, if a block string starts with whitespace and is\n * a single-line, adding a leading blank line would strip that whitespace.\n *\n * @internal\n */\n\nexport function printBlockString(value) {\n var indentation = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';\n var preferMultipleLines = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n var isSingleLine = value.indexOf('\\n') === -1;\n var hasLeadingSpace = value[0] === ' ' || value[0] === '\\t';\n var hasTrailingQuote = value[value.length - 1] === '\"';\n var hasTrailingSlash = value[value.length - 1] === '\\\\';\n var printAsMultipleLines = !isSingleLine || hasTrailingQuote || hasTrailingSlash || preferMultipleLines;\n var result = ''; // Format a multi-line block quote to account for leading space.\n\n if (printAsMultipleLines && !(isSingleLine && hasLeadingSpace)) {\n result += '\\n' + indentation;\n }\n\n result += indentation ? value.replace(/\\n/g, '\\n' + indentation) : value;\n\n if (printAsMultipleLines) {\n result += '\\n';\n }\n\n return '\"\"\"' + result.replace(/\"\"\"/g, '\\\\\"\"\"') + '\"\"\"';\n}\n", "import { syntaxError } from \"../error/syntaxError.mjs\";\nimport { Token } from \"./ast.mjs\";\nimport { TokenKind } from \"./tokenKind.mjs\";\nimport { dedentBlockStringValue } from \"./blockString.mjs\";\n/**\n * Given a Source object, creates a Lexer for that source.\n * A Lexer is a stateful stream generator in that every time\n * it is advanced, it returns the next token in the Source. Assuming the\n * source lexes, the final Token emitted by the lexer will be of kind\n * EOF, after which the lexer will repeatedly return the same EOF token\n * whenever called.\n */\n\nexport var Lexer = /*#__PURE__*/function () {\n /**\n * The previously focused non-ignored token.\n */\n\n /**\n * The currently focused non-ignored token.\n */\n\n /**\n * The (1-indexed) line containing the current token.\n */\n\n /**\n * The character offset at which the current line begins.\n */\n function Lexer(source) {\n var startOfFileToken = new Token(TokenKind.SOF, 0, 0, 0, 0, null);\n this.source = source;\n this.lastToken = startOfFileToken;\n this.token = startOfFileToken;\n this.line = 1;\n this.lineStart = 0;\n }\n /**\n * Advances the token stream to the next non-ignored token.\n */\n\n\n var _proto = Lexer.prototype;\n\n _proto.advance = function advance() {\n this.lastToken = this.token;\n var token = this.token = this.lookahead();\n return token;\n }\n /**\n * Looks ahead and returns the next non-ignored token, but does not change\n * the state of Lexer.\n */\n ;\n\n _proto.lookahead = function lookahead() {\n var token = this.token;\n\n if (token.kind !== TokenKind.EOF) {\n do {\n var _token$next;\n\n // Note: next is only mutable during parsing, so we cast to allow this.\n token = (_token$next = token.next) !== null && _token$next !== void 0 ? _token$next : token.next = readToken(this, token);\n } while (token.kind === TokenKind.COMMENT);\n }\n\n return token;\n };\n\n return Lexer;\n}();\n/**\n * @internal\n */\n\nexport function isPunctuatorTokenKind(kind) {\n return kind === TokenKind.BANG || kind === TokenKind.DOLLAR || kind === TokenKind.AMP || kind === TokenKind.PAREN_L || kind === TokenKind.PAREN_R || kind === TokenKind.SPREAD || kind === TokenKind.COLON || kind === TokenKind.EQUALS || kind === TokenKind.AT || kind === TokenKind.BRACKET_L || kind === TokenKind.BRACKET_R || kind === TokenKind.BRACE_L || kind === TokenKind.PIPE || kind === TokenKind.BRACE_R;\n}\n\nfunction printCharCode(code) {\n return (// NaN/undefined represents access beyond the end of the file.\n isNaN(code) ? TokenKind.EOF : // Trust JSON for ASCII.\n code < 0x007f ? JSON.stringify(String.fromCharCode(code)) : // Otherwise print the escaped form.\n \"\\\"\\\\u\".concat(('00' + code.toString(16).toUpperCase()).slice(-4), \"\\\"\")\n );\n}\n/**\n * Gets the next token from the source starting at the given position.\n *\n * This skips over whitespace until it finds the next lexable token, then lexes\n * punctuators immediately or calls the appropriate helper function for more\n * complicated tokens.\n */\n\n\nfunction readToken(lexer, prev) {\n var source = lexer.source;\n var body = source.body;\n var bodyLength = body.length;\n var pos = prev.end;\n\n while (pos < bodyLength) {\n var code = body.charCodeAt(pos);\n var _line = lexer.line;\n\n var _col = 1 + pos - lexer.lineStart; // SourceCharacter\n\n\n switch (code) {\n case 0xfeff: // <BOM>\n\n case 9: // \\t\n\n case 32: // <space>\n\n case 44:\n // ,\n ++pos;\n continue;\n\n case 10:\n // \\n\n ++pos;\n ++lexer.line;\n lexer.lineStart = pos;\n continue;\n\n case 13:\n // \\r\n if (body.charCodeAt(pos + 1) === 10) {\n pos += 2;\n } else {\n ++pos;\n }\n\n ++lexer.line;\n lexer.lineStart = pos;\n continue;\n\n case 33:\n // !\n return new Token(TokenKind.BANG, pos, pos + 1, _line, _col, prev);\n\n case 35:\n // #\n return readComment(source, pos, _line, _col, prev);\n\n case 36:\n // $\n return new Token(TokenKind.DOLLAR, pos, pos + 1, _line, _col, prev);\n\n case 38:\n // &\n return new Token(TokenKind.AMP, pos, pos + 1, _line, _col, prev);\n\n case 40:\n // (\n return new Token(TokenKind.PAREN_L, pos, pos + 1, _line, _col, prev);\n\n case 41:\n // )\n return new Token(TokenKind.PAREN_R, pos, pos + 1, _line, _col, prev);\n\n case 46:\n // .\n if (body.charCodeAt(pos + 1) === 46 && body.charCodeAt(pos + 2) === 46) {\n return new Token(TokenKind.SPREAD, pos, pos + 3, _line, _col, prev);\n }\n\n break;\n\n case 58:\n // :\n return new Token(TokenKind.COLON, pos, pos + 1, _line, _col, prev);\n\n case 61:\n // =\n return new Token(TokenKind.EQUALS, pos, pos + 1, _line, _col, prev);\n\n case 64:\n // @\n return new Token(TokenKind.AT, pos, pos + 1, _line, _col, prev);\n\n case 91:\n // [\n return new Token(TokenKind.BRACKET_L, pos, pos + 1, _line, _col, prev);\n\n case 93:\n // ]\n return new Token(TokenKind.BRACKET_R, pos, pos + 1, _line, _col, prev);\n\n case 123:\n // {\n return new Token(TokenKind.BRACE_L, pos, pos + 1, _line, _col, prev);\n\n case 124:\n // |\n return new Token(TokenKind.PIPE, pos, pos + 1, _line, _col, prev);\n\n case 125:\n // }\n return new Token(TokenKind.BRACE_R, pos, pos + 1, _line, _col, prev);\n\n case 34:\n // \"\n if (body.charCodeAt(pos + 1) === 34 && body.charCodeAt(pos + 2) === 34) {\n return readBlockString(source, pos, _line, _col, prev, lexer);\n }\n\n return readString(source, pos, _line, _col, prev);\n\n case 45: // -\n\n case 48: // 0\n\n case 49: // 1\n\n case 50: // 2\n\n case 51: // 3\n\n case 52: // 4\n\n case 53: // 5\n\n case 54: // 6\n\n case 55: // 7\n\n case 56: // 8\n\n case 57:\n // 9\n return readNumber(source, pos, code, _line, _col, prev);\n\n case 65: // A\n\n case 66: // B\n\n case 67: // C\n\n case 68: // D\n\n case 69: // E\n\n case 70: // F\n\n case 71: // G\n\n case 72: // H\n\n case 73: // I\n\n case 74: // J\n\n case 75: // K\n\n case 76: // L\n\n case 77: // M\n\n case 78: // N\n\n case 79: // O\n\n case 80: // P\n\n case 81: // Q\n\n case 82: // R\n\n case 83: // S\n\n case 84: // T\n\n case 85: // U\n\n case 86: // V\n\n case 87: // W\n\n case 88: // X\n\n case 89: // Y\n\n case 90: // Z\n\n case 95: // _\n\n case 97: // a\n\n case 98: // b\n\n case 99: // c\n\n case 100: // d\n\n case 101: // e\n\n case 102: // f\n\n case 103: // g\n\n case 104: // h\n\n case 105: // i\n\n case 106: // j\n\n case 107: // k\n\n case 108: // l\n\n case 109: // m\n\n case 110: // n\n\n case 111: // o\n\n case 112: // p\n\n case 113: // q\n\n case 114: // r\n\n case 115: // s\n\n case 116: // t\n\n case 117: // u\n\n case 118: // v\n\n case 119: // w\n\n case 120: // x\n\n case 121: // y\n\n case 122:\n // z\n return readName(source, pos, _line, _col, prev);\n }\n\n throw syntaxError(source, pos, unexpectedCharacterMessage(code));\n }\n\n var line = lexer.line;\n var col = 1 + pos - lexer.lineStart;\n return new Token(TokenKind.EOF, bodyLength, bodyLength, line, col, prev);\n}\n/**\n * Report a message that an unexpected character was encountered.\n */\n\n\nfunction unexpectedCharacterMessage(code) {\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n return \"Cannot contain the invalid character \".concat(printCharCode(code), \".\");\n }\n\n if (code === 39) {\n // '\n return 'Unexpected single quote character (\\'), did you mean to use a double quote (\")?';\n }\n\n return \"Cannot parse the unexpected character \".concat(printCharCode(code), \".\");\n}\n/**\n * Reads a comment token from the source file.\n *\n * #[\\u0009\\u0020-\\uFFFF]*\n */\n\n\nfunction readComment(source, start, line, col, prev) {\n var body = source.body;\n var code;\n var position = start;\n\n do {\n code = body.charCodeAt(++position);\n } while (!isNaN(code) && ( // SourceCharacter but not LineTerminator\n code > 0x001f || code === 0x0009));\n\n return new Token(TokenKind.COMMENT, start, position, line, col, prev, body.slice(start + 1, position));\n}\n/**\n * Reads a number token from the source file, either a float\n * or an int depending on whether a decimal point appears.\n *\n * Int: -?(0|[1-9][0-9]*)\n * Float: -?(0|[1-9][0-9]*)(\\.[0-9]+)?((E|e)(+|-)?[0-9]+)?\n */\n\n\nfunction readNumber(source, start, firstCode, line, col, prev) {\n var body = source.body;\n var code = firstCode;\n var position = start;\n var isFloat = false;\n\n if (code === 45) {\n // -\n code = body.charCodeAt(++position);\n }\n\n if (code === 48) {\n // 0\n code = body.charCodeAt(++position);\n\n if (code >= 48 && code <= 57) {\n throw syntaxError(source, position, \"Invalid number, unexpected digit after 0: \".concat(printCharCode(code), \".\"));\n }\n } else {\n position = readDigits(source, position, code);\n code = body.charCodeAt(position);\n }\n\n if (code === 46) {\n // .\n isFloat = true;\n code = body.charCodeAt(++position);\n position = readDigits(source, position, code);\n code = body.charCodeAt(position);\n }\n\n if (code === 69 || code === 101) {\n // E e\n isFloat = true;\n code = body.charCodeAt(++position);\n\n if (code === 43 || code === 45) {\n // + -\n code = body.charCodeAt(++position);\n }\n\n position = readDigits(source, position, code);\n code = body.charCodeAt(position);\n } // Numbers cannot be followed by . or NameStart\n\n\n if (code === 46 || isNameStart(code)) {\n throw syntaxError(source, position, \"Invalid number, expected digit but got: \".concat(printCharCode(code), \".\"));\n }\n\n return new Token(isFloat ? TokenKind.FLOAT : TokenKind.INT, start, position, line, col, prev, body.slice(start, position));\n}\n/**\n * Returns the new position in the source after reading digits.\n */\n\n\nfunction readDigits(source, start, firstCode) {\n var body = source.body;\n var position = start;\n var code = firstCode;\n\n if (code >= 48 && code <= 57) {\n // 0 - 9\n do {\n code = body.charCodeAt(++position);\n } while (code >= 48 && code <= 57); // 0 - 9\n\n\n return position;\n }\n\n throw syntaxError(source, position, \"Invalid number, expected digit but got: \".concat(printCharCode(code), \".\"));\n}\n/**\n * Reads a string token from the source file.\n *\n * \"([^\"\\\\\\u000A\\u000D]|(\\\\(u[0-9a-fA-F]{4}|[\"\\\\/bfnrt])))*\"\n */\n\n\nfunction readString(source, start, line, col, prev) {\n var body = source.body;\n var position = start + 1;\n var chunkStart = position;\n var code = 0;\n var value = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position)) && // not LineTerminator\n code !== 0x000a && code !== 0x000d) {\n // Closing Quote (\")\n if (code === 34) {\n value += body.slice(chunkStart, position);\n return new Token(TokenKind.STRING, start, position + 1, line, col, prev, value);\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009) {\n throw syntaxError(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n ++position;\n\n if (code === 92) {\n // \\\n value += body.slice(chunkStart, position - 1);\n code = body.charCodeAt(position);\n\n switch (code) {\n case 34:\n value += '\"';\n break;\n\n case 47:\n value += '/';\n break;\n\n case 92:\n value += '\\\\';\n break;\n\n case 98:\n value += '\\b';\n break;\n\n case 102:\n value += '\\f';\n break;\n\n case 110:\n value += '\\n';\n break;\n\n case 114:\n value += '\\r';\n break;\n\n case 116:\n value += '\\t';\n break;\n\n case 117:\n {\n // uXXXX\n var charCode = uniCharCode(body.charCodeAt(position + 1), body.charCodeAt(position + 2), body.charCodeAt(position + 3), body.charCodeAt(position + 4));\n\n if (charCode < 0) {\n var invalidSequence = body.slice(position + 1, position + 5);\n throw syntaxError(source, position, \"Invalid character escape sequence: \\\\u\".concat(invalidSequence, \".\"));\n }\n\n value += String.fromCharCode(charCode);\n position += 4;\n break;\n }\n\n default:\n throw syntaxError(source, position, \"Invalid character escape sequence: \\\\\".concat(String.fromCharCode(code), \".\"));\n }\n\n ++position;\n chunkStart = position;\n }\n }\n\n throw syntaxError(source, position, 'Unterminated string.');\n}\n/**\n * Reads a block string token from the source file.\n *\n * \"\"\"(\"?\"?(\\\\\"\"\"|\\\\(?!=\"\"\")|[^\"\\\\]))*\"\"\"\n */\n\n\nfunction readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new Token(TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, dedentBlockStringValue(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw syntaxError(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw syntaxError(source, position, 'Unterminated string.');\n}\n/**\n * Converts four hexadecimal chars to the integer that the\n * string represents. For example, uniCharCode('0','0','0','f')\n * will return 15, and uniCharCode('0','0','f','f') returns 255.\n *\n * Returns a negative number on error, if a char was invalid.\n *\n * This is implemented by noting that char2hex() returns -1 on error,\n * which means the result of ORing the char2hex() will also be negative.\n */\n\n\nfunction uniCharCode(a, b, c, d) {\n return char2hex(a) << 12 | char2hex(b) << 8 | char2hex(c) << 4 | char2hex(d);\n}\n/**\n * Converts a hex character to its integer value.\n * '0' becomes 0, '9' becomes 9\n * 'A' becomes 10, 'F' becomes 15\n * 'a' becomes 10, 'f' becomes 15\n *\n * Returns -1 on error.\n */\n\n\nfunction char2hex(a) {\n return a >= 48 && a <= 57 ? a - 48 // 0-9\n : a >= 65 && a <= 70 ? a - 55 // A-F\n : a >= 97 && a <= 102 ? a - 87 // a-f\n : -1;\n}\n/**\n * Reads an alphanumeric + underscore name from the source.\n *\n * [_A-Za-z][_0-9A-Za-z]*\n */\n\n\nfunction readName(source, start, line, col, prev) {\n var body = source.body;\n var bodyLength = body.length;\n var position = start + 1;\n var code = 0;\n\n while (position !== bodyLength && !isNaN(code = body.charCodeAt(position)) && (code === 95 || // _\n code >= 48 && code <= 57 || // 0-9\n code >= 65 && code <= 90 || // A-Z\n code >= 97 && code <= 122) // a-z\n ) {\n ++position;\n }\n\n return new Token(TokenKind.NAME, start, position, line, col, prev, body.slice(start, position));\n} // _ A-Z a-z\n\n\nfunction isNameStart(code) {\n return code === 95 || code >= 65 && code <= 90 || code >= 97 && code <= 122;\n}\n", "import { syntaxError } from \"../error/syntaxError.mjs\";\nimport { Kind } from \"./kinds.mjs\";\nimport { Location } from \"./ast.mjs\";\nimport { TokenKind } from \"./tokenKind.mjs\";\nimport { Source, isSource } from \"./source.mjs\";\nimport { DirectiveLocation } from \"./directiveLocation.mjs\";\nimport { Lexer, isPunctuatorTokenKind } from \"./lexer.mjs\";\n/**\n * Configuration options to control parser behavior\n */\n\n/**\n * Given a GraphQL source, parses it into a Document.\n * Throws GraphQLError if a syntax error is encountered.\n */\nexport function parse(source, options) {\n var parser = new Parser(source, options);\n return parser.parseDocument();\n}\n/**\n * Given a string containing a GraphQL value (ex. `[42]`), parse the AST for\n * that value.\n * Throws GraphQLError if a syntax error is encountered.\n *\n * This is useful within tools that operate upon GraphQL Values directly and\n * in isolation of complete GraphQL documents.\n *\n * Consider providing the results to the utility function: valueFromAST().\n */\n\nexport function parseValue(source, options) {\n var parser = new Parser(source, options);\n parser.expectToken(TokenKind.SOF);\n var value = parser.parseValueLiteral(false);\n parser.expectToken(TokenKind.EOF);\n return value;\n}\n/**\n * Given a string containing a GraphQL Type (ex. `[Int!]`), parse the AST for\n * that type.\n * Throws GraphQLError if a syntax error is encountered.\n *\n * This is useful within tools that operate upon GraphQL Types directly and\n * in isolation of complete GraphQL documents.\n *\n * Consider providing the results to the utility function: typeFromAST().\n */\n\nexport function parseType(source, options) {\n var parser = new Parser(source, options);\n parser.expectToken(TokenKind.SOF);\n var type = parser.parseTypeReference();\n parser.expectToken(TokenKind.EOF);\n return type;\n}\n/**\n * This class is exported only to assist people in implementing their own parsers\n * without duplicating too much code and should be used only as last resort for cases\n * such as experimental syntax or if certain features could not be contributed upstream.\n *\n * It is still part of the internal API and is versioned, so any changes to it are never\n * considered breaking changes. If you still need to support multiple versions of the\n * library, please use the `versionInfo` variable for version detection.\n *\n * @internal\n */\n\nexport var Parser = /*#__PURE__*/function () {\n function Parser(source, options) {\n var sourceObj = isSource(source) ? source : new Source(source);\n this._lexer = new Lexer(sourceObj);\n this._options = options;\n }\n /**\n * Converts a name lex token into a name parse node.\n */\n\n\n var _proto = Parser.prototype;\n\n _proto.parseName = function parseName() {\n var token = this.expectToken(TokenKind.NAME);\n return {\n kind: Kind.NAME,\n value: token.value,\n loc: this.loc(token)\n };\n } // Implements the parsing rules in the Document section.\n\n /**\n * Document : Definition+\n */\n ;\n\n _proto.parseDocument = function parseDocument() {\n var start = this._lexer.token;\n return {\n kind: Kind.DOCUMENT,\n definitions: this.many(TokenKind.SOF, this.parseDefinition, TokenKind.EOF),\n loc: this.loc(start)\n };\n }\n /**\n * Definition :\n * - ExecutableDefinition\n * - TypeSystemDefinition\n * - TypeSystemExtension\n *\n * ExecutableDefinition :\n * - OperationDefinition\n * - FragmentDefinition\n */\n ;\n\n _proto.parseDefinition = function parseDefinition() {\n if (this.peek(TokenKind.NAME)) {\n switch (this._lexer.token.value) {\n case 'query':\n case 'mutation':\n case 'subscription':\n return this.parseOperationDefinition();\n\n case 'fragment':\n return this.parseFragmentDefinition();\n\n case 'schema':\n case 'scalar':\n case 'type':\n case 'interface':\n case 'union':\n case 'enum':\n case 'input':\n case 'directive':\n return this.parseTypeSystemDefinition();\n\n case 'extend':\n return this.parseTypeSystemExtension();\n }\n } else if (this.peek(TokenKind.BRACE_L)) {\n return this.parseOperationDefinition();\n } else if (this.peekDescription()) {\n return this.parseTypeSystemDefinition();\n }\n\n throw this.unexpected();\n } // Implements the parsing rules in the Operations section.\n\n /**\n * OperationDefinition :\n * - SelectionSet\n * - OperationType Name? VariableDefinitions? Directives? SelectionSet\n */\n ;\n\n _proto.parseOperationDefinition = function parseOperationDefinition() {\n var start = this._lexer.token;\n\n if (this.peek(TokenKind.BRACE_L)) {\n return {\n kind: Kind.OPERATION_DEFINITION,\n operation: 'query',\n name: undefined,\n variableDefinitions: [],\n directives: [],\n selectionSet: this.parseSelectionSet(),\n loc: this.loc(start)\n };\n }\n\n var operation = this.parseOperationType();\n var name;\n\n if (this.peek(TokenKind.NAME)) {\n name = this.parseName();\n }\n\n return {\n kind: Kind.OPERATION_DEFINITION,\n operation: operation,\n name: name,\n variableDefinitions: this.parseVariableDefinitions(),\n directives: this.parseDirectives(false),\n selectionSet: this.parseSelectionSet(),\n loc: this.loc(start)\n };\n }\n /**\n * OperationType : one of query mutation subscription\n */\n ;\n\n _proto.parseOperationType = function parseOperationType() {\n var operationToken = this.expectToken(TokenKind.NAME);\n\n switch (operationToken.value) {\n case 'query':\n return 'query';\n\n case 'mutation':\n return 'mutation';\n\n case 'subscription':\n return 'subscription';\n }\n\n throw this.unexpected(operationToken);\n }\n /**\n * VariableDefinitions : ( VariableDefinition+ )\n */\n ;\n\n _proto.parseVariableDefinitions = function parseVariableDefinitions() {\n return this.optionalMany(TokenKind.PAREN_L, this.parseVariableDefinition, TokenKind.PAREN_R);\n }\n /**\n * VariableDefinition : Variable : Type DefaultValue? Directives[Const]?\n */\n ;\n\n _proto.parseVariableDefinition = function parseVariableDefinition() {\n var start = this._lexer.token;\n return {\n kind: Kind.VARIABLE_DEFINITION,\n variable: this.parseVariable(),\n type: (this.expectToken(TokenKind.COLON), this.parseTypeReference()),\n defaultValue: this.expectOptionalToken(TokenKind.EQUALS) ? this.parseValueLiteral(true) : undefined,\n directives: this.parseDirectives(true),\n loc: this.loc(start)\n };\n }\n /**\n * Variable : $ Name\n */\n ;\n\n _proto.parseVariable = function parseVariable() {\n var start = this._lexer.token;\n this.expectToken(TokenKind.DOLLAR);\n return {\n kind: Kind.VARIABLE,\n name: this.parseName(),\n loc: this.loc(start)\n };\n }\n /**\n * SelectionSet : { Selection+ }\n */\n ;\n\n _proto.parseSelectionSet = function parseSelectionSet() {\n var start = this._lexer.token;\n return {\n kind: Kind.SELECTION_SET,\n selections: this.many(TokenKind.BRACE_L, this.parseSelection, TokenKind.BRACE_R),\n loc: this.loc(start)\n };\n }\n /**\n * Selection :\n * - Field\n * - FragmentSpread\n * - InlineFragment\n */\n ;\n\n _proto.parseSelection = function parseSelection() {\n return this.peek(TokenKind.SPREAD) ? this.parseFragment() : this.parseField();\n }\n /**\n * Field : Alias? Name Arguments? Directives? SelectionSet?\n *\n * Alias : Name :\n */\n ;\n\n _proto.parseField = function parseField() {\n var start = this._lexer.token;\n var nameOrAlias = this.parseName();\n var alias;\n var name;\n\n if (this.expectOptionalToken(TokenKind.COLON)) {\n alias = nameOrAlias;\n name = this.parseName();\n } else {\n name = nameOrAlias;\n }\n\n return {\n kind: Kind.FIELD,\n alias: alias,\n name: name,\n arguments: this.parseArguments(false),\n directives: this.parseDirectives(false),\n selectionSet: this.peek(TokenKind.BRACE_L) ? this.parseSelectionSet() : undefined,\n loc: this.loc(start)\n };\n }\n /**\n * Arguments[Const] : ( Argument[?Const]+ )\n */\n ;\n\n _proto.parseArguments = function parseArguments(isConst) {\n var item = isConst ? this.parseConstArgument : this.parseArgument;\n return this.optionalMany(TokenKind.PAREN_L, item, TokenKind.PAREN_R);\n }\n /**\n * Argument[Const] : Name : Value[?Const]\n */\n ;\n\n _proto.parseArgument = function parseArgument() {\n var start = this._lexer.token;\n var name = this.parseName();\n this.expectToken(TokenKind.COLON);\n return {\n kind: Kind.ARGUMENT,\n name: name,\n value: this.parseValueLiteral(false),\n loc: this.loc(start)\n };\n };\n\n _proto.parseConstArgument = function parseConstArgument() {\n var start = this._lexer.token;\n return {\n kind: Kind.ARGUMENT,\n name: this.parseName(),\n value: (this.expectToken(TokenKind.COLON), this.parseValueLiteral(true)),\n loc: this.loc(start)\n };\n } // Implements the parsing rules in the Fragments section.\n\n /**\n * Corresponds to both FragmentSpread and InlineFragment in the spec.\n *\n * FragmentSpread : ... FragmentName Directives?\n *\n * InlineFragment : ... TypeCondition? Directives? SelectionSet\n */\n ;\n\n _proto.parseFragment = function parseFragment() {\n var start = this._lexer.token;\n this.expectToken(TokenKind.SPREAD);\n var hasTypeCondition = this.expectOptionalKeyword('on');\n\n if (!hasTypeCondition && this.peek(TokenKind.NAME)) {\n return {\n kind: Kind.FRAGMENT_SPREAD,\n name: this.parseFragmentName(),\n directives: this.parseDirectives(false),\n loc: this.loc(start)\n };\n }\n\n return {\n kind: Kind.INLINE_FRAGMENT,\n typeCondition: hasTypeCondition ? this.parseNamedType() : undefined,\n directives: this.parseDirectives(false),\n selectionSet: this.parseSelectionSet(),\n loc: this.loc(start)\n };\n }\n /**\n * FragmentDefinition :\n * - fragment FragmentName on TypeCondition Directives? SelectionSet\n *\n * TypeCondition : NamedType\n */\n ;\n\n _proto.parseFragmentDefinition = function parseFragmentDefinition() {\n var _this$_options;\n\n var start = this._lexer.token;\n this.expectKeyword('fragment'); // Experimental support for defining variables within fragments changes\n // the grammar of FragmentDefinition:\n // - fragment FragmentName VariableDefinitions? on TypeCondition Directives? SelectionSet\n\n if (((_this$_options = this._options) === null || _this$_options === void 0 ? void 0 : _this$_options.experimentalFragmentVariables) === true) {\n return {\n kind: Kind.FRAGMENT_DEFINITION,\n name: this.parseFragmentName(),\n variableDefinitions: this.parseVariableDefinitions(),\n typeCondition: (this.expectKeyword('on'), this.parseNamedType()),\n directives: this.parseDirectives(false),\n selectionSet: this.parseSelectionSet(),\n loc: this.loc(start)\n };\n }\n\n return {\n kind: Kind.FRAGMENT_DEFINITION,\n name: this.parseFragmentName(),\n typeCondition: (this.expectKeyword('on'), this.parseNamedType()),\n directives: this.parseDirectives(false),\n selectionSet: this.parseSelectionSet(),\n loc: this.loc(start)\n };\n }\n /**\n * FragmentName : Name but not `on`\n */\n ;\n\n _proto.parseFragmentName = function parseFragmentName() {\n if (this._lexer.token.value === 'on') {\n throw this.unexpected();\n }\n\n return this.parseName();\n } // Implements the parsing rules in the Values section.\n\n /**\n * Value[Const] :\n * - [~Const] Variable\n * - IntValue\n * - FloatValue\n * - StringValue\n * - BooleanValue\n * - NullValue\n * - EnumValue\n * - ListValue[?Const]\n * - ObjectValue[?Const]\n *\n * BooleanValue : one of `true` `false`\n *\n * NullValue : `null`\n *\n * EnumValue : Name but not `true`, `false` or `null`\n */\n ;\n\n _proto.parseValueLiteral = function parseValueLiteral(isConst) {\n var token = this._lexer.token;\n\n switch (token.kind) {\n case TokenKind.BRACKET_L:\n return this.parseList(isConst);\n\n case TokenKind.BRACE_L:\n return this.parseObject(isConst);\n\n case TokenKind.INT:\n this._lexer.advance();\n\n return {\n kind: Kind.INT,\n value: token.value,\n loc: this.loc(token)\n };\n\n case TokenKind.FLOAT:\n this._lexer.advance();\n\n return {\n kind: Kind.FLOAT,\n value: token.value,\n loc: this.loc(token)\n };\n\n case TokenKind.STRING:\n case TokenKind.BLOCK_STRING:\n return this.parseStringLiteral();\n\n case TokenKind.NAME:\n this._lexer.advance();\n\n switch (token.value) {\n case 'true':\n return {\n kind: Kind.BOOLEAN,\n value: true,\n loc: this.loc(token)\n };\n\n case 'false':\n return {\n kind: Kind.BOOLEAN,\n value: false,\n loc: this.loc(token)\n };\n\n case 'null':\n return {\n kind: Kind.NULL,\n loc: this.loc(token)\n };\n\n default:\n return {\n kind: Kind.ENUM,\n value: token.value,\n loc: this.loc(token)\n };\n }\n\n case TokenKind.DOLLAR:\n if (!isConst) {\n return this.parseVariable();\n }\n\n break;\n }\n\n throw this.unexpected();\n };\n\n _proto.parseStringLiteral = function parseStringLiteral() {\n var token = this._lexer.token;\n\n this._lexer.advance();\n\n return {\n kind: Kind.STRING,\n value: token.value,\n block: token.kind === TokenKind.BLOCK_STRING,\n loc: this.loc(token)\n };\n }\n /**\n * ListValue[Const] :\n * - [ ]\n * - [ Value[?Const]+ ]\n */\n ;\n\n _proto.parseList = function parseList(isConst) {\n var _this = this;\n\n var start = this._lexer.token;\n\n var item = function item() {\n return _this.parseValueLiteral(isConst);\n };\n\n return {\n kind: Kind.LIST,\n values: this.any(TokenKind.BRACKET_L, item, TokenKind.BRACKET_R),\n loc: this.loc(start)\n };\n }\n /**\n * ObjectValue[Const] :\n * - { }\n * - { ObjectField[?Const]+ }\n */\n ;\n\n _proto.parseObject = function parseObject(isConst) {\n var _this2 = this;\n\n var start = this._lexer.token;\n\n var item = function item() {\n return _this2.parseObjectField(isConst);\n };\n\n return {\n kind: Kind.OBJECT,\n fields: this.any(TokenKind.BRACE_L, item, TokenKind.BRACE_R),\n loc: this.loc(start)\n };\n }\n /**\n * ObjectField[Const] : Name : Value[?Const]\n */\n ;\n\n _proto.parseObjectField = function parseObjectField(isConst) {\n var start = this._lexer.token;\n var name = this.parseName();\n this.expectToken(TokenKind.COLON);\n return {\n kind: Kind.OBJECT_FIELD,\n name: name,\n value: this.parseValueLiteral(isConst),\n loc: this.loc(start)\n };\n } // Implements the parsing rules in the Directives section.\n\n /**\n * Directives[Const] : Directive[?Const]+\n */\n ;\n\n _proto.parseDirectives = function parseDirectives(isConst) {\n var directives = [];\n\n while (this.peek(TokenKind.AT)) {\n directives.push(this.parseDirective(isConst));\n }\n\n return directives;\n }\n /**\n * Directive[Const] : @ Name Arguments[?Const]?\n */\n ;\n\n _proto.parseDirective = function parseDirective(isConst) {\n var start = this._lexer.token;\n this.expectToken(TokenKind.AT);\n return {\n kind: Kind.DIRECTIVE,\n name: this.parseName(),\n arguments: this.parseArguments(isConst),\n loc: this.loc(start)\n };\n } // Implements the parsing rules in the Types section.\n\n /**\n * Type :\n * - NamedType\n * - ListType\n * - NonNullType\n */\n ;\n\n _proto.parseTypeReference = function parseTypeReference() {\n var start = this._lexer.token;\n var type;\n\n if (this.expectOptionalToken(TokenKind.BRACKET_L)) {\n type = this.parseTypeReference();\n this.expectToken(TokenKind.BRACKET_R);\n type = {\n kind: Kind.LIST_TYPE,\n type: type,\n loc: this.loc(start)\n };\n } else {\n type = this.parseNamedType();\n }\n\n if (this.expectOptionalToken(TokenKind.BANG)) {\n return {\n kind: Kind.NON_NULL_TYPE,\n type: type,\n loc: this.loc(start)\n };\n }\n\n return type;\n }\n /**\n * NamedType : Name\n */\n ;\n\n _proto.parseNamedType = function parseNamedType() {\n var start = this._lexer.token;\n return {\n kind: Kind.NAMED_TYPE,\n name: this.parseName(),\n loc: this.loc(start)\n };\n } // Implements the parsing rules in the Type Definition section.\n\n /**\n * TypeSystemDefinition :\n * - SchemaDefinition\n * - TypeDefinition\n * - DirectiveDefinition\n *\n * TypeDefinition :\n * - ScalarTypeDefinition\n * - ObjectTypeDefinition\n * - InterfaceTypeDefinition\n * - UnionTypeDefinition\n * - EnumTypeDefinition\n * - InputObjectTypeDefinition\n */\n ;\n\n _proto.parseTypeSystemDefinition = function parseTypeSystemDefinition() {\n // Many definitions begin with a description and require a lookahead.\n var keywordToken = this.peekDescription() ? this._lexer.lookahead() : this._lexer.token;\n\n if (keywordToken.kind === TokenKind.NAME) {\n switch (keywordToken.value) {\n case 'schema':\n return this.parseSchemaDefinition();\n\n case 'scalar':\n return this.parseScalarTypeDefinition();\n\n case 'type':\n return this.parseObjectTypeDefinition();\n\n case 'interface':\n return this.parseInterfaceTypeDefinition();\n\n case 'union':\n return this.parseUnionTypeDefinition();\n\n case 'enum':\n return this.parseEnumTypeDefinition();\n\n case 'input':\n return this.parseInputObjectTypeDefinition();\n\n case 'directive':\n return this.parseDirectiveDefinition();\n }\n }\n\n throw this.unexpected(keywordToken);\n };\n\n _proto.peekDescription = function peekDescription() {\n return this.peek(TokenKind.STRING) || this.peek(TokenKind.BLOCK_STRING);\n }\n /**\n * Description : StringValue\n */\n ;\n\n _proto.parseDescription = function parseDescription() {\n if (this.peekDescription()) {\n return this.parseStringLiteral();\n }\n }\n /**\n * SchemaDefinition : Description? schema Directives[Const]? { OperationTypeDefinition+ }\n */\n ;\n\n _proto.parseSchemaDefinition = function parseSchemaDefinition() {\n var start = this._lexer.token;\n var description = this.parseDescription();\n this.expectKeyword('schema');\n var directives = this.parseDirectives(true);\n var operationTypes = this.many(TokenKind.BRACE_L, this.parseOperationTypeDefinition, TokenKind.BRACE_R);\n return {\n kind: Kind.SCHEMA_DEFINITION,\n description: description,\n directives: directives,\n operationTypes: operationTypes,\n loc: this.loc(start)\n };\n }\n /**\n * OperationTypeDefinition : OperationType : NamedType\n */\n ;\n\n _proto.parseOperationTypeDefinition = function parseOperationTypeDefinition() {\n var start = this._lexer.token;\n var operation = this.parseOperationType();\n this.expectToken(TokenKind.COLON);\n var type = this.parseNamedType();\n return {\n kind: Kind.OPERATION_TYPE_DEFINITION,\n operation: operation,\n type: type,\n loc: this.loc(start)\n };\n }\n /**\n * ScalarTypeDefinition : Description? scalar Name Directives[Const]?\n */\n ;\n\n _proto.parseScalarTypeDefinition = function parseScalarTypeDefinition() {\n var start = this._lexer.token;\n var description = this.parseDescription();\n this.expectKeyword('scalar');\n var name = this.parseName();\n var directives = this.parseDirectives(true);\n return {\n kind: Kind.SCALAR_TYPE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n loc: this.loc(start)\n };\n }\n /**\n * ObjectTypeDefinition :\n * Description?\n * type Name ImplementsInterfaces? Directives[Const]? FieldsDefinition?\n */\n ;\n\n _proto.parseObjectTypeDefinition = function parseObjectTypeDefinition() {\n var start = this._lexer.token;\n var description = this.parseDescription();\n this.expectKeyword('type');\n var name = this.parseName();\n var interfaces = this.parseImplementsInterfaces();\n var directives = this.parseDirectives(true);\n var fields = this.parseFieldsDefinition();\n return {\n kind: Kind.OBJECT_TYPE_DEFINITION,\n description: description,\n name: name,\n interfaces: interfaces,\n directives: directives,\n fields: fields,\n loc: this.loc(start)\n };\n }\n /**\n * ImplementsInterfaces :\n * - implements `&`? NamedType\n * - ImplementsInterfaces & NamedType\n */\n ;\n\n _proto.parseImplementsInterfaces = function parseImplementsInterfaces() {\n var _this$_options2;\n\n if (!this.expectOptionalKeyword('implements')) {\n return [];\n }\n\n if (((_this$_options2 = this._options) === null || _this$_options2 === void 0 ? void 0 : _this$_options2.allowLegacySDLImplementsInterfaces) === true) {\n var types = []; // Optional leading ampersand\n\n this.expectOptionalToken(TokenKind.AMP);\n\n do {\n types.push(this.parseNamedType());\n } while (this.expectOptionalToken(TokenKind.AMP) || this.peek(TokenKind.NAME));\n\n return types;\n }\n\n return this.delimitedMany(TokenKind.AMP, this.parseNamedType);\n }\n /**\n * FieldsDefinition : { FieldDefinition+ }\n */\n ;\n\n _proto.parseFieldsDefinition = function parseFieldsDefinition() {\n var _this$_options3;\n\n // Legacy support for the SDL?\n if (((_this$_options3 = this._options) === null || _this$_options3 === void 0 ? void 0 : _this$_options3.allowLegacySDLEmptyFields) === true && this.peek(TokenKind.BRACE_L) && this._lexer.lookahead().kind === TokenKind.BRACE_R) {\n this._lexer.advance();\n\n this._lexer.advance();\n\n return [];\n }\n\n return this.optionalMany(TokenKind.BRACE_L, this.parseFieldDefinition, TokenKind.BRACE_R);\n }\n /**\n * FieldDefinition :\n * - Description? Name ArgumentsDefinition? : Type Directives[Const]?\n */\n ;\n\n _proto.parseFieldDefinition = function parseFieldDefinition() {\n var start = this._lexer.token;\n var description = this.parseDescription();\n var name = this.parseName();\n var args = this.parseArgumentDefs();\n this.expectToken(TokenKind.COLON);\n var type = this.parseTypeReference();\n var directives = this.parseDirectives(true);\n return {\n kind: Kind.FIELD_DEFINITION,\n description: description,\n name: name,\n arguments: args,\n type: type,\n directives: directives,\n loc: this.loc(start)\n };\n }\n /**\n * ArgumentsDefinition : ( InputValueDefinition+ )\n */\n ;\n\n _proto.parseArgumentDefs = function parseArgumentDefs() {\n return this.optionalMany(TokenKind.PAREN_L, this.parseInputValueDef, TokenKind.PAREN_R);\n }\n /**\n * InputValueDefinition :\n * - Description? Name : Type DefaultValue? Directives[Const]?\n */\n ;\n\n _proto.parseInputValueDef = function parseInputValueDef() {\n var start = this._lexer.token;\n var description = this.parseDescription();\n var name = this.parseName();\n this.expectToken(TokenKind.COLON);\n var type = this.parseTypeReference();\n var defaultValue;\n\n if (this.expectOptionalToken(TokenKind.EQUALS)) {\n defaultValue = this.parseValueLiteral(true);\n }\n\n var directives = this.parseDirectives(true);\n return {\n kind: Kind.INPUT_VALUE_DEFINITION,\n description: description,\n name: name,\n type: type,\n defaultValue: defaultValue,\n directives: directives,\n loc: this.loc(start)\n };\n }\n /**\n * InterfaceTypeDefinition :\n * - Description? interface Name Directives[Const]? FieldsDefinition?\n */\n ;\n\n _proto.parseInterfaceTypeDefinition = function parseInterfaceTypeDefinition() {\n var start = this._lexer.token;\n var description = this.parseDescription();\n this.expectKeyword('interface');\n var name = this.parseName();\n var interfaces = this.parseImplementsInterfaces();\n var directives = this.parseDirectives(true);\n var fields = this.parseFieldsDefinition();\n return {\n kind: Kind.INTERFACE_TYPE_DEFINITION,\n description: description,\n name: name,\n interfaces: interfaces,\n directives: directives,\n fields: fields,\n loc: this.loc(start)\n };\n }\n /**\n * UnionTypeDefinition :\n * - Description? union Name Directives[Const]? UnionMemberTypes?\n */\n ;\n\n _proto.parseUnionTypeDefinition = function parseUnionTypeDefinition() {\n var start = this._lexer.token;\n var description = this.parseDescription();\n this.expectKeyword('union');\n var name = this.parseName();\n var directives = this.parseDirectives(true);\n var types = this.parseUnionMemberTypes();\n return {\n kind: Kind.UNION_TYPE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n types: types,\n loc: this.loc(start)\n };\n }\n /**\n * UnionMemberTypes :\n * - = `|`? NamedType\n * - UnionMemberTypes | NamedType\n */\n ;\n\n _proto.parseUnionMemberTypes = function parseUnionMemberTypes() {\n return this.expectOptionalToken(TokenKind.EQUALS) ? this.delimitedMany(TokenKind.PIPE, this.parseNamedType) : [];\n }\n /**\n * EnumTypeDefinition :\n * - Description? enum Name Directives[Const]? EnumValuesDefinition?\n */\n ;\n\n _proto.parseEnumTypeDefinition = function parseEnumTypeDefinition() {\n var start = this._lexer.token;\n var description = this.parseDescription();\n this.expectKeyword('enum');\n var name = this.parseName();\n var directives = this.parseDirectives(true);\n var values = this.parseEnumValuesDefinition();\n return {\n kind: Kind.ENUM_TYPE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n values: values,\n loc: this.loc(start)\n };\n }\n /**\n * EnumValuesDefinition : { EnumValueDefinition+ }\n */\n ;\n\n _proto.parseEnumValuesDefinition = function parseEnumValuesDefinition() {\n return this.optionalMany(TokenKind.BRACE_L, this.parseEnumValueDefinition, TokenKind.BRACE_R);\n }\n /**\n * EnumValueDefinition : Description? EnumValue Directives[Const]?\n *\n * EnumValue : Name\n */\n ;\n\n _proto.parseEnumValueDefinition = function parseEnumValueDefinition() {\n var start = this._lexer.token;\n var description = this.parseDescription();\n var name = this.parseName();\n var directives = this.parseDirectives(true);\n return {\n kind: Kind.ENUM_VALUE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n loc: this.loc(start)\n };\n }\n /**\n * InputObjectTypeDefinition :\n * - Description? input Name Directives[Const]? InputFieldsDefinition?\n */\n ;\n\n _proto.parseInputObjectTypeDefinition = function parseInputObjectTypeDefinition() {\n var start = this._lexer.token;\n var description = this.parseDescription();\n this.expectKeyword('input');\n var name = this.parseName();\n var directives = this.parseDirectives(true);\n var fields = this.parseInputFieldsDefinition();\n return {\n kind: Kind.INPUT_OBJECT_TYPE_DEFINITION,\n description: description,\n name: name,\n directives: directives,\n fields: fields,\n loc: this.loc(start)\n };\n }\n /**\n * InputFieldsDefinition : { InputValueDefinition+ }\n */\n ;\n\n _proto.parseInputFieldsDefinition = function parseInputFieldsDefinition() {\n return this.optionalMany(TokenKind.BRACE_L, this.parseInputValueDef, TokenKind.BRACE_R);\n }\n /**\n * TypeSystemExtension :\n * - SchemaExtension\n * - TypeExtension\n *\n * TypeExtension :\n * - ScalarTypeExtension\n * - ObjectTypeExtension\n * - InterfaceTypeExtension\n * - UnionTypeExtension\n * - EnumTypeExtension\n * - InputObjectTypeDefinition\n */\n ;\n\n _proto.parseTypeSystemExtension = function parseTypeSystemExtension() {\n var keywordToken = this._lexer.lookahead();\n\n if (keywordToken.kind === TokenKind.NAME) {\n switch (keywordToken.value) {\n case 'schema':\n return this.parseSchemaExtension();\n\n case 'scalar':\n return this.parseScalarTypeExtension();\n\n case 'type':\n return this.parseObjectTypeExtension();\n\n case 'interface':\n return this.parseInterfaceTypeExtension();\n\n case 'union':\n return this.parseUnionTypeExtension();\n\n case 'enum':\n return this.parseEnumTypeExtension();\n\n case 'input':\n return this.parseInputObjectTypeExtension();\n }\n }\n\n throw this.unexpected(keywordToken);\n }\n /**\n * SchemaExtension :\n * - extend schema Directives[Const]? { OperationTypeDefinition+ }\n * - extend schema Directives[Const]\n */\n ;\n\n _proto.parseSchemaExtension = function parseSchemaExtension() {\n var start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('schema');\n var directives = this.parseDirectives(true);\n var operationTypes = this.optionalMany(TokenKind.BRACE_L, this.parseOperationTypeDefinition, TokenKind.BRACE_R);\n\n if (directives.length === 0 && operationTypes.length === 0) {\n throw this.unexpected();\n }\n\n return {\n kind: Kind.SCHEMA_EXTENSION,\n directives: directives,\n operationTypes: operationTypes,\n loc: this.loc(start)\n };\n }\n /**\n * ScalarTypeExtension :\n * - extend scalar Name Directives[Const]\n */\n ;\n\n _proto.parseScalarTypeExtension = function parseScalarTypeExtension() {\n var start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('scalar');\n var name = this.parseName();\n var directives = this.parseDirectives(true);\n\n if (directives.length === 0) {\n throw this.unexpected();\n }\n\n return {\n kind: Kind.SCALAR_TYPE_EXTENSION,\n name: name,\n directives: directives,\n loc: this.loc(start)\n };\n }\n /**\n * ObjectTypeExtension :\n * - extend type Name ImplementsInterfaces? Directives[Const]? FieldsDefinition\n * - extend type Name ImplementsInterfaces? Directives[Const]\n * - extend type Name ImplementsInterfaces\n */\n ;\n\n _proto.parseObjectTypeExtension = function parseObjectTypeExtension() {\n var start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('type');\n var name = this.parseName();\n var interfaces = this.parseImplementsInterfaces();\n var directives = this.parseDirectives(true);\n var fields = this.parseFieldsDefinition();\n\n if (interfaces.length === 0 && directives.length === 0 && fields.length === 0) {\n throw this.unexpected();\n }\n\n return {\n kind: Kind.OBJECT_TYPE_EXTENSION,\n name: name,\n interfaces: interfaces,\n directives: directives,\n fields: fields,\n loc: this.loc(start)\n };\n }\n /**\n * InterfaceTypeExtension :\n * - extend interface Name ImplementsInterfaces? Directives[Const]? FieldsDefinition\n * - extend interface Name ImplementsInterfaces? Directives[Const]\n * - extend interface Name ImplementsInterfaces\n */\n ;\n\n _proto.parseInterfaceTypeExtension = function parseInterfaceTypeExtension() {\n var start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('interface');\n var name = this.parseName();\n var interfaces = this.parseImplementsInterfaces();\n var directives = this.parseDirectives(true);\n var fields = this.parseFieldsDefinition();\n\n if (interfaces.length === 0 && directives.length === 0 && fields.length === 0) {\n throw this.unexpected();\n }\n\n return {\n kind: Kind.INTERFACE_TYPE_EXTENSION,\n name: name,\n interfaces: interfaces,\n directives: directives,\n fields: fields,\n loc: this.loc(start)\n };\n }\n /**\n * UnionTypeExtension :\n * - extend union Name Directives[Const]? UnionMemberTypes\n * - extend union Name Directives[Const]\n */\n ;\n\n _proto.parseUnionTypeExtension = function parseUnionTypeExtension() {\n var start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('union');\n var name = this.parseName();\n var directives = this.parseDirectives(true);\n var types = this.parseUnionMemberTypes();\n\n if (directives.length === 0 && types.length === 0) {\n throw this.unexpected();\n }\n\n return {\n kind: Kind.UNION_TYPE_EXTENSION,\n name: name,\n directives: directives,\n types: types,\n loc: this.loc(start)\n };\n }\n /**\n * EnumTypeExtension :\n * - extend enum Name Directives[Const]? EnumValuesDefinition\n * - extend enum Name Directives[Const]\n */\n ;\n\n _proto.parseEnumTypeExtension = function parseEnumTypeExtension() {\n var start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('enum');\n var name = this.parseName();\n var directives = this.parseDirectives(true);\n var values = this.parseEnumValuesDefinition();\n\n if (directives.length === 0 && values.length === 0) {\n throw this.unexpected();\n }\n\n return {\n kind: Kind.ENUM_TYPE_EXTENSION,\n name: name,\n directives: directives,\n values: values,\n loc: this.loc(start)\n };\n }\n /**\n * InputObjectTypeExtension :\n * - extend input Name Directives[Const]? InputFieldsDefinition\n * - extend input Name Directives[Const]\n */\n ;\n\n _proto.parseInputObjectTypeExtension = function parseInputObjectTypeExtension() {\n var start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('input');\n var name = this.parseName();\n var directives = this.parseDirectives(true);\n var fields = this.parseInputFieldsDefinition();\n\n if (directives.length === 0 && fields.length === 0) {\n throw this.unexpected();\n }\n\n return {\n kind: Kind.INPUT_OBJECT_TYPE_EXTENSION,\n name: name,\n directives: directives,\n fields: fields,\n loc: this.loc(start)\n };\n }\n /**\n * DirectiveDefinition :\n * - Description? directive @ Name ArgumentsDefinition? `repeatable`? on DirectiveLocations\n */\n ;\n\n _proto.parseDirectiveDefinition = function parseDirectiveDefinition() {\n var start = this._lexer.token;\n var description = this.parseDescription();\n this.expectKeyword('directive');\n this.expectToken(TokenKind.AT);\n var name = this.parseName();\n var args = this.parseArgumentDefs();\n var repeatable = this.expectOptionalKeyword('repeatable');\n this.expectKeyword('on');\n var locations = this.parseDirectiveLocations();\n return {\n kind: Kind.DIRECTIVE_DEFINITION,\n description: description,\n name: name,\n arguments: args,\n repeatable: repeatable,\n locations: locations,\n loc: this.loc(start)\n };\n }\n /**\n * DirectiveLocations :\n * - `|`? DirectiveLocation\n * - DirectiveLocations | DirectiveLocation\n */\n ;\n\n _proto.parseDirectiveLocations = function parseDirectiveLocations() {\n return this.delimitedMany(TokenKind.PIPE, this.parseDirectiveLocation);\n }\n /*\n * DirectiveLocation :\n * - ExecutableDirectiveLocation\n * - TypeSystemDirectiveLocation\n *\n * ExecutableDirectiveLocation : one of\n * `QUERY`\n * `MUTATION`\n * `SUBSCRIPTION`\n * `FIELD`\n * `FRAGMENT_DEFINITION`\n * `FRAGMENT_SPREAD`\n * `INLINE_FRAGMENT`\n *\n * TypeSystemDirectiveLocation : one of\n * `SCHEMA`\n * `SCALAR`\n * `OBJECT`\n * `FIELD_DEFINITION`\n * `ARGUMENT_DEFINITION`\n * `INTERFACE`\n * `UNION`\n * `ENUM`\n * `ENUM_VALUE`\n * `INPUT_OBJECT`\n * `INPUT_FIELD_DEFINITION`\n */\n ;\n\n _proto.parseDirectiveLocation = function parseDirectiveLocation() {\n var start = this._lexer.token;\n var name = this.parseName();\n\n if (DirectiveLocation[name.value] !== undefined) {\n return name;\n }\n\n throw this.unexpected(start);\n } // Core parsing utility functions\n\n /**\n * Returns a location object, used to identify the place in the source that created a given parsed object.\n */\n ;\n\n _proto.loc = function loc(startToken) {\n var _this$_options4;\n\n if (((_this$_options4 = this._options) === null || _this$_options4 === void 0 ? void 0 : _this$_options4.noLocation) !== true) {\n return new Location(startToken, this._lexer.lastToken, this._lexer.source);\n }\n }\n /**\n * Determines if the next token is of a given kind\n */\n ;\n\n _proto.peek = function peek(kind) {\n return this._lexer.token.kind === kind;\n }\n /**\n * If the next token is of the given kind, return that token after advancing the lexer.\n * Otherwise, do not change the parser state and throw an error.\n */\n ;\n\n _proto.expectToken = function expectToken(kind) {\n var token = this._lexer.token;\n\n if (token.kind === kind) {\n this._lexer.advance();\n\n return token;\n }\n\n throw syntaxError(this._lexer.source, token.start, \"Expected \".concat(getTokenKindDesc(kind), \", found \").concat(getTokenDesc(token), \".\"));\n }\n /**\n * If the next token is of the given kind, return that token after advancing the lexer.\n * Otherwise, do not change the parser state and return undefined.\n */\n ;\n\n _proto.expectOptionalToken = function expectOptionalToken(kind) {\n var token = this._lexer.token;\n\n if (token.kind === kind) {\n this._lexer.advance();\n\n return token;\n }\n\n return undefined;\n }\n /**\n * If the next token is a given keyword, advance the lexer.\n * Otherwise, do not change the parser state and throw an error.\n */\n ;\n\n _proto.expectKeyword = function expectKeyword(value) {\n var token = this._lexer.token;\n\n if (token.kind === TokenKind.NAME && token.value === value) {\n this._lexer.advance();\n } else {\n throw syntaxError(this._lexer.source, token.start, \"Expected \\\"\".concat(value, \"\\\", found \").concat(getTokenDesc(token), \".\"));\n }\n }\n /**\n * If the next token is a given keyword, return \"true\" after advancing the lexer.\n * Otherwise, do not change the parser state and return \"false\".\n */\n ;\n\n _proto.expectOptionalKeyword = function expectOptionalKeyword(value) {\n var token = this._lexer.token;\n\n if (token.kind === TokenKind.NAME && token.value === value) {\n this._lexer.advance();\n\n return true;\n }\n\n return false;\n }\n /**\n * Helper function for creating an error when an unexpected lexed token is encountered.\n */\n ;\n\n _proto.unexpected = function unexpected(atToken) {\n var token = atToken !== null && atToken !== void 0 ? atToken : this._lexer.token;\n return syntaxError(this._lexer.source, token.start, \"Unexpected \".concat(getTokenDesc(token), \".\"));\n }\n /**\n * Returns a possibly empty list of parse nodes, determined by the parseFn.\n * This list begins with a lex token of openKind and ends with a lex token of closeKind.\n * Advances the parser to the next lex token after the closing token.\n */\n ;\n\n _proto.any = function any(openKind, parseFn, closeKind) {\n this.expectToken(openKind);\n var nodes = [];\n\n while (!this.expectOptionalToken(closeKind)) {\n nodes.push(parseFn.call(this));\n }\n\n return nodes;\n }\n /**\n * Returns a list of parse nodes, determined by the parseFn.\n * It can be empty only if open token is missing otherwise it will always return non-empty list\n * that begins with a lex token of openKind and ends with a lex token of closeKind.\n * Advances the parser to the next lex token after the closing token.\n */\n ;\n\n _proto.optionalMany = function optionalMany(openKind, parseFn, closeKind) {\n if (this.expectOptionalToken(openKind)) {\n var nodes = [];\n\n do {\n nodes.push(parseFn.call(this));\n } while (!this.expectOptionalToken(closeKind));\n\n return nodes;\n }\n\n return [];\n }\n /**\n * Returns a non-empty list of parse nodes, determined by the parseFn.\n * This list begins with a lex token of openKind and ends with a lex token of closeKind.\n * Advances the parser to the next lex token after the closing token.\n */\n ;\n\n _proto.many = function many(openKind, parseFn, closeKind) {\n this.expectToken(openKind);\n var nodes = [];\n\n do {\n nodes.push(parseFn.call(this));\n } while (!this.expectOptionalToken(closeKind));\n\n return nodes;\n }\n /**\n * Returns a non-empty list of parse nodes, determined by the parseFn.\n * This list may begin with a lex token of delimiterKind followed by items separated by lex tokens of tokenKind.\n * Advances the parser to the next lex token after last item in the list.\n */\n ;\n\n _proto.delimitedMany = function delimitedMany(delimiterKind, parseFn) {\n this.expectOptionalToken(delimiterKind);\n var nodes = [];\n\n do {\n nodes.push(parseFn.call(this));\n } while (this.expectOptionalToken(delimiterKind));\n\n return nodes;\n };\n\n return Parser;\n}();\n/**\n * A helper function to describe a token as a string for debugging.\n */\n\nfunction getTokenDesc(token) {\n var value = token.value;\n return getTokenKindDesc(token.kind) + (value != null ? \" \\\"\".concat(value, \"\\\"\") : '');\n}\n/**\n * A helper function to describe a token kind as a string for debugging.\n */\n\n\nfunction getTokenKindDesc(kind) {\n return isPunctuatorTokenKind(kind) ? \"\\\"\".concat(kind, \"\\\"\") : kind;\n}\n", "import inspect from \"../jsutils/inspect.mjs\";\nimport { isNode } from \"./ast.mjs\";\n/**\n * A visitor is provided to visit, it contains the collection of\n * relevant functions to be called during the visitor's traversal.\n */\n\nexport var QueryDocumentKeys = {\n Name: [],\n Document: ['definitions'],\n OperationDefinition: ['name', 'variableDefinitions', 'directives', 'selectionSet'],\n VariableDefinition: ['variable', 'type', 'defaultValue', 'directives'],\n Variable: ['name'],\n SelectionSet: ['selections'],\n Field: ['alias', 'name', 'arguments', 'directives', 'selectionSet'],\n Argument: ['name', 'value'],\n FragmentSpread: ['name', 'directives'],\n InlineFragment: ['typeCondition', 'directives', 'selectionSet'],\n FragmentDefinition: ['name', // Note: fragment variable definitions are experimental and may be changed\n // or removed in the future.\n 'variableDefinitions', 'typeCondition', 'directives', 'selectionSet'],\n IntValue: [],\n FloatValue: [],\n StringValue: [],\n BooleanValue: [],\n NullValue: [],\n EnumValue: [],\n ListValue: ['values'],\n ObjectValue: ['fields'],\n ObjectField: ['name', 'value'],\n Directive: ['name', 'arguments'],\n NamedType: ['name'],\n ListType: ['type'],\n NonNullType: ['type'],\n SchemaDefinition: ['description', 'directives', 'operationTypes'],\n OperationTypeDefinition: ['type'],\n ScalarTypeDefinition: ['description', 'name', 'directives'],\n ObjectTypeDefinition: ['description', 'name', 'interfaces', 'directives', 'fields'],\n FieldDefinition: ['description', 'name', 'arguments', 'type', 'directives'],\n InputValueDefinition: ['description', 'name', 'type', 'defaultValue', 'directives'],\n InterfaceTypeDefinition: ['description', 'name', 'interfaces', 'directives', 'fields'],\n UnionTypeDefinition: ['description', 'name', 'directives', 'types'],\n EnumTypeDefinition: ['description', 'name', 'directives', 'values'],\n EnumValueDefinition: ['description', 'name', 'directives'],\n InputObjectTypeDefinition: ['description', 'name', 'directives', 'fields'],\n DirectiveDefinition: ['description', 'name', 'arguments', 'locations'],\n SchemaExtension: ['directives', 'operationTypes'],\n ScalarTypeExtension: ['name', 'directives'],\n ObjectTypeExtension: ['name', 'interfaces', 'directives', 'fields'],\n InterfaceTypeExtension: ['name', 'interfaces', 'directives', 'fields'],\n UnionTypeExtension: ['name', 'directives', 'types'],\n EnumTypeExtension: ['name', 'directives', 'values'],\n InputObjectTypeExtension: ['name', 'directives', 'fields']\n};\nexport var BREAK = Object.freeze({});\n/**\n * visit() will walk through an AST using a depth-first traversal, calling\n * the visitor's enter function at each node in the traversal, and calling the\n * leave function after visiting that node and all of its child nodes.\n *\n * By returning different values from the enter and leave functions, the\n * behavior of the visitor can be altered, including skipping over a sub-tree of\n * the AST (by returning false), editing the AST by returning a value or null\n * to remove the value, or to stop the whole traversal by returning BREAK.\n *\n * When using visit() to edit an AST, the original AST will not be modified, and\n * a new version of the AST with the changes applied will be returned from the\n * visit function.\n *\n * const editedAST = visit(ast, {\n * enter(node, key, parent, path, ancestors) {\n * // @return\n * // undefined: no action\n * // false: skip visiting this node\n * // visitor.BREAK: stop visiting altogether\n * // null: delete this node\n * // any value: replace this node with the returned value\n * },\n * leave(node, key, parent, path, ancestors) {\n * // @return\n * // undefined: no action\n * // false: no action\n * // visitor.BREAK: stop visiting altogether\n * // null: delete this node\n * // any value: replace this node with the returned value\n * }\n * });\n *\n * Alternatively to providing enter() and leave() functions, a visitor can\n * instead provide functions named the same as the kinds of AST nodes, or\n * enter/leave visitors at a named key, leading to four permutations of the\n * visitor API:\n *\n * 1) Named visitors triggered when entering a node of a specific kind.\n *\n * visit(ast, {\n * Kind(node) {\n * // enter the \"Kind\" node\n * }\n * })\n *\n * 2) Named visitors that trigger upon entering and leaving a node of\n * a specific kind.\n *\n * visit(ast, {\n * Kind: {\n * enter(node) {\n * // enter the \"Kind\" node\n * }\n * leave(node) {\n * // leave the \"Kind\" node\n * }\n * }\n * })\n *\n * 3) Generic visitors that trigger upon entering and leaving any node.\n *\n * visit(ast, {\n * enter(node) {\n * // enter any node\n * },\n * leave(node) {\n * // leave any node\n * }\n * })\n *\n * 4) Parallel visitors for entering and leaving nodes of a specific kind.\n *\n * visit(ast, {\n * enter: {\n * Kind(node) {\n * // enter the \"Kind\" node\n * }\n * },\n * leave: {\n * Kind(node) {\n * // leave the \"Kind\" node\n * }\n * }\n * })\n */\n\nexport function visit(root, visitor) {\n var visitorKeys = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : QueryDocumentKeys;\n\n /* eslint-disable no-undef-init */\n var stack = undefined;\n var inArray = Array.isArray(root);\n var keys = [root];\n var index = -1;\n var edits = [];\n var node = undefined;\n var key = undefined;\n var parent = undefined;\n var path = [];\n var ancestors = [];\n var newRoot = root;\n /* eslint-enable no-undef-init */\n\n do {\n index++;\n var isLeaving = index === keys.length;\n var isEdited = isLeaving && edits.length !== 0;\n\n if (isLeaving) {\n key = ancestors.length === 0 ? undefined : path[path.length - 1];\n node = parent;\n parent = ancestors.pop();\n\n if (isEdited) {\n if (inArray) {\n node = node.slice();\n } else {\n var clone = {};\n\n for (var _i2 = 0, _Object$keys2 = Object.keys(node); _i2 < _Object$keys2.length; _i2++) {\n var k = _Object$keys2[_i2];\n clone[k] = node[k];\n }\n\n node = clone;\n }\n\n var editOffset = 0;\n\n for (var ii = 0; ii < edits.length; ii++) {\n var editKey = edits[ii][0];\n var editValue = edits[ii][1];\n\n if (inArray) {\n editKey -= editOffset;\n }\n\n if (inArray && editValue === null) {\n node.splice(editKey, 1);\n editOffset++;\n } else {\n node[editKey] = editValue;\n }\n }\n }\n\n index = stack.index;\n keys = stack.keys;\n edits = stack.edits;\n inArray = stack.inArray;\n stack = stack.prev;\n } else {\n key = parent ? inArray ? index : keys[index] : undefined;\n node = parent ? parent[key] : newRoot;\n\n if (node === null || node === undefined) {\n continue;\n }\n\n if (parent) {\n path.push(key);\n }\n }\n\n var result = void 0;\n\n if (!Array.isArray(node)) {\n if (!isNode(node)) {\n throw new Error(\"Invalid AST Node: \".concat(inspect(node), \".\"));\n }\n\n var visitFn = getVisitFn(visitor, node.kind, isLeaving);\n\n if (visitFn) {\n result = visitFn.call(visitor, node, key, parent, path, ancestors);\n\n if (result === BREAK) {\n break;\n }\n\n if (result === false) {\n if (!isLeaving) {\n path.pop();\n continue;\n }\n } else if (result !== undefined) {\n edits.push([key, result]);\n\n if (!isLeaving) {\n if (isNode(result)) {\n node = result;\n } else {\n path.pop();\n continue;\n }\n }\n }\n }\n }\n\n if (result === undefined && isEdited) {\n edits.push([key, node]);\n }\n\n if (isLeaving) {\n path.pop();\n } else {\n var _visitorKeys$node$kin;\n\n stack = {\n inArray: inArray,\n index: index,\n keys: keys,\n edits: edits,\n prev: stack\n };\n inArray = Array.isArray(node);\n keys = inArray ? node : (_visitorKeys$node$kin = visitorKeys[node.kind]) !== null && _visitorKeys$node$kin !== void 0 ? _visitorKeys$node$kin : [];\n index = -1;\n edits = [];\n\n if (parent) {\n ancestors.push(parent);\n }\n\n parent = node;\n }\n } while (stack !== undefined);\n\n if (edits.length !== 0) {\n newRoot = edits[edits.length - 1][1];\n }\n\n return newRoot;\n}\n/**\n * Creates a new visitor instance which delegates to many visitors to run in\n * parallel. Each visitor will be visited for each node before moving on.\n *\n * If a prior visitor edits a node, no following visitors will see that node.\n */\n\nexport function visitInParallel(visitors) {\n var skipping = new Array(visitors.length);\n return {\n enter: function enter(node) {\n for (var i = 0; i < visitors.length; i++) {\n if (skipping[i] == null) {\n var fn = getVisitFn(visitors[i], node.kind,\n /* isLeaving */\n false);\n\n if (fn) {\n var result = fn.apply(visitors[i], arguments);\n\n if (result === false) {\n skipping[i] = node;\n } else if (result === BREAK) {\n skipping[i] = BREAK;\n } else if (result !== undefined) {\n return result;\n }\n }\n }\n }\n },\n leave: function leave(node) {\n for (var i = 0; i < visitors.length; i++) {\n if (skipping[i] == null) {\n var fn = getVisitFn(visitors[i], node.kind,\n /* isLeaving */\n true);\n\n if (fn) {\n var result = fn.apply(visitors[i], arguments);\n\n if (result === BREAK) {\n skipping[i] = BREAK;\n } else if (result !== undefined && result !== false) {\n return result;\n }\n }\n } else if (skipping[i] === node) {\n skipping[i] = null;\n }\n }\n }\n };\n}\n/**\n * Given a visitor instance, if it is leaving or not, and a node kind, return\n * the function the visitor runtime should call.\n */\n\nexport function getVisitFn(visitor, kind, isLeaving) {\n var kindVisitor = visitor[kind];\n\n if (kindVisitor) {\n if (!isLeaving && typeof kindVisitor === 'function') {\n // { Kind() {} }\n return kindVisitor;\n }\n\n var kindSpecificVisitor = isLeaving ? kindVisitor.leave : kindVisitor.enter;\n\n if (typeof kindSpecificVisitor === 'function') {\n // { Kind: { enter() {}, leave() {} } }\n return kindSpecificVisitor;\n }\n } else {\n var specificVisitor = isLeaving ? visitor.leave : visitor.enter;\n\n if (specificVisitor) {\n if (typeof specificVisitor === 'function') {\n // { enter() {}, leave() {} }\n return specificVisitor;\n }\n\n var specificKindVisitor = specificVisitor[kind];\n\n if (typeof specificKindVisitor === 'function') {\n // { enter: { Kind() {} }, leave: { Kind() {} } }\n return specificKindVisitor;\n }\n }\n }\n}\n", "import { visit } from \"./visitor.mjs\";\nimport { printBlockString } from \"./blockString.mjs\";\n/**\n * Converts an AST into a string, using one set of reasonable\n * formatting rules.\n */\n\nexport function print(ast) {\n return visit(ast, {\n leave: printDocASTReducer\n });\n}\nvar MAX_LINE_LENGTH = 80; // TODO: provide better type coverage in future\n\nvar printDocASTReducer = {\n Name: function Name(node) {\n return node.value;\n },\n Variable: function Variable(node) {\n return '$' + node.name;\n },\n // Document\n Document: function Document(node) {\n return join(node.definitions, '\\n\\n') + '\\n';\n },\n OperationDefinition: function OperationDefinition(node) {\n var op = node.operation;\n var name = node.name;\n var varDefs = wrap('(', join(node.variableDefinitions, ', '), ')');\n var directives = join(node.directives, ' ');\n var selectionSet = node.selectionSet; // Anonymous queries with no directives or variable definitions can use\n // the query short form.\n\n return !name && !directives && !varDefs && op === 'query' ? selectionSet : join([op, join([name, varDefs]), directives, selectionSet], ' ');\n },\n VariableDefinition: function VariableDefinition(_ref) {\n var variable = _ref.variable,\n type = _ref.type,\n defaultValue = _ref.defaultValue,\n directives = _ref.directives;\n return variable + ': ' + type + wrap(' = ', defaultValue) + wrap(' ', join(directives, ' '));\n },\n SelectionSet: function SelectionSet(_ref2) {\n var selections = _ref2.selections;\n return block(selections);\n },\n Field: function Field(_ref3) {\n var alias = _ref3.alias,\n name = _ref3.name,\n args = _ref3.arguments,\n directives = _ref3.directives,\n selectionSet = _ref3.selectionSet;\n var prefix = wrap('', alias, ': ') + name;\n var argsLine = prefix + wrap('(', join(args, ', '), ')');\n\n if (argsLine.length > MAX_LINE_LENGTH) {\n argsLine = prefix + wrap('(\\n', indent(join(args, '\\n')), '\\n)');\n }\n\n return join([argsLine, join(directives, ' '), selectionSet], ' ');\n },\n Argument: function Argument(_ref4) {\n var name = _ref4.name,\n value = _ref4.value;\n return name + ': ' + value;\n },\n // Fragments\n FragmentSpread: function FragmentSpread(_ref5) {\n var name = _ref5.name,\n directives = _ref5.directives;\n return '...' + name + wrap(' ', join(directives, ' '));\n },\n InlineFragment: function InlineFragment(_ref6) {\n var typeCondition = _ref6.typeCondition,\n directives = _ref6.directives,\n selectionSet = _ref6.selectionSet;\n return join(['...', wrap('on ', typeCondition), join(directives, ' '), selectionSet], ' ');\n },\n FragmentDefinition: function FragmentDefinition(_ref7) {\n var name = _ref7.name,\n typeCondition = _ref7.typeCondition,\n variableDefinitions = _ref7.variableDefinitions,\n directives = _ref7.directives,\n selectionSet = _ref7.selectionSet;\n return (// Note: fragment variable definitions are experimental and may be changed\n // or removed in the future.\n \"fragment \".concat(name).concat(wrap('(', join(variableDefinitions, ', '), ')'), \" \") + \"on \".concat(typeCondition, \" \").concat(wrap('', join(directives, ' '), ' ')) + selectionSet\n );\n },\n // Value\n IntValue: function IntValue(_ref8) {\n var value = _ref8.value;\n return value;\n },\n FloatValue: function FloatValue(_ref9) {\n var value = _ref9.value;\n return value;\n },\n StringValue: function StringValue(_ref10, key) {\n var value = _ref10.value,\n isBlockString = _ref10.block;\n return isBlockString ? printBlockString(value, key === 'description' ? '' : ' ') : JSON.stringify(value);\n },\n BooleanValue: function BooleanValue(_ref11) {\n var value = _ref11.value;\n return value ? 'true' : 'false';\n },\n NullValue: function NullValue() {\n return 'null';\n },\n EnumValue: function EnumValue(_ref12) {\n var value = _ref12.value;\n return value;\n },\n ListValue: function ListValue(_ref13) {\n var values = _ref13.values;\n return '[' + join(values, ', ') + ']';\n },\n ObjectValue: function ObjectValue(_ref14) {\n var fields = _ref14.fields;\n return '{' + join(fields, ', ') + '}';\n },\n ObjectField: function ObjectField(_ref15) {\n var name = _ref15.name,\n value = _ref15.value;\n return name + ': ' + value;\n },\n // Directive\n Directive: function Directive(_ref16) {\n var name = _ref16.name,\n args = _ref16.arguments;\n return '@' + name + wrap('(', join(args, ', '), ')');\n },\n // Type\n NamedType: function NamedType(_ref17) {\n var name = _ref17.name;\n return name;\n },\n ListType: function ListType(_ref18) {\n var type = _ref18.type;\n return '[' + type + ']';\n },\n NonNullType: function NonNullType(_ref19) {\n var type = _ref19.type;\n return type + '!';\n },\n // Type System Definitions\n SchemaDefinition: addDescription(function (_ref20) {\n var directives = _ref20.directives,\n operationTypes = _ref20.operationTypes;\n return join(['schema', join(directives, ' '), block(operationTypes)], ' ');\n }),\n OperationTypeDefinition: function OperationTypeDefinition(_ref21) {\n var operation = _ref21.operation,\n type = _ref21.type;\n return operation + ': ' + type;\n },\n ScalarTypeDefinition: addDescription(function (_ref22) {\n var name = _ref22.name,\n directives = _ref22.directives;\n return join(['scalar', name, join(directives, ' ')], ' ');\n }),\n ObjectTypeDefinition: addDescription(function (_ref23) {\n var name = _ref23.name,\n interfaces = _ref23.interfaces,\n directives = _ref23.directives,\n fields = _ref23.fields;\n return join(['type', name, wrap('implements ', join(interfaces, ' & ')), join(directives, ' '), block(fields)], ' ');\n }),\n FieldDefinition: addDescription(function (_ref24) {\n var name = _ref24.name,\n args = _ref24.arguments,\n type = _ref24.type,\n directives = _ref24.directives;\n return name + (hasMultilineItems(args) ? wrap('(\\n', indent(join(args, '\\n')), '\\n)') : wrap('(', join(args, ', '), ')')) + ': ' + type + wrap(' ', join(directives, ' '));\n }),\n InputValueDefinition: addDescription(function (_ref25) {\n var name = _ref25.name,\n type = _ref25.type,\n defaultValue = _ref25.defaultValue,\n directives = _ref25.directives;\n return join([name + ': ' + type, wrap('= ', defaultValue), join(directives, ' ')], ' ');\n }),\n InterfaceTypeDefinition: addDescription(function (_ref26) {\n var name = _ref26.name,\n interfaces = _ref26.interfaces,\n directives = _ref26.directives,\n fields = _ref26.fields;\n return join(['interface', name, wrap('implements ', join(interfaces, ' & ')), join(directives, ' '), block(fields)], ' ');\n }),\n UnionTypeDefinition: addDescription(function (_ref27) {\n var name = _ref27.name,\n directives = _ref27.directives,\n types = _ref27.types;\n return join(['union', name, join(directives, ' '), types && types.length !== 0 ? '= ' + join(types, ' | ') : ''], ' ');\n }),\n EnumTypeDefinition: addDescription(function (_ref28) {\n var name = _ref28.name,\n directives = _ref28.directives,\n values = _ref28.values;\n return join(['enum', name, join(directives, ' '), block(values)], ' ');\n }),\n EnumValueDefinition: addDescription(function (_ref29) {\n var name = _ref29.name,\n directives = _ref29.directives;\n return join([name, join(directives, ' ')], ' ');\n }),\n InputObjectTypeDefinition: addDescription(function (_ref30) {\n var name = _ref30.name,\n directives = _ref30.directives,\n fields = _ref30.fields;\n return join(['input', name, join(directives, ' '), block(fields)], ' ');\n }),\n DirectiveDefinition: addDescription(function (_ref31) {\n var name = _ref31.name,\n args = _ref31.arguments,\n repeatable = _ref31.repeatable,\n locations = _ref31.locations;\n return 'directive @' + name + (hasMultilineItems(args) ? wrap('(\\n', indent(join(args, '\\n')), '\\n)') : wrap('(', join(args, ', '), ')')) + (repeatable ? ' repeatable' : '') + ' on ' + join(locations, ' | ');\n }),\n SchemaExtension: function SchemaExtension(_ref32) {\n var directives = _ref32.directives,\n operationTypes = _ref32.operationTypes;\n return join(['extend schema', join(directives, ' '), block(operationTypes)], ' ');\n },\n ScalarTypeExtension: function ScalarTypeExtension(_ref33) {\n var name = _ref33.name,\n directives = _ref33.directives;\n return join(['extend scalar', name, join(directives, ' ')], ' ');\n },\n ObjectTypeExtension: function ObjectTypeExtension(_ref34) {\n var name = _ref34.name,\n interfaces = _ref34.interfaces,\n directives = _ref34.directives,\n fields = _ref34.fields;\n return join(['extend type', name, wrap('implements ', join(interfaces, ' & ')), join(directives, ' '), block(fields)], ' ');\n },\n InterfaceTypeExtension: function InterfaceTypeExtension(_ref35) {\n var name = _ref35.name,\n interfaces = _ref35.interfaces,\n directives = _ref35.directives,\n fields = _ref35.fields;\n return join(['extend interface', name, wrap('implements ', join(interfaces, ' & ')), join(directives, ' '), block(fields)], ' ');\n },\n UnionTypeExtension: function UnionTypeExtension(_ref36) {\n var name = _ref36.name,\n directives = _ref36.directives,\n types = _ref36.types;\n return join(['extend union', name, join(directives, ' '), types && types.length !== 0 ? '= ' + join(types, ' | ') : ''], ' ');\n },\n EnumTypeExtension: function EnumTypeExtension(_ref37) {\n var name = _ref37.name,\n directives = _ref37.directives,\n values = _ref37.values;\n return join(['extend enum', name, join(directives, ' '), block(values)], ' ');\n },\n InputObjectTypeExtension: function InputObjectTypeExtension(_ref38) {\n var name = _ref38.name,\n directives = _ref38.directives,\n fields = _ref38.fields;\n return join(['extend input', name, join(directives, ' '), block(fields)], ' ');\n }\n};\n\nfunction addDescription(cb) {\n return function (node) {\n return join([node.description, cb(node)], '\\n');\n };\n}\n/**\n * Given maybeArray, print an empty string if it is null or empty, otherwise\n * print all items together separated by separator if provided\n */\n\n\nfunction join(maybeArray) {\n var _maybeArray$filter$jo;\n\n var separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';\n return (_maybeArray$filter$jo = maybeArray === null || maybeArray === void 0 ? void 0 : maybeArray.filter(function (x) {\n return x;\n }).join(separator)) !== null && _maybeArray$filter$jo !== void 0 ? _maybeArray$filter$jo : '';\n}\n/**\n * Given array, print each item on its own line, wrapped in an\n * indented \"{ }\" block.\n */\n\n\nfunction block(array) {\n return wrap('{\\n', indent(join(array, '\\n')), '\\n}');\n}\n/**\n * If maybeString is not null or empty, then wrap with start and end, otherwise print an empty string.\n */\n\n\nfunction wrap(start, maybeString) {\n var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : '';\n return maybeString != null && maybeString !== '' ? start + maybeString + end : '';\n}\n\nfunction indent(str) {\n return wrap(' ', str.replace(/\\n/g, '\\n '));\n}\n\nfunction isMultiline(str) {\n return str.indexOf('\\n') !== -1;\n}\n\nfunction hasMultilineItems(maybeArray) {\n return maybeArray != null && maybeArray.some(isMultiline);\n}\n", "// Provides the methods that allow QueryManager to handle the `skip` and\n// `include` directives within GraphQL.\nimport {\n SelectionNode,\n VariableNode,\n BooleanValueNode,\n DirectiveNode,\n DocumentNode,\n ArgumentNode,\n ValueNode,\n ASTNode,\n visit,\n} from 'graphql';\n\nimport { invariant } from 'ts-invariant';\n\nexport type DirectiveInfo = {\n [fieldName: string]: { [argName: string]: any };\n};\n\nexport function shouldInclude(\n { directives }: SelectionNode,\n variables?: Record<string, any>,\n): boolean {\n if (!directives || !directives.length) {\n return true;\n }\n return getInclusionDirectives(\n directives\n ).every(({ directive, ifArgument }) => {\n let evaledValue: boolean = false;\n if (ifArgument.value.kind === 'Variable') {\n evaledValue = variables && variables[(ifArgument.value as VariableNode).name.value];\n invariant(\n evaledValue !== void 0,\n `Invalid variable referenced in @${directive.name.value} directive.`,\n );\n } else {\n evaledValue = (ifArgument.value as BooleanValueNode).value;\n }\n return directive.name.value === 'skip' ? !evaledValue : evaledValue;\n });\n}\n\nexport function getDirectiveNames(root: ASTNode) {\n const names: string[] = [];\n\n visit(root, {\n Directive(node: DirectiveNode) {\n names.push(node.name.value);\n },\n });\n\n return names;\n}\n\nexport function hasDirectives(names: string[], root: ASTNode) {\n return getDirectiveNames(root).some(\n (name: string) => names.indexOf(name) > -1,\n );\n}\n\nexport function hasClientExports(document: DocumentNode) {\n return (\n document &&\n hasDirectives(['client'], document) &&\n hasDirectives(['export'], document)\n );\n}\n\nexport type InclusionDirectives = Array<{\n directive: DirectiveNode;\n ifArgument: ArgumentNode;\n}>;\n\nfunction isInclusionDirective({ name: { value } }: DirectiveNode): boolean {\n return value === 'skip' || value === 'include';\n}\n\nexport function getInclusionDirectives(\n directives: ReadonlyArray<DirectiveNode>,\n): InclusionDirectives {\n const result: InclusionDirectives = [];\n\n if (directives && directives.length) {\n directives.forEach(directive => {\n if (!isInclusionDirective(directive)) return;\n\n const directiveArguments = directive.arguments;\n const directiveName = directive.name.value;\n\n invariant(\n directiveArguments && directiveArguments.length === 1,\n `Incorrect number of arguments for the @${directiveName} directive.`,\n );\n\n const ifArgument = directiveArguments![0];\n invariant(\n ifArgument.name && ifArgument.name.value === 'if',\n `Invalid argument for the @${directiveName} directive.`,\n );\n\n const ifValue: ValueNode = ifArgument.value;\n\n // means it has to be a variable value if this is a valid @skip or @include directive\n invariant(\n ifValue &&\n (ifValue.kind === 'Variable' || ifValue.kind === 'BooleanValue'),\n `Argument for the @${directiveName} directive must be a variable or a boolean value.`,\n );\n\n result.push({ directive, ifArgument });\n });\n }\n\n return result;\n}\n\n", "import {\n DocumentNode,\n FragmentDefinitionNode,\n InlineFragmentNode,\n SelectionNode\n} from 'graphql';\nimport { invariant, InvariantError } from 'ts-invariant';\n\n/**\n * Returns a query document which adds a single query operation that only\n * spreads the target fragment inside of it.\n *\n * So for example a document of:\n *\n * ```graphql\n * fragment foo on Foo { a b c }\n * ```\n *\n * Turns into:\n *\n * ```graphql\n * { ...foo }\n *\n * fragment foo on Foo { a b c }\n * ```\n *\n * The target fragment will either be the only fragment in the document, or a\n * fragment specified by the provided `fragmentName`. If there is more than one\n * fragment, but a `fragmentName` was not defined then an error will be thrown.\n */\nexport function getFragmentQueryDocument(\n document: DocumentNode,\n fragmentName?: string,\n): DocumentNode {\n let actualFragmentName = fragmentName;\n\n // Build an array of all our fragment definitions that will be used for\n // validations. We also do some validations on the other definitions in the\n // document while building this list.\n const fragments: Array<FragmentDefinitionNode> = [];\n document.definitions.forEach(definition => {\n // Throw an error if we encounter an operation definition because we will\n // define our own operation definition later on.\n if (definition.kind === 'OperationDefinition') {\n throw new InvariantError(\n `Found a ${definition.operation} operation${\n definition.name ? ` named '${definition.name.value}'` : ''\n }. ` +\n 'No operations are allowed when using a fragment as a query. Only fragments are allowed.',\n );\n }\n // Add our definition to the fragments array if it is a fragment\n // definition.\n if (definition.kind === 'FragmentDefinition') {\n fragments.push(definition);\n }\n });\n\n // If the user did not give us a fragment name then let us try to get a\n // name from a single fragment in the definition.\n if (typeof actualFragmentName === 'undefined') {\n invariant(\n fragments.length === 1,\n `Found ${\n fragments.length\n } fragments. \\`fragmentName\\` must be provided when there is not exactly 1 fragment.`,\n );\n actualFragmentName = fragments[0].name.value;\n }\n\n // Generate a query document with an operation that simply spreads the\n // fragment inside of it.\n const query: DocumentNode = {\n ...document,\n definitions: [\n {\n kind: 'OperationDefinition',\n operation: 'query',\n selectionSet: {\n kind: 'SelectionSet',\n selections: [\n {\n kind: 'FragmentSpread',\n name: {\n kind: 'Name',\n value: actualFragmentName,\n },\n },\n ],\n },\n },\n ...document.definitions,\n ],\n };\n\n return query;\n}\n\n/**\n * This is an interface that describes a map from fragment names to fragment definitions.\n */\nexport interface FragmentMap {\n [fragmentName: string]: FragmentDefinitionNode;\n}\n\n// Utility function that takes a list of fragment definitions and makes a hash out of them\n// that maps the name of the fragment to the fragment definition.\nexport function createFragmentMap(\n fragments: FragmentDefinitionNode[] = [],\n): FragmentMap {\n const symTable: FragmentMap = {};\n fragments.forEach(fragment => {\n symTable[fragment.name.value] = fragment;\n });\n return symTable;\n}\n\nexport function getFragmentFromSelection(\n selection: SelectionNode,\n fragmentMap?: FragmentMap,\n): InlineFragmentNode | FragmentDefinitionNode | null {\n switch (selection.kind) {\n case 'InlineFragment':\n return selection;\n case 'FragmentSpread': {\n const fragment = fragmentMap && fragmentMap[selection.name.value];\n invariant(fragment, `No fragment named ${selection.name.value}.`);\n return fragment!;\n }\n default:\n return null;\n }\n}\n", "import {\n DirectiveNode,\n FieldNode,\n IntValueNode,\n FloatValueNode,\n StringValueNode,\n BooleanValueNode,\n ObjectValueNode,\n ListValueNode,\n EnumValueNode,\n NullValueNode,\n VariableNode,\n InlineFragmentNode,\n ValueNode,\n SelectionNode,\n NameNode,\n SelectionSetNode,\n} from 'graphql';\n\nimport stringify from 'fast-json-stable-stringify';\nimport { InvariantError } from 'ts-invariant';\nimport { FragmentMap, getFragmentFromSelection } from './fragments';\n\nexport interface Reference {\n readonly __ref: string;\n}\n\nexport function makeReference(id: string): Reference {\n return { __ref: String(id) };\n}\n\nexport function isReference(obj: any): obj is Reference {\n return Boolean(obj && typeof obj === 'object' && typeof obj.__ref === 'string');\n}\n\nexport type StoreValue =\n | number\n | string\n | string[]\n | Reference\n | Reference[]\n | null\n | undefined\n | void\n | Object;\n\nexport interface StoreObject {\n __typename?: string;\n [storeFieldName: string]: StoreValue;\n}\n\nfunction isStringValue(value: ValueNode): value is StringValueNode {\n return value.kind === 'StringValue';\n}\n\nfunction isBooleanValue(value: ValueNode): value is BooleanValueNode {\n return value.kind === 'BooleanValue';\n}\n\nfunction isIntValue(value: ValueNode): value is IntValueNode {\n return value.kind === 'IntValue';\n}\n\nfunction isFloatValue(value: ValueNode): value is FloatValueNode {\n return value.kind === 'FloatValue';\n}\n\nfunction isVariable(value: ValueNode): value is VariableNode {\n return value.kind === 'Variable';\n}\n\nfunction isObjectValue(value: ValueNode): value is ObjectValueNode {\n return value.kind === 'ObjectValue';\n}\n\nfunction isListValue(value: ValueNode): value is ListValueNode {\n return value.kind === 'ListValue';\n}\n\nfunction isEnumValue(value: ValueNode): value is EnumValueNode {\n return value.kind === 'EnumValue';\n}\n\nfunction isNullValue(value: ValueNode): value is NullValueNode {\n return value.kind === 'NullValue';\n}\n\nexport function valueToObjectRepresentation(\n argObj: any,\n name: NameNode,\n value: ValueNode,\n variables?: Object,\n) {\n if (isIntValue(value) || isFloatValue(value)) {\n argObj[name.value] = Number(value.value);\n } else if (isBooleanValue(value) || isStringValue(value)) {\n argObj[name.value] = value.value;\n } else if (isObjectValue(value)) {\n const nestedArgObj = {};\n value.fields.map(obj =>\n valueToObjectRepresentation(nestedArgObj, obj.name, obj.value, variables),\n );\n argObj[name.value] = nestedArgObj;\n } else if (isVariable(value)) {\n const variableValue = (variables || ({} as any))[value.name.value];\n argObj[name.value] = variableValue;\n } else if (isListValue(value)) {\n argObj[name.value] = value.values.map(listValue => {\n const nestedArgArrayObj = {};\n valueToObjectRepresentation(\n nestedArgArrayObj,\n name,\n listValue,\n variables,\n );\n return (nestedArgArrayObj as any)[name.value];\n });\n } else if (isEnumValue(value)) {\n argObj[name.value] = (value as EnumValueNode).value;\n } else if (isNullValue(value)) {\n argObj[name.value] = null;\n } else {\n throw new InvariantError(\n `The inline argument \"${name.value}\" of kind \"${(value as any).kind}\"` +\n 'is not supported. Use variables instead of inline arguments to ' +\n 'overcome this limitation.',\n );\n }\n}\n\nexport function storeKeyNameFromField(\n field: FieldNode,\n variables?: Object,\n): string {\n let directivesObj: any = null;\n if (field.directives) {\n directivesObj = {};\n field.directives.forEach(directive => {\n directivesObj[directive.name.value] = {};\n\n if (directive.arguments) {\n directive.arguments.forEach(({ name, value }) =>\n valueToObjectRepresentation(\n directivesObj[directive.name.value],\n name,\n value,\n variables,\n ),\n );\n }\n });\n }\n\n let argObj: any = null;\n if (field.arguments && field.arguments.length) {\n argObj = {};\n field.arguments.forEach(({ name, value }) =>\n valueToObjectRepresentation(argObj, name, value, variables),\n );\n }\n\n return getStoreKeyName(field.name.value, argObj, directivesObj);\n}\n\nexport type Directives = {\n [directiveName: string]: {\n [argName: string]: any;\n };\n};\n\nconst KNOWN_DIRECTIVES: string[] = [\n 'connection',\n 'include',\n 'skip',\n 'client',\n 'rest',\n 'export',\n];\n\nexport function getStoreKeyName(\n fieldName: string,\n args?: Record<string, any> | null,\n directives?: Directives,\n): string {\n if (\n args &&\n directives &&\n directives['connection'] &&\n directives['connection']['key']\n ) {\n if (\n directives['connection']['filter'] &&\n (directives['connection']['filter'] as string[]).length > 0\n ) {\n const filterKeys = directives['connection']['filter']\n ? (directives['connection']['filter'] as string[])\n : [];\n filterKeys.sort();\n\n const filteredArgs = {} as { [key: string]: any };\n filterKeys.forEach(key => {\n filteredArgs[key] = args[key];\n });\n\n return `${directives['connection']['key']}(${JSON.stringify(\n filteredArgs,\n )})`;\n } else {\n return directives['connection']['key'];\n }\n }\n\n let completeFieldName: string = fieldName;\n\n if (args) {\n // We can't use `JSON.stringify` here since it's non-deterministic,\n // and can lead to different store key names being created even though\n // the `args` object used during creation has the same properties/values.\n const stringifiedArgs: string = stringify(args);\n completeFieldName += `(${stringifiedArgs})`;\n }\n\n if (directives) {\n Object.keys(directives).forEach(key => {\n if (KNOWN_DIRECTIVES.indexOf(key) !== -1) return;\n if (directives[key] && Object.keys(directives[key]).length) {\n completeFieldName += `@${key}(${JSON.stringify(directives[key])})`;\n } else {\n completeFieldName += `@${key}`;\n }\n });\n }\n\n return completeFieldName;\n}\n\nexport function argumentsObjectFromField(\n field: FieldNode | DirectiveNode,\n variables?: Record<string, any>,\n): Object | null {\n if (field.arguments && field.arguments.length) {\n const argObj: Object = {};\n field.arguments.forEach(({ name, value }) =>\n valueToObjectRepresentation(argObj, name, value, variables),\n );\n return argObj;\n }\n return null;\n}\n\nexport function resultKeyNameFromField(field: FieldNode): string {\n return field.alias ? field.alias.value : field.name.value;\n}\n\nexport function getTypenameFromResult(\n result: Record<string, any>,\n selectionSet: SelectionSetNode,\n fragmentMap?: FragmentMap,\n): string | undefined {\n if (typeof result.__typename === 'string') {\n return result.__typename;\n }\n\n for (const selection of selectionSet.selections) {\n if (isField(selection)) {\n if (selection.name.value === '__typename') {\n return result[resultKeyNameFromField(selection)];\n }\n } else {\n const typename = getTypenameFromResult(\n result,\n getFragmentFromSelection(selection, fragmentMap)!.selectionSet,\n fragmentMap,\n );\n if (typeof typename === 'string') {\n return typename;\n }\n }\n }\n}\n\nexport function isField(selection: SelectionNode): selection is FieldNode {\n return selection.kind === 'Field';\n}\n\nexport function isInlineFragment(\n selection: SelectionNode,\n): selection is InlineFragmentNode {\n return selection.kind === 'InlineFragment';\n}\n\nexport type VariableValue = (node: VariableNode) => any;\n", "import {\n DocumentNode,\n OperationDefinitionNode,\n FragmentDefinitionNode,\n ValueNode,\n} from 'graphql';\n\nimport { invariant, InvariantError } from 'ts-invariant';\n\nimport { valueToObjectRepresentation } from './storeUtils';\n\n// Checks the document for errors and throws an exception if there is an error.\nexport function checkDocument(doc: DocumentNode) {\n invariant(\n doc && doc.kind === 'Document',\n `Expecting a parsed GraphQL document. Perhaps you need to wrap the query \\\nstring in a \"gql\" tag? http://docs.apollostack.com/apollo-client/core.html#gql`,\n );\n\n const operations = doc.definitions\n .filter(d => d.kind !== 'FragmentDefinition')\n .map(definition => {\n if (definition.kind !== 'OperationDefinition') {\n throw new InvariantError(\n `Schema type definitions not allowed in queries. Found: \"${\n definition.kind\n }\"`,\n );\n }\n return definition;\n });\n\n invariant(\n operations.length <= 1,\n `Ambiguous GraphQL document: contains ${operations.length} operations`,\n );\n\n return doc;\n}\n\nexport function getOperationDefinition(\n doc: DocumentNode,\n): OperationDefinitionNode | undefined {\n checkDocument(doc);\n return doc.definitions.filter(\n definition => definition.kind === 'OperationDefinition',\n )[0] as OperationDefinitionNode;\n}\n\nexport function getOperationName(doc: DocumentNode): string | null {\n return (\n doc.definitions\n .filter(\n definition =>\n definition.kind === 'OperationDefinition' && definition.name,\n )\n .map((x: OperationDefinitionNode) => x!.name!.value)[0] || null\n );\n}\n\n// Returns the FragmentDefinitions from a particular document as an array\nexport function getFragmentDefinitions(\n doc: DocumentNode,\n): FragmentDefinitionNode[] {\n return doc.definitions.filter(\n definition => definition.kind === 'FragmentDefinition',\n ) as FragmentDefinitionNode[];\n}\n\nexport function getQueryDefinition(doc: DocumentNode): OperationDefinitionNode {\n const queryDef = getOperationDefinition(doc) as OperationDefinitionNode;\n\n invariant(\n queryDef && queryDef.operation === 'query',\n 'Must contain a query definition.',\n );\n\n return queryDef;\n}\n\nexport function getFragmentDefinition(\n doc: DocumentNode,\n): FragmentDefinitionNode {\n invariant(\n doc.kind === 'Document',\n `Expecting a parsed GraphQL document. Perhaps you need to wrap the query \\\nstring in a \"gql\" tag? http://docs.apollostack.com/apollo-client/core.html#gql`,\n );\n\n invariant(\n doc.definitions.length <= 1,\n 'Fragment must have exactly one definition.',\n );\n\n const fragmentDef = doc.definitions[0] as FragmentDefinitionNode;\n\n invariant(\n fragmentDef.kind === 'FragmentDefinition',\n 'Must be a fragment definition.',\n );\n\n return fragmentDef as FragmentDefinitionNode;\n}\n\n/**\n * Returns the first operation definition found in this document.\n * If no operation definition is found, the first fragment definition will be returned.\n * If no definitions are found, an error will be thrown.\n */\nexport function getMainDefinition(\n queryDoc: DocumentNode,\n): OperationDefinitionNode | FragmentDefinitionNode {\n checkDocument(queryDoc);\n\n let fragmentDefinition;\n\n for (let definition of queryDoc.definitions) {\n if (definition.kind === 'OperationDefinition') {\n const operation = (definition as OperationDefinitionNode).operation;\n if (\n operation === 'query' ||\n operation === 'mutation' ||\n operation === 'subscription'\n ) {\n return definition as OperationDefinitionNode;\n }\n }\n if (definition.kind === 'FragmentDefinition' && !fragmentDefinition) {\n // we do this because we want to allow multiple fragment definitions\n // to precede an operation definition.\n fragmentDefinition = definition as FragmentDefinitionNode;\n }\n }\n\n if (fragmentDefinition) {\n return fragmentDefinition;\n }\n\n throw new InvariantError(\n 'Expected a parsed GraphQL query with a query, mutation, subscription, or a fragment.',\n );\n}\n\nexport function getDefaultValues(\n definition: OperationDefinitionNode | undefined,\n): Record<string, any> {\n const defaultValues = Object.create(null);\n const defs = definition && definition.variableDefinitions;\n if (defs && defs.length) {\n defs.forEach(def => {\n if (def.defaultValue) {\n valueToObjectRepresentation(\n defaultValues,\n def.variable.name,\n def.defaultValue as ValueNode,\n );\n }\n });\n }\n return defaultValues;\n}\n", "export function filterInPlace<T>(\n array: T[],\n test: (elem: T) => boolean,\n context?: any,\n): T[] {\n let target = 0;\n array.forEach(function (elem, i) {\n if (test.call(this, elem, i, array)) {\n array[target++] = elem;\n }\n }, context);\n array.length = target;\n return array;\n}\n", "import {\n DocumentNode,\n SelectionNode,\n SelectionSetNode,\n OperationDefinitionNode,\n FieldNode,\n DirectiveNode,\n FragmentDefinitionNode,\n ArgumentNode,\n FragmentSpreadNode,\n VariableDefinitionNode,\n VariableNode,\n visit,\n} from 'graphql';\nimport { invariant } from 'ts-invariant';\n\nimport {\n checkDocument,\n getOperationDefinition,\n getFragmentDefinition,\n getFragmentDefinitions,\n getMainDefinition,\n} from './getFromAST';\nimport { filterInPlace } from '../common/filterInPlace';\nimport { isField, isInlineFragment } from './storeUtils';\nimport {\n createFragmentMap,\n FragmentMap,\n} from './fragments';\n\nexport type RemoveNodeConfig<N> = {\n name?: string;\n test?: (node: N) => boolean;\n remove?: boolean;\n};\n\nexport type GetNodeConfig<N> = {\n name?: string;\n test?: (node: N) => boolean;\n};\n\nexport type RemoveDirectiveConfig = RemoveNodeConfig<DirectiveNode>;\nexport type GetDirectiveConfig = GetNodeConfig<DirectiveNode>;\nexport type RemoveArgumentsConfig = RemoveNodeConfig<ArgumentNode>;\nexport type GetFragmentSpreadConfig = GetNodeConfig<FragmentSpreadNode>;\nexport type RemoveFragmentSpreadConfig = RemoveNodeConfig<FragmentSpreadNode>;\nexport type RemoveFragmentDefinitionConfig = RemoveNodeConfig<\n FragmentDefinitionNode\n>;\nexport type RemoveVariableDefinitionConfig = RemoveNodeConfig<\n VariableDefinitionNode\n>;\n\nconst TYPENAME_FIELD: FieldNode = {\n kind: 'Field',\n name: {\n kind: 'Name',\n value: '__typename',\n },\n};\n\nfunction isEmpty(\n op: OperationDefinitionNode | FragmentDefinitionNode,\n fragments: FragmentMap,\n): boolean {\n return op.selectionSet.selections.every(\n selection =>\n selection.kind === 'FragmentSpread' &&\n isEmpty(fragments[selection.name.value], fragments),\n );\n}\n\nfunction nullIfDocIsEmpty(doc: DocumentNode) {\n return isEmpty(\n getOperationDefinition(doc) || getFragmentDefinition(doc),\n createFragmentMap(getFragmentDefinitions(doc)),\n )\n ? null\n : doc;\n}\n\nfunction getDirectiveMatcher(\n directives: (RemoveDirectiveConfig | GetDirectiveConfig)[],\n) {\n return function directiveMatcher(directive: DirectiveNode) {\n return directives.some(\n dir =>\n (dir.name && dir.name === directive.name.value) ||\n (dir.test && dir.test(directive)),\n );\n };\n}\n\nexport function removeDirectivesFromDocument(\n directives: RemoveDirectiveConfig[],\n doc: DocumentNode,\n): DocumentNode | null {\n const variablesInUse: Record<string, boolean> = Object.create(null);\n let variablesToRemove: RemoveArgumentsConfig[] = [];\n\n const fragmentSpreadsInUse: Record<string, boolean> = Object.create(null);\n let fragmentSpreadsToRemove: RemoveFragmentSpreadConfig[] = [];\n\n let modifiedDoc = nullIfDocIsEmpty(\n visit(doc, {\n Variable: {\n enter(node, _key, parent) {\n // Store each variable that's referenced as part of an argument\n // (excluding operation definition variables), so we know which\n // variables are being used. If we later want to remove a variable\n // we'll first check to see if it's being used, before continuing with\n // the removal.\n if (\n (parent as VariableDefinitionNode).kind !== 'VariableDefinition'\n ) {\n variablesInUse[node.name.value] = true;\n }\n },\n },\n\n Field: {\n enter(node) {\n if (directives && node.directives) {\n // If `remove` is set to true for a directive, and a directive match\n // is found for a field, remove the field as well.\n const shouldRemoveField = directives.some(\n directive => directive.remove,\n );\n\n if (\n shouldRemoveField &&\n node.directives &&\n node.directives.some(getDirectiveMatcher(directives))\n ) {\n if (node.arguments) {\n // Store field argument variables so they can be removed\n // from the operation definition.\n node.arguments.forEach(arg => {\n if (arg.value.kind === 'Variable') {\n variablesToRemove.push({\n name: (arg.value as VariableNode).name.value,\n });\n }\n });\n }\n\n if (node.selectionSet) {\n // Store fragment spread names so they can be removed from the\n // document.\n getAllFragmentSpreadsFromSelectionSet(node.selectionSet).forEach(\n frag => {\n fragmentSpreadsToRemove.push({\n name: frag.name.value,\n });\n },\n );\n }\n\n // Remove the field.\n return null;\n }\n }\n },\n },\n\n FragmentSpread: {\n enter(node) {\n // Keep track of referenced fragment spreads. This is used to\n // determine if top level fragment definitions should be removed.\n fragmentSpreadsInUse[node.name.value] = true;\n },\n },\n\n Directive: {\n enter(node) {\n // If a matching directive is found, remove it.\n if (getDirectiveMatcher(directives)(node)) {\n return null;\n }\n },\n },\n }),\n );\n\n // If we've removed fields with arguments, make sure the associated\n // variables are also removed from the rest of the document, as long as they\n // aren't being used elsewhere.\n if (\n modifiedDoc &&\n filterInPlace(variablesToRemove, v => !!v.name && !variablesInUse[v.name]).length\n ) {\n modifiedDoc = removeArgumentsFromDocument(variablesToRemove, modifiedDoc);\n }\n\n // If we've removed selection sets with fragment spreads, make sure the\n // associated fragment definitions are also removed from the rest of the\n // document, as long as they aren't being used elsewhere.\n if (\n modifiedDoc &&\n filterInPlace(fragmentSpreadsToRemove, fs => !!fs.name && !fragmentSpreadsInUse[fs.name])\n .length\n ) {\n modifiedDoc = removeFragmentSpreadFromDocument(\n fragmentSpreadsToRemove,\n modifiedDoc,\n );\n }\n\n return modifiedDoc;\n}\n\nexport function addTypenameToDocument(doc: DocumentNode): DocumentNode {\n return visit(checkDocument(doc), {\n SelectionSet: {\n enter(node, _key, parent) {\n // Don't add __typename to OperationDefinitions.\n if (\n parent &&\n (parent as OperationDefinitionNode).kind === 'OperationDefinition'\n ) {\n return;\n }\n\n // No changes if no selections.\n const { selections } = node;\n if (!selections) {\n return;\n }\n\n // If selections already have a __typename, or are part of an\n // introspection query, do nothing.\n const skip = selections.some(selection => {\n return (\n isField(selection) &&\n (selection.name.value === '__typename' ||\n selection.name.value.lastIndexOf('__', 0) === 0)\n );\n });\n if (skip) {\n return;\n }\n\n // If this SelectionSet is @export-ed as an input variable, it should\n // not have a __typename field (see issue #4691).\n const field = parent as FieldNode;\n if (\n isField(field) &&\n field.directives &&\n field.directives.some(d => d.name.value === 'export')\n ) {\n return;\n }\n\n // Create and return a new SelectionSet with a __typename Field.\n return {\n ...node,\n selections: [...selections, TYPENAME_FIELD],\n };\n },\n },\n });\n}\n\nexport interface addTypenameToDocument {\n added(field: FieldNode): boolean;\n}\naddTypenameToDocument.added = function (field: FieldNode) {\n return field === TYPENAME_FIELD;\n};\n\nconst connectionRemoveConfig = {\n test: (directive: DirectiveNode) => {\n const willRemove = directive.name.value === 'connection';\n if (willRemove) {\n if (\n !directive.arguments ||\n !directive.arguments.some(arg => arg.name.value === 'key')\n ) {\n invariant.warn(\n 'Removing an @connection directive even though it does not have a key. ' +\n 'You may want to use the key parameter to specify a store key.',\n );\n }\n }\n\n return willRemove;\n },\n};\n\nexport function removeConnectionDirectiveFromDocument(doc: DocumentNode) {\n return removeDirectivesFromDocument(\n [connectionRemoveConfig],\n checkDocument(doc),\n );\n}\n\nfunction hasDirectivesInSelectionSet(\n directives: GetDirectiveConfig[],\n selectionSet: SelectionSetNode | undefined,\n nestedCheck = true,\n): boolean {\n return (\n !!selectionSet &&\n selectionSet.selections &&\n selectionSet.selections.some(selection =>\n hasDirectivesInSelection(directives, selection, nestedCheck),\n )\n );\n}\n\nfunction hasDirectivesInSelection(\n directives: GetDirectiveConfig[],\n selection: SelectionNode,\n nestedCheck = true,\n): boolean {\n if (!isField(selection)) {\n return true;\n }\n\n if (!selection.directives) {\n return false;\n }\n\n return (\n selection.directives.some(getDirectiveMatcher(directives)) ||\n (nestedCheck &&\n hasDirectivesInSelectionSet(\n directives,\n selection.selectionSet,\n nestedCheck,\n ))\n );\n}\n\nfunction getArgumentMatcher(config: RemoveArgumentsConfig[]) {\n return function argumentMatcher(argument: ArgumentNode) {\n return config.some(\n (aConfig: RemoveArgumentsConfig) =>\n argument.value &&\n argument.value.kind === 'Variable' &&\n argument.value.name &&\n (aConfig.name === argument.value.name.value ||\n (aConfig.test && aConfig.test(argument))),\n );\n };\n}\n\nexport function removeArgumentsFromDocument(\n config: RemoveArgumentsConfig[],\n doc: DocumentNode,\n): DocumentNode | null {\n const argMatcher = getArgumentMatcher(config);\n\n return nullIfDocIsEmpty(\n visit(doc, {\n OperationDefinition: {\n enter(node) {\n return {\n ...node,\n // Remove matching top level variables definitions.\n variableDefinitions: node.variableDefinitions ? node.variableDefinitions.filter(\n varDef =>\n !config.some(arg => arg.name === varDef.variable.name.value),\n ) : [],\n };\n },\n },\n\n Field: {\n enter(node) {\n // If `remove` is set to true for an argument, and an argument match\n // is found for a field, remove the field as well.\n const shouldRemoveField = config.some(argConfig => argConfig.remove);\n\n if (shouldRemoveField) {\n let argMatchCount = 0;\n if (node.arguments) {\n node.arguments.forEach(arg => {\n if (argMatcher(arg)) {\n argMatchCount += 1;\n }\n });\n }\n\n if (argMatchCount === 1) {\n return null;\n }\n }\n },\n },\n\n Argument: {\n enter(node) {\n // Remove all matching arguments.\n if (argMatcher(node)) {\n return null;\n }\n },\n },\n }),\n );\n}\n\nexport function removeFragmentSpreadFromDocument(\n config: RemoveFragmentSpreadConfig[],\n doc: DocumentNode,\n): DocumentNode | null {\n function enter(\n node: FragmentSpreadNode | FragmentDefinitionNode,\n ): null | void {\n if (config.some(def => def.name === node.name.value)) {\n return null;\n }\n }\n\n return nullIfDocIsEmpty(\n visit(doc, {\n FragmentSpread: { enter },\n FragmentDefinition: { enter },\n }),\n );\n}\n\nfunction getAllFragmentSpreadsFromSelectionSet(\n selectionSet: SelectionSetNode,\n): FragmentSpreadNode[] {\n const allFragments: FragmentSpreadNode[] = [];\n\n selectionSet.selections.forEach(selection => {\n if (\n (isField(selection) || isInlineFragment(selection)) &&\n selection.selectionSet\n ) {\n getAllFragmentSpreadsFromSelectionSet(selection.selectionSet).forEach(\n frag => allFragments.push(frag),\n );\n } else if (selection.kind === 'FragmentSpread') {\n allFragments.push(selection);\n }\n });\n\n return allFragments;\n}\n\n// If the incoming document is a query, return it as is. Otherwise, build a\n// new document containing a query operation based on the selection set\n// of the previous main operation.\nexport function buildQueryFromSelectionSet(\n document: DocumentNode,\n): DocumentNode {\n const definition = getMainDefinition(document);\n const definitionOperation = (<OperationDefinitionNode>definition).operation;\n\n if (definitionOperation === 'query') {\n // Already a query, so return the existing document.\n return document;\n }\n\n // Build a new query using the selection set of the main operation.\n const modifiedDoc = visit(document, {\n OperationDefinition: {\n enter(node) {\n return {\n ...node,\n operation: 'query',\n };\n },\n },\n });\n return modifiedDoc;\n}\n\n// Remove fields / selection sets that include an @client directive.\nexport function removeClientSetsFromDocument(\n document: DocumentNode,\n): DocumentNode | null {\n checkDocument(document);\n\n let modifiedDoc = removeDirectivesFromDocument(\n [\n {\n test: (directive: DirectiveNode) => directive.name.value === 'client',\n remove: true,\n },\n ],\n document,\n );\n\n // After a fragment definition has had its @client related document\n // sets removed, if the only field it has left is a __typename field,\n // remove the entire fragment operation to prevent it from being fired\n // on the server.\n if (modifiedDoc) {\n modifiedDoc = visit(modifiedDoc, {\n FragmentDefinition: {\n enter(node) {\n if (node.selectionSet) {\n const isTypenameOnly = node.selectionSet.selections.every(\n selection =>\n isField(selection) && selection.name.value === '__typename',\n );\n if (isTypenameOnly) {\n return null;\n }\n }\n },\n },\n });\n }\n\n return modifiedDoc;\n}\n", "const { hasOwnProperty } = Object.prototype;\n\n// These mergeDeep and mergeDeepArray utilities merge any number of objects\n// together, sharing as much memory as possible with the source objects, while\n// remaining careful to avoid modifying any source objects.\n\n// Logically, the return type of mergeDeep should be the intersection of\n// all the argument types. The binary call signature is by far the most\n// common, but we support 0- through 5-ary as well. After that, the\n// resulting type is just the inferred array element type. Note to nerds:\n// there is a more clever way of doing this that converts the tuple type\n// first to a union type (easy enough: T[number]) and then converts the\n// union to an intersection type using distributive conditional type\n// inference, but that approach has several fatal flaws (boolean becomes\n// true & false, and the inferred type ends up as unknown in many cases),\n// in addition to being nearly impossible to explain/understand.\nexport type TupleToIntersection<T extends any[]> =\n T extends [infer A] ? A :\n T extends [infer A, infer B] ? A & B :\n T extends [infer A, infer B, infer C] ? A & B & C :\n T extends [infer A, infer B, infer C, infer D] ? A & B & C & D :\n T extends [infer A, infer B, infer C, infer D, infer E] ? A & B & C & D & E :\n T extends (infer U)[] ? U : any;\n\nexport function mergeDeep<T extends any[]>(\n ...sources: T\n): TupleToIntersection<T> {\n return mergeDeepArray(sources);\n}\n\n// In almost any situation where you could succeed in getting the\n// TypeScript compiler to infer a tuple type for the sources array, you\n// could just use mergeDeep instead of mergeDeepArray, so instead of\n// trying to convert T[] to an intersection type we just infer the array\n// element type, which works perfectly when the sources array has a\n// consistent element type.\nexport function mergeDeepArray<T>(sources: T[]): T {\n let target = sources[0] || ({} as T);\n const count = sources.length;\n if (count > 1) {\n const merger = new DeepMerger();\n for (let i = 1; i < count; ++i) {\n target = merger.merge(target, sources[i]);\n }\n }\n return target;\n}\n\nfunction isObject(obj: any): obj is Record<string | number, any> {\n return obj !== null && typeof obj === 'object';\n}\n\nexport type ReconcilerFunction<TContextArgs extends any[]> = (\n this: DeepMerger<TContextArgs>,\n target: Record<string | number, any>,\n source: Record<string | number, any>,\n property: string | number,\n ...context: TContextArgs\n) => any;\n\nconst defaultReconciler: ReconcilerFunction<any[]> =\n function (target, source, property) {\n return this.merge(target[property], source[property]);\n };\n\nexport class DeepMerger<TContextArgs extends any[]> {\n constructor(\n private reconciler: ReconcilerFunction<TContextArgs> = defaultReconciler,\n ) {}\n\n public merge(target: any, source: any, ...context: TContextArgs): any {\n if (isObject(source) && isObject(target)) {\n Object.keys(source).forEach(sourceKey => {\n if (hasOwnProperty.call(target, sourceKey)) {\n const targetValue = target[sourceKey];\n if (source[sourceKey] !== targetValue) {\n const result = this.reconciler(target, source, sourceKey, ...context);\n // A well-implemented reconciler may return targetValue to indicate\n // the merge changed nothing about the structure of the target.\n if (result !== targetValue) {\n target = this.shallowCopyForMerge(target);\n target[sourceKey] = result;\n }\n }\n } else {\n // If there is no collision, the target can safely share memory with\n // the source, and the recursion can terminate here.\n target = this.shallowCopyForMerge(target);\n target[sourceKey] = source[sourceKey];\n }\n });\n\n return target;\n }\n\n // If source (or target) is not an object, let source replace target.\n return source;\n }\n\n public isObject = isObject;\n\n private pastCopies = new Set<any>();\n\n public shallowCopyForMerge<T>(value: T): T {\n if (isObject(value) && !this.pastCopies.has(value)) {\n if (Array.isArray(value)) {\n value = (value as any).slice(0);\n } else {\n value = {\n __proto__: Object.getPrototypeOf(value),\n ...value,\n };\n }\n this.pastCopies.add(value);\n }\n return value;\n }\n}\n", "import { __rest } from \"tslib\";\n\nimport { FieldPolicy, Reference } from '../../cache';\nimport { mergeDeep } from '../common/mergeDeep';\n\ntype KeyArgs = FieldPolicy<any>[\"keyArgs\"];\n\n// A very basic pagination field policy that always concatenates new\n// results onto the existing array, without examining options.args.\nexport function concatPagination<T = Reference>(\n keyArgs: KeyArgs = false,\n): FieldPolicy<T[]> {\n return {\n keyArgs,\n merge(existing, incoming) {\n return existing ? [\n ...existing,\n ...incoming,\n ] : incoming;\n },\n };\n}\n\n// A basic field policy that uses options.args.{offset,limit} to splice\n// the incoming data into the existing array. If your arguments are called\n// something different (like args.{start,count}), feel free to copy/paste\n// this implementation and make the appropriate changes.\nexport function offsetLimitPagination<T = Reference>(\n keyArgs: KeyArgs = false,\n): FieldPolicy<T[]> {\n return {\n keyArgs,\n merge(existing, incoming, { args }) {\n const merged = existing ? existing.slice(0) : [];\n if (args) {\n // Assume an offset of 0 if args.offset omitted.\n const { offset = 0 } = args;\n for (let i = 0; i < incoming.length; ++i) {\n merged[offset + i] = incoming[i];\n }\n } else {\n // It's unusual (probably a mistake) for a paginated field not\n // to receive any arguments, so you might prefer to throw an\n // exception here, instead of recovering by appending incoming\n // onto the existing array.\n merged.push.apply(merged, incoming);\n }\n return merged;\n },\n };\n}\n\n// Whether TRelayEdge<TNode> is a normalized Reference or a non-normalized\n// object, it needs a .cursor property where the relayStylePagination\n// merge function can store cursor strings taken from pageInfo. Storing an\n// extra reference.cursor property should be safe, and is easier than\n// attempting to update the cursor field of the normalized StoreObject\n// that the reference refers to, or managing edge wrapper objects\n// (something I attempted in #7023, but abandoned because of #7088).\nexport type TRelayEdge<TNode> = {\n cursor?: string;\n node: TNode;\n} | (Reference & { cursor?: string });\n\nexport type TRelayPageInfo = {\n hasPreviousPage: boolean;\n hasNextPage: boolean;\n startCursor: string;\n endCursor: string;\n};\n\nexport type TExistingRelay<TNode> = Readonly<{\n edges: TRelayEdge<TNode>[];\n pageInfo: TRelayPageInfo;\n}>;\n\nexport type TIncomingRelay<TNode> = {\n edges?: TRelayEdge<TNode>[];\n pageInfo?: TRelayPageInfo;\n};\n\nexport type RelayFieldPolicy<TNode> = FieldPolicy<\n TExistingRelay<TNode>,\n TIncomingRelay<TNode>,\n TIncomingRelay<TNode>\n>;\n\n// As proof of the flexibility of field policies, this function generates\n// one that handles Relay-style pagination, without Apollo Client knowing\n// anything about connections, edges, cursors, or pageInfo objects.\nexport function relayStylePagination<TNode = Reference>(\n keyArgs: KeyArgs = false,\n): RelayFieldPolicy<TNode> {\n return {\n keyArgs,\n\n read(existing, { canRead, readField }) {\n if (!existing) return;\n\n const edges: TRelayEdge<TNode>[] = [];\n let startCursor = \"\";\n let endCursor = \"\";\n existing.edges.forEach(edge => {\n // Edges themselves could be Reference objects, so it's important\n // to use readField to access the edge.edge.node property.\n if (canRead(readField(\"node\", edge))) {\n edges.push(edge);\n if (edge.cursor) {\n startCursor = startCursor || edge.cursor;\n endCursor = edge.cursor;\n }\n }\n });\n\n return {\n // Some implementations return additional Connection fields, such\n // as existing.totalCount. These fields are saved by the merge\n // function, so the read function should also preserve them.\n ...getExtras(existing),\n edges,\n pageInfo: {\n ...existing.pageInfo,\n startCursor,\n endCursor,\n },\n };\n },\n\n merge(existing = makeEmptyData(), incoming, { args, isReference, readField }) {\n const incomingEdges = incoming.edges ? incoming.edges.map(edge => {\n if (isReference(edge = { ...edge })) {\n // In case edge is a Reference, we read out its cursor field and\n // store it as an extra property of the Reference object.\n edge.cursor = readField<string>(\"cursor\", edge);\n }\n return edge;\n }) : [];\n\n if (incoming.pageInfo) {\n const { pageInfo } = incoming;\n const { startCursor, endCursor } = pageInfo;\n const firstEdge = incomingEdges[0];\n const lastEdge = incomingEdges[incomingEdges.length - 1];\n // In case we did not request the cursor field for edges in this\n // query, we can still infer cursors from pageInfo.\n if (firstEdge && startCursor) {\n firstEdge.cursor = startCursor;\n }\n if (lastEdge && endCursor) {\n lastEdge.cursor = endCursor;\n }\n // Cursors can also come from edges, so we default\n // pageInfo.{start,end}Cursor to {first,last}Edge.cursor.\n const firstCursor = firstEdge && firstEdge.cursor;\n if (firstCursor && !startCursor) {\n incoming = mergeDeep(incoming, {\n pageInfo: {\n startCursor: firstCursor,\n },\n });\n }\n const lastCursor = lastEdge && lastEdge.cursor;\n if (lastCursor && !endCursor) {\n incoming = mergeDeep(incoming, {\n pageInfo: {\n endCursor: lastCursor,\n },\n });\n }\n }\n\n let prefix = existing.edges;\n let suffix: typeof prefix = [];\n\n if (args && args.after) {\n // This comparison does not need to use readField(\"cursor\", edge),\n // because we stored the cursor field of any Reference edges as an\n // extra property of the Reference object.\n const index = prefix.findIndex(edge => edge.cursor === args.after);\n if (index >= 0) {\n prefix = prefix.slice(0, index + 1);\n // suffix = []; // already true\n }\n } else if (args && args.before) {\n const index = prefix.findIndex(edge => edge.cursor === args.before);\n suffix = index < 0 ? prefix : prefix.slice(index);\n prefix = [];\n } else if (incoming.edges) {\n // If we have neither args.after nor args.before, the incoming\n // edges cannot be spliced into the existing edges, so they must\n // replace the existing edges. See #6592 for a motivating example.\n prefix = [];\n }\n\n const edges = [\n ...prefix,\n ...incomingEdges,\n ...suffix,\n ];\n\n const pageInfo: TRelayPageInfo = {\n // The ordering of these two ...spreads may be surprising, but it\n // makes sense because we want to combine PageInfo properties with a\n // preference for existing values, *unless* the existing values are\n // overridden by the logic below, which is permitted only when the\n // incoming page falls at the beginning or end of the data.\n ...incoming.pageInfo,\n ...existing.pageInfo,\n };\n\n if (incoming.pageInfo) {\n const {\n hasPreviousPage, hasNextPage,\n startCursor, endCursor,\n ...extras\n } = incoming.pageInfo;\n\n // If incoming.pageInfo had any extra non-standard properties,\n // assume they should take precedence over any existing properties\n // of the same name, regardless of where this page falls with\n // respect to the existing data.\n Object.assign(pageInfo, extras);\n\n // Keep existing.pageInfo.has{Previous,Next}Page unless the\n // placement of the incoming edges means incoming.hasPreviousPage\n // or incoming.hasNextPage should become the new values for those\n // properties in existing.pageInfo. Note that these updates are\n // only permitted when the beginning or end of the incoming page\n // coincides with the beginning or end of the existing data, as\n // determined using prefix.length and suffix.length.\n if (!prefix.length) {\n if (void 0 !== hasPreviousPage) pageInfo.hasPreviousPage = hasPreviousPage;\n if (void 0 !== startCursor) pageInfo.startCursor = startCursor;\n }\n if (!suffix.length) {\n if (void 0 !== hasNextPage) pageInfo.hasNextPage = hasNextPage;\n if (void 0 !== endCursor) pageInfo.endCursor = endCursor;\n }\n }\n\n return {\n ...getExtras(existing),\n ...getExtras(incoming),\n edges,\n pageInfo,\n };\n },\n };\n}\n\n// Returns any unrecognized properties of the given object.\nconst getExtras = (obj: Record<string, any>) => __rest(obj, notExtras);\nconst notExtras = [\"edges\", \"pageInfo\"];\n\nfunction makeEmptyData(): TExistingRelay<any> {\n return {\n edges: [],\n pageInfo: {\n hasPreviousPage: false,\n hasNextPage: true,\n startCursor: \"\",\n endCursor: \"\",\n },\n };\n}\n", "import Observable from 'zen-observable';\n\n// This simplified polyfill attempts to follow the ECMAScript Observable\n// proposal (https://github.com/zenparsing/es-observable)\nimport 'symbol-observable';\n\nexport type ObservableSubscription = ZenObservable.Subscription;\nexport type Observer<T> = ZenObservable.Observer<T>;\nexport type Subscriber<T> = ZenObservable.Subscriber<T>;\n\n// The zen-observable package defines Observable.prototype[Symbol.observable]\n// when Symbol is supported, but RxJS interop depends on also setting this fake\n// '@@observable' string as a polyfill for Symbol.observable.\nconst { prototype } = Observable;\nconst fakeObsSymbol = '@@observable' as keyof typeof prototype;\nif (!prototype[fakeObsSymbol]) {\n prototype[fakeObsSymbol] = function () { return this; };\n}\n\nexport { Observable };\n", "export default function symbolObservablePonyfill(root) {\n\tvar result;\n\tvar Symbol = root.Symbol;\n\n\tif (typeof Symbol === 'function') {\n\t\tif (Symbol.observable) {\n\t\t\tresult = Symbol.observable;\n\t\t} else {\n\n\t\t\tif (typeof Symbol.for === 'function') {\n\t\t\t\t// This just needs to be something that won't trample other user's Symbol.for use\n\t\t\t\t// It also will guide people to the source of their issues, if this is problematic.\n\t\t\t\t// META: It's a resource locator!\n\t\t\t\tresult = Symbol.for('https://github.com/benlesh/symbol-observable');\n\t\t\t} else {\n\t\t\t\t// Symbol.for didn't exist! The best we can do at this point is a totally \n\t\t\t\t// unique symbol. Note that the string argument here is a descriptor, not\n\t\t\t\t// an identifier. This symbol is unique.\n\t\t\t\tresult = Symbol('https://github.com/benlesh/symbol-observable');\n\t\t\t}\n\t\t\ttry {\n\t\t\t\tSymbol.observable = result;\n\t\t\t} catch (err) {\n\t\t\t\t// Do nothing. In some environments, users have frozen `Symbol` for security reasons,\n\t\t\t\t// if it is frozen assigning to it will throw. In this case, we don't care, because\n\t\t\t\t// they will need to use the returned value from the ponyfill.\n\t\t\t}\n\t\t}\n\t} else {\n\t\tresult = '@@observable';\n\t}\n\n\treturn result;\n};\n", "/* global window */\nimport ponyfill from './ponyfill.js';\n\nvar root;\n\nif (typeof self !== 'undefined') {\n root = self;\n} else if (typeof window !== 'undefined') {\n root = window;\n} else if (typeof global !== 'undefined') {\n root = global;\n} else if (typeof module !== 'undefined') {\n root = module;\n} else {\n root = Function('return this')();\n}\n\nvar result = ponyfill(root);\nexport default result;\n", "const { toString } = Object.prototype;\n\n/**\n * Deeply clones a value to create a new instance.\n */\nexport function cloneDeep<T>(value: T): T {\n return cloneDeepHelper(value);\n}\n\nfunction cloneDeepHelper<T>(val: T, seen?: Map<any, any>): T {\n switch (toString.call(val)) {\n case \"[object Array]\": {\n seen = seen || new Map;\n if (seen.has(val)) return seen.get(val);\n const copy: T & any[] = (val as any).slice(0);\n seen.set(val, copy);\n copy.forEach(function (child, i) {\n copy[i] = cloneDeepHelper(child, seen);\n });\n return copy;\n }\n\n case \"[object Object]\": {\n seen = seen || new Map;\n if (seen.has(val)) return seen.get(val);\n // High fidelity polyfills of Object.create and Object.getPrototypeOf are\n // possible in all JS environments, so we will assume they exist/work.\n const copy = Object.create(Object.getPrototypeOf(val));\n seen.set(val, copy);\n Object.keys(val).forEach(key => {\n copy[key] = cloneDeepHelper((val as any)[key], seen);\n });\n return copy;\n }\n\n default:\n return val;\n }\n}\n", "export function getEnv(): string | undefined {\n if (typeof process !== 'undefined' && process.env.NODE_ENV) {\n return process.env.NODE_ENV;\n }\n\n // default environment\n return 'development';\n}\n\nexport function isEnv(env: string): boolean {\n return getEnv() === env;\n}\n\nexport function isDevelopment(): boolean {\n return isEnv('development') === true;\n}\n\nexport function isTest(): boolean {\n return isEnv('test') === true;\n}\n", "import { isDevelopment, isTest } from './environment';\n\nfunction isObject(value: any) {\n return value !== null && typeof value === \"object\";\n}\n\nfunction deepFreeze(value: any) {\n const workSet = new Set([value]);\n workSet.forEach(obj => {\n if (isObject(obj)) {\n if (!Object.isFrozen(obj)) Object.freeze(obj);\n Object.getOwnPropertyNames(obj).forEach(name => {\n if (isObject(obj[name])) workSet.add(obj[name]);\n });\n }\n });\n return value;\n}\n\nexport function maybeDeepFreeze<T>(obj: T): T {\n if (process.env.NODE_ENV !== \"production\" && (isDevelopment() || isTest())) {\n deepFreeze(obj);\n }\n return obj;\n}\n", "import { Observer } from \"./Observable\";\n\nexport function iterateObserversSafely<E, A>(\n observers: Set<Observer<E>>,\n method: keyof Observer<E>,\n argument?: A,\n) {\n // In case observers is modified during iteration, we need to commit to the\n // original elements, which also provides an opportunity to filter them down\n // to just the observers with the given method.\n const observersWithMethod: Observer<E>[] = [];\n observers.forEach(obs => obs[method] && observersWithMethod.push(obs));\n observersWithMethod.forEach(obs => (obs as any)[method](argument));\n}\n", "import { Observable, Observer } from \"./Observable\";\n\n// Like Observable.prototype.map, except that the mapping function can\n// optionally return a Promise (or be async).\nexport function asyncMap<V, R>(\n observable: Observable<V>,\n mapFn: (value: V) => R | PromiseLike<R>,\n catchFn?: (error: any) => R | PromiseLike<R>,\n): Observable<R> {\n return new Observable<R>(observer => {\n const { next, error, complete } = observer;\n let activeCallbackCount = 0;\n let completed = false;\n let promiseQueue = {\n // Normally we would initialize promiseQueue to Promise.resolve(), but\n // in this case, for backwards compatibility, we need to be careful to\n // invoke the first callback synchronously.\n then(callback: () => any) {\n return new Promise(resolve => resolve(callback()));\n },\n } as Promise<void>;\n\n function makeCallback(\n examiner: typeof mapFn | typeof catchFn,\n delegate: typeof next | typeof error,\n ): (arg: any) => void {\n if (examiner) {\n return arg => {\n ++activeCallbackCount;\n const both = () => examiner(arg);\n promiseQueue = promiseQueue.then(both, both).then(\n result => {\n --activeCallbackCount;\n next && next.call(observer, result);\n if (completed) {\n handler.complete!();\n }\n },\n error => {\n --activeCallbackCount;\n throw error;\n },\n ).catch(caught => {\n error && error.call(observer, caught);\n });\n };\n } else {\n return arg => delegate && delegate.call(observer, arg);\n }\n }\n\n const handler: Observer<V> = {\n next: makeCallback(mapFn, next),\n error: makeCallback(catchFn, error),\n complete() {\n completed = true;\n if (!activeCallbackCount) {\n complete && complete.call(observer);\n }\n },\n };\n\n const sub = observable.subscribe(handler);\n return () => sub.unsubscribe();\n });\n}\n", "import { Observable } from \"./Observable\";\n\n// Generic implementations of Observable.prototype methods like map and\n// filter need to know how to create a new Observable from an Observable\n// subclass (like Concast or ObservableQuery). Those methods assume\n// (perhaps unwisely?) that they can call the subtype's constructor with a\n// Subscriber function, even though the subclass constructor might expect\n// different parameters. Defining this static Symbol.species property on\n// the subclass is a hint to generic Observable code to use the default\n// constructor instead of trying to do `new Subclass(observer => ...)`.\nexport function fixObservableSubclass<\n S extends new (...args: any[]) => Observable<any>,\n>(subclass: S): S {\n function set(key: symbol | string) {\n // Object.defineProperty is necessary because the Symbol.species\n // property is a getter by default in modern JS environments, so we\n // can't assign to it with a normal assignment expression.\n Object.defineProperty(subclass, key, { value: Observable });\n }\n if (typeof Symbol === \"function\" && Symbol.species) {\n set(Symbol.species);\n }\n // The \"@@species\" string is used as a fake Symbol.species value in some\n // polyfill systems (including the SymbolSpecies variable used by\n // zen-observable), so we should set it as well, to be safe.\n set(\"@@species\");\n return subclass;\n}\n", "import { Observable, Observer, ObservableSubscription, Subscriber } from \"./Observable\";\nimport { iterateObserversSafely } from \"./iteration\";\nimport { fixObservableSubclass } from \"./subclassing\";\n\ntype MaybeAsync<T> = T | PromiseLike<T>;\n\nfunction isPromiseLike<T>(value: MaybeAsync<T>): value is PromiseLike<T> {\n return value && typeof (value as any).then === \"function\";\n}\n\n// Any individual Source<T> can be an Observable<T> or a promise for one.\ntype Source<T> = MaybeAsync<Observable<T>>;\n\nexport type ConcastSourcesIterable<T> = Iterable<Source<T>>;\n\n// A Concast<T> observable concatenates the given sources into a single\n// non-overlapping sequence of Ts, automatically unwrapping any promises,\n// and broadcasts the T elements of that sequence to any number of\n// subscribers, all without creating a bunch of intermediary Observable\n// wrapper objects.\n//\n// Even though any number of observers can subscribe to the Concast, each\n// source observable is guaranteed to receive at most one subscribe call,\n// and the results are multicast to all observers.\n//\n// In addition to broadcasting every next/error message to this.observers,\n// the Concast stores the most recent message using this.latest, so any\n// new observers can immediately receive the latest message, even if it\n// was originally delivered in the past. This behavior means we can assume\n// every active observer in this.observers has received the same most\n// recent message.\n//\n// With the exception of this.latest replay, a Concast is a \"hot\"\n// observable in the sense that it does not replay past results from the\n// beginning of time for each new observer.\n//\n// Could we have used some existing RxJS class instead? Concast<T> is\n// similar to a BehaviorSubject<T>, because it is multicast and redelivers\n// the latest next/error message to new subscribers. Unlike Subject<T>,\n// Concast<T> does not expose an Observer<T> interface (this.handlers is\n// intentionally private), since Concast<T> gets its inputs from the\n// concatenated sources. If we ever switch to RxJS, there may be some\n// value in reusing their code, but for now we use zen-observable, which\n// does not contain any Subject implementations.\nexport class Concast<T> extends Observable<T> {\n // Active observers receiving broadcast messages. Thanks to this.latest,\n // we can assume all observers in this Set have received the same most\n // recent message, though possibly at different times in the past.\n private observers = new Set<Observer<T>>();\n\n // This property starts off undefined to indicate the initial\n // subscription has not yet begun, then points to each source\n // subscription in turn, and finally becomes null after the sources have\n // been exhausted. After that, it stays null.\n private sub?: ObservableSubscription | null;\n\n // Not only can the individual elements of the iterable be promises, but\n // also the iterable itself can be wrapped in a promise.\n constructor(sources: MaybeAsync<ConcastSourcesIterable<T>> | Subscriber<T>) {\n super(observer => {\n this.addObserver(observer);\n return () => this.removeObserver(observer);\n });\n\n // Suppress rejection warnings for this.promise, since it's perfectly\n // acceptable to pay no attention to this.promise if you're consuming\n // the results through the normal observable API.\n this.promise.catch(_ => {});\n\n // If someone accidentally tries to create a Concast using a subscriber\n // function, recover by creating an Observable from that subscriber and\n // using it as the source.\n if (typeof sources === \"function\") {\n sources = [new Observable(sources)];\n }\n\n if (isPromiseLike(sources)) {\n sources.then(\n iterable => this.start(iterable),\n this.handlers.error,\n );\n } else {\n this.start(sources);\n }\n }\n\n // A consumable array of source observables, incrementally consumed\n // each time this.handlers.complete is called.\n private sources: Source<T>[];\n\n private start(sources: ConcastSourcesIterable<T>) {\n if (this.sub !== void 0) return;\n\n // In practice, sources is most often simply an Array of observables.\n // TODO Consider using sources[Symbol.iterator]() to take advantage\n // of the laziness of non-Array iterables.\n this.sources = Array.from(sources);\n\n // Calling this.handlers.complete() kicks off consumption of the first\n // source observable. It's tempting to do this step lazily in\n // addObserver, but this.promise can be accessed without calling\n // addObserver, so consumption needs to begin eagerly.\n this.handlers.complete();\n }\n\n private deliverLastMessage(observer: Observer<T>) {\n if (this.latest) {\n const nextOrError = this.latest[0];\n const method = observer[nextOrError];\n if (method) {\n method.call(observer, this.latest[1]);\n }\n // If the subscription is already closed, and the last message was\n // a 'next' message, simulate delivery of the final 'complete'\n // message again.\n if (this.sub === null &&\n nextOrError === \"next\" &&\n observer.complete) {\n observer.complete();\n }\n }\n }\n\n // Note: cleanup observers do not count towards this total.\n private addCount = 0;\n\n public addObserver(observer: Observer<T>) {\n if (!this.observers.has(observer)) {\n // Immediately deliver the most recent message, so we can always\n // be sure all observers have the latest information.\n this.deliverLastMessage(observer);\n this.observers.add(observer);\n ++this.addCount;\n }\n }\n\n public removeObserver(\n observer: Observer<T>,\n quietly?: boolean,\n ) {\n if (this.observers.delete(observer) &&\n --this.addCount < 1 &&\n !quietly) {\n // In case there are still any cleanup observers in this.observers,\n // and no error or completion has been broadcast yet, make sure\n // those observers receive an error that terminates them.\n this.handlers.error(new Error(\"Observable cancelled prematurely\"));\n }\n }\n\n // Any Concast object can be trivially converted to a Promise, without\n // having to create a new wrapper Observable. This promise provides an\n // easy way to observe the final state of the Concast.\n private resolve: (result?: T | PromiseLike<T>) => void;\n private reject: (reason: any) => void;\n public readonly promise = new Promise<T>((resolve, reject) => {\n this.resolve = resolve;\n this.reject = reject;\n });\n\n // Name and argument of the most recently invoked observer method, used\n // to deliver latest results immediately to new observers.\n private latest?: [\"next\" | \"error\", any];\n\n // Bound handler functions that can be reused for every internal\n // subscription.\n private handlers = {\n next: (result: T) => {\n if (this.sub !== null) {\n this.latest = [\"next\", result];\n iterateObserversSafely(this.observers, \"next\", result);\n }\n },\n\n error: (error: any) => {\n const { sub } = this;\n if (sub !== null) {\n // Delay unsubscribing from the underlying subscription slightly,\n // so that immediately subscribing another observer can keep the\n // subscription active.\n if (sub) Promise.resolve().then(() => sub.unsubscribe());\n this.sub = null;\n this.latest = [\"error\", error];\n this.reject(error);\n iterateObserversSafely(this.observers, \"error\", error);\n }\n },\n\n complete: () => {\n if (this.sub !== null) {\n const value = this.sources.shift();\n if (!value) {\n this.sub = null;\n if (this.latest &&\n this.latest[0] === \"next\") {\n this.resolve(this.latest[1]);\n } else {\n this.resolve();\n }\n // We do not store this.latest = [\"complete\"], because doing so\n // discards useful information about the previous next (or\n // error) message. Instead, if new observers subscribe after\n // this Concast has completed, they will receive the final\n // 'next' message (unless there was an error) immediately\n // followed by a 'complete' message (see addObserver).\n iterateObserversSafely(this.observers, \"complete\");\n } else if (isPromiseLike(value)) {\n value.then(obs => this.sub = obs.subscribe(this.handlers));\n } else {\n this.sub = value.subscribe(this.handlers);\n }\n }\n },\n };\n\n public cleanup(callback: () => any) {\n let called = false;\n const once = () => {\n if (!called) {\n called = true;\n // Removing a cleanup observer should not unsubscribe from the\n // underlying Observable, so the only removeObserver behavior we\n // need here is to delete observer from this.observers.\n this.observers.delete(observer);\n callback();\n }\n }\n const observer = {\n next: once,\n error: once,\n complete: once,\n };\n const count = this.addCount;\n this.addObserver(observer);\n // Normally addObserver increments this.addCount, but we can \"hide\"\n // cleanup observers by restoring this.addCount to its previous value\n // after adding any cleanup observer.\n this.addCount = count;\n }\n\n // A public way to abort observation and broadcast.\n public cancel = (reason: any) => {\n this.reject(reason);\n this.sources = [];\n this.handlers.complete();\n }\n}\n\n// Necessary because the Concast constructor has a different signature\n// than the Observable constructor.\nfixObservableSubclass(Concast);\n", "export function isNonEmptyArray<T>(value?: ArrayLike<T>): value is Array<T> {\n return Array.isArray(value) && value.length > 0;\n}\n", "import { ExecutionResult } from 'graphql';\n\nexport function graphQLResultHasError(result: ExecutionResult): boolean {\n return (result.errors && result.errors.length > 0) || false;\n}\n", "export const canUseWeakMap = typeof WeakMap === 'function' && !(\n typeof navigator === 'object' &&\n navigator.product === 'ReactNative'\n);\n", "import { TupleToIntersection } from './mergeDeep';\n\n/**\n * Merges the provided objects shallowly and removes\n * all properties with an `undefined` value\n */\nexport function compact<TArgs extends any[]>(\n ...objects: TArgs\n): TupleToIntersection<TArgs> {\n const result = Object.create(null);\n\n objects.forEach(obj => {\n if (!obj) return;\n Object.keys(obj).forEach(key => {\n const value = (obj as any)[key];\n if (value !== void 0) {\n result[key] = value;\n }\n });\n });\n\n return result;\n}\n", "import { Observable } from '../../utilities';\n\nexport function fromError<T>(errorValue: any): Observable<T> {\n return new Observable<T>(observer => {\n observer.error(errorValue);\n });\n}\n", "import { invariant } from 'ts-invariant';\n\nimport { Observable } from '../../utilities';\n\nexport function toPromise<R>(observable: Observable<R>): Promise<R> {\n let completed = false;\n return new Promise<R>((resolve, reject) => {\n observable.subscribe({\n next: data => {\n if (completed) {\n invariant.warn(\n `Promise Wrapper does not support multiple results from Observable`,\n );\n } else {\n completed = true;\n resolve(data);\n }\n },\n error: reject,\n });\n });\n}\n", "import { Observable } from '../../utilities';\n\nexport function fromPromise<T>(promise: Promise<T>): Observable<T> {\n return new Observable<T>(observer => {\n promise\n .then((value: T) => {\n observer.next(value);\n observer.complete();\n })\n .catch(observer.error.bind(observer));\n });\n}\n", "export type ServerError = Error & {\n response: Response;\n result: Record<string, any>;\n statusCode: number;\n};\n\nexport const throwServerError = (\n response: Response,\n result: any,\n message: string\n) => {\n const error = new Error(message) as ServerError;\n error.name = 'ServerError';\n error.response = response;\n error.statusCode = response.status;\n error.result = result;\n throw error;\n};\n", "import { InvariantError } from 'ts-invariant';\n\nimport { GraphQLRequest } from '../core';\n\nexport function validateOperation(operation: GraphQLRequest): GraphQLRequest {\n const OPERATION_FIELDS = [\n 'query',\n 'operationName',\n 'variables',\n 'extensions',\n 'context',\n ];\n for (let key of Object.keys(operation)) {\n if (OPERATION_FIELDS.indexOf(key) < 0) {\n throw new InvariantError(`illegal argument: ${key}`);\n }\n }\n\n return operation;\n}\n", "import { GraphQLRequest, Operation } from '../core';\n\nexport function createOperation(\n starting: any,\n operation: GraphQLRequest,\n): Operation {\n let context = { ...starting };\n const setContext = (next: any) => {\n if (typeof next === 'function') {\n context = { ...context, ...next(context) };\n } else {\n context = { ...context, ...next };\n }\n };\n const getContext = () => ({ ...context });\n\n Object.defineProperty(operation, 'setContext', {\n enumerable: false,\n value: setContext,\n });\n\n Object.defineProperty(operation, 'getContext', {\n enumerable: false,\n value: getContext,\n });\n\n return operation as Operation;\n}\n", "import { GraphQLRequest, Operation } from '../core';\nimport { getOperationName } from '../../utilities';\n\nexport function transformOperation(operation: GraphQLRequest): GraphQLRequest {\n const transformedOperation: GraphQLRequest = {\n variables: operation.variables || {},\n extensions: operation.extensions || {},\n operationName: operation.operationName,\n query: operation.query,\n };\n\n // Best guess at an operation name\n if (!transformedOperation.operationName) {\n transformedOperation.operationName =\n typeof transformedOperation.query !== 'string'\n ? getOperationName(transformedOperation.query) || undefined\n : '';\n }\n\n return transformedOperation as Operation;\n}\n", "import { InvariantError, invariant } from 'ts-invariant';\n\nimport { Observable } from '../../utilities';\nimport {\n NextLink,\n Operation,\n RequestHandler,\n FetchResult,\n GraphQLRequest\n} from './types';\nimport {\n validateOperation,\n createOperation,\n transformOperation,\n} from '../utils';\n\nfunction passthrough(op: Operation, forward: NextLink) {\n return (forward ? forward(op) : Observable.of()) as Observable<FetchResult>;\n}\n\nfunction toLink(handler: RequestHandler | ApolloLink) {\n return typeof handler === 'function' ? new ApolloLink(handler) : handler;\n}\n\nfunction isTerminating(link: ApolloLink): boolean {\n return link.request.length <= 1;\n}\n\nclass LinkError extends Error {\n public link?: ApolloLink;\n constructor(message?: string, link?: ApolloLink) {\n super(message);\n this.link = link;\n }\n}\n\nexport class ApolloLink {\n public static empty(): ApolloLink {\n return new ApolloLink(() => Observable.of());\n }\n\n public static from(links: (ApolloLink | RequestHandler)[]): ApolloLink {\n if (links.length === 0) return ApolloLink.empty();\n return links.map(toLink).reduce((x, y) => x.concat(y)) as ApolloLink;\n }\n\n public static split(\n test: (op: Operation) => boolean,\n left: ApolloLink | RequestHandler,\n right?: ApolloLink | RequestHandler,\n ): ApolloLink {\n const leftLink = toLink(left);\n const rightLink = toLink(right || new ApolloLink(passthrough));\n\n if (isTerminating(leftLink) && isTerminating(rightLink)) {\n return new ApolloLink(operation => {\n return test(operation)\n ? leftLink.request(operation) || Observable.of()\n : rightLink.request(operation) || Observable.of();\n });\n } else {\n return new ApolloLink((operation, forward) => {\n return test(operation)\n ? leftLink.request(operation, forward) || Observable.of()\n : rightLink.request(operation, forward) || Observable.of();\n });\n }\n }\n\n public static execute(\n link: ApolloLink,\n operation: GraphQLRequest,\n ): Observable<FetchResult> {\n return (\n link.request(\n createOperation(\n operation.context,\n transformOperation(validateOperation(operation)),\n ),\n ) || Observable.of()\n );\n }\n\n public static concat(\n first: ApolloLink | RequestHandler,\n second: ApolloLink | RequestHandler,\n ) {\n const firstLink = toLink(first);\n if (isTerminating(firstLink)) {\n invariant.warn(\n new LinkError(\n `You are calling concat on a terminating link, which will have no effect`,\n firstLink,\n ),\n );\n return firstLink;\n }\n const nextLink = toLink(second);\n\n if (isTerminating(nextLink)) {\n return new ApolloLink(\n operation =>\n firstLink.request(\n operation,\n op => nextLink.request(op) || Observable.of(),\n ) || Observable.of(),\n );\n } else {\n return new ApolloLink((operation, forward) => {\n return (\n firstLink.request(operation, op => {\n return nextLink.request(op, forward) || Observable.of();\n }) || Observable.of()\n );\n });\n }\n }\n\n constructor(request?: RequestHandler) {\n if (request) this.request = request;\n }\n\n public split(\n test: (op: Operation) => boolean,\n left: ApolloLink | RequestHandler,\n right?: ApolloLink | RequestHandler,\n ): ApolloLink {\n return this.concat(\n ApolloLink.split(test, left, right || new ApolloLink(passthrough))\n );\n }\n\n public concat(next: ApolloLink | RequestHandler): ApolloLink {\n return ApolloLink.concat(this, next);\n }\n\n public request(\n operation: Operation,\n forward?: NextLink,\n ): Observable<FetchResult> | null {\n throw new InvariantError('request is not implemented');\n }\n\n protected onError(\n error: any,\n observer?: ZenObservable.Observer<FetchResult>,\n ): false | void {\n if (observer && observer.error) {\n observer.error(error);\n // Returning false indicates that observer.error does not need to be\n // called again, since it was already called (on the previous line).\n // Calling observer.error again would not cause any real problems,\n // since only the first call matters, but custom onError functions\n // might have other reasons for wanting to prevent the default\n // behavior by returning false.\n return false;\n }\n // Throw errors will be passed to observer.error.\n throw error;\n }\n\n public setOnError(fn: ApolloLink[\"onError\"]): this {\n this.onError = fn;\n return this;\n }\n}\n", "import { ApolloLink } from './ApolloLink';\n\nexport const empty = ApolloLink.empty;\n", "import { ApolloLink } from './ApolloLink';\n\nexport const from = ApolloLink.from;\n", "import { ApolloLink } from './ApolloLink';\n\nexport const split = ApolloLink.split;\n", "import { ApolloLink } from './ApolloLink';\n\nexport const concat = ApolloLink.concat;\n", "import { ApolloLink } from './ApolloLink';\n\nexport const execute = ApolloLink.execute;\n", "export const version = 'local';\n", "import { Operation } from '../core';\nimport { throwServerError } from '../utils';\n\nconst { hasOwnProperty } = Object.prototype;\n\nexport type ServerParseError = Error & {\n response: Response;\n statusCode: number;\n bodyText: string;\n};\n\nexport function parseAndCheckHttpResponse(\n operations: Operation | Operation[],\n) {\n return (response: Response) => response\n .text()\n .then(bodyText => {\n try {\n return JSON.parse(bodyText);\n } catch (err) {\n const parseError = err as ServerParseError;\n parseError.name = 'ServerParseError';\n parseError.response = response;\n parseError.statusCode = response.status;\n parseError.bodyText = bodyText;\n throw parseError;\n }\n })\n .then((result: any) => {\n if (response.status >= 300) {\n // Network error\n throwServerError(\n response,\n result,\n `Response not successful: Received status code ${response.status}`,\n );\n }\n\n if (\n !Array.isArray(result) &&\n !hasOwnProperty.call(result, 'data') &&\n !hasOwnProperty.call(result, 'errors')\n ) {\n // Data error\n throwServerError(\n response,\n result,\n `Server response was missing for query '${\n Array.isArray(operations)\n ? operations.map(op => op.operationName)\n : operations.operationName\n }'.`,\n );\n }\n return result;\n });\n}\n", "import { InvariantError } from 'ts-invariant';\n\nexport type ClientParseError = InvariantError & {\n parseError: Error;\n};\n\nexport const serializeFetchParameter = (p: any, label: string) => {\n let serialized;\n try {\n serialized = JSON.stringify(p);\n } catch (e) {\n const parseError = new InvariantError(\n `Network request failed. ${label} is not serializable: ${e.message}`,\n ) as ClientParseError;\n parseError.parseError = e;\n throw parseError;\n }\n return serialized;\n};\n", "import { print } from 'graphql';\n\nimport { Operation } from '../core';\n\nexport interface UriFunction {\n (operation: Operation): string;\n}\n\nexport interface Body {\n query?: string;\n operationName?: string;\n variables?: Record<string, any>;\n extensions?: Record<string, any>;\n}\n\nexport interface HttpOptions {\n /**\n * The URI to use when fetching operations.\n *\n * Defaults to '/graphql'.\n */\n uri?: string | UriFunction;\n\n /**\n * Passes the extensions field to your graphql server.\n *\n * Defaults to false.\n */\n includeExtensions?: boolean;\n\n /**\n * A `fetch`-compatible API to use when making requests.\n */\n fetch?: WindowOrWorkerGlobalScope['fetch'];\n\n /**\n * An object representing values to be sent as headers on the request.\n */\n headers?: any;\n\n /**\n * The credentials policy you want to use for the fetch call.\n */\n credentials?: string;\n\n /**\n * Any overrides of the fetch options argument to pass to the fetch call.\n */\n fetchOptions?: any;\n\n /**\n * If set to true, use the HTTP GET method for query operations. Mutations\n * will still use the method specified in fetchOptions.method (which defaults\n * to POST).\n */\n useGETForQueries?: boolean;\n\n /**\n * If set to true, the default behavior of stripping unused variables\n * from the request will be disabled.\n *\n * Unused variables are likely to trigger server-side validation errors,\n * per https://spec.graphql.org/draft/#sec-All-Variables-Used, but this\n * includeUnusedVariables option can be useful if your server deviates\n * from the GraphQL specification by not strictly enforcing that rule.\n */\n includeUnusedVariables?: boolean;\n}\n\nexport interface HttpQueryOptions {\n includeQuery?: boolean;\n includeExtensions?: boolean;\n}\n\nexport interface HttpConfig {\n http?: HttpQueryOptions;\n options?: any;\n headers?: any;\n credentials?: any;\n}\n\nconst defaultHttpOptions: HttpQueryOptions = {\n includeQuery: true,\n includeExtensions: false,\n};\n\nconst defaultHeaders = {\n // headers are case insensitive (https://stackoverflow.com/a/5259004)\n accept: '*/*',\n 'content-type': 'application/json',\n};\n\nconst defaultOptions = {\n method: 'POST',\n};\n\nexport const fallbackHttpConfig = {\n http: defaultHttpOptions,\n headers: defaultHeaders,\n options: defaultOptions,\n};\n\nexport const selectHttpOptionsAndBody = (\n operation: Operation,\n fallbackConfig: HttpConfig,\n ...configs: Array<HttpConfig>\n) => {\n let options: HttpConfig & Record<string, any> = {\n ...fallbackConfig.options,\n headers: fallbackConfig.headers,\n credentials: fallbackConfig.credentials,\n };\n let http: HttpQueryOptions = fallbackConfig.http || {};\n\n /*\n * use the rest of the configs to populate the options\n * configs later in the list will overwrite earlier fields\n */\n configs.forEach(config => {\n options = {\n ...options,\n ...config.options,\n headers: {\n ...options.headers,\n ...config.headers,\n },\n };\n if (config.credentials) options.credentials = config.credentials;\n\n http = {\n ...http,\n ...config.http,\n };\n });\n\n //The body depends on the http options\n const { operationName, extensions, variables, query } = operation;\n const body: Body = { operationName, variables };\n\n if (http.includeExtensions) (body as any).extensions = extensions;\n\n // not sending the query (i.e persisted queries)\n if (http.includeQuery) (body as any).query = print(query);\n\n return {\n options,\n body,\n };\n};\n", "import { InvariantError } from 'ts-invariant';\n\nexport const checkFetcher = (fetcher: WindowOrWorkerGlobalScope['fetch'] | undefined) => {\n if (!fetcher && typeof fetch === 'undefined') {\n throw new InvariantError(`\n\"fetch\" has not been found globally and no fetcher has been \\\nconfigured. To fix this, install a fetch package (like \\\nhttps://www.npmjs.com/package/cross-fetch), instantiate the \\\nfetcher, and pass it into your HttpLink constructor. For example:\n\nimport fetch from 'cross-fetch';\nimport { ApolloClient, HttpLink } from '@apollo/client';\nconst client = new ApolloClient({\n link: new HttpLink({ uri: '/graphql', fetch })\n});\n `);\n }\n};\n", "export const createSignalIfSupported = () => {\n if (typeof AbortController === 'undefined')\n return { controller: false, signal: false };\n\n const controller = new AbortController();\n const signal = controller.signal;\n return { controller, signal };\n};\n", "import { Operation } from '../core';\n\nexport const selectURI = (\n operation: Operation,\n fallbackURI?: string | ((operation: Operation) => string),\n) => {\n const context = operation.getContext();\n const contextURI = context.uri;\n\n if (contextURI) {\n return contextURI;\n } else if (typeof fallbackURI === 'function') {\n return fallbackURI(operation);\n } else {\n return (fallbackURI as string) || '/graphql';\n }\n};\n", "import { serializeFetchParameter } from './serializeFetchParameter';\nimport { Body } from './selectHttpOptionsAndBody';\n\n// For GET operations, returns the given URI rewritten with parameters, or a\n// parse error.\nexport function rewriteURIForGET(chosenURI: string, body: Body) {\n // Implement the standard HTTP GET serialization, plus 'extensions'. Note\n // the extra level of JSON serialization!\n const queryParams: string[] = [];\n const addQueryParam = (key: string, value: string) => {\n queryParams.push(`${key}=${encodeURIComponent(value)}`);\n };\n\n if ('query' in body) {\n addQueryParam('query', body.query!);\n }\n if (body.operationName) {\n addQueryParam('operationName', body.operationName);\n }\n if (body.variables) {\n let serializedVariables;\n try {\n serializedVariables = serializeFetchParameter(\n body.variables,\n 'Variables map',\n );\n } catch (parseError) {\n return { parseError };\n }\n addQueryParam('variables', serializedVariables);\n }\n if (body.extensions) {\n let serializedExtensions;\n try {\n serializedExtensions = serializeFetchParameter(\n body.extensions,\n 'Extensions map',\n );\n } catch (parseError) {\n return { parseError };\n }\n addQueryParam('extensions', serializedExtensions);\n }\n\n // Reconstruct the URI with added query params.\n // XXX This assumes that the URI is well-formed and that it doesn't\n // already contain any of these query params. We could instead use the\n // URL API and take a polyfill (whatwg-url@6) for older browsers that\n // don't support URLSearchParams. Note that some browsers (and\n // versions of whatwg-url) support URL but not URLSearchParams!\n let fragment = '',\n preFragment = chosenURI;\n const fragmentStart = chosenURI.indexOf('#');\n if (fragmentStart !== -1) {\n fragment = chosenURI.substr(fragmentStart);\n preFragment = chosenURI.substr(0, fragmentStart);\n }\n const queryParamsPrefix = preFragment.indexOf('?') === -1 ? '?' : '&';\n const newURI =\n preFragment + queryParamsPrefix + queryParams.join('&') + fragment;\n return { newURI };\n}\n", "import { visit, DefinitionNode, VariableDefinitionNode } from 'graphql';\n\nimport { ApolloLink } from '../core';\nimport { Observable } from '../../utilities';\nimport { serializeFetchParameter } from './serializeFetchParameter';\nimport { selectURI } from './selectURI';\nimport { parseAndCheckHttpResponse } from './parseAndCheckHttpResponse';\nimport { checkFetcher } from './checkFetcher';\nimport {\n selectHttpOptionsAndBody,\n fallbackHttpConfig,\n HttpOptions\n} from './selectHttpOptionsAndBody';\nimport { createSignalIfSupported } from './createSignalIfSupported';\nimport { rewriteURIForGET } from './rewriteURIForGET';\nimport { fromError } from '../utils';\n\nexport const createHttpLink = (linkOptions: HttpOptions = {}) => {\n let {\n uri = '/graphql',\n // use default global fetch if nothing passed in\n fetch: fetcher,\n includeExtensions,\n useGETForQueries,\n includeUnusedVariables = false,\n ...requestOptions\n } = linkOptions;\n\n // dev warnings to ensure fetch is present\n checkFetcher(fetcher);\n\n //fetcher is set here rather than the destructuring to ensure fetch is\n //declared before referencing it. Reference in the destructuring would cause\n //a ReferenceError\n if (!fetcher) {\n fetcher = fetch;\n }\n\n const linkConfig = {\n http: { includeExtensions },\n options: requestOptions.fetchOptions,\n credentials: requestOptions.credentials,\n headers: requestOptions.headers,\n };\n\n return new ApolloLink(operation => {\n let chosenURI = selectURI(operation, uri);\n\n const context = operation.getContext();\n\n // `apollographql-client-*` headers are automatically set if a\n // `clientAwareness` object is found in the context. These headers are\n // set first, followed by the rest of the headers pulled from\n // `context.headers`. If desired, `apollographql-client-*` headers set by\n // the `clientAwareness` object can be overridden by\n // `apollographql-client-*` headers set in `context.headers`.\n const clientAwarenessHeaders: {\n 'apollographql-client-name'?: string;\n 'apollographql-client-version'?: string;\n } = {};\n\n if (context.clientAwareness) {\n const { name, version } = context.clientAwareness;\n if (name) {\n clientAwarenessHeaders['apollographql-client-name'] = name;\n }\n if (version) {\n clientAwarenessHeaders['apollographql-client-version'] = version;\n }\n }\n\n const contextHeaders = { ...clientAwarenessHeaders, ...context.headers };\n\n const contextConfig = {\n http: context.http,\n options: context.fetchOptions,\n credentials: context.credentials,\n headers: contextHeaders,\n };\n\n //uses fallback, link, and then context to build options\n const { options, body } = selectHttpOptionsAndBody(\n operation,\n fallbackHttpConfig,\n linkConfig,\n contextConfig,\n );\n\n if (body.variables && !includeUnusedVariables) {\n const unusedNames = new Set(Object.keys(body.variables));\n visit(operation.query, {\n Variable(node, _key, parent) {\n // A variable type definition at the top level of a query is not\n // enough to silence server-side errors about the variable being\n // unused, so variable definitions do not count as usage.\n // https://spec.graphql.org/draft/#sec-All-Variables-Used\n if (parent && (parent as VariableDefinitionNode).kind !== 'VariableDefinition') {\n unusedNames.delete(node.name.value);\n }\n },\n });\n if (unusedNames.size) {\n // Make a shallow copy of body.variables (with keys in the same\n // order) and then delete unused variables from the copy.\n body.variables = { ...body.variables };\n unusedNames.forEach(name => {\n delete body.variables![name];\n });\n }\n }\n\n let controller: any;\n if (!(options as any).signal) {\n const { controller: _controller, signal } = createSignalIfSupported();\n controller = _controller;\n if (controller) (options as any).signal = signal;\n }\n\n // If requested, set method to GET if there are no mutations.\n const definitionIsMutation = (d: DefinitionNode) => {\n return d.kind === 'OperationDefinition' && d.operation === 'mutation';\n };\n if (\n useGETForQueries &&\n !operation.query.definitions.some(definitionIsMutation)\n ) {\n options.method = 'GET';\n }\n\n if (options.method === 'GET') {\n const { newURI, parseError } = rewriteURIForGET(chosenURI, body);\n if (parseError) {\n return fromError(parseError);\n }\n chosenURI = newURI;\n } else {\n try {\n (options as any).body = serializeFetchParameter(body, 'Payload');\n } catch (parseError) {\n return fromError(parseError);\n }\n }\n\n return new Observable(observer => {\n fetcher!(chosenURI, options)\n .then(response => {\n operation.setContext({ response });\n return response;\n })\n .then(parseAndCheckHttpResponse(operation))\n .then(result => {\n // we have data and can send it to back up the link chain\n observer.next(result);\n observer.complete();\n return result;\n })\n .catch(err => {\n // fetch was cancelled so it's already been cleaned up in the unsubscribe\n if (err.name === 'AbortError') return;\n // if it is a network error, BUT there is graphql result info\n // fire the next observer before calling error\n // this gives apollo-client (and react-apollo) the `graphqlErrors` and `networErrors`\n // to pass to UI\n // this should only happen if we *also* have data as part of the response key per\n // the spec\n if (err.result && err.result.errors && err.result.data) {\n // if we don't call next, the UI can only show networkError because AC didn't\n // get any graphqlErrors\n // this is graphql execution result info (i.e errors and possibly data)\n // this is because there is no formal spec how errors should translate to\n // http status codes. So an auth error (401) could have both data\n // from a public field, errors from a private field, and a status of 401\n // {\n // user { // this will have errors\n // firstName\n // }\n // products { // this is public so will have data\n // cost\n // }\n // }\n //\n // the result of above *could* look like this:\n // {\n // data: { products: [{ cost: \"$10\" }] },\n // errors: [{\n // message: 'your session has timed out',\n // path: []\n // }]\n // }\n // status code of above would be a 401\n // in the UI you want to show data where you can, errors as data where you can\n // and use correct http status codes\n observer.next(err.result);\n }\n observer.error(err);\n });\n\n return () => {\n // XXX support canceling this request\n // https://developers.google.com/web/updates/2017/09/abortable-fetch\n if (controller) controller.abort();\n };\n });\n });\n};\n", "import { ApolloLink, RequestHandler } from '../core';\nimport { HttpOptions } from './selectHttpOptionsAndBody';\nimport { createHttpLink } from './createHttpLink';\n\nexport class HttpLink extends ApolloLink {\n public requester: RequestHandler;\n constructor(public options: HttpOptions = {}) {\n super(createHttpLink(options).request);\n }\n}\n", "const { toString, hasOwnProperty } = Object.prototype;\nconst fnToStr = Function.prototype.toString;\nconst previousComparisons = new Map<object, Set<object>>();\n\n/**\n * Performs a deep equality check on two JavaScript values, tolerating cycles.\n */\nexport function equal(a: any, b: any): boolean {\n try {\n return check(a, b);\n } finally {\n previousComparisons.clear();\n }\n}\n\n// Allow default imports as well.\nexport default equal;\n\nfunction check(a: any, b: any): boolean {\n // If the two values are strictly equal, our job is easy.\n if (a === b) {\n return true;\n }\n\n // Object.prototype.toString returns a representation of the runtime type of\n // the given value that is considerably more precise than typeof.\n const aTag = toString.call(a);\n const bTag = toString.call(b);\n\n // If the runtime types of a and b are different, they could maybe be equal\n // under some interpretation of equality, but for simplicity and performance\n // we just return false instead.\n if (aTag !== bTag) {\n return false;\n }\n\n switch (aTag) {\n case '[object Array]':\n // Arrays are a lot like other objects, but we can cheaply compare their\n // lengths as a short-cut before comparing their elements.\n if (a.length !== b.length) return false;\n // Fall through to object case...\n case '[object Object]': {\n if (previouslyCompared(a, b)) return true;\n\n const aKeys = definedKeys(a);\n const bKeys = definedKeys(b);\n\n // If `a` and `b` have a different number of enumerable keys, they\n // must be different.\n const keyCount = aKeys.length;\n if (keyCount !== bKeys.length) return false;\n\n // Now make sure they have the same keys.\n for (let k = 0; k < keyCount; ++k) {\n if (!hasOwnProperty.call(b, aKeys[k])) {\n return false;\n }\n }\n\n // Finally, check deep equality of all child properties.\n for (let k = 0; k < keyCount; ++k) {\n const key = aKeys[k];\n if (!check(a[key], b[key])) {\n return false;\n }\n }\n\n return true;\n }\n\n case '[object Error]':\n return a.name === b.name && a.message === b.message;\n\n case '[object Number]':\n // Handle NaN, which is !== itself.\n if (a !== a) return b !== b;\n // Fall through to shared +a === +b case...\n case '[object Boolean]':\n case '[object Date]':\n return +a === +b;\n\n case '[object RegExp]':\n case '[object String]':\n return a == `${b}`;\n\n case '[object Map]':\n case '[object Set]': {\n if (a.size !== b.size) return false;\n if (previouslyCompared(a, b)) return true;\n\n const aIterator = a.entries();\n const isMap = aTag === '[object Map]';\n\n while (true) {\n const info = aIterator.next();\n if (info.done) break;\n\n // If a instanceof Set, aValue === aKey.\n const [aKey, aValue] = info.value;\n\n // So this works the same way for both Set and Map.\n if (!b.has(aKey)) {\n return false;\n }\n\n // However, we care about deep equality of values only when dealing\n // with Map structures.\n if (isMap && !check(aValue, b.get(aKey))) {\n return false;\n }\n }\n\n return true;\n }\n\n case '[object Uint16Array]':\n case '[object Uint8Array]': // Buffer, in Node.js.\n case '[object Uint32Array]':\n case '[object Int32Array]':\n case '[object Int8Array]':\n case '[object Int16Array]':\n case '[object ArrayBuffer]':\n // DataView doesn't need these conversions, but the equality check is\n // otherwise the same.\n a = new Uint8Array(a);\n b = new Uint8Array(b);\n // Fall through...\n case '[object DataView]': {\n let len = a.byteLength;\n if (len === b.byteLength) {\n while (len-- && a[len] === b[len]) {\n // Keep looping as long as the bytes are equal.\n }\n }\n return len === -1;\n }\n\n case '[object AsyncFunction]':\n case '[object GeneratorFunction]':\n case '[object AsyncGeneratorFunction]':\n case '[object Function]': {\n const aCode = fnToStr.call(a);\n if (aCode !== fnToStr.call(b)) {\n return false;\n }\n\n // We consider non-native functions equal if they have the same code\n // (native functions require === because their code is censored).\n // Note that this behavior is not entirely sound, since !== function\n // objects with the same code can behave differently depending on\n // their closure scope. However, any function can behave differently\n // depending on the values of its input arguments (including this)\n // and its calling context (including its closure scope), even\n // though the function object is === to itself; and it is entirely\n // possible for functions that are not === to behave exactly the\n // same under all conceivable circumstances. Because none of these\n // factors are statically decidable in JavaScript, JS function\n // equality is not well-defined. This ambiguity allows us to\n // consider the best possible heuristic among various imperfect\n // options, and equating non-native functions that have the same\n // code has enormous practical benefits, such as when comparing\n // functions that are repeatedly passed as fresh function\n // expressions within objects that are otherwise deeply equal. Since\n // any function created from the same syntactic expression (in the\n // same code location) will always stringify to the same code\n // according to fnToStr.call, we can reasonably expect these\n // repeatedly passed function expressions to have the same code, and\n // thus behave \"the same\" (with all the caveats mentioned above),\n // even though the runtime function objects are !== to one another.\n return !endsWith(aCode, nativeCodeSuffix);\n }\n }\n\n // Otherwise the values are not equal.\n return false;\n}\n\nfunction definedKeys<TObject extends object>(obj: TObject) {\n // Remember that the second argument to Array.prototype.filter will be\n // used as `this` within the callback function.\n return Object.keys(obj).filter(isDefinedKey, obj);\n}\nfunction isDefinedKey<TObject extends object>(\n this: TObject,\n key: keyof TObject,\n) {\n return this[key] !== void 0;\n}\n\nconst nativeCodeSuffix = \"{ [native code] }\";\n\nfunction endsWith(full: string, suffix: string) {\n const fromIndex = full.length - suffix.length;\n return fromIndex >= 0 &&\n full.indexOf(suffix, fromIndex) === fromIndex;\n}\n\nfunction previouslyCompared(a: object, b: object): boolean {\n // Though cyclic references can make an object graph appear infinite from the\n // perspective of a depth-first traversal, the graph still contains a finite\n // number of distinct object references. We use the previousComparisons cache\n // to avoid comparing the same pair of object references more than once, which\n // guarantees termination (even if we end up comparing every object in one\n // graph to every object in the other graph, which is extremely unlikely),\n // while still allowing weird isomorphic structures (like rings with different\n // lengths) a chance to pass the equality test.\n let bSet = previousComparisons.get(a);\n if (bSet) {\n // Return true here because we can be sure false will be returned somewhere\n // else if the objects are not equivalent.\n if (bSet.has(b)) return true;\n } else {\n previousComparisons.set(a, bSet = new Set);\n }\n bSet.add(b);\n return false;\n}\n", "import { GraphQLError } from 'graphql';\n\nimport { isNonEmptyArray } from '../utilities';\nimport { ServerParseError } from '../link/http';\nimport { ServerError } from '../link/utils';\n\nexport function isApolloError(err: Error): err is ApolloError {\n return err.hasOwnProperty('graphQLErrors');\n}\n\n// Sets the error message on this error according to the\n// the GraphQL and network errors that are present.\n// If the error message has already been set through the\n// constructor or otherwise, this function is a nop.\nconst generateErrorMessage = (err: ApolloError) => {\n let message = '';\n // If we have GraphQL errors present, add that to the error message.\n if (isNonEmptyArray(err.graphQLErrors)) {\n err.graphQLErrors.forEach((graphQLError: GraphQLError) => {\n const errorMessage = graphQLError\n ? graphQLError.message\n : 'Error message not found.';\n message += `${errorMessage}\\n`;\n });\n }\n\n if (err.networkError) {\n message += `${err.networkError.message}\\n`;\n }\n\n // strip newline from the end of the message\n message = message.replace(/\\n$/, '');\n return message;\n};\n\nexport class ApolloError extends Error {\n public message: string;\n public graphQLErrors: ReadonlyArray<GraphQLError>;\n public networkError: Error | ServerParseError | ServerError | null;\n\n // An object that can be used to provide some additional information\n // about an error, e.g. specifying the type of error this is. Used\n // internally within Apollo Client.\n public extraInfo: any;\n\n // Constructs an instance of ApolloError given a GraphQLError\n // or a network error. Note that one of these has to be a valid\n // value or the constructed error will be meaningless.\n constructor({\n graphQLErrors,\n networkError,\n errorMessage,\n extraInfo,\n }: {\n graphQLErrors?: ReadonlyArray<GraphQLError>;\n networkError?: Error | ServerParseError | ServerError | null;\n errorMessage?: string;\n extraInfo?: any;\n }) {\n super(errorMessage);\n this.graphQLErrors = graphQLErrors || [];\n this.networkError = networkError || null;\n this.message = errorMessage || generateErrorMessage(this);\n this.extraInfo = extraInfo;\n\n // We're not using `Object.setPrototypeOf` here as it isn't fully\n // supported on Android (see issue #3236).\n (this as any).__proto__ = ApolloError.prototype;\n }\n}\n", "/**\n * The current status of a query\u2019s execution in our system.\n */\nexport enum NetworkStatus {\n /**\n * The query has never been run before and the query is now currently running. A query will still\n * have this network status even if a partial data result was returned from the cache, but a\n * query was dispatched anyway.\n */\n loading = 1,\n\n /**\n * If `setVariables` was called and a query was fired because of that then the network status\n * will be `setVariables` until the result of that query comes back.\n */\n setVariables = 2,\n\n /**\n * Indicates that `fetchMore` was called on this query and that the query created is currently in\n * flight.\n */\n fetchMore = 3,\n\n /**\n * Similar to the `setVariables` network status. It means that `refetch` was called on a query\n * and the refetch request is currently in flight.\n */\n refetch = 4,\n\n /**\n * Indicates that a polling query is currently in flight. So for example if you are polling a\n * query every 10 seconds then the network status will switch to `poll` every 10 seconds whenever\n * a poll request has been sent but not resolved.\n */\n poll = 6,\n\n /**\n * No request is in flight for this query, and no errors happened. Everything is OK.\n */\n ready = 7,\n\n /**\n * No request is in flight for this query, but one or more errors were detected.\n */\n error = 8,\n}\n\n/**\n * Returns true if there is currently a network request in flight according to a given network\n * status.\n */\nexport function isNetworkRequestInFlight(\n networkStatus?: NetworkStatus,\n): boolean {\n return networkStatus ? networkStatus < 7 : false;\n}\n", "import { WatchQueryOptions } from './watchQueryOptions';\nimport { NetworkStatus } from './networkStatus';\nimport { ApolloQueryResult } from './types';\nimport { Observer, Concast, compact } from '../utilities';\nimport { invariant } from 'ts-invariant';\n\n// Given that QueryManager#fetchQueryObservable returns only a single\n// query's worth of results, other code must be responsible for repeatedly\n// calling fetchQueryObservable, while ensuring that the ObservableQuery\n// consuming those results remains subscribed to the concatenation of all\n// the observables returned by fetchQueryObservable. That responsibility\n// falls to this Reobserver class. As a bonus, the Reobserver class is\n// perfectly poised to handle polling logic, since polling is essentially\n// repeated reobservation. In principle, this code could have remained in\n// the ObservableQuery class, but I felt it would be easier to explain and\n// understand reobservation if it was confined to a separate class.\nexport class Reobserver<TData, TVars> {\n constructor(\n private observer: Observer<ApolloQueryResult<TData>>,\n private options: WatchQueryOptions<TVars, TData>,\n // Almost certainly just a wrapper function around\n // QueryManager#fetchQueryObservable, but this small dose of\n // indirection means the Reobserver doesn't have to know/assume\n // anything about the QueryManager class.\n private fetch: (\n options: WatchQueryOptions<TVars, TData>,\n newNetworkStatus?: NetworkStatus,\n ) => Concast<ApolloQueryResult<TData>>,\n // If we're polling, there may be times when we should avoid fetching,\n // such as when the query is already in flight, or polling has been\n // completely disabled for server-side rendering. Passing false for\n // this parameter disables polling completely, and passing a boolean\n // function allows determining fetch safety dynamically.\n private shouldFetch: false | (() => boolean),\n ) {}\n\n private concast?: Concast<ApolloQueryResult<TData>>;\n\n public reobserve(\n newOptions?: Partial<WatchQueryOptions<TVars, TData>>,\n newNetworkStatus?: NetworkStatus,\n ): Promise<ApolloQueryResult<TData>> {\n if (newOptions) {\n this.updateOptions(newOptions);\n } else {\n // When we call this.updateOptions(newOptions) in the branch above,\n // it takes care of calling this.updatePolling(). In this branch, we\n // still need to update polling, even if there were no newOptions.\n this.updatePolling();\n }\n\n const concast = this.fetch(this.options, newNetworkStatus);\n\n if (this.concast) {\n // We use the {add,remove}Observer methods directly to avoid\n // wrapping observer with an unnecessary SubscriptionObserver\n // object, in part so that we can remove it here without triggering\n // any unsubscriptions, because we just want to ignore the old\n // observable, not prematurely shut it down, since other consumers\n // may be awaiting this.concast.promise.\n this.concast.removeObserver(this.observer, true);\n }\n\n concast.addObserver(this.observer);\n\n return (this.concast = concast).promise;\n }\n\n public updateOptions(newOptions: Partial<WatchQueryOptions<TVars, TData>>) {\n Object.assign(this.options, compact(newOptions));\n this.updatePolling();\n return this;\n }\n\n public stop() {\n if (this.concast) {\n this.concast.removeObserver(this.observer);\n delete this.concast;\n }\n\n if (this.pollingInfo) {\n clearTimeout(this.pollingInfo.timeout);\n this.options.pollInterval = 0;\n this.updatePolling();\n }\n }\n\n private pollingInfo?: {\n interval: number;\n timeout: ReturnType<typeof setTimeout>;\n };\n\n // Turns polling on or off based on this.options.pollInterval.\n private updatePolling() {\n const {\n pollingInfo,\n options: {\n pollInterval,\n },\n } = this;\n\n if (!pollInterval) {\n if (pollingInfo) {\n clearTimeout(pollingInfo.timeout);\n delete this.pollingInfo;\n }\n return;\n }\n\n if (pollingInfo &&\n pollingInfo.interval === pollInterval) {\n return;\n }\n\n invariant(\n pollInterval,\n 'Attempted to start a polling query without a polling interval.',\n );\n\n // Go no further if polling is disabled.\n if (this.shouldFetch === false) {\n return;\n }\n\n const info = pollingInfo || (\n this.pollingInfo = {} as Reobserver<TData, TVars>[\"pollingInfo\"]\n )!;\n\n info.interval = pollInterval;\n\n const maybeFetch = () => {\n if (this.pollingInfo) {\n if (this.shouldFetch && this.shouldFetch()) {\n this.reobserve({\n fetchPolicy: \"network-only\",\n nextFetchPolicy: this.options.fetchPolicy || \"cache-first\",\n }, NetworkStatus.poll).then(poll, poll);\n } else {\n poll();\n }\n };\n };\n\n const poll = () => {\n const info = this.pollingInfo;\n if (info) {\n clearTimeout(info.timeout);\n info.timeout = setTimeout(maybeFetch, info.interval);\n }\n };\n\n poll();\n }\n}\n", "import { invariant } from 'ts-invariant';\nimport { equal } from '@wry/equality';\n\nimport { NetworkStatus, isNetworkRequestInFlight } from './networkStatus';\nimport {\n cloneDeep,\n getOperationDefinition,\n Observable,\n Observer,\n ObservableSubscription,\n iterateObserversSafely,\n isNonEmptyArray,\n fixObservableSubclass,\n} from '../utilities';\nimport { ApolloError } from '../errors';\nimport { QueryManager } from './QueryManager';\nimport { ApolloQueryResult, OperationVariables } from './types';\nimport {\n WatchQueryOptions,\n FetchMoreQueryOptions,\n SubscribeToMoreOptions,\n} from './watchQueryOptions';\nimport { Reobserver } from './Reobserver';\nimport { QueryInfo } from './QueryInfo';\n\nexport interface FetchMoreOptions<\n TData = any,\n TVariables = OperationVariables\n> {\n updateQuery?: (\n previousQueryResult: TData,\n options: {\n fetchMoreResult?: TData;\n variables?: TVariables;\n },\n ) => TData;\n}\n\nexport interface UpdateQueryOptions<TVariables> {\n variables?: TVariables;\n}\n\nlet warnedAboutUpdateQuery = false;\n\nexport class ObservableQuery<\n TData = any,\n TVariables = OperationVariables\n> extends Observable<ApolloQueryResult<TData>> {\n public readonly options: WatchQueryOptions<TVariables, TData>;\n public readonly queryId: string;\n public readonly queryName?: string;\n\n // Computed shorthand for this.options.variables, preserved for\n // backwards compatibility.\n public get variables(): TVariables | undefined {\n return this.options.variables;\n }\n\n private isTornDown: boolean;\n private queryManager: QueryManager<any>;\n private observers = new Set<Observer<ApolloQueryResult<TData>>>();\n private subscriptions = new Set<ObservableSubscription>();\n\n private lastResult: ApolloQueryResult<TData>;\n private lastResultSnapshot: ApolloQueryResult<TData>;\n private lastError: ApolloError;\n private queryInfo: QueryInfo;\n\n constructor({\n queryManager,\n queryInfo,\n options,\n }: {\n queryManager: QueryManager<any>;\n queryInfo: QueryInfo;\n options: WatchQueryOptions<TVariables, TData>;\n }) {\n super((observer: Observer<ApolloQueryResult<TData>>) =>\n this.onSubscribe(observer),\n );\n\n // active state\n this.isTornDown = false;\n\n // query information\n this.options = options;\n this.queryId = queryManager.generateQueryId();\n\n const opDef = getOperationDefinition(options.query);\n this.queryName = opDef && opDef.name && opDef.name.value;\n\n // related classes\n this.queryManager = queryManager;\n\n this.queryInfo = queryInfo;\n }\n\n public result(): Promise<ApolloQueryResult<TData>> {\n return new Promise((resolve, reject) => {\n const observer: Observer<ApolloQueryResult<TData>> = {\n next: (result: ApolloQueryResult<TData>) => {\n resolve(result);\n\n // Stop the query within the QueryManager if we can before\n // this function returns.\n //\n // We do this in order to prevent observers piling up within\n // the QueryManager. Notice that we only fully unsubscribe\n // from the subscription in a setTimeout(..., 0) call. This call can\n // actually be handled by the browser at a much later time. If queries\n // are fired in the meantime, observers that should have been removed\n // from the QueryManager will continue to fire, causing an unnecessary\n // performance hit.\n this.observers.delete(observer);\n if (!this.observers.size) {\n this.queryManager.removeQuery(this.queryId);\n }\n\n setTimeout(() => {\n subscription.unsubscribe();\n }, 0);\n },\n error: reject,\n };\n const subscription = this.subscribe(observer);\n });\n }\n\n public getCurrentResult(saveAsLastResult = true): ApolloQueryResult<TData> {\n const { lastResult } = this;\n\n const networkStatus =\n this.queryInfo.networkStatus ||\n (lastResult && lastResult.networkStatus) ||\n NetworkStatus.ready;\n\n const result: ApolloQueryResult<TData> = {\n ...lastResult,\n loading: isNetworkRequestInFlight(networkStatus),\n networkStatus,\n };\n\n if (this.isTornDown) {\n return result;\n }\n\n const { fetchPolicy = 'cache-first' } = this.options;\n if (fetchPolicy === 'no-cache' ||\n fetchPolicy === 'network-only') {\n // Similar to setting result.partial to false, but taking advantage\n // of the falsiness of missing fields.\n delete result.partial;\n } else if (\n !result.data ||\n // If this.options.query has @client(always: true) fields, we cannot\n // trust result.data, since it was read from the cache without\n // running local resolvers (and it's too late to run resolvers now,\n // since we must return a result synchronously). TODO In the future\n // (after Apollo Client 3.0), we should find a way to trust\n // this.lastResult in more cases, and read from the cache only in\n // cases when no result has been received yet.\n !this.queryManager.transform(this.options.query).hasForcedResolvers\n ) {\n const diff = this.queryInfo.getDiff();\n result.data = (\n diff.complete ||\n this.options.returnPartialData\n ) ? diff.result : void 0;\n if (diff.complete) {\n // If the diff is complete, and we're using a FetchPolicy that\n // terminates after a complete cache read, we can assume the next\n // result we receive will have NetworkStatus.ready and !loading.\n if (result.networkStatus === NetworkStatus.loading &&\n (fetchPolicy === 'cache-first' ||\n fetchPolicy === 'cache-only')) {\n result.networkStatus = NetworkStatus.ready;\n result.loading = false;\n }\n delete result.partial;\n } else {\n result.partial = true;\n }\n }\n\n if (saveAsLastResult) {\n this.updateLastResult(result);\n }\n\n return result;\n }\n\n // Compares newResult to the snapshot we took of this.lastResult when it was\n // first received.\n public isDifferentFromLastResult(newResult: ApolloQueryResult<TData>) {\n return !equal(this.lastResultSnapshot, newResult);\n }\n\n // Returns the last result that observer.next was called with. This is not the same as\n // getCurrentResult! If you're not sure which you need, then you probably need getCurrentResult.\n public getLastResult(): ApolloQueryResult<TData> {\n return this.lastResult;\n }\n\n public getLastError(): ApolloError {\n return this.lastError;\n }\n\n public resetLastResults(): void {\n delete this.lastResult;\n delete this.lastResultSnapshot;\n delete this.lastError;\n this.isTornDown = false;\n }\n\n public resetQueryStoreErrors() {\n this.queryManager.resetErrors(this.queryId);\n }\n\n /**\n * Update the variables of this observable query, and fetch the new results.\n * This method should be preferred over `setVariables` in most use cases.\n *\n * @param variables: The new set of variables. If there are missing variables,\n * the previous values of those variables will be used.\n */\n public refetch(variables?: Partial<TVariables>): Promise<ApolloQueryResult<TData>> {\n const reobserveOptions: Partial<WatchQueryOptions<TVariables, TData>> = {\n // Always disable polling for refetches.\n pollInterval: 0,\n };\n\n // Unless the provided fetchPolicy always consults the network\n // (no-cache, network-only, or cache-and-network), override it with\n // network-only to force the refetch for this fetchQuery call.\n const { fetchPolicy } = this.options;\n if (fetchPolicy !== 'no-cache' &&\n fetchPolicy !== 'cache-and-network') {\n reobserveOptions.fetchPolicy = 'network-only';\n // Go back to the original options.fetchPolicy after this refetch.\n reobserveOptions.nextFetchPolicy = fetchPolicy || \"cache-first\";\n }\n\n if (variables && !equal(this.options.variables, variables)) {\n // Update the existing options with new variables\n reobserveOptions.variables = this.options.variables = {\n ...this.options.variables,\n ...variables,\n } as TVariables;\n }\n\n return this.newReobserver(false).reobserve(\n reobserveOptions,\n NetworkStatus.refetch,\n );\n }\n\n public fetchMore<K extends keyof TVariables>(\n fetchMoreOptions: FetchMoreQueryOptions<TVariables, K, TData> &\n FetchMoreOptions<TData, TVariables>,\n ): Promise<ApolloQueryResult<TData>> {\n const combinedOptions = {\n ...(fetchMoreOptions.query ? fetchMoreOptions : {\n ...this.options,\n ...fetchMoreOptions,\n variables: {\n ...this.options.variables,\n ...fetchMoreOptions.variables,\n },\n }),\n // The fetchMore request goes immediately to the network and does\n // not automatically write its result to the cache (hence no-cache\n // instead of network-only), because we allow the caller of\n // fetchMore to provide an updateQuery callback that determines how\n // the data gets written to the cache.\n fetchPolicy: \"no-cache\",\n } as WatchQueryOptions;\n\n const qid = this.queryManager.generateQueryId();\n\n // Simulate a loading result for the original query with\n // result.networkStatus === NetworkStatus.fetchMore.\n if (combinedOptions.notifyOnNetworkStatusChange) {\n this.queryInfo.networkStatus = NetworkStatus.fetchMore;\n this.observe();\n }\n\n return this.queryManager.fetchQuery(\n qid,\n combinedOptions,\n NetworkStatus.fetchMore,\n ).then(fetchMoreResult => {\n const data = fetchMoreResult.data as TData;\n const { updateQuery } = fetchMoreOptions;\n\n if (updateQuery) {\n if (process.env.NODE_ENV !== \"production\" &&\n !warnedAboutUpdateQuery) {\n invariant.warn(\n`The updateQuery callback for fetchMore is deprecated, and will be removed\nin the next major version of Apollo Client.\n\nPlease convert updateQuery functions to field policies with appropriate\nread and merge functions, or use/adapt a helper function (such as\nconcatPagination, offsetLimitPagination, or relayStylePagination) from\n@apollo/client/utilities.\n\nThe field policy system handles pagination more effectively than a\nhand-written updateQuery function, and you only need to define the policy\nonce, rather than every time you call fetchMore.`);\n warnedAboutUpdateQuery = true;\n }\n this.updateQuery(previous => updateQuery(previous, {\n fetchMoreResult: data,\n variables: combinedOptions.variables as TVariables,\n }));\n } else {\n // If we're using a field policy instead of updateQuery, the only\n // thing we need to do is write the new data to the cache using\n // combinedOptions.variables (instead of this.variables, which is\n // what this.updateQuery uses, because it works by abusing the\n // original field value, keyed by the original variables).\n this.queryManager.cache.writeQuery({\n query: combinedOptions.query,\n variables: combinedOptions.variables,\n data,\n });\n }\n\n return fetchMoreResult as ApolloQueryResult<TData>;\n\n }).finally(() => {\n this.queryManager.stopQuery(qid);\n this.reobserve();\n });\n }\n\n // XXX the subscription variables are separate from the query variables.\n // if you want to update subscription variables, right now you have to do that separately,\n // and you can only do it by stopping the subscription and then subscribing again with new variables.\n public subscribeToMore<\n TSubscriptionData = TData,\n TSubscriptionVariables = TVariables\n >(\n options: SubscribeToMoreOptions<\n TData,\n TSubscriptionVariables,\n TSubscriptionData\n >,\n ) {\n const subscription = this.queryManager\n .startGraphQLSubscription({\n query: options.document,\n variables: options.variables,\n context: options.context,\n })\n .subscribe({\n next: (subscriptionData: { data: TSubscriptionData }) => {\n const { updateQuery } = options;\n if (updateQuery) {\n this.updateQuery<TSubscriptionVariables>(\n (previous, { variables }) =>\n updateQuery(previous, {\n subscriptionData,\n variables,\n }),\n );\n }\n },\n error: (err: any) => {\n if (options.onError) {\n options.onError(err);\n return;\n }\n invariant.error('Unhandled GraphQL subscription error', err);\n },\n });\n\n this.subscriptions.add(subscription);\n\n return () => {\n if (this.subscriptions.delete(subscription)) {\n subscription.unsubscribe();\n }\n };\n }\n\n public setOptions(\n newOptions: Partial<WatchQueryOptions<TVariables, TData>>,\n ): Promise<ApolloQueryResult<TData>> {\n return this.reobserve(newOptions);\n }\n\n /**\n * This is for *internal* use only. Most users should instead use `refetch`\n * in order to be properly notified of results even when they come from cache.\n *\n * Update the variables of this observable query, and fetch the new results\n * if they've changed. If you want to force new results, use `refetch`.\n *\n * Note: the `next` callback will *not* fire if the variables have not changed\n * or if the result is coming from cache.\n *\n * Note: the promise will return the old results immediately if the variables\n * have not changed.\n *\n * Note: the promise will return null immediately if the query is not active\n * (there are no subscribers).\n *\n * @private\n *\n * @param variables: The new set of variables. If there are missing variables,\n * the previous values of those variables will be used.\n *\n * @param tryFetch: Try and fetch new results even if the variables haven't\n * changed (we may still just hit the store, but if there's nothing in there\n * this will refetch)\n */\n public setVariables(\n variables: TVariables,\n ): Promise<ApolloQueryResult<TData> | void> {\n if (equal(this.variables, variables)) {\n // If we have no observers, then we don't actually want to make a network\n // request. As soon as someone observes the query, the request will kick\n // off. For now, we just store any changes. (See #1077)\n return this.observers.size\n ? this.result()\n : Promise.resolve();\n }\n\n this.options.variables = variables;\n\n // See comment above\n if (!this.observers.size) {\n return Promise.resolve();\n }\n\n let { fetchPolicy = 'cache-first' } = this.options;\n const reobserveOptions: Partial<WatchQueryOptions<TVariables, TData>> = {\n fetchPolicy,\n variables,\n };\n\n if (fetchPolicy !== 'cache-first' &&\n fetchPolicy !== 'no-cache' &&\n fetchPolicy !== 'network-only') {\n reobserveOptions.fetchPolicy = 'cache-and-network';\n reobserveOptions.nextFetchPolicy = fetchPolicy;\n }\n\n return this.reobserve(\n reobserveOptions,\n NetworkStatus.setVariables,\n );\n }\n\n public updateQuery<TVars = TVariables>(\n mapFn: (\n previousQueryResult: TData,\n options: Pick<WatchQueryOptions<TVars, TData>, \"variables\">,\n ) => TData,\n ): void {\n const { queryManager } = this;\n const { result } = queryManager.cache.diff<TData>({\n query: this.options.query,\n variables: this.variables,\n previousResult: this.lastResult?.data,\n returnPartialData: true,\n optimistic: false,\n });\n\n const newResult = mapFn(result!, {\n variables: (this as any).variables,\n });\n\n if (newResult) {\n queryManager.cache.writeQuery({\n query: this.options.query,\n data: newResult,\n variables: this.variables,\n });\n\n queryManager.broadcastQueries();\n }\n }\n\n public startPolling(pollInterval: number) {\n this.getReobserver().updateOptions({ pollInterval });\n }\n\n public stopPolling() {\n if (this.reobserver) {\n this.reobserver.updateOptions({ pollInterval: 0 });\n }\n }\n\n private updateLastResult(newResult: ApolloQueryResult<TData>) {\n const previousResult = this.lastResult;\n this.lastResult = newResult;\n this.lastResultSnapshot = this.queryManager.assumeImmutableResults\n ? newResult\n : cloneDeep(newResult);\n if (!isNonEmptyArray(newResult.errors)) {\n delete this.lastError;\n }\n return previousResult;\n }\n\n private onSubscribe(observer: Observer<ApolloQueryResult<TData>>) {\n // Subscribing using this.observer will create an infinite notificaion\n // loop, but the intent of broadcasting results to all the other\n // this.observers can be satisfied without doing anything, which is\n // why we do not bother throwing an error here.\n if (observer === this.observer) {\n return () => {};\n }\n\n // Zen Observable has its own error function, so in order to log correctly\n // we need to provide a custom error callback.\n try {\n var subObserver = (observer as any)._subscription._observer;\n if (subObserver && !subObserver.error) {\n subObserver.error = defaultSubscriptionObserverErrorCallback;\n }\n } catch {}\n\n const first = !this.observers.size;\n this.observers.add(observer);\n\n // Deliver most recent error or result.\n if (this.lastError) {\n observer.error && observer.error(this.lastError);\n } else if (this.lastResult) {\n observer.next && observer.next(this.lastResult);\n }\n\n // Initiate observation of this query if it hasn't been reported to\n // the QueryManager yet.\n if (first) {\n this.reobserve().catch(_ => {\n // Blindly catching here prevents unhandled promise rejections,\n // and is safe because the ObservableQuery handles this error with\n // this.observer.error, so we're not just swallowing the error by\n // ignoring it here.\n });\n }\n\n return () => {\n if (this.observers.delete(observer) && !this.observers.size) {\n this.tearDownQuery();\n }\n };\n }\n\n private reobserver?: Reobserver<TData, TVariables>;\n\n private getReobserver(): Reobserver<TData, TVariables> {\n return this.reobserver || (this.reobserver = this.newReobserver(true));\n }\n\n private newReobserver(shareOptions: boolean) {\n const { queryManager, queryId } = this;\n queryManager.setObservableQuery(this);\n return new Reobserver<TData, TVariables>(\n this.observer,\n // Sharing options allows this.reobserver.options to be ===\n // this.options, so we don't have to worry about synchronizing the\n // properties of two distinct objects.\n shareOptions ? this.options : { ...this.options },\n (currentOptions, newNetworkStatus) => {\n queryManager.setObservableQuery(this);\n return queryManager.fetchQueryObservable(\n queryId,\n currentOptions,\n newNetworkStatus,\n );\n },\n // Avoid polling during SSR and when the query is already in flight.\n !queryManager.ssrMode && (\n () => !isNetworkRequestInFlight(this.queryInfo.networkStatus))\n );\n }\n\n public reobserve(\n newOptions?: Partial<WatchQueryOptions<TVariables, TData>>,\n newNetworkStatus?: NetworkStatus,\n ): Promise<ApolloQueryResult<TData>> {\n this.isTornDown = false;\n return this.getReobserver().reobserve(newOptions, newNetworkStatus);\n }\n\n // Pass the current result to this.observer.next without applying any\n // fetch policies, bypassing the Reobserver.\n private observe() {\n // Passing false is important so that this.getCurrentResult doesn't\n // save the fetchMore result as this.lastResult, causing it to be\n // ignored due to the this.isDifferentFromLastResult check in\n // this.observer.next.\n this.observer.next(this.getCurrentResult(false));\n }\n\n private observer = {\n next: (result: ApolloQueryResult<TData>) => {\n if (this.lastError || this.isDifferentFromLastResult(result)) {\n this.updateLastResult(result);\n iterateObserversSafely(this.observers, 'next', result);\n }\n },\n\n error: (error: ApolloError) => {\n // Since we don't get the current result on errors, only the error, we\n // must mirror the updates that occur in QueryStore.markQueryError here\n this.updateLastResult({\n ...this.lastResult,\n error,\n errors: error.graphQLErrors,\n networkStatus: NetworkStatus.error,\n loading: false,\n });\n\n iterateObserversSafely(this.observers, 'error', this.lastError = error);\n },\n };\n\n public hasObservers() {\n return this.observers.size > 0;\n }\n\n private tearDownQuery() {\n if (this.isTornDown) return;\n\n if (this.reobserver) {\n this.reobserver.stop();\n delete this.reobserver;\n }\n\n // stop all active GraphQL subscriptions\n this.subscriptions.forEach(sub => sub.unsubscribe());\n this.subscriptions.clear();\n\n this.queryManager.stopQuery(this.queryId);\n\n this.observers.clear();\n\n this.isTornDown = true;\n }\n}\n\n// Necessary because the ObservableQuery constructor has a different\n// signature than the Observable constructor.\nfixObservableSubclass(ObservableQuery);\n\nfunction defaultSubscriptionObserverErrorCallback(error: ApolloError) {\n invariant.error('Unhandled error', error.message, error.stack);\n}\n", "// A [trie](https://en.wikipedia.org/wiki/Trie) data structure that holds\n// object keys weakly, yet can also hold non-object keys, unlike the\n// native `WeakMap`.\n\n// If no makeData function is supplied, the looked-up data will be an empty,\n// null-prototype Object.\nconst defaultMakeData = () => Object.create(null);\n\n// Useful for processing arguments objects as well as arrays.\nconst { forEach, slice } = Array.prototype;\n\nexport class Trie<Data> {\n // Since a `WeakMap` cannot hold primitive values as keys, we need a\n // backup `Map` instance to hold primitive keys. Both `this._weakMap`\n // and `this._strongMap` are lazily initialized.\n private weak?: WeakMap<any, Trie<Data>>;\n private strong?: Map<any, Trie<Data>>;\n private data?: Data;\n\n constructor(\n private weakness = true,\n private makeData: (array: any[]) => Data = defaultMakeData,\n ) {}\n\n public lookup<T extends any[]>(...array: T): Data {\n return this.lookupArray(array);\n }\n\n public lookupArray<T extends IArguments | any[]>(array: T): Data {\n let node: Trie<Data> = this;\n forEach.call(array, key => node = node.getChildTrie(key));\n return node.data || (node.data = this.makeData(slice.call(array)));\n }\n\n private getChildTrie(key: any) {\n const map = this.weakness && isObjRef(key)\n ? this.weak || (this.weak = new WeakMap<any, Trie<Data>>())\n : this.strong || (this.strong = new Map<any, Trie<Data>>());\n let child = map.get(key);\n if (!child) map.set(key, child = new Trie<Data>(this.weakness, this.makeData));\n return child;\n }\n}\n\nfunction isObjRef(value: any) {\n switch (typeof value) {\n case \"object\":\n if (value === null) break;\n // Fall through to return true...\n case \"function\":\n return true;\n }\n return false;\n}\n", "type Context = {\n parent: Context | null;\n slots: { [slotId: string]: any };\n}\n\n// This currentContext variable will only be used if the makeSlotClass\n// function is called, which happens only if this is the first copy of the\n// @wry/context package to be imported.\nlet currentContext: Context | null = null;\n\n// This unique internal object is used to denote the absence of a value\n// for a given Slot, and is never exposed to outside code.\nconst MISSING_VALUE: any = {};\n\nlet idCounter = 1;\n\n// Although we can't do anything about the cost of duplicated code from\n// accidentally bundling multiple copies of the @wry/context package, we can\n// avoid creating the Slot class more than once using makeSlotClass.\nconst makeSlotClass = () => class Slot<TValue> {\n // If you have a Slot object, you can find out its slot.id, but you cannot\n // guess the slot.id of a Slot you don't have access to, thanks to the\n // randomized suffix.\n public readonly id = [\n \"slot\",\n idCounter++,\n Date.now(),\n Math.random().toString(36).slice(2),\n ].join(\":\");\n\n public hasValue() {\n for (let context = currentContext; context; context = context.parent) {\n // We use the Slot object iself as a key to its value, which means the\n // value cannot be obtained without a reference to the Slot object.\n if (this.id in context.slots) {\n const value = context.slots[this.id];\n if (value === MISSING_VALUE) break;\n if (context !== currentContext) {\n // Cache the value in currentContext.slots so the next lookup will\n // be faster. This caching is safe because the tree of contexts and\n // the values of the slots are logically immutable.\n currentContext!.slots[this.id] = value;\n }\n return true;\n }\n }\n if (currentContext) {\n // If a value was not found for this Slot, it's never going to be found\n // no matter how many times we look it up, so we might as well cache\n // the absence of the value, too.\n currentContext.slots[this.id] = MISSING_VALUE;\n }\n return false;\n }\n\n public getValue(): TValue | undefined {\n if (this.hasValue()) {\n return currentContext!.slots[this.id] as TValue;\n }\n }\n\n public withValue<TResult, TArgs extends any[], TThis = any>(\n value: TValue,\n callback: (this: TThis, ...args: TArgs) => TResult,\n // Given the prevalence of arrow functions, specifying arguments is likely\n // to be much more common than specifying `this`, hence this ordering:\n args?: TArgs,\n thisArg?: TThis,\n ): TResult {\n const slots = {\n __proto__: null,\n [this.id]: value,\n };\n const parent = currentContext;\n currentContext = { parent, slots };\n try {\n // Function.prototype.apply allows the arguments array argument to be\n // omitted or undefined, so args! is fine here.\n return callback.apply(thisArg!, args!);\n } finally {\n currentContext = parent;\n }\n }\n\n // Capture the current context and wrap a callback function so that it\n // reestablishes the captured context when called.\n static bind<TArgs extends any[], TResult>(\n callback: (...args: TArgs) => TResult,\n ) {\n const context = currentContext;\n return function (this: any) {\n const saved = currentContext;\n try {\n currentContext = context;\n return callback.apply(this, arguments as any);\n } finally {\n currentContext = saved;\n }\n } as typeof callback;\n }\n\n // Immediately run a callback function without any captured context.\n static noContext<TResult, TArgs extends any[], TThis = any>(\n callback: (this: TThis, ...args: TArgs) => TResult,\n // Given the prevalence of arrow functions, specifying arguments is likely\n // to be much more common than specifying `this`, hence this ordering:\n args?: TArgs,\n thisArg?: TThis,\n ) {\n if (currentContext) {\n const saved = currentContext;\n try {\n currentContext = null;\n // Function.prototype.apply allows the arguments array argument to be\n // omitted or undefined, so args! is fine here.\n return callback.apply(thisArg!, args!);\n } finally {\n currentContext = saved;\n }\n } else {\n return callback.apply(thisArg!, args!);\n }\n }\n};\n\n// We store a single global implementation of the Slot class as a permanent\n// non-enumerable symbol property of the Array constructor. This obfuscation\n// does nothing to prevent access to the Slot class, but at least it ensures\n// the implementation (i.e. currentContext) cannot be tampered with, and all\n// copies of the @wry/context package (hopefully just one) will share the\n// same Slot implementation. Since the first copy of the @wry/context package\n// to be imported wins, this technique imposes a very high cost for any\n// future breaking changes to the Slot class.\nconst globalKey = \"@wry/context:Slot\";\nconst host = Array as any;\n\nexport const Slot: ReturnType<typeof makeSlotClass> = host[globalKey] || function () {\n const Slot = makeSlotClass();\n try {\n Object.defineProperty(host, globalKey, {\n value: host[globalKey] = Slot,\n enumerable: false,\n writable: false,\n configurable: false,\n });\n } finally {\n return Slot;\n }\n}();\n", "import { Slot } from \"./slot\";\nexport { Slot }\nexport const { bind, noContext } = Slot;\n\n// Relying on the @types/node declaration of global.setTimeout can make\n// things tricky for dowstream projects (see PR #7).\ndeclare function setTimeout(\n callback: (...args: any[]) => any,\n ms?: number,\n ...args: any[]\n): any;\n\n// Like global.setTimeout, except the callback runs with captured context.\nexport { setTimeoutWithContext as setTimeout };\nfunction setTimeoutWithContext(callback: () => any, delay: number) {\n return setTimeout(bind(callback), delay);\n}\n\n// Turn any generator function into an async function (using yield instead\n// of await), with context automatically preserved across yields.\nexport function asyncFromGen<TArgs extends any[]>(\n genFn: (...args: TArgs) => any\n) {\n return function (this: any) {\n const gen = genFn.apply(this, arguments as any);\n const boundNext = bind(gen.next);\n const boundThrow = bind(gen.throw!);\n type Method = typeof boundNext | typeof boundThrow;\n\n return new Promise((resolve, reject) => {\n function invoke(method: Method, argument: any) {\n try {\n var result: any = method.call(gen, argument);\n } catch (error) {\n return reject(error);\n }\n const next = result.done ? resolve : invokeNext;\n if (isPromiseLike(result.value)) {\n result.value.then(next, result.done ? reject : invokeThrow);\n } else {\n next(result.value);\n }\n }\n const invokeNext = (value?: any) => invoke(boundNext, value);\n const invokeThrow = (error: any) => invoke(boundThrow, error);\n invokeNext();\n });\n } as (...args: TArgs) => Promise<any>;\n}\n\nfunction isPromiseLike(value: any): value is PromiseLike<any> {\n return value && typeof value.then === \"function\";\n}\n\n// If you use the fibers npm package to implement coroutines in Node.js,\n// you should call this function at least once to ensure context management\n// remains coherent across any yields.\nconst wrappedFibers: Function[] = [];\nexport function wrapYieldingFiberMethods<F extends Function>(Fiber: F): F {\n // There can be only one implementation of Fiber per process, so this array\n // should never grow longer than one element.\n if (wrappedFibers.indexOf(Fiber) < 0) {\n const wrap = (obj: any, method: string) => {\n const fn = obj[method];\n obj[method] = function () {\n return noContext(fn, arguments as any, this);\n };\n }\n // These methods can yield, according to\n // https://github.com/laverdet/node-fibers/blob/ddebed9b8ae3883e57f822e2108e6943e5c8d2a8/fibers.js#L97-L100\n wrap(Fiber, \"yield\");\n wrap(Fiber.prototype, \"run\");\n wrap(Fiber.prototype, \"throwInto\");\n wrappedFibers.push(Fiber);\n }\n return Fiber;\n}\n", "interface Node<K, V> {\n key: K;\n value: V;\n newer: Node<K, V> | null;\n older: Node<K, V> | null;\n}\n\nfunction defaultDispose() {}\n\nexport class Cache<K = any, V = any> {\n private map = new Map<K, Node<K, V>>();\n private newest: Node<K, V> | null = null;\n private oldest: Node<K, V> | null = null;\n\n constructor(\n private max = Infinity,\n public dispose: (value: V, key: K) => void = defaultDispose,\n ) {}\n\n public has(key: K): boolean {\n return this.map.has(key);\n }\n\n public get(key: K): V | undefined {\n const node = this.getNode(key);\n return node && node.value;\n }\n\n private getNode(key: K): Node<K, V> | undefined {\n const node = this.map.get(key);\n\n if (node && node !== this.newest) {\n const { older, newer } = node;\n\n if (newer) {\n newer.older = older;\n }\n\n if (older) {\n older.newer = newer;\n }\n\n node.older = this.newest;\n node.older!.newer = node;\n\n node.newer = null;\n this.newest = node;\n\n if (node === this.oldest) {\n this.oldest = newer;\n }\n }\n\n return node;\n }\n\n public set(key: K, value: V): V {\n let node = this.getNode(key);\n if (node) {\n return node.value = value;\n }\n\n node = {\n key,\n value,\n newer: null,\n older: this.newest\n };\n\n if (this.newest) {\n this.newest.newer = node;\n }\n\n this.newest = node;\n this.oldest = this.oldest || node;\n\n this.map.set(key, node);\n\n return node.value;\n }\n\n public clean() {\n while (this.oldest && this.map.size > this.max) {\n this.delete(this.oldest.key);\n }\n }\n\n public delete(key: K): boolean {\n const node = this.map.get(key);\n if (node) {\n if (node === this.newest) {\n this.newest = node.older;\n }\n\n if (node === this.oldest) {\n this.oldest = node.newer;\n }\n\n if (node.newer) {\n node.newer.older = node.older;\n }\n\n if (node.older) {\n node.older.newer = node.newer;\n }\n\n this.map.delete(key);\n this.dispose(node.value, key);\n\n return true;\n }\n\n return false;\n }\n}\n", "import { AnyEntry } from \"./entry\";\nimport { Slot } from \"@wry/context\";\n\nexport const parentEntrySlot = new Slot<AnyEntry>();\n\nexport {\n bind as bindContext,\n noContext,\n setTimeout,\n asyncFromGen,\n} from \"@wry/context\";\n", "export const {\n hasOwnProperty,\n} = Object.prototype;\n\nexport const {\n // This Array.from polyfill is restricted to working with Set<any> for now,\n // but we can improve the polyfill and add other input types, as needed. Note\n // that this fallback implementation will only be used if the host environment\n // does not support a native Array.from function. In most modern JS runtimes,\n // the toArray function exported here will be === Array.from.\n from: toArray = (collection: Set<any>) => {\n const array: any[] = [];\n collection.forEach(item => array.push(item));\n return array;\n },\n} = Array;\n\nexport type Unsubscribable = {\n unsubscribe?: void | (() => any);\n}\n\nexport function maybeUnsubscribe(entryOrDep: Unsubscribable) {\n const { unsubscribe } = entryOrDep;\n if (typeof unsubscribe === \"function\") {\n entryOrDep.unsubscribe = void 0;\n unsubscribe();\n }\n}\n", "import { parentEntrySlot } from \"./context\";\nimport { OptimisticWrapOptions } from \"./index\";\nimport { Dep } from \"./dep\";\nimport { maybeUnsubscribe, toArray, Unsubscribable } from \"./helpers\";\n\nconst emptySetPool: Set<any>[] = [];\nconst POOL_TARGET_SIZE = 100;\n\n// Since this package might be used browsers, we should avoid using the\n// Node built-in assert module.\nfunction assert(condition: any, optionalMessage?: string) {\n if (! condition) {\n throw new Error(optionalMessage || \"assertion failure\");\n }\n}\n\n// Since exceptions are cached just like normal values, we need an efficient\n// way of representing unknown, ordinary, and exceptional values.\ntype Value<T> =\n | [] // unknown\n | [T] // known value\n | [void, any]; // known exception\n\nfunction valueIs(a: Value<any>, b: Value<any>) {\n const len = a.length;\n return (\n // Unknown values are not equal to each other.\n len > 0 &&\n // Both values must be ordinary (or both exceptional) to be equal.\n len === b.length &&\n // The underlying value or exception must be the same.\n a[len - 1] === b[len - 1]\n );\n}\n\nfunction valueGet<T>(value: Value<T>): T {\n switch (value.length) {\n case 0: throw new Error(\"unknown value\");\n case 1: return value[0];\n case 2: throw value[1];\n }\n}\n\nfunction valueCopy<T>(value: Value<T>): Value<T> {\n return value.slice(0) as Value<T>;\n}\n\nexport type AnyEntry = Entry<any, any>;\n\nexport class Entry<TArgs extends any[], TValue> {\n public static count = 0;\n\n public subscribe: OptimisticWrapOptions<TArgs>[\"subscribe\"];\n public unsubscribe: Unsubscribable[\"unsubscribe\"];\n\n public readonly parents = new Set<AnyEntry>();\n public readonly childValues = new Map<AnyEntry, Value<any>>();\n\n // When this Entry has children that are dirty, this property becomes\n // a Set containing other Entry objects, borrowed from emptySetPool.\n // When the set becomes empty, it gets recycled back to emptySetPool.\n public dirtyChildren: Set<AnyEntry> | null = null;\n\n public dirty = true;\n public recomputing = false;\n public readonly value: Value<TValue> = [];\n\n constructor(\n public readonly fn: (...args: TArgs) => TValue,\n ) {\n ++Entry.count;\n }\n\n public peek(): TValue | undefined {\n if (this.value.length === 1 && !mightBeDirty(this)) {\n rememberParent(this);\n return this.value[0];\n }\n }\n\n // This is the most important method of the Entry API, because it\n // determines whether the cached this.value can be returned immediately,\n // or must be recomputed. The overall performance of the caching system\n // depends on the truth of the following observations: (1) this.dirty is\n // usually false, (2) this.dirtyChildren is usually null/empty, and thus\n // (3) valueGet(this.value) is usually returned without recomputation.\n public recompute(args: TArgs): TValue {\n assert(! this.recomputing, \"already recomputing\");\n rememberParent(this);\n return mightBeDirty(this)\n ? reallyRecompute(this, args)\n : valueGet(this.value);\n }\n\n public setDirty() {\n if (this.dirty) return;\n this.dirty = true;\n this.value.length = 0;\n reportDirty(this);\n // We can go ahead and unsubscribe here, since any further dirty\n // notifications we receive will be redundant, and unsubscribing may\n // free up some resources, e.g. file watchers.\n maybeUnsubscribe(this);\n }\n\n public dispose() {\n this.setDirty();\n\n // Sever any dependency relationships with our own children, so those\n // children don't retain this parent Entry in their child.parents sets,\n // thereby preventing it from being fully garbage collected.\n forgetChildren(this);\n\n // Because this entry has been kicked out of the cache (in index.js),\n // we've lost the ability to find out if/when this entry becomes dirty,\n // whether that happens through a subscription, because of a direct call\n // to entry.setDirty(), or because one of its children becomes dirty.\n // Because of this loss of future information, we have to assume the\n // worst (that this entry might have become dirty very soon), so we must\n // immediately mark this entry's parents as dirty. Normally we could\n // just call entry.setDirty() rather than calling parent.setDirty() for\n // each parent, but that would leave this entry in parent.childValues\n // and parent.dirtyChildren, which would prevent the child from being\n // truly forgotten.\n eachParent(this, (parent, child) => {\n parent.setDirty();\n forgetChild(parent, this);\n });\n }\n\n public forget() {\n // The code that creates Entry objects in index.ts will replace this method\n // with one that actually removes the Entry from the cache, which will also\n // trigger the entry.dispose method.\n this.dispose();\n }\n\n private deps: Set<Dep<any>> | null = null;\n\n public dependOn(dep: Dep<any>) {\n dep.add(this);\n if (! this.deps) {\n this.deps = emptySetPool.pop() || new Set<Set<AnyEntry>>();\n }\n this.deps.add(dep);\n }\n\n public forgetDeps() {\n if (this.deps) {\n toArray(this.deps).forEach(dep => dep.delete(this));\n this.deps.clear();\n emptySetPool.push(this.deps);\n this.deps = null;\n }\n }\n}\n\nfunction rememberParent(child: AnyEntry) {\n const parent = parentEntrySlot.getValue();\n if (parent) {\n child.parents.add(parent);\n\n if (! parent.childValues.has(child)) {\n parent.childValues.set(child, []);\n }\n\n if (mightBeDirty(child)) {\n reportDirtyChild(parent, child);\n } else {\n reportCleanChild(parent, child);\n }\n\n return parent;\n }\n}\n\nfunction reallyRecompute(entry: AnyEntry, args: any[]) {\n forgetChildren(entry);\n\n // Set entry as the parent entry while calling recomputeNewValue(entry).\n parentEntrySlot.withValue(entry, recomputeNewValue, [entry, args]);\n\n if (maybeSubscribe(entry, args)) {\n // If we successfully recomputed entry.value and did not fail to\n // (re)subscribe, then this Entry is no longer explicitly dirty.\n setClean(entry);\n }\n\n return valueGet(entry.value);\n}\n\nfunction recomputeNewValue(entry: AnyEntry, args: any[]) {\n entry.recomputing = true;\n // Set entry.value as unknown.\n entry.value.length = 0;\n try {\n // If entry.fn succeeds, entry.value will become a normal Value.\n entry.value[0] = entry.fn.apply(null, args);\n } catch (e) {\n // If entry.fn throws, entry.value will become exceptional.\n entry.value[1] = e;\n }\n // Either way, this line is always reached.\n entry.recomputing = false;\n}\n\nfunction mightBeDirty(entry: AnyEntry) {\n return entry.dirty || !!(entry.dirtyChildren && entry.dirtyChildren.size);\n}\n\nfunction setClean(entry: AnyEntry) {\n entry.dirty = false;\n\n if (mightBeDirty(entry)) {\n // This Entry may still have dirty children, in which case we can't\n // let our parents know we're clean just yet.\n return;\n }\n\n reportClean(entry);\n}\n\nfunction reportDirty(child: AnyEntry) {\n eachParent(child, reportDirtyChild);\n}\n\nfunction reportClean(child: AnyEntry) {\n eachParent(child, reportCleanChild);\n}\n\nfunction eachParent(\n child: AnyEntry,\n callback: (parent: AnyEntry, child: AnyEntry) => any,\n) {\n const parentCount = child.parents.size;\n if (parentCount) {\n const parents = toArray(child.parents);\n for (let i = 0; i < parentCount; ++i) {\n callback(parents[i], child);\n }\n }\n}\n\n// Let a parent Entry know that one of its children may be dirty.\nfunction reportDirtyChild(parent: AnyEntry, child: AnyEntry) {\n // Must have called rememberParent(child) before calling\n // reportDirtyChild(parent, child).\n assert(parent.childValues.has(child));\n assert(mightBeDirty(child));\n const parentWasClean = !mightBeDirty(parent);\n\n if (! parent.dirtyChildren) {\n parent.dirtyChildren = emptySetPool.pop() || new Set;\n\n } else if (parent.dirtyChildren.has(child)) {\n // If we already know this child is dirty, then we must have already\n // informed our own parents that we are dirty, so we can terminate\n // the recursion early.\n return;\n }\n\n parent.dirtyChildren.add(child);\n\n // If parent was clean before, it just became (possibly) dirty (according to\n // mightBeDirty), since we just added child to parent.dirtyChildren.\n if (parentWasClean) {\n reportDirty(parent);\n }\n}\n\n// Let a parent Entry know that one of its children is no longer dirty.\nfunction reportCleanChild(parent: AnyEntry, child: AnyEntry) {\n // Must have called rememberChild(child) before calling\n // reportCleanChild(parent, child).\n assert(parent.childValues.has(child));\n assert(! mightBeDirty(child));\n\n const childValue = parent.childValues.get(child)!;\n if (childValue.length === 0) {\n parent.childValues.set(child, valueCopy(child.value));\n } else if (! valueIs(childValue, child.value)) {\n parent.setDirty();\n }\n\n removeDirtyChild(parent, child);\n\n if (mightBeDirty(parent)) {\n return;\n }\n\n reportClean(parent);\n}\n\nfunction removeDirtyChild(parent: AnyEntry, child: AnyEntry) {\n const dc = parent.dirtyChildren;\n if (dc) {\n dc.delete(child);\n if (dc.size === 0) {\n if (emptySetPool.length < POOL_TARGET_SIZE) {\n emptySetPool.push(dc);\n }\n parent.dirtyChildren = null;\n }\n }\n}\n\n// Removes all children from this entry and returns an array of the\n// removed children.\nfunction forgetChildren(parent: AnyEntry) {\n if (parent.childValues.size > 0) {\n parent.childValues.forEach((_value, child) => {\n forgetChild(parent, child);\n });\n }\n\n // Remove this parent Entry from any sets to which it was added by the\n // addToSet method.\n parent.forgetDeps();\n\n // After we forget all our children, this.dirtyChildren must be empty\n // and therefore must have been reset to null.\n assert(parent.dirtyChildren === null);\n}\n\nfunction forgetChild(parent: AnyEntry, child: AnyEntry) {\n child.parents.delete(parent);\n parent.childValues.delete(child);\n removeDirtyChild(parent, child);\n}\n\nfunction maybeSubscribe(entry: AnyEntry, args: any[]) {\n if (typeof entry.subscribe === \"function\") {\n try {\n maybeUnsubscribe(entry); // Prevent double subscriptions.\n entry.unsubscribe = entry.subscribe.apply(null, args);\n } catch (e) {\n // If this Entry has a subscribe function and it threw an exception\n // (or an unsubscribe function it previously returned now throws),\n // return false to indicate that we were not able to subscribe (or\n // unsubscribe), and this Entry should remain dirty.\n entry.setDirty();\n return false;\n }\n }\n\n // Returning true indicates either that there was no entry.subscribe\n // function or that it succeeded.\n return true;\n}\n", "import { AnyEntry } from \"./entry\";\nimport { OptimisticWrapOptions } from \"./index\";\nimport { parentEntrySlot } from \"./context\";\nimport { hasOwnProperty, Unsubscribable, maybeUnsubscribe, toArray } from \"./helpers\";\n\ntype EntryMethodName = keyof typeof EntryMethods;\nconst EntryMethods = {\n setDirty: true, // Mark parent Entry as needing to be recomputed (default)\n dispose: true, // Detach parent Entry from parents and children, but leave in LRU cache\n forget: true, // Fully remove parent Entry from LRU cache and computation graph\n};\n\nexport type OptimisticDependencyFunction<TKey> =\n ((key: TKey) => void) & {\n dirty: (key: TKey, entryMethodName?: EntryMethodName) => void;\n };\n\nexport type Dep<TKey> = Set<AnyEntry> & {\n subscribe: OptimisticWrapOptions<[TKey]>[\"subscribe\"];\n} & Unsubscribable;\n\nexport function dep<TKey>(options?: {\n subscribe: Dep<TKey>[\"subscribe\"];\n}) {\n const depsByKey = new Map<TKey, Dep<TKey>>();\n const subscribe = options && options.subscribe;\n\n function depend(key: TKey) {\n const parent = parentEntrySlot.getValue();\n if (parent) {\n let dep = depsByKey.get(key);\n if (!dep) {\n depsByKey.set(key, dep = new Set as Dep<TKey>);\n }\n parent.dependOn(dep);\n if (typeof subscribe === \"function\") {\n maybeUnsubscribe(dep);\n dep.unsubscribe = subscribe(key);\n }\n }\n }\n\n depend.dirty = function dirty(\n key: TKey,\n entryMethodName?: EntryMethodName,\n ) {\n const dep = depsByKey.get(key);\n if (dep) {\n const m: EntryMethodName = (\n entryMethodName &&\n hasOwnProperty.call(EntryMethods, entryMethodName)\n ) ? entryMethodName : \"setDirty\";\n // We have to use toArray(dep).forEach instead of dep.forEach, because\n // modifying a Set while iterating over it can cause elements in the Set\n // to be removed from the Set before they've been iterated over.\n toArray(dep).forEach(entry => entry[m]());\n depsByKey.delete(key);\n maybeUnsubscribe(dep);\n }\n };\n\n return depend as OptimisticDependencyFunction<TKey>;\n}\n", "import { Trie } from \"@wry/trie\";\n\nimport { Cache } from \"./cache\";\nimport { Entry, AnyEntry } from \"./entry\";\nimport { parentEntrySlot } from \"./context\";\n\n// These helper functions are important for making optimism work with\n// asynchronous code. In order to register parent-child dependencies,\n// optimism needs to know about any currently active parent computations.\n// In ordinary synchronous code, the parent context is implicit in the\n// execution stack, but asynchronous code requires some extra guidance in\n// order to propagate context from one async task segment to the next.\nexport {\n bindContext,\n noContext,\n setTimeout,\n asyncFromGen,\n} from \"./context\";\n\n// A lighter-weight dependency, similar to OptimisticWrapperFunction, except\n// with only one argument, no makeCacheKey, no wrapped function to recompute,\n// and no result value. Useful for representing dependency leaves in the graph\n// of computation. Subscriptions are supported.\nexport { dep, OptimisticDependencyFunction } from \"./dep\";\n\nfunction makeDefaultMakeCacheKeyFunction<\n TKeyArgs extends any[],\n TCacheKey = any,\n>(): (...args: TKeyArgs) => TCacheKey {\n const keyTrie = new Trie<TCacheKey>(typeof WeakMap === \"function\");\n return function () {\n return keyTrie.lookupArray(arguments);\n };\n}\n\n// The defaultMakeCacheKey function is remarkably powerful, because it gives\n// a unique object for any shallow-identical list of arguments. If you need\n// to implement a custom makeCacheKey function, you may find it helpful to\n// delegate the final work to defaultMakeCacheKey, which is why we export it\n// here. However, you may want to avoid defaultMakeCacheKey if your runtime\n// does not support WeakMap, or you have the ability to return a string key.\n// In those cases, just write your own custom makeCacheKey functions.\nexport const defaultMakeCacheKey = makeDefaultMakeCacheKeyFunction();\n\n// If you're paranoid about memory leaks, or you want to avoid using WeakMap\n// under the hood, but you still need the behavior of defaultMakeCacheKey,\n// import this constructor to create your own tries.\nexport { Trie as KeyTrie }\n\nexport type OptimisticWrapperFunction<\n TArgs extends any[],\n TResult,\n TKeyArgs extends any[] = TArgs,\n TCacheKey = any,\n> = ((...args: TArgs) => TResult) & {\n // Get the current number of Entry objects in the LRU cache.\n readonly size: number;\n\n // \"Dirty\" any cached Entry stored for the given arguments, marking that Entry\n // and its ancestors as potentially needing to be recomputed. The .dirty(...)\n // method of an optimistic function takes the same parameter types as the\n // original function by default, unless a keyArgs function is configured, and\n // then it matters that .dirty takes TKeyArgs instead of TArgs.\n dirty: (...args: TKeyArgs) => void;\n // A version of .dirty that accepts a key returned by .getKey.\n dirtyKey: (key: TCacheKey) => void;\n\n // Examine the current value without recomputing it.\n peek: (...args: TKeyArgs) => TResult | undefined;\n // A version of .peek that accepts a key returned by .getKey.\n peekKey: (key: TCacheKey) => TResult | undefined;\n\n // Completely remove the entry from the cache, dirtying any parent entries.\n forget: (...args: TKeyArgs) => boolean;\n // A version of .forget that accepts a key returned by .getKey.\n forgetKey: (key: TCacheKey) => boolean;\n\n // In order to use the -Key version of the above functions, you need a key\n // rather than the arguments used to compute the key. These two functions take\n // TArgs or TKeyArgs and return the corresponding TCacheKey. If no keyArgs\n // function has been configured, TArgs will be the same as TKeyArgs, and thus\n // getKey and makeCacheKey will be synonymous.\n getKey: (...args: TArgs) => TCacheKey;\n\n // This property is equivalent to the makeCacheKey function provided in the\n // OptimisticWrapOptions, or (if no options.makeCacheKey function is provided)\n // a default implementation of makeCacheKey.\n makeCacheKey: (...args: TKeyArgs) => TCacheKey;\n};\n\nexport type OptimisticWrapOptions<\n TArgs extends any[],\n TKeyArgs extends any[] = TArgs,\n TCacheKey = any,\n> = {\n // The maximum number of cache entries that should be retained before the\n // cache begins evicting the oldest ones.\n max?: number;\n // Transform the raw arguments to some other type of array, which will then\n // be passed to makeCacheKey.\n keyArgs?: (...args: TArgs) => TKeyArgs;\n // The makeCacheKey function takes the same arguments that were passed to\n // the wrapper function and returns a single value that can be used as a key\n // in a Map to identify the cached result.\n makeCacheKey?: (...args: TKeyArgs) => TCacheKey;\n // If provided, the subscribe function should either return an unsubscribe\n // function or return nothing.\n subscribe?: (...args: TArgs) => void | (() => any);\n};\n\nconst caches = new Set<Cache<any, AnyEntry>>();\n\nexport function wrap<\n TArgs extends any[],\n TResult,\n TKeyArgs extends any[] = TArgs,\n TCacheKey = any,\n>(\n originalFunction: (...args: TArgs) => TResult,\n options: OptimisticWrapOptions<TArgs, TKeyArgs> = Object.create(null),\n) {\n const cache = new Cache<TCacheKey, Entry<TArgs, TResult>>(\n options.max || Math.pow(2, 16),\n entry => entry.dispose(),\n );\n\n const keyArgs = options.keyArgs;\n const makeCacheKey = options.makeCacheKey ||\n makeDefaultMakeCacheKeyFunction<TKeyArgs, TCacheKey>();\n\n const optimistic = function (): TResult {\n const key = makeCacheKey.apply(\n null,\n keyArgs ? keyArgs.apply(null, arguments as any) : arguments as any\n );\n\n if (key === void 0) {\n return originalFunction.apply(null, arguments as any);\n }\n\n let entry = cache.get(key)!;\n if (!entry) {\n cache.set(key, entry = new Entry(originalFunction));\n entry.subscribe = options.subscribe;\n // Give the Entry the ability to trigger cache.delete(key), even though\n // the Entry itself does not know about key or cache.\n entry.forget = () => cache.delete(key);\n }\n\n const value = entry.recompute(\n Array.prototype.slice.call(arguments) as TArgs,\n );\n\n // Move this entry to the front of the least-recently used queue,\n // since we just finished computing its value.\n cache.set(key, entry);\n\n caches.add(cache);\n\n // Clean up any excess entries in the cache, but only if there is no\n // active parent entry, meaning we're not in the middle of a larger\n // computation that might be flummoxed by the cleaning.\n if (! parentEntrySlot.hasValue()) {\n caches.forEach(cache => cache.clean());\n caches.clear();\n }\n\n return value;\n } as OptimisticWrapperFunction<TArgs, TResult, TKeyArgs, TCacheKey>;\n\n Object.defineProperty(optimistic, \"size\", {\n get() {\n return cache[\"map\"].size;\n },\n configurable: false,\n enumerable: false,\n });\n\n function dirtyKey(key: TCacheKey) {\n const entry = cache.get(key);\n if (entry) {\n entry.setDirty();\n }\n }\n optimistic.dirtyKey = dirtyKey;\n optimistic.dirty = function dirty() {\n dirtyKey(makeCacheKey.apply(null, arguments as any));\n };\n\n function peekKey(key: TCacheKey) {\n const entry = cache.get(key);\n if (entry) {\n return entry.peek();\n }\n }\n optimistic.peekKey = peekKey;\n optimistic.peek = function peek() {\n return peekKey(makeCacheKey.apply(null, arguments as any));\n };\n\n function forgetKey(key: TCacheKey) {\n return cache.delete(key);\n }\n optimistic.forgetKey = forgetKey;\n optimistic.forget = function forget() {\n return forgetKey(makeCacheKey.apply(null, arguments as any));\n };\n\n optimistic.makeCacheKey = makeCacheKey;\n optimistic.getKey = keyArgs ? function getKey() {\n return makeCacheKey.apply(null, keyArgs.apply(null, arguments as any));\n } : makeCacheKey as (...args: any[]) => TCacheKey;\n\n return Object.freeze(optimistic);\n}\n", "import { DocumentNode } from 'graphql';\nimport { wrap } from 'optimism';\n\nimport {\n StoreObject,\n Reference,\n getFragmentQueryDocument,\n} from '../../utilities';\nimport { DataProxy } from './types/DataProxy';\nimport { Cache } from './types/Cache';\n\nexport type Transaction<T> = (c: ApolloCache<T>) => void;\n\nexport abstract class ApolloCache<TSerialized> implements DataProxy {\n // required to implement\n // core API\n public abstract read<T, TVariables = any>(\n query: Cache.ReadOptions<TVariables, T>,\n ): T | null;\n public abstract write<TResult = any, TVariables = any>(\n write: Cache.WriteOptions<TResult, TVariables>,\n ): Reference | undefined;\n public abstract diff<T>(query: Cache.DiffOptions): Cache.DiffResult<T>;\n public abstract watch(watch: Cache.WatchOptions): () => void;\n public abstract reset(): Promise<void>;\n\n // Remove whole objects from the cache by passing just options.id, or\n // specific fields by passing options.field and/or options.args. If no\n // options.args are provided, all fields matching options.field (even\n // those with arguments) will be removed. Returns true iff any data was\n // removed from the cache.\n public abstract evict(options: Cache.EvictOptions): boolean;\n\n // intializer / offline / ssr API\n /**\n * Replaces existing state in the cache (if any) with the values expressed by\n * `serializedState`.\n *\n * Called when hydrating a cache (server side rendering, or offline storage),\n * and also (potentially) during hot reloads.\n */\n public abstract restore(\n serializedState: TSerialized,\n ): ApolloCache<TSerialized>;\n\n /**\n * Exposes the cache's complete state, in a serializable format for later restoration.\n */\n public abstract extract(optimistic?: boolean): TSerialized;\n\n // Optimistic API\n\n public abstract removeOptimistic(id: string): void;\n\n // Transactional API\n\n public abstract performTransaction(\n transaction: Transaction<TSerialized>,\n // Although subclasses may implement recordOptimisticTransaction\n // however they choose, the default implementation simply calls\n // performTransaction with a string as the second argument, allowing\n // performTransaction to handle both optimistic and non-optimistic\n // (broadcast-batching) transactions. Passing null for optimisticId is\n // also allowed, and indicates that performTransaction should apply\n // the transaction non-optimistically (ignoring optimistic data).\n optimisticId?: string | null,\n ): void;\n\n public recordOptimisticTransaction(\n transaction: Transaction<TSerialized>,\n optimisticId: string,\n ) {\n this.performTransaction(transaction, optimisticId);\n }\n\n // Optional API\n\n public transformDocument(document: DocumentNode): DocumentNode {\n return document;\n }\n\n public identify(object: StoreObject | Reference): string | undefined {\n return;\n }\n\n public gc(): string[] {\n return [];\n }\n\n public modify(options: Cache.ModifyOptions): boolean {\n return false;\n }\n\n // Experimental API\n\n public transformForLink(document: DocumentNode): DocumentNode {\n return document;\n }\n\n // DataProxy API\n /**\n *\n * @param options\n * @param optimistic\n */\n public readQuery<QueryType, TVariables = any>(\n options: Cache.ReadQueryOptions<QueryType, TVariables>,\n optimistic = !!options.optimistic,\n ): QueryType | null {\n return this.read({\n rootId: options.id || 'ROOT_QUERY',\n query: options.query,\n variables: options.variables,\n returnPartialData: options.returnPartialData,\n optimistic,\n });\n }\n\n // Make sure we compute the same (===) fragment query document every\n // time we receive the same fragment in readFragment.\n private getFragmentDoc = wrap(getFragmentQueryDocument);\n\n public readFragment<FragmentType, TVariables = any>(\n options: Cache.ReadFragmentOptions<FragmentType, TVariables>,\n optimistic = !!options.optimistic,\n ): FragmentType | null {\n return this.read({\n query: this.getFragmentDoc(options.fragment, options.fragmentName),\n variables: options.variables,\n rootId: options.id,\n returnPartialData: options.returnPartialData,\n optimistic,\n });\n }\n\n public writeQuery<TData = any, TVariables = any>(\n options: Cache.WriteQueryOptions<TData, TVariables>,\n ): Reference | undefined {\n return this.write({\n dataId: options.id || 'ROOT_QUERY',\n result: options.data,\n query: options.query,\n variables: options.variables,\n broadcast: options.broadcast,\n });\n }\n\n public writeFragment<TData = any, TVariables = any>(\n options: Cache.WriteFragmentOptions<TData, TVariables>,\n ): Reference | undefined {\n return this.write({\n dataId: options.id,\n result: options.data,\n variables: options.variables,\n query: this.getFragmentDoc(options.fragment, options.fragmentName),\n broadcast: options.broadcast,\n });\n }\n}\n", "import { DataProxy } from './DataProxy';\nimport { Modifier, Modifiers } from './common';\n\nexport namespace Cache {\n export type WatchCallback = (diff: Cache.DiffResult<any>) => void;\n\n export interface ReadOptions<TVariables = any, TData = any>\n extends DataProxy.Query<TVariables, TData> {\n rootId?: string;\n previousResult?: any;\n optimistic: boolean;\n returnPartialData?: boolean;\n }\n\n export interface WriteOptions<TResult = any, TVariables = any>\n extends DataProxy.Query<TVariables, TResult> {\n dataId?: string;\n result: TResult;\n broadcast?: boolean;\n }\n\n export interface DiffOptions extends ReadOptions {\n // The DiffOptions interface is currently just an alias for\n // ReadOptions, though DiffOptions used to be responsible for\n // declaring the returnPartialData option.\n }\n\n export interface WatchOptions extends ReadOptions {\n immediate?: boolean;\n callback: WatchCallback;\n }\n\n export interface EvictOptions {\n id?: string;\n fieldName?: string;\n args?: Record<string, any>;\n broadcast?: boolean;\n }\n\n export interface ModifyOptions {\n id?: string;\n fields: Modifiers | Modifier<any>;\n optimistic?: boolean;\n broadcast?: boolean;\n }\n\n export import DiffResult = DataProxy.DiffResult;\n export import ReadQueryOptions = DataProxy.ReadQueryOptions;\n export import ReadFragmentOptions = DataProxy.ReadFragmentOptions;\n export import WriteQueryOptions = DataProxy.WriteQueryOptions;\n export import WriteFragmentOptions = DataProxy.WriteFragmentOptions;\n export import Fragment = DataProxy.Fragment;\n}\n", "import { FieldNode } from 'graphql';\n\nimport {\n Reference,\n StoreObject,\n StoreValue,\n isReference,\n} from '../../../utilities';\n\nimport { StorageType } from '../../inmemory/policies';\n\n// The Readonly<T> type only really works for object types, since it marks\n// all of the object's properties as readonly, but there are many cases when\n// a generic type parameter like TExisting might be a string or some other\n// primitive type, in which case we need to avoid wrapping it with Readonly.\n// SafeReadonly<string> collapses to just string, which makes string\n// assignable to SafeReadonly<any>, whereas string is not assignable to\n// Readonly<any>, somewhat surprisingly.\nexport type SafeReadonly<T> = T extends object ? Readonly<T> : T;\n\nexport class MissingFieldError {\n constructor(\n public readonly message: string,\n public readonly path: (string | number)[],\n public readonly query: import('graphql').DocumentNode,\n public readonly clientOnly: boolean,\n public readonly variables?: Record<string, any>,\n ) {}\n}\n\nexport interface FieldSpecifier {\n typename?: string;\n fieldName: string;\n field?: FieldNode;\n args?: Record<string, any>;\n variables?: Record<string, any>;\n}\n\nexport interface ReadFieldOptions extends FieldSpecifier {\n from?: StoreObject | Reference;\n}\n\nexport interface ReadFieldFunction {\n <V = StoreValue>(options: ReadFieldOptions): SafeReadonly<V> | undefined;\n <V = StoreValue>(\n fieldName: string,\n from?: StoreObject | Reference,\n ): SafeReadonly<V> | undefined;\n}\n\nexport type ToReferenceFunction = (\n objOrIdOrRef: StoreObject | string | Reference,\n mergeIntoStore?: boolean,\n) => Reference | undefined;\n\nexport type CanReadFunction = (value: StoreValue) => boolean;\n\nexport type Modifier<T> = (value: T, details: {\n DELETE: any;\n INVALIDATE: any;\n fieldName: string;\n storeFieldName: string;\n readField: ReadFieldFunction;\n canRead: CanReadFunction;\n isReference: typeof isReference;\n toReference: ToReferenceFunction;\n storage: StorageType;\n}) => T;\n\nexport type Modifiers = {\n [fieldName: string]: Modifier<any>;\n};\n", "import { SelectionSetNode } from 'graphql';\n\nimport { NormalizedCache } from './types';\nimport {\n Reference,\n isReference,\n StoreValue,\n StoreObject,\n isField,\n DeepMerger,\n resultKeyNameFromField,\n shouldInclude,\n} from '../../utilities';\n\nexport const hasOwn = Object.prototype.hasOwnProperty;\n\nexport function getTypenameFromStoreObject(\n store: NormalizedCache,\n objectOrReference: StoreObject | Reference,\n): string | undefined {\n return isReference(objectOrReference)\n ? store.get(objectOrReference.__ref, \"__typename\") as string\n : objectOrReference && objectOrReference.__typename;\n}\n\nexport const TypeOrFieldNameRegExp = /^[_a-z][_0-9a-z]*/i;\n\nexport function fieldNameFromStoreName(storeFieldName: string): string {\n const match = storeFieldName.match(TypeOrFieldNameRegExp);\n return match ? match[0] : storeFieldName;\n}\n\nexport function selectionSetMatchesResult(\n selectionSet: SelectionSetNode,\n result: Record<string, any>,\n variables?: Record<string, any>,\n): boolean {\n if (result && typeof result === \"object\") {\n return Array.isArray(result)\n ? result.every(item => selectionSetMatchesResult(selectionSet, item, variables))\n : selectionSet.selections.every(field => {\n if (isField(field) && shouldInclude(field, variables)) {\n const key = resultKeyNameFromField(field);\n return hasOwn.call(result, key) &&\n (!field.selectionSet ||\n selectionSetMatchesResult(field.selectionSet, result[key], variables));\n }\n // If the selection has been skipped with @skip(true) or\n // @include(false), it should not count against the matching. If\n // the selection is not a field, it must be a fragment (inline or\n // named). We will determine if selectionSetMatchesResult for that\n // fragment when we get to it, so for now we return true.\n return true;\n });\n }\n return false;\n}\n\nexport function storeValueIsStoreObject(\n value: StoreValue,\n): value is StoreObject {\n return value !== null &&\n typeof value === \"object\" &&\n !isReference(value) &&\n !Array.isArray(value);\n}\n\nexport function makeProcessedFieldsMerger() {\n return new DeepMerger;\n}\n", "import { dep, OptimisticDependencyFunction, KeyTrie } from 'optimism';\nimport { equal } from '@wry/equality';\n\nimport {\n isReference,\n StoreValue,\n StoreObject,\n Reference,\n makeReference,\n DeepMerger,\n maybeDeepFreeze,\n canUseWeakMap,\n} from '../../utilities';\nimport { NormalizedCache, NormalizedCacheObject } from './types';\nimport { hasOwn, fieldNameFromStoreName } from './helpers';\nimport { Policies, StorageType } from './policies';\nimport { Cache } from '../core/types/Cache';\nimport {\n SafeReadonly,\n Modifier,\n Modifiers,\n ReadFieldOptions,\n ToReferenceFunction,\n CanReadFunction,\n} from '../core/types/common';\n\nconst DELETE: any = Object.create(null);\nconst delModifier: Modifier<any> = () => DELETE;\nconst INVALIDATE: any = Object.create(null);\n\nexport abstract class EntityStore implements NormalizedCache {\n protected data: NormalizedCacheObject = Object.create(null);\n\n constructor(\n public readonly policies: Policies,\n public readonly group: CacheGroup,\n ) {}\n\n public abstract addLayer(\n layerId: string,\n replay: (layer: EntityStore) => any,\n ): Layer;\n\n public abstract removeLayer(layerId: string): EntityStore;\n\n // Although the EntityStore class is abstract, it contains concrete\n // implementations of the various NormalizedCache interface methods that\n // are inherited by the Root and Layer subclasses.\n\n public toObject(): NormalizedCacheObject {\n return { ...this.data };\n }\n\n public has(dataId: string): boolean {\n return this.lookup(dataId, true) !== void 0;\n }\n\n public get(dataId: string, fieldName: string): StoreValue {\n this.group.depend(dataId, fieldName);\n if (hasOwn.call(this.data, dataId)) {\n const storeObject = this.data[dataId];\n if (storeObject && hasOwn.call(storeObject, fieldName)) {\n return storeObject[fieldName];\n }\n }\n if (fieldName === \"__typename\" &&\n hasOwn.call(this.policies.rootTypenamesById, dataId)) {\n return this.policies.rootTypenamesById[dataId];\n }\n if (this instanceof Layer) {\n return this.parent.get(dataId, fieldName);\n }\n }\n\n protected lookup(dataId: string, dependOnExistence?: boolean): StoreObject | undefined {\n // The has method (above) calls lookup with dependOnExistence = true, so\n // that it can later be invalidated when we add or remove a StoreObject for\n // this dataId. Any consumer who cares about the contents of the StoreObject\n // should not rely on this dependency, since the contents could change\n // without the object being added or removed.\n if (dependOnExistence) this.group.depend(dataId, \"__exists\");\n\n if (hasOwn.call(this.data, dataId)) {\n return this.data[dataId];\n }\n\n if (this instanceof Layer) {\n return this.parent.lookup(dataId, dependOnExistence);\n }\n\n if (this.policies.rootTypenamesById[dataId]) {\n return Object.create(null);\n }\n }\n\n public merge(dataId: string, incoming: StoreObject): void {\n const existing = this.lookup(dataId);\n const merged: StoreObject =\n new DeepMerger(storeObjectReconciler).merge(existing, incoming);\n // Even if merged === existing, existing may have come from a lower\n // layer, so we always need to set this.data[dataId] on this level.\n this.data[dataId] = merged;\n if (merged !== existing) {\n delete this.refs[dataId];\n if (this.group.caching) {\n const fieldsToDirty: Record<string, 1> = Object.create(null);\n\n // If we added a new StoreObject where there was previously none, dirty\n // anything that depended on the existence of this dataId, such as the\n // EntityStore#has method.\n if (!existing) fieldsToDirty.__exists = 1;\n\n // Now invalidate dependents who called getFieldValue for any fields\n // that are changing as a result of this merge.\n Object.keys(incoming).forEach(storeFieldName => {\n if (!existing || existing[storeFieldName] !== merged[storeFieldName]) {\n // Always dirty the full storeFieldName, which may include\n // serialized arguments following the fieldName prefix.\n fieldsToDirty[storeFieldName] = 1;\n\n // Also dirty fieldNameFromStoreName(storeFieldName) if it's\n // different from storeFieldName and this field does not have\n // keyArgs configured, because that means the cache can't make\n // any assumptions about how field values with the same field\n // name but different arguments might be interrelated, so it\n // must err on the side of invalidating all field values that\n // share the same short fieldName, regardless of arguments.\n const fieldName = fieldNameFromStoreName(storeFieldName);\n if (fieldName !== storeFieldName &&\n !this.policies.hasKeyArgs(merged.__typename, fieldName)) {\n fieldsToDirty[fieldName] = 1;\n }\n\n // If merged[storeFieldName] has become undefined, and this is the\n // Root layer, actually delete the property from the merged object,\n // which is guaranteed to have been created fresh in this method.\n if (merged[storeFieldName] === void 0 && !(this instanceof Layer)) {\n delete merged[storeFieldName];\n }\n }\n });\n\n Object.keys(fieldsToDirty).forEach(\n fieldName => this.group.dirty(dataId, fieldName));\n }\n }\n }\n\n public modify(\n dataId: string,\n fields: Modifier<any> | Modifiers,\n ): boolean {\n const storeObject = this.lookup(dataId);\n\n if (storeObject) {\n const changedFields: Record<string, any> = Object.create(null);\n let needToMerge = false;\n let allDeleted = true;\n\n const sharedDetails = {\n DELETE,\n INVALIDATE,\n isReference,\n toReference: this.toReference,\n canRead: this.canRead,\n readField: <V = StoreValue>(\n fieldNameOrOptions: string | ReadFieldOptions,\n from?: StoreObject | Reference,\n ) => this.policies.readField<V>(\n typeof fieldNameOrOptions === \"string\" ? {\n fieldName: fieldNameOrOptions,\n from: from || makeReference(dataId),\n } : fieldNameOrOptions,\n { store: this },\n ),\n };\n\n Object.keys(storeObject).forEach(storeFieldName => {\n const fieldName = fieldNameFromStoreName(storeFieldName);\n let fieldValue = storeObject[storeFieldName];\n if (fieldValue === void 0) return;\n const modify: Modifier<StoreValue> = typeof fields === \"function\"\n ? fields\n : fields[storeFieldName] || fields[fieldName];\n if (modify) {\n let newValue = modify === delModifier ? DELETE :\n modify(maybeDeepFreeze(fieldValue), {\n ...sharedDetails,\n fieldName,\n storeFieldName,\n storage: this.getStorage(dataId, storeFieldName),\n });\n if (newValue === INVALIDATE) {\n this.group.dirty(dataId, storeFieldName);\n } else {\n if (newValue === DELETE) newValue = void 0;\n if (newValue !== fieldValue) {\n changedFields[storeFieldName] = newValue;\n needToMerge = true;\n fieldValue = newValue;\n }\n }\n }\n if (fieldValue !== void 0) {\n allDeleted = false;\n }\n });\n\n if (needToMerge) {\n this.merge(dataId, changedFields);\n\n if (allDeleted) {\n if (this instanceof Layer) {\n this.data[dataId] = void 0;\n } else {\n delete this.data[dataId];\n }\n this.group.dirty(dataId, \"__exists\");\n }\n\n return true;\n }\n }\n\n return false;\n }\n\n // If called with only one argument, removes the entire entity\n // identified by dataId. If called with a fieldName as well, removes all\n // fields of that entity whose names match fieldName according to the\n // fieldNameFromStoreName helper function. If called with a fieldName\n // and variables, removes all fields of that entity whose names match fieldName\n // and whose arguments when cached exactly match the variables passed.\n public delete(\n dataId: string,\n fieldName?: string,\n args?: Record<string, any>,\n ) {\n const storeObject = this.lookup(dataId);\n if (storeObject) {\n const typename = this.getFieldValue<string>(storeObject, \"__typename\");\n const storeFieldName = fieldName && args\n ? this.policies.getStoreFieldName({ typename, fieldName, args })\n : fieldName;\n return this.modify(dataId, storeFieldName ? {\n [storeFieldName]: delModifier,\n } : delModifier);\n }\n return false;\n }\n\n public evict(options: Cache.EvictOptions): boolean {\n let evicted = false;\n if (options.id) {\n if (hasOwn.call(this.data, options.id)) {\n evicted = this.delete(options.id, options.fieldName, options.args);\n }\n if (this instanceof Layer) {\n evicted = this.parent.evict(options) || evicted;\n }\n // Always invalidate the field to trigger rereading of watched\n // queries, even if no cache data was modified by the eviction,\n // because queries may depend on computed fields with custom read\n // functions, whose values are not stored in the EntityStore.\n if (options.fieldName || evicted) {\n this.group.dirty(options.id, options.fieldName || \"__exists\");\n }\n }\n return evicted;\n }\n\n public clear(): void {\n this.replace(null);\n }\n\n public extract(): NormalizedCacheObject {\n const obj = this.toObject();\n const extraRootIds: string[] = [];\n this.getRootIdSet().forEach(id => {\n if (!hasOwn.call(this.policies.rootTypenamesById, id)) {\n extraRootIds.push(id);\n }\n });\n if (extraRootIds.length) {\n obj.__META = { extraRootIds: extraRootIds.sort() };\n }\n return obj;\n }\n\n public replace(newData: NormalizedCacheObject | null): void {\n Object.keys(this.data).forEach(dataId => {\n if (!(newData && hasOwn.call(newData, dataId))) {\n this.delete(dataId);\n }\n });\n if (newData) {\n const { __META, ...rest } = newData;\n Object.keys(rest).forEach(dataId => {\n this.merge(dataId, rest[dataId] as StoreObject);\n });\n if (__META) {\n __META.extraRootIds.forEach(this.retain, this);\n }\n }\n }\n\n public abstract getStorage(\n idOrObj: string | StoreObject,\n ...storeFieldNames: (string | number)[]\n ): StorageType;\n\n // Maps root entity IDs to the number of times they have been retained, minus\n // the number of times they have been released. Retained entities keep other\n // entities they reference (even indirectly) from being garbage collected.\n private rootIds: {\n [rootId: string]: number;\n } = Object.create(null);\n\n public retain(rootId: string): number {\n return this.rootIds[rootId] = (this.rootIds[rootId] || 0) + 1;\n }\n\n public release(rootId: string): number {\n if (this.rootIds[rootId] > 0) {\n const count = --this.rootIds[rootId];\n if (!count) delete this.rootIds[rootId];\n return count;\n }\n return 0;\n }\n\n // Return a Set<string> of all the ID strings that have been retained by\n // this layer/root *and* any layers/roots beneath it.\n public getRootIdSet(ids = new Set<string>()) {\n Object.keys(this.rootIds).forEach(ids.add, ids);\n if (this instanceof Layer) {\n this.parent.getRootIdSet(ids);\n } else {\n // Official singleton IDs like ROOT_QUERY and ROOT_MUTATION are\n // always considered roots for garbage collection, regardless of\n // their retainment counts in this.rootIds.\n Object.keys(this.policies.rootTypenamesById).forEach(ids.add, ids);\n }\n return ids;\n }\n\n // The goal of garbage collection is to remove IDs from the Root layer of the\n // store that are no longer reachable starting from any IDs that have been\n // explicitly retained (see retain and release, above). Returns an array of\n // dataId strings that were removed from the store.\n public gc() {\n const ids = this.getRootIdSet();\n const snapshot = this.toObject();\n ids.forEach(id => {\n if (hasOwn.call(snapshot, id)) {\n // Because we are iterating over an ECMAScript Set, the IDs we add here\n // will be visited in later iterations of the forEach loop only if they\n // were not previously contained by the Set.\n Object.keys(this.findChildRefIds(id)).forEach(ids.add, ids);\n // By removing IDs from the snapshot object here, we protect them from\n // getting removed from the root store layer below.\n delete snapshot[id];\n }\n });\n const idsToRemove = Object.keys(snapshot);\n if (idsToRemove.length) {\n let root: EntityStore = this;\n while (root instanceof Layer) root = root.parent;\n idsToRemove.forEach(id => root.delete(id));\n }\n return idsToRemove;\n }\n\n // Lazily tracks { __ref: <dataId> } strings contained by this.data[dataId].\n private refs: {\n [dataId: string]: Record<string, true>;\n } = Object.create(null);\n\n public findChildRefIds(dataId: string): Record<string, true> {\n if (!hasOwn.call(this.refs, dataId)) {\n const found = this.refs[dataId] = Object.create(null);\n const workSet = new Set([this.data[dataId]]);\n // Within the store, only arrays and objects can contain child entity\n // references, so we can prune the traversal using this predicate:\n const canTraverse = (obj: any) => obj !== null && typeof obj === 'object';\n workSet.forEach(obj => {\n if (isReference(obj)) {\n found[obj.__ref] = true;\n } else if (canTraverse(obj)) {\n Object.values(obj!)\n // No need to add primitive values to the workSet, since they cannot\n // contain reference objects.\n .filter(canTraverse)\n .forEach(workSet.add, workSet);\n }\n });\n }\n return this.refs[dataId];\n }\n\n // Used to compute cache keys specific to this.group.\n public makeCacheKey(...args: any[]) {\n return this.group.keyMaker.lookupArray(args);\n }\n\n // Bound function that can be passed around to provide easy access to fields\n // of Reference objects as well as ordinary objects.\n public getFieldValue = <T = StoreValue>(\n objectOrReference: StoreObject | Reference | undefined,\n storeFieldName: string,\n ) => maybeDeepFreeze(\n isReference(objectOrReference)\n ? this.get(objectOrReference.__ref, storeFieldName)\n : objectOrReference && objectOrReference[storeFieldName]\n ) as SafeReadonly<T>;\n\n // Returns true for non-normalized StoreObjects and non-dangling\n // References, indicating that readField(name, objOrRef) has a chance of\n // working. Useful for filtering out dangling references from lists.\n public canRead: CanReadFunction = objOrRef => {\n return isReference(objOrRef)\n ? this.has(objOrRef.__ref)\n : typeof objOrRef === \"object\";\n };\n\n // Bound function that converts an id or an object with a __typename and\n // primary key fields to a Reference object. If called with a Reference object,\n // that same Reference object is returned. Pass true for mergeIntoStore to persist\n // an object into the store.\n public toReference: ToReferenceFunction = (\n objOrIdOrRef,\n mergeIntoStore,\n ) => {\n if (typeof objOrIdOrRef === \"string\") {\n return makeReference(objOrIdOrRef);\n }\n\n if (isReference(objOrIdOrRef)) {\n return objOrIdOrRef;\n }\n\n const [id] = this.policies.identify(objOrIdOrRef);\n\n if (id) {\n const ref = makeReference(id);\n if (mergeIntoStore) {\n this.merge(id, objOrIdOrRef);\n }\n return ref;\n }\n };\n}\n\nexport type FieldValueGetter = EntityStore[\"getFieldValue\"];\n\n// A single CacheGroup represents a set of one or more EntityStore objects,\n// typically the Root store in a CacheGroup by itself, and all active Layer\n// stores in a group together. A single EntityStore object belongs to only\n// one CacheGroup, store.group. The CacheGroup is responsible for tracking\n// dependencies, so store.group is helpful for generating unique keys for\n// cached results that need to be invalidated when/if those dependencies\n// change. If we used the EntityStore objects themselves as cache keys (that\n// is, store rather than store.group), the cache would become unnecessarily\n// fragmented by all the different Layer objects. Instead, the CacheGroup\n// approach allows all optimistic Layer objects in the same linked list to\n// belong to one CacheGroup, with the non-optimistic Root object belonging\n// to another CacheGroup, allowing resultCaching dependencies to be tracked\n// separately for optimistic and non-optimistic entity data.\nclass CacheGroup {\n private d: OptimisticDependencyFunction<string> | null = null;\n\n constructor(public readonly caching: boolean) {\n this.d = caching ? dep<string>() : null;\n }\n\n public depend(dataId: string, storeFieldName: string) {\n if (this.d) {\n this.d(makeDepKey(dataId, storeFieldName));\n const fieldName = fieldNameFromStoreName(storeFieldName);\n if (fieldName !== storeFieldName) {\n // Fields with arguments that contribute extra identifying\n // information to the fieldName (thus forming the storeFieldName)\n // depend not only on the full storeFieldName but also on the\n // short fieldName, so the field can be invalidated using either\n // level of specificity.\n this.d(makeDepKey(dataId, fieldName));\n }\n }\n }\n\n public dirty(dataId: string, storeFieldName: string) {\n if (this.d) {\n this.d.dirty(makeDepKey(dataId, storeFieldName));\n }\n }\n\n // Used by the EntityStore#makeCacheKey method to compute cache keys\n // specific to this CacheGroup.\n public readonly keyMaker = new KeyTrie<object>(canUseWeakMap);\n}\n\nfunction makeDepKey(dataId: string, storeFieldName: string) {\n // Since field names cannot have '#' characters in them, this method\n // of joining the field name and the ID should be unambiguous, and much\n // cheaper than JSON.stringify([dataId, fieldName]).\n return storeFieldName + '#' + dataId;\n}\n\nexport namespace EntityStore {\n // Refer to this class as EntityStore.Root outside this namespace.\n export class Root extends EntityStore {\n // Although each Root instance gets its own unique CacheGroup object,\n // any Layer instances created by calling addLayer need to share a\n // single distinct CacheGroup object. Since this shared object must\n // outlast the Layer instances themselves, it needs to be created and\n // owned by the Root instance.\n private sharedLayerGroup: CacheGroup;\n\n constructor({\n policies,\n resultCaching = true,\n seed,\n }: {\n policies: Policies;\n resultCaching?: boolean;\n seed?: NormalizedCacheObject;\n }) {\n super(policies, new CacheGroup(resultCaching));\n this.sharedLayerGroup = new CacheGroup(resultCaching);\n if (seed) this.replace(seed);\n }\n\n public addLayer(\n layerId: string,\n replay: (layer: EntityStore) => any,\n ): Layer {\n // The replay function will be called in the Layer constructor.\n return new Layer(layerId, this, replay, this.sharedLayerGroup);\n }\n\n public removeLayer(): Root {\n // Never remove the root layer.\n return this;\n }\n\n public readonly storageTrie = new KeyTrie<StorageType>(canUseWeakMap);\n public getStorage(): StorageType {\n return this.storageTrie.lookupArray(arguments);\n }\n }\n}\n\n// Not exported, since all Layer instances are created by the addLayer method\n// of the EntityStore.Root class.\nclass Layer extends EntityStore {\n constructor(\n public readonly id: string,\n public readonly parent: EntityStore,\n public readonly replay: (layer: EntityStore) => any,\n public readonly group: CacheGroup,\n ) {\n super(parent.policies, group);\n replay(this);\n }\n\n public addLayer(\n layerId: string,\n replay: (layer: EntityStore) => any,\n ): Layer {\n return new Layer(layerId, this, replay, this.group);\n }\n\n public removeLayer(layerId: string): EntityStore {\n // Remove all instances of the given id, not just the first one.\n const parent = this.parent.removeLayer(layerId);\n\n if (layerId === this.id) {\n // Dirty every ID we're removing.\n if (this.group.caching) {\n Object.keys(this.data).forEach(dataId => {\n // If this.data[dataId] contains nothing different from what\n // lies beneath, we can avoid dirtying this dataId and all of\n // its fields, and simply discard this Layer. The only reason we\n // call this.delete here is to dirty the removed fields.\n if (this.data[dataId] !== (parent as Layer).lookup(dataId)) {\n this.delete(dataId);\n }\n });\n }\n return parent;\n }\n\n // No changes are necessary if the parent chain remains identical.\n if (parent === this.parent) return this;\n\n // Recreate this layer on top of the new parent.\n return parent.addLayer(this.id, this.replay);\n }\n\n public toObject(): NormalizedCacheObject {\n return {\n ...this.parent.toObject(),\n ...this.data,\n };\n }\n\n public findChildRefIds(dataId: string): Record<string, true> {\n const fromParent = this.parent.findChildRefIds(dataId);\n return hasOwn.call(this.data, dataId) ? {\n ...fromParent,\n ...super.findChildRefIds(dataId),\n } : fromParent;\n }\n\n public getStorage(): StorageType {\n let p: EntityStore = this.parent;\n while ((p as Layer).parent) p = (p as Layer).parent;\n return p.getStorage.apply(p, arguments);\n }\n}\n\nfunction storeObjectReconciler(\n existingObject: StoreObject,\n incomingObject: StoreObject,\n property: string,\n): StoreValue {\n const existingValue = existingObject[property];\n const incomingValue = incomingObject[property];\n // Wherever there is a key collision, prefer the incoming value, unless\n // it is deeply equal to the existing value. It's worth checking deep\n // equality here (even though blindly returning incoming would be\n // logically correct) because preserving the referential identity of\n // existing data can prevent needless rereading and rerendering.\n return equal(existingValue, incomingValue) ? existingValue : incomingValue;\n}\n\nexport function supportsResultCaching(store: any): store is EntityStore {\n // When result caching is disabled, store.depend will be null.\n return !!(store instanceof EntityStore && store.group.caching);\n}\n", "import {\n DocumentNode,\n FieldNode,\n SelectionSetNode,\n} from 'graphql';\nimport { wrap, OptimisticWrapperFunction } from 'optimism';\nimport { invariant, InvariantError } from 'ts-invariant';\n\nimport {\n isField,\n resultKeyNameFromField,\n Reference,\n isReference,\n makeReference,\n StoreObject,\n createFragmentMap,\n FragmentMap,\n shouldInclude,\n addTypenameToDocument,\n getDefaultValues,\n getFragmentDefinitions,\n getMainDefinition,\n getQueryDefinition,\n maybeDeepFreeze,\n mergeDeepArray,\n getFragmentFromSelection,\n} from '../../utilities';\nimport { Cache } from '../core/types/Cache';\nimport {\n DiffQueryAgainstStoreOptions,\n NormalizedCache,\n ReadMergeModifyContext,\n} from './types';\nimport { supportsResultCaching } from './entityStore';\nimport { getTypenameFromStoreObject } from './helpers';\nimport { Policies } from './policies';\nimport { InMemoryCache } from './inMemoryCache';\nimport { MissingFieldError } from '../core/types/common';\n\nexport type VariableMap = { [name: string]: any };\n\ninterface ReadContext extends ReadMergeModifyContext {\n query: DocumentNode;\n policies: Policies;\n fragmentMap: FragmentMap;\n path: (string | number)[];\n clientOnly: boolean;\n};\n\nexport type ExecResult<R = any> = {\n result: R;\n missing?: MissingFieldError[];\n};\n\nfunction missingFromInvariant(\n err: InvariantError,\n context: ReadContext,\n) {\n return new MissingFieldError(\n err.message,\n context.path.slice(),\n context.query,\n context.clientOnly,\n context.variables,\n );\n}\n\ntype ExecSelectionSetOptions = {\n selectionSet: SelectionSetNode;\n objectOrReference: StoreObject | Reference;\n context: ReadContext;\n};\n\ntype ExecSubSelectedArrayOptions = {\n field: FieldNode;\n array: any[];\n context: ReadContext;\n};\n\nexport interface StoreReaderConfig {\n cache: InMemoryCache,\n addTypename?: boolean;\n}\n\nexport class StoreReader {\n constructor(private config: StoreReaderConfig) {\n this.config = { addTypename: true, ...config };\n }\n\n /**\n * Given a store and a query, return as much of the result as possible and\n * identify if any data was missing from the store.\n * @param {DocumentNode} query A parsed GraphQL query document\n * @param {Store} store The Apollo Client store object\n * @return {result: Object, complete: [boolean]}\n */\n public diffQueryAgainstStore<T>({\n store,\n query,\n rootId = 'ROOT_QUERY',\n variables,\n returnPartialData = true,\n }: DiffQueryAgainstStoreOptions): Cache.DiffResult<T> {\n const policies = this.config.cache.policies;\n\n variables = {\n ...getDefaultValues(getQueryDefinition(query)),\n ...variables,\n };\n\n const execResult = this.executeSelectionSet({\n selectionSet: getMainDefinition(query).selectionSet,\n objectOrReference: makeReference(rootId),\n context: {\n store,\n query,\n policies,\n variables,\n varString: JSON.stringify(variables),\n fragmentMap: createFragmentMap(getFragmentDefinitions(query)),\n path: [],\n clientOnly: false,\n },\n });\n\n const hasMissingFields =\n execResult.missing && execResult.missing.length > 0;\n if (hasMissingFields && !returnPartialData) {\n throw execResult.missing![0];\n }\n\n return {\n result: execResult.result,\n missing: execResult.missing,\n complete: !hasMissingFields,\n };\n }\n\n public isFresh(\n result: Record<string, any>,\n parent: StoreObject | Reference,\n selectionSet: SelectionSetNode,\n context: ReadMergeModifyContext,\n ): boolean {\n if (supportsResultCaching(context.store) &&\n this.knownResults.get(result) === selectionSet) {\n const latest = this.executeSelectionSet.peek(selectionSet, parent, context);\n if (latest && result === latest.result) {\n return true;\n }\n }\n return false;\n }\n\n // Cached version of execSelectionSetImpl.\n private executeSelectionSet: OptimisticWrapperFunction<\n [ExecSelectionSetOptions], // Actual arguments tuple type.\n ExecResult, // Actual return type.\n // Arguments type after keyArgs translation.\n [SelectionSetNode, StoreObject | Reference, ReadMergeModifyContext]\n > = wrap(options => this.execSelectionSetImpl(options), {\n keyArgs(options) {\n return [\n options.selectionSet,\n options.objectOrReference,\n options.context,\n ];\n },\n // Note that the parameters of makeCacheKey are determined by the\n // array returned by keyArgs.\n makeCacheKey(selectionSet, parent, context) {\n if (supportsResultCaching(context.store)) {\n return context.store.makeCacheKey(\n selectionSet,\n isReference(parent) ? parent.__ref : parent,\n context.varString,\n );\n }\n }\n });\n\n // Uncached version of executeSelectionSet.\n private execSelectionSetImpl({\n selectionSet,\n objectOrReference,\n context,\n }: ExecSelectionSetOptions): ExecResult {\n if (isReference(objectOrReference) &&\n !context.policies.rootTypenamesById[objectOrReference.__ref] &&\n !context.store.has(objectOrReference.__ref)) {\n return {\n result: {},\n missing: [missingFromInvariant(\n new InvariantError(\n `Dangling reference to missing ${objectOrReference.__ref} object`\n ),\n context,\n )],\n };\n }\n\n const { variables, policies, store } = context;\n const objectsToMerge: { [key: string]: any }[] = [];\n const finalResult: ExecResult = { result: null };\n const typename = store.getFieldValue<string>(objectOrReference, \"__typename\");\n\n if (this.config.addTypename &&\n typeof typename === \"string\" &&\n !policies.rootIdsByTypename[typename]) {\n // Ensure we always include a default value for the __typename\n // field, if we have one, and this.config.addTypename is true. Note\n // that this field can be overridden by other merged objects.\n objectsToMerge.push({ __typename: typename });\n }\n\n function getMissing() {\n return finalResult.missing || (finalResult.missing = []);\n }\n\n function handleMissing<T>(result: ExecResult<T>): T {\n if (result.missing) getMissing().push(...result.missing);\n return result.result;\n }\n\n const workSet = new Set(selectionSet.selections);\n\n workSet.forEach(selection => {\n // Omit fields with directives @skip(if: <truthy value>) or\n // @include(if: <falsy value>).\n if (!shouldInclude(selection, variables)) return;\n\n if (isField(selection)) {\n let fieldValue = policies.readField({\n fieldName: selection.name.value,\n field: selection,\n variables: context.variables,\n from: objectOrReference,\n }, context);\n\n const resultName = resultKeyNameFromField(selection);\n context.path.push(resultName);\n\n // If this field has an @client directive, then the field and\n // everything beneath it is client-only, meaning it will never be\n // sent to the server.\n const wasClientOnly = context.clientOnly;\n // Once we enter a client-only subtree of the query, we can avoid\n // repeatedly checking selection.directives.\n context.clientOnly = wasClientOnly || !!(\n // We don't use the hasDirectives helper here, because it looks\n // for directives anywhere inside the AST node, whereas we only\n // care about directives directly attached to this field.\n selection.directives &&\n selection.directives.some(d => d.name.value === \"client\")\n );\n\n if (fieldValue === void 0) {\n if (!addTypenameToDocument.added(selection)) {\n getMissing().push(\n missingFromInvariant(\n new InvariantError(`Can't find field '${\n selection.name.value\n }' on ${\n isReference(objectOrReference)\n ? objectOrReference.__ref + \" object\"\n : \"object \" + JSON.stringify(objectOrReference, null, 2)\n }`),\n context,\n ),\n );\n }\n\n } else if (Array.isArray(fieldValue)) {\n fieldValue = handleMissing(this.executeSubSelectedArray({\n field: selection,\n array: fieldValue,\n context,\n }));\n\n } else if (!selection.selectionSet) {\n // If the field does not have a selection set, then we handle it\n // as a scalar value. However, that value should not contain any\n // Reference objects, and should be frozen in development, if it\n // happens to be an object that is mutable.\n if (process.env.NODE_ENV !== 'production') {\n assertSelectionSetForIdValue(\n context.store,\n selection,\n fieldValue,\n );\n maybeDeepFreeze(fieldValue);\n }\n\n } else if (fieldValue != null) {\n // In this case, because we know the field has a selection set,\n // it must be trying to query a GraphQLObjectType, which is why\n // fieldValue must be != null.\n fieldValue = handleMissing(this.executeSelectionSet({\n selectionSet: selection.selectionSet,\n objectOrReference: fieldValue as StoreObject | Reference,\n context,\n }));\n }\n\n if (fieldValue !== void 0) {\n objectsToMerge.push({ [resultName]: fieldValue });\n }\n\n context.clientOnly = wasClientOnly;\n\n invariant(context.path.pop() === resultName);\n\n } else {\n const fragment = getFragmentFromSelection(\n selection,\n context.fragmentMap,\n );\n\n if (fragment && policies.fragmentMatches(fragment, typename)) {\n fragment.selectionSet.selections.forEach(workSet.add, workSet);\n }\n }\n });\n\n // Perform a single merge at the end so that we can avoid making more\n // defensive shallow copies than necessary.\n finalResult.result = mergeDeepArray(objectsToMerge);\n\n if (process.env.NODE_ENV !== 'production') {\n Object.freeze(finalResult.result);\n }\n\n // Store this result with its selection set so that we can quickly\n // recognize it again in the StoreReader#isFresh method.\n this.knownResults.set(finalResult.result, selectionSet);\n\n return finalResult;\n }\n\n private knownResults = new WeakMap<Record<string, any>, SelectionSetNode>();\n\n // Cached version of execSubSelectedArrayImpl.\n private executeSubSelectedArray = wrap((options: ExecSubSelectedArrayOptions) => {\n return this.execSubSelectedArrayImpl(options);\n }, {\n makeCacheKey({ field, array, context }) {\n if (supportsResultCaching(context.store)) {\n return context.store.makeCacheKey(\n field,\n array,\n context.varString,\n );\n }\n }\n });\n\n // Uncached version of executeSubSelectedArray.\n private execSubSelectedArrayImpl({\n field,\n array,\n context,\n }: ExecSubSelectedArrayOptions): ExecResult {\n let missing: MissingFieldError[] | undefined;\n\n function handleMissing<T>(childResult: ExecResult<T>, i: number): T {\n if (childResult.missing) {\n missing = missing || [];\n missing.push(...childResult.missing);\n }\n\n invariant(context.path.pop() === i);\n\n return childResult.result;\n }\n\n if (field.selectionSet) {\n array = array.filter(context.store.canRead);\n }\n\n array = array.map((item, i) => {\n // null value in array\n if (item === null) {\n return null;\n }\n\n context.path.push(i);\n\n // This is a nested array, recurse\n if (Array.isArray(item)) {\n return handleMissing(this.executeSubSelectedArray({\n field,\n array: item,\n context,\n }), i);\n }\n\n // This is an object, run the selection set on it\n if (field.selectionSet) {\n return handleMissing(this.executeSelectionSet({\n selectionSet: field.selectionSet,\n objectOrReference: item,\n context,\n }), i);\n }\n\n if (process.env.NODE_ENV !== 'production') {\n assertSelectionSetForIdValue(context.store, field, item);\n }\n\n invariant(context.path.pop() === i);\n\n return item;\n });\n\n if (process.env.NODE_ENV !== 'production') {\n Object.freeze(array);\n }\n\n return { result: array, missing };\n }\n}\n\nfunction assertSelectionSetForIdValue(\n store: NormalizedCache,\n field: FieldNode,\n fieldValue: any,\n) {\n if (!field.selectionSet) {\n const workSet = new Set([fieldValue]);\n workSet.forEach(value => {\n if (value && typeof value === \"object\") {\n invariant(\n !isReference(value),\n `Missing selection set for object of type ${\n getTypenameFromStoreObject(store, value)\n } returned for query field ${field.name.value}`,\n );\n Object.values(value).forEach(workSet.add, workSet);\n }\n });\n }\n}\n", "import { SelectionSetNode, FieldNode, DocumentNode } from 'graphql';\nimport { invariant, InvariantError } from 'ts-invariant';\nimport { equal } from '@wry/equality';\n\nimport {\n createFragmentMap,\n FragmentMap,\n getFragmentFromSelection,\n getDefaultValues,\n getFragmentDefinitions,\n getOperationDefinition,\n getTypenameFromResult,\n makeReference,\n isField,\n resultKeyNameFromField,\n StoreValue,\n StoreObject,\n Reference,\n isReference,\n shouldInclude,\n hasDirectives,\n cloneDeep,\n} from '../../utilities';\n\nimport { NormalizedCache, ReadMergeModifyContext, MergeTree } from './types';\nimport { makeProcessedFieldsMerger, fieldNameFromStoreName, storeValueIsStoreObject } from './helpers';\nimport { StoreReader } from './readFromStore';\nimport { InMemoryCache } from './inMemoryCache';\nimport { EntityStore } from './entityStore';\n\nexport interface WriteContext extends ReadMergeModifyContext {\n readonly written: {\n [dataId: string]: SelectionSetNode[];\n };\n readonly fragmentMap?: FragmentMap;\n // General-purpose deep-merge function for use during writes.\n merge<T>(existing: T, incoming: T): T;\n};\n\ninterface ProcessSelectionSetOptions {\n dataId?: string,\n result: Record<string, any>;\n selectionSet: SelectionSetNode;\n context: WriteContext;\n mergeTree: MergeTree;\n}\n\nexport interface WriteToStoreOptions {\n query: DocumentNode;\n result: Object;\n dataId?: string;\n store: NormalizedCache;\n variables?: Object;\n}\n\nexport class StoreWriter {\n constructor(\n public readonly cache: InMemoryCache,\n private reader?: StoreReader,\n ) {}\n\n /**\n * Writes the result of a query to the store.\n *\n * @param result The result object returned for the query document.\n *\n * @param query The query document whose result we are writing to the store.\n *\n * @param store The {@link NormalizedCache} used by Apollo for the `data` portion of the store.\n *\n * @param variables A map from the name of a variable to its value. These variables can be\n * referenced by the query document.\n *\n * @return A `Reference` to the written object.\n */\n public writeToStore({\n query,\n result,\n dataId,\n store,\n variables,\n }: WriteToStoreOptions): Reference | undefined {\n const operationDefinition = getOperationDefinition(query)!;\n const merger = makeProcessedFieldsMerger();\n\n variables = {\n ...getDefaultValues(operationDefinition),\n ...variables!,\n };\n\n const ref = this.processSelectionSet({\n result: result || Object.create(null),\n dataId,\n selectionSet: operationDefinition.selectionSet,\n mergeTree: { map: new Map },\n context: {\n store,\n written: Object.create(null),\n merge<T>(existing: T, incoming: T) {\n return merger.merge(existing, incoming) as T;\n },\n variables,\n varString: JSON.stringify(variables),\n fragmentMap: createFragmentMap(getFragmentDefinitions(query)),\n },\n });\n\n if (!isReference(ref)) {\n throw new InvariantError(`Could not identify object ${JSON.stringify(result)}`);\n }\n\n // Any IDs written explicitly to the cache will be retained as\n // reachable root IDs for garbage collection purposes. Although this\n // logic includes root IDs like ROOT_QUERY and ROOT_MUTATION, their\n // retainment counts are effectively ignored because cache.gc() always\n // includes them in its root ID set.\n store.retain(ref.__ref);\n\n return ref;\n }\n\n private processSelectionSet({\n dataId,\n result,\n selectionSet,\n context,\n // This object allows processSelectionSet to report useful information\n // to its callers without explicitly returning that information.\n mergeTree,\n }: ProcessSelectionSetOptions): StoreObject | Reference {\n const { policies } = this.cache;\n\n // Identify the result object, even if dataId was already provided,\n // since we always need keyObject below.\n const [id, keyObject] = policies.identify(\n result, selectionSet, context.fragmentMap);\n\n // If dataId was not provided, fall back to the id just generated by\n // policies.identify.\n dataId = dataId || id;\n\n if (\"string\" === typeof dataId) {\n // Avoid processing the same entity object using the same selection\n // set more than once. We use an array instead of a Set since most\n // entity IDs will be written using only one selection set, so the\n // size of this array is likely to be very small, meaning indexOf is\n // likely to be faster than Set.prototype.has.\n const sets = context.written[dataId] || (context.written[dataId] = []);\n const ref = makeReference(dataId);\n if (sets.indexOf(selectionSet) >= 0) return ref;\n sets.push(selectionSet);\n\n // If we're about to write a result object into the store, but we\n // happen to know that the exact same (===) result object would be\n // returned if we were to reread the result with the same inputs,\n // then we can skip the rest of the processSelectionSet work for\n // this object, and immediately return a Reference to it.\n if (this.reader && this.reader.isFresh(\n result,\n ref,\n selectionSet,\n context,\n )) {\n return ref;\n }\n }\n\n // This variable will be repeatedly updated using context.merge to\n // accumulate all fields that need to be written into the store.\n let incomingFields: StoreObject = Object.create(null);\n\n // Write any key fields that were used during identification, even if\n // they were not mentioned in the original query.\n if (keyObject) {\n incomingFields = context.merge(incomingFields, keyObject);\n }\n\n // If typename was not passed in, infer it. Note that typename is\n // always passed in for tricky-to-infer cases such as \"Query\" for\n // ROOT_QUERY.\n const typename: string | undefined =\n (dataId && policies.rootTypenamesById[dataId]) ||\n getTypenameFromResult(result, selectionSet, context.fragmentMap) ||\n (dataId && context.store.get(dataId, \"__typename\") as string);\n\n if (\"string\" === typeof typename) {\n incomingFields.__typename = typename;\n }\n\n const workSet = new Set(selectionSet.selections);\n\n workSet.forEach(selection => {\n if (!shouldInclude(selection, context.variables)) return;\n\n if (isField(selection)) {\n const resultFieldKey = resultKeyNameFromField(selection);\n const value = result[resultFieldKey];\n\n if (typeof value !== 'undefined') {\n const storeFieldName = policies.getStoreFieldName({\n typename,\n fieldName: selection.name.value,\n field: selection,\n variables: context.variables,\n });\n\n const childTree = getChildMergeTree(mergeTree, storeFieldName);\n\n let incomingValue =\n this.processFieldValue(value, selection, context, childTree);\n\n const childTypename = selection.selectionSet\n && context.store.getFieldValue<string>(incomingValue as StoreObject, \"__typename\")\n || void 0;\n\n const merge = policies.getMergeFunction(\n typename,\n selection.name.value,\n childTypename,\n );\n\n if (merge) {\n childTree.info = {\n // TODO Check compatibility against any existing\n // childTree.field?\n field: selection,\n typename,\n merge,\n };\n } else {\n maybeRecycleChildMergeTree(mergeTree, storeFieldName);\n }\n\n incomingFields = context.merge(incomingFields, {\n [storeFieldName]: incomingValue,\n });\n\n } else if (\n policies.usingPossibleTypes &&\n !hasDirectives([\"defer\", \"client\"], selection)\n ) {\n throw new InvariantError(\n `Missing field '${resultFieldKey}' in ${JSON.stringify(\n result,\n null,\n 2,\n ).substring(0, 100)}`,\n );\n }\n } else {\n // This is not a field, so it must be a fragment, either inline or named\n const fragment = getFragmentFromSelection(\n selection,\n context.fragmentMap,\n );\n\n if (fragment &&\n // By passing result and context.variables, we enable\n // policies.fragmentMatches to bend the rules when typename is\n // not a known subtype of the fragment type condition, but the\n // result object contains all the keys requested by the\n // fragment, which strongly suggests the fragment probably\n // matched. This fuzzy matching behavior must be enabled by\n // including a regular expression string (such as \".*\" or\n // \"Prefix.*\" or \".*Suffix\") in the possibleTypes array for\n // specific supertypes; otherwise, all matching remains exact.\n // Fuzzy matches are remembered by the Policies object and\n // later used when reading from the cache. Since there is no\n // incoming result object to check when reading, reading does\n // not involve the same fuzzy inference, so the StoreReader\n // class calls policies.fragmentMatches without passing result\n // or context.variables. The flexibility of fuzzy matching\n // allows existing clients to accommodate previously unknown\n // __typename strings produced by server/schema changes, which\n // would otherwise be breaking changes.\n policies.fragmentMatches(fragment, typename, result, context.variables)) {\n fragment.selectionSet.selections.forEach(workSet.add, workSet);\n }\n }\n });\n\n if (\"string\" === typeof dataId) {\n const entityRef = makeReference(dataId);\n\n if (mergeTree.map.size) {\n incomingFields = this.applyMerges(mergeTree, entityRef, incomingFields, context);\n }\n\n if (process.env.NODE_ENV !== \"production\") {\n const hasSelectionSet = (storeFieldName: string) =>\n fieldsWithSelectionSets.has(fieldNameFromStoreName(storeFieldName));\n const fieldsWithSelectionSets = new Set<string>();\n workSet.forEach(selection => {\n if (isField(selection) && selection.selectionSet) {\n fieldsWithSelectionSets.add(selection.name.value);\n }\n });\n\n const hasMergeFunction = (storeFieldName: string) => {\n const childTree = mergeTree.map.get(storeFieldName);\n return Boolean(childTree && childTree.info && childTree.info.merge);\n };\n\n Object.keys(incomingFields).forEach(storeFieldName => {\n // If a merge function was defined for this field, trust that it\n // did the right thing about (not) clobbering data. If the field\n // has no selection set, it's a scalar field, so it doesn't need\n // a merge function (even if it's an object, like JSON data).\n if (hasSelectionSet(storeFieldName) &&\n !hasMergeFunction(storeFieldName)) {\n warnAboutDataLoss(\n entityRef,\n incomingFields,\n storeFieldName,\n context.store,\n );\n }\n });\n }\n\n context.store.merge(dataId, incomingFields);\n\n return entityRef;\n }\n\n return incomingFields;\n }\n\n private processFieldValue(\n value: any,\n field: FieldNode,\n context: WriteContext,\n mergeTree: MergeTree,\n ): StoreValue {\n if (!field.selectionSet || value === null) {\n // In development, we need to clone scalar values so that they can be\n // safely frozen with maybeDeepFreeze in readFromStore.ts. In production,\n // it's cheaper to store the scalar values directly in the cache.\n return process.env.NODE_ENV === 'production' ? value : cloneDeep(value);\n }\n\n if (Array.isArray(value)) {\n return value.map((item, i) => {\n const value = this.processFieldValue(\n item, field, context, getChildMergeTree(mergeTree, i));\n maybeRecycleChildMergeTree(mergeTree, i);\n return value;\n });\n }\n\n return this.processSelectionSet({\n result: value,\n selectionSet: field.selectionSet,\n context,\n mergeTree,\n });\n }\n\n private applyMerges<T extends StoreValue>(\n mergeTree: MergeTree,\n existing: StoreValue,\n incoming: T,\n context: ReadMergeModifyContext,\n getStorageArgs?: Parameters<EntityStore[\"getStorage\"]>,\n ): T {\n if (mergeTree.map.size && !isReference(incoming)) {\n const e: StoreObject | Reference | undefined = (\n // Items in the same position in different arrays are not\n // necessarily related to each other, so when incoming is an array\n // we process its elements as if there was no existing data.\n !Array.isArray(incoming) &&\n // Likewise, existing must be either a Reference or a StoreObject\n // in order for its fields to be safe to merge with the fields of\n // the incoming object.\n (isReference(existing) || storeValueIsStoreObject(existing))\n ) ? existing : void 0;\n\n // This narrowing is implied by mergeTree.map.size > 0 and\n // !isReference(incoming), though TypeScript understandably cannot\n // hope to infer this type.\n const i = incoming as StoreObject | StoreValue[];\n\n // The options.storage objects provided to read and merge functions\n // are derived from the identity of the parent object plus a\n // sequence of storeFieldName strings/numbers identifying the nested\n // field name path of each field value to be merged.\n if (e && !getStorageArgs) {\n getStorageArgs = [isReference(e) ? e.__ref : e];\n }\n\n // It's possible that applying merge functions to this subtree will\n // not change the incoming data, so this variable tracks the fields\n // that did change, so we can create a new incoming object when (and\n // only when) at least one incoming field has changed. We use a Map\n // to preserve the type of numeric keys.\n let changedFields: Map<string | number, StoreValue> | undefined;\n\n const getValue = (\n from: typeof e | typeof i,\n name: string | number,\n ): StoreValue => {\n return Array.isArray(from)\n ? (typeof name === \"number\" ? from[name] : void 0)\n : context.store.getFieldValue(from, String(name))\n };\n\n mergeTree.map.forEach((childTree, storeFieldName) => {\n if (getStorageArgs) {\n getStorageArgs.push(storeFieldName);\n }\n const eVal = getValue(e, storeFieldName);\n const iVal = getValue(i, storeFieldName);\n const aVal = this.applyMerges(\n childTree,\n eVal,\n iVal,\n context,\n getStorageArgs,\n );\n if (aVal !== iVal) {\n changedFields = changedFields || new Map;\n changedFields.set(storeFieldName, aVal);\n }\n if (getStorageArgs) {\n invariant(getStorageArgs.pop() === storeFieldName);\n }\n });\n\n if (changedFields) {\n // Shallow clone i so we can add changed fields to it.\n incoming = (Array.isArray(i) ? i.slice(0) : { ...i }) as T;\n changedFields.forEach((value, name) => {\n (incoming as any)[name] = value;\n });\n }\n }\n\n if (mergeTree.info) {\n return this.cache.policies.runMergeFunction(\n existing,\n incoming,\n mergeTree.info,\n context,\n getStorageArgs && context.store.getStorage(...getStorageArgs),\n );\n }\n\n return incoming;\n }\n}\n\nconst emptyMergeTreePool: MergeTree[] = [];\n\nfunction getChildMergeTree(\n { map }: MergeTree,\n name: string | number,\n): MergeTree {\n if (!map.has(name)) {\n map.set(name, emptyMergeTreePool.pop() || { map: new Map });\n }\n return map.get(name)!;\n}\n\nfunction maybeRecycleChildMergeTree(\n { map }: MergeTree,\n name: string | number,\n) {\n const childTree = map.get(name);\n if (childTree &&\n !childTree.info &&\n !childTree.map.size) {\n emptyMergeTreePool.push(childTree);\n map.delete(name);\n }\n}\n\nconst warnings = new Set<string>();\n\n// Note that this function is unused in production, and thus should be\n// pruned by any well-configured minifier.\nfunction warnAboutDataLoss(\n existingRef: Reference,\n incomingObj: StoreObject,\n storeFieldName: string,\n store: NormalizedCache,\n) {\n const getChild = (objOrRef: StoreObject | Reference): StoreObject | false => {\n const child = store.getFieldValue<StoreObject>(objOrRef, storeFieldName);\n return typeof child === \"object\" && child;\n };\n\n const existing = getChild(existingRef);\n if (!existing) return;\n\n const incoming = getChild(incomingObj);\n if (!incoming) return;\n\n // It's always safe to replace a reference, since it refers to data\n // safely stored elsewhere.\n if (isReference(existing)) return;\n\n // If the values are structurally equivalent, we do not need to worry\n // about incoming replacing existing.\n if (equal(existing, incoming)) return;\n\n // If we're replacing every key of the existing object, then the\n // existing data would be overwritten even if the objects were\n // normalized, so warning would not be helpful here.\n if (Object.keys(existing).every(\n key => store.getFieldValue(incoming, key) !== void 0)) {\n return;\n }\n\n const parentType =\n store.getFieldValue<string>(existingRef, \"__typename\") ||\n store.getFieldValue<string>(incomingObj, \"__typename\");\n const fieldName = fieldNameFromStoreName(storeFieldName);\n const typeDotName = `${parentType}.${fieldName}`;\n // Avoid warning more than once for the same type and field name.\n if (warnings.has(typeDotName)) return;\n warnings.add(typeDotName);\n\n const childTypenames: string[] = [];\n // Arrays do not have __typename fields, and always need a custom merge\n // function, even if their elements are normalized entities.\n if (!Array.isArray(existing) &&\n !Array.isArray(incoming)) {\n [existing, incoming].forEach(child => {\n const typename = store.getFieldValue(child, \"__typename\");\n if (typeof typename === \"string\" &&\n !childTypenames.includes(typename)) {\n childTypenames.push(typename);\n }\n });\n }\n\n invariant.warn(\n`Cache data may be lost when replacing the ${fieldName} field of a ${parentType} object.\n\nTo address this problem (which is not a bug in Apollo Client), ${\n childTypenames.length\n ? \"either ensure all objects of type \" +\n childTypenames.join(\" and \") + \" have an ID or a custom merge function, or \"\n : \"\"\n}define a custom merge function for the ${\n typeDotName\n} field, so InMemoryCache can safely merge these objects:\n\n existing: ${JSON.stringify(existing).slice(0, 1000)}\n incoming: ${JSON.stringify(incoming).slice(0, 1000)}\n\nFor more information about these options, please refer to the documentation:\n\n * Ensuring entity objects have IDs: https://go.apollo.dev/c/generating-unique-identifiers\n * Defining custom merge functions: https://go.apollo.dev/c/merging-non-normalized-objects\n`);\n}\n", "import { dep, OptimisticDependencyFunction } from \"optimism\";\nimport { Slot } from \"@wry/context\";\nimport { InMemoryCache } from \"./inMemoryCache\";\nimport { ApolloCache } from '../../core';\n\nexport interface ReactiveVar<T> {\n (newValue?: T): T;\n onNextChange(listener: ReactiveListener<T>): () => void;\n attachCache(cache: ApolloCache<any>): this;\n forgetCache(cache: ApolloCache<any>): boolean;\n}\n\nexport type ReactiveListener<T> = (value: T) => any;\n\n// Contextual Slot that acquires its value when custom read functions are\n// called in Policies#readField.\nexport const cacheSlot = new Slot<ApolloCache<any>>();\n\nconst cacheInfoMap = new WeakMap<ApolloCache<any>, {\n vars: Set<ReactiveVar<any>>;\n dep: OptimisticDependencyFunction<ReactiveVar<any>>;\n}>();\n\nfunction getCacheInfo(cache: ApolloCache<any>) {\n let info = cacheInfoMap.get(cache)!;\n if (!info) {\n cacheInfoMap.set(cache, info = {\n vars: new Set,\n dep: dep(),\n });\n }\n return info;\n}\n\nexport function forgetCache(cache: ApolloCache<any>) {\n getCacheInfo(cache).vars.forEach(rv => rv.forgetCache(cache));\n}\n\n// Calling forgetCache(cache) serves to silence broadcasts and allows the\n// cache to be garbage collected. However, the varsByCache WeakMap\n// preserves the set of reactive variables that were previously associated\n// with this cache, which makes it possible to \"recall\" the cache at a\n// later time, by reattaching it to those variables. If the cache has been\n// garbage collected in the meantime, because it is no longer reachable,\n// you won't be able to call recallCache(cache), and the cache will\n// automatically disappear from the varsByCache WeakMap.\nexport function recallCache(cache: ApolloCache<any>) {\n getCacheInfo(cache).vars.forEach(rv => rv.attachCache(cache));\n}\n\nexport function makeVar<T>(value: T): ReactiveVar<T> {\n const caches = new Set<ApolloCache<any>>();\n const listeners = new Set<ReactiveListener<T>>();\n\n const rv: ReactiveVar<T> = function (newValue) {\n if (arguments.length > 0) {\n if (value !== newValue) {\n value = newValue!;\n caches.forEach(cache => {\n // Invalidate any fields with custom read functions that\n // consumed this variable, so query results involving those\n // fields will be recomputed the next time we read them.\n getCacheInfo(cache).dep.dirty(rv);\n // Broadcast changes to any caches that have previously read\n // from this variable.\n broadcast(cache);\n });\n // Finally, notify any listeners added via rv.onNextChange.\n const oldListeners = Array.from(listeners);\n listeners.clear();\n oldListeners.forEach(listener => listener(value));\n }\n } else {\n // When reading from the variable, obtain the current cache from\n // context via cacheSlot. This isn't entirely foolproof, but it's\n // the same system that powers varDep.\n const cache = cacheSlot.getValue();\n if (cache) {\n attach(cache);\n getCacheInfo(cache).dep(rv);\n }\n }\n\n return value;\n };\n\n rv.onNextChange = listener => {\n listeners.add(listener);\n return () => {\n listeners.delete(listener);\n };\n };\n\n const attach = rv.attachCache = cache => {\n caches.add(cache);\n getCacheInfo(cache).vars.add(rv);\n return rv;\n };\n\n rv.forgetCache = cache => caches.delete(cache);\n\n return rv;\n}\n\ntype Broadcastable = ApolloCache<any> & {\n // This method is protected in InMemoryCache, which we are ignoring, but\n // we still want some semblance of type safety when we call it.\n broadcastWatches?: InMemoryCache[\"broadcastWatches\"];\n};\n\nfunction broadcast(cache: Broadcastable) {\n if (cache.broadcastWatches) {\n cache.broadcastWatches();\n }\n}\n", "import {\n InlineFragmentNode,\n FragmentDefinitionNode,\n SelectionSetNode,\n FieldNode,\n} from 'graphql';\n\nimport { KeyTrie } from 'optimism';\nimport { invariant, InvariantError } from 'ts-invariant';\n\nimport {\n FragmentMap,\n getFragmentFromSelection,\n isField,\n getTypenameFromResult,\n storeKeyNameFromField,\n StoreValue,\n StoreObject,\n argumentsObjectFromField,\n Reference,\n isReference,\n getStoreKeyName,\n canUseWeakMap,\n} from '../../utilities';\nimport { IdGetter, ReadMergeModifyContext, MergeInfo } from \"./types\";\nimport {\n hasOwn,\n fieldNameFromStoreName,\n storeValueIsStoreObject,\n selectionSetMatchesResult,\n TypeOrFieldNameRegExp,\n} from './helpers';\nimport { cacheSlot } from './reactiveVars';\nimport { InMemoryCache } from './inMemoryCache';\nimport {\n SafeReadonly,\n FieldSpecifier,\n ToReferenceFunction,\n ReadFieldFunction,\n ReadFieldOptions,\n CanReadFunction,\n} from '../core/types/common';\nimport { FieldValueGetter } from './entityStore';\n\nexport type TypePolicies = {\n [__typename: string]: TypePolicy;\n}\n\n// TypeScript 3.7 will allow recursive type aliases, so this should work:\n// type KeySpecifier = (string | KeySpecifier)[]\ntype KeySpecifier = (string | any[])[];\n\ntype KeyFieldsContext = {\n typename?: string;\n selectionSet?: SelectionSetNode;\n fragmentMap?: FragmentMap;\n // May be set by the KeyFieldsFunction to report fields that were involved\n // in computing the ID. Never passed in by the caller.\n keyObject?: Record<string, any>;\n};\n\nexport type KeyFieldsFunction = (\n object: Readonly<StoreObject>,\n context: KeyFieldsContext,\n) => KeySpecifier | false | ReturnType<IdGetter>;\n\ntype KeyFieldsResult = Exclude<ReturnType<KeyFieldsFunction>, KeySpecifier>;\n\n// TODO Should TypePolicy be a generic type, with a TObject or TEntity\n// type parameter?\nexport type TypePolicy = {\n // Allows defining the primary key fields for this type, either using an\n // array of field names or a function that returns an arbitrary string.\n keyFields?: KeySpecifier | KeyFieldsFunction | false;\n\n // Allows defining a merge function (or merge:true/false shorthand) to\n // be used for merging objects of this type wherever they appear, unless\n // the parent field also defines a merge function/boolean (that is,\n // parent field merge functions take precedence over type policy merge\n // functions). In many cases, defining merge:true for a given type\n // policy can save you from specifying merge:true for all the field\n // policies where that type might be encountered.\n merge?: FieldMergeFunction | boolean;\n\n // In the rare event that your schema happens to use a different\n // __typename for the root Query, Mutation, and/or Schema types, you can\n // express your deviant preferences by enabling one of these options.\n queryType?: true,\n mutationType?: true,\n subscriptionType?: true,\n\n fields?: {\n [fieldName: string]:\n | FieldPolicy<any>\n | FieldReadFunction<any>;\n }\n};\n\nexport type KeyArgsFunction = (\n args: Record<string, any> | null,\n context: {\n typename: string;\n fieldName: string;\n field: FieldNode | null;\n variables?: Record<string, any>;\n },\n) => KeySpecifier | false | ReturnType<IdGetter>;\n\ntype KeyArgsResult = Exclude<ReturnType<KeyArgsFunction>, KeySpecifier>;\n\nexport type FieldPolicy<\n // The internal representation used to store the field's data in the\n // cache. Must be JSON-serializable if you plan to serialize the result\n // of cache.extract() using JSON.\n TExisting = any,\n // The type of the incoming parameter passed to the merge function,\n // typically matching the GraphQL response format, but with Reference\n // objects substituted for any identifiable child objects. Often the\n // same as TExisting, but not necessarily.\n TIncoming = TExisting,\n // The type that the read function actually returns, using TExisting\n // data and options.args as input. Usually the same as TIncoming.\n TReadResult = TIncoming,\n> = {\n keyArgs?: KeySpecifier | KeyArgsFunction | false;\n read?: FieldReadFunction<TExisting, TReadResult>;\n merge?: FieldMergeFunction<TExisting, TIncoming> | boolean;\n};\n\nexport type StorageType = Record<string, any>;\n\nfunction argsFromFieldSpecifier(spec: FieldSpecifier) {\n return spec.args !== void 0 ? spec.args :\n spec.field ? argumentsObjectFromField(spec.field, spec.variables) : null;\n}\n\nexport interface FieldFunctionOptions<\n TArgs = Record<string, any>,\n TVars = Record<string, any>,\n> {\n args: TArgs | null;\n\n // The name of the field, equal to options.field.name.value when\n // options.field is available. Useful if you reuse the same function for\n // multiple fields, and you need to know which field you're currently\n // processing. Always a string, even when options.field is null.\n fieldName: string;\n\n // The full field key used internally, including serialized key arguments.\n storeFieldName: string;\n\n // The FieldNode object used to read this field. Useful if you need to\n // know about other attributes of the field, such as its directives. This\n // option will be null when a string was passed to options.readField.\n field: FieldNode | null;\n\n variables?: TVars;\n\n // Utilities for dealing with { __ref } objects.\n isReference: typeof isReference;\n toReference: ToReferenceFunction;\n\n // A handy place to put field-specific data that you want to survive\n // across multiple read function calls. Useful for field-level caching,\n // if your read function does any expensive work.\n storage: StorageType;\n\n cache: InMemoryCache;\n\n // Helper function for reading other fields within the current object.\n // If a foreign object or reference is provided, the field will be read\n // from that object instead of the current object, so this function can\n // be used (together with isReference) to examine the cache outside the\n // current object. If a FieldNode is passed instead of a string, and\n // that FieldNode has arguments, the same options.variables will be used\n // to compute the argument values. Note that this function will invoke\n // custom read functions for other fields, if defined. Always returns\n // immutable data (enforced with Object.freeze in development).\n readField: ReadFieldFunction;\n\n // Returns true for non-normalized StoreObjects and non-dangling\n // References, indicating that readField(name, objOrRef) has a chance of\n // working. Useful for filtering out dangling references from lists.\n canRead: CanReadFunction;\n\n // Instead of just merging objects with { ...existing, ...incoming }, this\n // helper function can be used to merge objects in a way that respects any\n // custom merge functions defined for their fields.\n mergeObjects: MergeObjectsFunction;\n}\n\ntype MergeObjectsFunction = <T extends StoreObject | Reference>(\n existing: T,\n incoming: T,\n) => T;\n\nexport type FieldReadFunction<TExisting = any, TReadResult = TExisting> = (\n // When reading a field, one often needs to know about any existing\n // value stored for that field. If the field is read before any value\n // has been written to the cache, this existing parameter will be\n // undefined, which makes it easy to use a default parameter expression\n // to supply the initial value. This parameter is positional (rather\n // than one of the named options) because that makes it possible for the\n // developer to annotate it with a type, without also having to provide\n // a whole new type for the options object.\n existing: SafeReadonly<TExisting> | undefined,\n options: FieldFunctionOptions,\n) => TReadResult | undefined;\n\nexport type FieldMergeFunction<TExisting = any, TIncoming = TExisting> = (\n existing: SafeReadonly<TExisting> | undefined,\n // The incoming parameter needs to be positional as well, for the same\n // reasons discussed in FieldReadFunction above.\n incoming: SafeReadonly<TIncoming>,\n options: FieldFunctionOptions,\n) => SafeReadonly<TExisting>;\n\nexport const defaultDataIdFromObject = (\n { __typename, id, _id }: Readonly<StoreObject>,\n context?: KeyFieldsContext,\n) => {\n if (typeof __typename === \"string\") {\n if (context) {\n context.keyObject =\n id !== void 0 ? { id } :\n _id !== void 0 ? { _id } :\n void 0;\n }\n // If there is no object.id, fall back to object._id.\n if (id === void 0) id = _id;\n if (id !== void 0) {\n return `${__typename}:${(\n typeof id === \"number\" ||\n typeof id === \"string\"\n ) ? id : JSON.stringify(id)}`;\n }\n }\n};\n\nconst nullKeyFieldsFn: KeyFieldsFunction = () => void 0;\nconst simpleKeyArgsFn: KeyArgsFunction = (_args, context) => context.fieldName;\n\n// These merge functions can be selected by specifying merge:true or\n// merge:false in a field policy.\nconst mergeTrueFn: FieldMergeFunction<any> =\n (existing, incoming, { mergeObjects }) => mergeObjects(existing, incoming);\nconst mergeFalseFn: FieldMergeFunction<any> = (_, incoming) => incoming;\n\nexport type PossibleTypesMap = {\n [supertype: string]: string[];\n};\n\nexport class Policies {\n private typePolicies: {\n [__typename: string]: {\n keyFn?: KeyFieldsFunction;\n merge?: FieldMergeFunction<any>;\n fields: {\n [fieldName: string]: {\n keyFn?: KeyArgsFunction;\n read?: FieldReadFunction<any>;\n merge?: FieldMergeFunction<any>;\n };\n };\n };\n } = Object.create(null);\n\n private toBeAdded: {\n [__typename: string]: TypePolicy[];\n } = Object.create(null);\n\n // Map from subtype names to sets of supertype names. Note that this\n // representation inverts the structure of possibleTypes (whose keys are\n // supertypes and whose values are arrays of subtypes) because it tends\n // to be much more efficient to search upwards than downwards.\n private supertypeMap = new Map<string, Set<string>>();\n\n // Any fuzzy subtypes specified by possibleTypes will be converted to\n // RegExp objects and recorded here. Every key of this map can also be\n // found in supertypeMap. In many cases this Map will be empty, which\n // means no fuzzy subtype checking will happen in fragmentMatches.\n private fuzzySubtypes = new Map<string, RegExp>();\n\n public readonly cache: InMemoryCache;\n\n public readonly rootIdsByTypename: Record<string, string> = Object.create(null);\n public readonly rootTypenamesById: Record<string, string> = Object.create(null);\n\n public readonly usingPossibleTypes = false;\n\n constructor(private config: {\n cache: InMemoryCache;\n dataIdFromObject?: KeyFieldsFunction;\n possibleTypes?: PossibleTypesMap;\n typePolicies?: TypePolicies;\n }) {\n this.config = {\n dataIdFromObject: defaultDataIdFromObject,\n ...config,\n };\n\n this.cache = this.config.cache;\n\n this.setRootTypename(\"Query\");\n this.setRootTypename(\"Mutation\");\n this.setRootTypename(\"Subscription\");\n\n if (config.possibleTypes) {\n this.addPossibleTypes(config.possibleTypes);\n }\n\n if (config.typePolicies) {\n this.addTypePolicies(config.typePolicies);\n }\n }\n\n public identify(\n object: StoreObject,\n selectionSet?: SelectionSetNode,\n fragmentMap?: FragmentMap,\n ): [string?, StoreObject?] {\n // TODO Use an AliasMap here?\n const typename = selectionSet && fragmentMap\n ? getTypenameFromResult(object, selectionSet, fragmentMap)\n : object.__typename;\n\n // It should be possible to write root Query fields with\n // writeFragment, using { __typename: \"Query\", ... } as the data, but\n // it does not make sense to allow the same identification behavior\n // for the Mutation and Subscription types, since application code\n // should never be writing directly to (or reading directly from)\n // those root objects.\n if (typename === this.rootTypenamesById.ROOT_QUERY) {\n return [\"ROOT_QUERY\"];\n }\n\n const context: KeyFieldsContext = {\n typename,\n selectionSet,\n fragmentMap,\n };\n\n let id: KeyFieldsResult;\n\n const policy = typename && this.getTypePolicy(typename);\n let keyFn = policy && policy.keyFn || this.config.dataIdFromObject;\n while (keyFn) {\n const specifierOrId = keyFn(object, context);\n if (Array.isArray(specifierOrId)) {\n keyFn = keyFieldsFnFromSpecifier(specifierOrId);\n } else {\n id = specifierOrId;\n break;\n }\n }\n\n id = id ? String(id) : void 0;\n return context.keyObject ? [id, context.keyObject] : [id];\n }\n\n public addTypePolicies(typePolicies: TypePolicies) {\n Object.keys(typePolicies).forEach(typename => {\n const {\n queryType,\n mutationType,\n subscriptionType,\n ...incoming\n } = typePolicies[typename];\n\n // Though {query,mutation,subscription}Type configurations are rare,\n // it's important to call setRootTypename as early as possible,\n // since these configurations should apply consistently for the\n // entire lifetime of the cache. Also, since only one __typename can\n // qualify as one of these root types, these three properties cannot\n // be inherited, unlike the rest of the incoming properties. That\n // restriction is convenient, because the purpose of this.toBeAdded\n // is to delay the processing of type/field policies until the first\n // time they're used, allowing policies to be added in any order as\n // long as all relevant policies (including policies for supertypes)\n // have been added by the time a given policy is used for the first\n // time. In other words, since inheritance doesn't matter for these\n // properties, there's also no need to delay their processing using\n // the this.toBeAdded queue.\n if (queryType) this.setRootTypename(\"Query\", typename);\n if (mutationType) this.setRootTypename(\"Mutation\", typename);\n if (subscriptionType) this.setRootTypename(\"Subscription\", typename);\n\n if (hasOwn.call(this.toBeAdded, typename)) {\n this.toBeAdded[typename].push(incoming);\n } else {\n this.toBeAdded[typename] = [incoming];\n }\n });\n }\n\n private updateTypePolicy(typename: string, incoming: TypePolicy) {\n const existing = this.getTypePolicy(typename);\n const { keyFields, fields } = incoming;\n\n function setMerge(\n existing: { merge?: FieldMergeFunction | boolean; },\n merge?: FieldMergeFunction | boolean,\n ) {\n existing.merge =\n typeof merge === \"function\" ? merge :\n // Pass merge:true as a shorthand for a merge implementation\n // that returns options.mergeObjects(existing, incoming).\n merge === true ? mergeTrueFn :\n // Pass merge:false to make incoming always replace existing\n // without any warnings about data clobbering.\n merge === false ? mergeFalseFn :\n existing.merge;\n }\n\n // Type policies can define merge functions, as an alternative to\n // using field policies to merge child objects.\n setMerge(existing, incoming.merge);\n\n existing.keyFn =\n // Pass false to disable normalization for this typename.\n keyFields === false ? nullKeyFieldsFn :\n // Pass an array of strings to use those fields to compute a\n // composite ID for objects of this typename.\n Array.isArray(keyFields) ? keyFieldsFnFromSpecifier(keyFields) :\n // Pass a function to take full control over identification.\n typeof keyFields === \"function\" ? keyFields :\n // Leave existing.keyFn unchanged if above cases fail.\n existing.keyFn;\n\n if (fields) {\n Object.keys(fields).forEach(fieldName => {\n const existing = this.getFieldPolicy(typename, fieldName, true)!;\n const incoming = fields[fieldName];\n\n if (typeof incoming === \"function\") {\n existing.read = incoming;\n } else {\n const { keyArgs, read, merge } = incoming;\n\n existing.keyFn =\n // Pass false to disable argument-based differentiation of\n // field identities.\n keyArgs === false ? simpleKeyArgsFn :\n // Pass an array of strings to use named arguments to\n // compute a composite identity for the field.\n Array.isArray(keyArgs) ? keyArgsFnFromSpecifier(keyArgs) :\n // Pass a function to take full control over field identity.\n typeof keyArgs === \"function\" ? keyArgs :\n // Leave existing.keyFn unchanged if above cases fail.\n existing.keyFn;\n\n if (typeof read === \"function\") {\n existing.read = read;\n }\n\n setMerge(existing, merge);\n }\n\n if (existing.read && existing.merge) {\n // If we have both a read and a merge function, assume\n // keyArgs:false, because read and merge together can take\n // responsibility for interpreting arguments in and out. This\n // default assumption can always be overridden by specifying\n // keyArgs explicitly in the FieldPolicy.\n existing.keyFn = existing.keyFn || simpleKeyArgsFn;\n }\n });\n }\n }\n\n private setRootTypename(\n which: \"Query\" | \"Mutation\" | \"Subscription\",\n typename: string = which,\n ) {\n const rootId = \"ROOT_\" + which.toUpperCase();\n const old = this.rootTypenamesById[rootId];\n if (typename !== old) {\n invariant(!old || old === which, `Cannot change root ${which} __typename more than once`);\n // First, delete any old __typename associated with this rootId from\n // rootIdsByTypename.\n if (old) delete this.rootIdsByTypename[old];\n // Now make this the only __typename that maps to this rootId.\n this.rootIdsByTypename[typename] = rootId;\n // Finally, update the __typename associated with this rootId.\n this.rootTypenamesById[rootId] = typename;\n }\n }\n\n public addPossibleTypes(possibleTypes: PossibleTypesMap) {\n (this.usingPossibleTypes as boolean) = true;\n Object.keys(possibleTypes).forEach(supertype => {\n // Make sure all types have an entry in this.supertypeMap, even if\n // their supertype set is empty, so we can return false immediately\n // from policies.fragmentMatches for unknown supertypes.\n this.getSupertypeSet(supertype, true);\n\n possibleTypes[supertype].forEach(subtype => {\n this.getSupertypeSet(subtype, true)!.add(supertype);\n const match = subtype.match(TypeOrFieldNameRegExp);\n if (!match || match[0] !== subtype) {\n // TODO Don't interpret just any invalid typename as a RegExp.\n this.fuzzySubtypes.set(subtype, new RegExp(subtype));\n }\n });\n });\n }\n\n private getTypePolicy(typename: string): Policies[\"typePolicies\"][string] {\n if (!hasOwn.call(this.typePolicies, typename)) {\n const policy: Policies[\"typePolicies\"][string] =\n this.typePolicies[typename] = Object.create(null);\n policy.fields = Object.create(null);\n\n // When the TypePolicy for typename is first accessed, instead of\n // starting with an empty policy object, inherit any properties or\n // fields from the type policies of the supertypes of typename.\n //\n // Any properties or fields defined explicitly within the TypePolicy\n // for typename will take precedence, and if there are multiple\n // supertypes, the properties of policies whose types were added\n // later via addPossibleTypes will take precedence over those of\n // earlier supertypes. TODO Perhaps we should warn about these\n // conflicts in development, and recommend defining the property\n // explicitly in the subtype policy?\n //\n // Field policy inheritance is atomic/shallow: you can't inherit a\n // field policy and then override just its read function, since read\n // and merge functions often need to cooperate, so changing only one\n // of them would be a recipe for inconsistency.\n //\n // Once the TypePolicy for typename has been accessed, its\n // properties can still be updated directly using addTypePolicies,\n // but future changes to supertype policies will not be reflected in\n // this policy, because this code runs at most once per typename.\n const supertypes = this.supertypeMap.get(typename);\n if (supertypes && supertypes.size) {\n supertypes.forEach(supertype => {\n const { fields, ...rest } = this.getTypePolicy(supertype);\n Object.assign(policy, rest);\n Object.assign(policy.fields, fields);\n });\n }\n }\n\n const inbox = this.toBeAdded[typename];\n if (inbox && inbox.length) {\n // Merge the pending policies into this.typePolicies, in the order they\n // were originally passed to addTypePolicy.\n inbox.splice(0).forEach(policy => {\n this.updateTypePolicy(typename, policy);\n });\n }\n\n return this.typePolicies[typename];\n }\n\n private getFieldPolicy(\n typename: string | undefined,\n fieldName: string,\n createIfMissing: boolean,\n ): {\n keyFn?: KeyArgsFunction;\n read?: FieldReadFunction<any>;\n merge?: FieldMergeFunction<any>;\n } | undefined {\n if (typename) {\n const fieldPolicies = this.getTypePolicy(typename).fields;\n return fieldPolicies[fieldName] || (\n createIfMissing && (fieldPolicies[fieldName] = Object.create(null)));\n }\n }\n\n private getSupertypeSet(\n subtype: string,\n createIfMissing: boolean,\n ): Set<string> | undefined {\n let supertypeSet = this.supertypeMap.get(subtype);\n if (!supertypeSet && createIfMissing) {\n this.supertypeMap.set(subtype, supertypeSet = new Set<string>());\n }\n return supertypeSet;\n }\n\n public fragmentMatches(\n fragment: InlineFragmentNode | FragmentDefinitionNode,\n typename: string | undefined,\n result?: Record<string, any>,\n variables?: Record<string, any>,\n ): boolean {\n if (!fragment.typeCondition) return true;\n\n // If the fragment has a type condition but the object we're matching\n // against does not have a __typename, the fragment cannot match.\n if (!typename) return false;\n\n const supertype = fragment.typeCondition.name.value;\n // Common case: fragment type condition and __typename are the same.\n if (typename === supertype) return true;\n\n if (this.usingPossibleTypes &&\n this.supertypeMap.has(supertype)) {\n const typenameSupertypeSet = this.getSupertypeSet(typename, true)!;\n const workQueue = [typenameSupertypeSet];\n const maybeEnqueue = (subtype: string) => {\n const supertypeSet = this.getSupertypeSet(subtype, false);\n if (supertypeSet &&\n supertypeSet.size &&\n workQueue.indexOf(supertypeSet) < 0) {\n workQueue.push(supertypeSet);\n }\n };\n\n // We need to check fuzzy subtypes only if we encountered fuzzy\n // subtype strings in addPossibleTypes, and only while writing to\n // the cache, since that's when selectionSetMatchesResult gives a\n // strong signal of fragment matching. The StoreReader class calls\n // policies.fragmentMatches without passing a result object, so\n // needToCheckFuzzySubtypes is always false while reading.\n let needToCheckFuzzySubtypes = !!(result && this.fuzzySubtypes.size);\n let checkingFuzzySubtypes = false;\n\n // It's important to keep evaluating workQueue.length each time through\n // the loop, because the queue can grow while we're iterating over it.\n for (let i = 0; i < workQueue.length; ++i) {\n const supertypeSet = workQueue[i];\n\n if (supertypeSet.has(supertype)) {\n if (!typenameSupertypeSet.has(supertype)) {\n if (checkingFuzzySubtypes) {\n invariant.warn(`Inferring subtype ${typename} of supertype ${supertype}`);\n }\n // Record positive results for faster future lookup.\n // Unfortunately, we cannot safely cache negative results,\n // because new possibleTypes data could always be added to the\n // Policies class.\n typenameSupertypeSet.add(supertype);\n }\n return true;\n }\n\n supertypeSet.forEach(maybeEnqueue);\n\n if (needToCheckFuzzySubtypes &&\n // Start checking fuzzy subtypes only after exhausting all\n // non-fuzzy subtypes (after the final iteration of the loop).\n i === workQueue.length - 1 &&\n // We could wait to compare fragment.selectionSet to result\n // after we verify the supertype, but this check is often less\n // expensive than that search, and we will have to do the\n // comparison anyway whenever we find a potential match.\n selectionSetMatchesResult(fragment.selectionSet, result!, variables)) {\n // We don't always need to check fuzzy subtypes (if no result\n // was provided, or !this.fuzzySubtypes.size), but, when we do,\n // we only want to check them once.\n needToCheckFuzzySubtypes = false;\n checkingFuzzySubtypes = true;\n\n // If we find any fuzzy subtypes that match typename, extend the\n // workQueue to search through the supertypes of those fuzzy\n // subtypes. Otherwise the for-loop will terminate and we'll\n // return false below.\n this.fuzzySubtypes.forEach((regExp, fuzzyString) => {\n const match = typename.match(regExp);\n if (match && match[0] === typename) {\n maybeEnqueue(fuzzyString);\n }\n });\n }\n }\n }\n\n return false;\n }\n\n public hasKeyArgs(typename: string | undefined, fieldName: string) {\n const policy = this.getFieldPolicy(typename, fieldName, false);\n return !!(policy && policy.keyFn);\n }\n\n public getStoreFieldName(fieldSpec: FieldSpecifier): string {\n const { typename, fieldName } = fieldSpec;\n const policy = this.getFieldPolicy(typename, fieldName, false);\n let storeFieldName: KeyArgsResult;\n\n let keyFn = policy && policy.keyFn;\n if (keyFn && typename) {\n const context: Parameters<KeyArgsFunction>[1] = {\n typename,\n fieldName,\n field: fieldSpec.field || null,\n variables: fieldSpec.variables,\n };\n const args = argsFromFieldSpecifier(fieldSpec);\n while (keyFn) {\n const specifierOrString = keyFn(args, context);\n if (Array.isArray(specifierOrString)) {\n keyFn = keyArgsFnFromSpecifier(specifierOrString);\n } else {\n // If the custom keyFn returns a falsy value, fall back to\n // fieldName instead.\n storeFieldName = specifierOrString || fieldName;\n break;\n }\n }\n }\n\n if (storeFieldName === void 0) {\n storeFieldName = fieldSpec.field\n ? storeKeyNameFromField(fieldSpec.field, fieldSpec.variables)\n : getStoreKeyName(fieldName, argsFromFieldSpecifier(fieldSpec));\n }\n\n // Returning false from a keyArgs function is like configuring\n // keyArgs: false, but more dynamic.\n if (storeFieldName === false) {\n return fieldName;\n }\n\n // Make sure custom field names start with the actual field.name.value\n // of the field, so we can always figure out which properties of a\n // StoreObject correspond to which original field names.\n return fieldName === fieldNameFromStoreName(storeFieldName)\n ? storeFieldName\n : fieldName + \":\" + storeFieldName;\n }\n\n public readField<V = StoreValue>(\n options: ReadFieldOptions,\n context: ReadMergeModifyContext,\n ): SafeReadonly<V> | undefined {\n const objectOrReference = options.from;\n if (!objectOrReference) return;\n\n const nameOrField = options.field || options.fieldName;\n if (!nameOrField) return;\n\n if (options.typename === void 0) {\n const typename = context.store.getFieldValue<string>(objectOrReference, \"__typename\");\n if (typename) options.typename = typename;\n }\n\n const storeFieldName = this.getStoreFieldName(options);\n const fieldName = fieldNameFromStoreName(storeFieldName);\n const existing = context.store.getFieldValue<V>(objectOrReference, storeFieldName);\n const policy = this.getFieldPolicy(options.typename, fieldName, false);\n const read = policy && policy.read;\n\n if (read) {\n const readOptions = makeFieldFunctionOptions(\n this,\n objectOrReference,\n options,\n context,\n context.store.getStorage(\n isReference(objectOrReference)\n ? objectOrReference.__ref\n : objectOrReference,\n storeFieldName,\n ),\n );\n\n // Call read(existing, readOptions) with cacheSlot holding this.cache.\n return cacheSlot.withValue(\n this.cache,\n read,\n [existing, readOptions],\n ) as SafeReadonly<V>;\n }\n\n return existing;\n }\n\n public getMergeFunction(\n parentTypename: string | undefined,\n fieldName: string,\n childTypename: string | undefined,\n ): FieldMergeFunction | undefined {\n let policy:\n | Policies[\"typePolicies\"][string]\n | Policies[\"typePolicies\"][string][\"fields\"][string]\n | undefined =\n this.getFieldPolicy(parentTypename, fieldName, false);\n let merge = policy && policy.merge;\n if (!merge && childTypename) {\n policy = this.getTypePolicy(childTypename);\n merge = policy && policy.merge;\n }\n return merge;\n }\n\n public runMergeFunction(\n existing: StoreValue,\n incoming: StoreValue,\n { field, typename, merge }: MergeInfo,\n context: ReadMergeModifyContext,\n storage?: StorageType,\n ) {\n if (merge === mergeTrueFn) {\n // Instead of going to the trouble of creating a full\n // FieldFunctionOptions object and calling mergeTrueFn, we can\n // simply call mergeObjects, as mergeTrueFn would.\n return makeMergeObjectsFunction(\n context.store.getFieldValue\n )(existing as StoreObject,\n incoming as StoreObject);\n }\n\n if (merge === mergeFalseFn) {\n // Likewise for mergeFalseFn, whose implementation is even simpler.\n return incoming;\n }\n\n return merge(existing, incoming, makeFieldFunctionOptions(\n this,\n // Unlike options.readField for read functions, we do not fall\n // back to the current object if no foreignObjOrRef is provided,\n // because it's not clear what the current object should be for\n // merge functions: the (possibly undefined) existing object, or\n // the incoming object? If you think your merge function needs\n // to read sibling fields in order to produce a new value for\n // the current field, you might want to rethink your strategy,\n // because that's a recipe for making merge behavior sensitive\n // to the order in which fields are written into the cache.\n // However, readField(name, ref) is useful for merge functions\n // that need to deduplicate child objects and references.\n void 0,\n { typename,\n fieldName: field.name.value,\n field,\n variables: context.variables },\n context,\n storage || Object.create(null),\n ));\n }\n}\n\nfunction makeFieldFunctionOptions(\n policies: Policies,\n objectOrReference: StoreObject | Reference | undefined,\n fieldSpec: FieldSpecifier,\n context: ReadMergeModifyContext,\n storage: StorageType,\n): FieldFunctionOptions {\n const storeFieldName = policies.getStoreFieldName(fieldSpec);\n const fieldName = fieldNameFromStoreName(storeFieldName);\n const variables = fieldSpec.variables || context.variables;\n const { getFieldValue, toReference, canRead } = context.store;\n\n return {\n args: argsFromFieldSpecifier(fieldSpec),\n field: fieldSpec.field || null,\n fieldName,\n storeFieldName,\n variables,\n isReference,\n toReference,\n storage,\n cache: policies.cache,\n canRead,\n\n readField<T>(\n fieldNameOrOptions: string | ReadFieldOptions,\n from?: StoreObject | Reference,\n ) {\n const options: ReadFieldOptions =\n typeof fieldNameOrOptions === \"string\" ? {\n fieldName: fieldNameOrOptions,\n from,\n } : { ...fieldNameOrOptions };\n\n if (void 0 === options.from) {\n options.from = objectOrReference;\n }\n\n if (void 0 === options.variables) {\n options.variables = variables;\n }\n\n return policies.readField<T>(options, context);\n },\n\n mergeObjects: makeMergeObjectsFunction(getFieldValue),\n };\n}\n\nfunction makeMergeObjectsFunction(\n getFieldValue: FieldValueGetter,\n): MergeObjectsFunction {\n return function mergeObjects(existing, incoming) {\n if (Array.isArray(existing) || Array.isArray(incoming)) {\n throw new InvariantError(\"Cannot automatically merge arrays\");\n }\n\n // These dynamic checks are necessary because the parameters of a\n // custom merge function can easily have the any type, so the type\n // system cannot always enforce the StoreObject | Reference parameter\n // types of options.mergeObjects.\n if (existing && typeof existing === \"object\" &&\n incoming && typeof incoming === \"object\") {\n const eType = getFieldValue(existing, \"__typename\");\n const iType = getFieldValue(incoming, \"__typename\");\n const typesDiffer = eType && iType && eType !== iType;\n\n if (typesDiffer ||\n !storeValueIsStoreObject(existing) ||\n !storeValueIsStoreObject(incoming)) {\n return incoming;\n }\n\n return { ...existing, ...incoming };\n }\n\n return incoming;\n };\n}\n\nfunction keyArgsFnFromSpecifier(\n specifier: KeySpecifier,\n): KeyArgsFunction {\n return (args, context) => {\n return args ? `${context.fieldName}:${\n JSON.stringify(computeKeyObject(args, specifier, false))\n }` : context.fieldName;\n };\n}\n\nfunction keyFieldsFnFromSpecifier(\n specifier: KeySpecifier,\n): KeyFieldsFunction {\n const trie = new KeyTrie<{\n aliasMap?: AliasMap;\n }>(canUseWeakMap);\n\n return (object, context) => {\n let aliasMap: AliasMap | undefined;\n if (context.selectionSet && context.fragmentMap) {\n const info = trie.lookupArray([\n context.selectionSet,\n context.fragmentMap,\n ]);\n aliasMap = info.aliasMap || (\n info.aliasMap = makeAliasMap(context.selectionSet, context.fragmentMap)\n );\n }\n\n const keyObject = context.keyObject =\n computeKeyObject(object, specifier, true, aliasMap);\n\n return `${context.typename}:${JSON.stringify(keyObject)}`;\n };\n}\n\ntype AliasMap = {\n // Map from store key to corresponding response key. Undefined when there are\n // no aliased fields in this selection set.\n aliases?: Record<string, string>;\n // Map from store key to AliasMap correponding to a child selection set.\n // Undefined when there are no child selection sets.\n subsets?: Record<string, AliasMap>;\n};\n\nfunction makeAliasMap(\n selectionSet: SelectionSetNode,\n fragmentMap: FragmentMap,\n): AliasMap {\n let map: AliasMap = Object.create(null);\n // TODO Cache this work, perhaps by storing selectionSet._aliasMap?\n const workQueue = new Set([selectionSet]);\n workQueue.forEach(selectionSet => {\n selectionSet.selections.forEach(selection => {\n if (isField(selection)) {\n if (selection.alias) {\n const responseKey = selection.alias.value;\n const storeKey = selection.name.value;\n if (storeKey !== responseKey) {\n const aliases = map.aliases || (map.aliases = Object.create(null));\n aliases[storeKey] = responseKey;\n }\n }\n if (selection.selectionSet) {\n const subsets = map.subsets || (map.subsets = Object.create(null));\n subsets[selection.name.value] =\n makeAliasMap(selection.selectionSet, fragmentMap);\n }\n } else {\n const fragment = getFragmentFromSelection(selection, fragmentMap);\n if (fragment) {\n workQueue.add(fragment.selectionSet);\n }\n }\n });\n });\n return map;\n}\n\nfunction computeKeyObject(\n response: Record<string, any>,\n specifier: KeySpecifier,\n strict: boolean,\n aliasMap?: AliasMap,\n): Record<string, any> {\n // The order of adding properties to keyObj affects its JSON serialization,\n // so we are careful to build keyObj in the order of keys given in\n // specifier.\n const keyObj = Object.create(null);\n let prevKey: string | undefined;\n specifier.forEach(s => {\n if (Array.isArray(s)) {\n if (typeof prevKey === \"string\") {\n const subsets = aliasMap && aliasMap.subsets;\n const subset = subsets && subsets[prevKey];\n keyObj[prevKey] = computeKeyObject(response[prevKey], s, strict, subset);\n }\n } else {\n const aliases = aliasMap && aliasMap.aliases;\n const responseName = aliases && aliases[s] || s;\n if (hasOwn.call(response, responseName)) {\n keyObj[prevKey = s] = response[responseName];\n } else {\n invariant(!strict, `Missing field '${responseName}' while computing key fields`);\n prevKey = void 0;\n }\n }\n });\n return keyObj;\n}\n", "// Make builtins like Map and Set safe to use with non-extensible objects.\nimport './fixPolyfills';\n\nimport { DocumentNode } from 'graphql';\nimport { dep, wrap } from 'optimism';\n\nimport { ApolloCache } from '../core/cache';\nimport { Cache } from '../core/types/Cache';\nimport { MissingFieldError } from '../core/types/common';\nimport {\n addTypenameToDocument,\n StoreObject,\n Reference,\n isReference,\n} from '../../utilities';\nimport {\n ApolloReducerConfig,\n NormalizedCacheObject,\n} from './types';\nimport { StoreReader } from './readFromStore';\nimport { StoreWriter } from './writeToStore';\nimport { EntityStore, supportsResultCaching } from './entityStore';\nimport { makeVar, forgetCache, recallCache } from './reactiveVars';\nimport {\n defaultDataIdFromObject,\n PossibleTypesMap,\n Policies,\n TypePolicies,\n} from './policies';\nimport { hasOwn } from './helpers';\n\nexport interface InMemoryCacheConfig extends ApolloReducerConfig {\n resultCaching?: boolean;\n possibleTypes?: PossibleTypesMap;\n typePolicies?: TypePolicies;\n}\n\nconst defaultConfig: InMemoryCacheConfig = {\n dataIdFromObject: defaultDataIdFromObject,\n addTypename: true,\n resultCaching: true,\n typePolicies: {},\n};\n\nexport class InMemoryCache extends ApolloCache<NormalizedCacheObject> {\n private data: EntityStore;\n private optimisticData: EntityStore;\n\n protected config: InMemoryCacheConfig;\n private watches = new Set<Cache.WatchOptions>();\n private addTypename: boolean;\n\n private typenameDocumentCache = new Map<DocumentNode, DocumentNode>();\n private storeReader: StoreReader;\n private storeWriter: StoreWriter;\n\n // Dynamically imported code can augment existing typePolicies or\n // possibleTypes by calling cache.policies.addTypePolicies or\n // cache.policies.addPossibletypes.\n public readonly policies: Policies;\n\n public readonly makeVar = makeVar;\n\n constructor(config: InMemoryCacheConfig = {}) {\n super();\n this.config = { ...defaultConfig, ...config };\n this.addTypename = !!this.config.addTypename;\n\n this.policies = new Policies({\n cache: this,\n dataIdFromObject: this.config.dataIdFromObject,\n possibleTypes: this.config.possibleTypes,\n typePolicies: this.config.typePolicies,\n });\n\n // Passing { resultCaching: false } in the InMemoryCache constructor options\n // will completely disable dependency tracking, which will improve memory\n // usage but worsen the performance of repeated reads.\n this.data = new EntityStore.Root({\n policies: this.policies,\n resultCaching: this.config.resultCaching,\n });\n\n // When no optimistic writes are currently active, cache.optimisticData ===\n // cache.data, so there are no additional layers on top of the actual data.\n // When an optimistic update happens, this.optimisticData will become a\n // linked list of OptimisticCacheLayer objects that terminates with the\n // original this.data cache object.\n this.optimisticData = this.data;\n\n this.storeWriter = new StoreWriter(\n this,\n this.storeReader = new StoreReader({\n cache: this,\n addTypename: this.addTypename,\n }),\n );\n }\n\n public restore(data: NormalizedCacheObject): this {\n if (data) this.data.replace(data);\n return this;\n }\n\n public extract(optimistic: boolean = false): NormalizedCacheObject {\n return (optimistic ? this.optimisticData : this.data).extract();\n }\n\n public read<T>(options: Cache.ReadOptions): T | null {\n const {\n // Since read returns data or null, without any additional metadata\n // about whether/where there might have been missing fields, the\n // default behavior cannot be returnPartialData = true (like it is\n // for the diff method), since defaulting to true would violate the\n // integrity of the T in the return type. However, partial data may\n // be useful in some cases, so returnPartialData:true may be\n // specified explicitly.\n returnPartialData = false,\n } = options;\n try {\n return this.storeReader.diffQueryAgainstStore<T>({\n store: options.optimistic ? this.optimisticData : this.data,\n query: options.query,\n variables: options.variables,\n rootId: options.rootId,\n config: this.config,\n returnPartialData,\n }).result || null;\n } catch (e) {\n if (e instanceof MissingFieldError) {\n // Swallow MissingFieldError and return null, so callers do not\n // need to worry about catching \"normal\" exceptions resulting from\n // incomplete cache data. Unexpected errors will be re-thrown. If\n // you need more information about which fields were missing, use\n // cache.diff instead, and examine diffResult.missing.\n return null;\n }\n throw e;\n }\n }\n\n public write(options: Cache.WriteOptions): Reference | undefined {\n try {\n ++this.txCount;\n return this.storeWriter.writeToStore({\n store: this.data,\n query: options.query,\n result: options.result,\n dataId: options.dataId,\n variables: options.variables,\n });\n } finally {\n if (!--this.txCount && options.broadcast !== false) {\n this.broadcastWatches();\n }\n }\n }\n\n public modify(options: Cache.ModifyOptions): boolean {\n if (hasOwn.call(options, \"id\") && !options.id) {\n // To my knowledge, TypeScript does not currently provide a way to\n // enforce that an optional property?:type must *not* be undefined\n // when present. That ability would be useful here, because we want\n // options.id to default to ROOT_QUERY only when no options.id was\n // provided. If the caller attempts to pass options.id with a\n // falsy/undefined value (perhaps because cache.identify failed), we\n // should not assume the goal was to modify the ROOT_QUERY object.\n // We could throw, but it seems natural to return false to indicate\n // that nothing was modified.\n return false;\n }\n const store = options.optimistic // Defaults to false.\n ? this.optimisticData\n : this.data;\n try {\n ++this.txCount;\n return store.modify(options.id || \"ROOT_QUERY\", options.fields);\n } finally {\n if (!--this.txCount && options.broadcast !== false) {\n this.broadcastWatches();\n }\n }\n }\n\n public diff<T>(options: Cache.DiffOptions): Cache.DiffResult<T> {\n return this.storeReader.diffQueryAgainstStore({\n store: options.optimistic ? this.optimisticData : this.data,\n rootId: options.id || \"ROOT_QUERY\",\n query: options.query,\n variables: options.variables,\n returnPartialData: options.returnPartialData,\n config: this.config,\n });\n }\n\n public watch(watch: Cache.WatchOptions): () => void {\n if (!this.watches.size) {\n // In case we previously called forgetCache(this) because\n // this.watches became empty (see below), reattach this cache to any\n // reactive variables on which it previously depended. It might seem\n // paradoxical that we're able to recall something we supposedly\n // forgot, but the point of calling forgetCache(this) is to silence\n // useless broadcasts while this.watches is empty, and to allow the\n // cache to be garbage collected. If, however, we manage to call\n // recallCache(this) here, this cache object must not have been\n // garbage collected yet, and should resume receiving updates from\n // reactive variables, now that it has a watcher to notify.\n recallCache(this);\n }\n this.watches.add(watch);\n if (watch.immediate) {\n this.maybeBroadcastWatch(watch);\n }\n return () => {\n // Once we remove the last watch from this.watches, cache.broadcastWatches\n // no longer does anything, so we preemptively tell the reactive variable\n // system to exclude this cache from future broadcasts.\n if (this.watches.delete(watch) && !this.watches.size) {\n forgetCache(this);\n }\n this.watchDep.dirty(watch);\n // Remove this watch from the LRU cache managed by the\n // maybeBroadcastWatch OptimisticWrapperFunction, to prevent memory\n // leaks involving the closure of watch.callback.\n this.maybeBroadcastWatch.forget(watch);\n };\n }\n\n // Request garbage collection of unreachable normalized entities.\n public gc() {\n return this.optimisticData.gc();\n }\n\n // Call this method to ensure the given root ID remains in the cache after\n // garbage collection, along with its transitive child entities. Note that\n // the cache automatically retains all directly written entities. By default,\n // the retainment persists after optimistic updates are removed. Pass true\n // for the optimistic argument if you would prefer for the retainment to be\n // discarded when the top-most optimistic layer is removed. Returns the\n // resulting (non-negative) retainment count.\n public retain(rootId: string, optimistic?: boolean): number {\n return (optimistic ? this.optimisticData : this.data).retain(rootId);\n }\n\n // Call this method to undo the effect of the retain method, above. Once the\n // retainment count falls to zero, the given ID will no longer be preserved\n // during garbage collection, though it may still be preserved by other safe\n // entities that refer to it. Returns the resulting (non-negative) retainment\n // count, in case that's useful.\n public release(rootId: string, optimistic?: boolean): number {\n return (optimistic ? this.optimisticData : this.data).release(rootId);\n }\n\n // Returns the canonical ID for a given StoreObject, obeying typePolicies\n // and keyFields (and dataIdFromObject, if you still use that). At minimum,\n // the object must contain a __typename and any primary key fields required\n // to identify entities of that type. If you pass a query result object, be\n // sure that none of the primary key fields have been renamed by aliasing.\n // If you pass a Reference object, its __ref ID string will be returned.\n public identify(object: StoreObject | Reference): string | undefined {\n return isReference(object) ? object.__ref :\n this.policies.identify(object)[0];\n }\n\n public evict(options: Cache.EvictOptions): boolean {\n if (!options.id) {\n if (hasOwn.call(options, \"id\")) {\n // See comment in modify method about why we return false when\n // options.id exists but is falsy/undefined.\n return false;\n }\n options = { ...options, id: \"ROOT_QUERY\" };\n }\n try {\n // It's unlikely that the eviction will end up invoking any other\n // cache update operations while it's running, but {in,de}crementing\n // this.txCount still seems like a good idea, for uniformity with\n // the other update methods.\n ++this.txCount;\n return this.optimisticData.evict(options);\n } finally {\n if (!--this.txCount && options.broadcast !== false) {\n this.broadcastWatches();\n }\n }\n }\n\n public reset(): Promise<void> {\n this.data.clear();\n this.optimisticData = this.data;\n this.broadcastWatches();\n return Promise.resolve();\n }\n\n public removeOptimistic(idToRemove: string) {\n const newOptimisticData = this.optimisticData.removeLayer(idToRemove);\n if (newOptimisticData !== this.optimisticData) {\n this.optimisticData = newOptimisticData;\n this.broadcastWatches();\n }\n }\n\n private txCount = 0;\n\n public performTransaction(\n transaction: (cache: InMemoryCache) => any,\n optimisticId?: string | null,\n ) {\n const perform = (layer?: EntityStore) => {\n const { data, optimisticData } = this;\n ++this.txCount;\n if (layer) {\n this.data = this.optimisticData = layer;\n }\n try {\n transaction(this);\n } finally {\n --this.txCount;\n this.data = data;\n this.optimisticData = optimisticData;\n }\n };\n\n let fromOptimisticTransaction = false;\n\n if (typeof optimisticId === 'string') {\n // Note that there can be multiple layers with the same optimisticId.\n // When removeOptimistic(id) is called for that id, all matching layers\n // will be removed, and the remaining layers will be reapplied.\n this.optimisticData = this.optimisticData.addLayer(optimisticId, perform);\n fromOptimisticTransaction = true;\n } else if (optimisticId === null) {\n // Ensure both this.data and this.optimisticData refer to the root\n // (non-optimistic) layer of the cache during the transaction. Note\n // that this.data could be a Layer if we are currently executing an\n // optimistic transaction function, but otherwise will always be an\n // EntityStore.Root instance.\n perform(this.data);\n } else {\n // Otherwise, leave this.data and this.optimisticData unchanged and\n // run the transaction with broadcast batching.\n perform();\n }\n\n // This broadcast does nothing if this.txCount > 0.\n this.broadcastWatches(fromOptimisticTransaction);\n }\n\n public transformDocument(document: DocumentNode): DocumentNode {\n if (this.addTypename) {\n let result = this.typenameDocumentCache.get(document);\n if (!result) {\n result = addTypenameToDocument(document);\n this.typenameDocumentCache.set(document, result);\n // If someone calls transformDocument and then mistakenly passes the\n // result back into an API that also calls transformDocument, make sure\n // we don't keep creating new query documents.\n this.typenameDocumentCache.set(result, result);\n }\n return result;\n }\n return document;\n }\n\n protected broadcastWatches(fromOptimisticTransaction?: boolean) {\n if (!this.txCount) {\n this.watches.forEach(c => this.maybeBroadcastWatch(c, fromOptimisticTransaction));\n }\n }\n\n private maybeBroadcastWatch = wrap((\n c: Cache.WatchOptions,\n fromOptimisticTransaction?: boolean,\n ) => {\n return this.broadcastWatch.call(this, c, !!fromOptimisticTransaction);\n }, {\n makeCacheKey: (c: Cache.WatchOptions) => {\n // Return a cache key (thus enabling result caching) only if we're\n // currently using a data store that can track cache dependencies.\n const store = c.optimistic ? this.optimisticData : this.data;\n if (supportsResultCaching(store)) {\n const { optimistic, rootId, variables } = c;\n return store.makeCacheKey(\n c.query,\n // Different watches can have the same query, optimistic\n // status, rootId, and variables, but if their callbacks are\n // different, the (identical) result needs to be delivered to\n // each distinct callback. The easiest way to achieve that\n // separation is to include c.callback in the cache key for\n // maybeBroadcastWatch calls. See issue #5733.\n c.callback,\n JSON.stringify({ optimistic, rootId, variables }),\n );\n }\n }\n });\n\n private watchDep = dep<Cache.WatchOptions>();\n\n // This method is wrapped by maybeBroadcastWatch, which is called by\n // broadcastWatches, so that we compute and broadcast results only when\n // the data that would be broadcast might have changed. It would be\n // simpler to check for changes after recomputing a result but before\n // broadcasting it, but this wrapping approach allows us to skip both\n // the recomputation and the broadcast, in most cases.\n private broadcastWatch(\n c: Cache.WatchOptions,\n fromOptimisticTransaction: boolean,\n ) {\n // First, invalidate any other maybeBroadcastWatch wrapper functions\n // currently depending on this Cache.WatchOptions object (including\n // the one currently calling broadcastWatch), so they will be included\n // in the next broadcast, even if the result they receive is the same\n // as the previous result they received. This is important because we\n // are about to deliver a different result to c.callback, so any\n // previous results should have a chance to be redelivered.\n this.watchDep.dirty(c);\n\n // Next, re-depend on this.watchDep for just this invocation of\n // maybeBroadcastWatch (this is a no-op if broadcastWatch was not\n // called by maybeBroadcastWatch). This allows only the most recent\n // maybeBroadcastWatch invocation for this watcher to remain cached,\n // enabling re-broadcast of previous results even if they have not\n // changed since they were previously delivered.\n this.watchDep(c);\n\n const diff = this.diff<any>({\n query: c.query,\n variables: c.variables,\n optimistic: c.optimistic,\n });\n\n if (c.optimistic && fromOptimisticTransaction) {\n diff.fromOptimisticTransaction = true;\n }\n\n c.callback(diff);\n }\n}\n", "import {\n DocumentNode,\n OperationDefinitionNode,\n SelectionSetNode,\n SelectionNode,\n InlineFragmentNode,\n FragmentDefinitionNode,\n FieldNode,\n ASTNode,\n visit,\n BREAK,\n} from 'graphql';\nimport { invariant } from 'ts-invariant';\n\nimport { ApolloCache } from '../cache';\nimport {\n FragmentMap,\n StoreObject,\n argumentsObjectFromField,\n buildQueryFromSelectionSet,\n createFragmentMap,\n getFragmentDefinitions,\n getMainDefinition,\n hasDirectives,\n isField,\n isInlineFragment,\n mergeDeep,\n mergeDeepArray,\n removeClientSetsFromDocument,\n resultKeyNameFromField,\n shouldInclude,\n} from '../utilities';\nimport { ApolloClient } from './ApolloClient';\nimport { Resolvers, OperationVariables } from './types';\nimport { FetchResult } from '../link/core';\nimport { cacheSlot } from '../cache';\n\nexport type Resolver = (\n rootValue?: any,\n args?: any,\n context?: any,\n info?: {\n field: FieldNode;\n fragmentMap: FragmentMap;\n },\n) => any;\n\nexport type VariableMap = { [name: string]: any };\n\nexport type FragmentMatcher = (\n rootValue: any,\n typeCondition: string,\n context: any,\n) => boolean;\n\nexport type ExecContext = {\n fragmentMap: FragmentMap;\n context: any;\n variables: VariableMap;\n fragmentMatcher: FragmentMatcher;\n defaultOperationType: string;\n exportedVariables: Record<string, any>;\n onlyRunForcedResolvers: boolean;\n};\n\nexport type LocalStateOptions<TCacheShape> = {\n cache: ApolloCache<TCacheShape>;\n client?: ApolloClient<TCacheShape>;\n resolvers?: Resolvers | Resolvers[];\n fragmentMatcher?: FragmentMatcher;\n};\n\nexport class LocalState<TCacheShape> {\n private cache: ApolloCache<TCacheShape>;\n private client: ApolloClient<TCacheShape>;\n private resolvers?: Resolvers;\n private fragmentMatcher: FragmentMatcher;\n\n constructor({\n cache,\n client,\n resolvers,\n fragmentMatcher,\n }: LocalStateOptions<TCacheShape>) {\n this.cache = cache;\n\n if (client) {\n this.client = client;\n }\n\n if (resolvers) {\n this.addResolvers(resolvers);\n }\n\n if (fragmentMatcher) {\n this.setFragmentMatcher(fragmentMatcher);\n }\n }\n\n public addResolvers(resolvers: Resolvers | Resolvers[]) {\n this.resolvers = this.resolvers || {};\n if (Array.isArray(resolvers)) {\n resolvers.forEach(resolverGroup => {\n this.resolvers = mergeDeep(this.resolvers, resolverGroup);\n });\n } else {\n this.resolvers = mergeDeep(this.resolvers, resolvers);\n }\n }\n\n public setResolvers(resolvers: Resolvers | Resolvers[]) {\n this.resolvers = {};\n this.addResolvers(resolvers);\n }\n\n public getResolvers() {\n return this.resolvers || {};\n }\n\n // Run local client resolvers against the incoming query and remote data.\n // Locally resolved field values are merged with the incoming remote data,\n // and returned. Note that locally resolved fields will overwrite\n // remote data using the same field name.\n public async runResolvers<TData>({\n document,\n remoteResult,\n context,\n variables,\n onlyRunForcedResolvers = false,\n }: {\n document: DocumentNode | null;\n remoteResult: FetchResult<TData>;\n context?: Record<string, any>;\n variables?: Record<string, any>;\n onlyRunForcedResolvers?: boolean;\n }): Promise<FetchResult<TData>> {\n if (document) {\n return this.resolveDocument(\n document,\n remoteResult.data,\n context,\n variables,\n this.fragmentMatcher,\n onlyRunForcedResolvers,\n ).then(localResult => ({\n ...remoteResult,\n data: localResult.result,\n }));\n }\n\n return remoteResult;\n }\n\n public setFragmentMatcher(fragmentMatcher: FragmentMatcher) {\n this.fragmentMatcher = fragmentMatcher;\n }\n\n public getFragmentMatcher(): FragmentMatcher {\n return this.fragmentMatcher;\n }\n\n // Client queries contain everything in the incoming document (if a @client\n // directive is found).\n public clientQuery(document: DocumentNode) {\n if (hasDirectives(['client'], document)) {\n if (this.resolvers) {\n return document;\n }\n }\n return null;\n }\n\n // Server queries are stripped of all @client based selection sets.\n public serverQuery(document: DocumentNode) {\n return removeClientSetsFromDocument(document);\n }\n\n public prepareContext(context?: Record<string, any>) {\n const { cache } = this;\n return {\n ...context,\n cache,\n // Getting an entry's cache key is useful for local state resolvers.\n getCacheKey(obj: StoreObject) {\n return cache.identify(obj);\n },\n };\n }\n\n // To support `@client @export(as: \"someVar\")` syntax, we'll first resolve\n // @client @export fields locally, then pass the resolved values back to be\n // used alongside the original operation variables.\n public async addExportedVariables(\n document: DocumentNode,\n variables: OperationVariables = {},\n context = {},\n ) {\n if (document) {\n return this.resolveDocument(\n document,\n this.buildRootValueFromCache(document, variables) || {},\n this.prepareContext(context),\n variables,\n ).then(data => ({\n ...variables,\n ...data.exportedVariables,\n }));\n }\n\n return {\n ...variables,\n };\n }\n\n public shouldForceResolvers(document: ASTNode) {\n let forceResolvers = false;\n visit(document, {\n Directive: {\n enter(node) {\n if (node.name.value === 'client' && node.arguments) {\n forceResolvers = node.arguments.some(\n arg =>\n arg.name.value === 'always' &&\n arg.value.kind === 'BooleanValue' &&\n arg.value.value === true,\n );\n if (forceResolvers) {\n return BREAK;\n }\n }\n },\n },\n });\n return forceResolvers;\n }\n\n // Query the cache and return matching data.\n private buildRootValueFromCache(\n document: DocumentNode,\n variables?: Record<string, any>,\n ) {\n return this.cache.diff({\n query: buildQueryFromSelectionSet(document),\n variables,\n returnPartialData: true,\n optimistic: false,\n }).result;\n }\n\n private async resolveDocument<TData>(\n document: DocumentNode,\n rootValue: TData,\n context: any = {},\n variables: VariableMap = {},\n fragmentMatcher: FragmentMatcher = () => true,\n onlyRunForcedResolvers: boolean = false,\n ) {\n const mainDefinition = getMainDefinition(document);\n const fragments = getFragmentDefinitions(document);\n const fragmentMap = createFragmentMap(fragments);\n\n const definitionOperation = (mainDefinition as OperationDefinitionNode)\n .operation;\n\n const defaultOperationType = definitionOperation\n ? definitionOperation.charAt(0).toUpperCase() +\n definitionOperation.slice(1)\n : 'Query';\n\n const { cache, client } = this;\n const execContext: ExecContext = {\n fragmentMap,\n context: {\n ...context,\n cache,\n client,\n },\n variables,\n fragmentMatcher,\n defaultOperationType,\n exportedVariables: {},\n onlyRunForcedResolvers,\n };\n\n return this.resolveSelectionSet(\n mainDefinition.selectionSet,\n rootValue,\n execContext,\n ).then(result => ({\n result,\n exportedVariables: execContext.exportedVariables,\n }));\n }\n\n private async resolveSelectionSet<TData>(\n selectionSet: SelectionSetNode,\n rootValue: TData,\n execContext: ExecContext,\n ) {\n const { fragmentMap, context, variables } = execContext;\n const resultsToMerge: TData[] = [rootValue];\n\n const execute = async (selection: SelectionNode): Promise<void> => {\n if (!shouldInclude(selection, variables)) {\n // Skip this entirely.\n return;\n }\n\n if (isField(selection)) {\n return this.resolveField(selection, rootValue, execContext).then(\n fieldResult => {\n if (typeof fieldResult !== 'undefined') {\n resultsToMerge.push({\n [resultKeyNameFromField(selection)]: fieldResult,\n } as TData);\n }\n },\n );\n }\n\n let fragment: InlineFragmentNode | FragmentDefinitionNode;\n\n if (isInlineFragment(selection)) {\n fragment = selection;\n } else {\n // This is a named fragment.\n fragment = fragmentMap[selection.name.value];\n invariant(fragment, `No fragment named ${selection.name.value}`);\n }\n\n if (fragment && fragment.typeCondition) {\n const typeCondition = fragment.typeCondition.name.value;\n if (execContext.fragmentMatcher(rootValue, typeCondition, context)) {\n return this.resolveSelectionSet(\n fragment.selectionSet,\n rootValue,\n execContext,\n ).then(fragmentResult => {\n resultsToMerge.push(fragmentResult);\n });\n }\n }\n };\n\n return Promise.all(selectionSet.selections.map(execute)).then(function() {\n return mergeDeepArray(resultsToMerge);\n });\n }\n\n private async resolveField(\n field: FieldNode,\n rootValue: any,\n execContext: ExecContext,\n ): Promise<any> {\n const { variables } = execContext;\n const fieldName = field.name.value;\n const aliasedFieldName = resultKeyNameFromField(field);\n const aliasUsed = fieldName !== aliasedFieldName;\n const defaultResult = rootValue[aliasedFieldName] || rootValue[fieldName];\n let resultPromise = Promise.resolve(defaultResult);\n\n // Usually all local resolvers are run when passing through here, but\n // if we've specifically identified that we only want to run forced\n // resolvers (that is, resolvers for fields marked with\n // `@client(always: true)`), then we'll skip running non-forced resolvers.\n if (\n !execContext.onlyRunForcedResolvers ||\n this.shouldForceResolvers(field)\n ) {\n const resolverType =\n rootValue.__typename || execContext.defaultOperationType;\n const resolverMap = this.resolvers && this.resolvers[resolverType];\n if (resolverMap) {\n const resolve = resolverMap[aliasUsed ? fieldName : aliasedFieldName];\n if (resolve) {\n resultPromise = Promise.resolve(\n // In case the resolve function accesses reactive variables,\n // set cacheSlot to the current cache instance.\n cacheSlot.withValue(this.cache, resolve, [\n rootValue,\n argumentsObjectFromField(field, variables),\n execContext.context,\n { field, fragmentMap: execContext.fragmentMap },\n ])\n );\n }\n }\n }\n\n return resultPromise.then((result = defaultResult) => {\n // If an @export directive is associated with the current field, store\n // the `as` export variable name and current result for later use.\n if (field.directives) {\n field.directives.forEach(directive => {\n if (directive.name.value === 'export' && directive.arguments) {\n directive.arguments.forEach(arg => {\n if (arg.name.value === 'as' && arg.value.kind === 'StringValue') {\n execContext.exportedVariables[arg.value.value] = result;\n }\n });\n }\n });\n }\n\n // Handle all scalar types here.\n if (!field.selectionSet) {\n return result;\n }\n\n // From here down, the field has a selection set, which means it's trying\n // to query a GraphQLObjectType.\n if (result == null) {\n // Basically any field in a GraphQL response can be null, or missing\n return result;\n }\n\n if (Array.isArray(result)) {\n return this.resolveSubSelectedArray(field, result, execContext);\n }\n\n // Returned value is an object, and the query has a sub-selection. Recurse.\n if (field.selectionSet) {\n return this.resolveSelectionSet(\n field.selectionSet,\n result,\n execContext,\n );\n }\n });\n }\n\n private resolveSubSelectedArray(\n field: FieldNode,\n result: any[],\n execContext: ExecContext,\n ): any {\n return Promise.all(\n result.map(item => {\n if (item === null) {\n return null;\n }\n\n // This is a nested array, recurse.\n if (Array.isArray(item)) {\n return this.resolveSubSelectedArray(field, item, execContext);\n }\n\n // This is an object, run the selection set on it.\n if (field.selectionSet) {\n return this.resolveSelectionSet(field.selectionSet, item, execContext);\n }\n }),\n );\n }\n}\n", "import { DocumentNode, GraphQLError } from 'graphql';\nimport { equal } from \"@wry/equality\";\n\nimport { Cache, ApolloCache } from '../cache';\nimport { WatchQueryOptions, ErrorPolicy } from './watchQueryOptions';\nimport { ObservableQuery } from './ObservableQuery';\nimport { QueryListener } from './types';\nimport { FetchResult } from '../link/core';\nimport {\n ObservableSubscription,\n isNonEmptyArray,\n graphQLResultHasError,\n canUseWeakMap,\n} from '../utilities';\nimport {\n NetworkStatus,\n isNetworkRequestInFlight,\n} from './networkStatus';\nimport { ApolloError } from '../errors';\n\nexport type QueryStoreValue = Pick<QueryInfo,\n | \"variables\"\n | \"networkStatus\"\n | \"networkError\"\n | \"graphQLErrors\"\n >;\n\nconst destructiveMethodCounts = new (\n canUseWeakMap ? WeakMap : Map\n)<ApolloCache<any>, number>();\n\nfunction wrapDestructiveCacheMethod(\n cache: ApolloCache<any>,\n methodName: keyof ApolloCache<any>,\n) {\n const original = cache[methodName];\n if (typeof original === \"function\") {\n cache[methodName] = function () {\n destructiveMethodCounts.set(\n cache,\n // The %1e15 allows the count to wrap around to 0 safely every\n // quadrillion evictions, so there's no risk of overflow. To be\n // clear, this is more of a pedantic principle than something\n // that matters in any conceivable practical scenario.\n (destructiveMethodCounts.get(cache)! + 1) % 1e15,\n );\n return original.apply(this, arguments);\n };\n }\n}\n\nfunction cancelNotifyTimeout(info: QueryInfo) {\n if (info[\"notifyTimeout\"]) {\n clearTimeout(info[\"notifyTimeout\"]);\n info[\"notifyTimeout\"] = void 0;\n }\n}\n\n// A QueryInfo object represents a single query managed by the\n// QueryManager, which tracks all QueryInfo objects by queryId in its\n// this.queries Map. QueryInfo objects store the latest results and errors\n// for the given query, and are responsible for reporting those results to\n// the corresponding ObservableQuery, via the QueryInfo.notify method.\n// Results are reported asynchronously whenever setDiff marks the\n// QueryInfo object as dirty, though a call to the QueryManager's\n// broadcastQueries method may trigger the notification before it happens\n// automatically. This class used to be a simple interface type without\n// any field privacy or meaningful methods, which is why it still has so\n// many public fields. The effort to lock down and simplify the QueryInfo\n// interface is ongoing, and further improvements are welcome.\nexport class QueryInfo {\n listeners = new Set<QueryListener>();\n document: DocumentNode | null = null;\n lastRequestId = 1;\n subscriptions = new Set<ObservableSubscription>();\n variables?: Record<string, any>;\n networkStatus?: NetworkStatus;\n networkError?: Error | null;\n graphQLErrors?: ReadonlyArray<GraphQLError>;\n stopped = false;\n\n constructor(private cache: ApolloCache<any>) {\n // Track how often cache.evict is called, since we want eviction to\n // override the feud-stopping logic in the markResult method, by\n // causing shouldWrite to return true. Wrapping the cache.evict method\n // is a bit of a hack, but it saves us from having to make eviction\n // counting an official part of the ApolloCache API.\n if (!destructiveMethodCounts.has(cache)) {\n destructiveMethodCounts.set(cache, 0);\n wrapDestructiveCacheMethod(cache, \"evict\");\n wrapDestructiveCacheMethod(cache, \"modify\");\n wrapDestructiveCacheMethod(cache, \"reset\");\n }\n }\n\n public init(query: {\n document: DocumentNode;\n variables: Record<string, any> | undefined,\n // The initial networkStatus for this fetch, most often\n // NetworkStatus.loading, but also possibly fetchMore, poll, refetch,\n // or setVariables.\n networkStatus?: NetworkStatus,\n observableQuery?: ObservableQuery<any>;\n lastRequestId?: number;\n }): this {\n let networkStatus = query.networkStatus || NetworkStatus.loading;\n if (this.variables &&\n this.networkStatus !== NetworkStatus.loading &&\n !equal(this.variables, query.variables)) {\n networkStatus = NetworkStatus.setVariables;\n }\n\n if (!equal(query.variables, this.variables)) {\n this.diff = null;\n }\n\n Object.assign(this, {\n document: query.document,\n variables: query.variables,\n networkError: null,\n graphQLErrors: this.graphQLErrors || [],\n networkStatus,\n });\n\n if (query.observableQuery) {\n this.setObservableQuery(query.observableQuery);\n }\n\n if (query.lastRequestId) {\n this.lastRequestId = query.lastRequestId;\n }\n\n return this;\n }\n\n private dirty: boolean = false;\n\n private notifyTimeout?: ReturnType<typeof setTimeout>;\n\n private diff: Cache.DiffResult<any> | null = null;\n\n reset() {\n cancelNotifyTimeout(this);\n this.diff = null;\n this.dirty = false;\n }\n\n getDiff(variables = this.variables): Cache.DiffResult<any> {\n if (this.diff && equal(variables, this.variables)) {\n return this.diff;\n }\n\n this.updateWatch(this.variables = variables);\n\n return this.diff = this.cache.diff({\n query: this.document!,\n variables,\n returnPartialData: true,\n optimistic: true,\n });\n }\n\n setDiff(diff: Cache.DiffResult<any> | null) {\n const oldDiff = this.diff;\n this.diff = diff;\n if (!this.dirty &&\n (diff && diff.result) !== (oldDiff && oldDiff.result)) {\n this.dirty = true;\n if (!this.notifyTimeout) {\n this.notifyTimeout = setTimeout(() => this.notify(), 0);\n }\n }\n }\n\n public readonly observableQuery: ObservableQuery<any> | null = null;\n private oqListener?: QueryListener;\n\n setObservableQuery(oq: ObservableQuery<any> | null) {\n if (oq === this.observableQuery) return;\n\n if (this.oqListener) {\n this.listeners.delete(this.oqListener);\n }\n\n (this as any).observableQuery = oq;\n\n if (oq) {\n oq[\"queryInfo\"] = this;\n this.listeners.add(this.oqListener = () => {\n // If this.diff came from an optimistic transaction, deliver the\n // current cache data to the ObservableQuery, but don't perform a\n // full reobservation, since oq.reobserve might make a network\n // request, and we don't want to trigger network requests for\n // optimistic updates.\n if (this.getDiff().fromOptimisticTransaction) {\n oq[\"observe\"]();\n } else {\n oq.reobserve();\n }\n });\n } else {\n delete this.oqListener;\n }\n }\n\n notify() {\n cancelNotifyTimeout(this);\n\n if (this.shouldNotify()) {\n this.listeners.forEach(listener => listener(this));\n }\n\n this.dirty = false;\n }\n\n private shouldNotify() {\n if (!this.dirty || !this.listeners.size) {\n return false;\n }\n\n if (isNetworkRequestInFlight(this.networkStatus) &&\n this.observableQuery) {\n const { fetchPolicy } = this.observableQuery.options;\n if (fetchPolicy !== \"cache-only\" &&\n fetchPolicy !== \"cache-and-network\") {\n return false;\n }\n }\n\n return true;\n }\n\n public stop() {\n if (!this.stopped) {\n this.stopped = true;\n\n // Cancel the pending notify timeout\n this.reset();\n \n this.cancel();\n // Revert back to the no-op version of cancel inherited from\n // QueryInfo.prototype.\n delete this.cancel;\n\n this.subscriptions.forEach(sub => sub.unsubscribe());\n\n const oq = this.observableQuery;\n if (oq) oq.stopPolling();\n }\n }\n\n // This method is a no-op by default, until/unless overridden by the\n // updateWatch method.\n private cancel() {}\n\n private lastWatch?: Cache.WatchOptions;\n\n private updateWatch(variables = this.variables) {\n const oq = this.observableQuery;\n if (oq && oq.options.fetchPolicy === \"no-cache\") {\n return;\n }\n if (!this.lastWatch ||\n this.lastWatch.query !== this.document ||\n !equal(variables, this.lastWatch.variables)) {\n this.cancel();\n this.cancel = this.cache.watch(this.lastWatch = {\n query: this.document!,\n variables,\n optimistic: true,\n callback: diff => this.setDiff(diff),\n });\n }\n }\n\n private lastWrite?: {\n result: FetchResult<any>;\n variables: WatchQueryOptions[\"variables\"];\n dmCount: number | undefined;\n };\n\n private shouldWrite(\n result: FetchResult<any>,\n variables: WatchQueryOptions[\"variables\"],\n ) {\n const { lastWrite } = this;\n return !(\n lastWrite &&\n // If cache.evict has been called since the last time we wrote this\n // data into the cache, there's a chance writing this result into\n // the cache will repair what was evicted.\n lastWrite.dmCount === destructiveMethodCounts.get(this.cache) &&\n equal(variables, lastWrite.variables) &&\n equal(result.data, lastWrite.result.data)\n );\n }\n\n public markResult<T>(\n result: FetchResult<T>,\n options: Pick<WatchQueryOptions,\n | \"variables\"\n | \"fetchPolicy\"\n | \"errorPolicy\">,\n allowCacheWrite: boolean,\n ) {\n this.graphQLErrors = isNonEmptyArray(result.errors) ? result.errors : [];\n\n // Cancel the pending notify timeout (if it exists) to prevent extraneous network\n // requests. To allow future notify timeouts, diff and dirty are reset as well.\n this.reset();\n\n if (options.fetchPolicy === 'no-cache') {\n this.diff = { result: result.data, complete: true };\n\n } else if (!this.stopped && allowCacheWrite) {\n if (shouldWriteResult(result, options.errorPolicy)) {\n // Using a transaction here so we have a chance to read the result\n // back from the cache before the watch callback fires as a result\n // of writeQuery, so we can store the new diff quietly and ignore\n // it when we receive it redundantly from the watch callback.\n this.cache.performTransaction(cache => {\n if (this.shouldWrite(result, options.variables)) {\n cache.writeQuery({\n query: this.document!,\n data: result.data as T,\n variables: options.variables,\n });\n\n this.lastWrite = {\n result,\n variables: options.variables,\n dmCount: destructiveMethodCounts.get(this.cache),\n };\n } else {\n // If result is the same as the last result we received from\n // the network (and the variables match too), avoid writing\n // result into the cache again. The wisdom of skipping this\n // cache write is far from obvious, since any cache write\n // could be the one that puts the cache back into a desired\n // state, fixing corruption or missing data. However, if we\n // always write every network result into the cache, we enable\n // feuds between queries competing to update the same data in\n // incompatible ways, which can lead to an endless cycle of\n // cache broadcasts and useless network requests. As with any\n // feud, eventually one side must step back from the brink,\n // letting the other side(s) have the last word(s). There may\n // be other points where we could break this cycle, such as\n // silencing the broadcast for cache.writeQuery (not a good\n // idea, since it just delays the feud a bit) or somehow\n // avoiding the network request that just happened (also bad,\n // because the server could return useful new data). All\n // options considered, skipping this cache write seems to be\n // the least damaging place to break the cycle, because it\n // reflects the intuition that we recently wrote this exact\n // result into the cache, so the cache *should* already/still\n // contain this data. If some other query has clobbered that\n // data in the meantime, that's too bad, but there will be no\n // winners if every query blindly reverts to its own version\n // of the data. This approach also gives the network a chance\n // to return new data, which will be written into the cache as\n // usual, notifying only those queries that are directly\n // affected by the cache updates, as usual. In the future, an\n // even more sophisticated cache could perhaps prevent or\n // mitigate the clobbering somehow, but that would make this\n // particular cache write even less important, and thus\n // skipping it would be even safer than it is today.\n if (this.diff && this.diff.complete) {\n // Reuse data from the last good (complete) diff that we\n // received, when possible.\n result.data = this.diff.result;\n return;\n }\n // If the previous this.diff was incomplete, fall through to\n // re-reading the latest data with cache.diff, below.\n }\n\n const diff = cache.diff<T>({\n query: this.document!,\n variables: options.variables,\n returnPartialData: true,\n optimistic: true,\n });\n\n // In case the QueryManager stops this QueryInfo before its\n // results are delivered, it's important to avoid restarting the\n // cache watch when markResult is called.\n if (!this.stopped) {\n // Any time we're about to update this.diff, we need to make\n // sure we've started watching the cache.\n this.updateWatch(options.variables);\n }\n\n // If we're allowed to write to the cache, and we can read a\n // complete result from the cache, update result.data to be the\n // result from the cache, rather than the raw network result.\n // Set without setDiff to avoid triggering a notify call, since\n // we have other ways of notifying for this result.\n this.diff = diff;\n if (diff.complete) {\n result.data = diff.result;\n }\n });\n\n } else {\n this.lastWrite = void 0;\n }\n }\n }\n\n public markReady() {\n this.networkError = null;\n return this.networkStatus = NetworkStatus.ready;\n }\n\n public markError(error: ApolloError) {\n this.networkStatus = NetworkStatus.error;\n this.lastWrite = void 0;\n\n this.reset();\n\n if (error.graphQLErrors) {\n this.graphQLErrors = error.graphQLErrors;\n }\n\n if (error.networkError) {\n this.networkError = error.networkError;\n }\n\n return error;\n }\n}\n\nexport function shouldWriteResult<T>(\n result: FetchResult<T>,\n errorPolicy: ErrorPolicy = \"none\",\n) {\n const ignoreErrors =\n errorPolicy === \"ignore\" ||\n errorPolicy === \"all\";\n let writeWithErrors = !graphQLResultHasError(result);\n if (!writeWithErrors && ignoreErrors && result.data) {\n writeWithErrors = true;\n }\n return writeWithErrors;\n}\n", "import { DocumentNode } from 'graphql';\nimport { invariant, InvariantError } from 'ts-invariant';\nimport { equal } from '@wry/equality';\n\nimport { ApolloLink, execute, FetchResult } from '../link/core';\nimport { Cache, ApolloCache } from '../cache';\n\nimport {\n getDefaultValues,\n getOperationDefinition,\n getOperationName,\n hasClientExports,\n graphQLResultHasError,\n removeConnectionDirectiveFromDocument,\n canUseWeakMap,\n ObservableSubscription,\n Observable,\n asyncMap,\n isNonEmptyArray,\n Concast,\n ConcastSourcesIterable,\n} from '../utilities';\nimport { ApolloError, isApolloError } from '../errors';\nimport {\n QueryOptions,\n WatchQueryOptions,\n SubscriptionOptions,\n MutationOptions,\n WatchQueryFetchPolicy,\n ErrorPolicy,\n} from './watchQueryOptions';\nimport { ObservableQuery } from './ObservableQuery';\nimport { NetworkStatus, isNetworkRequestInFlight } from './networkStatus';\nimport {\n ApolloQueryResult,\n OperationVariables,\n} from './types';\nimport { LocalState } from './LocalState';\n\nimport { QueryInfo, QueryStoreValue, shouldWriteResult } from './QueryInfo';\n\nconst { hasOwnProperty } = Object.prototype;\n\ninterface MutationStoreValue {\n mutation: DocumentNode;\n variables: Record<string, any>;\n loading: boolean;\n error: Error | null;\n}\n\nexport class QueryManager<TStore> {\n public cache: ApolloCache<TStore>;\n public link: ApolloLink;\n public readonly assumeImmutableResults: boolean;\n public readonly ssrMode: boolean;\n\n private queryDeduplication: boolean;\n private clientAwareness: Record<string, string> = {};\n private localState: LocalState<TStore>;\n\n private onBroadcast?: () => void;\n public mutationStore?: {\n [mutationId: string]: MutationStoreValue;\n };\n\n // All the queries that the QueryManager is currently managing (not\n // including mutations and subscriptions).\n private queries = new Map<string, QueryInfo>();\n\n // Maps from queryId strings to Promise rejection functions for\n // currently active queries and fetches.\n private fetchCancelFns = new Map<string, (error: any) => any>();\n\n constructor({\n cache,\n link,\n queryDeduplication = false,\n onBroadcast,\n ssrMode = false,\n clientAwareness = {},\n localState,\n assumeImmutableResults,\n }: {\n cache: ApolloCache<TStore>;\n link: ApolloLink;\n queryDeduplication?: boolean;\n onBroadcast?: () => void;\n ssrMode?: boolean;\n clientAwareness?: Record<string, string>;\n localState?: LocalState<TStore>;\n assumeImmutableResults?: boolean;\n }) {\n this.cache = cache;\n this.link = link;\n this.queryDeduplication = queryDeduplication;\n this.clientAwareness = clientAwareness;\n this.localState = localState || new LocalState({ cache });\n this.ssrMode = ssrMode;\n this.assumeImmutableResults = !!assumeImmutableResults;\n if ((this.onBroadcast = onBroadcast)) {\n this.mutationStore = Object.create(null);\n }\n }\n\n /**\n * Call this method to terminate any active query processes, making it safe\n * to dispose of this QueryManager instance.\n */\n public stop() {\n this.queries.forEach((_info, queryId) => {\n this.stopQueryNoBroadcast(queryId);\n });\n\n this.cancelPendingFetches(\n new InvariantError('QueryManager stopped while query was in flight'),\n );\n }\n\n private cancelPendingFetches(error: Error) {\n this.fetchCancelFns.forEach(cancel => cancel(error));\n this.fetchCancelFns.clear();\n }\n\n public async mutate<T>({\n mutation,\n variables,\n optimisticResponse,\n updateQueries,\n refetchQueries = [],\n awaitRefetchQueries = false,\n update: updateWithProxyFn,\n errorPolicy = 'none',\n fetchPolicy,\n context = {},\n }: MutationOptions): Promise<FetchResult<T>> {\n invariant(\n mutation,\n 'mutation option is required. You must specify your GraphQL document in the mutation option.',\n );\n\n invariant(\n !fetchPolicy || fetchPolicy === 'no-cache',\n \"Mutations only support a 'no-cache' fetchPolicy. If you don't want to disable the cache, remove your fetchPolicy setting to proceed with the default mutation behavior.\"\n );\n\n const mutationId = this.generateMutationId();\n mutation = this.transform(mutation).document;\n\n variables = this.getVariables(mutation, variables);\n\n if (this.transform(mutation).hasClientExports) {\n variables = await this.localState.addExportedVariables(mutation, variables, context);\n }\n\n const mutationStoreValue =\n this.mutationStore &&\n (this.mutationStore[mutationId] = {\n mutation,\n variables,\n loading: true,\n error: null,\n } as MutationStoreValue);\n\n if (optimisticResponse) {\n this.markMutationOptimistic<T>(optimisticResponse, {\n mutationId,\n document: mutation,\n variables,\n errorPolicy,\n updateQueries,\n update: updateWithProxyFn,\n });\n }\n\n this.broadcastQueries();\n\n const self = this;\n\n return new Promise((resolve, reject) => {\n let storeResult: FetchResult<T> | null;\n let error: ApolloError;\n\n self.getObservableFromLink(\n mutation,\n {\n ...context,\n optimisticResponse,\n },\n variables,\n false,\n ).subscribe({\n next(result: FetchResult<T>) {\n if (graphQLResultHasError(result) && errorPolicy === 'none') {\n error = new ApolloError({\n graphQLErrors: result.errors,\n });\n return;\n }\n\n if (mutationStoreValue) {\n mutationStoreValue.loading = false;\n mutationStoreValue.error = null;\n }\n\n if (fetchPolicy !== 'no-cache') {\n try {\n self.markMutationResult<T>({\n mutationId,\n result,\n document: mutation,\n variables,\n errorPolicy,\n updateQueries,\n update: updateWithProxyFn,\n });\n } catch (e) {\n error = new ApolloError({\n networkError: e,\n });\n return;\n }\n }\n\n storeResult = result;\n },\n\n error(err: Error) {\n if (mutationStoreValue) {\n mutationStoreValue.loading = false;\n mutationStoreValue.error = err;\n }\n if (optimisticResponse) {\n self.cache.removeOptimistic(mutationId);\n }\n self.broadcastQueries();\n reject(\n new ApolloError({\n networkError: err,\n }),\n );\n },\n\n complete() {\n if (error && mutationStoreValue) {\n mutationStoreValue.loading = false;\n mutationStoreValue.error = error;\n }\n\n if (optimisticResponse) {\n self.cache.removeOptimistic(mutationId);\n }\n\n self.broadcastQueries();\n\n if (error) {\n reject(error);\n return;\n }\n\n // allow for conditional refetches\n // XXX do we want to make this the only API one day?\n if (typeof refetchQueries === 'function') {\n refetchQueries = refetchQueries(storeResult!);\n }\n\n const refetchQueryPromises: Promise<\n ApolloQueryResult<any>[] | ApolloQueryResult<{}>\n >[] = [];\n\n if (isNonEmptyArray(refetchQueries)) {\n refetchQueries.forEach(refetchQuery => {\n if (typeof refetchQuery === 'string') {\n self.queries.forEach(({ observableQuery }) => {\n if (observableQuery &&\n observableQuery.hasObservers() &&\n observableQuery.queryName === refetchQuery) {\n refetchQueryPromises.push(observableQuery.refetch());\n }\n });\n } else {\n const queryOptions: QueryOptions = {\n query: refetchQuery.query,\n variables: refetchQuery.variables,\n fetchPolicy: 'network-only',\n };\n\n if (refetchQuery.context) {\n queryOptions.context = refetchQuery.context;\n }\n\n refetchQueryPromises.push(self.query(queryOptions));\n }\n });\n }\n\n Promise.all(\n awaitRefetchQueries ? refetchQueryPromises : [],\n ).then(() => {\n if (\n errorPolicy === 'ignore' &&\n storeResult &&\n graphQLResultHasError(storeResult)\n ) {\n delete storeResult.errors;\n }\n\n resolve(storeResult!);\n }, reject);\n },\n });\n });\n }\n\n public markMutationResult<TData>(\n mutation: {\n mutationId: string;\n result: FetchResult<TData>;\n document: DocumentNode;\n variables?: OperationVariables;\n errorPolicy: ErrorPolicy;\n updateQueries: MutationOptions<TData>[\"updateQueries\"],\n update?: (\n cache: ApolloCache<TStore>,\n result: FetchResult<TData>,\n ) => void;\n },\n cache = this.cache,\n ) {\n if (shouldWriteResult(mutation.result, mutation.errorPolicy)) {\n const cacheWrites: Cache.WriteOptions[] = [{\n result: mutation.result.data,\n dataId: 'ROOT_MUTATION',\n query: mutation.document,\n variables: mutation.variables,\n }];\n\n const { updateQueries } = mutation;\n if (updateQueries) {\n this.queries.forEach(({ observableQuery }, queryId) => {\n const queryName = observableQuery && observableQuery.queryName;\n if (!queryName || !hasOwnProperty.call(updateQueries, queryName)) {\n return;\n }\n const updater = updateQueries[queryName];\n const { document, variables } = this.queries.get(queryId)!;\n\n // Read the current query result from the store.\n const { result: currentQueryResult, complete } = cache.diff<TData>({\n query: document!,\n variables,\n returnPartialData: true,\n optimistic: false,\n });\n\n if (complete && currentQueryResult) {\n // Run our reducer using the current query result and the mutation result.\n const nextQueryResult = updater(currentQueryResult, {\n mutationResult: mutation.result,\n queryName: document && getOperationName(document) || void 0,\n queryVariables: variables!,\n });\n\n // Write the modified result back into the store if we got a new result.\n if (nextQueryResult) {\n cacheWrites.push({\n result: nextQueryResult,\n dataId: 'ROOT_QUERY',\n query: document!,\n variables,\n });\n }\n }\n });\n }\n\n cache.performTransaction(c => {\n cacheWrites.forEach(write => c.write(write));\n\n // If the mutation has some writes associated with it then we need to\n // apply those writes to the store by running this reducer again with a\n // write action.\n const { update } = mutation;\n if (update) {\n update(c, mutation.result);\n }\n }, /* non-optimistic transaction: */ null);\n }\n }\n\n public markMutationOptimistic<TData>(\n optimisticResponse: any,\n mutation: {\n mutationId: string;\n document: DocumentNode;\n variables?: OperationVariables;\n errorPolicy: ErrorPolicy;\n updateQueries: MutationOptions<TData>[\"updateQueries\"],\n update?: (\n cache: ApolloCache<TStore>,\n result: FetchResult<TData>,\n ) => void;\n },\n ) {\n const data = typeof optimisticResponse === \"function\"\n ? optimisticResponse(mutation.variables)\n : optimisticResponse;\n\n return this.cache.recordOptimisticTransaction(cache => {\n try {\n this.markMutationResult<TData>({\n ...mutation,\n result: { data },\n }, cache);\n } catch (error) {\n invariant.error(error);\n }\n }, mutation.mutationId);\n }\n\n public fetchQuery<TData, TVars>(\n queryId: string,\n options: WatchQueryOptions<TVars, TData>,\n networkStatus?: NetworkStatus,\n ): Promise<ApolloQueryResult<TData>> {\n return this.fetchQueryObservable<TData, TVars>(\n queryId,\n options,\n networkStatus,\n ).promise;\n }\n\n public getQueryStore() {\n const store: Record<string, QueryStoreValue> = Object.create(null);\n this.queries.forEach((info, queryId) => {\n store[queryId] = {\n variables: info.variables,\n networkStatus: info.networkStatus,\n networkError: info.networkError,\n graphQLErrors: info.graphQLErrors,\n };\n });\n return store;\n }\n\n public resetErrors(queryId: string) {\n const queryInfo = this.queries.get(queryId);\n if (queryInfo) {\n queryInfo.networkError = undefined;\n queryInfo.graphQLErrors = [];\n }\n }\n\n private transformCache = new (canUseWeakMap ? WeakMap : Map)<\n DocumentNode,\n Readonly<{\n document: Readonly<DocumentNode>;\n hasClientExports: boolean;\n hasForcedResolvers: boolean;\n clientQuery: Readonly<DocumentNode> | null;\n serverQuery: Readonly<DocumentNode> | null;\n defaultVars: Readonly<OperationVariables>;\n }>\n >();\n\n public transform(document: DocumentNode) {\n const { transformCache } = this;\n\n if (!transformCache.has(document)) {\n const transformed = this.cache.transformDocument(document);\n const forLink = removeConnectionDirectiveFromDocument(\n this.cache.transformForLink(transformed));\n\n const clientQuery = this.localState.clientQuery(transformed);\n const serverQuery = forLink && this.localState.serverQuery(forLink);\n\n const cacheEntry = {\n document: transformed,\n // TODO These two calls (hasClientExports and shouldForceResolvers)\n // could probably be merged into a single traversal.\n hasClientExports: hasClientExports(transformed),\n hasForcedResolvers: this.localState.shouldForceResolvers(transformed),\n clientQuery,\n serverQuery,\n defaultVars: getDefaultValues(\n getOperationDefinition(transformed)\n ) as OperationVariables,\n };\n\n const add = (doc: DocumentNode | null) => {\n if (doc && !transformCache.has(doc)) {\n transformCache.set(doc, cacheEntry);\n }\n }\n // Add cacheEntry to the transformCache using several different keys,\n // since any one of these documents could end up getting passed to the\n // transform method again in the future.\n add(document);\n add(transformed);\n add(clientQuery);\n add(serverQuery);\n }\n\n return transformCache.get(document)!;\n }\n\n private getVariables(\n document: DocumentNode,\n variables?: OperationVariables,\n ): OperationVariables {\n return {\n ...this.transform(document).defaultVars,\n ...variables,\n };\n }\n\n public watchQuery<T, TVariables = OperationVariables>(\n options: WatchQueryOptions<TVariables, T>,\n ): ObservableQuery<T, TVariables> {\n // assign variable default values if supplied\n options = {\n ...options,\n variables: this.getVariables(\n options.query,\n options.variables,\n ) as TVariables,\n };\n\n if (typeof options.notifyOnNetworkStatusChange === 'undefined') {\n options.notifyOnNetworkStatusChange = false;\n }\n\n const queryInfo = new QueryInfo(this.cache);\n const observable = new ObservableQuery<T, TVariables>({\n queryManager: this,\n queryInfo,\n options,\n });\n\n this.queries.set(observable.queryId, queryInfo);\n\n queryInfo.init({\n document: options.query,\n observableQuery: observable,\n variables: options.variables,\n });\n\n return observable;\n }\n\n public query<TData, TVars = OperationVariables>(\n options: QueryOptions<TVars, TData>,\n ): Promise<ApolloQueryResult<TData>> {\n invariant(\n options.query,\n 'query option is required. You must specify your GraphQL document ' +\n 'in the query option.',\n );\n\n invariant(\n options.query.kind === 'Document',\n 'You must wrap the query string in a \"gql\" tag.',\n );\n\n invariant(\n !(options as any).returnPartialData,\n 'returnPartialData option only supported on watchQuery.',\n );\n\n invariant(\n !(options as any).pollInterval,\n 'pollInterval option only supported on watchQuery.',\n );\n\n const queryId = this.generateQueryId();\n return this.fetchQuery<TData, TVars>(\n queryId,\n options,\n ).finally(() => this.stopQuery(queryId));\n }\n\n private queryIdCounter = 1;\n public generateQueryId() {\n return String(this.queryIdCounter++);\n }\n\n private requestIdCounter = 1;\n public generateRequestId() {\n return this.requestIdCounter++;\n }\n\n private mutationIdCounter = 1;\n public generateMutationId() {\n return String(this.mutationIdCounter++);\n }\n\n public stopQueryInStore(queryId: string) {\n this.stopQueryInStoreNoBroadcast(queryId);\n this.broadcastQueries();\n }\n\n private stopQueryInStoreNoBroadcast(queryId: string) {\n const queryInfo = this.queries.get(queryId);\n if (queryInfo) queryInfo.stop();\n }\n\n public clearStore(): Promise<void> {\n // Before we have sent the reset action to the store, we can no longer\n // rely on the results returned by in-flight requests since these may\n // depend on values that previously existed in the data portion of the\n // store. So, we cancel the promises and observers that we have issued\n // so far and not yet resolved (in the case of queries).\n this.cancelPendingFetches(new InvariantError(\n 'Store reset while query was in flight (not completed in link chain)',\n ));\n\n this.queries.forEach(queryInfo => {\n if (queryInfo.observableQuery) {\n // Set loading to true so listeners don't trigger unless they want\n // results with partial data.\n queryInfo.networkStatus = NetworkStatus.loading;\n } else {\n queryInfo.stop();\n }\n });\n\n if (this.mutationStore) {\n this.mutationStore = Object.create(null);\n }\n\n // begin removing data from the store\n return this.cache.reset();\n }\n\n public resetStore(): Promise<ApolloQueryResult<any>[]> {\n // Similarly, we have to have to refetch each of the queries currently being\n // observed. We refetch instead of error'ing on these since the assumption is that\n // resetting the store doesn't eliminate the need for the queries currently being\n // watched. If there is an existing query in flight when the store is reset,\n // the promise for it will be rejected and its results will not be written to the\n // store.\n return this.clearStore().then(() => {\n return this.reFetchObservableQueries();\n });\n }\n\n public reFetchObservableQueries(\n includeStandby: boolean = false,\n ): Promise<ApolloQueryResult<any>[]> {\n const observableQueryPromises: Promise<ApolloQueryResult<any>>[] = [];\n\n this.queries.forEach(({ observableQuery }, queryId) => {\n if (observableQuery && observableQuery.hasObservers()) {\n const fetchPolicy = observableQuery.options.fetchPolicy;\n\n observableQuery.resetLastResults();\n if (\n fetchPolicy !== 'cache-only' &&\n (includeStandby || fetchPolicy !== 'standby')\n ) {\n observableQueryPromises.push(observableQuery.refetch());\n }\n\n this.getQuery(queryId).setDiff(null);\n }\n });\n\n this.broadcastQueries();\n\n return Promise.all(observableQueryPromises);\n }\n\n public setObservableQuery(observableQuery: ObservableQuery<any, any>) {\n this.getQuery(observableQuery.queryId).setObservableQuery(observableQuery);\n }\n\n public startGraphQLSubscription<T = any>({\n query,\n fetchPolicy,\n errorPolicy,\n variables,\n context = {},\n }: SubscriptionOptions): Observable<FetchResult<T>> {\n query = this.transform(query).document;\n variables = this.getVariables(query, variables);\n\n const makeObservable = (variables: OperationVariables) =>\n this.getObservableFromLink<T>(\n query,\n context,\n variables,\n false,\n ).map(result => {\n if (fetchPolicy !== 'no-cache') {\n // the subscription interface should handle not sending us results we no longer subscribe to.\n // XXX I don't think we ever send in an object with errors, but we might in the future...\n if (shouldWriteResult(result, errorPolicy)) {\n this.cache.write({\n query,\n result: result.data,\n dataId: 'ROOT_SUBSCRIPTION',\n variables: variables,\n });\n }\n\n this.broadcastQueries();\n }\n\n if (graphQLResultHasError(result)) {\n throw new ApolloError({\n graphQLErrors: result.errors,\n });\n }\n\n return result;\n });\n\n if (this.transform(query).hasClientExports) {\n const observablePromise = this.localState.addExportedVariables(\n query,\n variables,\n context,\n ).then(makeObservable);\n\n return new Observable<FetchResult<T>>(observer => {\n let sub: ObservableSubscription | null = null;\n observablePromise.then(\n observable => sub = observable.subscribe(observer),\n observer.error,\n );\n return () => sub && sub.unsubscribe();\n });\n }\n\n return makeObservable(variables);\n }\n\n public stopQuery(queryId: string) {\n this.stopQueryNoBroadcast(queryId);\n this.broadcastQueries();\n }\n\n private stopQueryNoBroadcast(queryId: string) {\n this.stopQueryInStoreNoBroadcast(queryId);\n this.removeQuery(queryId);\n }\n\n public removeQuery(queryId: string) {\n // teardown all links\n // Both `QueryManager.fetchRequest` and `QueryManager.query` create separate promises\n // that each add their reject functions to fetchCancelFns.\n // A query created with `QueryManager.query()` could trigger a `QueryManager.fetchRequest`.\n // The same queryId could have two rejection fns for two promises\n this.fetchCancelFns.delete(queryId);\n this.getQuery(queryId).stop();\n this.queries.delete(queryId);\n }\n\n public broadcastQueries() {\n if (this.onBroadcast) this.onBroadcast();\n this.queries.forEach(info => info.notify());\n }\n\n public getLocalState(): LocalState<TStore> {\n return this.localState;\n }\n\n private inFlightLinkObservables = new Map<\n DocumentNode,\n Map<string, Observable<FetchResult>>\n >();\n\n private getObservableFromLink<T = any>(\n query: DocumentNode,\n context: any,\n variables?: OperationVariables,\n deduplication: boolean =\n // Prefer context.queryDeduplication if specified.\n context?.queryDeduplication ??\n this.queryDeduplication,\n ): Observable<FetchResult<T>> {\n let observable: Observable<FetchResult<T>>;\n\n const { serverQuery } = this.transform(query);\n if (serverQuery) {\n const { inFlightLinkObservables, link } = this;\n\n const operation = {\n query: serverQuery,\n variables,\n operationName: getOperationName(serverQuery) || void 0,\n context: this.prepareContext({\n ...context,\n forceFetch: !deduplication\n }),\n };\n\n context = operation.context;\n\n if (deduplication) {\n const byVariables = inFlightLinkObservables.get(serverQuery) || new Map();\n inFlightLinkObservables.set(serverQuery, byVariables);\n\n const varJson = JSON.stringify(variables);\n observable = byVariables.get(varJson);\n\n if (!observable) {\n const concast = new Concast([\n execute(link, operation) as Observable<FetchResult<T>>\n ]);\n\n byVariables.set(varJson, observable = concast);\n\n concast.cleanup(() => {\n if (byVariables.delete(varJson) &&\n byVariables.size < 1) {\n inFlightLinkObservables.delete(serverQuery);\n }\n });\n }\n\n } else {\n observable = new Concast([\n execute(link, operation) as Observable<FetchResult<T>>\n ]);\n }\n } else {\n observable = new Concast([\n Observable.of({ data: {} } as FetchResult<T>)\n ]);\n context = this.prepareContext(context);\n }\n\n const { clientQuery } = this.transform(query);\n if (clientQuery) {\n observable = asyncMap(observable, result => {\n return this.localState.runResolvers({\n document: clientQuery,\n remoteResult: result,\n context,\n variables,\n });\n });\n }\n\n return observable;\n }\n\n private getResultsFromLink<TData, TVars>(\n queryInfo: QueryInfo,\n allowCacheWrite: boolean,\n options: Pick<WatchQueryOptions<TVars, TData>,\n | \"variables\"\n | \"context\"\n | \"fetchPolicy\"\n | \"errorPolicy\">,\n ): Observable<ApolloQueryResult<TData>> {\n const requestId = queryInfo.lastRequestId = this.generateRequestId();\n\n return asyncMap(\n this.getObservableFromLink(\n queryInfo.document!,\n options.context,\n options.variables,\n ),\n\n result => {\n const hasErrors = isNonEmptyArray(result.errors);\n\n // If we interrupted this request by calling getResultsFromLink again\n // with the same QueryInfo object, we ignore the old results.\n if (requestId >= queryInfo.lastRequestId) {\n if (hasErrors && options.errorPolicy === \"none\") {\n // Throwing here effectively calls observer.error.\n throw queryInfo.markError(new ApolloError({\n graphQLErrors: result.errors,\n }));\n }\n queryInfo.markResult(result, options, allowCacheWrite);\n queryInfo.markReady();\n }\n\n const aqr: ApolloQueryResult<TData> = {\n data: result.data,\n loading: false,\n networkStatus: queryInfo.networkStatus || NetworkStatus.ready,\n };\n\n if (hasErrors && options.errorPolicy !== \"ignore\") {\n aqr.errors = result.errors;\n }\n\n return aqr;\n },\n\n networkError => {\n const error = isApolloError(networkError)\n ? networkError\n : new ApolloError({ networkError });\n\n // Avoid storing errors from older interrupted queries.\n if (requestId >= queryInfo.lastRequestId) {\n queryInfo.markError(error);\n }\n\n throw error;\n },\n );\n }\n\n public fetchQueryObservable<TData, TVars>(\n queryId: string,\n options: WatchQueryOptions<TVars, TData>,\n // The initial networkStatus for this fetch, most often\n // NetworkStatus.loading, but also possibly fetchMore, poll, refetch,\n // or setVariables.\n networkStatus = NetworkStatus.loading,\n ): Concast<ApolloQueryResult<TData>> {\n const query = this.transform(options.query).document;\n const variables = this.getVariables(query, options.variables) as TVars;\n const queryInfo = this.getQuery(queryId);\n const oldNetworkStatus = queryInfo.networkStatus;\n\n let {\n fetchPolicy = \"cache-first\" as WatchQueryFetchPolicy,\n errorPolicy = \"none\" as ErrorPolicy,\n returnPartialData = false,\n notifyOnNetworkStatusChange = false,\n context = {},\n } = options;\n\n const mightUseNetwork =\n fetchPolicy === \"cache-first\" ||\n fetchPolicy === \"cache-and-network\" ||\n fetchPolicy === \"network-only\" ||\n fetchPolicy === \"no-cache\";\n\n if (mightUseNetwork &&\n notifyOnNetworkStatusChange &&\n typeof oldNetworkStatus === \"number\" &&\n oldNetworkStatus !== networkStatus &&\n isNetworkRequestInFlight(networkStatus)) {\n // In order to force delivery of an incomplete cache result with\n // loading:true, we tweak the fetchPolicy to include the cache, and\n // pretend that returnPartialData was enabled.\n if (fetchPolicy !== \"cache-first\") {\n fetchPolicy = \"cache-and-network\";\n }\n returnPartialData = true;\n }\n\n const normalized = Object.assign({}, options, {\n query,\n variables,\n fetchPolicy,\n errorPolicy,\n returnPartialData,\n notifyOnNetworkStatusChange,\n context,\n });\n\n const fromVariables = (variables: TVars) => {\n // Since normalized is always a fresh copy of options, it's safe to\n // modify its properties here, rather than creating yet another new\n // WatchQueryOptions object.\n normalized.variables = variables;\n return this.fetchQueryByPolicy<TData, TVars>(\n queryInfo,\n normalized,\n networkStatus,\n );\n };\n\n // This cancel function needs to be set before the concast is created,\n // in case concast creation synchronously cancels the request.\n this.fetchCancelFns.set(queryId, reason => {\n // Delaying the cancellation using a Promise ensures that the\n // concast variable has been initialized.\n Promise.resolve().then(() => concast.cancel(reason));\n });\n\n // A Concast<T> can be created either from an Iterable<Observable<T>>\n // or from a PromiseLike<Iterable<Observable<T>>>, where T in this\n // case is ApolloQueryResult<TData>.\n const concast = new Concast(\n // If the query has @export(as: ...) directives, then we need to\n // process those directives asynchronously. When there are no\n // @export directives (the common case), we deliberately avoid\n // wrapping the result of this.fetchQueryByPolicy in a Promise,\n // since the timing of result delivery is (unfortunately) important\n // for backwards compatibility. TODO This code could be simpler if\n // we deprecated and removed LocalState.\n this.transform(normalized.query).hasClientExports\n ? this.localState.addExportedVariables(\n normalized.query,\n normalized.variables,\n normalized.context,\n ).then(fromVariables)\n : fromVariables(normalized.variables!)\n );\n\n concast.cleanup(() => {\n this.fetchCancelFns.delete(queryId);\n\n const { nextFetchPolicy } = options;\n if (nextFetchPolicy) {\n // The options.nextFetchPolicy transition should happen only once,\n // but it should be possible for a nextFetchPolicy function to set\n // this.nextFetchPolicy to perform an additional transition.\n options.nextFetchPolicy = void 0;\n\n // When someone chooses cache-and-network or network-only as their\n // initial FetchPolicy, they often do not want future cache updates to\n // trigger unconditional network requests, which is what repeatedly\n // applying the cache-and-network or network-only policies would seem\n // to imply. Instead, when the cache reports an update after the\n // initial network request, it may be desirable for subsequent network\n // requests to be triggered only if the cache result is incomplete.\n // The options.nextFetchPolicy option provides an easy way to update\n // options.fetchPolicy after the intial network request, without\n // having to call observableQuery.setOptions.\n options.fetchPolicy = typeof nextFetchPolicy === \"function\"\n ? nextFetchPolicy.call(options, options.fetchPolicy || \"cache-first\")\n : nextFetchPolicy;\n }\n });\n\n return concast;\n }\n\n private fetchQueryByPolicy<TData, TVars>(\n queryInfo: QueryInfo,\n options: WatchQueryOptions<TVars, TData>,\n // The initial networkStatus for this fetch, most often\n // NetworkStatus.loading, but also possibly fetchMore, poll, refetch,\n // or setVariables.\n networkStatus: NetworkStatus,\n ): ConcastSourcesIterable<ApolloQueryResult<TData>> {\n const {\n query,\n variables,\n fetchPolicy,\n errorPolicy,\n returnPartialData,\n context,\n } = options;\n\n queryInfo.init({\n document: query,\n variables,\n networkStatus,\n });\n\n const readCache = () => queryInfo.getDiff(variables);\n\n const resultsFromCache = (\n diff: Cache.DiffResult<TData>,\n networkStatus = queryInfo.networkStatus || NetworkStatus.loading,\n ) => {\n const data = diff.result as TData;\n\n if (process.env.NODE_ENV !== 'production' &&\n isNonEmptyArray(diff.missing) &&\n !equal(data, {}) &&\n !returnPartialData) {\n invariant.warn(`Missing cache result fields: ${\n diff.missing.map(m => m.path.join('.')).join(', ')\n }`, diff.missing);\n }\n\n const fromData = (data: TData) => Observable.of({\n data,\n loading: isNetworkRequestInFlight(networkStatus),\n networkStatus,\n ...(diff.complete ? null : { partial: true }),\n } as ApolloQueryResult<TData>);\n\n if (this.transform(query).hasForcedResolvers) {\n return this.localState.runResolvers({\n document: query,\n remoteResult: { data },\n context,\n variables,\n onlyRunForcedResolvers: true,\n }).then(resolved => fromData(resolved.data!));\n }\n\n return fromData(data);\n };\n\n const resultsFromLink = (allowCacheWrite: boolean) =>\n this.getResultsFromLink<TData, TVars>(queryInfo, allowCacheWrite, {\n variables,\n context,\n fetchPolicy,\n errorPolicy,\n });\n\n switch (fetchPolicy) {\n default: case \"cache-first\": {\n const diff = readCache();\n\n if (diff.complete) {\n return [\n resultsFromCache(diff, queryInfo.markReady()),\n ];\n }\n\n if (returnPartialData) {\n return [\n resultsFromCache(diff),\n resultsFromLink(true),\n ];\n }\n\n return [\n resultsFromLink(true),\n ];\n }\n\n case \"cache-and-network\": {\n const diff = readCache();\n\n if (diff.complete || returnPartialData) {\n return [\n resultsFromCache(diff),\n resultsFromLink(true),\n ];\n }\n\n return [\n resultsFromLink(true),\n ];\n }\n\n case \"cache-only\":\n return [\n resultsFromCache(readCache(), queryInfo.markReady()),\n ];\n\n case \"network-only\":\n return [resultsFromLink(true)];\n\n case \"no-cache\":\n return [resultsFromLink(false)];\n\n case \"standby\":\n return [];\n }\n }\n\n private getQuery(queryId: string): QueryInfo {\n if (queryId && !this.queries.has(queryId)) {\n this.queries.set(queryId, new QueryInfo(this.cache));\n }\n return this.queries.get(queryId)!;\n }\n\n private prepareContext(context = {}) {\n const newContext = this.localState.prepareContext(context);\n return {\n ...newContext,\n clientAwareness: this.clientAwareness,\n };\n }\n}\n", "import { ExecutionResult, DocumentNode } from 'graphql';\nimport { invariant, InvariantError } from 'ts-invariant';\n\nimport { ApolloLink, FetchResult, GraphQLRequest, execute } from '../link/core';\nimport { ApolloCache, DataProxy } from '../cache';\nimport { Observable, compact } from '../utilities';\nimport { version } from '../version';\nimport { HttpLink, UriFunction } from '../link/http';\n\nimport { QueryManager } from './QueryManager';\nimport { ObservableQuery } from './ObservableQuery';\n\nimport {\n ApolloQueryResult,\n OperationVariables,\n Resolvers,\n} from './types';\n\nimport {\n QueryOptions,\n WatchQueryOptions,\n MutationOptions,\n SubscriptionOptions,\n WatchQueryFetchPolicy,\n} from './watchQueryOptions';\n\nimport {\n LocalState,\n FragmentMatcher,\n} from './LocalState';\n\nexport interface DefaultOptions {\n watchQuery?: Partial<WatchQueryOptions<any, any>>;\n query?: Partial<QueryOptions<any, any>>;\n mutate?: Partial<MutationOptions<any, any>>;\n}\n\nlet hasSuggestedDevtools = false;\n\nexport type ApolloClientOptions<TCacheShape> = {\n uri?: string | UriFunction;\n credentials?: string;\n headers?: Record<string, string>;\n link?: ApolloLink;\n cache: ApolloCache<TCacheShape>;\n ssrForceFetchDelay?: number;\n ssrMode?: boolean;\n connectToDevTools?: boolean;\n queryDeduplication?: boolean;\n defaultOptions?: DefaultOptions;\n assumeImmutableResults?: boolean;\n resolvers?: Resolvers | Resolvers[];\n typeDefs?: string | string[] | DocumentNode | DocumentNode[];\n fragmentMatcher?: FragmentMatcher;\n name?: string;\n version?: string;\n};\n\ntype OptionsUnion<TData, TVariables> =\n | WatchQueryOptions<TVariables, TData>\n | QueryOptions<TVariables, TData>\n | MutationOptions<TData, TVariables>;\n\nexport function mergeOptions<\n TOptions extends OptionsUnion<any, any>\n>(\n defaults: Partial<TOptions>,\n options: TOptions,\n): TOptions {\n return compact(defaults, options, options.variables && {\n variables: {\n ...defaults.variables,\n ...options.variables,\n },\n });\n}\n\n/**\n * This is the primary Apollo Client class. It is used to send GraphQL documents (i.e. queries\n * and mutations) to a GraphQL spec-compliant server over a {@link NetworkInterface} instance,\n * receive results from the server and cache the results in a store. It also delivers updates\n * to GraphQL queries through {@link Observable} instances.\n */\nexport class ApolloClient<TCacheShape> implements DataProxy {\n public link: ApolloLink;\n public cache: ApolloCache<TCacheShape>;\n public disableNetworkFetches: boolean;\n public version: string;\n public queryDeduplication: boolean;\n public defaultOptions: DefaultOptions = {};\n public readonly typeDefs: ApolloClientOptions<TCacheShape>['typeDefs'];\n\n private queryManager: QueryManager<TCacheShape>;\n private devToolsHookCb: Function;\n private resetStoreCallbacks: Array<() => Promise<any>> = [];\n private clearStoreCallbacks: Array<() => Promise<any>> = [];\n private localState: LocalState<TCacheShape>;\n\n /**\n * Constructs an instance of {@link ApolloClient}.\n *\n * @param uri The GraphQL endpoint that Apollo Client will connect to. If\n * `link` is configured, this option is ignored.\n * @param link The {@link ApolloLink} over which GraphQL documents will be resolved into a response.\n *\n * @param cache The initial cache to use in the data store.\n *\n * @param ssrMode Determines whether this is being run in Server Side Rendering (SSR) mode.\n *\n * @param ssrForceFetchDelay Determines the time interval before we force fetch queries for a\n * server side render.\n *\n * @param queryDeduplication If set to false, a query will still be sent to the server even if a query\n * with identical parameters (query, variables, operationName) is already in flight.\n *\n * @param defaultOptions Used to set application wide defaults for the\n * options supplied to `watchQuery`, `query`, or\n * `mutate`.\n *\n * @param assumeImmutableResults When this option is true, the client will assume results\n * read from the cache are never mutated by application code,\n * which enables substantial performance optimizations. Passing\n * `{ freezeResults: true }` to the `InMemoryCache` constructor\n * can help enforce this immutability.\n *\n * @param name A custom name that can be used to identify this client, when\n * using Apollo client awareness features. E.g. \"iOS\".\n *\n * @param version A custom version that can be used to identify this client,\n * when using Apollo client awareness features. This is the\n * version of your client, which you may want to increment on\n * new builds. This is NOT the version of Apollo Client that\n * you are using.\n */\n constructor(options: ApolloClientOptions<TCacheShape>) {\n const {\n uri,\n credentials,\n headers,\n cache,\n ssrMode = false,\n ssrForceFetchDelay = 0,\n connectToDevTools =\n // Expose the client instance as window.__APOLLO_CLIENT__ and call\n // onBroadcast in queryManager.broadcastQueries to enable browser\n // devtools, but disable them by default in production.\n typeof window === 'object' &&\n !(window as any).__APOLLO_CLIENT__ &&\n process.env.NODE_ENV !== 'production',\n queryDeduplication = true,\n defaultOptions,\n assumeImmutableResults = false,\n resolvers,\n typeDefs,\n fragmentMatcher,\n name: clientAwarenessName,\n version: clientAwarenessVersion,\n } = options;\n\n let { link } = options;\n\n if (!link) {\n link = uri\n ? new HttpLink({ uri, credentials, headers })\n : ApolloLink.empty();\n }\n\n if (!cache) {\n throw new InvariantError(\n \"To initialize Apollo Client, you must specify a 'cache' property \" +\n \"in the options object. \\n\" +\n \"For more information, please visit: https://go.apollo.dev/c/docs\"\n );\n }\n\n this.link = link;\n this.cache = cache;\n this.disableNetworkFetches = ssrMode || ssrForceFetchDelay > 0;\n this.queryDeduplication = queryDeduplication;\n this.defaultOptions = defaultOptions || {};\n this.typeDefs = typeDefs;\n\n if (ssrForceFetchDelay) {\n setTimeout(\n () => (this.disableNetworkFetches = false),\n ssrForceFetchDelay,\n );\n }\n\n this.watchQuery = this.watchQuery.bind(this);\n this.query = this.query.bind(this);\n this.mutate = this.mutate.bind(this);\n this.resetStore = this.resetStore.bind(this);\n this.reFetchObservableQueries = this.reFetchObservableQueries.bind(this);\n\n if (connectToDevTools && typeof window === 'object') {\n (window as any).__APOLLO_CLIENT__ = this;\n }\n\n /**\n * Suggest installing the devtools for developers who don't have them\n */\n if (!hasSuggestedDevtools && process.env.NODE_ENV !== 'production') {\n hasSuggestedDevtools = true;\n if (\n typeof window !== 'undefined' &&\n window.document &&\n window.top === window.self &&\n !(window as any).__APOLLO_DEVTOOLS_GLOBAL_HOOK__\n ) {\n const nav = window.navigator;\n const ua = nav && nav.userAgent;\n let url: string | undefined;\n if (typeof ua === \"string\") {\n if (ua.indexOf(\"Chrome/\") > -1) {\n url = \"https://chrome.google.com/webstore/detail/\" +\n \"apollo-client-developer-t/jdkknkkbebbapilgoeccciglkfbmbnfm\";\n } else if (ua.indexOf(\"Firefox/\") > -1) {\n url = \"https://addons.mozilla.org/en-US/firefox/addon/apollo-developer-tools/\";\n }\n }\n if (url) {\n invariant.log(\n \"Download the Apollo DevTools for a better development \" +\n \"experience: \" + url\n );\n }\n }\n }\n\n this.version = version;\n\n this.localState = new LocalState({\n cache,\n client: this,\n resolvers,\n fragmentMatcher,\n });\n\n this.queryManager = new QueryManager({\n cache: this.cache,\n link: this.link,\n queryDeduplication,\n ssrMode,\n clientAwareness: {\n name: clientAwarenessName!,\n version: clientAwarenessVersion!,\n },\n localState: this.localState,\n assumeImmutableResults,\n onBroadcast: connectToDevTools ? () => {\n if (this.devToolsHookCb) {\n this.devToolsHookCb({\n action: {},\n state: {\n queries: this.queryManager.getQueryStore(),\n mutations: this.queryManager.mutationStore || {},\n },\n dataWithOptimisticResults: this.cache.extract(true),\n });\n }\n } : void 0,\n });\n }\n\n /**\n * Call this method to terminate any active client processes, making it safe\n * to dispose of this `ApolloClient` instance.\n */\n public stop() {\n this.queryManager.stop();\n }\n\n /**\n * This watches the cache store of the query according to the options specified and\n * returns an {@link ObservableQuery}. We can subscribe to this {@link ObservableQuery} and\n * receive updated results through a GraphQL observer when the cache store changes.\n * <p /><p />\n * Note that this method is not an implementation of GraphQL subscriptions. Rather,\n * it uses Apollo's store in order to reactively deliver updates to your query results.\n * <p /><p />\n * For example, suppose you call watchQuery on a GraphQL query that fetches a person's\n * first and last name and this person has a particular object identifer, provided by\n * dataIdFromObject. Later, a different query fetches that same person's\n * first and last name and the first name has now changed. Then, any observers associated\n * with the results of the first query will be updated with a new result object.\n * <p /><p />\n * Note that if the cache does not change, the subscriber will *not* be notified.\n * <p /><p />\n * See [here](https://medium.com/apollo-stack/the-concepts-of-graphql-bc68bd819be3#.3mb0cbcmc) for\n * a description of store reactivity.\n */\n public watchQuery<T = any, TVariables = OperationVariables>(\n options: WatchQueryOptions<TVariables, T>,\n ): ObservableQuery<T, TVariables> {\n if (this.defaultOptions.watchQuery) {\n options = mergeOptions(this.defaultOptions.watchQuery, options);\n }\n\n // XXX Overwriting options is probably not the best way to do this long term...\n if (\n this.disableNetworkFetches &&\n (options.fetchPolicy === 'network-only' ||\n options.fetchPolicy === 'cache-and-network')\n ) {\n options = { ...options, fetchPolicy: 'cache-first' };\n }\n\n return this.queryManager.watchQuery<T, TVariables>(options);\n }\n\n /**\n * This resolves a single query according to the options specified and\n * returns a {@link Promise} which is either resolved with the resulting data\n * or rejected with an error.\n *\n * @param options An object of type {@link QueryOptions} that allows us to\n * describe how this query should be treated e.g. whether it should hit the\n * server at all or just resolve from the cache, etc.\n */\n public query<T = any, TVariables = OperationVariables>(\n options: QueryOptions<TVariables, T>,\n ): Promise<ApolloQueryResult<T>> {\n if (this.defaultOptions.query) {\n options = mergeOptions(this.defaultOptions.query, options);\n }\n\n invariant(\n (options.fetchPolicy as WatchQueryFetchPolicy) !== 'cache-and-network',\n 'The cache-and-network fetchPolicy does not work with client.query, because ' +\n 'client.query can only return a single result. Please use client.watchQuery ' +\n 'to receive multiple results from the cache and the network, or consider ' +\n 'using a different fetchPolicy, such as cache-first or network-only.'\n );\n\n if (this.disableNetworkFetches && options.fetchPolicy === 'network-only') {\n options = { ...options, fetchPolicy: 'cache-first' };\n }\n\n return this.queryManager.query<T, TVariables>(options);\n }\n\n /**\n * This resolves a single mutation according to the options specified and returns a\n * {@link Promise} which is either resolved with the resulting data or rejected with an\n * error.\n *\n * It takes options as an object with the following keys and values:\n */\n public mutate<T = any, TVariables = OperationVariables>(\n options: MutationOptions<T, TVariables>,\n ): Promise<FetchResult<T>> {\n if (this.defaultOptions.mutate) {\n options = mergeOptions(this.defaultOptions.mutate, options);\n }\n return this.queryManager.mutate<T>(options);\n }\n\n /**\n * This subscribes to a graphql subscription according to the options specified and returns an\n * {@link Observable} which either emits received data or an error.\n */\n public subscribe<T = any, TVariables = OperationVariables>(\n options: SubscriptionOptions<TVariables, T>,\n ): Observable<FetchResult<T>> {\n return this.queryManager.startGraphQLSubscription<T>(options);\n }\n\n /**\n * Tries to read some data from the store in the shape of the provided\n * GraphQL query without making a network request. This method will start at\n * the root query. To start at a specific id returned by `dataIdFromObject`\n * use `readFragment`.\n *\n * @param optimistic Set to `true` to allow `readQuery` to return\n * optimistic results. Is `false` by default.\n */\n public readQuery<T = any, TVariables = OperationVariables>(\n options: DataProxy.Query<TVariables, T>,\n optimistic: boolean = false,\n ): T | null {\n return this.cache.readQuery<T, TVariables>(options, optimistic);\n }\n\n /**\n * Tries to read some data from the store in the shape of the provided\n * GraphQL fragment without making a network request. This method will read a\n * GraphQL fragment from any arbitrary id that is currently cached, unlike\n * `readQuery` which will only read from the root query.\n *\n * You must pass in a GraphQL document with a single fragment or a document\n * with multiple fragments that represent what you are reading. If you pass\n * in a document with multiple fragments then you must also specify a\n * `fragmentName`.\n *\n * @param optimistic Set to `true` to allow `readFragment` to return\n * optimistic results. Is `false` by default.\n */\n public readFragment<T = any, TVariables = OperationVariables>(\n options: DataProxy.Fragment<TVariables, T>,\n optimistic: boolean = false,\n ): T | null {\n return this.cache.readFragment<T, TVariables>(options, optimistic);\n }\n\n /**\n * Writes some data in the shape of the provided GraphQL query directly to\n * the store. This method will start at the root query. To start at a\n * specific id returned by `dataIdFromObject` then use `writeFragment`.\n */\n public writeQuery<TData = any, TVariables = OperationVariables>(\n options: DataProxy.WriteQueryOptions<TData, TVariables>,\n ): void {\n this.cache.writeQuery<TData, TVariables>(options);\n this.queryManager.broadcastQueries();\n }\n\n /**\n * Writes some data in the shape of the provided GraphQL fragment directly to\n * the store. This method will write to a GraphQL fragment from any arbitrary\n * id that is currently cached, unlike `writeQuery` which will only write\n * from the root query.\n *\n * You must pass in a GraphQL document with a single fragment or a document\n * with multiple fragments that represent what you are writing. If you pass\n * in a document with multiple fragments then you must also specify a\n * `fragmentName`.\n */\n public writeFragment<TData = any, TVariables = OperationVariables>(\n options: DataProxy.WriteFragmentOptions<TData, TVariables>,\n ): void {\n this.cache.writeFragment<TData, TVariables>(options);\n this.queryManager.broadcastQueries();\n }\n\n public __actionHookForDevTools(cb: () => any) {\n this.devToolsHookCb = cb;\n }\n\n public __requestRaw(payload: GraphQLRequest): Observable<ExecutionResult> {\n return execute(this.link, payload);\n }\n\n /**\n * Resets your entire store by clearing out your cache and then re-executing\n * all of your active queries. This makes it so that you may guarantee that\n * there is no data left in your store from a time before you called this\n * method.\n *\n * `resetStore()` is useful when your user just logged out. You\u2019ve removed the\n * user session, and you now want to make sure that any references to data you\n * might have fetched while the user session was active is gone.\n *\n * It is important to remember that `resetStore()` *will* refetch any active\n * queries. This means that any components that might be mounted will execute\n * their queries again using your network interface. If you do not want to\n * re-execute any queries then you should make sure to stop watching any\n * active queries.\n */\n public resetStore(): Promise<ApolloQueryResult<any>[] | null> {\n return Promise.resolve()\n .then(() => this.queryManager.clearStore())\n .then(() => Promise.all(this.resetStoreCallbacks.map(fn => fn())))\n .then(() => this.reFetchObservableQueries());\n }\n\n /**\n * Remove all data from the store. Unlike `resetStore`, `clearStore` will\n * not refetch any active queries.\n */\n public clearStore(): Promise<any[]> {\n return Promise.resolve()\n .then(() => this.queryManager.clearStore())\n .then(() => Promise.all(this.clearStoreCallbacks.map(fn => fn())));\n }\n\n /**\n * Allows callbacks to be registered that are executed when the store is\n * reset. `onResetStore` returns an unsubscribe function that can be used\n * to remove registered callbacks.\n */\n public onResetStore(cb: () => Promise<any>): () => void {\n this.resetStoreCallbacks.push(cb);\n return () => {\n this.resetStoreCallbacks = this.resetStoreCallbacks.filter(c => c !== cb);\n };\n }\n\n /**\n * Allows callbacks to be registered that are executed when the store is\n * cleared. `onClearStore` returns an unsubscribe function that can be used\n * to remove registered callbacks.\n */\n public onClearStore(cb: () => Promise<any>): () => void {\n this.clearStoreCallbacks.push(cb);\n return () => {\n this.clearStoreCallbacks = this.clearStoreCallbacks.filter(c => c !== cb);\n };\n }\n\n /**\n * Refetches all of your active queries.\n *\n * `reFetchObservableQueries()` is useful if you want to bring the client back to proper state in case of a network outage\n *\n * It is important to remember that `reFetchObservableQueries()` *will* refetch any active\n * queries. This means that any components that might be mounted will execute\n * their queries again using your network interface. If you do not want to\n * re-execute any queries then you should make sure to stop watching any\n * active queries.\n * Takes optional parameter `includeStandby` which will include queries in standby-mode when refetching.\n */\n public reFetchObservableQueries(\n includeStandby?: boolean,\n ): Promise<ApolloQueryResult<any>[]> {\n return this.queryManager.reFetchObservableQueries(includeStandby);\n }\n\n /**\n * Exposes the cache's complete state, in a serializable format for later restoration.\n */\n public extract(optimistic?: boolean): TCacheShape {\n return this.cache.extract(optimistic);\n }\n\n /**\n * Replaces existing state in the cache (if any) with the values expressed by\n * `serializedState`.\n *\n * Called when hydrating a cache (server side rendering, or offline storage),\n * and also (potentially) during hot reloads.\n */\n public restore(serializedState: TCacheShape): ApolloCache<TCacheShape> {\n return this.cache.restore(serializedState);\n }\n\n /**\n * Add additional local resolvers.\n */\n public addResolvers(resolvers: Resolvers | Resolvers[]) {\n this.localState.addResolvers(resolvers);\n }\n\n /**\n * Set (override existing) local resolvers.\n */\n public setResolvers(resolvers: Resolvers | Resolvers[]) {\n this.localState.setResolvers(resolvers);\n }\n\n /**\n * Get all registered local resolvers.\n */\n public getResolvers() {\n return this.localState.getResolvers();\n }\n\n /**\n * Set a custom local state fragment matcher.\n */\n public setLocalStateFragmentMatcher(fragmentMatcher: FragmentMatcher) {\n this.localState.setFragmentMatcher(fragmentMatcher);\n }\n\n /**\n * Define a new ApolloLink (or link chain) that Apollo Client will use.\n */\n public setLink(newLink: ApolloLink) {\n this.link = this.queryManager.link = newLink;\n }\n}\n", "import tslib from '../tslib.js';\r\nconst {\r\n __extends,\r\n __assign,\r\n __rest,\r\n __decorate,\r\n __param,\r\n __metadata,\r\n __awaiter,\r\n __generator,\r\n __exportStar,\r\n __createBinding,\r\n __values,\r\n __read,\r\n __spread,\r\n __spreadArrays,\r\n __spreadArray,\r\n __await,\r\n __asyncGenerator,\r\n __asyncDelegator,\r\n __asyncValues,\r\n __makeTemplateObject,\r\n __importStar,\r\n __importDefault,\r\n __classPrivateFieldGet,\r\n __classPrivateFieldSet,\r\n} = tslib;\r\nexport {\r\n __extends,\r\n __assign,\r\n __rest,\r\n __decorate,\r\n __param,\r\n __metadata,\r\n __awaiter,\r\n __generator,\r\n __exportStar,\r\n __createBinding,\r\n __values,\r\n __read,\r\n __spread,\r\n __spreadArrays,\r\n __spreadArray,\r\n __await,\r\n __asyncGenerator,\r\n __asyncDelegator,\r\n __asyncValues,\r\n __makeTemplateObject,\r\n __importStar,\r\n __importDefault,\r\n __classPrivateFieldGet,\r\n __classPrivateFieldSet,\r\n};\r\n", null, "/* Core */\n\nexport {\n ApolloClient,\n ApolloClientOptions,\n DefaultOptions,\n mergeOptions,\n} from './ApolloClient';\nexport {\n ObservableQuery,\n FetchMoreOptions,\n UpdateQueryOptions,\n} from './ObservableQuery';\nexport {\n QueryOptions,\n WatchQueryOptions,\n MutationOptions,\n SubscriptionOptions,\n FetchPolicy,\n WatchQueryFetchPolicy,\n ErrorPolicy,\n FetchMoreQueryOptions,\n SubscribeToMoreOptions,\n MutationUpdaterFn,\n} from './watchQueryOptions';\nexport { NetworkStatus } from './networkStatus';\nexport * from './types';\nexport {\n Resolver,\n FragmentMatcher,\n} from './LocalState';\nexport { isApolloError, ApolloError } from '../errors';\n\n/* Cache */\n\nexport {\n // All the exports (types and values) from ../cache, minus cacheSlot,\n // which we want to keep semi-private.\n Cache,\n ApolloCache,\n Transaction,\n DataProxy,\n InMemoryCache,\n InMemoryCacheConfig,\n MissingFieldError,\n defaultDataIdFromObject,\n ReactiveVar,\n makeVar,\n TypePolicies,\n TypePolicy,\n FieldPolicy,\n FieldReadFunction,\n FieldMergeFunction,\n FieldFunctionOptions,\n PossibleTypesMap,\n} from '../cache';\n\nexport * from '../cache/inmemory/types';\n\n/* Link */\n\nexport * from '../link/core';\nexport * from '../link/http';\nexport {\n fromError,\n toPromise,\n fromPromise,\n ServerError,\n throwServerError,\n} from '../link/utils';\n\n/* Utilities */\n\nexport {\n Observable,\n Observer,\n ObservableSubscription,\n Reference,\n isReference,\n makeReference,\n StoreObject,\n} from '../utilities';\n\n/* Supporting */\n\n// The verbosity of invariant.{log,warn,error} can be controlled globally\n// (for anyone using the same ts-invariant package) by passing \"log\",\n// \"warn\", \"error\", or \"silent\" to setVerbosity (\"log\" is the default).\n// Note that all invariant.* logging is hidden in production.\nimport { setVerbosity } from \"ts-invariant\";\nexport { setVerbosity as setLogVerbosity }\nsetVerbosity(\"log\");\n\n// Note that importing `gql` by itself, then destructuring\n// additional properties separately before exporting, is intentional.\n// Due to the way the `graphql-tag` library is setup, certain bundlers\n// can't find the properties added to the exported `gql` function without\n// additional guidance (e.g. Rollup - see\n// https://rollupjs.org/guide/en/#error-name-is-not-exported-by-module).\n// Instead of having people that are using bundlers with `@apollo/client` add\n// extra bundler config to help `graphql-tag` exports be found (which would be\n// awkward since they aren't importing `graphql-tag` themselves), this\n// workaround of pulling the extra properties off the `gql` function,\n// then re-exporting them separately, helps keeps bundlers happy without any\n// additional config changes.\nexport {\n default as gql,\n resetCaches,\n disableFragmentWarnings,\n enableExperimentalFragmentVariables,\n disableExperimentalFragmentVariables,\n} from 'graphql-tag';\n"],
"mappings": ";;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAgBA,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,IAAC,UAAU,SAAS;AAChB,UAAI,QAAO,OAAO,WAAW,WAAW,SAAS,OAAO,SAAS,WAAW,OAAO,OAAO,SAAS,WAAW,OAAO;AACrH,UAAI,OAAO,WAAW,cAAc,OAAO,KAAK;AAC5C,eAAO,SAAS,CAAC,YAAY,SAAU,UAAS;AAAE,kBAAQ,eAAe,OAAM,eAAe;AAAA;AAAA,iBAEzF,OAAO,YAAW,YAAY,OAAO,QAAO,YAAY,UAAU;AACvE,gBAAQ,eAAe,OAAM,eAAe,QAAO;AAAA,aAElD;AACD,gBAAQ,eAAe;AAAA;AAE3B,8BAAwB,UAAS,UAAU;AACvC,YAAI,aAAY,OAAM;AAClB,cAAI,OAAO,OAAO,WAAW,YAAY;AACrC,mBAAO,eAAe,UAAS,cAAc,EAAE,OAAO;AAAA,iBAErD;AACD,qBAAQ,aAAa;AAAA;AAAA;AAG7B,eAAO,SAAU,IAAI,GAAG;AAAE,iBAAO,SAAQ,MAAM,WAAW,SAAS,IAAI,KAAK;AAAA;AAAA;AAAA,OAGnF,SAAU,UAAU;AACjB,UAAI,gBAAgB,OAAO,kBACtB,EAAE,WAAW,gBAAgB,SAAS,SAAU,GAAG,GAAG;AAAE,UAAE,YAAY;AAAA,WACvE,SAAU,GAAG,GAAG;AAAE,iBAAS,KAAK;AAAG,cAAI,EAAE,eAAe;AAAI,cAAE,KAAK,EAAE;AAAA;AAEzE,mBAAY,SAAU,GAAG,GAAG;AACxB,sBAAc,GAAG;AACjB,sBAAc;AAAE,eAAK,cAAc;AAAA;AACnC,UAAE,YAAY,MAAM,OAAO,OAAO,OAAO,KAAM,IAAG,YAAY,EAAE,WAAW,IAAI;AAAA;AAGnF,kBAAW,OAAO,UAAU,SAAU,GAAG;AACrC,iBAAS,GAAG,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AACjD,cAAI,UAAU;AACd,mBAAS,KAAK;AAAG,gBAAI,OAAO,UAAU,eAAe,KAAK,GAAG;AAAI,gBAAE,KAAK,EAAE;AAAA;AAE9E,eAAO;AAAA;AAGX,gBAAS,SAAU,GAAG,GAAG;AACrB,YAAI,IAAI;AACR,iBAAS,KAAK;AAAG,cAAI,OAAO,UAAU,eAAe,KAAK,GAAG,MAAM,EAAE,QAAQ,KAAK;AAC9E,cAAE,KAAK,EAAE;AACb,YAAI,KAAK,QAAQ,OAAO,OAAO,0BAA0B;AACrD,mBAAS,IAAI,GAAG,IAAI,OAAO,sBAAsB,IAAI,IAAI,EAAE,QAAQ,KAAK;AACpE,gBAAI,EAAE,QAAQ,EAAE,MAAM,KAAK,OAAO,UAAU,qBAAqB,KAAK,GAAG,EAAE;AACvE,gBAAE,EAAE,MAAM,EAAE,EAAE;AAAA;AAE1B,eAAO;AAAA;AAGX,oBAAa,SAAU,YAAY,QAAQ,KAAK,MAAM;AAClD,YAAI,IAAI,UAAU,QAAQ,IAAI,IAAI,IAAI,SAAS,SAAS,OAAO,OAAO,OAAO,yBAAyB,QAAQ,OAAO,MAAM;AAC3H,YAAI,OAAO,YAAY,YAAY,OAAO,QAAQ,aAAa;AAAY,cAAI,QAAQ,SAAS,YAAY,QAAQ,KAAK;AAAA;AACpH,mBAAS,IAAI,WAAW,SAAS,GAAG,KAAK,GAAG;AAAK,gBAAI,IAAI,WAAW;AAAI,kBAAK,KAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,QAAQ,KAAK,KAAK,EAAE,QAAQ,SAAS;AAChJ,eAAO,IAAI,KAAK,KAAK,OAAO,eAAe,QAAQ,KAAK,IAAI;AAAA;AAGhE,iBAAU,SAAU,YAAY,WAAW;AACvC,eAAO,SAAU,QAAQ,KAAK;AAAE,oBAAU,QAAQ,KAAK;AAAA;AAAA;AAG3D,oBAAa,SAAU,aAAa,eAAe;AAC/C,YAAI,OAAO,YAAY,YAAY,OAAO,QAAQ,aAAa;AAAY,iBAAO,QAAQ,SAAS,aAAa;AAAA;AAGpH,mBAAY,SAAU,SAAS,YAAY,GAAG,WAAW;AACrD,uBAAe,OAAO;AAAE,iBAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU,SAAS;AAAE,oBAAQ;AAAA;AAAA;AAC/F,eAAO,IAAK,MAAM,KAAI,UAAU,SAAU,SAAS,QAAQ;AACvD,6BAAmB,OAAO;AAAE,gBAAI;AAAE,mBAAK,UAAU,KAAK;AAAA,qBAAkB,GAAP;AAAY,qBAAO;AAAA;AAAA;AACpF,4BAAkB,OAAO;AAAE,gBAAI;AAAE,mBAAK,UAAU,SAAS;AAAA,qBAAkB,GAAP;AAAY,qBAAO;AAAA;AAAA;AACvF,wBAAc,SAAQ;AAAE,oBAAO,OAAO,QAAQ,QAAO,SAAS,MAAM,QAAO,OAAO,KAAK,WAAW;AAAA;AAClG,eAAM,aAAY,UAAU,MAAM,SAAS,cAAc,KAAK;AAAA;AAAA;AAItE,qBAAc,SAAU,SAAS,MAAM;AACnC,YAAI,IAAI,EAAE,OAAO,GAAG,MAAM,WAAW;AAAE,cAAI,EAAE,KAAK;AAAG,kBAAM,EAAE;AAAI,iBAAO,EAAE;AAAA,WAAO,MAAM,IAAI,KAAK,MAAM,GAAG,GAAG,GAAG;AAC/G,eAAO,IAAI,EAAE,MAAM,KAAK,IAAI,SAAS,KAAK,IAAI,UAAU,KAAK,MAAM,OAAO,WAAW,cAAe,GAAE,OAAO,YAAY,WAAW;AAAE,iBAAO;AAAA,YAAU;AACvJ,sBAAc,GAAG;AAAE,iBAAO,SAAU,GAAG;AAAE,mBAAO,KAAK,CAAC,GAAG;AAAA;AAAA;AACzD,sBAAc,IAAI;AACd,cAAI;AAAG,kBAAM,IAAI,UAAU;AAC3B,iBAAO;AAAG,gBAAI;AACV,kBAAI,IAAI,GAAG,KAAM,KAAI,GAAG,KAAK,IAAI,EAAE,YAAY,GAAG,KAAK,EAAE,YAAc,MAAI,EAAE,cAAc,EAAE,KAAK,IAAI,KAAK,EAAE,SAAS,CAAE,KAAI,EAAE,KAAK,GAAG,GAAG,KAAK;AAAM,uBAAO;AAC3J,kBAAI,IAAI,GAAG;AAAG,qBAAK,CAAC,GAAG,KAAK,GAAG,EAAE;AACjC,sBAAQ,GAAG;AAAA,qBACF;AAAA,qBAAQ;AAAG,sBAAI;AAAI;AAAA,qBACnB;AAAG,oBAAE;AAAS,yBAAO,EAAE,OAAO,GAAG,IAAI,MAAM;AAAA,qBAC3C;AAAG,oBAAE;AAAS,sBAAI,GAAG;AAAI,uBAAK,CAAC;AAAI;AAAA,qBACnC;AAAG,uBAAK,EAAE,IAAI;AAAO,oBAAE,KAAK;AAAO;AAAA;AAEpC,sBAAI,CAAE,KAAI,EAAE,MAAM,IAAI,EAAE,SAAS,KAAK,EAAE,EAAE,SAAS,OAAQ,IAAG,OAAO,KAAK,GAAG,OAAO,IAAI;AAAE,wBAAI;AAAG;AAAA;AACjG,sBAAI,GAAG,OAAO,KAAM,EAAC,KAAM,GAAG,KAAK,EAAE,MAAM,GAAG,KAAK,EAAE,KAAM;AAAE,sBAAE,QAAQ,GAAG;AAAI;AAAA;AAC9E,sBAAI,GAAG,OAAO,KAAK,EAAE,QAAQ,EAAE,IAAI;AAAE,sBAAE,QAAQ,EAAE;AAAI,wBAAI;AAAI;AAAA;AAC7D,sBAAI,KAAK,EAAE,QAAQ,EAAE,IAAI;AAAE,sBAAE,QAAQ,EAAE;AAAI,sBAAE,IAAI,KAAK;AAAK;AAAA;AAC3D,sBAAI,EAAE;AAAI,sBAAE,IAAI;AAChB,oBAAE,KAAK;AAAO;AAAA;AAEtB,mBAAK,KAAK,KAAK,SAAS;AAAA,qBACnB,GAAP;AAAY,mBAAK,CAAC,GAAG;AAAI,kBAAI;AAAA,sBAAK;AAAU,kBAAI,IAAI;AAAA;AACtD,cAAI,GAAG,KAAK;AAAG,kBAAM,GAAG;AAAI,iBAAO,EAAE,OAAO,GAAG,KAAK,GAAG,KAAK,QAAQ,MAAM;AAAA;AAAA;AAIlF,yBAAkB,SAAS,GAAG,GAAG,GAAG,IAAI;AACpC,YAAI,OAAO;AAAW,eAAK;AAC3B,UAAE,MAAM,EAAE;AAAA;AAGd,sBAAe,SAAU,GAAG,UAAS;AACjC,iBAAS,KAAK;AAAG,cAAI,MAAM,aAAa,CAAC,SAAQ,eAAe;AAAI,qBAAQ,KAAK,EAAE;AAAA;AAGvF,kBAAW,SAAU,GAAG;AACpB,YAAI,IAAI,OAAO,WAAW,cAAc,OAAO,UAAU,IAAI,KAAK,EAAE,IAAI,IAAI;AAC5E,YAAI;AAAG,iBAAO,EAAE,KAAK;AACrB,YAAI,KAAK,OAAO,EAAE,WAAW;AAAU,iBAAO;AAAA,YAC1C,MAAM,WAAY;AACd,kBAAI,KAAK,KAAK,EAAE;AAAQ,oBAAI;AAC5B,qBAAO,EAAE,OAAO,KAAK,EAAE,MAAM,MAAM,CAAC;AAAA;AAAA;AAG5C,cAAM,IAAI,UAAU,IAAI,4BAA4B;AAAA;AAGxD,gBAAS,SAAU,GAAG,GAAG;AACrB,YAAI,IAAI,OAAO,WAAW,cAAc,EAAE,OAAO;AACjD,YAAI,CAAC;AAAG,iBAAO;AACf,YAAI,IAAI,EAAE,KAAK,IAAI,GAAG,KAAK,IAAI;AAC/B,YAAI;AACA,iBAAQ,OAAM,UAAU,MAAM,MAAM,CAAE,KAAI,EAAE,QAAQ;AAAM,eAAG,KAAK,EAAE;AAAA,iBAEjE,OAAP;AAAgB,cAAI,EAAE;AAAA,kBACtB;AACI,cAAI;AACA,gBAAI,KAAK,CAAC,EAAE,QAAS,KAAI,EAAE;AAAY,gBAAE,KAAK;AAAA,oBAElD;AAAU,gBAAI;AAAG,oBAAM,EAAE;AAAA;AAAA;AAE7B,eAAO;AAAA;AAGX,kBAAW,WAAY;AACnB,iBAAS,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ;AAC3C,eAAK,GAAG,OAAO,QAAO,UAAU;AACpC,eAAO;AAAA;AAGX,wBAAiB,WAAY;AACzB,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK,UAAU,QAAQ,IAAI,IAAI;AAAK,eAAK,UAAU,GAAG;AAC7E,iBAAS,IAAI,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI;AACzC,mBAAS,IAAI,UAAU,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,IAAI,IAAI,KAAK;AAC1D,cAAE,KAAK,EAAE;AACjB,eAAO;AAAA;AAGX,iBAAU,SAAU,GAAG;AACnB,eAAO,gBAAgB,WAAW,MAAK,IAAI,GAAG,QAAQ,IAAI,SAAQ;AAAA;AAGtE,0BAAmB,SAAU,SAAS,YAAY,WAAW;AACzD,YAAI,CAAC,OAAO;AAAe,gBAAM,IAAI,UAAU;AAC/C,YAAI,IAAI,UAAU,MAAM,SAAS,cAAc,KAAK,GAAG,IAAI;AAC3D,eAAO,IAAI,IAAI,KAAK,SAAS,KAAK,UAAU,KAAK,WAAW,EAAE,OAAO,iBAAiB,WAAY;AAAE,iBAAO;AAAA,WAAS;AACpH,sBAAc,GAAG;AAAE,cAAI,EAAE;AAAI,cAAE,KAAK,SAAU,GAAG;AAAE,qBAAO,IAAI,QAAQ,SAAU,GAAG,GAAG;AAAE,kBAAE,KAAK,CAAC,GAAG,GAAG,GAAG,MAAM,KAAK,OAAO,GAAG;AAAA;AAAA;AAAA;AAC9H,wBAAgB,GAAG,GAAG;AAAE,cAAI;AAAE,iBAAK,EAAE,GAAG;AAAA,mBAAc,GAAP;AAAY,mBAAO,EAAE,GAAG,IAAI;AAAA;AAAA;AAC3E,sBAAc,GAAG;AAAE,YAAE,iBAAiB,WAAU,QAAQ,QAAQ,EAAE,MAAM,GAAG,KAAK,SAAS,UAAU,OAAO,EAAE,GAAG,IAAI;AAAA;AACnH,yBAAiB,OAAO;AAAE,iBAAO,QAAQ;AAAA;AACzC,wBAAgB,OAAO;AAAE,iBAAO,SAAS;AAAA;AACzC,wBAAgB,GAAG,GAAG;AAAE,cAAI,EAAE,IAAI,EAAE,SAAS,EAAE;AAAQ,mBAAO,EAAE,GAAG,IAAI,EAAE,GAAG;AAAA;AAAA;AAGhF,0BAAmB,SAAU,GAAG;AAC5B,YAAI,GAAG;AACP,eAAO,IAAI,IAAI,KAAK,SAAS,KAAK,SAAS,SAAU,GAAG;AAAE,gBAAM;AAAA,YAAO,KAAK,WAAW,EAAE,OAAO,YAAY,WAAY;AAAE,iBAAO;AAAA,WAAS;AAC1I,sBAAc,GAAG,GAAG;AAAE,YAAE,KAAK,EAAE,KAAK,SAAU,GAAG;AAAE,mBAAQ,KAAI,CAAC,KAAK,EAAE,OAAO,SAAQ,EAAE,GAAG,KAAK,MAAM,MAAM,aAAa,IAAI,EAAE,KAAK;AAAA,cAAO;AAAA;AAAA;AAG/I,uBAAgB,SAAU,GAAG;AACzB,YAAI,CAAC,OAAO;AAAe,gBAAM,IAAI,UAAU;AAC/C,YAAI,IAAI,EAAE,OAAO,gBAAgB;AACjC,eAAO,IAAI,EAAE,KAAK,KAAM,KAAI,OAAO,cAAa,aAAa,UAAS,KAAK,EAAE,OAAO,aAAa,IAAI,IAAI,KAAK,SAAS,KAAK,UAAU,KAAK,WAAW,EAAE,OAAO,iBAAiB,WAAY;AAAE,iBAAO;AAAA,WAAS;AAC9M,sBAAc,GAAG;AAAE,YAAE,KAAK,EAAE,MAAM,SAAU,GAAG;AAAE,mBAAO,IAAI,QAAQ,SAAU,SAAS,QAAQ;AAAE,kBAAI,EAAE,GAAG,IAAI,OAAO,SAAS,QAAQ,EAAE,MAAM,EAAE;AAAA;AAAA;AAAA;AAChJ,wBAAgB,SAAS,QAAQ,GAAG,GAAG;AAAE,kBAAQ,QAAQ,GAAG,KAAK,SAAS,IAAG;AAAE,oBAAQ,EAAE,OAAO,IAAG,MAAM;AAAA,aAAS;AAAA;AAAA;AAGtH,8BAAuB,SAAU,QAAQ,KAAK;AAC1C,YAAI,OAAO,gBAAgB;AAAE,iBAAO,eAAe,QAAQ,OAAO,EAAE,OAAO;AAAA,eAAe;AAAE,iBAAO,MAAM;AAAA;AACzG,eAAO;AAAA;AAGX,sBAAe,SAAU,KAAK;AAC1B,YAAI,OAAO,IAAI;AAAY,iBAAO;AAClC,YAAI,UAAS;AACb,YAAI,OAAO;AAAM,mBAAS,KAAK;AAAK,gBAAI,OAAO,eAAe,KAAK,KAAK;AAAI,sBAAO,KAAK,IAAI;AAAA;AAC5F,gBAAO,aAAa;AACpB,eAAO;AAAA;AAGX,yBAAkB,SAAU,KAAK;AAC7B,eAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW;AAAA;AAGxD,gCAAyB,SAAU,UAAU,YAAY;AACrD,YAAI,CAAC,WAAW,IAAI,WAAW;AAC3B,gBAAM,IAAI,UAAU;AAAA;AAExB,eAAO,WAAW,IAAI;AAAA;AAG1B,gCAAyB,SAAU,UAAU,YAAY,OAAO;AAC5D,YAAI,CAAC,WAAW,IAAI,WAAW;AAC3B,gBAAM,IAAI,UAAU;AAAA;AAExB,mBAAW,IAAI,UAAU;AACzB,eAAO;AAAA;AAGX,eAAS,aAAa;AACtB,eAAS,YAAY;AACrB,eAAS,UAAU;AACnB,eAAS,cAAc;AACvB,eAAS,WAAW;AACpB,eAAS,cAAc;AACvB,eAAS,aAAa;AACtB,eAAS,eAAe;AACxB,eAAS,gBAAgB;AACzB,eAAS,mBAAmB;AAC5B,eAAS,YAAY;AACrB,eAAS,UAAU;AACnB,eAAS,YAAY;AACrB,eAAS,kBAAkB;AAC3B,eAAS,WAAW;AACpB,eAAS,oBAAoB;AAC7B,eAAS,oBAAoB;AAC7B,eAAS,iBAAiB;AAC1B,eAAS,wBAAwB;AACjC,eAAS,gBAAgB;AACzB,eAAS,mBAAmB;AAC5B,eAAS,0BAA0B;AACnC,eAAS,0BAA0B;AAAA;AAAA;AAAA;;;AC1RvC;AAAA;AAeA,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,IAAC,UAAU,SAAS;AAChB,UAAI,QAAO,OAAO,WAAW,WAAW,SAAS,OAAO,SAAS,WAAW,OAAO,OAAO,SAAS,WAAW,OAAO;AACrH,UAAI,OAAO,WAAW,cAAc,OAAO,KAAK;AAC5C,eAAO,SAAS,CAAC,YAAY,SAAU,UAAS;AAAE,kBAAQ,eAAe,OAAM,eAAe;AAAA;AAAA,iBAEzF,OAAO,YAAW,YAAY,OAAO,QAAO,YAAY,UAAU;AACvE,gBAAQ,eAAe,OAAM,eAAe,QAAO;AAAA,aAElD;AACD,gBAAQ,eAAe;AAAA;AAE3B,8BAAwB,UAAS,UAAU;AACvC,YAAI,aAAY,OAAM;AAClB,cAAI,OAAO,OAAO,WAAW,YAAY;AACrC,mBAAO,eAAe,UAAS,cAAc,EAAE,OAAO;AAAA,iBAErD;AACD,qBAAQ,aAAa;AAAA;AAAA;AAG7B,eAAO,SAAU,IAAI,GAAG;AAAE,iBAAO,SAAQ,MAAM,WAAW,SAAS,IAAI,KAAK;AAAA;AAAA;AAAA,OAGnF,SAAU,UAAU;AACjB,UAAI,gBAAgB,OAAO,kBACtB,EAAE,WAAW,gBAAgB,SAAS,SAAU,GAAG,GAAG;AAAE,UAAE,YAAY;AAAA,WACvE,SAAU,GAAG,GAAG;AAAE,iBAAS,KAAK;AAAG,cAAI,OAAO,UAAU,eAAe,KAAK,GAAG;AAAI,cAAE,KAAK,EAAE;AAAA;AAEhG,mBAAY,SAAU,GAAG,GAAG;AACxB,YAAI,OAAO,MAAM,cAAc,MAAM;AACjC,gBAAM,IAAI,UAAU,yBAAyB,OAAO,KAAK;AAC7D,sBAAc,GAAG;AACjB,sBAAc;AAAE,eAAK,cAAc;AAAA;AACnC,UAAE,YAAY,MAAM,OAAO,OAAO,OAAO,KAAM,IAAG,YAAY,EAAE,WAAW,IAAI;AAAA;AAGnF,kBAAW,OAAO,UAAU,SAAU,GAAG;AACrC,iBAAS,GAAG,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AACjD,cAAI,UAAU;AACd,mBAAS,KAAK;AAAG,gBAAI,OAAO,UAAU,eAAe,KAAK,GAAG;AAAI,gBAAE,KAAK,EAAE;AAAA;AAE9E,eAAO;AAAA;AAGX,gBAAS,SAAU,GAAG,GAAG;AACrB,YAAI,IAAI;AACR,iBAAS,KAAK;AAAG,cAAI,OAAO,UAAU,eAAe,KAAK,GAAG,MAAM,EAAE,QAAQ,KAAK;AAC9E,cAAE,KAAK,EAAE;AACb,YAAI,KAAK,QAAQ,OAAO,OAAO,0BAA0B;AACrD,mBAAS,IAAI,GAAG,IAAI,OAAO,sBAAsB,IAAI,IAAI,EAAE,QAAQ,KAAK;AACpE,gBAAI,EAAE,QAAQ,EAAE,MAAM,KAAK,OAAO,UAAU,qBAAqB,KAAK,GAAG,EAAE;AACvE,gBAAE,EAAE,MAAM,EAAE,EAAE;AAAA;AAE1B,eAAO;AAAA;AAGX,oBAAa,SAAU,YAAY,QAAQ,KAAK,MAAM;AAClD,YAAI,IAAI,UAAU,QAAQ,IAAI,IAAI,IAAI,SAAS,SAAS,OAAO,OAAO,OAAO,yBAAyB,QAAQ,OAAO,MAAM;AAC3H,YAAI,OAAO,YAAY,YAAY,OAAO,QAAQ,aAAa;AAAY,cAAI,QAAQ,SAAS,YAAY,QAAQ,KAAK;AAAA;AACpH,mBAAS,IAAI,WAAW,SAAS,GAAG,KAAK,GAAG;AAAK,gBAAI,IAAI,WAAW;AAAI,kBAAK,KAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,QAAQ,KAAK,KAAK,EAAE,QAAQ,SAAS;AAChJ,eAAO,IAAI,KAAK,KAAK,OAAO,eAAe,QAAQ,KAAK,IAAI;AAAA;AAGhE,iBAAU,SAAU,YAAY,WAAW;AACvC,eAAO,SAAU,QAAQ,KAAK;AAAE,oBAAU,QAAQ,KAAK;AAAA;AAAA;AAG3D,oBAAa,SAAU,aAAa,eAAe;AAC/C,YAAI,OAAO,YAAY,YAAY,OAAO,QAAQ,aAAa;AAAY,iBAAO,QAAQ,SAAS,aAAa;AAAA;AAGpH,mBAAY,SAAU,SAAS,YAAY,GAAG,WAAW;AACrD,uBAAe,OAAO;AAAE,iBAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU,SAAS;AAAE,oBAAQ;AAAA;AAAA;AAC/F,eAAO,IAAK,MAAM,KAAI,UAAU,SAAU,SAAS,QAAQ;AACvD,6BAAmB,OAAO;AAAE,gBAAI;AAAE,mBAAK,UAAU,KAAK;AAAA,qBAAkB,GAAP;AAAY,qBAAO;AAAA;AAAA;AACpF,4BAAkB,OAAO;AAAE,gBAAI;AAAE,mBAAK,UAAU,SAAS;AAAA,qBAAkB,GAAP;AAAY,qBAAO;AAAA;AAAA;AACvF,wBAAc,SAAQ;AAAE,oBAAO,OAAO,QAAQ,QAAO,SAAS,MAAM,QAAO,OAAO,KAAK,WAAW;AAAA;AAClG,eAAM,aAAY,UAAU,MAAM,SAAS,cAAc,KAAK;AAAA;AAAA;AAItE,qBAAc,SAAU,SAAS,MAAM;AACnC,YAAI,IAAI,EAAE,OAAO,GAAG,MAAM,WAAW;AAAE,cAAI,EAAE,KAAK;AAAG,kBAAM,EAAE;AAAI,iBAAO,EAAE;AAAA,WAAO,MAAM,IAAI,KAAK,MAAM,GAAG,GAAG,GAAG;AAC/G,eAAO,IAAI,EAAE,MAAM,KAAK,IAAI,SAAS,KAAK,IAAI,UAAU,KAAK,MAAM,OAAO,WAAW,cAAe,GAAE,OAAO,YAAY,WAAW;AAAE,iBAAO;AAAA,YAAU;AACvJ,sBAAc,GAAG;AAAE,iBAAO,SAAU,GAAG;AAAE,mBAAO,KAAK,CAAC,GAAG;AAAA;AAAA;AACzD,sBAAc,IAAI;AACd,cAAI;AAAG,kBAAM,IAAI,UAAU;AAC3B,iBAAO;AAAG,gBAAI;AACV,kBAAI,IAAI,GAAG,KAAM,KAAI,GAAG,KAAK,IAAI,EAAE,YAAY,GAAG,KAAK,EAAE,YAAc,MAAI,EAAE,cAAc,EAAE,KAAK,IAAI,KAAK,EAAE,SAAS,CAAE,KAAI,EAAE,KAAK,GAAG,GAAG,KAAK;AAAM,uBAAO;AAC3J,kBAAI,IAAI,GAAG;AAAG,qBAAK,CAAC,GAAG,KAAK,GAAG,EAAE;AACjC,sBAAQ,GAAG;AAAA,qBACF;AAAA,qBAAQ;AAAG,sBAAI;AAAI;AAAA,qBACnB;AAAG,oBAAE;AAAS,yBAAO,EAAE,OAAO,GAAG,IAAI,MAAM;AAAA,qBAC3C;AAAG,oBAAE;AAAS,sBAAI,GAAG;AAAI,uBAAK,CAAC;AAAI;AAAA,qBACnC;AAAG,uBAAK,EAAE,IAAI;AAAO,oBAAE,KAAK;AAAO;AAAA;AAEpC,sBAAI,CAAE,KAAI,EAAE,MAAM,IAAI,EAAE,SAAS,KAAK,EAAE,EAAE,SAAS,OAAQ,IAAG,OAAO,KAAK,GAAG,OAAO,IAAI;AAAE,wBAAI;AAAG;AAAA;AACjG,sBAAI,GAAG,OAAO,KAAM,EAAC,KAAM,GAAG,KAAK,EAAE,MAAM,GAAG,KAAK,EAAE,KAAM;AAAE,sBAAE,QAAQ,GAAG;AAAI;AAAA;AAC9E,sBAAI,GAAG,OAAO,KAAK,EAAE,QAAQ,EAAE,IAAI;AAAE,sBAAE,QAAQ,EAAE;AAAI,wBAAI;AAAI;AAAA;AAC7D,sBAAI,KAAK,EAAE,QAAQ,EAAE,IAAI;AAAE,sBAAE,QAAQ,EAAE;AAAI,sBAAE,IAAI,KAAK;AAAK;AAAA;AAC3D,sBAAI,EAAE;AAAI,sBAAE,IAAI;AAChB,oBAAE,KAAK;AAAO;AAAA;AAEtB,mBAAK,KAAK,KAAK,SAAS;AAAA,qBACnB,GAAP;AAAY,mBAAK,CAAC,GAAG;AAAI,kBAAI;AAAA,sBAAK;AAAU,kBAAI,IAAI;AAAA;AACtD,cAAI,GAAG,KAAK;AAAG,kBAAM,GAAG;AAAI,iBAAO,EAAE,OAAO,GAAG,KAAK,GAAG,KAAK,QAAQ,MAAM;AAAA;AAAA;AAIlF,sBAAe,SAAS,GAAG,GAAG;AAC1B,iBAAS,KAAK;AAAG,cAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAK,GAAG;AAAI,6BAAgB,GAAG,GAAG;AAAA;AAG/G,yBAAkB,OAAO,SAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AACrD,YAAI,OAAO;AAAW,eAAK;AAC3B,eAAO,eAAe,GAAG,IAAI,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE;AAAA;AAAA,UAC1E,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,YAAI,OAAO;AAAW,eAAK;AAC3B,UAAE,MAAM,EAAE;AAAA;AAGd,kBAAW,SAAU,GAAG;AACpB,YAAI,IAAI,OAAO,WAAW,cAAc,OAAO,UAAU,IAAI,KAAK,EAAE,IAAI,IAAI;AAC5E,YAAI;AAAG,iBAAO,EAAE,KAAK;AACrB,YAAI,KAAK,OAAO,EAAE,WAAW;AAAU,iBAAO;AAAA,YAC1C,MAAM,WAAY;AACd,kBAAI,KAAK,KAAK,EAAE;AAAQ,oBAAI;AAC5B,qBAAO,EAAE,OAAO,KAAK,EAAE,MAAM,MAAM,CAAC;AAAA;AAAA;AAG5C,cAAM,IAAI,UAAU,IAAI,4BAA4B;AAAA;AAGxD,gBAAS,SAAU,GAAG,GAAG;AACrB,YAAI,IAAI,OAAO,WAAW,cAAc,EAAE,OAAO;AACjD,YAAI,CAAC;AAAG,iBAAO;AACf,YAAI,IAAI,EAAE,KAAK,IAAI,GAAG,KAAK,IAAI;AAC/B,YAAI;AACA,iBAAQ,OAAM,UAAU,MAAM,MAAM,CAAE,KAAI,EAAE,QAAQ;AAAM,eAAG,KAAK,EAAE;AAAA,iBAEjE,OAAP;AAAgB,cAAI,EAAE;AAAA,kBACtB;AACI,cAAI;AACA,gBAAI,KAAK,CAAC,EAAE,QAAS,KAAI,EAAE;AAAY,gBAAE,KAAK;AAAA,oBAElD;AAAU,gBAAI;AAAG,oBAAM,EAAE;AAAA;AAAA;AAE7B,eAAO;AAAA;AAIX,kBAAW,WAAY;AACnB,iBAAS,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ;AAC3C,eAAK,GAAG,OAAO,QAAO,UAAU;AACpC,eAAO;AAAA;AAIX,wBAAiB,WAAY;AACzB,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK,UAAU,QAAQ,IAAI,IAAI;AAAK,eAAK,UAAU,GAAG;AAC7E,iBAAS,IAAI,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI;AACzC,mBAAS,IAAI,UAAU,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,IAAI,IAAI,KAAK;AAC1D,cAAE,KAAK,EAAE;AACjB,eAAO;AAAA;AAGX,uBAAgB,SAAU,IAAI,OAAM;AAChC,iBAAS,IAAI,GAAG,KAAK,MAAK,QAAQ,IAAI,GAAG,QAAQ,IAAI,IAAI,KAAK;AAC1D,aAAG,KAAK,MAAK;AACjB,eAAO;AAAA;AAGX,iBAAU,SAAU,GAAG;AACnB,eAAO,gBAAgB,WAAW,MAAK,IAAI,GAAG,QAAQ,IAAI,SAAQ;AAAA;AAGtE,0BAAmB,SAAU,SAAS,YAAY,WAAW;AACzD,YAAI,CAAC,OAAO;AAAe,gBAAM,IAAI,UAAU;AAC/C,YAAI,IAAI,UAAU,MAAM,SAAS,cAAc,KAAK,GAAG,IAAI;AAC3D,eAAO,IAAI,IAAI,KAAK,SAAS,KAAK,UAAU,KAAK,WAAW,EAAE,OAAO,iBAAiB,WAAY;AAAE,iBAAO;AAAA,WAAS;AACpH,sBAAc,GAAG;AAAE,cAAI,EAAE;AAAI,cAAE,KAAK,SAAU,GAAG;AAAE,qBAAO,IAAI,QAAQ,SAAU,GAAG,GAAG;AAAE,kBAAE,KAAK,CAAC,GAAG,GAAG,GAAG,MAAM,KAAK,OAAO,GAAG;AAAA;AAAA;AAAA;AAC9H,wBAAgB,GAAG,GAAG;AAAE,cAAI;AAAE,iBAAK,EAAE,GAAG;AAAA,mBAAc,GAAP;AAAY,mBAAO,EAAE,GAAG,IAAI;AAAA;AAAA;AAC3E,sBAAc,GAAG;AAAE,YAAE,iBAAiB,WAAU,QAAQ,QAAQ,EAAE,MAAM,GAAG,KAAK,SAAS,UAAU,OAAO,EAAE,GAAG,IAAI;AAAA;AACnH,yBAAiB,OAAO;AAAE,iBAAO,QAAQ;AAAA;AACzC,wBAAgB,OAAO;AAAE,iBAAO,SAAS;AAAA;AACzC,wBAAgB,GAAG,GAAG;AAAE,cAAI,EAAE,IAAI,EAAE,SAAS,EAAE;AAAQ,mBAAO,EAAE,GAAG,IAAI,EAAE,GAAG;AAAA;AAAA;AAGhF,0BAAmB,SAAU,GAAG;AAC5B,YAAI,GAAG;AACP,eAAO,IAAI,IAAI,KAAK,SAAS,KAAK,SAAS,SAAU,GAAG;AAAE,gBAAM;AAAA,YAAO,KAAK,WAAW,EAAE,OAAO,YAAY,WAAY;AAAE,iBAAO;AAAA,WAAS;AAC1I,sBAAc,GAAG,GAAG;AAAE,YAAE,KAAK,EAAE,KAAK,SAAU,GAAG;AAAE,mBAAQ,KAAI,CAAC,KAAK,EAAE,OAAO,SAAQ,EAAE,GAAG,KAAK,MAAM,MAAM,aAAa,IAAI,EAAE,KAAK;AAAA,cAAO;AAAA;AAAA;AAG/I,uBAAgB,SAAU,GAAG;AACzB,YAAI,CAAC,OAAO;AAAe,gBAAM,IAAI,UAAU;AAC/C,YAAI,IAAI,EAAE,OAAO,gBAAgB;AACjC,eAAO,IAAI,EAAE,KAAK,KAAM,KAAI,OAAO,cAAa,aAAa,UAAS,KAAK,EAAE,OAAO,aAAa,IAAI,IAAI,KAAK,SAAS,KAAK,UAAU,KAAK,WAAW,EAAE,OAAO,iBAAiB,WAAY;AAAE,iBAAO;AAAA,WAAS;AAC9M,sBAAc,GAAG;AAAE,YAAE,KAAK,EAAE,MAAM,SAAU,GAAG;AAAE,mBAAO,IAAI,QAAQ,SAAU,SAAS,QAAQ;AAAE,kBAAI,EAAE,GAAG,IAAI,OAAO,SAAS,QAAQ,EAAE,MAAM,EAAE;AAAA;AAAA;AAAA;AAChJ,wBAAgB,SAAS,QAAQ,GAAG,GAAG;AAAE,kBAAQ,QAAQ,GAAG,KAAK,SAAS,IAAG;AAAE,oBAAQ,EAAE,OAAO,IAAG,MAAM;AAAA,aAAS;AAAA;AAAA;AAGtH,8BAAuB,SAAU,QAAQ,KAAK;AAC1C,YAAI,OAAO,gBAAgB;AAAE,iBAAO,eAAe,QAAQ,OAAO,EAAE,OAAO;AAAA,eAAe;AAAE,iBAAO,MAAM;AAAA;AACzG,eAAO;AAAA;AAGX,UAAI,qBAAqB,OAAO,SAAU,SAAS,GAAG,GAAG;AACrD,eAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO;AAAA,UAC9D,SAAS,GAAG,GAAG;AAChB,UAAE,aAAa;AAAA;AAGnB,sBAAe,SAAU,KAAK;AAC1B,YAAI,OAAO,IAAI;AAAY,iBAAO;AAClC,YAAI,UAAS;AACb,YAAI,OAAO;AAAM,mBAAS,KAAK;AAAK,gBAAI,MAAM,aAAa,OAAO,UAAU,eAAe,KAAK,KAAK;AAAI,+BAAgB,SAAQ,KAAK;AAAA;AACtI,2BAAmB,SAAQ;AAC3B,eAAO;AAAA;AAGX,yBAAkB,SAAU,KAAK;AAC7B,eAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW;AAAA;AAGxD,gCAAyB,SAAU,UAAU,OAAO,MAAM,GAAG;AACzD,YAAI,SAAS,OAAO,CAAC;AAAG,gBAAM,IAAI,UAAU;AAC5C,YAAI,OAAO,UAAU,aAAa,aAAa,SAAS,CAAC,IAAI,CAAC,MAAM,IAAI;AAAW,gBAAM,IAAI,UAAU;AACvG,eAAO,SAAS,MAAM,IAAI,SAAS,MAAM,EAAE,KAAK,YAAY,IAAI,EAAE,QAAQ,MAAM,IAAI;AAAA;AAGxF,gCAAyB,SAAU,UAAU,OAAO,OAAO,MAAM,GAAG;AAChE,YAAI,SAAS;AAAK,gBAAM,IAAI,UAAU;AACtC,YAAI,SAAS,OAAO,CAAC;AAAG,gBAAM,IAAI,UAAU;AAC5C,YAAI,OAAO,UAAU,aAAa,aAAa,SAAS,CAAC,IAAI,CAAC,MAAM,IAAI;AAAW,gBAAM,IAAI,UAAU;AACvG,eAAQ,SAAS,MAAM,EAAE,KAAK,UAAU,SAAS,IAAI,EAAE,QAAQ,QAAQ,MAAM,IAAI,UAAU,QAAS;AAAA;AAGxG,eAAS,aAAa;AACtB,eAAS,YAAY;AACrB,eAAS,UAAU;AACnB,eAAS,cAAc;AACvB,eAAS,WAAW;AACpB,eAAS,cAAc;AACvB,eAAS,aAAa;AACtB,eAAS,eAAe;AACxB,eAAS,gBAAgB;AACzB,eAAS,mBAAmB;AAC5B,eAAS,YAAY;AACrB,eAAS,UAAU;AACnB,eAAS,YAAY;AACrB,eAAS,kBAAkB;AAC3B,eAAS,iBAAiB;AAC1B,eAAS,WAAW;AACpB,eAAS,oBAAoB;AAC7B,eAAS,oBAAoB;AAC7B,eAAS,iBAAiB;AAC1B,eAAS,wBAAwB;AACjC,eAAS,gBAAgB;AACzB,eAAS,mBAAmB;AAC5B,eAAS,0BAA0B;AACnC,eAAS,0BAA0B;AAAA;AAAA;AAAA;;;AC5SvC;AAAA;AAAA;AAEA,YAAO,UAAU,SAAU,MAAM,MAAM;AACnC,UAAI,CAAC;AAAM,eAAO;AAClB,UAAI,OAAO,SAAS;AAAY,eAAO,EAAE,KAAK;AAC9C,UAAI,SAAU,OAAO,KAAK,WAAW,YAAa,KAAK,SAAS;AAEhE,UAAI,MAAM,KAAK,OAAQ,SAAU,GAAG;AAChC,eAAO,SAAU,MAAM;AACnB,iBAAO,SAAU,GAAG,GAAG;AACnB,gBAAI,OAAO,EAAE,KAAK,GAAG,OAAO,KAAK;AACjC,gBAAI,OAAO,EAAE,KAAK,GAAG,OAAO,KAAK;AACjC,mBAAO,EAAE,MAAM;AAAA;AAAA;AAAA,QAGxB,KAAK;AAER,UAAI,OAAO;AACX,aAAQ,oBAAoB,MAAM;AAC9B,YAAI,QAAQ,KAAK,UAAU,OAAO,KAAK,WAAW,YAAY;AAC1D,iBAAO,KAAK;AAAA;AAGhB,YAAI,SAAS;AAAW;AACxB,YAAI,OAAO,QAAQ;AAAU,iBAAO,SAAS,QAAQ,KAAK,OAAO;AACjE,YAAI,OAAO,SAAS;AAAU,iBAAO,KAAK,UAAU;AAEpD,YAAI,GAAG;AACP,YAAI,MAAM,QAAQ,OAAO;AACrB,gBAAM;AACN,eAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAC9B,gBAAI;AAAG,qBAAO;AACd,mBAAO,WAAU,KAAK,OAAO;AAAA;AAEjC,iBAAO,MAAM;AAAA;AAGjB,YAAI,SAAS;AAAM,iBAAO;AAE1B,YAAI,KAAK,QAAQ,UAAU,IAAI;AAC3B,cAAI;AAAQ,mBAAO,KAAK,UAAU;AAClC,gBAAM,IAAI,UAAU;AAAA;AAGxB,YAAI,YAAY,KAAK,KAAK,QAAQ;AAClC,YAAI,OAAO,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI;AAC7C,cAAM;AACN,aAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAC9B,cAAI,MAAM,KAAK;AACf,cAAI,QAAQ,WAAU,KAAK;AAE3B,cAAI,CAAC;AAAO;AACZ,cAAI;AAAK,mBAAO;AAChB,iBAAO,KAAK,UAAU,OAAO,MAAM;AAAA;AAEvC,aAAK,OAAO,WAAW;AACvB,eAAO,MAAM,MAAM;AAAA,QACpB;AAAA;AAAA;AAAA;;;ACzDP;AAAA;AAAA;AAEA,WAAO,eAAe,SAAS,cAAc;AAAA,MAC3C,OAAO;AAAA;AAET,YAAQ,aAAa;AAErB,8BAAyB,UAAU,aAAa;AAAE,UAAI,CAAE,qBAAoB,cAAc;AAAE,cAAM,IAAI,UAAU;AAAA;AAAA;AAEhH,gCAA2B,QAAQ,OAAO;AAAE,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAAE,YAAI,aAAa,MAAM;AAAI,mBAAW,aAAa,WAAW,cAAc;AAAO,mBAAW,eAAe;AAAM,YAAI,WAAW;AAAY,qBAAW,WAAW;AAAM,eAAO,eAAe,QAAQ,WAAW,KAAK;AAAA;AAAA;AAE7S,2BAAsB,aAAa,YAAY,aAAa;AAAE,UAAI;AAAY,2BAAkB,YAAY,WAAW;AAAa,UAAI;AAAa,2BAAkB,aAAa;AAAc,aAAO;AAAA;AAGzM,QAAI,aAAa,WAAY;AAC3B,aAAO,OAAO,WAAW;AAAA;AAG3B,QAAI,YAAY,SAAU,MAAM;AAC9B,aAAO,gBAAgB,QAAQ,OAAO;AAAA;AAGxC,QAAI,YAAY,SAAU,MAAM;AAC9B,aAAO,UAAU,QAAQ,OAAO,QAAQ,OAAO;AAAA;AAGjD,QAAI,gBAAgB,CAAC,UAAU,eAAe;AAC5C,aAAO,aAAa,OAAO;AAAA;AAG7B,QAAI,iBAAiB,UAAU;AAC/B,QAAI,mBAAmB,UAAU;AACjC,QAAI,gBAAgB,UAAU;AAE9B,uBAAmB,KAAK,KAAK;AAC3B,UAAI,QAAQ,IAAI;AAChB,UAAI,SAAS;AAAM,eAAO;AAC1B,UAAI,OAAO,UAAU;AAAY,cAAM,IAAI,UAAU,QAAQ;AAC7D,aAAO;AAAA;AAGT,wBAAoB,KAAK;AACvB,UAAI,OAAO,IAAI;AAEf,UAAI,SAAS,QAAW;AACtB,eAAO,KAAK;AAEZ,YAAI,SAAS,MAAM;AACjB,iBAAO;AAAA;AAAA;AAIX,aAAO,SAAS,SAAY,OAAO;AAAA;AAGrC,0BAAsB,GAAG;AACvB,aAAO,aAAa;AAAA;AAGtB,6BAAyB,GAAG;AAC1B,UAAI,gBAAgB,KAAK;AACvB,wBAAgB,IAAI;AAAA,aACf;AACL,mBAAW,WAAY;AACrB,gBAAM;AAAA;AAAA;AAAA;AAKZ,qBAAiB,IAAI;AACnB,cAAQ,UAAU,KAAK,WAAY;AACjC,YAAI;AACF;AAAA,iBACO,GAAP;AACA,0BAAgB;AAAA;AAAA;AAAA;AAKtB,iCAA6B,cAAc;AACzC,UAAI,UAAU,aAAa;AAC3B,UAAI,YAAY;AAAW;AAC3B,mBAAa,WAAW;AAExB,UAAI,CAAC,SAAS;AACZ;AAAA;AAGF,UAAI;AACF,YAAI,OAAO,YAAY,YAAY;AACjC;AAAA,eACK;AACL,cAAI,cAAc,UAAU,SAAS;AAErC,cAAI,aAAa;AACf,wBAAY,KAAK;AAAA;AAAA;AAAA,eAGd,GAAP;AACA,wBAAgB;AAAA;AAAA;AAIpB,+BAA2B,cAAc;AACvC,mBAAa,YAAY;AACzB,mBAAa,SAAS;AACtB,mBAAa,SAAS;AAAA;AAGxB,+BAA2B,cAAc;AACvC,UAAI,QAAQ,aAAa;AAEzB,UAAI,CAAC,OAAO;AACV;AAAA;AAGF,mBAAa,SAAS;AACtB,mBAAa,SAAS;AAEtB,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,GAAG;AACrC,2BAAmB,cAAc,MAAM,GAAG,MAAM,MAAM,GAAG;AACzD,YAAI,aAAa,WAAW;AAAU;AAAA;AAAA;AAI1C,gCAA4B,cAAc,MAAM,OAAO;AACrD,mBAAa,SAAS;AACtB,UAAI,WAAW,aAAa;AAE5B,UAAI;AACF,YAAI,IAAI,UAAU,UAAU;AAE5B,gBAAQ;AAAA,eACD;AACH,gBAAI;AAAG,gBAAE,KAAK,UAAU;AACxB;AAAA,eAEG;AACH,8BAAkB;AAClB,gBAAI;AAAG,gBAAE,KAAK,UAAU;AAAA;AAAY,oBAAM;AAC1C;AAAA,eAEG;AACH,8BAAkB;AAClB,gBAAI;AAAG,gBAAE,KAAK;AACd;AAAA;AAAA,eAEG,GAAP;AACA,wBAAgB;AAAA;AAGlB,UAAI,aAAa,WAAW;AAAU,4BAAoB;AAAA,eAAuB,aAAa,WAAW;AAAW,qBAAa,SAAS;AAAA;AAG5I,sBAAkB,cAAc,MAAM,OAAO;AAC3C,UAAI,aAAa,WAAW;AAAU;AAEtC,UAAI,aAAa,WAAW,aAAa;AACvC,qBAAa,OAAO,KAAK;AAAA,UACvB;AAAA,UACA;AAAA;AAGF;AAAA;AAGF,UAAI,aAAa,WAAW,SAAS;AACnC,qBAAa,SAAS;AACtB,qBAAa,SAAS,CAAC;AAAA,UACrB;AAAA,UACA;AAAA;AAEF,gBAAQ,WAAY;AAClB,iBAAO,kBAAkB;AAAA;AAE3B;AAAA;AAGF,yBAAmB,cAAc,MAAM;AAAA;AAGzC,QAAI,eAEJ,2BAAY;AACV,6BAAsB,UAAU,YAAY;AAC1C,yBAAgB,MAAM;AAItB,aAAK,WAAW;AAChB,aAAK,YAAY;AACjB,aAAK,SAAS;AACd,aAAK,SAAS;AACd,YAAI,uBAAuB,IAAI,qBAAqB;AAEpD,YAAI;AACF,eAAK,WAAW,WAAW,KAAK,QAAW;AAAA,iBACpC,GAAP;AACA,+BAAqB,MAAM;AAAA;AAG7B,YAAI,KAAK,WAAW;AAAgB,eAAK,SAAS;AAAA;AAGpD,oBAAa,eAAc,CAAC;AAAA,QAC1B,KAAK;AAAA,QACL,OAAO,uBAAuB;AAC5B,cAAI,KAAK,WAAW,UAAU;AAC5B,8BAAkB;AAClB,gCAAoB;AAAA;AAAA;AAAA,SAGvB;AAAA,QACD,KAAK;AAAA,QACL,KAAK,WAAY;AACf,iBAAO,KAAK,WAAW;AAAA;AAAA;AAI3B,aAAO;AAAA;AAGT,QAAI,uBAEJ,2BAAY;AACV,qCAA8B,cAAc;AAC1C,yBAAgB,MAAM;AAEtB,aAAK,gBAAgB;AAAA;AAGvB,oBAAa,uBAAsB,CAAC;AAAA,QAClC,KAAK;AAAA,QACL,OAAO,cAAc,OAAO;AAC1B,mBAAS,KAAK,eAAe,QAAQ;AAAA;AAAA,SAEtC;AAAA,QACD,KAAK;AAAA,QACL,OAAO,eAAe,OAAO;AAC3B,mBAAS,KAAK,eAAe,SAAS;AAAA;AAAA,SAEvC;AAAA,QACD,KAAK;AAAA,QACL,OAAO,oBAAoB;AACzB,mBAAS,KAAK,eAAe;AAAA;AAAA,SAE9B;AAAA,QACD,KAAK;AAAA,QACL,KAAK,WAAY;AACf,iBAAO,KAAK,cAAc,WAAW;AAAA;AAAA;AAIzC,aAAO;AAAA;AAGT,QAAI,cAEJ,2BAAY;AACV,2BAAoB,YAAY;AAC9B,yBAAgB,MAAM;AAEtB,YAAI,CAAE,iBAAgB;AAAa,gBAAM,IAAI,UAAU;AACvD,YAAI,OAAO,eAAe;AAAY,gBAAM,IAAI,UAAU;AAC1D,aAAK,cAAc;AAAA;AAGrB,oBAAa,aAAY,CAAC;AAAA,QACxB,KAAK;AAAA,QACL,OAAO,mBAAmB,UAAU;AAClC,cAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AACrD,uBAAW;AAAA,cACT,MAAM;AAAA,cACN,OAAO,UAAU;AAAA,cACjB,UAAU,UAAU;AAAA;AAAA;AAIxB,iBAAO,IAAI,aAAa,UAAU,KAAK;AAAA;AAAA,SAExC;AAAA,QACD,KAAK;AAAA,QACL,OAAO,kBAAiB,IAAI;AAC1B,cAAI,QAAQ;AAEZ,iBAAO,IAAI,QAAQ,SAAU,SAAS,QAAQ;AAC5C,gBAAI,OAAO,OAAO,YAAY;AAC5B,qBAAO,IAAI,UAAU,KAAK;AAC1B;AAAA;AAGF,4BAAgB;AACd,2BAAa;AACb;AAAA;AAGF,gBAAI,eAAe,MAAM,UAAU;AAAA,cACjC,MAAM,SAAU,OAAO;AACrB,oBAAI;AACF,qBAAG,OAAO;AAAA,yBACH,GAAP;AACA,yBAAO;AACP,+BAAa;AAAA;AAAA;AAAA,cAGjB,OAAO;AAAA,cACP,UAAU;AAAA;AAAA;AAAA;AAAA,SAIf;AAAA,QACD,KAAK;AAAA,QACL,OAAO,aAAa,IAAI;AACtB,cAAI,SAAS;AAEb,cAAI,OAAO,OAAO;AAAY,kBAAM,IAAI,UAAU,KAAK;AACvD,cAAI,IAAI,WAAW;AACnB,iBAAO,IAAI,EAAE,SAAU,UAAU;AAC/B,mBAAO,OAAO,UAAU;AAAA,cACtB,MAAM,SAAU,OAAO;AACrB,oBAAI;AACF,0BAAQ,GAAG;AAAA,yBACJ,GAAP;AACA,yBAAO,SAAS,MAAM;AAAA;AAGxB,yBAAS,KAAK;AAAA;AAAA,cAEhB,OAAO,SAAU,GAAG;AAClB,yBAAS,MAAM;AAAA;AAAA,cAEjB,UAAU,WAAY;AACpB,yBAAS;AAAA;AAAA;AAAA;AAAA;AAAA,SAKhB;AAAA,QACD,KAAK;AAAA,QACL,OAAO,gBAAgB,IAAI;AACzB,cAAI,SAAS;AAEb,cAAI,OAAO,OAAO;AAAY,kBAAM,IAAI,UAAU,KAAK;AACvD,cAAI,IAAI,WAAW;AACnB,iBAAO,IAAI,EAAE,SAAU,UAAU;AAC/B,mBAAO,OAAO,UAAU;AAAA,cACtB,MAAM,SAAU,OAAO;AACrB,oBAAI;AACF,sBAAI,CAAC,GAAG;AAAQ;AAAA,yBACT,GAAP;AACA,yBAAO,SAAS,MAAM;AAAA;AAGxB,yBAAS,KAAK;AAAA;AAAA,cAEhB,OAAO,SAAU,GAAG;AAClB,yBAAS,MAAM;AAAA;AAAA,cAEjB,UAAU,WAAY;AACpB,yBAAS;AAAA;AAAA;AAAA;AAAA;AAAA,SAKhB;AAAA,QACD,KAAK;AAAA,QACL,OAAO,gBAAgB,IAAI;AACzB,cAAI,SAAS;AAEb,cAAI,OAAO,OAAO;AAAY,kBAAM,IAAI,UAAU,KAAK;AACvD,cAAI,IAAI,WAAW;AACnB,cAAI,UAAU,UAAU,SAAS;AACjC,cAAI,WAAW;AACf,cAAI,OAAO,UAAU;AACrB,cAAI,MAAM;AACV,iBAAO,IAAI,EAAE,SAAU,UAAU;AAC/B,mBAAO,OAAO,UAAU;AAAA,cACtB,MAAM,SAAU,OAAO;AACrB,oBAAI,QAAQ,CAAC;AACb,2BAAW;AAEX,oBAAI,CAAC,SAAS,SAAS;AACrB,sBAAI;AACF,0BAAM,GAAG,KAAK;AAAA,2BACP,GAAP;AACA,2BAAO,SAAS,MAAM;AAAA;AAAA,uBAEnB;AACL,wBAAM;AAAA;AAAA;AAAA,cAGV,OAAO,SAAU,GAAG;AAClB,yBAAS,MAAM;AAAA;AAAA,cAEjB,UAAU,WAAY;AACpB,oBAAI,CAAC,YAAY,CAAC;AAAS,yBAAO,SAAS,MAAM,IAAI,UAAU;AAC/D,yBAAS,KAAK;AACd,yBAAS;AAAA;AAAA;AAAA;AAAA;AAAA,SAKhB;AAAA,QACD,KAAK;AAAA,QACL,OAAO,mBAAkB;AACvB,cAAI,SAAS;AAEb,mBAAS,OAAO,UAAU,QAAQ,UAAU,IAAI,MAAM,OAAO,OAAO,GAAG,OAAO,MAAM,QAAQ;AAC1F,oBAAQ,QAAQ,UAAU;AAAA;AAG5B,cAAI,IAAI,WAAW;AACnB,iBAAO,IAAI,EAAE,SAAU,UAAU;AAC/B,gBAAI;AACJ,gBAAI,QAAQ;AAEZ,+BAAmB,MAAM;AACvB,6BAAe,KAAK,UAAU;AAAA,gBAC5B,MAAM,SAAU,GAAG;AACjB,2BAAS,KAAK;AAAA;AAAA,gBAEhB,OAAO,SAAU,GAAG;AAClB,2BAAS,MAAM;AAAA;AAAA,gBAEjB,UAAU,WAAY;AACpB,sBAAI,UAAU,QAAQ,QAAQ;AAC5B,mCAAe;AACf,6BAAS;AAAA,yBACJ;AACL,8BAAU,EAAE,KAAK,QAAQ;AAAA;AAAA;AAAA;AAAA;AAMjC,sBAAU;AACV,mBAAO,WAAY;AACjB,kBAAI,cAAc;AAChB,6BAAa;AACb,+BAAe;AAAA;AAAA;AAAA;AAAA;AAAA,SAKtB;AAAA,QACD,KAAK;AAAA,QACL,OAAO,iBAAiB,IAAI;AAC1B,cAAI,SAAS;AAEb,cAAI,OAAO,OAAO;AAAY,kBAAM,IAAI,UAAU,KAAK;AACvD,cAAI,IAAI,WAAW;AACnB,iBAAO,IAAI,EAAE,SAAU,UAAU;AAC/B,gBAAI,gBAAgB;AAEpB,gBAAI,QAAQ,OAAO,UAAU;AAAA,cAC3B,MAAM,SAAU,OAAO;AACrB,oBAAI,IAAI;AACN,sBAAI;AACF,4BAAQ,GAAG;AAAA,2BACJ,GAAP;AACA,2BAAO,SAAS,MAAM;AAAA;AAAA;AAI1B,oBAAI,QAAQ,EAAE,KAAK,OAAO,UAAU;AAAA,kBAClC,MAAM,SAAU,QAAO;AACrB,6BAAS,KAAK;AAAA;AAAA,kBAEhB,OAAO,SAAU,GAAG;AAClB,6BAAS,MAAM;AAAA;AAAA,kBAEjB,UAAU,WAAY;AACpB,wBAAI,IAAI,cAAc,QAAQ;AAC9B,wBAAI,KAAK;AAAG,oCAAc,OAAO,GAAG;AACpC;AAAA;AAAA;AAGJ,8BAAc,KAAK;AAAA;AAAA,cAErB,OAAO,SAAU,GAAG;AAClB,yBAAS,MAAM;AAAA;AAAA,cAEjB,UAAU,WAAY;AACpB;AAAA;AAAA;AAIJ,sCAA0B;AACxB,kBAAI,MAAM,UAAU,cAAc,WAAW;AAAG,yBAAS;AAAA;AAG3D,mBAAO,WAAY;AACjB,4BAAc,QAAQ,SAAU,GAAG;AACjC,uBAAO,EAAE;AAAA;AAEX,oBAAM;AAAA;AAAA;AAAA;AAAA,SAIX;AAAA,QACD,KAAK;AAAA,QACL,OAAO,WAAY;AACjB,iBAAO;AAAA;AAAA,UAEP,CAAC;AAAA,QACH,KAAK;AAAA,QACL,OAAO,eAAc,GAAG;AACtB,cAAI,IAAI,OAAO,SAAS,aAAa,OAAO;AAC5C,cAAI,KAAK;AAAM,kBAAM,IAAI,UAAU,IAAI;AACvC,cAAI,SAAS,UAAU,GAAG;AAE1B,cAAI,QAAQ;AACV,gBAAI,aAAa,OAAO,KAAK;AAC7B,gBAAI,OAAO,gBAAgB;AAAY,oBAAM,IAAI,UAAU,aAAa;AACxE,gBAAI,aAAa,eAAe,WAAW,gBAAgB;AAAG,qBAAO;AACrE,mBAAO,IAAI,EAAE,SAAU,UAAU;AAC/B,qBAAO,WAAW,UAAU;AAAA;AAAA;AAIhC,cAAI,UAAU,aAAa;AACzB,qBAAS,UAAU,GAAG;AAEtB,gBAAI,QAAQ;AACV,qBAAO,IAAI,EAAE,SAAU,UAAU;AAC/B,wBAAQ,WAAY;AAClB,sBAAI,SAAS;AAAQ;AACrB,sBAAI,4BAA4B;AAChC,sBAAI,oBAAoB;AACxB,sBAAI,iBAAiB;AAErB,sBAAI;AACF,6BAAS,YAAY,OAAO,KAAK,GAAG,OAAO,aAAa,OAAO,CAAE,6BAA6B,SAAQ,UAAU,QAAQ,OAAO,4BAA4B,MAAM;AAC/J,0BAAI,QAAQ,MAAM;AAClB,+BAAS,KAAK;AACd,0BAAI,SAAS;AAAQ;AAAA;AAAA,2BAEhB,KAAP;AACA,wCAAoB;AACpB,qCAAiB;AAAA,4BACjB;AACA,wBAAI;AACF,0BAAI,CAAC,6BAA6B,UAAU,UAAU,MAAM;AAC1D,kCAAU;AAAA;AAAA,8BAEZ;AACA,0BAAI,mBAAmB;AACrB,8BAAM;AAAA;AAAA;AAAA;AAKZ,2BAAS;AAAA;AAAA;AAAA;AAAA;AAMjB,cAAI,MAAM,QAAQ,IAAI;AACpB,mBAAO,IAAI,EAAE,SAAU,UAAU;AAC/B,sBAAQ,WAAY;AAClB,oBAAI,SAAS;AAAQ;AAErB,yBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG;AACjC,2BAAS,KAAK,EAAE;AAChB,sBAAI,SAAS;AAAQ;AAAA;AAGvB,yBAAS;AAAA;AAAA;AAAA;AAKf,gBAAM,IAAI,UAAU,IAAI;AAAA;AAAA,SAEzB;AAAA,QACD,KAAK;AAAA,QACL,OAAO,cAAc;AACnB,mBAAS,QAAQ,UAAU,QAAQ,QAAQ,IAAI,MAAM,QAAQ,QAAQ,GAAG,QAAQ,OAAO,SAAS;AAC9F,kBAAM,SAAS,UAAU;AAAA;AAG3B,cAAI,IAAI,OAAO,SAAS,aAAa,OAAO;AAC5C,iBAAO,IAAI,EAAE,SAAU,UAAU;AAC/B,oBAAQ,WAAY;AAClB,kBAAI,SAAS;AAAQ;AAErB,uBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,GAAG;AACrC,yBAAS,KAAK,MAAM;AACpB,oBAAI,SAAS;AAAQ;AAAA;AAGvB,uBAAS;AAAA;AAAA;AAAA;AAAA,SAId;AAAA,QACD,KAAK;AAAA,QACL,KAAK,WAAY;AACf,iBAAO;AAAA;AAAA;AAIX,aAAO;AAAA;AAGT,YAAQ,aAAa;AAErB,QAAI,cAAc;AAChB,aAAO,eAAe,aAAY,OAAO,eAAe;AAAA,QACtD,OAAO;AAAA,UACL,QAAQ;AAAA,UACR;AAAA;AAAA,QAEF,cAAc;AAAA;AAAA;AAAA;AAAA;;;ACtmBlB;AAAA;AAAA,YAAO,UAAU,qBAA+B;AAAA;AAAA;;;ACAhD;AAAA;AAeA,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,IAAC,UAAU,SAAS;AAChB,UAAI,QAAO,OAAO,WAAW,WAAW,SAAS,OAAO,SAAS,WAAW,OAAO,OAAO,SAAS,WAAW,OAAO;AACrH,UAAI,OAAO,WAAW,cAAc,OAAO,KAAK;AAC5C,eAAO,SAAS,CAAC,YAAY,SAAU,UAAS;AAAE,kBAAQ,eAAe,OAAM,eAAe;AAAA;AAAA,iBAEzF,OAAO,YAAW,YAAY,OAAO,QAAO,YAAY,UAAU;AACvE,gBAAQ,eAAe,OAAM,eAAe,QAAO;AAAA,aAElD;AACD,gBAAQ,eAAe;AAAA;AAE3B,8BAAwB,UAAS,UAAU;AACvC,YAAI,aAAY,OAAM;AAClB,cAAI,OAAO,OAAO,WAAW,YAAY;AACrC,mBAAO,eAAe,UAAS,cAAc,EAAE,OAAO;AAAA,iBAErD;AACD,qBAAQ,aAAa;AAAA;AAAA;AAG7B,eAAO,SAAU,IAAI,GAAG;AAAE,iBAAO,SAAQ,MAAM,WAAW,SAAS,IAAI,KAAK;AAAA;AAAA;AAAA,OAGnF,SAAU,UAAU;AACjB,UAAI,gBAAgB,OAAO,kBACtB,EAAE,WAAW,gBAAgB,SAAS,SAAU,GAAG,GAAG;AAAE,UAAE,YAAY;AAAA,WACvE,SAAU,GAAG,GAAG;AAAE,iBAAS,KAAK;AAAG,cAAI,OAAO,UAAU,eAAe,KAAK,GAAG;AAAI,cAAE,KAAK,EAAE;AAAA;AAEhG,mBAAY,SAAU,GAAG,GAAG;AACxB,YAAI,OAAO,MAAM,cAAc,MAAM;AACjC,gBAAM,IAAI,UAAU,yBAAyB,OAAO,KAAK;AAC7D,sBAAc,GAAG;AACjB,sBAAc;AAAE,eAAK,cAAc;AAAA;AACnC,UAAE,YAAY,MAAM,OAAO,OAAO,OAAO,KAAM,IAAG,YAAY,EAAE,WAAW,IAAI;AAAA;AAGnF,kBAAW,OAAO,UAAU,SAAU,GAAG;AACrC,iBAAS,GAAG,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AACjD,cAAI,UAAU;AACd,mBAAS,KAAK;AAAG,gBAAI,OAAO,UAAU,eAAe,KAAK,GAAG;AAAI,gBAAE,KAAK,EAAE;AAAA;AAE9E,eAAO;AAAA;AAGX,gBAAS,SAAU,GAAG,GAAG;AACrB,YAAI,IAAI;AACR,iBAAS,KAAK;AAAG,cAAI,OAAO,UAAU,eAAe,KAAK,GAAG,MAAM,EAAE,QAAQ,KAAK;AAC9E,cAAE,KAAK,EAAE;AACb,YAAI,KAAK,QAAQ,OAAO,OAAO,0BAA0B;AACrD,mBAAS,IAAI,GAAG,IAAI,OAAO,sBAAsB,IAAI,IAAI,EAAE,QAAQ,KAAK;AACpE,gBAAI,EAAE,QAAQ,EAAE,MAAM,KAAK,OAAO,UAAU,qBAAqB,KAAK,GAAG,EAAE;AACvE,gBAAE,EAAE,MAAM,EAAE,EAAE;AAAA;AAE1B,eAAO;AAAA;AAGX,oBAAa,SAAU,YAAY,QAAQ,KAAK,MAAM;AAClD,YAAI,IAAI,UAAU,QAAQ,IAAI,IAAI,IAAI,SAAS,SAAS,OAAO,OAAO,OAAO,yBAAyB,QAAQ,OAAO,MAAM;AAC3H,YAAI,OAAO,YAAY,YAAY,OAAO,QAAQ,aAAa;AAAY,cAAI,QAAQ,SAAS,YAAY,QAAQ,KAAK;AAAA;AACpH,mBAAS,IAAI,WAAW,SAAS,GAAG,KAAK,GAAG;AAAK,gBAAI,IAAI,WAAW;AAAI,kBAAK,KAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,QAAQ,KAAK,KAAK,EAAE,QAAQ,SAAS;AAChJ,eAAO,IAAI,KAAK,KAAK,OAAO,eAAe,QAAQ,KAAK,IAAI;AAAA;AAGhE,iBAAU,SAAU,YAAY,WAAW;AACvC,eAAO,SAAU,QAAQ,KAAK;AAAE,oBAAU,QAAQ,KAAK;AAAA;AAAA;AAG3D,oBAAa,SAAU,aAAa,eAAe;AAC/C,YAAI,OAAO,YAAY,YAAY,OAAO,QAAQ,aAAa;AAAY,iBAAO,QAAQ,SAAS,aAAa;AAAA;AAGpH,mBAAY,SAAU,SAAS,YAAY,GAAG,WAAW;AACrD,uBAAe,OAAO;AAAE,iBAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU,SAAS;AAAE,oBAAQ;AAAA;AAAA;AAC/F,eAAO,IAAK,MAAM,KAAI,UAAU,SAAU,SAAS,QAAQ;AACvD,6BAAmB,OAAO;AAAE,gBAAI;AAAE,mBAAK,UAAU,KAAK;AAAA,qBAAkB,GAAP;AAAY,qBAAO;AAAA;AAAA;AACpF,4BAAkB,OAAO;AAAE,gBAAI;AAAE,mBAAK,UAAU,SAAS;AAAA,qBAAkB,GAAP;AAAY,qBAAO;AAAA;AAAA;AACvF,wBAAc,SAAQ;AAAE,oBAAO,OAAO,QAAQ,QAAO,SAAS,MAAM,QAAO,OAAO,KAAK,WAAW;AAAA;AAClG,eAAM,aAAY,UAAU,MAAM,SAAS,cAAc,KAAK;AAAA;AAAA;AAItE,qBAAc,SAAU,SAAS,MAAM;AACnC,YAAI,IAAI,EAAE,OAAO,GAAG,MAAM,WAAW;AAAE,cAAI,EAAE,KAAK;AAAG,kBAAM,EAAE;AAAI,iBAAO,EAAE;AAAA,WAAO,MAAM,IAAI,KAAK,MAAM,GAAG,GAAG,GAAG;AAC/G,eAAO,IAAI,EAAE,MAAM,KAAK,IAAI,SAAS,KAAK,IAAI,UAAU,KAAK,MAAM,OAAO,WAAW,cAAe,GAAE,OAAO,YAAY,WAAW;AAAE,iBAAO;AAAA,YAAU;AACvJ,sBAAc,GAAG;AAAE,iBAAO,SAAU,GAAG;AAAE,mBAAO,KAAK,CAAC,GAAG;AAAA;AAAA;AACzD,sBAAc,IAAI;AACd,cAAI;AAAG,kBAAM,IAAI,UAAU;AAC3B,iBAAO;AAAG,gBAAI;AACV,kBAAI,IAAI,GAAG,KAAM,KAAI,GAAG,KAAK,IAAI,EAAE,YAAY,GAAG,KAAK,EAAE,YAAc,MAAI,EAAE,cAAc,EAAE,KAAK,IAAI,KAAK,EAAE,SAAS,CAAE,KAAI,EAAE,KAAK,GAAG,GAAG,KAAK;AAAM,uBAAO;AAC3J,kBAAI,IAAI,GAAG;AAAG,qBAAK,CAAC,GAAG,KAAK,GAAG,EAAE;AACjC,sBAAQ,GAAG;AAAA,qBACF;AAAA,qBAAQ;AAAG,sBAAI;AAAI;AAAA,qBACnB;AAAG,oBAAE;AAAS,yBAAO,EAAE,OAAO,GAAG,IAAI,MAAM;AAAA,qBAC3C;AAAG,oBAAE;AAAS,sBAAI,GAAG;AAAI,uBAAK,CAAC;AAAI;AAAA,qBACnC;AAAG,uBAAK,EAAE,IAAI;AAAO,oBAAE,KAAK;AAAO;AAAA;AAEpC,sBAAI,CAAE,KAAI,EAAE,MAAM,IAAI,EAAE,SAAS,KAAK,EAAE,EAAE,SAAS,OAAQ,IAAG,OAAO,KAAK,GAAG,OAAO,IAAI;AAAE,wBAAI;AAAG;AAAA;AACjG,sBAAI,GAAG,OAAO,KAAM,EAAC,KAAM,GAAG,KAAK,EAAE,MAAM,GAAG,KAAK,EAAE,KAAM;AAAE,sBAAE,QAAQ,GAAG;AAAI;AAAA;AAC9E,sBAAI,GAAG,OAAO,KAAK,EAAE,QAAQ,EAAE,IAAI;AAAE,sBAAE,QAAQ,EAAE;AAAI,wBAAI;AAAI;AAAA;AAC7D,sBAAI,KAAK,EAAE,QAAQ,EAAE,IAAI;AAAE,sBAAE,QAAQ,EAAE;AAAI,sBAAE,IAAI,KAAK;AAAK;AAAA;AAC3D,sBAAI,EAAE;AAAI,sBAAE,IAAI;AAChB,oBAAE,KAAK;AAAO;AAAA;AAEtB,mBAAK,KAAK,KAAK,SAAS;AAAA,qBACnB,GAAP;AAAY,mBAAK,CAAC,GAAG;AAAI,kBAAI;AAAA,sBAAK;AAAU,kBAAI,IAAI;AAAA;AACtD,cAAI,GAAG,KAAK;AAAG,kBAAM,GAAG;AAAI,iBAAO,EAAE,OAAO,GAAG,KAAK,GAAG,KAAK,QAAQ,MAAM;AAAA;AAAA;AAIlF,sBAAe,SAAS,GAAG,GAAG;AAC1B,iBAAS,KAAK;AAAG,cAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAK,GAAG;AAAI,6BAAgB,GAAG,GAAG;AAAA;AAG/G,yBAAkB,OAAO,SAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AACrD,YAAI,OAAO;AAAW,eAAK;AAC3B,eAAO,eAAe,GAAG,IAAI,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE;AAAA;AAAA,UAC1E,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,YAAI,OAAO;AAAW,eAAK;AAC3B,UAAE,MAAM,EAAE;AAAA;AAGd,kBAAW,SAAU,GAAG;AACpB,YAAI,IAAI,OAAO,WAAW,cAAc,OAAO,UAAU,IAAI,KAAK,EAAE,IAAI,IAAI;AAC5E,YAAI;AAAG,iBAAO,EAAE,KAAK;AACrB,YAAI,KAAK,OAAO,EAAE,WAAW;AAAU,iBAAO;AAAA,YAC1C,MAAM,WAAY;AACd,kBAAI,KAAK,KAAK,EAAE;AAAQ,oBAAI;AAC5B,qBAAO,EAAE,OAAO,KAAK,EAAE,MAAM,MAAM,CAAC;AAAA;AAAA;AAG5C,cAAM,IAAI,UAAU,IAAI,4BAA4B;AAAA;AAGxD,gBAAS,SAAU,GAAG,GAAG;AACrB,YAAI,IAAI,OAAO,WAAW,cAAc,EAAE,OAAO;AACjD,YAAI,CAAC;AAAG,iBAAO;AACf,YAAI,IAAI,EAAE,KAAK,IAAI,GAAG,KAAK,IAAI;AAC/B,YAAI;AACA,iBAAQ,OAAM,UAAU,MAAM,MAAM,CAAE,KAAI,EAAE,QAAQ;AAAM,eAAG,KAAK,EAAE;AAAA,iBAEjE,OAAP;AAAgB,cAAI,EAAE;AAAA,kBACtB;AACI,cAAI;AACA,gBAAI,KAAK,CAAC,EAAE,QAAS,KAAI,EAAE;AAAY,gBAAE,KAAK;AAAA,oBAElD;AAAU,gBAAI;AAAG,oBAAM,EAAE;AAAA;AAAA;AAE7B,eAAO;AAAA;AAIX,kBAAW,WAAY;AACnB,iBAAS,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ;AAC3C,eAAK,GAAG,OAAO,QAAO,UAAU;AACpC,eAAO;AAAA;AAIX,wBAAiB,WAAY;AACzB,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK,UAAU,QAAQ,IAAI,IAAI;AAAK,eAAK,UAAU,GAAG;AAC7E,iBAAS,IAAI,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI;AACzC,mBAAS,IAAI,UAAU,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,IAAI,IAAI,KAAK;AAC1D,cAAE,KAAK,EAAE;AACjB,eAAO;AAAA;AAGX,uBAAgB,SAAU,IAAI,OAAM;AAChC,iBAAS,IAAI,GAAG,KAAK,MAAK,QAAQ,IAAI,GAAG,QAAQ,IAAI,IAAI,KAAK;AAC1D,aAAG,KAAK,MAAK;AACjB,eAAO;AAAA;AAGX,iBAAU,SAAU,GAAG;AACnB,eAAO,gBAAgB,WAAW,MAAK,IAAI,GAAG,QAAQ,IAAI,SAAQ;AAAA;AAGtE,0BAAmB,SAAU,SAAS,YAAY,WAAW;AACzD,YAAI,CAAC,OAAO;AAAe,gBAAM,IAAI,UAAU;AAC/C,YAAI,IAAI,UAAU,MAAM,SAAS,cAAc,KAAK,GAAG,IAAI;AAC3D,eAAO,IAAI,IAAI,KAAK,SAAS,KAAK,UAAU,KAAK,WAAW,EAAE,OAAO,iBAAiB,WAAY;AAAE,iBAAO;AAAA,WAAS;AACpH,sBAAc,GAAG;AAAE,cAAI,EAAE;AAAI,cAAE,KAAK,SAAU,GAAG;AAAE,qBAAO,IAAI,QAAQ,SAAU,GAAG,GAAG;AAAE,kBAAE,KAAK,CAAC,GAAG,GAAG,GAAG,MAAM,KAAK,OAAO,GAAG;AAAA;AAAA;AAAA;AAC9H,wBAAgB,GAAG,GAAG;AAAE,cAAI;AAAE,iBAAK,EAAE,GAAG;AAAA,mBAAc,GAAP;AAAY,mBAAO,EAAE,GAAG,IAAI;AAAA;AAAA;AAC3E,sBAAc,GAAG;AAAE,YAAE,iBAAiB,WAAU,QAAQ,QAAQ,EAAE,MAAM,GAAG,KAAK,SAAS,UAAU,OAAO,EAAE,GAAG,IAAI;AAAA;AACnH,yBAAiB,OAAO;AAAE,iBAAO,QAAQ;AAAA;AACzC,wBAAgB,OAAO;AAAE,iBAAO,SAAS;AAAA;AACzC,wBAAgB,GAAG,GAAG;AAAE,cAAI,EAAE,IAAI,EAAE,SAAS,EAAE;AAAQ,mBAAO,EAAE,GAAG,IAAI,EAAE,GAAG;AAAA;AAAA;AAGhF,0BAAmB,SAAU,GAAG;AAC5B,YAAI,GAAG;AACP,eAAO,IAAI,IAAI,KAAK,SAAS,KAAK,SAAS,SAAU,GAAG;AAAE,gBAAM;AAAA,YAAO,KAAK,WAAW,EAAE,OAAO,YAAY,WAAY;AAAE,iBAAO;AAAA,WAAS;AAC1I,sBAAc,GAAG,GAAG;AAAE,YAAE,KAAK,EAAE,KAAK,SAAU,GAAG;AAAE,mBAAQ,KAAI,CAAC,KAAK,EAAE,OAAO,SAAQ,EAAE,GAAG,KAAK,MAAM,MAAM,aAAa,IAAI,EAAE,KAAK;AAAA,cAAO;AAAA;AAAA;AAG/I,uBAAgB,SAAU,GAAG;AACzB,YAAI,CAAC,OAAO;AAAe,gBAAM,IAAI,UAAU;AAC/C,YAAI,IAAI,EAAE,OAAO,gBAAgB;AACjC,eAAO,IAAI,EAAE,KAAK,KAAM,KAAI,OAAO,cAAa,aAAa,UAAS,KAAK,EAAE,OAAO,aAAa,IAAI,IAAI,KAAK,SAAS,KAAK,UAAU,KAAK,WAAW,EAAE,OAAO,iBAAiB,WAAY;AAAE,iBAAO;AAAA,WAAS;AAC9M,sBAAc,GAAG;AAAE,YAAE,KAAK,EAAE,MAAM,SAAU,GAAG;AAAE,mBAAO,IAAI,QAAQ,SAAU,SAAS,QAAQ;AAAE,kBAAI,EAAE,GAAG,IAAI,OAAO,SAAS,QAAQ,EAAE,MAAM,EAAE;AAAA;AAAA;AAAA;AAChJ,wBAAgB,SAAS,QAAQ,GAAG,GAAG;AAAE,kBAAQ,QAAQ,GAAG,KAAK,SAAS,IAAG;AAAE,oBAAQ,EAAE,OAAO,IAAG,MAAM;AAAA,aAAS;AAAA;AAAA;AAGtH,8BAAuB,SAAU,QAAQ,KAAK;AAC1C,YAAI,OAAO,gBAAgB;AAAE,iBAAO,eAAe,QAAQ,OAAO,EAAE,OAAO;AAAA,eAAe;AAAE,iBAAO,MAAM;AAAA;AACzG,eAAO;AAAA;AAGX,UAAI,qBAAqB,OAAO,SAAU,SAAS,GAAG,GAAG;AACrD,eAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO;AAAA,UAC9D,SAAS,GAAG,GAAG;AAChB,UAAE,aAAa;AAAA;AAGnB,sBAAe,SAAU,KAAK;AAC1B,YAAI,OAAO,IAAI;AAAY,iBAAO;AAClC,YAAI,UAAS;AACb,YAAI,OAAO;AAAM,mBAAS,KAAK;AAAK,gBAAI,MAAM,aAAa,OAAO,UAAU,eAAe,KAAK,KAAK;AAAI,+BAAgB,SAAQ,KAAK;AAAA;AACtI,2BAAmB,SAAQ;AAC3B,eAAO;AAAA;AAGX,yBAAkB,SAAU,KAAK;AAC7B,eAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW;AAAA;AAGxD,gCAAyB,SAAU,UAAU,OAAO,MAAM,GAAG;AACzD,YAAI,SAAS,OAAO,CAAC;AAAG,gBAAM,IAAI,UAAU;AAC5C,YAAI,OAAO,UAAU,aAAa,aAAa,SAAS,CAAC,IAAI,CAAC,MAAM,IAAI;AAAW,gBAAM,IAAI,UAAU;AACvG,eAAO,SAAS,MAAM,IAAI,SAAS,MAAM,EAAE,KAAK,YAAY,IAAI,EAAE,QAAQ,MAAM,IAAI;AAAA;AAGxF,gCAAyB,SAAU,UAAU,OAAO,OAAO,MAAM,GAAG;AAChE,YAAI,SAAS;AAAK,gBAAM,IAAI,UAAU;AACtC,YAAI,SAAS,OAAO,CAAC;AAAG,gBAAM,IAAI,UAAU;AAC5C,YAAI,OAAO,UAAU,aAAa,aAAa,SAAS,CAAC,IAAI,CAAC,MAAM,IAAI;AAAW,gBAAM,IAAI,UAAU;AACvG,eAAQ,SAAS,MAAM,EAAE,KAAK,UAAU,SAAS,IAAI,EAAE,QAAQ,QAAQ,MAAM,IAAI,UAAU,QAAS;AAAA;AAGxG,eAAS,aAAa;AACtB,eAAS,YAAY;AACrB,eAAS,UAAU;AACnB,eAAS,cAAc;AACvB,eAAS,WAAW;AACpB,eAAS,cAAc;AACvB,eAAS,aAAa;AACtB,eAAS,eAAe;AACxB,eAAS,gBAAgB;AACzB,eAAS,mBAAmB;AAC5B,eAAS,YAAY;AACrB,eAAS,UAAU;AACnB,eAAS,YAAY;AACrB,eAAS,kBAAkB;AAC3B,eAAS,iBAAiB;AAC1B,eAAS,WAAW;AACpB,eAAS,oBAAoB;AAC7B,eAAS,oBAAoB;AAC7B,eAAS,iBAAiB;AAC1B,eAAS,wBAAwB;AACjC,eAAS,gBAAgB;AACzB,eAAS,mBAAmB;AAC5B,eAAS,0BAA0B;AACnC,eAAS,0BAA0B;AAAA;AAAA;AAAA;;;AC5SvC,mBAAkB;AAClB,IAAM;AAAA,EACF;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,IACA;;;ACzBJ,oBAAkB;AAClB,IAAM;AAAA,EACF;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,IACA;;;AC1BJ,IAAM,iBAAiB;AAErB,IAAA,KAIE,OAAa;AAJf,IAAA,iBAAc,OAAA,SAAG,SAAU,KAAU,OAAU;AAC7C,MAAI,YAAY;AAChB,SAAO;IACR;;AAGiC,aAAA,iBAAA;AAGlC,2BAAY,SAAyC;AAAzC,QAAA,YAAA,QAAA;AAAA,gBAAA;;AAAZ,QAAA,QACE,OAAA,KAAA,MACE,OAAO,YAAY,WACZ,iBAAc,OAAK,UAAO,+DAC7B,YACL;AAPH,UAAA,cAAc;AACd,UAAA,OAAO;AAOL,mBAAe,OAAM,gBAAe;;;AAExC,SAAA;EAXoC;mBAclC,WACA,SAAyB;AAEzB,MAAI,CAAC,WAAW;AACd,UAAM,IAAI,eAAe;;;AAI7B,IAAM,kBAAkB,CAAC,OAAO,QAAQ,SAAS;AAGjD,IAAI,iBAAiB,gBAAgB,QAAQ;AAE7C,2BAAwD,QAAS;AAC/D,SAAO,WAAA;AACL,QAAI,gBAAgB,QAAQ,WAAW,gBAAgB;AACrD,aAAO,QAAQ,QAAQ,MAAM,SAAS;;;;AAK5C,AAAA,UAAiB,YAAS;AACX,aAAA,MAAM,kBAAkB;AACxB,aAAA,OAAO,kBAAkB;AACzB,aAAA,QAAQ,kBAAkB;GAHxB,aAAA,aAAS;sBAMG,OAAqB;AAChD,MAAM,MAAM,gBAAgB;AAC5B,mBAAiB,KAAK,IAAI,GAAG,gBAAgB,QAAQ;AACrD,SAAO;;IASI,cAIX,OAAO,YAAY,YACnB,OAAO,QAAQ,QAAQ,WACrB,UAAU,EAAE,KAAK;;;ACnErB,iBAAiB,KAAK;AAAE;AAA2B,MAAI,OAAO,WAAW,cAAc,OAAO,OAAO,aAAa,UAAU;AAAE,cAAU,kBAAiB,MAAK;AAAE,aAAO,OAAO;AAAA;AAAA,SAAe;AAAE,cAAU,kBAAiB,MAAK;AAAE,aAAO,QAAO,OAAO,WAAW,cAAc,KAAI,gBAAgB,UAAU,SAAQ,OAAO,YAAY,WAAW,OAAO;AAAA;AAAA;AAAU,SAAO,QAAQ;AAAA;AAMpW,sBAAsB,OAAO;AAC1C,SAAO,QAAQ,UAAU,YAAY,UAAU;AAAA;;;ACL1C,IAAI,kBAAkB,OAAO,WAAW,cAAc,OAAO,YAAY,OAAO,OAAO,WAAW;AAGlG,IAAI,wBAAwB,OAAO,WAAW,cAAc,OAAO,iBAAiB,OAAO,OAAO,gBAAgB;AAElH,IAAI,uBAAuB,OAAO,WAAW,cAAc,OAAO,eAAe,OAAO,OAAO,cAAc;;;ACC7G,qBAAqB,QAAQ,UAAU;AAC5C,MAAI,aAAa;AACjB,MAAI,OAAO;AACX,MAAI,SAAS,WAAW;AACxB,MAAI;AAEJ,SAAQ,SAAQ,WAAW,KAAK,OAAO,UAAU,MAAM,QAAQ,UAAU;AACvE,YAAQ;AACR,aAAS,WAAW,IAAK,OAAM,QAAQ,MAAM,GAAG;AAAA;AAGlD,SAAO;AAAA,IACL;AAAA,IACA;AAAA;AAAA;;;AChBG,uBAAuB,UAAU;AACtC,SAAO,oBAAoB,SAAS,QAAQ,YAAY,SAAS,QAAQ,SAAS;AAAA;AAM7E,6BAA6B,QAAQ,gBAAgB;AAC1D,MAAI,wBAAwB,OAAO,eAAe,SAAS;AAC3D,MAAI,OAAO,WAAW,yBAAyB,OAAO;AACtD,MAAI,YAAY,eAAe,OAAO;AACtC,MAAI,aAAa,OAAO,eAAe,OAAO;AAC9C,MAAI,UAAU,eAAe,OAAO;AACpC,MAAI,eAAe,eAAe,SAAS,IAAI,wBAAwB;AACvE,MAAI,YAAY,eAAe,SAAS;AACxC,MAAI,cAAc,GAAG,OAAO,OAAO,MAAM,KAAK,OAAO,SAAS,KAAK,OAAO,WAAW;AACrF,MAAI,QAAQ,KAAK,MAAM;AACvB,MAAI,eAAe,MAAM;AAEzB,MAAI,aAAa,SAAS,KAAK;AAC7B,QAAI,eAAe,KAAK,MAAM,YAAY;AAC1C,QAAI,mBAAmB,YAAY;AACnC,QAAI,WAAW;AAEf,aAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,IAAI;AAChD,eAAS,KAAK,aAAa,MAAM,GAAG,IAAI;AAAA;AAG1C,WAAO,cAAc,mBAAmB,CAAC,CAAC,GAAG,OAAO,UAAU,SAAS,KAAK,OAAO,SAAS,MAAM,GAAG,eAAe,GAAG,IAAI,SAAU,SAAS;AAC5I,aAAO,CAAC,IAAI;AAAA,QACV,CAAC,CAAC,KAAK,WAAW,mBAAmB,KAAK,MAAM,CAAC,IAAI,SAAS,eAAe;AAAA;AAGnF,SAAO,cAAc,mBAAmB;AAAA,IACxC,CAAC,GAAG,OAAO,UAAU,IAAI,MAAM,YAAY;AAAA,IAAK,CAAC,GAAG,OAAO,UAAU;AAAA,IAAe,CAAC,IAAI,WAAW,YAAY,KAAK;AAAA,IAAM,CAAC,GAAG,OAAO,UAAU,IAAI,MAAM,YAAY;AAAA;AAAA;AAGxK,4BAA4B,OAAO;AACjC,MAAI,gBAAgB,MAAM,OAAO,SAAU,MAAM;AAC/C,QAAI,IAAI,KAAK,IACT,OAAO,KAAK;AAChB,WAAO,SAAS;AAAA;AAElB,MAAI,SAAS,KAAK,IAAI,MAAM,MAAM,cAAc,IAAI,SAAU,OAAO;AACnE,QAAI,SAAS,MAAM;AACnB,WAAO,OAAO;AAAA;AAEhB,SAAO,cAAc,IAAI,SAAU,OAAO;AACxC,QAAI,SAAS,MAAM,IACf,OAAO,MAAM;AACjB,WAAO,QAAQ,QAAQ,UAAW,QAAO,QAAQ,OAAO;AAAA,KACvD,KAAK;AAAA;AAGV,oBAAoB,KAAK;AACvB,SAAO,MAAM,MAAM,GAAG,KAAK;AAAA;AAG7B,iBAAiB,KAAK,KAAK;AACzB,SAAO,WAAW,MAAM,IAAI,UAAU;AAAA;;;AChExC,kBAAiB,KAAK;AAAE;AAA2B,MAAI,OAAO,WAAW,cAAc,OAAO,OAAO,aAAa,UAAU;AAAE,eAAU,kBAAiB,MAAK;AAAE,aAAO,OAAO;AAAA;AAAA,SAAe;AAAE,eAAU,kBAAiB,MAAK;AAAE,aAAO,QAAO,OAAO,WAAW,cAAc,KAAI,gBAAgB,UAAU,SAAQ,OAAO,YAAY,WAAW,OAAO;AAAA;AAAA;AAAU,SAAO,SAAQ;AAAA;AAEnX,yBAAyB,UAAU,aAAa;AAAE,MAAI,CAAE,qBAAoB,cAAc;AAAE,UAAM,IAAI,UAAU;AAAA;AAAA;AAEhH,2BAA2B,QAAQ,OAAO;AAAE,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAAE,QAAI,aAAa,MAAM;AAAI,eAAW,aAAa,WAAW,cAAc;AAAO,eAAW,eAAe;AAAM,QAAI,WAAW;AAAY,iBAAW,WAAW;AAAM,WAAO,eAAe,QAAQ,WAAW,KAAK;AAAA;AAAA;AAE7S,sBAAsB,aAAa,YAAY,aAAa;AAAE,MAAI;AAAY,sBAAkB,YAAY,WAAW;AAAa,MAAI;AAAa,sBAAkB,aAAa;AAAc,SAAO;AAAA;AAEzM,mBAAmB,UAAU,YAAY;AAAE,MAAI,OAAO,eAAe,cAAc,eAAe,MAAM;AAAE,UAAM,IAAI,UAAU;AAAA;AAAyD,WAAS,YAAY,OAAO,OAAO,cAAc,WAAW,WAAW,EAAE,aAAa,EAAE,OAAO,UAAU,UAAU,MAAM,cAAc;AAAW,MAAI;AAAY,oBAAgB,UAAU;AAAA;AAEnX,sBAAsB,SAAS;AAAE,MAAI,4BAA4B;AAA6B,SAAO,gCAAgC;AAAE,QAAI,QAAQ,gBAAgB,UAAU;AAAQ,QAAI,2BAA2B;AAAE,UAAI,YAAY,gBAAgB,MAAM;AAAa,gBAAS,QAAQ,UAAU,OAAO,WAAW;AAAA,WAAmB;AAAE,gBAAS,MAAM,MAAM,MAAM;AAAA;AAAc,WAAO,2BAA2B,MAAM;AAAA;AAAA;AAE5Z,oCAAoC,OAAM,MAAM;AAAE,MAAI,QAAS,UAAQ,UAAU,YAAY,OAAO,SAAS,aAAa;AAAE,WAAO;AAAA;AAAQ,SAAO,uBAAuB;AAAA;AAEzK,gCAAgC,OAAM;AAAE,MAAI,UAAS,QAAQ;AAAE,UAAM,IAAI,eAAe;AAAA;AAAgE,SAAO;AAAA;AAE/J,0BAA0B,OAAO;AAAE,MAAI,SAAS,OAAO,QAAQ,aAAa,IAAI,QAAQ;AAAW,qBAAmB,2BAA0B,QAAO;AAAE,QAAI,WAAU,QAAQ,CAAC,kBAAkB;AAAQ,aAAO;AAAO,QAAI,OAAO,WAAU,YAAY;AAAE,YAAM,IAAI,UAAU;AAAA;AAAyD,QAAI,OAAO,WAAW,aAAa;AAAE,UAAI,OAAO,IAAI;AAAQ,eAAO,OAAO,IAAI;AAAQ,aAAO,IAAI,QAAO;AAAA;AAAY,uBAAmB;AAAE,aAAO,WAAW,QAAO,WAAW,gBAAgB,MAAM;AAAA;AAAgB,YAAQ,YAAY,OAAO,OAAO,OAAM,WAAW,EAAE,aAAa,EAAE,OAAO,SAAS,YAAY,OAAO,UAAU,MAAM,cAAc;AAAW,WAAO,gBAAgB,SAAS;AAAA;AAAW,SAAO,iBAAiB;AAAA;AAE9uB,oBAAoB,QAAQ,MAAM,OAAO;AAAE,MAAI,6BAA6B;AAAE,iBAAa,QAAQ;AAAA,SAAkB;AAAE,iBAAa,qBAAoB,SAAQ,OAAM,QAAO;AAAE,UAAI,IAAI,CAAC;AAAO,QAAE,KAAK,MAAM,GAAG;AAAO,UAAI,cAAc,SAAS,KAAK,MAAM,SAAQ;AAAI,UAAI,WAAW,IAAI;AAAe,UAAI;AAAO,wBAAgB,UAAU,OAAM;AAAY,aAAO;AAAA;AAAA;AAAe,SAAO,WAAW,MAAM,MAAM;AAAA;AAErZ,qCAAqC;AAAE,MAAI,OAAO,YAAY,eAAe,CAAC,QAAQ;AAAW,WAAO;AAAO,MAAI,QAAQ,UAAU;AAAM,WAAO;AAAO,MAAI,OAAO,UAAU;AAAY,WAAO;AAAM,MAAI;AAAE,SAAK,UAAU,SAAS,KAAK,QAAQ,UAAU,MAAM,IAAI,WAAY;AAAA;AAAM,WAAO;AAAA,WAAe,GAAP;AAAY,WAAO;AAAA;AAAA;AAE1T,2BAA2B,IAAI;AAAE,SAAO,SAAS,SAAS,KAAK,IAAI,QAAQ,qBAAqB;AAAA;AAEhG,yBAAyB,GAAG,GAAG;AAAE,oBAAkB,OAAO,kBAAkB,0BAAyB,IAAG,IAAG;AAAE,OAAE,YAAY;AAAG,WAAO;AAAA;AAAM,SAAO,gBAAgB,GAAG;AAAA;AAErK,yBAAyB,GAAG;AAAE,oBAAkB,OAAO,iBAAiB,OAAO,iBAAiB,0BAAyB,IAAG;AAAE,WAAO,GAAE,aAAa,OAAO,eAAe;AAAA;AAAO,SAAO,gBAAgB;AAAA;AAejM,IAAI,eAA4B,yBAAU,QAAQ;AACvD,YAAU,eAAc;AAExB,MAAI,SAAS,aAAa;AAmD1B,yBAAsB,SAAS,OAAO,QAAQ,WAAW,MAAM,eAAe,YAAY;AACxF,QAAI,aAAa,UAAU,aAAa;AAExC,QAAI;AAEJ,oBAAgB,MAAM;AAEtB,YAAQ,OAAO,KAAK,MAAM;AAE1B,QAAI,SAAS,MAAM,QAAQ,SAAS,MAAM,WAAW,IAAI,QAAQ,SAAY,QAAQ,CAAC,SAAS;AAG/F,QAAI,UAAU;AAEd,QAAI,CAAC,WAAW,QAAQ;AACtB,UAAI;AAEJ,gBAAW,gBAAe,OAAO,GAAG,SAAS,QAAQ,iBAAiB,SAAS,SAAS,aAAa;AAAA;AAGvG,QAAI,aAAa;AAEjB,QAAI,CAAC,cAAc,QAAQ;AACzB,mBAAa,OAAO,OAAO,SAAU,MAAM,MAAM;AAC/C,YAAI,KAAK,KAAK;AACZ,eAAK,KAAK,KAAK,IAAI;AAAA;AAGrB,eAAO;AAAA,SACN;AAAA;AAGL,QAAI,cAAc,WAAW,WAAW,GAAG;AACzC,mBAAa;AAAA;AAGf,QAAI;AAEJ,QAAI,aAAa,QAAQ;AACvB,mBAAa,UAAU,IAAI,SAAU,KAAK;AACxC,eAAO,YAAY,QAAQ;AAAA;AAAA,eAEpB,QAAQ;AACjB,mBAAa,OAAO,OAAO,SAAU,MAAM,MAAM;AAC/C,YAAI,KAAK,KAAK;AACZ,eAAK,KAAK,YAAY,KAAK,IAAI,QAAQ,KAAK,IAAI;AAAA;AAGlD,eAAO;AAAA,SACN;AAAA;AAGL,QAAI,cAAc;AAElB,QAAI,eAAe,QAAQ,iBAAiB,MAAM;AAChD,UAAI,qBAAqB,cAAc;AAEvC,UAAI,aAAa,qBAAqB;AACpC,sBAAc;AAAA;AAAA;AAIlB,WAAO,iBAAiB,uBAAuB,QAAQ;AAAA,MACrD,MAAM;AAAA,QACJ,OAAO;AAAA;AAAA,MAET,SAAS;AAAA,QACP,OAAO;AAAA,QAIP,YAAY;AAAA,QACZ,UAAU;AAAA;AAAA,MAEZ,WAAW;AAAA,QAGT,OAAQ,eAAc,gBAAgB,QAAQ,gBAAgB,SAAS,cAAc;AAAA,QAIrF,YAAY,cAAc;AAAA;AAAA,MAE5B,MAAM;AAAA,QAGJ,OAAO,SAAS,QAAQ,SAAS,SAAS,OAAO;AAAA,QAIjD,YAAY,QAAQ;AAAA;AAAA,MAEtB,OAAO;AAAA,QACL,OAAO,WAAW,QAAQ,WAAW,SAAS,SAAS;AAAA;AAAA,MAEzD,QAAQ;AAAA,QACN,OAAQ,YAAW,aAAa,QAAQ,aAAa,SAAS,WAAW;AAAA;AAAA,MAE3E,WAAW;AAAA,QACT,OAAQ,eAAc,gBAAgB,QAAQ,gBAAgB,SAAS,cAAc;AAAA;AAAA,MAEvF,eAAe;AAAA,QACb,OAAO;AAAA;AAAA,MAET,YAAY;AAAA,QAGV,OAAQ,gBAAe,iBAAiB,QAAQ,iBAAiB,SAAS,eAAe;AAAA,QAIzF,YAAY,eAAe;AAAA;AAAA;AAI/B,QAAI,kBAAkB,QAAQ,kBAAkB,UAAU,cAAc,OAAO;AAC7E,aAAO,eAAe,uBAAuB,QAAQ,SAAS;AAAA,QAC5D,OAAO,cAAc;AAAA,QACrB,UAAU;AAAA,QACV,cAAc;AAAA;AAEhB,aAAO,2BAA2B;AAAA;AAIpC,QAAI,MAAM,mBAAmB;AAC3B,YAAM,kBAAkB,uBAAuB,QAAQ;AAAA,WAClD;AACL,aAAO,eAAe,uBAAuB,QAAQ,SAAS;AAAA,QAC5D,OAAO,QAAQ;AAAA,QACf,UAAU;AAAA,QACV,cAAc;AAAA;AAAA;AAIlB,WAAO;AAAA;AAGT,eAAa,eAAc,CAAC;AAAA,IAC1B,KAAK;AAAA,IACL,OAAO,qBAAoB;AACzB,aAAO,WAAW;AAAA;AAAA,KAInB;AAAA,IACD,KAAK;AAAA,IACL,KAAK,eAAe;AAClB,aAAO;AAAA;AAAA;AAIX,SAAO;AAAA,EACO,iCAAiB;AAM1B,oBAAoB,OAAO;AAChC,MAAI,SAAS,MAAM;AAEnB,MAAI,MAAM,OAAO;AACf,aAAS,MAAM,GAAG,gBAAgB,MAAM,OAAO,MAAM,cAAc,QAAQ,OAAO;AAChF,UAAI,OAAO,cAAc;AAEzB,UAAI,KAAK,KAAK;AACZ,kBAAU,SAAS,cAAc,KAAK;AAAA;AAAA;AAAA,aAGjC,MAAM,UAAU,MAAM,WAAW;AAC1C,aAAS,MAAM,GAAG,oBAAoB,MAAM,WAAW,MAAM,kBAAkB,QAAQ,OAAO;AAC5F,UAAI,WAAW,kBAAkB;AACjC,gBAAU,SAAS,oBAAoB,MAAM,QAAQ;AAAA;AAAA;AAIzD,SAAO;AAAA;;;AC1QF,qBAAqB,QAAQ,UAAU,aAAa;AACzD,SAAO,IAAI,aAAa,iBAAiB,OAAO,cAAc,QAAW,QAAQ,CAAC;AAAA;;;ACJ7E,IAAI,OAAO,OAAO,OAAO;AAAA,EAE9B,MAAM;AAAA,EAEN,UAAU;AAAA,EACV,sBAAsB;AAAA,EACtB,qBAAqB;AAAA,EACrB,eAAe;AAAA,EACf,OAAO;AAAA,EACP,UAAU;AAAA,EAEV,iBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,qBAAqB;AAAA,EAErB,UAAU;AAAA,EACV,KAAK;AAAA,EACL,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,cAAc;AAAA,EAEd,WAAW;AAAA,EAEX,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,eAAe;AAAA,EAEf,mBAAmB;AAAA,EACnB,2BAA2B;AAAA,EAE3B,wBAAwB;AAAA,EACxB,wBAAwB;AAAA,EACxB,kBAAkB;AAAA,EAClB,wBAAwB;AAAA,EACxB,2BAA2B;AAAA,EAC3B,uBAAuB;AAAA,EACvB,sBAAsB;AAAA,EACtB,uBAAuB;AAAA,EACvB,8BAA8B;AAAA,EAE9B,sBAAsB;AAAA,EAEtB,kBAAkB;AAAA,EAElB,uBAAuB;AAAA,EACvB,uBAAuB;AAAA,EACvB,0BAA0B;AAAA,EAC1B,sBAAsB;AAAA,EACtB,qBAAqB;AAAA,EACrB,6BAA6B;AAAA;;;ACzDhB,oBAAmB,WAAW,SAAS;AACpD,MAAI,mBAAmB,QAAQ;AAE/B,MAAI,CAAC,kBAAkB;AACrB,UAAM,IAAI,MAAM,WAAW,OAAO,UAAU;AAAA;AAAA;;;ACHhD,IAAI,4BAA4B,OAAO,WAAW,cAAc,OAAO,OAAO,QAAQ,aAAa,OAAO,IAAI,gCAAgC;AAC9I,IAAO,oCAAQ;;;ACIA,uBAAuB,aAAa;AACjD,MAAI,KAAK,YAAY,UAAU;AAC/B,SAAO,OAAO,cAAc,WAAU;AACtC,cAAY,UAAU,UAAU;AAEhC,MAAI,mCAA2B;AAC7B,gBAAY,UAAU,qCAA6B;AAAA;AAAA;;;ACNhD,IAAI,WAAwB,2BAAY;AAoB7C,qBAAkB,YAAY,UAAU,QAAQ;AAC9C,SAAK,QAAQ,WAAW;AACxB,SAAK,MAAM,SAAS;AACpB,SAAK,aAAa;AAClB,SAAK,WAAW;AAChB,SAAK,SAAS;AAAA;AAGhB,MAAI,SAAS,UAAS;AAEtB,SAAO,SAAS,kBAAkB;AAChC,WAAO;AAAA,MACL,OAAO,KAAK;AAAA,MACZ,KAAK,KAAK;AAAA;AAAA;AAId,SAAO;AAAA;AAGT,cAAc;AAMP,IAAI,QAAqB,2BAAY;AA8B1C,kBAAe,MAAM,OAAO,KAAK,MAAM,QAAQ,MAAM,OAAO;AAC1D,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,MAAM;AACX,SAAK,OAAO;AACZ,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,SAAK,OAAO;AACZ,SAAK,OAAO;AAAA;AAGd,MAAI,UAAU,OAAM;AAEpB,UAAQ,SAAS,kBAAkB;AACjC,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,MACX,QAAQ,KAAK;AAAA;AAAA;AAIjB,SAAO;AAAA;AAGT,cAAc;AAKP,gBAAgB,WAAW;AAChC,SAAO,aAAa,QAAQ,OAAO,UAAU,SAAS;AAAA;;;AC7GjD,IAAI,YAAY,OAAO,OAAO;AAAA,EACnC,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,KAAK;AAAA,EACL,SAAS;AAAA,EACT,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,IAAI;AAAA,EACJ,WAAW;AAAA,EACX,WAAW;AAAA,EACX,SAAS;AAAA,EACT,MAAM;AAAA,EACN,SAAS;AAAA,EACT,MAAM;AAAA,EACN,KAAK;AAAA,EACL,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,cAAc;AAAA,EACd,SAAS;AAAA;;;AC1BX,kBAAiB,KAAK;AAAE;AAA2B,MAAI,OAAO,WAAW,cAAc,OAAO,OAAO,aAAa,UAAU;AAAE,eAAU,kBAAiB,MAAK;AAAE,aAAO,OAAO;AAAA;AAAA,SAAe;AAAE,eAAU,kBAAiB,MAAK;AAAE,aAAO,QAAO,OAAO,WAAW,cAAc,KAAI,gBAAgB,UAAU,SAAQ,OAAO,YAAY,WAAW,OAAO;AAAA;AAAA;AAAU,SAAO,SAAQ;AAAA;AAInX,IAAI,mBAAmB;AACvB,IAAI,sBAAsB;AAKX,iBAAiB,OAAO;AACrC,SAAO,YAAY,OAAO;AAAA;AAG5B,qBAAqB,OAAO,YAAY;AACtC,UAAQ,SAAQ;AAAA,SACT;AACH,aAAO,KAAK,UAAU;AAAA,SAEnB;AACH,aAAO,MAAM,OAAO,aAAa,OAAO,MAAM,MAAM,OAAO;AAAA,SAExD;AACH,UAAI,UAAU,MAAM;AAClB,eAAO;AAAA;AAGT,aAAO,kBAAkB,OAAO;AAAA;AAGhC,aAAO,OAAO;AAAA;AAAA;AAIpB,2BAA2B,OAAO,sBAAsB;AACtD,MAAI,qBAAqB,QAAQ,WAAW,IAAI;AAC9C,WAAO;AAAA;AAGT,MAAI,aAAa,GAAG,OAAO,sBAAsB,CAAC;AAClD,MAAI,kBAAkB,YAAY;AAElC,MAAI,oBAAoB,QAAW;AACjC,QAAI,cAAc,gBAAgB,KAAK;AAEvC,QAAI,gBAAgB,OAAO;AACzB,aAAO,OAAO,gBAAgB,WAAW,cAAc,YAAY,aAAa;AAAA;AAAA,aAEzE,MAAM,QAAQ,QAAQ;AAC/B,WAAO,YAAY,OAAO;AAAA;AAG5B,SAAO,aAAa,OAAO;AAAA;AAG7B,sBAAsB,QAAQ,YAAY;AACxC,MAAI,OAAO,OAAO,KAAK;AAEvB,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO;AAAA;AAGT,MAAI,WAAW,SAAS,qBAAqB;AAC3C,WAAO,MAAM,aAAa,UAAU;AAAA;AAGtC,MAAI,aAAa,KAAK,IAAI,SAAU,KAAK;AACvC,QAAI,QAAQ,YAAY,OAAO,MAAM;AACrC,WAAO,MAAM,OAAO;AAAA;AAEtB,SAAO,OAAO,WAAW,KAAK,QAAQ;AAAA;AAGxC,qBAAqB,OAAO,YAAY;AACtC,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO;AAAA;AAGT,MAAI,WAAW,SAAS,qBAAqB;AAC3C,WAAO;AAAA;AAGT,MAAI,MAAM,KAAK,IAAI,kBAAkB,MAAM;AAC3C,MAAI,YAAY,MAAM,SAAS;AAC/B,MAAI,QAAQ;AAEZ,WAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,UAAM,KAAK,YAAY,MAAM,IAAI;AAAA;AAGnC,MAAI,cAAc,GAAG;AACnB,UAAM,KAAK;AAAA,aACF,YAAY,GAAG;AACxB,UAAM,KAAK,OAAO,OAAO,WAAW;AAAA;AAGtC,SAAO,MAAM,MAAM,KAAK,QAAQ;AAAA;AAGlC,qBAAqB,QAAQ;AAC3B,MAAI,kBAAkB,OAAO,OAAO;AAEpC,MAAI,OAAO,oBAAoB,YAAY;AACzC,WAAO;AAAA;AAGT,MAAI,OAAO,OAAO,YAAY,YAAY;AACxC,WAAO,OAAO;AAAA;AAAA;AAIlB,sBAAsB,QAAQ;AAC5B,MAAI,MAAM,OAAO,UAAU,SAAS,KAAK,QAAQ,QAAQ,cAAc,IAAI,QAAQ,MAAM;AAEzF,MAAI,QAAQ,YAAY,OAAO,OAAO,gBAAgB,YAAY;AAChE,QAAI,OAAO,OAAO,YAAY;AAE9B,QAAI,OAAO,SAAS,YAAY,SAAS,IAAI;AAC3C,aAAO;AAAA;AAAA;AAIX,SAAO;AAAA;;;AC1HM,mBAAmB,WAAW,SAAS;AACpD,MAAI,mBAAmB,QAAQ;AAE/B,MAAI,CAAC,kBAAkB;AACrB,UAAM,IAAI,MAAM;AAAA;AAAA;;;ACEpB,IAAO,qBAAQ,QAEf,oBAAoB,OAAO,aAAa;AACtC,SAAO,iBAAiB;AAAA,IAE1B,qBAAoB,OAAO,aAAa;AACtC,MAAI,iBAAiB,aAAa;AAChC,WAAO;AAAA;AAGT,MAAI,OAAO;AACT,QAAI,aAAa,MAAM;AACvB,QAAI,YAAY,YAAY;AAE5B,QAAI,aAAa,cAAc,WAAW,SAAS,WAAW;AAC5D,YAAM,IAAI,MAAM,cAAc,OAAO,WAAW,MAAO,OAAO,OAAO;AAAA;AAAA;AAIzE,SAAO;AAAA;;;ACzBT,4BAA2B,QAAQ,OAAO;AAAE,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAAE,QAAI,aAAa,MAAM;AAAI,eAAW,aAAa,WAAW,cAAc;AAAO,eAAW,eAAe;AAAM,QAAI,WAAW;AAAY,iBAAW,WAAW;AAAM,WAAO,eAAe,QAAQ,WAAW,KAAK;AAAA;AAAA;AAE7S,uBAAsB,aAAa,YAAY,aAAa;AAAE,MAAI;AAAY,uBAAkB,YAAY,WAAW;AAAa,MAAI;AAAa,uBAAkB,aAAa;AAAc,SAAO;AAAA;AAclM,IAAI,SAAsB,2BAAY;AAC3C,mBAAgB,MAAM;AACpB,QAAI,OAAO,UAAU,SAAS,KAAK,UAAU,OAAO,SAAY,UAAU,KAAK;AAC/E,QAAI,iBAAiB,UAAU,SAAS,KAAK,UAAU,OAAO,SAAY,UAAU,KAAK;AAAA,MACvF,MAAM;AAAA,MACN,QAAQ;AAAA;AAEV,WAAO,SAAS,YAAY,UAAU,GAAG,oCAAoC,OAAO,QAAQ,OAAO;AACnG,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,iBAAiB;AACtB,SAAK,eAAe,OAAO,KAAK,UAAU,GAAG;AAC7C,SAAK,eAAe,SAAS,KAAK,UAAU,GAAG;AAAA;AAIjD,gBAAa,SAAQ,CAAC;AAAA,IACpB,KAAK;AAAA,IACL,KAAK,eAAe;AAClB,aAAO;AAAA;AAAA;AAIX,SAAO;AAAA;AASF,kBAAkB,QAAQ;AAC/B,SAAO,mBAAW,QAAQ;AAAA;;;AC9CrB,IAAI,oBAAoB,OAAO,OAAO;AAAA,EAE3C,OAAO;AAAA,EACP,UAAU;AAAA,EACV,cAAc;AAAA,EACd,OAAO;AAAA,EACP,qBAAqB;AAAA,EACrB,iBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,qBAAqB;AAAA,EAErB,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,kBAAkB;AAAA,EAClB,qBAAqB;AAAA,EACrB,WAAW;AAAA,EACX,OAAO;AAAA,EACP,MAAM;AAAA,EACN,YAAY;AAAA,EACZ,cAAc;AAAA,EACd,wBAAwB;AAAA;;;AChBnB,gCAAgC,WAAW;AAEhD,MAAI,QAAQ,UAAU,MAAM;AAE5B,MAAI,eAAe,0BAA0B;AAE7C,MAAI,iBAAiB,GAAG;AACtB,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,YAAM,KAAK,MAAM,GAAG,MAAM;AAAA;AAAA;AAK9B,MAAI,YAAY;AAEhB,SAAO,YAAY,MAAM,UAAU,QAAQ,MAAM,aAAa;AAC5D,MAAE;AAAA;AAGJ,MAAI,UAAU,MAAM;AAEpB,SAAO,UAAU,aAAa,QAAQ,MAAM,UAAU,KAAK;AACzD,MAAE;AAAA;AAIJ,SAAO,MAAM,MAAM,WAAW,SAAS,KAAK;AAAA;AAG9C,iBAAiB,KAAK;AACpB,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AACnC,QAAI,IAAI,OAAO,OAAO,IAAI,OAAO,KAAM;AACrC,aAAO;AAAA;AAAA;AAIX,SAAO;AAAA;AAOF,mCAAmC,OAAO;AAC/C,MAAI;AAEJ,MAAI,cAAc;AAClB,MAAI,cAAc;AAClB,MAAI,UAAS;AACb,MAAI,eAAe;AAEnB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,GAAG;AACrC,YAAQ,MAAM,WAAW;AAAA,WAClB;AAEH,YAAI,MAAM,WAAW,IAAI,OAAO,IAAI;AAClC,YAAE;AAAA;AAAA,WAKD;AAEH,sBAAc;AACd,sBAAc;AACd,kBAAS;AACT;AAAA,WAEG;AAAA,WAEA;AAEH,UAAE;AACF;AAAA;AAGA,YAAI,eAAe,CAAC,eAAgB,kBAAiB,QAAQ,UAAS,eAAe;AACnF,yBAAe;AAAA;AAGjB,sBAAc;AAAA;AAAA;AAIpB,SAAQ,iBAAgB,kBAAkB,QAAQ,kBAAkB,SAAS,gBAAgB;AAAA;AAUxF,0BAA0B,OAAO;AACtC,MAAI,cAAc,UAAU,SAAS,KAAK,UAAU,OAAO,SAAY,UAAU,KAAK;AACtF,MAAI,sBAAsB,UAAU,SAAS,KAAK,UAAU,OAAO,SAAY,UAAU,KAAK;AAC9F,MAAI,eAAe,MAAM,QAAQ,UAAU;AAC3C,MAAI,kBAAkB,MAAM,OAAO,OAAO,MAAM,OAAO;AACvD,MAAI,mBAAmB,MAAM,MAAM,SAAS,OAAO;AACnD,MAAI,mBAAmB,MAAM,MAAM,SAAS,OAAO;AACnD,MAAI,uBAAuB,CAAC,gBAAgB,oBAAoB,oBAAoB;AACpF,MAAI,UAAS;AAEb,MAAI,wBAAwB,CAAE,iBAAgB,kBAAkB;AAC9D,eAAU,OAAO;AAAA;AAGnB,aAAU,cAAc,MAAM,QAAQ,OAAO,OAAO,eAAe;AAEnE,MAAI,sBAAsB;AACxB,eAAU;AAAA;AAGZ,SAAO,QAAQ,QAAO,QAAQ,QAAQ,WAAW;AAAA;;;AC7G5C,IAAI,QAAqB,2BAAY;AAgB1C,kBAAe,QAAQ;AACrB,QAAI,mBAAmB,IAAI,MAAM,UAAU,KAAK,GAAG,GAAG,GAAG,GAAG;AAC5D,SAAK,SAAS;AACd,SAAK,YAAY;AACjB,SAAK,QAAQ;AACb,SAAK,OAAO;AACZ,SAAK,YAAY;AAAA;AAOnB,MAAI,SAAS,OAAM;AAEnB,SAAO,UAAU,mBAAmB;AAClC,SAAK,YAAY,KAAK;AACtB,QAAI,QAAQ,KAAK,QAAQ,KAAK;AAC9B,WAAO;AAAA;AAQT,SAAO,YAAY,qBAAqB;AACtC,QAAI,QAAQ,KAAK;AAEjB,QAAI,MAAM,SAAS,UAAU,KAAK;AAChC,SAAG;AACD,YAAI;AAGJ,gBAAS,eAAc,MAAM,UAAU,QAAQ,gBAAgB,SAAS,cAAc,MAAM,OAAO,UAAU,MAAM;AAAA,eAC5G,MAAM,SAAS,UAAU;AAAA;AAGpC,WAAO;AAAA;AAGT,SAAO;AAAA;AAMF,+BAA+B,MAAM;AAC1C,SAAO,SAAS,UAAU,QAAQ,SAAS,UAAU,UAAU,SAAS,UAAU,OAAO,SAAS,UAAU,WAAW,SAAS,UAAU,WAAW,SAAS,UAAU,UAAU,SAAS,UAAU,SAAS,SAAS,UAAU,UAAU,SAAS,UAAU,MAAM,SAAS,UAAU,aAAa,SAAS,UAAU,aAAa,SAAS,UAAU,WAAW,SAAS,UAAU,QAAQ,SAAS,UAAU;AAAA;AAGlZ,uBAAuB,MAAM;AAC3B,SACE,MAAM,QAAQ,UAAU,MACxB,OAAO,MAAS,KAAK,UAAU,OAAO,aAAa,SACnD,OAAQ,OAAQ,QAAO,KAAK,SAAS,IAAI,eAAe,MAAM,KAAK;AAAA;AAYvE,mBAAmB,OAAO,MAAM;AAC9B,MAAI,SAAS,MAAM;AACnB,MAAI,OAAO,OAAO;AAClB,MAAI,aAAa,KAAK;AACtB,MAAI,MAAM,KAAK;AAEf,SAAO,MAAM,YAAY;AACvB,QAAI,OAAO,KAAK,WAAW;AAC3B,QAAI,QAAQ,MAAM;AAElB,QAAI,OAAO,IAAI,MAAM,MAAM;AAG3B,YAAQ;AAAA,WACD;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAEH,UAAE;AACF;AAAA,WAEG;AAEH,UAAE;AACF,UAAE,MAAM;AACR,cAAM,YAAY;AAClB;AAAA,WAEG;AAEH,YAAI,KAAK,WAAW,MAAM,OAAO,IAAI;AACnC,iBAAO;AAAA,eACF;AACL,YAAE;AAAA;AAGJ,UAAE,MAAM;AACR,cAAM,YAAY;AAClB;AAAA,WAEG;AAEH,eAAO,IAAI,MAAM,UAAU,MAAM,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA,WAEzD;AAEH,eAAO,YAAY,QAAQ,KAAK,OAAO,MAAM;AAAA,WAE1C;AAEH,eAAO,IAAI,MAAM,UAAU,QAAQ,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA,WAE3D;AAEH,eAAO,IAAI,MAAM,UAAU,KAAK,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA,WAExD;AAEH,eAAO,IAAI,MAAM,UAAU,SAAS,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA,WAE5D;AAEH,eAAO,IAAI,MAAM,UAAU,SAAS,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA,WAE5D;AAEH,YAAI,KAAK,WAAW,MAAM,OAAO,MAAM,KAAK,WAAW,MAAM,OAAO,IAAI;AACtE,iBAAO,IAAI,MAAM,UAAU,QAAQ,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA;AAGhE;AAAA,WAEG;AAEH,eAAO,IAAI,MAAM,UAAU,OAAO,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA,WAE1D;AAEH,eAAO,IAAI,MAAM,UAAU,QAAQ,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA,WAE3D;AAEH,eAAO,IAAI,MAAM,UAAU,IAAI,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA,WAEvD;AAEH,eAAO,IAAI,MAAM,UAAU,WAAW,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA,WAE9D;AAEH,eAAO,IAAI,MAAM,UAAU,WAAW,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA,WAE9D;AAEH,eAAO,IAAI,MAAM,UAAU,SAAS,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA,WAE5D;AAEH,eAAO,IAAI,MAAM,UAAU,MAAM,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA,WAEzD;AAEH,eAAO,IAAI,MAAM,UAAU,SAAS,KAAK,MAAM,GAAG,OAAO,MAAM;AAAA,WAE5D;AAEH,YAAI,KAAK,WAAW,MAAM,OAAO,MAAM,KAAK,WAAW,MAAM,OAAO,IAAI;AACtE,iBAAO,gBAAgB,QAAQ,KAAK,OAAO,MAAM,MAAM;AAAA;AAGzD,eAAO,WAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,WAEzC;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAEH,eAAO,WAAW,QAAQ,KAAK,MAAM,OAAO,MAAM;AAAA,WAE/C;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAAA,WAEA;AAEH,eAAO,SAAS,QAAQ,KAAK,OAAO,MAAM;AAAA;AAG9C,UAAM,YAAY,QAAQ,KAAK,2BAA2B;AAAA;AAG5D,MAAI,OAAO,MAAM;AACjB,MAAI,MAAM,IAAI,MAAM,MAAM;AAC1B,SAAO,IAAI,MAAM,UAAU,KAAK,YAAY,YAAY,MAAM,KAAK;AAAA;AAOrE,oCAAoC,MAAM;AACxC,MAAI,OAAO,MAAU,SAAS,KAAU,SAAS,MAAU,SAAS,IAAQ;AAC1E,WAAO,wCAAwC,OAAO,cAAc,OAAO;AAAA;AAG7E,MAAI,SAAS,IAAI;AAEf,WAAO;AAAA;AAGT,SAAO,yCAAyC,OAAO,cAAc,OAAO;AAAA;AAS9E,qBAAqB,QAAQ,OAAO,MAAM,KAAK,MAAM;AACnD,MAAI,OAAO,OAAO;AAClB,MAAI;AACJ,MAAI,WAAW;AAEf,KAAG;AACD,WAAO,KAAK,WAAW,EAAE;AAAA,WAClB,CAAC,MAAM,SAChB,QAAO,MAAU,SAAS;AAE1B,SAAO,IAAI,MAAM,UAAU,SAAS,OAAO,UAAU,MAAM,KAAK,MAAM,KAAK,MAAM,QAAQ,GAAG;AAAA;AAW9F,oBAAoB,QAAQ,OAAO,WAAW,MAAM,KAAK,MAAM;AAC7D,MAAI,OAAO,OAAO;AAClB,MAAI,OAAO;AACX,MAAI,WAAW;AACf,MAAI,UAAU;AAEd,MAAI,SAAS,IAAI;AAEf,WAAO,KAAK,WAAW,EAAE;AAAA;AAG3B,MAAI,SAAS,IAAI;AAEf,WAAO,KAAK,WAAW,EAAE;AAEzB,QAAI,QAAQ,MAAM,QAAQ,IAAI;AAC5B,YAAM,YAAY,QAAQ,UAAU,6CAA6C,OAAO,cAAc,OAAO;AAAA;AAAA,SAE1G;AACL,eAAW,WAAW,QAAQ,UAAU;AACxC,WAAO,KAAK,WAAW;AAAA;AAGzB,MAAI,SAAS,IAAI;AAEf,cAAU;AACV,WAAO,KAAK,WAAW,EAAE;AACzB,eAAW,WAAW,QAAQ,UAAU;AACxC,WAAO,KAAK,WAAW;AAAA;AAGzB,MAAI,SAAS,MAAM,SAAS,KAAK;AAE/B,cAAU;AACV,WAAO,KAAK,WAAW,EAAE;AAEzB,QAAI,SAAS,MAAM,SAAS,IAAI;AAE9B,aAAO,KAAK,WAAW,EAAE;AAAA;AAG3B,eAAW,WAAW,QAAQ,UAAU;AACxC,WAAO,KAAK,WAAW;AAAA;AAIzB,MAAI,SAAS,MAAM,YAAY,OAAO;AACpC,UAAM,YAAY,QAAQ,UAAU,2CAA2C,OAAO,cAAc,OAAO;AAAA;AAG7G,SAAO,IAAI,MAAM,UAAU,UAAU,QAAQ,UAAU,KAAK,OAAO,UAAU,MAAM,KAAK,MAAM,KAAK,MAAM,OAAO;AAAA;AAOlH,oBAAoB,QAAQ,OAAO,WAAW;AAC5C,MAAI,OAAO,OAAO;AAClB,MAAI,WAAW;AACf,MAAI,OAAO;AAEX,MAAI,QAAQ,MAAM,QAAQ,IAAI;AAE5B,OAAG;AACD,aAAO,KAAK,WAAW,EAAE;AAAA,aAClB,QAAQ,MAAM,QAAQ;AAG/B,WAAO;AAAA;AAGT,QAAM,YAAY,QAAQ,UAAU,2CAA2C,OAAO,cAAc,OAAO;AAAA;AAS7G,oBAAoB,QAAQ,OAAO,MAAM,KAAK,MAAM;AAClD,MAAI,OAAO,OAAO;AAClB,MAAI,WAAW,QAAQ;AACvB,MAAI,aAAa;AACjB,MAAI,OAAO;AACX,MAAI,QAAQ;AAEZ,SAAO,WAAW,KAAK,UAAU,CAAC,MAAM,OAAO,KAAK,WAAW,cAC/D,SAAS,MAAU,SAAS,IAAQ;AAElC,QAAI,SAAS,IAAI;AACf,eAAS,KAAK,MAAM,YAAY;AAChC,aAAO,IAAI,MAAM,UAAU,QAAQ,OAAO,WAAW,GAAG,MAAM,KAAK,MAAM;AAAA;AAI3E,QAAI,OAAO,MAAU,SAAS,GAAQ;AACpC,YAAM,YAAY,QAAQ,UAAU,oCAAoC,OAAO,cAAc,OAAO;AAAA;AAGtG,MAAE;AAEF,QAAI,SAAS,IAAI;AAEf,eAAS,KAAK,MAAM,YAAY,WAAW;AAC3C,aAAO,KAAK,WAAW;AAEvB,cAAQ;AAAA,aACD;AACH,mBAAS;AACT;AAAA,aAEG;AACH,mBAAS;AACT;AAAA,aAEG;AACH,mBAAS;AACT;AAAA,aAEG;AACH,mBAAS;AACT;AAAA,aAEG;AACH,mBAAS;AACT;AAAA,aAEG;AACH,mBAAS;AACT;AAAA,aAEG;AACH,mBAAS;AACT;AAAA,aAEG;AACH,mBAAS;AACT;AAAA,aAEG,KACH;AAEE,cAAI,WAAW,YAAY,KAAK,WAAW,WAAW,IAAI,KAAK,WAAW,WAAW,IAAI,KAAK,WAAW,WAAW,IAAI,KAAK,WAAW,WAAW;AAEnJ,cAAI,WAAW,GAAG;AAChB,gBAAI,kBAAkB,KAAK,MAAM,WAAW,GAAG,WAAW;AAC1D,kBAAM,YAAY,QAAQ,UAAU,yCAAyC,OAAO,iBAAiB;AAAA;AAGvG,mBAAS,OAAO,aAAa;AAC7B,sBAAY;AACZ;AAAA;AAAA;AAIF,gBAAM,YAAY,QAAQ,UAAU,wCAAwC,OAAO,OAAO,aAAa,OAAO;AAAA;AAGlH,QAAE;AACF,mBAAa;AAAA;AAAA;AAIjB,QAAM,YAAY,QAAQ,UAAU;AAAA;AAStC,yBAAyB,QAAQ,OAAO,MAAM,KAAK,MAAM,OAAO;AAC9D,MAAI,OAAO,OAAO;AAClB,MAAI,WAAW,QAAQ;AACvB,MAAI,aAAa;AACjB,MAAI,OAAO;AACX,MAAI,WAAW;AAEf,SAAO,WAAW,KAAK,UAAU,CAAC,MAAM,OAAO,KAAK,WAAW,YAAY;AAEzE,QAAI,SAAS,MAAM,KAAK,WAAW,WAAW,OAAO,MAAM,KAAK,WAAW,WAAW,OAAO,IAAI;AAC/F,kBAAY,KAAK,MAAM,YAAY;AACnC,aAAO,IAAI,MAAM,UAAU,cAAc,OAAO,WAAW,GAAG,MAAM,KAAK,MAAM,uBAAuB;AAAA;AAIxG,QAAI,OAAO,MAAU,SAAS,KAAU,SAAS,MAAU,SAAS,IAAQ;AAC1E,YAAM,YAAY,QAAQ,UAAU,oCAAoC,OAAO,cAAc,OAAO;AAAA;AAGtG,QAAI,SAAS,IAAI;AAEf,QAAE;AACF,QAAE,MAAM;AACR,YAAM,YAAY;AAAA,eACT,SAAS,IAAI;AAEtB,UAAI,KAAK,WAAW,WAAW,OAAO,IAAI;AACxC,oBAAY;AAAA,aACP;AACL,UAAE;AAAA;AAGJ,QAAE,MAAM;AACR,YAAM,YAAY;AAAA,eAEpB,SAAS,MAAM,KAAK,WAAW,WAAW,OAAO,MAAM,KAAK,WAAW,WAAW,OAAO,MAAM,KAAK,WAAW,WAAW,OAAO,IAAI;AACnI,kBAAY,KAAK,MAAM,YAAY,YAAY;AAC/C,kBAAY;AACZ,mBAAa;AAAA,WACR;AACL,QAAE;AAAA;AAAA;AAIN,QAAM,YAAY,QAAQ,UAAU;AAAA;AActC,qBAAqB,GAAG,GAAG,GAAG,GAAG;AAC/B,SAAO,SAAS,MAAM,KAAK,SAAS,MAAM,IAAI,SAAS,MAAM,IAAI,SAAS;AAAA;AAY5E,kBAAkB,GAAG;AACnB,SAAO,KAAK,MAAM,KAAK,KAAK,IAAI,KAC9B,KAAK,MAAM,KAAK,KAAK,IAAI,KACzB,KAAK,MAAM,KAAK,MAAM,IAAI,KAC1B;AAAA;AASJ,kBAAkB,QAAQ,OAAO,MAAM,KAAK,MAAM;AAChD,MAAI,OAAO,OAAO;AAClB,MAAI,aAAa,KAAK;AACtB,MAAI,WAAW,QAAQ;AACvB,MAAI,OAAO;AAEX,SAAO,aAAa,cAAc,CAAC,MAAM,OAAO,KAAK,WAAW,cAAe,UAAS,MACxF,QAAQ,MAAM,QAAQ,MACtB,QAAQ,MAAM,QAAQ,MACtB,QAAQ,MAAM,QAAQ,MACpB;AACA,MAAE;AAAA;AAGJ,SAAO,IAAI,MAAM,UAAU,MAAM,OAAO,UAAU,MAAM,KAAK,MAAM,KAAK,MAAM,OAAO;AAAA;AAIvF,qBAAqB,MAAM;AACzB,SAAO,SAAS,MAAM,QAAQ,MAAM,QAAQ,MAAM,QAAQ,MAAM,QAAQ;AAAA;;;ACnpBnE,eAAe,QAAQ,SAAS;AACrC,MAAI,SAAS,IAAI,OAAO,QAAQ;AAChC,SAAO,OAAO;AAAA;AAkDT,IAAI,SAAsB,2BAAY;AAC3C,mBAAgB,QAAQ,SAAS;AAC/B,QAAI,YAAY,SAAS,UAAU,SAAS,IAAI,OAAO;AACvD,SAAK,SAAS,IAAI,MAAM;AACxB,SAAK,WAAW;AAAA;AAOlB,MAAI,SAAS,QAAO;AAEpB,SAAO,YAAY,qBAAqB;AACtC,QAAI,QAAQ,KAAK,YAAY,UAAU;AACvC,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,OAAO,MAAM;AAAA,MACb,KAAK,KAAK,IAAI;AAAA;AAAA;AASlB,SAAO,gBAAgB,0BAAyB;AAC9C,QAAI,QAAQ,KAAK,OAAO;AACxB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,aAAa,KAAK,KAAK,UAAU,KAAK,KAAK,iBAAiB,UAAU;AAAA,MACtE,KAAK,KAAK,IAAI;AAAA;AAAA;AAelB,SAAO,kBAAkB,2BAA2B;AAClD,QAAI,KAAK,KAAK,UAAU,OAAO;AAC7B,cAAQ,KAAK,OAAO,MAAM;AAAA,aACnB;AAAA,aACA;AAAA,aACA;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA,aAET;AAAA,aACA;AAAA,aACA;AAAA,aACA;AAAA,aACA;AAAA,aACA;AAAA,aACA;AAAA,aACA;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA;AAAA,eAEP,KAAK,KAAK,UAAU,UAAU;AACvC,aAAO,KAAK;AAAA,eACH,KAAK,mBAAmB;AACjC,aAAO,KAAK;AAAA;AAGd,UAAM,KAAK;AAAA;AAUb,SAAO,2BAA2B,oCAAoC;AACpE,QAAI,QAAQ,KAAK,OAAO;AAExB,QAAI,KAAK,KAAK,UAAU,UAAU;AAChC,aAAO;AAAA,QACL,MAAM,KAAK;AAAA,QACX,WAAW;AAAA,QACX,MAAM;AAAA,QACN,qBAAqB;AAAA,QACrB,YAAY;AAAA,QACZ,cAAc,KAAK;AAAA,QACnB,KAAK,KAAK,IAAI;AAAA;AAAA;AAIlB,QAAI,YAAY,KAAK;AACrB,QAAI;AAEJ,QAAI,KAAK,KAAK,UAAU,OAAO;AAC7B,aAAO,KAAK;AAAA;AAGd,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA,qBAAqB,KAAK;AAAA,MAC1B,YAAY,KAAK,gBAAgB;AAAA,MACjC,cAAc,KAAK;AAAA,MACnB,KAAK,KAAK,IAAI;AAAA;AAAA;AAQlB,SAAO,qBAAqB,8BAA8B;AACxD,QAAI,iBAAiB,KAAK,YAAY,UAAU;AAEhD,YAAQ,eAAe;AAAA,WAChB;AACH,eAAO;AAAA,WAEJ;AACH,eAAO;AAAA,WAEJ;AACH,eAAO;AAAA;AAGX,UAAM,KAAK,WAAW;AAAA;AAOxB,SAAO,2BAA2B,oCAAoC;AACpE,WAAO,KAAK,aAAa,UAAU,SAAS,KAAK,yBAAyB,UAAU;AAAA;AAOtF,SAAO,0BAA0B,mCAAmC;AAClE,QAAI,QAAQ,KAAK,OAAO;AACxB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,UAAU,KAAK;AAAA,MACf,MAAO,MAAK,YAAY,UAAU,QAAQ,KAAK;AAAA,MAC/C,cAAc,KAAK,oBAAoB,UAAU,UAAU,KAAK,kBAAkB,QAAQ;AAAA,MAC1F,YAAY,KAAK,gBAAgB;AAAA,MACjC,KAAK,KAAK,IAAI;AAAA;AAAA;AAQlB,SAAO,gBAAgB,yBAAyB;AAC9C,QAAI,QAAQ,KAAK,OAAO;AACxB,SAAK,YAAY,UAAU;AAC3B,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,MAAM,KAAK;AAAA,MACX,KAAK,KAAK,IAAI;AAAA;AAAA;AAQlB,SAAO,oBAAoB,6BAA6B;AACtD,QAAI,QAAQ,KAAK,OAAO;AACxB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,YAAY,KAAK,KAAK,UAAU,SAAS,KAAK,gBAAgB,UAAU;AAAA,MACxE,KAAK,KAAK,IAAI;AAAA;AAAA;AAWlB,SAAO,iBAAiB,0BAA0B;AAChD,WAAO,KAAK,KAAK,UAAU,UAAU,KAAK,kBAAkB,KAAK;AAAA;AASnE,SAAO,aAAa,sBAAsB;AACxC,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,cAAc,KAAK;AACvB,QAAI;AACJ,QAAI;AAEJ,QAAI,KAAK,oBAAoB,UAAU,QAAQ;AAC7C,cAAQ;AACR,aAAO,KAAK;AAAA,WACP;AACL,aAAO;AAAA;AAGT,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA,WAAW,KAAK,eAAe;AAAA,MAC/B,YAAY,KAAK,gBAAgB;AAAA,MACjC,cAAc,KAAK,KAAK,UAAU,WAAW,KAAK,sBAAsB;AAAA,MACxE,KAAK,KAAK,IAAI;AAAA;AAAA;AAQlB,SAAO,iBAAiB,wBAAwB,SAAS;AACvD,QAAI,OAAO,UAAU,KAAK,qBAAqB,KAAK;AACpD,WAAO,KAAK,aAAa,UAAU,SAAS,MAAM,UAAU;AAAA;AAO9D,SAAO,gBAAgB,yBAAyB;AAC9C,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,OAAO,KAAK;AAChB,SAAK,YAAY,UAAU;AAC3B,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA,OAAO,KAAK,kBAAkB;AAAA,MAC9B,KAAK,KAAK,IAAI;AAAA;AAAA;AAIlB,SAAO,qBAAqB,8BAA8B;AACxD,QAAI,QAAQ,KAAK,OAAO;AACxB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,MAAM,KAAK;AAAA,MACX,OAAQ,MAAK,YAAY,UAAU,QAAQ,KAAK,kBAAkB;AAAA,MAClE,KAAK,KAAK,IAAI;AAAA;AAAA;AAalB,SAAO,gBAAgB,yBAAyB;AAC9C,QAAI,QAAQ,KAAK,OAAO;AACxB,SAAK,YAAY,UAAU;AAC3B,QAAI,mBAAmB,KAAK,sBAAsB;AAElD,QAAI,CAAC,oBAAoB,KAAK,KAAK,UAAU,OAAO;AAClD,aAAO;AAAA,QACL,MAAM,KAAK;AAAA,QACX,MAAM,KAAK;AAAA,QACX,YAAY,KAAK,gBAAgB;AAAA,QACjC,KAAK,KAAK,IAAI;AAAA;AAAA;AAIlB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,eAAe,mBAAmB,KAAK,mBAAmB;AAAA,MAC1D,YAAY,KAAK,gBAAgB;AAAA,MACjC,cAAc,KAAK;AAAA,MACnB,KAAK,KAAK,IAAI;AAAA;AAAA;AAWlB,SAAO,0BAA0B,mCAAmC;AAClE,QAAI;AAEJ,QAAI,QAAQ,KAAK,OAAO;AACxB,SAAK,cAAc;AAInB,QAAM,mBAAiB,KAAK,cAAc,QAAQ,mBAAmB,SAAS,SAAS,eAAe,mCAAmC,MAAM;AAC7I,aAAO;AAAA,QACL,MAAM,KAAK;AAAA,QACX,MAAM,KAAK;AAAA,QACX,qBAAqB,KAAK;AAAA,QAC1B,eAAgB,MAAK,cAAc,OAAO,KAAK;AAAA,QAC/C,YAAY,KAAK,gBAAgB;AAAA,QACjC,cAAc,KAAK;AAAA,QACnB,KAAK,KAAK,IAAI;AAAA;AAAA;AAIlB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,MAAM,KAAK;AAAA,MACX,eAAgB,MAAK,cAAc,OAAO,KAAK;AAAA,MAC/C,YAAY,KAAK,gBAAgB;AAAA,MACjC,cAAc,KAAK;AAAA,MACnB,KAAK,KAAK,IAAI;AAAA;AAAA;AAQlB,SAAO,oBAAoB,6BAA6B;AACtD,QAAI,KAAK,OAAO,MAAM,UAAU,MAAM;AACpC,YAAM,KAAK;AAAA;AAGb,WAAO,KAAK;AAAA;AAuBd,SAAO,oBAAoB,2BAA2B,SAAS;AAC7D,QAAI,QAAQ,KAAK,OAAO;AAExB,YAAQ,MAAM;AAAA,WACP,UAAU;AACb,eAAO,KAAK,UAAU;AAAA,WAEnB,UAAU;AACb,eAAO,KAAK,YAAY;AAAA,WAErB,UAAU;AACb,aAAK,OAAO;AAEZ,eAAO;AAAA,UACL,MAAM,KAAK;AAAA,UACX,OAAO,MAAM;AAAA,UACb,KAAK,KAAK,IAAI;AAAA;AAAA,WAGb,UAAU;AACb,aAAK,OAAO;AAEZ,eAAO;AAAA,UACL,MAAM,KAAK;AAAA,UACX,OAAO,MAAM;AAAA,UACb,KAAK,KAAK,IAAI;AAAA;AAAA,WAGb,UAAU;AAAA,WACV,UAAU;AACb,eAAO,KAAK;AAAA,WAET,UAAU;AACb,aAAK,OAAO;AAEZ,gBAAQ,MAAM;AAAA,eACP;AACH,mBAAO;AAAA,cACL,MAAM,KAAK;AAAA,cACX,OAAO;AAAA,cACP,KAAK,KAAK,IAAI;AAAA;AAAA,eAGb;AACH,mBAAO;AAAA,cACL,MAAM,KAAK;AAAA,cACX,OAAO;AAAA,cACP,KAAK,KAAK,IAAI;AAAA;AAAA,eAGb;AACH,mBAAO;AAAA,cACL,MAAM,KAAK;AAAA,cACX,KAAK,KAAK,IAAI;AAAA;AAAA;AAIhB,mBAAO;AAAA,cACL,MAAM,KAAK;AAAA,cACX,OAAO,MAAM;AAAA,cACb,KAAK,KAAK,IAAI;AAAA;AAAA;AAAA,WAIjB,UAAU;AACb,YAAI,CAAC,SAAS;AACZ,iBAAO,KAAK;AAAA;AAGd;AAAA;AAGJ,UAAM,KAAK;AAAA;AAGb,SAAO,qBAAqB,8BAA8B;AACxD,QAAI,QAAQ,KAAK,OAAO;AAExB,SAAK,OAAO;AAEZ,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,OAAO,MAAM;AAAA,MACb,OAAO,MAAM,SAAS,UAAU;AAAA,MAChC,KAAK,KAAK,IAAI;AAAA;AAAA;AAUlB,SAAO,YAAY,mBAAmB,SAAS;AAC7C,QAAI,QAAQ;AAEZ,QAAI,QAAQ,KAAK,OAAO;AAExB,QAAI,OAAO,iBAAgB;AACzB,aAAO,MAAM,kBAAkB;AAAA;AAGjC,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,QAAQ,KAAK,IAAI,UAAU,WAAW,MAAM,UAAU;AAAA,MACtD,KAAK,KAAK,IAAI;AAAA;AAAA;AAUlB,SAAO,cAAc,qBAAqB,SAAS;AACjD,QAAI,SAAS;AAEb,QAAI,QAAQ,KAAK,OAAO;AAExB,QAAI,OAAO,iBAAgB;AACzB,aAAO,OAAO,iBAAiB;AAAA;AAGjC,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,QAAQ,KAAK,IAAI,UAAU,SAAS,MAAM,UAAU;AAAA,MACpD,KAAK,KAAK,IAAI;AAAA;AAAA;AAQlB,SAAO,mBAAmB,0BAA0B,SAAS;AAC3D,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,OAAO,KAAK;AAChB,SAAK,YAAY,UAAU;AAC3B,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA,OAAO,KAAK,kBAAkB;AAAA,MAC9B,KAAK,KAAK,IAAI;AAAA;AAAA;AASlB,SAAO,kBAAkB,yBAAyB,SAAS;AACzD,QAAI,aAAa;AAEjB,WAAO,KAAK,KAAK,UAAU,KAAK;AAC9B,iBAAW,KAAK,KAAK,eAAe;AAAA;AAGtC,WAAO;AAAA;AAOT,SAAO,iBAAiB,wBAAwB,SAAS;AACvD,QAAI,QAAQ,KAAK,OAAO;AACxB,SAAK,YAAY,UAAU;AAC3B,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,MAAM,KAAK;AAAA,MACX,WAAW,KAAK,eAAe;AAAA,MAC/B,KAAK,KAAK,IAAI;AAAA;AAAA;AAYlB,SAAO,qBAAqB,8BAA8B;AACxD,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI;AAEJ,QAAI,KAAK,oBAAoB,UAAU,YAAY;AACjD,aAAO,KAAK;AACZ,WAAK,YAAY,UAAU;AAC3B,aAAO;AAAA,QACL,MAAM,KAAK;AAAA,QACX;AAAA,QACA,KAAK,KAAK,IAAI;AAAA;AAAA,WAEX;AACL,aAAO,KAAK;AAAA;AAGd,QAAI,KAAK,oBAAoB,UAAU,OAAO;AAC5C,aAAO;AAAA,QACL,MAAM,KAAK;AAAA,QACX;AAAA,QACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAIlB,WAAO;AAAA;AAOT,SAAO,iBAAiB,0BAA0B;AAChD,QAAI,QAAQ,KAAK,OAAO;AACxB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,MAAM,KAAK;AAAA,MACX,KAAK,KAAK,IAAI;AAAA;AAAA;AAoBlB,SAAO,4BAA4B,qCAAqC;AAEtE,QAAI,eAAe,KAAK,oBAAoB,KAAK,OAAO,cAAc,KAAK,OAAO;AAElF,QAAI,aAAa,SAAS,UAAU,MAAM;AACxC,cAAQ,aAAa;AAAA,aACd;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA;AAAA;AAIlB,UAAM,KAAK,WAAW;AAAA;AAGxB,SAAO,kBAAkB,2BAA2B;AAClD,WAAO,KAAK,KAAK,UAAU,WAAW,KAAK,KAAK,UAAU;AAAA;AAO5D,SAAO,mBAAmB,4BAA4B;AACpD,QAAI,KAAK,mBAAmB;AAC1B,aAAO,KAAK;AAAA;AAAA;AAQhB,SAAO,wBAAwB,iCAAiC;AAC9D,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,cAAc,KAAK;AACvB,SAAK,cAAc;AACnB,QAAI,aAAa,KAAK,gBAAgB;AACtC,QAAI,iBAAiB,KAAK,KAAK,UAAU,SAAS,KAAK,8BAA8B,UAAU;AAC/F,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAQlB,SAAO,+BAA+B,wCAAwC;AAC5E,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,YAAY,KAAK;AACrB,SAAK,YAAY,UAAU;AAC3B,QAAI,OAAO,KAAK;AAChB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAQlB,SAAO,4BAA4B,qCAAqC;AACtE,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,cAAc,KAAK;AACvB,SAAK,cAAc;AACnB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK,gBAAgB;AACtC,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAUlB,SAAO,4BAA4B,qCAAqC;AACtE,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,cAAc,KAAK;AACvB,SAAK,cAAc;AACnB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK;AACtB,QAAI,aAAa,KAAK,gBAAgB;AACtC,QAAI,SAAS,KAAK;AAClB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAUlB,SAAO,4BAA4B,qCAAqC;AACtE,QAAI;AAEJ,QAAI,CAAC,KAAK,sBAAsB,eAAe;AAC7C,aAAO;AAAA;AAGT,QAAM,oBAAkB,KAAK,cAAc,QAAQ,oBAAoB,SAAS,SAAS,gBAAgB,wCAAwC,MAAM;AACrJ,UAAI,QAAQ;AAEZ,WAAK,oBAAoB,UAAU;AAEnC,SAAG;AACD,cAAM,KAAK,KAAK;AAAA,eACT,KAAK,oBAAoB,UAAU,QAAQ,KAAK,KAAK,UAAU;AAExE,aAAO;AAAA;AAGT,WAAO,KAAK,cAAc,UAAU,KAAK,KAAK;AAAA;AAOhD,SAAO,wBAAwB,iCAAiC;AAC9D,QAAI;AAGJ,QAAM,oBAAkB,KAAK,cAAc,QAAQ,oBAAoB,SAAS,SAAS,gBAAgB,+BAA+B,QAAQ,KAAK,KAAK,UAAU,YAAY,KAAK,OAAO,YAAY,SAAS,UAAU,SAAS;AAClO,WAAK,OAAO;AAEZ,WAAK,OAAO;AAEZ,aAAO;AAAA;AAGT,WAAO,KAAK,aAAa,UAAU,SAAS,KAAK,sBAAsB,UAAU;AAAA;AAQnF,SAAO,uBAAuB,gCAAgC;AAC5D,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,cAAc,KAAK;AACvB,QAAI,OAAO,KAAK;AAChB,QAAI,OAAO,KAAK;AAChB,SAAK,YAAY,UAAU;AAC3B,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK,gBAAgB;AACtC,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA,WAAW;AAAA,MACX;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAQlB,SAAO,oBAAoB,6BAA6B;AACtD,WAAO,KAAK,aAAa,UAAU,SAAS,KAAK,oBAAoB,UAAU;AAAA;AAQjF,SAAO,qBAAqB,8BAA8B;AACxD,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,cAAc,KAAK;AACvB,QAAI,OAAO,KAAK;AAChB,SAAK,YAAY,UAAU;AAC3B,QAAI,OAAO,KAAK;AAChB,QAAI;AAEJ,QAAI,KAAK,oBAAoB,UAAU,SAAS;AAC9C,qBAAe,KAAK,kBAAkB;AAAA;AAGxC,QAAI,aAAa,KAAK,gBAAgB;AACtC,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AASlB,SAAO,+BAA+B,wCAAwC;AAC5E,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,cAAc,KAAK;AACvB,SAAK,cAAc;AACnB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK;AACtB,QAAI,aAAa,KAAK,gBAAgB;AACtC,QAAI,SAAS,KAAK;AAClB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AASlB,SAAO,2BAA2B,oCAAoC;AACpE,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,cAAc,KAAK;AACvB,SAAK,cAAc;AACnB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK,gBAAgB;AACtC,QAAI,QAAQ,KAAK;AACjB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAUlB,SAAO,wBAAwB,iCAAiC;AAC9D,WAAO,KAAK,oBAAoB,UAAU,UAAU,KAAK,cAAc,UAAU,MAAM,KAAK,kBAAkB;AAAA;AAQhH,SAAO,0BAA0B,mCAAmC;AAClE,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,cAAc,KAAK;AACvB,SAAK,cAAc;AACnB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK,gBAAgB;AACtC,QAAI,SAAS,KAAK;AAClB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAQlB,SAAO,4BAA4B,qCAAqC;AACtE,WAAO,KAAK,aAAa,UAAU,SAAS,KAAK,0BAA0B,UAAU;AAAA;AASvF,SAAO,2BAA2B,oCAAoC;AACpE,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,cAAc,KAAK;AACvB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK,gBAAgB;AACtC,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AASlB,SAAO,iCAAiC,0CAA0C;AAChF,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,cAAc,KAAK;AACvB,SAAK,cAAc;AACnB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK,gBAAgB;AACtC,QAAI,SAAS,KAAK;AAClB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAQlB,SAAO,6BAA6B,sCAAsC;AACxE,WAAO,KAAK,aAAa,UAAU,SAAS,KAAK,oBAAoB,UAAU;AAAA;AAiBjF,SAAO,2BAA2B,oCAAoC;AACpE,QAAI,eAAe,KAAK,OAAO;AAE/B,QAAI,aAAa,SAAS,UAAU,MAAM;AACxC,cAAQ,aAAa;AAAA,aACd;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA,aAET;AACH,iBAAO,KAAK;AAAA;AAAA;AAIlB,UAAM,KAAK,WAAW;AAAA;AASxB,SAAO,uBAAuB,gCAAgC;AAC5D,QAAI,QAAQ,KAAK,OAAO;AACxB,SAAK,cAAc;AACnB,SAAK,cAAc;AACnB,QAAI,aAAa,KAAK,gBAAgB;AACtC,QAAI,iBAAiB,KAAK,aAAa,UAAU,SAAS,KAAK,8BAA8B,UAAU;AAEvG,QAAI,WAAW,WAAW,KAAK,eAAe,WAAW,GAAG;AAC1D,YAAM,KAAK;AAAA;AAGb,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AASlB,SAAO,2BAA2B,oCAAoC;AACpE,QAAI,QAAQ,KAAK,OAAO;AACxB,SAAK,cAAc;AACnB,SAAK,cAAc;AACnB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK,gBAAgB;AAEtC,QAAI,WAAW,WAAW,GAAG;AAC3B,YAAM,KAAK;AAAA;AAGb,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAWlB,SAAO,2BAA2B,oCAAoC;AACpE,QAAI,QAAQ,KAAK,OAAO;AACxB,SAAK,cAAc;AACnB,SAAK,cAAc;AACnB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK;AACtB,QAAI,aAAa,KAAK,gBAAgB;AACtC,QAAI,SAAS,KAAK;AAElB,QAAI,WAAW,WAAW,KAAK,WAAW,WAAW,KAAK,OAAO,WAAW,GAAG;AAC7E,YAAM,KAAK;AAAA;AAGb,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAWlB,SAAO,8BAA8B,uCAAuC;AAC1E,QAAI,QAAQ,KAAK,OAAO;AACxB,SAAK,cAAc;AACnB,SAAK,cAAc;AACnB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK;AACtB,QAAI,aAAa,KAAK,gBAAgB;AACtC,QAAI,SAAS,KAAK;AAElB,QAAI,WAAW,WAAW,KAAK,WAAW,WAAW,KAAK,OAAO,WAAW,GAAG;AAC7E,YAAM,KAAK;AAAA;AAGb,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAUlB,SAAO,0BAA0B,mCAAmC;AAClE,QAAI,QAAQ,KAAK,OAAO;AACxB,SAAK,cAAc;AACnB,SAAK,cAAc;AACnB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK,gBAAgB;AACtC,QAAI,QAAQ,KAAK;AAEjB,QAAI,WAAW,WAAW,KAAK,MAAM,WAAW,GAAG;AACjD,YAAM,KAAK;AAAA;AAGb,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAUlB,SAAO,yBAAyB,kCAAkC;AAChE,QAAI,QAAQ,KAAK,OAAO;AACxB,SAAK,cAAc;AACnB,SAAK,cAAc;AACnB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK,gBAAgB;AACtC,QAAI,SAAS,KAAK;AAElB,QAAI,WAAW,WAAW,KAAK,OAAO,WAAW,GAAG;AAClD,YAAM,KAAK;AAAA;AAGb,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAUlB,SAAO,gCAAgC,yCAAyC;AAC9E,QAAI,QAAQ,KAAK,OAAO;AACxB,SAAK,cAAc;AACnB,SAAK,cAAc;AACnB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK,gBAAgB;AACtC,QAAI,SAAS,KAAK;AAElB,QAAI,WAAW,WAAW,KAAK,OAAO,WAAW,GAAG;AAClD,YAAM,KAAK;AAAA;AAGb,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AASlB,SAAO,2BAA2B,oCAAoC;AACpE,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,cAAc,KAAK;AACvB,SAAK,cAAc;AACnB,SAAK,YAAY,UAAU;AAC3B,QAAI,OAAO,KAAK;AAChB,QAAI,OAAO,KAAK;AAChB,QAAI,aAAa,KAAK,sBAAsB;AAC5C,SAAK,cAAc;AACnB,QAAI,YAAY,KAAK;AACrB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA,WAAW;AAAA,MACX;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI;AAAA;AAAA;AAUlB,SAAO,0BAA0B,mCAAmC;AAClE,WAAO,KAAK,cAAc,UAAU,MAAM,KAAK;AAAA;AA+BjD,SAAO,yBAAyB,kCAAkC;AAChE,QAAI,QAAQ,KAAK,OAAO;AACxB,QAAI,OAAO,KAAK;AAEhB,QAAI,kBAAkB,KAAK,WAAW,QAAW;AAC/C,aAAO;AAAA;AAGT,UAAM,KAAK,WAAW;AAAA;AAQxB,SAAO,MAAM,aAAa,YAAY;AACpC,QAAI;AAEJ,QAAM,oBAAkB,KAAK,cAAc,QAAQ,oBAAoB,SAAS,SAAS,gBAAgB,gBAAgB,MAAM;AAC7H,aAAO,IAAI,SAAS,YAAY,KAAK,OAAO,WAAW,KAAK,OAAO;AAAA;AAAA;AAQvE,SAAO,OAAO,cAAc,MAAM;AAChC,WAAO,KAAK,OAAO,MAAM,SAAS;AAAA;AAQpC,SAAO,cAAc,qBAAqB,MAAM;AAC9C,QAAI,QAAQ,KAAK,OAAO;AAExB,QAAI,MAAM,SAAS,MAAM;AACvB,WAAK,OAAO;AAEZ,aAAO;AAAA;AAGT,UAAM,YAAY,KAAK,OAAO,QAAQ,MAAM,OAAO,YAAY,OAAO,iBAAiB,OAAO,YAAY,OAAO,aAAa,QAAQ;AAAA;AAQxI,SAAO,sBAAsB,6BAA6B,MAAM;AAC9D,QAAI,QAAQ,KAAK,OAAO;AAExB,QAAI,MAAM,SAAS,MAAM;AACvB,WAAK,OAAO;AAEZ,aAAO;AAAA;AAGT,WAAO;AAAA;AAQT,SAAO,gBAAgB,uBAAuB,OAAO;AACnD,QAAI,QAAQ,KAAK,OAAO;AAExB,QAAI,MAAM,SAAS,UAAU,QAAQ,MAAM,UAAU,OAAO;AAC1D,WAAK,OAAO;AAAA,WACP;AACL,YAAM,YAAY,KAAK,OAAO,QAAQ,MAAM,OAAO,aAAc,OAAO,OAAO,aAAc,OAAO,aAAa,QAAQ;AAAA;AAAA;AAS7H,SAAO,wBAAwB,+BAA+B,OAAO;AACnE,QAAI,QAAQ,KAAK,OAAO;AAExB,QAAI,MAAM,SAAS,UAAU,QAAQ,MAAM,UAAU,OAAO;AAC1D,WAAK,OAAO;AAEZ,aAAO;AAAA;AAGT,WAAO;AAAA;AAOT,SAAO,aAAa,oBAAoB,SAAS;AAC/C,QAAI,QAAQ,YAAY,QAAQ,YAAY,SAAS,UAAU,KAAK,OAAO;AAC3E,WAAO,YAAY,KAAK,OAAO,QAAQ,MAAM,OAAO,cAAc,OAAO,aAAa,QAAQ;AAAA;AAShG,SAAO,MAAM,aAAa,UAAU,SAAS,WAAW;AACtD,SAAK,YAAY;AACjB,QAAI,QAAQ;AAEZ,WAAO,CAAC,KAAK,oBAAoB,YAAY;AAC3C,YAAM,KAAK,QAAQ,KAAK;AAAA;AAG1B,WAAO;AAAA;AAUT,SAAO,eAAe,sBAAsB,UAAU,SAAS,WAAW;AACxE,QAAI,KAAK,oBAAoB,WAAW;AACtC,UAAI,QAAQ;AAEZ,SAAG;AACD,cAAM,KAAK,QAAQ,KAAK;AAAA,eACjB,CAAC,KAAK,oBAAoB;AAEnC,aAAO;AAAA;AAGT,WAAO;AAAA;AAST,SAAO,OAAO,cAAc,UAAU,SAAS,WAAW;AACxD,SAAK,YAAY;AACjB,QAAI,QAAQ;AAEZ,OAAG;AACD,YAAM,KAAK,QAAQ,KAAK;AAAA,aACjB,CAAC,KAAK,oBAAoB;AAEnC,WAAO;AAAA;AAST,SAAO,gBAAgB,uBAAuB,eAAe,SAAS;AACpE,SAAK,oBAAoB;AACzB,QAAI,QAAQ;AAEZ,OAAG;AACD,YAAM,KAAK,QAAQ,KAAK;AAAA,aACjB,KAAK,oBAAoB;AAElC,WAAO;AAAA;AAGT,SAAO;AAAA;AAMT,sBAAsB,OAAO;AAC3B,MAAI,QAAQ,MAAM;AAClB,SAAO,iBAAiB,MAAM,QAAS,UAAS,OAAO,KAAM,OAAO,OAAO,OAAQ;AAAA;AAOrF,0BAA0B,MAAM;AAC9B,SAAO,sBAAsB,QAAQ,IAAK,OAAO,MAAM,OAAQ;AAAA;;;AClgD1D,IAAI,oBAAoB;AAAA,EAC7B,MAAM;AAAA,EACN,UAAU,CAAC;AAAA,EACX,qBAAqB,CAAC,QAAQ,uBAAuB,cAAc;AAAA,EACnE,oBAAoB,CAAC,YAAY,QAAQ,gBAAgB;AAAA,EACzD,UAAU,CAAC;AAAA,EACX,cAAc,CAAC;AAAA,EACf,OAAO,CAAC,SAAS,QAAQ,aAAa,cAAc;AAAA,EACpD,UAAU,CAAC,QAAQ;AAAA,EACnB,gBAAgB,CAAC,QAAQ;AAAA,EACzB,gBAAgB,CAAC,iBAAiB,cAAc;AAAA,EAChD,oBAAoB;AAAA,IAAC;AAAA,IAErB;AAAA,IAAuB;AAAA,IAAiB;AAAA,IAAc;AAAA;AAAA,EACtD,UAAU;AAAA,EACV,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,cAAc;AAAA,EACd,WAAW;AAAA,EACX,WAAW;AAAA,EACX,WAAW,CAAC;AAAA,EACZ,aAAa,CAAC;AAAA,EACd,aAAa,CAAC,QAAQ;AAAA,EACtB,WAAW,CAAC,QAAQ;AAAA,EACpB,WAAW,CAAC;AAAA,EACZ,UAAU,CAAC;AAAA,EACX,aAAa,CAAC;AAAA,EACd,kBAAkB,CAAC,eAAe,cAAc;AAAA,EAChD,yBAAyB,CAAC;AAAA,EAC1B,sBAAsB,CAAC,eAAe,QAAQ;AAAA,EAC9C,sBAAsB,CAAC,eAAe,QAAQ,cAAc,cAAc;AAAA,EAC1E,iBAAiB,CAAC,eAAe,QAAQ,aAAa,QAAQ;AAAA,EAC9D,sBAAsB,CAAC,eAAe,QAAQ,QAAQ,gBAAgB;AAAA,EACtE,yBAAyB,CAAC,eAAe,QAAQ,cAAc,cAAc;AAAA,EAC7E,qBAAqB,CAAC,eAAe,QAAQ,cAAc;AAAA,EAC3D,oBAAoB,CAAC,eAAe,QAAQ,cAAc;AAAA,EAC1D,qBAAqB,CAAC,eAAe,QAAQ;AAAA,EAC7C,2BAA2B,CAAC,eAAe,QAAQ,cAAc;AAAA,EACjE,qBAAqB,CAAC,eAAe,QAAQ,aAAa;AAAA,EAC1D,iBAAiB,CAAC,cAAc;AAAA,EAChC,qBAAqB,CAAC,QAAQ;AAAA,EAC9B,qBAAqB,CAAC,QAAQ,cAAc,cAAc;AAAA,EAC1D,wBAAwB,CAAC,QAAQ,cAAc,cAAc;AAAA,EAC7D,oBAAoB,CAAC,QAAQ,cAAc;AAAA,EAC3C,mBAAmB,CAAC,QAAQ,cAAc;AAAA,EAC1C,0BAA0B,CAAC,QAAQ,cAAc;AAAA;AAE5C,IAAI,QAAQ,OAAO,OAAO;AAwF1B,eAAe,OAAM,SAAS;AACnC,MAAI,cAAc,UAAU,SAAS,KAAK,UAAU,OAAO,SAAY,UAAU,KAAK;AAGtF,MAAI,QAAQ;AACZ,MAAI,UAAU,MAAM,QAAQ;AAC5B,MAAI,OAAO,CAAC;AACZ,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,MAAI,OAAO;AACX,MAAI,MAAM;AACV,MAAI,SAAS;AACb,MAAI,OAAO;AACX,MAAI,YAAY;AAChB,MAAI,UAAU;AAGd,KAAG;AACD;AACA,QAAI,YAAY,UAAU,KAAK;AAC/B,QAAI,WAAW,aAAa,MAAM,WAAW;AAE7C,QAAI,WAAW;AACb,YAAM,UAAU,WAAW,IAAI,SAAY,KAAK,KAAK,SAAS;AAC9D,aAAO;AACP,eAAS,UAAU;AAEnB,UAAI,UAAU;AACZ,YAAI,SAAS;AACX,iBAAO,KAAK;AAAA,eACP;AACL,cAAI,QAAQ;AAEZ,mBAAS,MAAM,GAAG,gBAAgB,OAAO,KAAK,OAAO,MAAM,cAAc,QAAQ,OAAO;AACtF,gBAAI,IAAI,cAAc;AACtB,kBAAM,KAAK,KAAK;AAAA;AAGlB,iBAAO;AAAA;AAGT,YAAI,aAAa;AAEjB,iBAAS,KAAK,GAAG,KAAK,MAAM,QAAQ,MAAM;AACxC,cAAI,UAAU,MAAM,IAAI;AACxB,cAAI,YAAY,MAAM,IAAI;AAE1B,cAAI,SAAS;AACX,uBAAW;AAAA;AAGb,cAAI,WAAW,cAAc,MAAM;AACjC,iBAAK,OAAO,SAAS;AACrB;AAAA,iBACK;AACL,iBAAK,WAAW;AAAA;AAAA;AAAA;AAKtB,cAAQ,MAAM;AACd,aAAO,MAAM;AACb,cAAQ,MAAM;AACd,gBAAU,MAAM;AAChB,cAAQ,MAAM;AAAA,WACT;AACL,YAAM,SAAS,UAAU,QAAQ,KAAK,SAAS;AAC/C,aAAO,SAAS,OAAO,OAAO;AAE9B,UAAI,SAAS,QAAQ,SAAS,QAAW;AACvC;AAAA;AAGF,UAAI,QAAQ;AACV,aAAK,KAAK;AAAA;AAAA;AAId,QAAI,UAAS;AAEb,QAAI,CAAC,MAAM,QAAQ,OAAO;AACxB,UAAI,CAAC,OAAO,OAAO;AACjB,cAAM,IAAI,MAAM,qBAAqB,OAAO,QAAQ,OAAO;AAAA;AAG7D,UAAI,UAAU,WAAW,SAAS,KAAK,MAAM;AAE7C,UAAI,SAAS;AACX,kBAAS,QAAQ,KAAK,SAAS,MAAM,KAAK,QAAQ,MAAM;AAExD,YAAI,YAAW,OAAO;AACpB;AAAA;AAGF,YAAI,YAAW,OAAO;AACpB,cAAI,CAAC,WAAW;AACd,iBAAK;AACL;AAAA;AAAA,mBAEO,YAAW,QAAW;AAC/B,gBAAM,KAAK,CAAC,KAAK;AAEjB,cAAI,CAAC,WAAW;AACd,gBAAI,OAAO,UAAS;AAClB,qBAAO;AAAA,mBACF;AACL,mBAAK;AACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAOV,QAAI,YAAW,UAAa,UAAU;AACpC,YAAM,KAAK,CAAC,KAAK;AAAA;AAGnB,QAAI,WAAW;AACb,WAAK;AAAA,WACA;AACL,UAAI;AAEJ,cAAQ;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,MAAM;AAAA;AAER,gBAAU,MAAM,QAAQ;AACxB,aAAO,UAAU,OAAQ,yBAAwB,YAAY,KAAK,WAAW,QAAQ,0BAA0B,SAAS,wBAAwB;AAChJ,cAAQ;AACR,cAAQ;AAER,UAAI,QAAQ;AACV,kBAAU,KAAK;AAAA;AAGjB,eAAS;AAAA;AAAA,WAEJ,UAAU;AAEnB,MAAI,MAAM,WAAW,GAAG;AACtB,cAAU,MAAM,MAAM,SAAS,GAAG;AAAA;AAGpC,SAAO;AAAA;AA6DF,oBAAoB,SAAS,MAAM,WAAW;AACnD,MAAI,cAAc,QAAQ;AAE1B,MAAI,aAAa;AACf,QAAI,CAAC,aAAa,OAAO,gBAAgB,YAAY;AAEnD,aAAO;AAAA;AAGT,QAAI,sBAAsB,YAAY,YAAY,QAAQ,YAAY;AAEtE,QAAI,OAAO,wBAAwB,YAAY;AAE7C,aAAO;AAAA;AAAA,SAEJ;AACL,QAAI,kBAAkB,YAAY,QAAQ,QAAQ,QAAQ;AAE1D,QAAI,iBAAiB;AACnB,UAAI,OAAO,oBAAoB,YAAY;AAEzC,eAAO;AAAA;AAGT,UAAI,sBAAsB,gBAAgB;AAE1C,UAAI,OAAO,wBAAwB,YAAY;AAE7C,eAAO;AAAA;AAAA;AAAA;AAAA;;;ACnXR,eAAe,KAAK;AACzB,SAAO,MAAM,KAAK;AAAA,IAChB,OAAO;AAAA;AAAA;AAGX,IAAI,kBAAkB;AAEtB,IAAI,qBAAqB;AAAA,EACvB,MAAM,cAAc,MAAM;AACxB,WAAO,KAAK;AAAA;AAAA,EAEd,UAAU,kBAAkB,MAAM;AAChC,WAAO,MAAM,KAAK;AAAA;AAAA,EAGpB,UAAU,kBAAkB,MAAM;AAChC,WAAO,KAAK,KAAK,aAAa,UAAU;AAAA;AAAA,EAE1C,qBAAqB,6BAA6B,MAAM;AACtD,QAAI,KAAK,KAAK;AACd,QAAI,OAAO,KAAK;AAChB,QAAI,UAAU,KAAK,KAAK,KAAK,KAAK,qBAAqB,OAAO;AAC9D,QAAI,aAAa,KAAK,KAAK,YAAY;AACvC,QAAI,eAAe,KAAK;AAGxB,WAAO,CAAC,QAAQ,CAAC,cAAc,CAAC,WAAW,OAAO,UAAU,eAAe,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,WAAW,YAAY,eAAe;AAAA;AAAA,EAEzI,oBAAoB,4BAA4B,MAAM;AACpD,QAAI,WAAW,KAAK,UAChB,OAAO,KAAK,MACZ,eAAe,KAAK,cACpB,aAAa,KAAK;AACtB,WAAO,WAAW,OAAO,OAAO,KAAK,OAAO,gBAAgB,KAAK,KAAK,KAAK,YAAY;AAAA;AAAA,EAEzF,cAAc,sBAAsB,OAAO;AACzC,QAAI,aAAa,MAAM;AACvB,WAAO,MAAM;AAAA;AAAA,EAEf,OAAO,eAAe,OAAO;AAC3B,QAAI,QAAQ,MAAM,OACd,OAAO,MAAM,MACb,OAAO,MAAM,WACb,aAAa,MAAM,YACnB,eAAe,MAAM;AACzB,QAAI,SAAS,KAAK,IAAI,OAAO,QAAQ;AACrC,QAAI,WAAW,SAAS,KAAK,KAAK,KAAK,MAAM,OAAO;AAEpD,QAAI,SAAS,SAAS,iBAAiB;AACrC,iBAAW,SAAS,KAAK,OAAO,OAAO,KAAK,MAAM,QAAQ;AAAA;AAG5D,WAAO,KAAK,CAAC,UAAU,KAAK,YAAY,MAAM,eAAe;AAAA;AAAA,EAE/D,UAAU,kBAAkB,OAAO;AACjC,QAAI,OAAO,MAAM,MACb,QAAQ,MAAM;AAClB,WAAO,OAAO,OAAO;AAAA;AAAA,EAGvB,gBAAgB,wBAAwB,OAAO;AAC7C,QAAI,OAAO,MAAM,MACb,aAAa,MAAM;AACvB,WAAO,QAAQ,OAAO,KAAK,KAAK,KAAK,YAAY;AAAA;AAAA,EAEnD,gBAAgB,wBAAwB,OAAO;AAC7C,QAAI,gBAAgB,MAAM,eACtB,aAAa,MAAM,YACnB,eAAe,MAAM;AACzB,WAAO,KAAK,CAAC,OAAO,KAAK,OAAO,gBAAgB,KAAK,YAAY,MAAM,eAAe;AAAA;AAAA,EAExF,oBAAoB,4BAA4B,OAAO;AACrD,QAAI,OAAO,MAAM,MACb,gBAAgB,MAAM,eACtB,sBAAsB,MAAM,qBAC5B,aAAa,MAAM,YACnB,eAAe,MAAM;AACzB,WAEE,YAAY,OAAO,MAAM,OAAO,KAAK,KAAK,KAAK,qBAAqB,OAAO,MAAM,OAAO,MAAM,OAAO,eAAe,KAAK,OAAO,KAAK,IAAI,KAAK,YAAY,MAAM,QAAQ;AAAA;AAAA,EAI5K,UAAU,kBAAkB,OAAO;AACjC,QAAI,QAAQ,MAAM;AAClB,WAAO;AAAA;AAAA,EAET,YAAY,oBAAoB,OAAO;AACrC,QAAI,QAAQ,MAAM;AAClB,WAAO;AAAA;AAAA,EAET,aAAa,qBAAqB,QAAQ,KAAK;AAC7C,QAAI,QAAQ,OAAO,OACf,gBAAgB,OAAO;AAC3B,WAAO,gBAAgB,iBAAiB,OAAO,QAAQ,gBAAgB,KAAK,QAAQ,KAAK,UAAU;AAAA;AAAA,EAErG,cAAc,sBAAsB,QAAQ;AAC1C,QAAI,QAAQ,OAAO;AACnB,WAAO,QAAQ,SAAS;AAAA;AAAA,EAE1B,WAAW,qBAAqB;AAC9B,WAAO;AAAA;AAAA,EAET,WAAW,mBAAmB,QAAQ;AACpC,QAAI,QAAQ,OAAO;AACnB,WAAO;AAAA;AAAA,EAET,WAAW,mBAAmB,QAAQ;AACpC,QAAI,SAAS,OAAO;AACpB,WAAO,MAAM,KAAK,QAAQ,QAAQ;AAAA;AAAA,EAEpC,aAAa,qBAAqB,QAAQ;AACxC,QAAI,SAAS,OAAO;AACpB,WAAO,MAAM,KAAK,QAAQ,QAAQ;AAAA;AAAA,EAEpC,aAAa,qBAAqB,QAAQ;AACxC,QAAI,OAAO,OAAO,MACd,QAAQ,OAAO;AACnB,WAAO,OAAO,OAAO;AAAA;AAAA,EAGvB,WAAW,mBAAmB,QAAQ;AACpC,QAAI,OAAO,OAAO,MACd,OAAO,OAAO;AAClB,WAAO,MAAM,OAAO,KAAK,KAAK,KAAK,MAAM,OAAO;AAAA;AAAA,EAGlD,WAAW,mBAAmB,QAAQ;AACpC,QAAI,OAAO,OAAO;AAClB,WAAO;AAAA;AAAA,EAET,UAAU,kBAAkB,QAAQ;AAClC,QAAI,OAAO,OAAO;AAClB,WAAO,MAAM,OAAO;AAAA;AAAA,EAEtB,aAAa,qBAAqB,QAAQ;AACxC,QAAI,OAAO,OAAO;AAClB,WAAO,OAAO;AAAA;AAAA,EAGhB,kBAAkB,eAAe,SAAU,QAAQ;AACjD,QAAI,aAAa,OAAO,YACpB,iBAAiB,OAAO;AAC5B,WAAO,KAAK,CAAC,UAAU,KAAK,YAAY,MAAM,MAAM,kBAAkB;AAAA;AAAA,EAExE,yBAAyB,iCAAiC,QAAQ;AAChE,QAAI,YAAY,OAAO,WACnB,OAAO,OAAO;AAClB,WAAO,YAAY,OAAO;AAAA;AAAA,EAE5B,sBAAsB,eAAe,SAAU,QAAQ;AACrD,QAAI,OAAO,OAAO,MACd,aAAa,OAAO;AACxB,WAAO,KAAK,CAAC,UAAU,MAAM,KAAK,YAAY,OAAO;AAAA;AAAA,EAEvD,sBAAsB,eAAe,SAAU,QAAQ;AACrD,QAAI,OAAO,OAAO,MACd,aAAa,OAAO,YACpB,aAAa,OAAO,YACpB,SAAS,OAAO;AACpB,WAAO,KAAK,CAAC,QAAQ,MAAM,KAAK,eAAe,KAAK,YAAY,SAAS,KAAK,YAAY,MAAM,MAAM,UAAU;AAAA;AAAA,EAElH,iBAAiB,eAAe,SAAU,QAAQ;AAChD,QAAI,OAAO,OAAO,MACd,OAAO,OAAO,WACd,OAAO,OAAO,MACd,aAAa,OAAO;AACxB,WAAO,OAAQ,mBAAkB,QAAQ,KAAK,OAAO,OAAO,KAAK,MAAM,QAAQ,SAAS,KAAK,KAAK,KAAK,MAAM,OAAO,QAAQ,OAAO,OAAO,KAAK,KAAK,KAAK,YAAY;AAAA;AAAA,EAEvK,sBAAsB,eAAe,SAAU,QAAQ;AACrD,QAAI,OAAO,OAAO,MACd,OAAO,OAAO,MACd,eAAe,OAAO,cACtB,aAAa,OAAO;AACxB,WAAO,KAAK,CAAC,OAAO,OAAO,MAAM,KAAK,MAAM,eAAe,KAAK,YAAY,OAAO;AAAA;AAAA,EAErF,yBAAyB,eAAe,SAAU,QAAQ;AACxD,QAAI,OAAO,OAAO,MACd,aAAa,OAAO,YACpB,aAAa,OAAO,YACpB,SAAS,OAAO;AACpB,WAAO,KAAK,CAAC,aAAa,MAAM,KAAK,eAAe,KAAK,YAAY,SAAS,KAAK,YAAY,MAAM,MAAM,UAAU;AAAA;AAAA,EAEvH,qBAAqB,eAAe,SAAU,QAAQ;AACpD,QAAI,OAAO,OAAO,MACd,aAAa,OAAO,YACpB,QAAQ,OAAO;AACnB,WAAO,KAAK,CAAC,SAAS,MAAM,KAAK,YAAY,MAAM,SAAS,MAAM,WAAW,IAAI,OAAO,KAAK,OAAO,SAAS,KAAK;AAAA;AAAA,EAEpH,oBAAoB,eAAe,SAAU,QAAQ;AACnD,QAAI,OAAO,OAAO,MACd,aAAa,OAAO,YACpB,SAAS,OAAO;AACpB,WAAO,KAAK,CAAC,QAAQ,MAAM,KAAK,YAAY,MAAM,MAAM,UAAU;AAAA;AAAA,EAEpE,qBAAqB,eAAe,SAAU,QAAQ;AACpD,QAAI,OAAO,OAAO,MACd,aAAa,OAAO;AACxB,WAAO,KAAK,CAAC,MAAM,KAAK,YAAY,OAAO;AAAA;AAAA,EAE7C,2BAA2B,eAAe,SAAU,QAAQ;AAC1D,QAAI,OAAO,OAAO,MACd,aAAa,OAAO,YACpB,SAAS,OAAO;AACpB,WAAO,KAAK,CAAC,SAAS,MAAM,KAAK,YAAY,MAAM,MAAM,UAAU;AAAA;AAAA,EAErE,qBAAqB,eAAe,SAAU,QAAQ;AACpD,QAAI,OAAO,OAAO,MACd,OAAO,OAAO,WACd,aAAa,OAAO,YACpB,YAAY,OAAO;AACvB,WAAO,gBAAgB,OAAQ,mBAAkB,QAAQ,KAAK,OAAO,OAAO,KAAK,MAAM,QAAQ,SAAS,KAAK,KAAK,KAAK,MAAM,OAAO,QAAS,cAAa,gBAAgB,MAAM,SAAS,KAAK,WAAW;AAAA;AAAA,EAE3M,iBAAiB,yBAAyB,QAAQ;AAChD,QAAI,aAAa,OAAO,YACpB,iBAAiB,OAAO;AAC5B,WAAO,KAAK,CAAC,iBAAiB,KAAK,YAAY,MAAM,MAAM,kBAAkB;AAAA;AAAA,EAE/E,qBAAqB,6BAA6B,QAAQ;AACxD,QAAI,OAAO,OAAO,MACd,aAAa,OAAO;AACxB,WAAO,KAAK,CAAC,iBAAiB,MAAM,KAAK,YAAY,OAAO;AAAA;AAAA,EAE9D,qBAAqB,6BAA6B,QAAQ;AACxD,QAAI,OAAO,OAAO,MACd,aAAa,OAAO,YACpB,aAAa,OAAO,YACpB,SAAS,OAAO;AACpB,WAAO,KAAK,CAAC,eAAe,MAAM,KAAK,eAAe,KAAK,YAAY,SAAS,KAAK,YAAY,MAAM,MAAM,UAAU;AAAA;AAAA,EAEzH,wBAAwB,gCAAgC,QAAQ;AAC9D,QAAI,OAAO,OAAO,MACd,aAAa,OAAO,YACpB,aAAa,OAAO,YACpB,SAAS,OAAO;AACpB,WAAO,KAAK,CAAC,oBAAoB,MAAM,KAAK,eAAe,KAAK,YAAY,SAAS,KAAK,YAAY,MAAM,MAAM,UAAU;AAAA;AAAA,EAE9H,oBAAoB,4BAA4B,QAAQ;AACtD,QAAI,OAAO,OAAO,MACd,aAAa,OAAO,YACpB,QAAQ,OAAO;AACnB,WAAO,KAAK,CAAC,gBAAgB,MAAM,KAAK,YAAY,MAAM,SAAS,MAAM,WAAW,IAAI,OAAO,KAAK,OAAO,SAAS,KAAK;AAAA;AAAA,EAE3H,mBAAmB,2BAA2B,QAAQ;AACpD,QAAI,OAAO,OAAO,MACd,aAAa,OAAO,YACpB,SAAS,OAAO;AACpB,WAAO,KAAK,CAAC,eAAe,MAAM,KAAK,YAAY,MAAM,MAAM,UAAU;AAAA;AAAA,EAE3E,0BAA0B,kCAAkC,QAAQ;AAClE,QAAI,OAAO,OAAO,MACd,aAAa,OAAO,YACpB,SAAS,OAAO;AACpB,WAAO,KAAK,CAAC,gBAAgB,MAAM,KAAK,YAAY,MAAM,MAAM,UAAU;AAAA;AAAA;AAI9E,wBAAwB,IAAI;AAC1B,SAAO,SAAU,MAAM;AACrB,WAAO,KAAK,CAAC,KAAK,aAAa,GAAG,QAAQ;AAAA;AAAA;AAS9C,cAAc,YAAY;AACxB,MAAI;AAEJ,MAAI,YAAY,UAAU,SAAS,KAAK,UAAU,OAAO,SAAY,UAAU,KAAK;AACpF,SAAQ,yBAAwB,eAAe,QAAQ,eAAe,SAAS,SAAS,WAAW,OAAO,SAAU,GAAG;AACrH,WAAO;AAAA,KACN,KAAK,gBAAgB,QAAQ,0BAA0B,SAAS,wBAAwB;AAAA;AAQ7F,eAAe,OAAO;AACpB,SAAO,KAAK,OAAO,OAAO,KAAK,OAAO,QAAQ;AAAA;AAOhD,cAAc,OAAO,aAAa;AAChC,MAAI,MAAM,UAAU,SAAS,KAAK,UAAU,OAAO,SAAY,UAAU,KAAK;AAC9E,SAAO,eAAe,QAAQ,gBAAgB,KAAK,QAAQ,cAAc,MAAM;AAAA;AAGjF,gBAAgB,KAAK;AACnB,SAAO,KAAK,MAAM,IAAI,QAAQ,OAAO;AAAA;AAGvC,qBAAqB,KAAK;AACxB,SAAO,IAAI,QAAQ,UAAU;AAAA;AAG/B,2BAA2B,YAAY;AACrC,SAAO,cAAc,QAAQ,WAAW,KAAK;AAAA;;;ACnSzC,uBACJ,KACA,WAA+B;MAD7B,aAAU,IAAA;AAGZ,MAAI,CAAC,cAAc,CAAC,WAAW,QAAQ;AACrC,WAAO;;AAET,SAAO,uBACL,YACA,MAAM,SAAC,KAAyB;QAAvB,YAAS,IAAA,WAAE,aAAU,IAAA;AAC9B,QAAI,cAAuB;AAC3B,QAAI,WAAW,MAAM,SAAS,YAAY;AACxC,oBAAc,aAAa,UAAW,WAAW,MAAuB,KAAK;AAC7E,cAEE,UAAA,gBAAA,QAAmC,MAAS,UAAM,gBAAK,QACvD,qCAAA,UAAA,KAAA,QAAA;WACG;AACL,oBAAe,WAAW,MAA2B;;AAEvD,WAAO,UAAU,KAAK,UAAU,SAAS,CAAC,cAAc;;;AAItD,2BAA4B,OAAa;AAC7C,MAAM,QAAkB;AAExB,QAAM,OAAM;IACV,WAAA,SAAU,MAAmB;AAC3B,YAAM,KAAK,KAAK,KAAK;;;AAIzB,SAAO;;AAGH,uBAAwB,OAAiB,OAAa;AAC1D,SAAO,kBAAkB,OAAM,KAC7B,SAAC,MAAY;AAAK,WAAA,MAAM,QAAQ,QAAQ;;;AAItC,0BAA2B,UAAsB;AACrD,SACE,YACA,cAAc,CAAC,WAAW,aAC1B,cAAc,CAAC,WAAW;;AAS9B,8BAA8B,KAAkC;MAAxB,QAAK,IAAA,KAAA;AAC3C,SAAO,UAAU,UAAU,UAAU;;AAGjC,gCACJ,YAAwC;AAExC,MAAM,UAA8B;AAEpC,MAAI,cAAc,WAAW,QAAQ;AACnC,eAAW,QAAQ,SAAA,WAAS;AAC1B,UAAI,CAAC,qBAAqB;AAAY;AAEtC,UAAM,qBAAqB,UAAU;AACrC,UAAM,gBAAgB,UAAU,KAAK;AAErC,cACwB,UAAkB,sBACxC,mBAAA,WAAA,GAAA,MAA0C,UAAA,sBAC1C,mBAAA,WAAA,GAAA,4CAAA,gBAAA;AAEF,UAAM,aAAa,mBAAoB;AACvC,cACgC,UAAU,WACxC,QAAA,WAAA,KAAA,UAA6B,MAAA,MAAa,UAAA,WAC1C,QAAA,WAAA,KAAA,UAAA,MAAA,+BAAA,gBAAA;AAEF,UAAM,UAAqB,WAAW;AAGtC,cACS,UAAA,WACJ,SAAQ,SAAS,cAAc,QAAQ,SAAS,iBACnD,MAAA,UAAA,WAGF,SAAY,SAAE,cAAW,QAAA,SAAU,iBAAI,uBAAA,gBAAA;AACtC,cAAA,KAAA,EAAA,WAAA;;;AAIN,SAAA;;;;ACtFK,kCACJ,UACA,cAAqB;AAErB,MAAI,qBAAqB;AAKzB,MAAM,YAA2C;AACjD,WAAS,YAAY,QAAQ,SAAA,YAAU;AAGrC,QAAI,WAAW,SAAS,uBAAuB;AAC7C,YAAM,QACO,IAAW,eAAS,MAAA,IAAA,eAClB,aAAO,WAAW,YAAgB,eAAa,YACxD,OAAA,aAAA,WAAA,KAAA,QAAA,MAAA,MAAA;;AAMR,QAAI,WAAW,SAAS,sBAAsB;AAC5C,gBAAU,KAAK;;;AAMnB,MAAI,OAAO,uBAAuB,aAAa;AAC7C,YAEE,UACE,UAAU,WAAM,GAAA,MAAA,UAAA,UAAA,WAAA,GAAA,WAAA,UAAA,SAAA;AAGpB,yBAAqB,UAAU,GAAG,KAAK;;AAKzC,MAAM,QAAK,SAAA,SAAA,IACN,WAAQ,EACX,aAAW,eAAA;IACT;MACE,MAAM;MACN,WAAW;MACX,cAAc;QACZ,MAAM;QACN,YAAY;UACV;YACE,MAAM;YACN,MAAM;cACJ,MAAM;cACN,OAAO;;;;;;KAMd,SAAS;AAIhB,SAAO;;AAYH,2BACJ,WAAwC;AAAxC,MAAA,cAAA,QAAA;AAAA,gBAAA;;AAEA,MAAM,WAAwB;AAC9B,YAAU,QAAQ,SAAA,UAAQ;AACxB,aAAS,SAAS,KAAK,SAAS;;AAElC,SAAO;;AAGH,kCACJ,WACA,aAAyB;AAEzB,UAAQ,UAAU;SACX;AACH,aAAO;SACJ,kBAAkB;AACrB,UAAM,WAAW,eAAe,YAAY,UAAU,KAAK;AAC3D,cAAoB,UAAqB,UAAe,MAAK,UAAK,UAAA,uBAAA,UAAA,KAAA,QAAA;AAClE,aAAO;;;AAGP,aAAO;;;;;AC/Gb,wCAAsB;AAQhB,uBAAwB,IAAU;AACtC,SAAO,EAAE,OAAO,OAAO;;AAGnB,qBAAsB,KAAQ;AAClC,SAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,OAAO,IAAI,UAAU;;AAmBxE,uBAAuB,OAAgB;AACrC,SAAO,MAAM,SAAS;;AAGxB,wBAAwB,OAAgB;AACtC,SAAO,MAAM,SAAS;;AAGxB,oBAAoB,OAAgB;AAClC,SAAO,MAAM,SAAS;;AAGxB,sBAAsB,OAAgB;AACpC,SAAO,MAAM,SAAS;;AAGxB,oBAAoB,OAAgB;AAClC,SAAO,MAAM,SAAS;;AAGxB,uBAAuB,OAAgB;AACrC,SAAO,MAAM,SAAS;;AAGxB,qBAAqB,OAAgB;AACnC,SAAO,MAAM,SAAS;;AAGxB,qBAAqB,OAAgB;AACnC,SAAO,MAAM,SAAS;;AAGxB,qBAAqB,OAAgB;AACnC,SAAO,MAAM,SAAS;;AAGlB,qCACJ,QACA,MACA,OACA,WAAkB;AAElB,MAAI,WAAW,UAAU,aAAa,QAAQ;AAC5C,WAAO,KAAK,SAAS,OAAO,MAAM;aACzB,eAAe,UAAU,cAAc,QAAQ;AACxD,WAAO,KAAK,SAAS,MAAM;aAClB,cAAc,QAAQ;AAC/B,QAAM,iBAAe;AACrB,UAAM,OAAO,IAAI,SAAA,KAAG;AAClB,aAAA,4BAA4B,gBAAc,IAAI,MAAM,IAAI,OAAO;;AAEjE,WAAO,KAAK,SAAS;aACZ,WAAW,QAAQ;AAC5B,QAAM,gBAAiB,cAAc,IAAY,MAAM,KAAK;AAC5D,WAAO,KAAK,SAAS;aACZ,YAAY,QAAQ;AAC7B,WAAO,KAAK,SAAS,MAAM,OAAO,IAAI,SAAA,WAAS;AAC7C,UAAM,oBAAoB;AAC1B,kCACE,mBACA,MACA,WACA;AAEF,aAAQ,kBAA0B,KAAK;;aAEhC,YAAY,QAAQ;AAC7B,WAAO,KAAK,SAAU,MAAwB;aACrC,YAAY,QAAQ;AAC7B,WAAO,KAAK,SAAS;SAChB;AACL,UAAM,QACJ,IAAA,eAAkC,MAAA,IAAA,eAA6B,0BAAO,KAAA,QAAA,gBAAA,MAAA,OAAA;;;AAOtE,+BACJ,OACA,WAAkB;AAElB,MAAI,gBAAqB;AACzB,MAAI,MAAM,YAAY;AACpB,oBAAgB;AAChB,UAAM,WAAW,QAAQ,SAAA,WAAS;AAChC,oBAAc,UAAU,KAAK,SAAS;AAEtC,UAAI,UAAU,WAAW;AACvB,kBAAU,UAAU,QAAQ,SAAC,KAAe;cAAb,OAAI,IAAA,MAAE,QAAK,IAAA;AACxC,iBAAA,4BACE,cAAc,UAAU,KAAK,QAC7B,MACA,OACA;;;;;AAOV,MAAI,SAAc;AAClB,MAAI,MAAM,aAAa,MAAM,UAAU,QAAQ;AAC7C,aAAS;AACT,UAAM,UAAU,QAAQ,SAAC,KAAe;UAAb,OAAI,IAAA,MAAE,QAAK,IAAA;AACpC,aAAA,4BAA4B,QAAQ,MAAM,OAAO;;;AAIrD,SAAO,gBAAgB,MAAM,KAAK,OAAO,QAAQ;;AASnD,IAAM,mBAA6B;EACjC;EACA;EACA;EACA;EACA;EACA;;AAGI,yBACJ,WACA,MACA,YAAuB;AAEvB,MACE,QACA,cACA,WAAW,iBACX,WAAW,cAAc,QACzB;AACA,QACE,WAAW,cAAc,aACxB,WAAW,cAAc,UAAuB,SAAS,GAC1D;AACA,UAAM,aAAa,WAAW,cAAc,YACvC,WAAW,cAAc,YAC1B;AACJ,iBAAW;AAEX,UAAM,iBAAe;AACrB,iBAAW,QAAQ,SAAA,KAAG;AACpB,uBAAa,OAAO,KAAK;;AAG3B,aAAU,WAAW,cAAc,SAAM,MAAI,KAAK,UAChD,kBACD;WACI;AACL,aAAO,WAAW,cAAc;;;AAIpC,MAAI,oBAA4B;AAEhC,MAAI,MAAM;AAIR,QAAM,kBAA0B,+CAAU;AAC1C,yBAAqB,MAAI,kBAAe;;AAG1C,MAAI,YAAY;AACd,WAAO,KAAK,YAAY,QAAQ,SAAA,KAAG;AACjC,UAAI,iBAAiB,QAAQ,SAAS;AAAI;AAC1C,UAAI,WAAW,QAAQ,OAAO,KAAK,WAAW,MAAM,QAAQ;AAC1D,6BAAqB,MAAI,MAAG,MAAI,KAAK,UAAU,WAAW,QAAK;aAC1D;AACL,6BAAqB,MAAI;;;;AAK/B,SAAO;;AAGH,kCACJ,OACA,WAA+B;AAE/B,MAAI,MAAM,aAAa,MAAM,UAAU,QAAQ;AAC7C,QAAM,WAAiB;AACvB,UAAM,UAAU,QAAQ,SAAC,KAAe;UAAb,OAAI,IAAA,MAAE,QAAK,IAAA;AACpC,aAAA,4BAA4B,UAAQ,MAAM,OAAO;;AAEnD,WAAO;;AAET,SAAO;;AAGH,gCAAiC,OAAgB;AACrD,SAAO,MAAM,QAAQ,MAAM,MAAM,QAAQ,MAAM,KAAK;;AAGhD,+BACJ,SACA,cACA,aAAyB;AAEzB,MAAI,OAAO,QAAO,eAAe,UAAU;AACzC,WAAO,QAAO;;AAGhB,WAAwB,KAAA,GAAA,MAAA,aAAa,YAAb,KAAA,IAAA,QAAA,MAAyB;AAA5C,QAAM,YAAS,IAAA;AAClB,QAAI,QAAQ,YAAY;AACtB,UAAI,UAAU,KAAK,UAAU,cAAc;AACzC,eAAO,QAAO,uBAAuB;;WAElC;AACL,UAAM,WAAW,sBACf,SACA,yBAAyB,WAAW,aAAc,cAClD;AAEF,UAAI,OAAO,aAAa,UAAU;AAChC,eAAO;;;;;AAMT,iBAAkB,WAAwB;AAC9C,SAAO,UAAU,SAAS;;AAGtB,0BACJ,WAAwB;AAExB,SAAO,UAAU,SAAS;;;;ACpRtB,uBAAwB,KAAiB;AAC7C,UACgC,UAC9B,OAAA,IAAA,SAAA,YAAA,MAAA,UAAA,OAAA,IAAA,SAAA,YAAA;AAIF,MAAM,aAAa,IAAI,YACpB,OAAO,SAAA,GAAC;AAAI,WAAA,EAAE,SAAS;KACvB,IAAI,SAAA,YAAU;AACb,QAAI,WAAW,SAAS,uBAAuB;AAC7C,YAAM,QACJ,IAAA,eAAA,MAAA,IAAA,eACE,6DAEF,WAAA,OAAA;;AAEJ,WAAO;;AAGX,UAEE,UAAA,WAAA,UAAA,GAAA,MAAwC,UAAW,WAAM,UACzD,GAAA,0CAAA,WAAA,SAAA;AAEF,SAAO;;AAGH,gCACJ,KAAiB;AAEjB,gBAAc;AACd,SAAO,IAAI,YAAY,OACrB,SAAA,YAAU;AAAI,WAAA,WAAW,SAAS;KAClC;;AAGE,0BAA2B,KAAiB;AAChD,SACE,IAAI,YACD,OACC,SAAA,YAAU;AACR,WAAA,WAAW,SAAS,yBAAyB,WAAW;KAE3D,IAAI,SAAC,GAA0B;AAAK,WAAA,EAAG,KAAM;KAAO,MAAM;;AAK3D,gCACJ,KAAiB;AAEjB,SAAO,IAAI,YAAY,OACrB,SAAA,YAAU;AAAI,WAAA,WAAW,SAAS;;;AAIhC,4BAA6B,KAAiB;AAClD,MAAM,WAAW,uBAAuB;AAExC,UACgC,UAAK,YACnC,SAAA,cAAA,SACA,MAAA,UAAA,YAAA,SAAA,cAAA,SAAA;AAEF,SAAO;;AAGH,+BACJ,KAAiB;AAEjB,UAEE,UAAA,IAAA,SAAA,YAAA,MAAA,UAAA,IAAA,SAAA,YAAA;AAIF,UAEE,UAAA,IAAA,YAAA,UAAA,GAAA,MACA,UAAA,IAAA,YAAA,UAAA,GAAA;AAEF,MAAM,cAAc,IAAI,YAAY;AAEpC,UACuB,UAAA,YACrB,SAAA,sBACA,MAAA,UAAA,YAAA,SAAA,sBAAA;AAEF,SAAO;;AAQH,2BACJ,UAAsB;AAEtB,gBAAc;AAEd,MAAI;AAEJ,WAAuB,KAAA,GAAA,MAAA,SAAS,aAAT,KAAA,IAAA,QAAA,MAAsB;AAAxC,QAAI,aAAU,IAAA;AACjB,QAAI,WAAW,SAAS,uBAAuB;AAC7C,UAAM,YAAa,WAAuC;AAC1D,UACE,cAAc,WACd,cAAc,cACd,cAAc,gBACd;AACA,eAAO;;;AAGX,QAAI,WAAW,SAAS,wBAAwB,CAAC,oBAAoB;AAGnE,2BAAqB;;;AAIzB,MAAI,oBAAoB;AACtB,WAAO;;AAGT,QAAM,QACJ,IAAA,eAAA,MAAA,IAAA,eAAA;;AAIE,0BACJ,YAA+C;AAE/C,MAAM,gBAAgB,OAAO,OAAO;AACpC,MAAM,OAAO,cAAc,WAAW;AACtC,MAAI,QAAQ,KAAK,QAAQ;AACvB,SAAK,QAAQ,SAAA,KAAG;AACd,UAAI,IAAI,cAAc;AACpB,oCACE,eACA,IAAI,SAAS,MACb,IAAI;;;;AAKZ,SAAO;;;;AC/JH,uBACJ,OACA,MACA,SAAa;AAEb,MAAI,SAAS;AACb,QAAM,QAAQ,SAAU,MAAM,GAAC;AAC7B,QAAI,KAAK,KAAK,MAAM,MAAM,GAAG,QAAQ;AACnC,YAAM,YAAY;;KAEnB;AACH,QAAM,SAAS;AACf,SAAO;;;;ACyCT,IAAM,iBAA4B;EAChC,MAAM;EACN,MAAM;IACJ,MAAM;IACN,OAAO;;;AAIX,iBACE,IACA,WAAsB;AAEtB,SAAO,GAAG,aAAa,WAAW,MAChC,SAAA,WAAS;AACP,WAAA,UAAU,SAAS,oBACnB,QAAQ,UAAU,UAAU,KAAK,QAAQ;;;AAI/C,0BAA0B,KAAiB;AACzC,SAAO,QACL,uBAAuB,QAAQ,sBAAsB,MACrD,kBAAkB,uBAAuB,SAEvC,OACA;;AAGN,6BACE,YAA0D;AAE1D,SAAO,0BAA0B,WAAwB;AACvD,WAAO,WAAW,KAChB,SAAA,KAAG;AACD,aAAC,IAAI,QAAQ,IAAI,SAAS,UAAU,KAAK,SACxC,IAAI,QAAQ,IAAI,KAAK;;;;AAKxB,sCACJ,YACA,KAAiB;AAEjB,MAAM,iBAA0C,OAAO,OAAO;AAC9D,MAAI,oBAA6C;AAEjD,MAAM,uBAAgD,OAAO,OAAO;AACpE,MAAI,0BAAwD;AAE5D,MAAI,cAAc,iBAChB,MAAM,KAAK;IACT,UAAU;MACR,OAAA,SAAM,MAAM,MAAM,QAAM;AAMtB,YACG,OAAkC,SAAS,sBAC5C;AACA,yBAAe,KAAK,KAAK,SAAS;;;;IAKxC,OAAO;MACL,OAAA,SAAM,MAAI;AACR,YAAI,cAAc,KAAK,YAAY;AAGjC,cAAM,oBAAoB,WAAW,KACnC,SAAA,WAAS;AAAI,mBAAA,UAAU;;AAGzB,cACE,qBACA,KAAK,cACL,KAAK,WAAW,KAAK,oBAAoB,cACzC;AACA,gBAAI,KAAK,WAAW;AAGlB,mBAAK,UAAU,QAAQ,SAAA,KAAG;AACxB,oBAAI,IAAI,MAAM,SAAS,YAAY;AACjC,oCAAkB,KAAK;oBACrB,MAAO,IAAI,MAAuB,KAAK;;;;;AAM/C,gBAAI,KAAK,cAAc;AAGrB,oDAAsC,KAAK,cAAc,QACvD,SAAA,MAAI;AACF,wCAAwB,KAAK;kBAC3B,MAAM,KAAK,KAAK;;;;AAOxB,mBAAO;;;;;IAMf,gBAAgB;MACd,OAAK,SAAC,MAAI;AAGR,6BAAqB,KAAK,KAAK,SAAS;;;IAI5C,WAAW;MACT,OAAK,SAAC,MAAI;AAER,YAAI,oBAAoB,YAAY,OAAO;AACzC,iBAAO;;;;;AAUjB,MACE,eACA,cAAc,mBAAmB,SAAA,GAAC;AAAI,WAAA,CAAC,CAAC,EAAE,QAAQ,CAAC,eAAe,EAAE;KAAO,QAC3E;AACA,kBAAc,4BAA4B,mBAAmB;;AAM/D,MACE,eACA,cAAc,yBAAyB,SAAA,IAAE;AAAI,WAAA,CAAC,CAAC,GAAG,QAAQ,CAAC,qBAAqB,GAAG;KAChF,QACH;AACA,kBAAc,iCACZ,yBACA;;AAIJ,SAAO;;AAGH,+BAAgC,KAAiB;AACrD,SAAO,MAAM,cAAc,MAAM;IAC/B,cAAc;MACZ,OAAA,SAAM,MAAM,MAAM,QAAM;AAEtB,YACE,UACC,OAAmC,SAAS,uBAC7C;AACA;;AAIM,YAAA,aAAe,KAAI;AAC3B,YAAI,CAAC,YAAY;AACf;;AAKF,YAAM,OAAO,WAAW,KAAK,SAAA,WAAS;AACpC,iBACE,QAAQ,cACP,WAAU,KAAK,UAAU,gBACxB,UAAU,KAAK,MAAM,YAAY,MAAM,OAAO;;AAGpD,YAAI,MAAM;AACR;;AAKF,YAAM,QAAQ;AACd,YACE,QAAQ,UACR,MAAM,cACN,MAAM,WAAW,KAAK,SAAA,GAAC;AAAI,iBAAA,EAAE,KAAK,UAAU;YAC5C;AACA;;AAIF,eAAA,SAAA,SAAA,IACK,OAAI,EACP,YAAU,eAAM,YAAU,CAAE;;;;;AAUtC,sBAAsB,QAAQ,SAAU,OAAgB;AACtD,SAAO,UAAU;;AAGnB,IAAM,yBAAyB;EAC7B,MAAM,SAAC,WAAwB;AAC7B,QAAM,aAAa,UAAU,KAAK,UAAU;AAC5C,QAAI,YAAY;AACd,UACE,CAAC,UAAU,aACX,CAAC,UAAU,UAAU,KAAK,SAAA,KAAG;AAAI,eAAA,IAAI,KAAK,UAAU;UACpD;AACA,QACE,UAAA,KAAA;;;AAMN,WAAO;;;AAIL,+CAAgD,KAAiB;AACrE,SAAO,6BACL,CAAC,yBACD,cAAc;;AA0ClB,4BAA4B,QAA+B;AACzD,SAAO,yBAAyB,UAAsB;AACpD,WAAO,OAAO,KACZ,SAAC,SAA8B;AAC7B,aAAA,SAAS,SACT,SAAS,MAAM,SAAS,cACxB,SAAS,MAAM,QACd,SAAQ,SAAS,SAAS,MAAM,KAAK,SACnC,QAAQ,QAAQ,QAAQ,KAAK;;;;AAKlC,qCACJ,QACA,KAAiB;AAEjB,MAAM,aAAa,mBAAmB;AAEtC,SAAO,iBACL,MAAM,KAAK;IACT,qBAAqB;MACnB,OAAK,SAAC,MAAI;AACR,eAAA,SAAA,SAAA,IACK,OAAI,EAEP,qBAAqB,KAAK,sBAAsB,KAAK,oBAAoB,OACvE,SAAA,QAAM;AACJ,iBAAA,CAAC,OAAO,KAAK,SAAA,KAAG;AAAI,mBAAA,IAAI,SAAS,OAAO,SAAS,KAAK;;aACtD;;;IAKV,OAAO;MACL,OAAK,SAAC,MAAI;AAGR,YAAM,oBAAoB,OAAO,KAAK,SAAA,WAAS;AAAI,iBAAA,UAAU;;AAE7D,YAAI,mBAAmB;AACrB,cAAI,kBAAgB;AACpB,cAAI,KAAK,WAAW;AAClB,iBAAK,UAAU,QAAQ,SAAA,KAAG;AACxB,kBAAI,WAAW,MAAM;AACnB,mCAAiB;;;;AAKvB,cAAI,oBAAkB,GAAG;AACvB,mBAAO;;;;;IAMf,UAAU;MACR,OAAK,SAAC,MAAI;AAER,YAAI,WAAW,OAAO;AACpB,iBAAO;;;;;;AAQb,0CACJ,QACA,KAAiB;AAEjB,iBACE,MAAiD;AAEjD,QAAI,OAAO,KAAK,SAAA,KAAG;AAAI,aAAA,IAAI,SAAS,KAAK,KAAK;QAAQ;AACpD,aAAO;;;AAIX,SAAO,iBACL,MAAM,KAAK;IACT,gBAAgB,EAAE;IAClB,oBAAoB,EAAE;;;AAK5B,+CACE,cAA8B;AAE9B,MAAM,eAAqC;AAE3C,eAAa,WAAW,QAAQ,SAAA,WAAS;AACvC,QACG,SAAQ,cAAc,iBAAiB,eACxC,UAAU,cACV;AACA,4CAAsC,UAAU,cAAc,QAC5D,SAAA,MAAI;AAAI,eAAA,aAAa,KAAK;;eAEnB,UAAU,SAAS,kBAAkB;AAC9C,mBAAa,KAAK;;;AAItB,SAAO;;AAMH,oCACJ,UAAsB;AAEtB,MAAM,aAAa,kBAAkB;AACrC,MAAM,sBAAgD,WAAY;AAElE,MAAI,wBAAwB,SAAS;AAEnC,WAAO;;AAIT,MAAM,cAAc,MAAM,UAAU;IAClC,qBAAqB;MACnB,OAAK,SAAC,MAAI;AACR,eAAA,SAAA,SAAA,IACK,OAAI,EACP,WAAW;;;;AAKnB,SAAO;;AAIH,sCACJ,UAAsB;AAEtB,gBAAc;AAEd,MAAI,cAAc,6BAChB;IACE;MACE,MAAM,SAAC,WAAwB;AAAK,eAAA,UAAU,KAAK,UAAU;;MAC7D,QAAQ;;KAGZ;AAOF,MAAI,aAAa;AACf,kBAAc,MAAM,aAAa;MAC/B,oBAAoB;QAClB,OAAK,SAAC,MAAI;AACR,cAAI,KAAK,cAAc;AACrB,gBAAM,iBAAiB,KAAK,aAAa,WAAW,MAClD,SAAA,WAAS;AACP,qBAAA,QAAQ,cAAc,UAAU,KAAK,UAAU;;AAEnD,gBAAI,gBAAgB;AAClB,qBAAO;;;;;;;AAQnB,SAAO;;;;AC9fD,IAAA,iBAAmB,OAAO,UAAS;AAwBrC,qBAAmB;AACvB,MAAA,UAAA;WAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAAa;AAAb,YAAA,MAAA,UAAA;;AAEA,SAAO,eAAe;;AASlB,wBAA4B,SAAY;AAC5C,MAAI,SAAS,QAAQ,MAAO;AAC5B,MAAM,QAAQ,QAAQ;AACtB,MAAI,QAAQ,GAAG;AACb,QAAM,SAAS,IAAI;AACnB,aAAS,IAAI,GAAG,IAAI,OAAO,EAAE,GAAG;AAC9B,eAAS,OAAO,MAAM,QAAQ,QAAQ;;;AAG1C,SAAO;;AAGT,kBAAkB,KAAQ;AACxB,SAAO,QAAQ,QAAQ,OAAO,QAAQ;;AAWxC,IAAM,oBACJ,SAAU,QAAQ,QAAQ,UAAQ;AAChC,SAAO,KAAK,MAAM,OAAO,WAAW,OAAO;;AAG/C,IAAA,aAAA,WAAA;AACE,uBACU,YAAgE;AAAhE,QAAA,eAAA,QAAA;AAAA,mBAAA;;AAAA,SAAA,aAAA;AAgCH,SAAA,WAAW;AAEV,SAAA,aAAa,IAAI;;AA/BlB,cAAA,UAAA,QAAP,SAAa,QAAa,QAAW;AAArC,QAAA,QAAA;AAAuC,QAAA,UAAA;aAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAAwB;AAAxB,cAAA,KAAA,KAAA,UAAA;;AACrC,QAAI,SAAS,WAAW,SAAS,SAAS;AACxC,aAAO,KAAK,QAAQ,QAAQ,SAAA,WAAS;AACnC,YAAI,eAAe,KAAK,QAAQ,YAAY;AAC1C,cAAM,cAAc,OAAO;AAC3B,cAAI,OAAO,eAAe,aAAa;AACrC,gBAAM,UAAS,MAAK,WAAU,MAAf,OAAI,eAAA,CAAY,QAAQ,QAAQ,YAAc;AAG7D,gBAAI,YAAW,aAAa;AAC1B,uBAAS,MAAK,oBAAoB;AAClC,qBAAO,aAAa;;;eAGnB;AAGL,mBAAS,MAAK,oBAAoB;AAClC,iBAAO,aAAa,OAAO;;;AAI/B,aAAO;;AAIT,WAAO;;AAOF,cAAA,UAAA,sBAAP,SAA8B,OAAQ;AACpC,QAAI,SAAS,UAAU,CAAC,KAAK,WAAW,IAAI,QAAQ;AAClD,UAAI,MAAM,QAAQ,QAAQ;AACxB,gBAAS,MAAc,MAAM;aACxB;AACL,gBAAK,SAAA,EACH,WAAW,OAAO,eAAe,UAC9B;;AAGP,WAAK,WAAW,IAAI;;AAEtB,WAAO;;AAEX,SAAA;;;;AC5GM,0BACJ,SAAwB;AAAxB,MAAA,YAAA,QAAA;AAAA,cAAA;;AAEA,SAAO;IACL;IACA,OAAK,SAAC,UAAU,UAAQ;AACtB,aAAO,WAAU,eACZ,UACA,YACD;;;;AASJ,+BACJ,SAAwB;AAAxB,MAAA,YAAA,QAAA;AAAA,cAAA;;AAEA,SAAO;IACL;IACA,OAAK,SAAC,UAAU,UAAU,KAAQ;UAAN,OAAI,IAAA;AAC9B,UAAM,SAAS,WAAW,SAAS,MAAM,KAAK;AAC9C,UAAI,MAAM;AAEA,YAAA,KAAe,KAAI,QAAnB,SAAM,OAAA,SAAG,IAAC;AAClB,iBAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,EAAE,GAAG;AACxC,iBAAO,SAAS,KAAK,SAAS;;aAE3B;AAKL,eAAO,KAAK,MAAM,QAAQ;;AAE5B,aAAO;;;;AA2CP,8BACJ,SAAwB;AAAxB,MAAA,YAAA,QAAA;AAAA,cAAA;;AAEA,SAAO;IACL;IAEA,MAAA,SAAK,UAAU,KAAsB;UAApB,UAAO,IAAA,SAAE,YAAS,IAAA;AACjC,UAAI,CAAC;AAAU;AAEf,UAAM,QAA6B;AACnC,UAAI,cAAc;AAClB,UAAI,YAAY;AAChB,eAAS,MAAM,QAAQ,SAAA,MAAI;AAGzB,YAAI,QAAQ,UAAU,QAAQ,QAAQ;AACpC,gBAAM,KAAK;AACX,cAAI,KAAK,QAAQ;AACf,0BAAc,eAAe,KAAK;AAClC,wBAAY,KAAK;;;;AAKvB,aAAA,SAAA,SAAA,IAIK,UAAU,YAAS,EACtB,OACA,UAAQ,SAAA,SAAA,IACH,SAAS,WAAQ;QACpB;QACA;;;IAKN,OAAA,SAAM,UAA4B,UAAU,KAAgC;AAAtE,UAAA,aAAA,QAAA;AAAA,mBAAW;;UAA6B,OAAI,IAAA,MAAE,eAAW,IAAA,aAAE,YAAS,IAAA;AACxE,UAAM,gBAAgB,SAAS,QAAQ,SAAS,MAAM,IAAI,SAAA,MAAI;AAC5D,YAAI,aAAY,OAAI,SAAA,IAAQ,QAAS;AAGnC,eAAK,SAAS,UAAkB,UAAU;;AAE5C,eAAO;WACJ;AAEL,UAAI,SAAS,UAAU;AACb,YAAA,aAAa,SAAQ;AACrB,YAAA,cAA2B,WAAQ,aAAtB,YAAc,WAAQ;AAC3C,YAAM,YAAY,cAAc;AAChC,YAAM,WAAW,cAAc,cAAc,SAAS;AAGtD,YAAI,aAAa,aAAa;AAC5B,oBAAU,SAAS;;AAErB,YAAI,YAAY,WAAW;AACzB,mBAAS,SAAS;;AAIpB,YAAM,cAAc,aAAa,UAAU;AAC3C,YAAI,eAAe,CAAC,aAAa;AAC/B,qBAAW,UAAU,UAAU;YAC7B,UAAU;cACR,aAAa;;;;AAInB,YAAM,aAAa,YAAY,SAAS;AACxC,YAAI,cAAc,CAAC,WAAW;AAC5B,qBAAW,UAAU,UAAU;YAC7B,UAAU;cACR,WAAW;;;;;AAMnB,UAAI,SAAS,SAAS;AACtB,UAAI,SAAwB;AAE5B,UAAI,QAAQ,KAAK,OAAO;AAItB,YAAM,QAAQ,OAAO,UAAU,SAAA,MAAI;AAAI,iBAAA,KAAK,WAAW,KAAK;;AAC5D,YAAI,SAAS,GAAG;AACd,mBAAS,OAAO,MAAM,GAAG,QAAQ;;iBAG1B,QAAQ,KAAK,QAAQ;AAC9B,YAAM,QAAQ,OAAO,UAAU,SAAA,MAAI;AAAI,iBAAA,KAAK,WAAW,KAAK;;AAC5D,iBAAS,QAAQ,IAAI,SAAS,OAAO,MAAM;AAC3C,iBAAS;iBACA,SAAS,OAAO;AAIzB,iBAAS;;AAGX,UAAM,QAAK,eACN,QACA,eACA;AAGL,UAAM,WAAQ,SAAA,SAAA,IAMT,SAAS,WACT,SAAS;AAGd,UAAI,SAAS,UAAU;AACrB,YAAM,KAIF,SAAS,UAHX,kBAAe,GAAA,iBAAE,cAAW,GAAA,aAC5B,cAAW,GAAA,aAAE,YAAS,GAAA,WACnB,UAAM,OAAA,IAHL,CAAA,mBAAA,eAAA,eAAA;AAUN,eAAO,OAAO,UAAU;AASxB,YAAI,CAAC,OAAO,QAAQ;AAClB,cAAI,AAAW,oBAAX;AAA4B,qBAAS,kBAAkB;AAC3D,cAAI,AAAW,gBAAX;AAAwB,qBAAS,cAAc;;AAErD,YAAI,CAAC,OAAO,QAAQ;AAClB,cAAI,AAAW,gBAAX;AAAwB,qBAAS,cAAc;AACnD,cAAI,AAAW,cAAX;AAAsB,qBAAS,YAAY;;;AAInD,aAAA,SAAA,SAAA,SAAA,IACK,UAAU,YACV,UAAU,YAAS;QACtB;QACA;;;;;AAOR,IAAM,YAAY,SAAC,KAAwB;AAAK,SAAA,OAAO,KAAK;;AAC5D,IAAM,YAAY,CAAC,SAAS;AAE5B,yBAAsB;AACpB,SAAO;IACL,OAAO;IACP,UAAU;MACR,iBAAiB;MACjB,aAAa;MACb,aAAa;MACb,WAAW;;;;;;ACrQjB,4BAAuB;;;ACAR,kCAAkC,OAAM;AACtD,MAAI;AACJ,MAAI,UAAS,MAAK;AAElB,MAAI,OAAO,YAAW,YAAY;AACjC,QAAI,QAAO,YAAY;AACtB,gBAAS,QAAO;AAAA,WACV;AAEN,UAAI,OAAO,QAAO,QAAQ,YAAY;AAIrC,kBAAS,QAAO,IAAI;AAAA,aACd;AAIN,kBAAS,QAAO;AAAA;AAEjB,UAAI;AACH,gBAAO,aAAa;AAAA,eACZ,KAAP;AAAA;AAAA;AAAA,SAMG;AACN,cAAS;AAAA;AAGV,SAAO;AAAA;;;AC7BR,IAAI;AAEJ,IAAI,OAAO,SAAS,aAAa;AAC/B,SAAO;AAAA,WACE,OAAO,WAAW,aAAa;AACxC,SAAO;AAAA,WACE,OAAO,WAAW,aAAa;AACxC,SAAO;AAAA,WACE,OAAO,WAAW,aAAa;AACxC,SAAO;AAAA,OACF;AACL,SAAO,SAAS;AAAA;AAGlB,IAAI,SAAS,yBAAS;;;AFJd,IAAA,YAAc,8BAAU;AAChC,IAAM,gBAAgB;AACtB,IAAI,CAAC,UAAU,gBAAgB;AAC7B,YAAU,iBAAiB,WAAA;AAAc,WAAO;;;;;AGhB1C,IAAA,WAAa,OAAO,UAAS;AAK/B,mBAAuB,OAAQ;AACnC,SAAO,gBAAgB;;AAGzB,yBAA4B,KAAQ,MAAoB;AACtD,UAAQ,SAAS,KAAK;SACjB,kBAAkB;AACrB,aAAO,QAAQ,IAAI;AACnB,UAAI,KAAK,IAAI;AAAM,eAAO,KAAK,IAAI;AACnC,UAAM,SAAmB,IAAY,MAAM;AAC3C,WAAK,IAAI,KAAK;AACd,aAAK,QAAQ,SAAU,OAAO,GAAC;AAC7B,eAAK,KAAK,gBAAgB,OAAO;;AAEnC,aAAO;;SAGJ,mBAAmB;AACtB,aAAO,QAAQ,IAAI;AACnB,UAAI,KAAK,IAAI;AAAM,eAAO,KAAK,IAAI;AAGnC,UAAM,SAAO,OAAO,OAAO,OAAO,eAAe;AACjD,WAAK,IAAI,KAAK;AACd,aAAO,KAAK,KAAK,QAAQ,SAAA,KAAG;AAC1B,eAAK,OAAO,gBAAiB,IAAY,MAAM;;AAEjD,aAAO;;;AAIP,aAAO;;;;;ACpCL,kBAAgB;AACpB,MAAI,OAAO,YAAY,eAAe,eAAsB;AAC1D,WAAO;;AAIT,SAAO;;AAGH,eAAgB,KAAW;AAC/B,SAAO,aAAa;;AAGhB,yBAAuB;AAC3B,SAAO,MAAM,mBAAmB;;AAG5B,kBAAgB;AACpB,SAAO,MAAM,YAAY;;;;AChB3B,mBAAkB,OAAU;AAC1B,SAAO,UAAU,QAAQ,OAAO,UAAU;;AAG5C,oBAAoB,OAAU;AAC5B,MAAM,UAAU,IAAI,IAAI,CAAC;AACzB,UAAQ,QAAQ,SAAA,KAAG;AACjB,QAAI,UAAS,MAAM;AACjB,UAAI,CAAC,OAAO,SAAS;AAAM,eAAO,OAAO;AACzC,aAAO,oBAAoB,KAAK,QAAQ,SAAA,MAAI;AAC1C,YAAI,UAAS,IAAI;AAAQ,kBAAQ,IAAI,IAAI;;;;AAI/C,SAAO;;AAGH,yBAA6B,KAAM;AACvC,MAA8C,mBAAmB,UAAW;AAC1E,eAAW;;AAEb,SAAO;;;;ACrBH,gCACJ,WACA,QACA,UAAY;AAKZ,MAAM,sBAAqC;AAC3C,YAAU,QAAQ,SAAA,KAAG;AAAI,WAAA,IAAI,WAAW,oBAAoB,KAAK;;AACjE,sBAAoB,QAAQ,SAAA,KAAG;AAAI,WAAC,IAAY,QAAQ;;;;;ACRpD,kBACJ,YACA,OACA,SAA4C;AAE5C,SAAO,IAAI,8BAAc,SAAA,UAAQ;AACvB,QAAA,OAA0B,SAAQ,MAA5B,QAAoB,SAAQ,OAArB,WAAa,SAAQ;AAC1C,QAAI,sBAAsB;AAC1B,QAAI,YAAY;AAChB,QAAI,eAAe;MAIjB,MAAA,SAAK,UAAmB;AACtB,eAAO,IAAI,QAAQ,SAAA,SAAO;AAAI,iBAAA,QAAQ;;;;AAI1C,0BACE,UACA,UAAoC;AAEpC,UAAI,UAAU;AACZ,eAAO,SAAA,KAAG;AACR,YAAE;AACF,cAAM,OAAO,WAAA;AAAM,mBAAA,SAAS;;AAC5B,yBAAe,aAAa,KAAK,MAAM,MAAM,KAC3C,SAAA,SAAM;AACJ,cAAE;AACF,oBAAQ,KAAK,KAAK,UAAU;AAC5B,gBAAI,WAAW;AACb,sBAAQ;;aAGZ,SAAA,QAAK;AACH,cAAE;AACF,kBAAM;aAER,MAAM,SAAA,QAAM;AACZ,qBAAS,MAAM,KAAK,UAAU;;;aAG7B;AACL,eAAO,SAAA,KAAG;AAAI,iBAAA,YAAY,SAAS,KAAK,UAAU;;;;AAItD,QAAM,UAAuB;MAC3B,MAAM,aAAa,OAAO;MAC1B,OAAO,aAAa,SAAS;MAC7B,UAAQ,WAAA;AACN,oBAAY;AACZ,YAAI,CAAC,qBAAqB;AACxB,sBAAY,SAAS,KAAK;;;;AAKhC,QAAM,MAAM,WAAW,UAAU;AACjC,WAAO,WAAA;AAAM,aAAA,IAAI;;;;;;ACrDf,+BAEJ,UAAW;AACX,eAAa,KAAoB;AAI/B,WAAO,eAAe,UAAU,KAAK,EAAE,OAAO;;AAEhD,MAAI,OAAO,WAAW,cAAc,OAAO,SAAS;AAClD,QAAI,OAAO;;AAKb,MAAI;AACJ,SAAO;;;;ACpBT,uBAA0B,OAAoB;AAC5C,SAAO,SAAS,OAAQ,MAAc,SAAS;;AAqCjD,IAAA,UAAA,SAAA,QAAA;AAAgC,YAAA,UAAA;AAc9B,oBAAY,SAA8D;AAA1E,QAAA,QACE,OAAA,KAAA,MAAM,SAAA,UAAQ;AACZ,YAAK,YAAY;AACjB,aAAO,WAAA;AAAM,eAAA,MAAK,eAAe;;UACjC;AAdI,UAAA,YAAY,IAAI;AA4EhB,UAAA,WAAW;AA+BH,UAAA,UAAU,IAAI,QAAW,SAAC,SAAS,QAAM;AACvD,YAAK,UAAU;AACf,YAAK,SAAS;;AASR,UAAA,WAAW;MACjB,MAAM,SAAC,SAAS;AACd,YAAI,MAAK,QAAQ,MAAM;AACrB,gBAAK,SAAS,CAAC,QAAQ;AACvB,iCAAuB,MAAK,WAAW,QAAQ;;;MAInD,OAAO,SAAC,OAAU;AACR,YAAA,MAAQ,MAAI;AACpB,YAAI,QAAQ,MAAM;AAIhB,cAAI;AAAK,oBAAQ,UAAU,KAAK,WAAA;AAAM,qBAAA,IAAI;;AAC1C,gBAAK,MAAM;AACX,gBAAK,SAAS,CAAC,SAAS;AACxB,gBAAK,OAAO;AACZ,iCAAuB,MAAK,WAAW,SAAS;;;MAIpD,UAAU,WAAA;AACR,YAAI,MAAK,QAAQ,MAAM;AACrB,cAAM,QAAQ,MAAK,QAAQ;AAC3B,cAAI,CAAC,OAAO;AACV,kBAAK,MAAM;AACX,gBAAI,MAAK,UACL,MAAK,OAAO,OAAO,QAAQ;AAC7B,oBAAK,QAAQ,MAAK,OAAO;mBACpB;AACL,oBAAK;;AAQP,mCAAuB,MAAK,WAAW;qBAC9B,cAAc,QAAQ;AAC/B,kBAAM,KAAK,SAAA,KAAG;AAAI,qBAAA,MAAK,MAAM,IAAI,UAAU,MAAK;;iBAC3C;AACL,kBAAK,MAAM,MAAM,UAAU,MAAK;;;;;AAgCjC,UAAA,SAAS,SAAC,QAAW;AAC1B,YAAK,OAAO;AACZ,YAAK,UAAU;AACf,YAAK,SAAS;;AAjLd,UAAK,QAAQ,MAAM,SAAA,GAAC;;AAKpB,QAAI,OAAO,YAAY,YAAY;AACjC,gBAAU,CAAC,IAAI,8BAAW;;AAG5B,QAAI,cAAc,UAAU;AAC1B,cAAQ,KACN,SAAA,UAAQ;AAAI,eAAA,MAAK,MAAM;SACvB,MAAK,SAAS;WAEX;AACL,YAAK,MAAM;;;;AAQP,WAAA,UAAA,QAAR,SAAc,SAAkC;AAC9C,QAAI,KAAK,QAAQ;AAAQ;AAKzB,SAAK,UAAU,MAAM,KAAK;AAM1B,SAAK,SAAS;;AAGR,WAAA,UAAA,qBAAR,SAA2B,UAAqB;AAC9C,QAAI,KAAK,QAAQ;AACf,UAAM,cAAc,KAAK,OAAO;AAChC,UAAM,SAAS,SAAS;AACxB,UAAI,QAAQ;AACV,eAAO,KAAK,UAAU,KAAK,OAAO;;AAKpC,UAAI,KAAK,QAAQ,QACb,gBAAgB,UAChB,SAAS,UAAU;AACrB,iBAAS;;;;AAQR,WAAA,UAAA,cAAP,SAAmB,UAAqB;AACtC,QAAI,CAAC,KAAK,UAAU,IAAI,WAAW;AAGjC,WAAK,mBAAmB;AACxB,WAAK,UAAU,IAAI;AACnB,QAAE,KAAK;;;AAIJ,WAAA,UAAA,iBAAP,SACE,UACA,SAAiB;AAEjB,QAAI,KAAK,UAAU,OAAO,aACtB,EAAE,KAAK,WAAW,KAClB,CAAC,SAAS;AAIZ,WAAK,SAAS,MAAM,IAAI,MAAM;;;AAqE3B,WAAA,UAAA,UAAP,SAAe,UAAmB;AAAlC,QAAA,QAAA;AACE,QAAI,SAAS;AACb,QAAM,OAAO,WAAA;AACX,UAAI,CAAC,QAAQ;AACX,iBAAS;AAIT,cAAK,UAAU,OAAO;AACtB;;;AAGJ,QAAM,WAAW;MACf,MAAM;MACN,OAAO;MACP,UAAU;;AAEZ,QAAM,QAAQ,KAAK;AACnB,SAAK,YAAY;AAIjB,SAAK,WAAW;;AASpB,SAAA;EA1MgC;AA8MhC,sBAAsB;;;AC1PhB,yBAA6B,OAAoB;AACrD,SAAO,MAAM,QAAQ,UAAU,MAAM,SAAS;;;;ACC1C,+BAAgC,SAAuB;AAC3D,SAAQ,QAAO,UAAU,QAAO,OAAO,SAAS,KAAM;;;;ACHjD,IAAM,gBAAgB,OAAO,YAAY,cAAc,CAC5D,QAAO,cAAc,YACrB,UAAU,YAAY;;;ACIlB,mBAAiB;AACrB,MAAA,UAAA;WAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAAiB;AAAjB,YAAA,MAAA,UAAA;;AAEA,MAAM,UAAS,OAAO,OAAO;AAE7B,UAAQ,QAAQ,SAAA,KAAG;AACjB,QAAI,CAAC;AAAK;AACV,WAAO,KAAK,KAAK,QAAQ,SAAA,KAAG;AAC1B,UAAM,QAAS,IAAY;AAC3B,UAAI,UAAU,QAAQ;AACpB,gBAAO,OAAO;;;;AAKpB,SAAO;;;;ACnBH,mBAAuB,YAAe;AAC1C,SAAO,IAAI,8BAAc,SAAA,UAAQ;AAC/B,aAAS,MAAM;;;;;ACAb,mBAAuB,YAAyB;AACpD,MAAI,YAAY;AAChB,SAAO,IAAI,QAAW,SAAC,SAAS,QAAM;AACpC,eAAW,UAAU;MACnB,MAAM,SAAA,MAAI;AACR,YAAI,WAAW;AACb,UACE,UAAA,KAAA;eAEG;AACL,sBAAY;AACZ,kBAAQ;;;MAGZ,OAAO;;;;;;AChBP,qBAAyB,SAAmB;AAChD,SAAO,IAAI,8BAAc,SAAA,UAAQ;AAC/B,YACG,KAAK,SAAC,OAAQ;AACb,eAAS,KAAK;AACd,eAAS;OAEV,MAAM,SAAS,MAAM,KAAK;;;;;ACH1B,IAAM,mBAAmB,SAC9B,UACA,SACA,SAAe;AAEf,MAAM,QAAQ,IAAI,MAAM;AACxB,QAAM,OAAO;AACb,QAAM,WAAW;AACjB,QAAM,aAAa,SAAS;AAC5B,QAAM,SAAS;AACf,QAAM;;;;ACZF,2BAA4B,WAAyB;AACzD,MAAM,mBAAmB;IACvB;IACA;IACA;IACA;IACA;;AAEF,WAAgB,KAAA,GAAA,MAAA,OAAO,KAAK,YAAZ,KAAA,IAAA,QAAA,MAAwB;AAAnC,QAAI,MAAG,IAAA;AACV,QAAI,iBAAiB,QAAQ,OAAO,GAAG;AACrC,YAAM,QAAmB,IAAqB,eAAO,MAAA,IAAA,eAAA,uBAAA;;;AAIzD,SAAO;;;;AChBH,yBACJ,UACA,WAAyB;AAEzB,MAAI,UAAO,SAAA,IAAQ;AACnB,MAAM,aAAa,SAAC,MAAS;AAC3B,QAAI,OAAO,SAAS,YAAY;AAC9B,gBAAO,SAAA,SAAA,IAAQ,UAAY,KAAK;WAC3B;AACL,gBAAO,SAAA,SAAA,IAAQ,UAAY;;;AAG/B,MAAM,aAAa,WAAA;AAAM,WAAA,SAAA,IAAM;;AAE/B,SAAO,eAAe,WAAW,cAAc;IAC7C,YAAY;IACZ,OAAO;;AAGT,SAAO,eAAe,WAAW,cAAc;IAC7C,YAAY;IACZ,OAAO;;AAGT,SAAO;;;;ACvBH,4BAA6B,WAAyB;AAC1D,MAAM,uBAAuC;IAC3C,WAAW,UAAU,aAAa;IAClC,YAAY,UAAU,cAAc;IACpC,eAAe,UAAU;IACzB,OAAO,UAAU;;AAInB,MAAI,CAAC,qBAAqB,eAAe;AACvC,yBAAqB,gBACnB,OAAO,qBAAqB,UAAU,WAClC,iBAAiB,qBAAqB,UAAU,SAChD;;AAGR,SAAO;;;;ACHT,qBAAqB,IAAe,SAAiB;AACnD,SAAQ,UAAU,QAAQ,MAAM,8BAAW;;AAG7C,gBAAgB,SAAoC;AAClD,SAAO,OAAO,YAAY,aAAa,IAAI,WAAW,WAAW;;AAGnE,uBAAuB,MAAgB;AACrC,SAAO,KAAK,QAAQ,UAAU;;AAGhC,IAAA,YAAA,SAAA,QAAA;AAAwB,YAAA,YAAA;AAEtB,sBAAY,SAAkB,MAAiB;AAA/C,QAAA,QACE,OAAA,KAAA,MAAM,YAAQ;AACd,UAAK,OAAO;;;AAEhB,SAAA;EANwB;AAQxB,IAAA,aAAA,WAAA;AAkFE,uBAAY,SAAwB;AAClC,QAAI;AAAS,WAAK,UAAU;;AAlFhB,cAAA,QAAd,WAAA;AACE,WAAO,IAAI,YAAW,WAAA;AAAM,aAAA,8BAAW;;;AAG3B,cAAA,OAAd,SAAmB,OAAsC;AACvD,QAAI,MAAM,WAAW;AAAG,aAAO,YAAW;AAC1C,WAAO,MAAM,IAAI,QAAQ,OAAO,SAAC,GAAG,GAAC;AAAK,aAAA,EAAE,OAAO;;;AAGvC,cAAA,QAAd,SACE,MACA,MACA,OAAmC;AAEnC,QAAM,WAAW,OAAO;AACxB,QAAM,YAAY,OAAO,SAAS,IAAI,YAAW;AAEjD,QAAI,cAAc,aAAa,cAAc,YAAY;AACvD,aAAO,IAAI,YAAW,SAAA,WAAS;AAC7B,eAAO,KAAK,aACR,SAAS,QAAQ,cAAc,8BAAW,OAC1C,UAAU,QAAQ,cAAc,8BAAW;;WAE5C;AACL,aAAO,IAAI,YAAW,SAAC,WAAW,SAAO;AACvC,eAAO,KAAK,aACR,SAAS,QAAQ,WAAW,YAAY,8BAAW,OACnD,UAAU,QAAQ,WAAW,YAAY,8BAAW;;;;AAKhD,cAAA,UAAd,SACE,MACA,WAAyB;AAEzB,WACE,KAAK,QACH,gBACE,UAAU,SACV,mBAAmB,kBAAkB,iBAEpC,8BAAW;;AAIN,cAAA,SAAd,SACE,OACA,QAAmC;AAEnC,QAAM,YAAY,OAAO;AACzB,QAAI,cAAc,YAAY;AAC5B,MAEI,UAAA,KAAA,IAAA,UAAA,2EAGF;AACF,aAAO;;AAET,QAAM,WAAW,OAAO;AAExB,QAAI,cAAc,WAAW;AAC3B,aAAO,IAAI,YACT,SAAA,WAAS;AACP,eAAA,UAAU,QACR,WACA,SAAA,IAAE;AAAI,iBAAA,SAAS,QAAQ,OAAO,8BAAW;cACtC,8BAAW;;WAEf;AACL,aAAO,IAAI,YAAW,SAAC,WAAW,SAAO;AACvC,eACE,UAAU,QAAQ,WAAW,SAAA,IAAE;AAC7B,iBAAO,SAAS,QAAQ,IAAI,YAAY,8BAAW;cAC/C,8BAAW;;;;AAUlB,cAAA,UAAA,QAAP,SACE,MACA,MACA,OAAmC;AAEnC,WAAO,KAAK,OACV,YAAW,MAAM,MAAM,MAAM,SAAS,IAAI,YAAW;;AAIlD,cAAA,UAAA,SAAP,SAAc,MAAiC;AAC7C,WAAO,YAAW,OAAO,MAAM;;AAG1B,cAAA,UAAA,UAAP,SACE,WACA,SAAkB;AAElB,UAAM,QAAmB,IAAA,eAA8B,MAAA,IAAA,eAAA;;AAG/C,cAAA,UAAA,UAAV,SACE,OACA,UAA8C;AAE9C,QAAI,YAAY,SAAS,OAAO;AAC9B,eAAS,MAAM;AAOf,aAAO;;AAGT,UAAM;;AAGD,cAAA,UAAA,aAAP,SAAkB,IAAyB;AACzC,SAAK,UAAU;AACf,WAAO;;AAEX,SAAA;;;;ACnKO,IAAM,QAAQ,WAAW;;;ACAzB,IAAM,OAAO,WAAW;;;ACAxB,IAAM,QAAQ,WAAW;;;ACAzB,IAAM,SAAS,WAAW;;;ACA1B,IAAM,UAAU,WAAW;;;ACF3B,IAAM,UAAU;;;ACGf,IAAA,kBAAmB,OAAO,UAAS;AAQrC,mCACJ,YAAmC;AAEnC,SAAO,SAAC,UAAkB;AAAK,WAAA,SAC5B,OACA,KAAK,SAAA,UAAQ;AACZ,UAAI;AACF,eAAO,KAAK,MAAM;eACX,KAAP;AACA,YAAM,aAAa;AACnB,mBAAW,OAAO;AAClB,mBAAW,WAAW;AACtB,mBAAW,aAAa,SAAS;AACjC,mBAAW,WAAW;AACtB,cAAM;;OAGT,KAAK,SAAC,SAAW;AAChB,UAAI,SAAS,UAAU,KAAK;AAE1B,yBACE,UACA,SACA,mDAAiD,SAAS;;AAI9D,UACE,CAAC,MAAM,QAAQ,YACf,CAAC,gBAAe,KAAK,SAAQ,WAC7B,CAAC,gBAAe,KAAK,SAAQ,WAC7B;AAEA,yBACE,UACA,SACA,4CACE,OAAM,QAAQ,cACV,WAAW,IAAI,SAAA,IAAE;AAAI,iBAAA,GAAG;aACxB,WAAW,iBAAa;;AAIlC,aAAO;;;;;;AChDN,IAAM,0BAA0B,SAAC,GAAQ,OAAa;AAC3D,MAAI;AACJ,MAAI;AACF,iBAAa,KAAK,UAAU;WACrB,GAAP;AACA,QAAM,aAAa,QACjB,IAAA,eAAgC,MAAA,IAAA,eAA0B,6BACtC,QAAA,2BAAA,EAAA;AACtB,eAAW,aAAa;AACxB,UAAM;;AAER,SAAO;;;;ACgET,IAAM,qBAAuC;EAC3C,cAAc;EACd,mBAAmB;;AAGrB,IAAM,iBAAiB;EAErB,QAAQ;EACR,gBAAgB;;AAGlB,IAAM,iBAAiB;EACrB,QAAQ;;AAGH,IAAM,qBAAqB;EAChC,MAAM;EACN,SAAS;EACT,SAAS;;AAGJ,IAAM,2BAA2B,SACtC,WACA,gBAA0B;AAC1B,MAAA,UAAA;WAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAA6B;AAA7B,YAAA,KAAA,KAAA,UAAA;;AAEA,MAAI,UAAO,SAAA,SAAA,IACN,eAAe,UAAO,EACzB,SAAS,eAAe,SACxB,aAAa,eAAe;AAE9B,MAAI,OAAyB,eAAe,QAAQ;AAMpD,UAAQ,QAAQ,SAAA,QAAM;AACpB,cAAO,SAAA,SAAA,SAAA,IACF,UACA,OAAO,UAAO,EACjB,SAAO,SAAA,SAAA,IACF,QAAQ,UACR,OAAO;AAGd,QAAI,OAAO;AAAa,cAAQ,cAAc,OAAO;AAErD,WAAI,SAAA,SAAA,IACC,OACA,OAAO;;AAKN,MAAA,gBAAgD,UAAS,eAA1C,aAAiC,UAAS,YAA9B,YAAqB,UAAS,WAAnB,QAAU,UAAS;AACjE,MAAM,OAAa,EAAE,eAAe;AAEpC,MAAI,KAAK;AAAoB,SAAa,aAAa;AAGvD,MAAI,KAAK;AAAe,SAAa,QAAQ,MAAM;AAEnD,SAAO;IACL;IACA;;;;;AChJG,IAAM,eAAe,SAAC,SAAuD;AAClF,MAAI,CAAC,WAAW,OAAO,UAAU,aAAa;AAC5C,UAAM,QAAmB,IAAA,eAAA,MAAA,IAAA,eAAA;;;;;;;;;;;;;ACJtB,IAAM,0BAA0B,WAAA;AACrC,MAAI,OAAO,oBAAoB;AAC7B,WAAO,EAAE,YAAY,OAAO,QAAQ;AAEtC,MAAM,aAAa,IAAI;AACvB,MAAM,SAAS,WAAW;AAC1B,SAAO,EAAE,YAAY;;;;ACJhB,IAAM,YAAY,SACvB,WACA,aAAyD;AAEzD,MAAM,UAAU,UAAU;AAC1B,MAAM,aAAa,QAAQ;AAE3B,MAAI,YAAY;AACd,WAAO;aACE,OAAO,gBAAgB,YAAY;AAC5C,WAAO,YAAY;SACd;AACL,WAAQ,eAA0B;;;;;ACThC,0BAA2B,WAAmB,MAAU;AAG5D,MAAM,cAAwB;AAC9B,MAAM,gBAAgB,SAAC,KAAa,OAAa;AAC/C,gBAAY,KAAQ,MAAG,MAAI,mBAAmB;;AAGhD,MAAI,WAAW,MAAM;AACnB,kBAAc,SAAS,KAAK;;AAE9B,MAAI,KAAK,eAAe;AACtB,kBAAc,iBAAiB,KAAK;;AAEtC,MAAI,KAAK,WAAW;AAClB,QAAI,sBAAmB;AACvB,QAAI;AACF,4BAAsB,wBACpB,KAAK,WACL;aAEK,YAAP;AACA,aAAO,EAAE;;AAEX,kBAAc,aAAa;;AAE7B,MAAI,KAAK,YAAY;AACnB,QAAI,uBAAoB;AACxB,QAAI;AACF,6BAAuB,wBACrB,KAAK,YACL;aAEK,YAAP;AACA,aAAO,EAAE;;AAEX,kBAAc,cAAc;;AAS9B,MAAI,WAAW,IACb,cAAc;AAChB,MAAM,gBAAgB,UAAU,QAAQ;AACxC,MAAI,kBAAkB,IAAI;AACxB,eAAW,UAAU,OAAO;AAC5B,kBAAc,UAAU,OAAO,GAAG;;AAEpC,MAAM,oBAAoB,YAAY,QAAQ,SAAS,KAAK,MAAM;AAClE,MAAM,SACJ,cAAc,oBAAoB,YAAY,KAAK,OAAO;AAC5D,SAAO,EAAE;;;;AC3CJ,IAAM,iBAAiB,SAAC,aAA6B;AAA7B,MAAA,gBAAA,QAAA;AAAA,kBAAA;;AAE3B,MAAA,MAOE,YAAW,KAPb,MAAG,QAAA,SAAG,aAAU,KAET,UAKL,YAAW,OAJb,oBAIE,YAAW,mBAHb,mBAGE,YAAW,kBAFb,KAEE,YAAW,wBAFb,yBAAsB,OAAA,SAAG,QAAK,IAC3B,iBAAc,OACf,aARA,CAAA,OAAA,SAAA,qBAAA,oBAAA;AAWJ,eAAa;AAKb,MAAI,CAAC,SAAS;AACZ,cAAU;;AAGZ,MAAM,aAAa;IACjB,MAAM,EAAE;IACR,SAAS,eAAe;IACxB,aAAa,eAAe;IAC5B,SAAS,eAAe;;AAG1B,SAAO,IAAI,WAAW,SAAA,WAAS;AAC7B,QAAI,YAAY,UAAU,WAAW;AAErC,QAAM,UAAU,UAAU;AAQ1B,QAAM,yBAGF;AAEJ,QAAI,QAAQ,iBAAiB;AACrB,UAAA,MAAoB,QAAQ,iBAA1B,SAAI,IAAA,MAAE,WAAO,IAAA;AACrB,UAAI,QAAM;AACR,+BAAuB,+BAA+B;;AAExD,UAAI,UAAS;AACX,+BAAuB,kCAAkC;;;AAI7D,QAAM,iBAAc,SAAA,SAAA,IAAQ,yBAA2B,QAAQ;AAE/D,QAAM,gBAAgB;MACpB,MAAM,QAAQ;MACd,SAAS,QAAQ;MACjB,aAAa,QAAQ;MACrB,SAAS;;AAIL,QAAA,MAAoB,yBACxB,WACA,oBACA,YACA,gBAJM,UAAO,IAAA,SAAE,OAAI,IAAA;AAOrB,QAAI,KAAK,aAAa,CAAC,wBAAwB;AAC7C,UAAM,gBAAc,IAAI,IAAI,OAAO,KAAK,KAAK;AAC7C,YAAM,UAAU,OAAO;QACrB,UAAA,SAAS,MAAM,MAAM,QAAM;AAKzB,cAAI,UAAW,OAAkC,SAAS,sBAAsB;AAC9E,0BAAY,OAAO,KAAK,KAAK;;;;AAInC,UAAI,cAAY,MAAM;AAGpB,aAAK,YAAS,SAAA,IAAQ,KAAK;AAC3B,sBAAY,QAAQ,SAAA,MAAI;AACtB,iBAAO,KAAK,UAAW;;;;AAK7B,QAAI;AACJ,QAAI,CAAE,QAAgB,QAAQ;AACtB,UAAA,KAAsC,2BAAxB,cAAW,GAAA,YAAE,SAAM,GAAA;AACvC,mBAAa;AACb,UAAI;AAAa,gBAAgB,SAAS;;AAI5C,QAAM,uBAAuB,SAAC,GAAiB;AAC7C,aAAO,EAAE,SAAS,yBAAyB,EAAE,cAAc;;AAE7D,QACE,oBACA,CAAC,UAAU,MAAM,YAAY,KAAK,uBAClC;AACA,cAAQ,SAAS;;AAGnB,QAAI,QAAQ,WAAW,OAAO;AACtB,UAAA,KAAyB,iBAAiB,WAAW,OAAnD,SAAM,GAAA,QAAE,aAAU,GAAA;AAC1B,UAAI,YAAY;AACd,eAAO,UAAU;;AAEnB,kBAAY;WACP;AACL,UAAI;AACD,gBAAgB,OAAO,wBAAwB,MAAM;eAC/C,aAAP;AACA,eAAO,UAAU;;;AAIrB,WAAO,IAAI,8BAAW,SAAA,UAAQ;AAC5B,cAAS,WAAW,SACjB,KAAK,SAAA,UAAQ;AACZ,kBAAU,WAAW,EAAE;AACvB,eAAO;SAER,KAAK,0BAA0B,YAC/B,KAAK,SAAA,SAAM;AAEV,iBAAS,KAAK;AACd,iBAAS;AACT,eAAO;SAER,MAAM,SAAA,KAAG;AAER,YAAI,IAAI,SAAS;AAAc;AAO/B,YAAI,IAAI,UAAU,IAAI,OAAO,UAAU,IAAI,OAAO,MAAM;AA2BtD,mBAAS,KAAK,IAAI;;AAEpB,iBAAS,MAAM;;AAGnB,aAAO,WAAA;AAGL,YAAI;AAAY,qBAAW;;;;;;;ACpMnC,IAAA,WAAA,SAAA,QAAA;AAA8B,YAAA,WAAA;AAE5B,qBAAmB,SAAyB;AAAzB,QAAA,YAAA,QAAA;AAAA,gBAAA;;AAAnB,QAAA,QACE,OAAA,KAAA,MAAM,eAAe,SAAS,YAAQ;AADrB,UAAA,UAAA;;;AAGrB,SAAA;EAL8B;;;ACJxB,IAAA,MAA+B,OAAO;AAAtC,IAAE,YAAQ,IAAA;AAAV,IAAY,kBAAc,IAAA;AAChC,IAAM,UAAU,SAAS,UAAU;AACnC,IAAM,sBAAsB,IAAI;eAKV,GAAQ,GAAM;AAClC,MAAI;AACF,WAAO,MAAM,GAAG;;AAEhB,wBAAoB;;;AAOxB,eAAe,GAAQ,GAAM;AAE3B,MAAI,MAAM,GAAG;AACX,WAAO;;AAKT,MAAM,OAAO,UAAS,KAAK;AAC3B,MAAM,OAAO,UAAS,KAAK;AAK3B,MAAI,SAAS,MAAM;AACjB,WAAO;;AAGT,UAAQ;SACD;AAGH,UAAI,EAAE,WAAW,EAAE;AAAQ,eAAO;SAE/B,mBAAmB;AACtB,UAAI,mBAAmB,GAAG;AAAI,eAAO;AAErC,UAAM,QAAQ,YAAY;AAC1B,UAAM,QAAQ,YAAY;AAI1B,UAAM,WAAW,MAAM;AACvB,UAAI,aAAa,MAAM;AAAQ,eAAO;AAGtC,eAAS,IAAI,GAAG,IAAI,UAAU,EAAE,GAAG;AACjC,YAAI,CAAC,gBAAe,KAAK,GAAG,MAAM,KAAK;AACrC,iBAAO;;;AAKX,eAAS,IAAI,GAAG,IAAI,UAAU,EAAE,GAAG;AACjC,YAAM,MAAM,MAAM;AAClB,YAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO;AAC1B,iBAAO;;;AAIX,aAAO;;SAGJ;AACH,aAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE;SAEzC;AAEH,UAAI,MAAM;AAAG,eAAO,MAAM;SAEvB;SACA;AACH,aAAO,CAAC,MAAM,CAAC;SAEZ;SACA;AACH,aAAO,KAAK,KAAG;SAEZ;SACA,gBAAgB;AACnB,UAAI,EAAE,SAAS,EAAE;AAAM,eAAO;AAC9B,UAAI,mBAAmB,GAAG;AAAI,eAAO;AAErC,UAAM,YAAY,EAAE;AACpB,UAAM,QAAQ,SAAS;AAEvB,aAAO,MAAM;AACX,YAAM,OAAO,UAAU;AACvB,YAAI,KAAK;AAAM;AAGT,YAAA,MAAiB,KAAK,OAArB,OAAI,IAAA,IAAE,SAAM,IAAA;AAGnB,YAAI,CAAC,EAAE,IAAI,OAAO;AAChB,iBAAO;;AAKT,YAAI,SAAS,CAAC,MAAM,QAAQ,EAAE,IAAI,QAAQ;AACxC,iBAAO;;;AAIX,aAAO;;SAGJ;SACA;SACA;SACA;SACA;SACA;SACA;AAGH,UAAI,IAAI,WAAW;AACnB,UAAI,IAAI,WAAW;SAEhB,qBAAqB;AACxB,UAAI,MAAM,EAAE;AACZ,UAAI,QAAQ,EAAE,YAAY;AACxB,eAAO,SAAS,EAAE,SAAS,EAAE,MAAM;;;AAIrC,aAAO,QAAQ;;SAGZ;SACA;SACA;SACA,qBAAqB;AACxB,UAAM,QAAQ,QAAQ,KAAK;AAC3B,UAAI,UAAU,QAAQ,KAAK,IAAI;AAC7B,eAAO;;AA0BT,aAAO,CAAC,SAAS,OAAO;;;AAK5B,SAAO;;AAGT,qBAA6C,KAAY;AAGvD,SAAO,OAAO,KAAK,KAAK,OAAO,cAAc;;AAE/C,sBAEE,KAAkB;AAElB,SAAO,KAAK,SAAS;;AAGvB,IAAM,mBAAmB;AAEzB,kBAAkB,MAAc,QAAc;AAC5C,MAAM,YAAY,KAAK,SAAS,OAAO;AACvC,SAAO,aAAa,KAClB,KAAK,QAAQ,QAAQ,eAAe;;AAGxC,4BAA4B,GAAW,GAAS;AAS9C,MAAI,OAAO,oBAAoB,IAAI;AACnC,MAAI,MAAM;AAGR,QAAI,KAAK,IAAI;AAAI,aAAO;SACnB;AACL,wBAAoB,IAAI,GAAG,OAAO,IAAI;;AAExC,OAAK,IAAI;AACT,SAAO;;;;AClNH,uBAAwB,KAAU;AACtC,SAAO,IAAI,eAAe;;AAO5B,IAAM,uBAAuB,SAAC,KAAgB;AAC5C,MAAI,UAAU;AAEd,MAAI,gBAAgB,IAAI,gBAAgB;AACtC,QAAI,cAAc,QAAQ,SAAC,cAA0B;AACnD,UAAM,eAAe,eACjB,aAAa,UACb;AACJ,iBAAc,eAAY;;;AAI9B,MAAI,IAAI,cAAc;AACpB,eAAc,IAAI,aAAa,UAAO;;AAIxC,YAAU,QAAQ,QAAQ,OAAO;AACjC,SAAO;;AAGT,IAAA,cAAA,SAAA,QAAA;AAAiC,YAAA,cAAA;AAa/B,wBAAY,KAUX;QATC,gBAAa,IAAA,eACb,eAAY,IAAA,cACZ,eAAY,IAAA,cACZ,YAAS,IAAA;AAJX,QAAA,QAWE,OAAA,KAAA,MAAM,iBAAa;AACnB,UAAK,gBAAgB,iBAAiB;AACtC,UAAK,eAAe,gBAAgB;AACpC,UAAK,UAAU,gBAAgB,qBAAqB;AACpD,UAAK,YAAY;AAIhB,UAAa,YAAY,aAAY;;;AAE1C,SAAA;EAlCiC;;;AChCjC,IAAY;AAAZ,AAAA,UAAY,gBAAa;AAMvB,iBAAA,eAAA,aAAA,KAAA;AAMA,iBAAA,eAAA,kBAAA,KAAA;AAMA,iBAAA,eAAA,eAAA,KAAA;AAMA,iBAAA,eAAA,aAAA,KAAA;AAOA,iBAAA,eAAA,UAAA,KAAA;AAKA,iBAAA,eAAA,WAAA,KAAA;AAKA,iBAAA,eAAA,WAAA,KAAA;GAzCU,iBAAA,iBAAa;AAgDnB,kCACJ,eAA6B;AAE7B,SAAO,gBAAgB,gBAAgB,IAAI;;;;ACtC7C,IAAA,aAAA,WAAA;AACE,uBACU,UACA,SAKA,QASA,aAAoC;AAfpC,SAAA,WAAA;AACA,SAAA,UAAA;AAKA,SAAA,QAAA;AASA,SAAA,cAAA;;AAKH,cAAA,UAAA,YAAP,SACE,YACA,kBAAgC;AAEhC,QAAI,YAAY;AACd,WAAK,cAAc;WACd;AAIL,WAAK;;AAGP,QAAM,UAAU,KAAK,MAAM,KAAK,SAAS;AAEzC,QAAI,KAAK,SAAS;AAOhB,WAAK,QAAQ,eAAe,KAAK,UAAU;;AAG7C,YAAQ,YAAY,KAAK;AAEzB,WAAQ,MAAK,UAAU,SAAS;;AAG3B,cAAA,UAAA,gBAAP,SAAqB,YAAoD;AACvE,WAAO,OAAO,KAAK,SAAS,QAAQ;AACpC,SAAK;AACL,WAAO;;AAGF,cAAA,UAAA,OAAP,WAAA;AACE,QAAI,KAAK,SAAS;AAChB,WAAK,QAAQ,eAAe,KAAK;AACjC,aAAO,KAAK;;AAGd,QAAI,KAAK,aAAa;AACpB,mBAAa,KAAK,YAAY;AAC9B,WAAK,QAAQ,eAAe;AAC5B,WAAK;;;AAUD,cAAA,UAAA,gBAAR,WAAA;AAAA,QAAA,QAAA;AACQ,QAAA,MAKF,MAJF,cAAW,IAAA,aAET,eAAY,IAAA,QAAA;AAIhB,QAAI,CAAC,cAAc;AACjB,UAAI,aAAa;AACf,qBAAa,YAAY;AACzB,eAAO,KAAK;;AAEd;;AAGF,QAAI,eACA,YAAY,aAAa,cAAc;AACzC;;AAGF,YAEE,UAAA,cAAA,MAAA,UAAA,cACA;AAGF,QAAI,KAAK,gBAAgB,OAAO;AAC9B;;AAGF,QAAM,OAAO,eACX,MAAK,cAAc;AAGrB,SAAK,WAAW;AAEhB,QAAM,aAAa,WAAA;AACjB,UAAI,MAAK,aAAa;AACpB,YAAI,MAAK,eAAe,MAAK,eAAe;AAC1C,gBAAK,UAAU;YACb,aAAa;YACb,iBAAiB,MAAK,QAAQ,eAAe;aAC5C,cAAc,MAAM,KAAK,MAAM;eAC7B;AACL;;;AAEH;;AAGH,QAAM,OAAO,WAAA;AACX,UAAM,QAAO,MAAK;AAClB,UAAI,OAAM;AACR,qBAAa,MAAK;AAClB,cAAK,UAAU,WAAW,YAAY,MAAK;;;AAI/C;;AAEJ,SAAA;;;;AC/GA,IAAI,yBAAyB;AAE7B,IAAA,kBAAA,SAAA,QAAA;AAGU,YAAA,kBAAA;AAqBR,4BAAY,KAQX;QAPC,eAAY,IAAA,cACZ,YAAS,IAAA,WACT,UAAO,IAAA;AAHT,QAAA,QASE,OAAA,KAAA,MAAM,SAAC,UAA4C;AACjD,aAAA,MAAK,YAAY;UAClB;AAnBK,UAAA,YAAY,IAAI;AAChB,UAAA,gBAAgB,IAAI;AA2hBpB,UAAA,WAAW;MACjB,MAAM,SAAC,SAAgC;AACrC,YAAI,MAAK,aAAa,MAAK,0BAA0B,UAAS;AAC5D,gBAAK,iBAAiB;AACtB,iCAAuB,MAAK,WAAW,QAAQ;;;MAInD,OAAO,SAAC,OAAkB;AAGxB,cAAK,iBAAgB,SAAA,SAAA,IAChB,MAAK,aAAU,EAClB,OACA,QAAQ,MAAM,eACd,eAAe,cAAc,OAC7B,SAAS;AAGX,+BAAuB,MAAK,WAAW,SAAS,MAAK,YAAY;;;AAzhBnE,UAAK,aAAa;AAGlB,UAAK,UAAU;AACf,UAAK,UAAU,aAAa;AAE5B,QAAM,QAAQ,uBAAuB,QAAQ;AAC7C,UAAK,YAAY,SAAS,MAAM,QAAQ,MAAM,KAAK;AAGnD,UAAK,eAAe;AAEpB,UAAK,YAAY;;;AAxCnB,SAAA,eAAW,iBAAA,WAAA,aAAS;SAApB,WAAA;AACE,aAAO,KAAK,QAAQ;;;;;AA0Cf,mBAAA,UAAA,SAAP,WAAA;AAAA,QAAA,QAAA;AACE,WAAO,IAAI,QAAQ,SAAC,SAAS,QAAM;AACjC,UAAM,WAA+C;QACnD,MAAM,SAAC,SAAgC;AACrC,kBAAQ;AAYR,gBAAK,UAAU,OAAO;AACtB,cAAI,CAAC,MAAK,UAAU,MAAM;AACxB,kBAAK,aAAa,YAAY,MAAK;;AAGrC,qBAAW,WAAA;AACT,yBAAa;aACZ;;QAEL,OAAO;;AAET,UAAM,eAAe,MAAK,UAAU;;;AAIjC,mBAAA,UAAA,mBAAP,SAAwB,kBAAuB;AAAvB,QAAA,qBAAA,QAAA;AAAA,yBAAA;;AACd,QAAA,aAAe,KAAI;AAE3B,QAAM,gBACJ,KAAK,UAAU,iBACd,cAAc,WAAW,iBAC1B,cAAc;AAEhB,QAAM,UAAM,SAAA,SAAA,IACP,aAAU,EACb,SAAS,yBAAyB,gBAClC;AAGF,QAAI,KAAK,YAAY;AACnB,aAAO;;AAGD,QAAA,MAAgC,KAAK,QAAO,aAA5C,cAAW,QAAA,SAAG,gBAAa;AACnC,QAAI,gBAAgB,cAChB,gBAAgB,gBAAgB;AAGlC,aAAO,QAAO;eAEd,CAAC,QAAO,QAQR,CAAC,KAAK,aAAa,UAAU,KAAK,QAAQ,OAAO,oBACjD;AACA,UAAM,OAAO,KAAK,UAAU;AAC5B,cAAO,OACL,KAAK,YACL,KAAK,QAAQ,oBACX,KAAK,SAAS;AAClB,UAAI,KAAK,UAAU;AAIjB,YAAI,QAAO,kBAAkB,cAAc,WACtC,iBAAgB,iBAChB,gBAAgB,eAAe;AAClC,kBAAO,gBAAgB,cAAc;AACrC,kBAAO,UAAU;;AAEnB,eAAO,QAAO;aACT;AACL,gBAAO,UAAU;;;AAIrB,QAAI,kBAAkB;AACpB,WAAK,iBAAiB;;AAGxB,WAAO;;AAKF,mBAAA,UAAA,4BAAP,SAAiC,WAAmC;AAClE,WAAO,CAAC,MAAM,KAAK,oBAAoB;;AAKlC,mBAAA,UAAA,gBAAP,WAAA;AACE,WAAO,KAAK;;AAGP,mBAAA,UAAA,eAAP,WAAA;AACE,WAAO,KAAK;;AAGP,mBAAA,UAAA,mBAAP,WAAA;AACE,WAAO,KAAK;AACZ,WAAO,KAAK;AACZ,WAAO,KAAK;AACZ,SAAK,aAAa;;AAGb,mBAAA,UAAA,wBAAP,WAAA;AACE,SAAK,aAAa,YAAY,KAAK;;AAU9B,mBAAA,UAAA,UAAP,SAAe,WAA+B;AAC5C,QAAM,mBAAkE;MAEtE,cAAc;;AAMR,QAAA,cAAgB,KAAK,QAAO;AACpC,QAAI,gBAAgB,cAChB,gBAAgB,qBAAqB;AACvC,uBAAiB,cAAc;AAE/B,uBAAiB,kBAAkB,eAAe;;AAGpD,QAAI,aAAa,CAAC,MAAM,KAAK,QAAQ,WAAW,YAAY;AAE1D,uBAAiB,YAAY,KAAK,QAAQ,YAAY,SAAA,SAAA,IACjD,KAAK,QAAQ,YACb;;AAIP,WAAO,KAAK,cAAc,OAAO,UAC/B,kBACA,cAAc;;AAIX,mBAAA,UAAA,YAAP,SACE,kBACqC;AAFvC,QAAA,QAAA;AAIE,QAAM,kBAAkB,SAAA,SAAA,IAClB,iBAAiB,QAAQ,mBAAkB,SAAA,SAAA,SAAA,IAC1C,KAAK,UACL,mBAAgB,EACnB,WAAS,SAAA,SAAA,IACJ,KAAK,QAAQ,YACb,iBAAiB,gBAEtB,EAMF,aAAa;AAGf,QAAM,MAAM,KAAK,aAAa;AAI9B,QAAI,gBAAgB,6BAA6B;AAC/C,WAAK,UAAU,gBAAgB,cAAc;AAC7C,WAAK;;AAGP,WAAO,KAAK,aAAa,WACvB,KACA,iBACA,cAAc,WACd,KAAK,SAAA,iBAAe;AACpB,UAAM,OAAO,gBAAgB;AACrB,UAAA,cAAgB,iBAAgB;AAExC,UAAI,aAAa;AACf,YACI,CAAC,wBAAwB;AAC3B,UACV,UAAA,KAAA;AAWU,mCAAyB;;AAE3B,cAAK,YAAY,SAAA,UAAQ;AAAI,iBAAA,YAAY,UAAU;YACjD,iBAAiB;YACjB,WAAW,gBAAgB;;;aAExB;AAML,cAAK,aAAa,MAAM,WAAW;UACjC,OAAO,gBAAgB;UACvB,WAAW,gBAAgB;UAC3B;;;AAIJ,aAAO;OAEN,QAAQ,WAAA;AACT,YAAK,aAAa,UAAU;AAC5B,YAAK;;;AAOF,mBAAA,UAAA,kBAAP,SAIE,SAIC;AARH,QAAA,QAAA;AAUE,QAAM,eAAe,KAAK,aACvB,yBAAyB;MACxB,OAAO,QAAQ;MACf,WAAW,QAAQ;MACnB,SAAS,QAAQ;OAElB,UAAU;MACT,MAAM,SAAC,kBAA6C;AAC1C,YAAA,cAAgB,QAAO;AAC/B,YAAI,aAAa;AACf,gBAAK,YACH,SAAC,UAAU,KAAa;gBAAX,YAAS,IAAA;AACpB,mBAAA,YAAY,UAAU;cACpB;cACA;;;;;MAKV,OAAO,SAAC,KAAQ;AACd,YAAI,QAAQ,SAAS;AACnB,kBAAQ,QAAQ;AAChB;;AAEF,QAAgB,UAAA,MAAwC,wCAAK;;;AAInE,SAAK,cAAc,IAAI;AAEvB,WAAO,WAAA;AACL,UAAI,MAAK,cAAc,OAAO,eAAe;AAC3C,qBAAa;;;;AAKZ,mBAAA,UAAA,aAAP,SACE,YAAyD;AAEzD,WAAO,KAAK,UAAU;;AA4BjB,mBAAA,UAAA,eAAP,SACE,WAAqB;AAErB,QAAI,MAAM,KAAK,WAAW,YAAY;AAIpC,aAAO,KAAK,UAAU,OAClB,KAAK,WACL,QAAQ;;AAGd,SAAK,QAAQ,YAAY;AAGzB,QAAI,CAAC,KAAK,UAAU,MAAM;AACxB,aAAO,QAAQ;;AAGX,QAAA,MAAgC,KAAK,QAAO,aAA5C,cAAW,QAAA,SAAG,gBAAa;AACjC,QAAM,mBAAkE;MACtE;MACA;;AAGF,QAAI,gBAAgB,iBAChB,gBAAgB,cAChB,gBAAgB,gBAAgB;AAClC,uBAAiB,cAAc;AAC/B,uBAAiB,kBAAkB;;AAGrC,WAAO,KAAK,UACV,kBACA,cAAc;;AAIX,mBAAA,UAAA,cAAP,SACE,OAGU;;AAEF,QAAA,eAAiB,KAAI;AACrB,QAAA,UAAW,aAAa,MAAM,KAAY;MAChD,OAAO,KAAK,QAAQ;MACpB,WAAW,KAAK;MAChB,gBAAc,OAAE,KAAK,gBAAU,QAAA,QAAA,SAAA,SAAA,IAAE;MACjC,mBAAmB;MACnB,YAAY;OACZ;AAEF,QAAM,YAAY,MAAM,SAAS;MAC/B,WAAY,KAAa;;AAG3B,QAAI,WAAW;AACb,mBAAa,MAAM,WAAW;QAC5B,OAAO,KAAK,QAAQ;QACpB,MAAM;QACN,WAAW,KAAK;;AAGlB,mBAAa;;;AAIV,mBAAA,UAAA,eAAP,SAAoB,cAAoB;AACtC,SAAK,gBAAgB,cAAc,EAAE;;AAGhC,mBAAA,UAAA,cAAP,WAAA;AACE,QAAI,KAAK,YAAY;AACnB,WAAK,WAAW,cAAc,EAAE,cAAc;;;AAI1C,mBAAA,UAAA,mBAAR,SAAyB,WAAmC;AAC1D,QAAM,iBAAiB,KAAK;AAC5B,SAAK,aAAa;AAClB,SAAK,qBAAqB,KAAK,aAAa,yBACxC,YACA,UAAU;AACd,QAAI,CAAC,gBAAgB,UAAU,SAAS;AACtC,aAAO,KAAK;;AAEd,WAAO;;AAGD,mBAAA,UAAA,cAAR,SAAoB,UAA4C;AAAhE,QAAA,QAAA;AAKE,QAAI,aAAa,KAAK,UAAU;AAC9B,aAAO,WAAA;;;AAKT,QAAI;AACF,UAAI,cAAe,SAAiB,cAAc;AAClD,UAAI,eAAe,CAAC,YAAY,OAAO;AACrC,oBAAY,QAAQ;;aAEtB,KAAA;;AAEF,QAAM,QAAQ,CAAC,KAAK,UAAU;AAC9B,SAAK,UAAU,IAAI;AAGnB,QAAI,KAAK,WAAW;AAClB,eAAS,SAAS,SAAS,MAAM,KAAK;eAC7B,KAAK,YAAY;AAC1B,eAAS,QAAQ,SAAS,KAAK,KAAK;;AAKtC,QAAI,OAAO;AACT,WAAK,YAAY,MAAM,SAAA,GAAC;;;AAQ1B,WAAO,WAAA;AACL,UAAI,MAAK,UAAU,OAAO,aAAa,CAAC,MAAK,UAAU,MAAM;AAC3D,cAAK;;;;AAOH,mBAAA,UAAA,gBAAR,WAAA;AACE,WAAO,KAAK,cAAe,MAAK,aAAa,KAAK,cAAc;;AAG1D,mBAAA,UAAA,gBAAR,SAAsB,cAAqB;AAA3C,QAAA,QAAA;AACQ,QAAA,MAA4B,MAA1B,eAAY,IAAA,cAAE,UAAO,IAAA;AAC7B,iBAAa,mBAAmB;AAChC,WAAO,IAAI,WACT,KAAK,UAIL,eAAe,KAAK,UAAS,SAAA,IAAM,KAAK,UACxC,SAAC,gBAAgB,kBAAgB;AAC/B,mBAAa,mBAAmB;AAChC,aAAO,aAAa,qBAClB,SACA,gBACA;OAIJ,CAAC,aAAa,WACZ,WAAA;AAAM,aAAA,CAAC,yBAAyB,MAAK,UAAU;;;AAI9C,mBAAA,UAAA,YAAP,SACE,YACA,kBAAgC;AAEhC,SAAK,aAAa;AAClB,WAAO,KAAK,gBAAgB,UAAU,YAAY;;AAK5C,mBAAA,UAAA,UAAR,WAAA;AAKE,SAAK,SAAS,KAAK,KAAK,iBAAiB;;AA0BpC,mBAAA,UAAA,eAAP,WAAA;AACE,WAAO,KAAK,UAAU,OAAO;;AAGvB,mBAAA,UAAA,gBAAR,WAAA;AACE,QAAI,KAAK;AAAY;AAErB,QAAI,KAAK,YAAY;AACnB,WAAK,WAAW;AAChB,aAAO,KAAK;;AAId,SAAK,cAAc,QAAQ,SAAA,KAAG;AAAI,aAAA,IAAI;;AACtC,SAAK,cAAc;AAEnB,SAAK,aAAa,UAAU,KAAK;AAEjC,SAAK,UAAU;AAEf,SAAK,aAAa;;AAEtB,SAAA;EAtlBU;AA0lBV,sBAAsB;AAEtB,kDAAkD,OAAkB;AAClE,EAAyC,UAAS,MAAM,mBAAO,MAAA,SAAA,MAAA;;;;ACtoBjE,IAAM,kBAAkB,WAAA;AAAM,SAAA,OAAO,OAAO;;AAGtC,IAAA,MAAqB,MAAM;AAA3B,IAAE,UAAO,IAAA;AAAT,IAAW,QAAK,IAAA;;AAUpB,iBACU,UACA,UAAkD;AADlD,QAAA,aAAA,QAAA;AAAA,iBAAA;;AACA,QAAA,aAAA,QAAA;AAAA,iBAAA;;AADA,SAAA,WAAA;AACA,SAAA,WAAA;;AAGH,QAAA,UAAA,SAAP,WAAA;AAA+B,QAAA,QAAA;aAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAAW;AAAX,YAAA,MAAA,UAAA;;AAC7B,WAAO,KAAK,YAAY;;AAGnB,QAAA,UAAA,cAAP,SAAiD,OAAQ;AACvD,QAAI,OAAmB;AACvB,YAAQ,KAAK,OAAO,SAAA,KAAG;AAAI,aAAA,OAAO,KAAK,aAAa;;AACpD,WAAO,KAAK,QAAS,MAAK,OAAO,KAAK,SAAS,MAAM,KAAK;;AAGpD,QAAA,UAAA,eAAR,SAAqB,KAAQ;AAC3B,QAAM,MAAM,KAAK,YAAY,SAAS,OAClC,KAAK,QAAS,MAAK,OAAO,IAAI,aAC9B,KAAK,UAAW,MAAK,SAAS,IAAI;AACtC,QAAI,QAAQ,IAAI,IAAI;AACpB,QAAI,CAAC;AAAO,UAAI,IAAI,KAAK,QAAQ,IAAI,MAAW,KAAK,UAAU,KAAK;AACpE,WAAO;;AAEX,SAAA;;AAEA,kBAAkB,OAAU;AAC1B,UAAQ,OAAO;SACV;AACH,UAAI,UAAU;AAAM;SAEjB;AACH,aAAO;;AAET,SAAO;;;;AC5CT,IAAI,iBAAiC;AAIrC,IAAM,gBAAqB;AAE3B,IAAI,YAAY;AAKhB,IAAM,gBAAgB,WAAA;AAAM,SAAA,WAAA;AAAA,qBAAA;AAIV,WAAA,KAAK;QACnB;QACA;QACA,KAAK;QACL,KAAK,SAAS,SAAS,IAAI,MAAM;QACjC,KAAK;;AAEA,UAAA,UAAA,WAAP,WAAA;AACE,eAAS,YAAU,gBAAgB,WAAS,YAAU,UAAQ,QAAQ;AAGpE,YAAI,KAAK,MAAM,UAAQ,OAAO;AAC5B,cAAM,QAAQ,UAAQ,MAAM,KAAK;AACjC,cAAI,UAAU;AAAe;AAC7B,cAAI,cAAY,gBAAgB;AAI9B,2BAAgB,MAAM,KAAK,MAAM;;AAEnC,iBAAO;;;AAGX,UAAI,gBAAgB;AAIlB,uBAAe,MAAM,KAAK,MAAM;;AAElC,aAAO;;AAGF,UAAA,UAAA,WAAP,WAAA;AACE,UAAI,KAAK,YAAY;AACnB,eAAO,eAAgB,MAAM,KAAK;;;AAI/B,UAAA,UAAA,YAAP,SACE,OACA,UAGA,MACA,SAAe;;AAEf,UAAM,QAAK,OAAA;QACT,WAAW;SACX,IAAC,KAAK,MAAK;AAEb,UAAM,SAAS;AACf,uBAAiB,EAAE,QAAQ;AAC3B,UAAI;AAGF,eAAO,SAAS,MAAM,SAAU;;AAEhC,yBAAiB;;;AAMd,UAAA,OAAP,SACE,UAAqC;AAErC,UAAM,UAAU;AAChB,aAAO,WAAA;AACL,YAAM,QAAQ;AACd,YAAI;AACF,2BAAiB;AACjB,iBAAO,SAAS,MAAM,MAAM;;AAE5B,2BAAiB;;;;AAMhB,UAAA,YAAP,SACE,UAGA,MACA,SAAe;AAEf,UAAI,gBAAgB;AAClB,YAAM,QAAQ;AACd,YAAI;AACF,2BAAiB;AAGjB,iBAAO,SAAS,MAAM,SAAU;;AAEhC,2BAAiB;;aAEd;AACL,eAAO,SAAS,MAAM,SAAU;;;AAGtC,WAAA;;;AAUA,IAAM,YAAY;AAClB,IAAM,OAAO;IAEA,OAAyC,KAAK,cAAc,WAAA;AACvE,MAAM,QAAO;AACb,MAAI;AACF,WAAO,eAAe,MAAM,WAAW;MACrC,OAAO,KAAK,aAAa;MACzB,YAAY;MACZ,UAAU;MACV,cAAc;;;AAGhB,WAAO;;;IChJI,OAAoB,KAAI;IAAlB,YAAc,KAAI;;;ACKvC,0BAAuB;;AAEvB,IAAA,QAAA,WAAA;AAKE,kBACU,KACD,SAAoD;AADnD,QAAA,QAAA,QAAA;AAAA,YAAA;;AACD,QAAA,YAAA,QAAA;AAAA,gBAAA;;AADC,SAAA,MAAA;AACD,SAAA,UAAA;AAND,SAAA,MAAM,IAAI;AACV,SAAA,SAA4B;AAC5B,SAAA,SAA4B;;AAO7B,SAAA,UAAA,MAAP,SAAW,KAAM;AACf,WAAO,KAAK,IAAI,IAAI;;AAGf,SAAA,UAAA,MAAP,SAAW,KAAM;AACf,QAAM,OAAO,KAAK,QAAQ;AAC1B,WAAO,QAAQ,KAAK;;AAGd,SAAA,UAAA,UAAR,SAAgB,KAAM;AACpB,QAAM,OAAO,KAAK,IAAI,IAAI;AAE1B,QAAI,QAAQ,SAAS,KAAK,QAAQ;AACxB,UAAA,QAAiB,KAAI,OAAd,QAAU,KAAI;AAE7B,UAAI,OAAO;AACT,cAAM,QAAQ;;AAGhB,UAAI,OAAO;AACT,cAAM,QAAQ;;AAGhB,WAAK,QAAQ,KAAK;AAClB,WAAK,MAAO,QAAQ;AAEpB,WAAK,QAAQ;AACb,WAAK,SAAS;AAEd,UAAI,SAAS,KAAK,QAAQ;AACxB,aAAK,SAAS;;;AAIlB,WAAO;;AAGF,SAAA,UAAA,MAAP,SAAW,KAAQ,OAAQ;AACzB,QAAI,OAAO,KAAK,QAAQ;AACxB,QAAI,MAAM;AACR,aAAO,KAAK,QAAQ;;AAGtB,WAAO;MACL;MACA;MACA,OAAO;MACP,OAAO,KAAK;;AAGd,QAAI,KAAK,QAAQ;AACf,WAAK,OAAO,QAAQ;;AAGtB,SAAK,SAAS;AACd,SAAK,SAAS,KAAK,UAAU;AAE7B,SAAK,IAAI,IAAI,KAAK;AAElB,WAAO,KAAK;;AAGP,SAAA,UAAA,QAAP,WAAA;AACE,WAAO,KAAK,UAAU,KAAK,IAAI,OAAO,KAAK,KAAK;AAC9C,WAAK,OAAO,KAAK,OAAO;;;AAIrB,SAAA,UAAA,SAAP,SAAc,KAAM;AAClB,QAAM,OAAO,KAAK,IAAI,IAAI;AAC1B,QAAI,MAAM;AACR,UAAI,SAAS,KAAK,QAAQ;AACxB,aAAK,SAAS,KAAK;;AAGrB,UAAI,SAAS,KAAK,QAAQ;AACxB,aAAK,SAAS,KAAK;;AAGrB,UAAI,KAAK,OAAO;AACd,aAAK,MAAM,QAAQ,KAAK;;AAG1B,UAAI,KAAK,OAAO;AACd,aAAK,MAAM,QAAQ,KAAK;;AAG1B,WAAK,IAAI,OAAO;AAChB,WAAK,QAAQ,KAAK,OAAO;AAEzB,aAAO;;AAGT,WAAO;;AAEX,SAAA;;AC/GO,IAAM,kBAAkB,IAAI;;ACFjC,IAAA,kBACE,OAAO,UAAS;AAQlB,IAAM,UAAN,OAKE,MAAK,MADN,QAAA,SAJe,SAAC,YAAoB;AACnC,MAAM,QAAe;AACrB,aAAW,QAAQ,SAAA,MAAI;AAAI,WAAA,MAAM,KAAK;;AACtC,SAAO;IACR;0BAO8B,YAA0B;AACjD,MAAA,cAAgB,WAAU;AAClC,MAAI,OAAO,gBAAgB,YAAY;AACrC,eAAW,cAAc;AACzB;;;ACpBJ,IAAM,eAA2B;AACjC,IAAM,mBAAmB;AAIzB,gBAAgB,WAAgB,iBAAwB;AACtD,MAAI,CAAE,WAAW;AACf,UAAM,IAAI,MAAM,mBAAmB;;;AAWvC,iBAAiB,GAAe,GAAa;AAC3C,MAAM,MAAM,EAAE;AACd,SAEE,MAAM,KAEN,QAAQ,EAAE,UAEV,EAAE,MAAM,OAAO,EAAE,MAAM;;AAI3B,kBAAqB,OAAe;AAClC,UAAQ,MAAM;SACP;AAAG,YAAM,IAAI,MAAM;SACnB;AAAG,aAAO,MAAM;SAChB;AAAG,YAAM,MAAM;;;AAIxB,mBAAsB,OAAe;AACnC,SAAO,MAAM,MAAM;;AAKrB,IAAA,QAAA,WAAA;AAkBE,kBACkB,IAA8B;AAA9B,SAAA,KAAA;AAbF,SAAA,UAAU,IAAI;AACd,SAAA,cAAc,IAAI;AAK3B,SAAA,gBAAsC;AAEtC,SAAA,QAAQ;AACR,SAAA,cAAc;AACL,SAAA,QAAuB;AAwE/B,SAAA,OAA6B;AAnEnC,MAAE,OAAM;;AAGH,SAAA,UAAA,OAAP,WAAA;AACE,QAAI,KAAK,MAAM,WAAW,KAAK,CAAC,aAAa,OAAO;AAClD,qBAAe;AACf,aAAO,KAAK,MAAM;;;AAUf,SAAA,UAAA,YAAP,SAAiB,MAAW;AAC1B,WAAO,CAAE,KAAK,aAAa;AAC3B,mBAAe;AACf,WAAO,aAAa,QAChB,gBAAgB,MAAM,QACtB,SAAS,KAAK;;AAGb,SAAA,UAAA,WAAP,WAAA;AACE,QAAI,KAAK;AAAO;AAChB,SAAK,QAAQ;AACb,SAAK,MAAM,SAAS;AACpB,gBAAY;AAIZ,qBAAiB;;AAGZ,SAAA,UAAA,UAAP,WAAA;AAAA,QAAA,QAAA;AACE,SAAK;AAKL,mBAAe;AAaf,eAAW,MAAM,SAAC,QAAQ,OAAK;AAC7B,aAAO;AACP,kBAAY,QAAQ;;;AAIjB,SAAA,UAAA,SAAP,WAAA;AAIE,SAAK;;AAKA,SAAA,UAAA,WAAP,SAAgB,MAAa;AAC3B,SAAI,IAAI;AACR,QAAI,CAAE,KAAK,MAAM;AACf,WAAK,OAAO,aAAa,SAAS,IAAI;;AAExC,SAAK,KAAK,IAAI;;AAGT,SAAA,UAAA,aAAP,WAAA;AAAA,QAAA,QAAA;AACE,QAAI,KAAK,MAAM;AACb,cAAQ,KAAK,MAAM,QAAQ,SAAA,MAAG;AAAI,eAAA,KAAI,OAAO;;AAC7C,WAAK,KAAK;AACV,mBAAa,KAAK,KAAK;AACvB,WAAK,OAAO;;;AAtGF,SAAA,QAAQ;AAyGxB,SAAA;;AAEA,wBAAwB,OAAe;AACrC,MAAM,SAAS,gBAAgB;AAC/B,MAAI,QAAQ;AACV,UAAM,QAAQ,IAAI;AAElB,QAAI,CAAE,OAAO,YAAY,IAAI,QAAQ;AACnC,aAAO,YAAY,IAAI,OAAO;;AAGhC,QAAI,aAAa,QAAQ;AACvB,uBAAiB,QAAQ;WACpB;AACL,uBAAiB,QAAQ;;AAG3B,WAAO;;;AAIX,yBAAyB,OAAiB,MAAW;AACnD,iBAAe;AAGf,kBAAgB,UAAU,OAAO,mBAAmB,CAAC,OAAO;AAE5D,MAAI,eAAe,OAAO,OAAO;AAG/B,aAAS;;AAGX,SAAO,SAAS,MAAM;;AAGxB,2BAA2B,OAAiB,MAAW;AACrD,QAAM,cAAc;AAEpB,QAAM,MAAM,SAAS;AACrB,MAAI;AAEF,UAAM,MAAM,KAAK,MAAM,GAAG,MAAM,MAAM;WAC/B,GAAP;AAEA,UAAM,MAAM,KAAK;;AAGnB,QAAM,cAAc;;AAGtB,sBAAsB,OAAe;AACnC,SAAO,MAAM,SAAS,CAAC,CAAE,OAAM,iBAAiB,MAAM,cAAc;;AAGtE,kBAAkB,OAAe;AAC/B,QAAM,QAAQ;AAEd,MAAI,aAAa,QAAQ;AAGvB;;AAGF,cAAY;;AAGd,qBAAqB,OAAe;AAClC,aAAW,OAAO;;AAGpB,qBAAqB,OAAe;AAClC,aAAW,OAAO;;AAGpB,oBACE,OACA,UAAoD;AAEpD,MAAM,cAAc,MAAM,QAAQ;AAClC,MAAI,aAAa;AACf,QAAM,UAAU,QAAQ,MAAM;AAC9B,aAAS,IAAI,GAAG,IAAI,aAAa,EAAE,GAAG;AACpC,eAAS,QAAQ,IAAI;;;;AAM3B,0BAA0B,QAAkB,OAAe;AAGzD,SAAO,OAAO,YAAY,IAAI;AAC9B,SAAO,aAAa;AACpB,MAAM,iBAAiB,CAAC,aAAa;AAErC,MAAI,CAAE,OAAO,eAAe;AAC1B,WAAO,gBAAgB,aAAa,SAAS,IAAI;aAExC,OAAO,cAAc,IAAI,QAAQ;AAI1C;;AAGF,SAAO,cAAc,IAAI;AAIzB,MAAI,gBAAgB;AAClB,gBAAY;;;AAKhB,0BAA0B,QAAkB,OAAe;AAGzD,SAAO,OAAO,YAAY,IAAI;AAC9B,SAAO,CAAE,aAAa;AAEtB,MAAM,aAAa,OAAO,YAAY,IAAI;AAC1C,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,YAAY,IAAI,OAAO,UAAU,MAAM;aACrC,CAAE,QAAQ,YAAY,MAAM,QAAQ;AAC7C,WAAO;;AAGT,mBAAiB,QAAQ;AAEzB,MAAI,aAAa,SAAS;AACxB;;AAGF,cAAY;;AAGd,0BAA0B,QAAkB,OAAe;AACzD,MAAM,KAAK,OAAO;AAClB,MAAI,IAAI;AACN,OAAG,OAAO;AACV,QAAI,GAAG,SAAS,GAAG;AACjB,UAAI,aAAa,SAAS,kBAAkB;AAC1C,qBAAa,KAAK;;AAEpB,aAAO,gBAAgB;;;;AAO7B,wBAAwB,QAAgB;AACtC,MAAI,OAAO,YAAY,OAAO,GAAG;AAC/B,WAAO,YAAY,QAAQ,SAAC,QAAQ,OAAK;AACvC,kBAAY,QAAQ;;;AAMxB,SAAO;AAIP,SAAO,OAAO,kBAAkB;;AAGlC,qBAAqB,QAAkB,OAAe;AACpD,QAAM,QAAQ,OAAO;AACrB,SAAO,YAAY,OAAO;AAC1B,mBAAiB,QAAQ;;AAG3B,wBAAwB,OAAiB,MAAW;AAClD,MAAI,OAAO,MAAM,cAAc,YAAY;AACzC,QAAI;AACF,uBAAiB;AACjB,YAAM,cAAc,MAAM,UAAU,MAAM,MAAM;aACzC,GAAP;AAKA,YAAM;AACN,aAAO;;;AAMX,SAAO;;ACrVT,IAAM,eAAe;EACnB,UAAU;EACV,SAAS;EACT,QAAQ;;aAYgB,SAEzB;AACC,MAAM,YAAY,IAAI;AACtB,MAAM,YAAY,WAAW,QAAQ;AAErC,kBAAgB,KAAS;AACvB,QAAM,SAAS,gBAAgB;AAC/B,QAAI,QAAQ;AACV,UAAI,QAAM,UAAU,IAAI;AACxB,UAAI,CAAC,OAAK;AACR,kBAAU,IAAI,KAAK,QAAM,IAAI;;AAE/B,aAAO,SAAS;AAChB,UAAI,OAAO,cAAc,YAAY;AACnC,yBAAiB;AACjB,cAAI,cAAc,UAAU;;;;AAKlC,SAAO,QAAQ,eACb,KACA,iBAAiC;AAEjC,QAAM,OAAM,UAAU,IAAI;AAC1B,QAAI,MAAK;AACP,UAAM,MACJ,mBACA,gBAAe,KAAK,cAAc,mBAChC,kBAAkB;AAItB,cAAQ,MAAK,QAAQ,SAAA,OAAK;AAAI,eAAA,MAAM;;AACpC,gBAAU,OAAO;AACjB,uBAAiB;;;AAIrB,SAAO;;ACpCT,2CAAwC;AAItC,MAAM,UAAU,IAAI,KAAgB,OAAO,YAAY;AACvD,SAAO,WAAA;AACL,WAAO,QAAQ,YAAY;;;IAWlB,sBAAsB;AAoEnC,IAAM,SAAS,IAAI;eAQjB,kBACA,SAAqE;AAArE,MAAA,YAAA,QAAA;AAAA,cAAkD,OAAO,OAAO;;AAEhE,MAAM,QAAQ,IAAI,MAChB,QAAQ,OAAO,KAAK,IAAI,GAAG,KAC3B,SAAA,OAAK;AAAI,WAAA,MAAM;;AAGjB,MAAM,UAAU,QAAQ;AACxB,MAAM,eAAe,QAAQ,gBAC3B;AAEF,MAAM,aAAa,WAAA;AACjB,QAAM,MAAM,aAAa,MACvB,MACA,UAAU,QAAQ,MAAM,MAAM,aAAoB;AAGpD,QAAI,QAAQ,QAAQ;AAClB,aAAO,iBAAiB,MAAM,MAAM;;AAGtC,QAAI,QAAQ,MAAM,IAAI;AACtB,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,KAAK,QAAQ,IAAI,MAAM;AACjC,YAAM,YAAY,QAAQ;AAG1B,YAAM,SAAS,WAAA;AAAM,eAAA,MAAM,OAAO;;;AAGpC,QAAM,QAAQ,MAAM,UAClB,MAAM,UAAU,MAAM,KAAK;AAK7B,UAAM,IAAI,KAAK;AAEf,WAAO,IAAI;AAKX,QAAI,CAAE,gBAAgB,YAAY;AAChC,aAAO,QAAQ,SAAA,QAAK;AAAI,eAAA,OAAM;;AAC9B,aAAO;;AAGT,WAAO;;AAGT,SAAO,eAAe,YAAY,QAAQ;IACxC,KAAG,WAAA;AACD,aAAO,MAAM,OAAO;;IAEtB,cAAc;IACd,YAAY;;AAGd,oBAAkB,KAAc;AAC9B,QAAM,QAAQ,MAAM,IAAI;AACxB,QAAI,OAAO;AACT,YAAM;;;AAGV,aAAW,WAAW;AACtB,aAAW,QAAQ,iBAAc;AAC/B,aAAS,aAAa,MAAM,MAAM;;AAGpC,mBAAiB,KAAc;AAC7B,QAAM,QAAQ,MAAM,IAAI;AACxB,QAAI,OAAO;AACT,aAAO,MAAM;;;AAGjB,aAAW,UAAU;AACrB,aAAW,OAAO,gBAAa;AAC7B,WAAO,QAAQ,aAAa,MAAM,MAAM;;AAG1C,qBAAmB,KAAc;AAC/B,WAAO,MAAM,OAAO;;AAEtB,aAAW,YAAY;AACvB,aAAW,SAAS,kBAAe;AACjC,WAAO,UAAU,aAAa,MAAM,MAAM;;AAG5C,aAAW,eAAe;AAC1B,aAAW,SAAS,UAAU,kBAAe;AAC3C,WAAO,aAAa,MAAM,MAAM,QAAQ,MAAM,MAAM;MAClD;AAEJ,SAAO,OAAO,OAAO;;;;ACxMvB,IAAA,cAAA,WAAA;AAAA,0BAAA;AA2GU,SAAA,iBAAiB,MAAK;;AApDvB,eAAA,UAAA,8BAAP,SACE,aACA,cAAoB;AAEpB,SAAK,mBAAmB,aAAa;;AAKhC,eAAA,UAAA,oBAAP,SAAyB,UAAsB;AAC7C,WAAO;;AAGF,eAAA,UAAA,WAAP,SAAgB,QAA+B;AAC7C;;AAGK,eAAA,UAAA,KAAP,WAAA;AACE,WAAO;;AAGF,eAAA,UAAA,SAAP,SAAc,SAA4B;AACxC,WAAO;;AAKF,eAAA,UAAA,mBAAP,SAAwB,UAAsB;AAC5C,WAAO;;AASF,eAAA,UAAA,YAAP,SACE,SACA,YAAiC;AAAjC,QAAA,eAAA,QAAA;AAAA,mBAAA,CAAc,CAAC,QAAQ;;AAEvB,WAAO,KAAK,KAAK;MACf,QAAQ,QAAQ,MAAM;MACtB,OAAO,QAAQ;MACf,WAAW,QAAQ;MACnB,mBAAmB,QAAQ;MAC3B;;;AAQG,eAAA,UAAA,eAAP,SACE,SACA,YAAiC;AAAjC,QAAA,eAAA,QAAA;AAAA,mBAAA,CAAc,CAAC,QAAQ;;AAEvB,WAAO,KAAK,KAAK;MACf,OAAO,KAAK,eAAe,QAAQ,UAAU,QAAQ;MACrD,WAAW,QAAQ;MACnB,QAAQ,QAAQ;MAChB,mBAAmB,QAAQ;MAC3B;;;AAIG,eAAA,UAAA,aAAP,SACE,SAAmD;AAEnD,WAAO,KAAK,MAAM;MAChB,QAAQ,QAAQ,MAAM;MACtB,QAAQ,QAAQ;MAChB,OAAO,QAAQ;MACf,WAAW,QAAQ;MACnB,WAAW,QAAQ;;;AAIhB,eAAA,UAAA,gBAAP,SACE,SAAsD;AAEtD,WAAO,KAAK,MAAM;MAChB,QAAQ,QAAQ;MAChB,QAAQ,QAAQ;MAChB,WAAW,QAAQ;MACnB,OAAO,KAAK,eAAe,QAAQ,UAAU,QAAQ;MACrD,WAAW,QAAQ;;;AAGzB,SAAA;;;;AC3JM,IAAW;AAAjB,AAAA,UAAiB,QAAK;GAAL,UAAA,UAAK;;;ACiBtB,IAAA,oBAAA,WAAA;AACE,8BACkB,SACA,MACA,OACA,YACA,WAA+B;AAJ/B,SAAA,UAAA;AACA,SAAA,OAAA;AACA,SAAA,QAAA;AACA,SAAA,aAAA;AACA,SAAA,YAAA;;AAEpB,SAAA;;;;ACdO,IAAM,SAAS,OAAO,UAAU;AAEjC,oCACJ,OACA,mBAA0C;AAE1C,SAAO,YAAY,qBACf,MAAM,IAAI,kBAAkB,OAAO,gBACnC,qBAAqB,kBAAkB;;AAGtC,IAAM,wBAAwB;AAE/B,gCAAiC,gBAAsB;AAC3D,MAAM,QAAQ,eAAe,MAAM;AACnC,SAAO,QAAQ,MAAM,KAAK;;AAGtB,mCACJ,cACA,SACA,WAA+B;AAE/B,MAAI,WAAU,OAAO,YAAW,UAAU;AACxC,WAAO,MAAM,QAAQ,WACjB,QAAO,MAAM,SAAA,MAAI;AAAI,aAAA,0BAA0B,cAAc,MAAM;SACnE,aAAa,WAAW,MAAM,SAAA,OAAK;AACnC,UAAI,QAAQ,UAAU,cAAc,OAAO,YAAY;AACrD,YAAM,MAAM,uBAAuB;AACnC,eAAO,OAAO,KAAK,SAAQ,QACxB,EAAC,MAAM,gBACP,0BAA0B,MAAM,cAAc,QAAO,MAAM;;AAOhE,aAAO;;;AAGb,SAAO;;AAGH,iCACJ,OAAiB;AAEjB,SAAO,UAAU,QACf,OAAO,UAAU,YACjB,CAAC,YAAY,UACb,CAAC,MAAM,QAAQ;;AAGb,qCAAmC;AACvC,SAAO,IAAI;;;;AC1Cb,IAAM,SAAc,OAAO,OAAO;AAClC,IAAM,cAA6B,WAAA;AAAM,SAAA;;AACzC,IAAM,aAAkB,OAAO,OAAO;AAEtC,IAAA,cAAA,WAAA;AAGE,wBACkB,UACA,OAAiB;AAFnC,QAAA,QAAA;AACkB,SAAA,WAAA;AACA,SAAA,QAAA;AAJR,SAAA,OAA8B,OAAO,OAAO;AA2R9C,SAAA,UAEJ,OAAO,OAAO;AA0DV,SAAA,OAEJ,OAAO,OAAO;AA+BX,SAAA,gBAAgB,SACrB,mBACA,gBAAsB;AACnB,aAAA,gBACH,YAAY,qBACR,MAAK,IAAI,kBAAkB,OAAO,kBAClC,qBAAqB,kBAAkB;;AAMtC,SAAA,UAA2B,SAAA,UAAQ;AACxC,aAAO,YAAY,YACf,MAAK,IAAI,SAAS,SAClB,OAAO,aAAa;;AAOnB,SAAA,cAAmC,SACxC,cACA,gBAAc;AAEd,UAAI,OAAO,iBAAiB,UAAU;AACpC,eAAO,cAAc;;AAGvB,UAAI,YAAY,eAAe;AAC7B,eAAO;;AAGF,UAAA,KAAM,MAAK,SAAS,SAAS,cAAa;AAEjD,UAAI,IAAI;AACN,YAAM,MAAM,cAAc;AAC1B,YAAI,gBAAgB;AAClB,gBAAK,MAAM,IAAI;;AAEjB,eAAO;;;;AA/YJ,eAAA,UAAA,WAAP,WAAA;AACE,WAAA,SAAA,IAAY,KAAK;;AAGZ,eAAA,UAAA,MAAP,SAAW,QAAc;AACvB,WAAO,KAAK,OAAO,QAAQ,UAAU;;AAGhC,eAAA,UAAA,MAAP,SAAW,QAAgB,WAAiB;AAC1C,SAAK,MAAM,OAAO,QAAQ;AAC1B,QAAI,OAAO,KAAK,KAAK,MAAM,SAAS;AAClC,UAAM,cAAc,KAAK,KAAK;AAC9B,UAAI,eAAe,OAAO,KAAK,aAAa,YAAY;AACtD,eAAO,YAAY;;;AAGvB,QAAI,cAAc,gBACd,OAAO,KAAK,KAAK,SAAS,mBAAmB,SAAS;AACxD,aAAO,KAAK,SAAS,kBAAkB;;AAEzC,QAAI,gBAAgB,OAAO;AACzB,aAAO,KAAK,OAAO,IAAI,QAAQ;;;AAIzB,eAAA,UAAA,SAAV,SAAiB,QAAgB,mBAA2B;AAM1D,QAAI;AAAmB,WAAK,MAAM,OAAO,QAAQ;AAEjD,QAAI,OAAO,KAAK,KAAK,MAAM,SAAS;AAClC,aAAO,KAAK,KAAK;;AAGnB,QAAI,gBAAgB,OAAO;AACzB,aAAO,KAAK,OAAO,OAAO,QAAQ;;AAGpC,QAAI,KAAK,SAAS,kBAAkB,SAAS;AAC3C,aAAO,OAAO,OAAO;;;AAIlB,eAAA,UAAA,QAAP,SAAa,QAAgB,UAAqB;AAAlD,QAAA,QAAA;AACE,QAAM,WAAW,KAAK,OAAO;AAC7B,QAAM,SACJ,IAAI,WAAW,uBAAuB,MAAM,UAAU;AAGxD,SAAK,KAAK,UAAU;AACpB,QAAI,WAAW,UAAU;AACvB,aAAO,KAAK,KAAK;AACjB,UAAI,KAAK,MAAM,SAAS;AACtB,YAAM,kBAAmC,OAAO,OAAO;AAKvD,YAAI,CAAC;AAAU,0BAAc,WAAW;AAIxC,eAAO,KAAK,UAAU,QAAQ,SAAA,gBAAc;AAC1C,cAAI,CAAC,YAAY,SAAS,oBAAoB,OAAO,iBAAiB;AAGpE,4BAAc,kBAAkB;AAShC,gBAAM,YAAY,uBAAuB;AACzC,gBAAI,cAAc,kBACd,CAAC,MAAK,SAAS,WAAW,OAAO,YAAY,YAAY;AAC3D,8BAAc,aAAa;;AAM7B,gBAAI,OAAO,oBAAoB,UAAU,CAAE,kBAAgB,QAAQ;AACjE,qBAAO,OAAO;;;;AAKpB,eAAO,KAAK,iBAAe,QACzB,SAAA,WAAS;AAAI,iBAAA,MAAK,MAAM,MAAM,QAAQ;;;;;AAKvC,eAAA,UAAA,SAAP,SACE,QACA,QAAiC;AAFnC,QAAA,QAAA;AAIE,QAAM,cAAc,KAAK,OAAO;AAEhC,QAAI,aAAa;AACf,UAAM,kBAAqC,OAAO,OAAO;AACzD,UAAI,gBAAc;AAClB,UAAI,eAAa;AAEjB,UAAM,kBAAgB;QACpB;QACA;QACA;QACA,aAAa,KAAK;QAClB,SAAS,KAAK;QACd,WAAW,SACT,oBACA,OAA8B;AAC3B,iBAAA,MAAK,SAAS,UACjB,OAAO,uBAAuB,WAAW;YACvC,WAAW;YACX,MAAM,SAAQ,cAAc;cAC1B,oBACJ,EAAE,OAAO;;;AAIb,aAAO,KAAK,aAAa,QAAQ,SAAA,gBAAc;AAC7C,YAAM,YAAY,uBAAuB;AACzC,YAAI,aAAa,YAAY;AAC7B,YAAI,eAAe;AAAQ;AAC3B,YAAM,SAA+B,OAAO,WAAW,aACnD,SACA,OAAO,mBAAmB,OAAO;AACrC,YAAI,QAAQ;AACV,cAAI,WAAW,WAAW,cAAc,SACtC,OAAO,gBAAgB,aAAW,SAAA,SAAA,IAC7B,kBAAa;YAChB;YACA;YACA,SAAS,MAAK,WAAW,QAAQ;;AAErC,cAAI,aAAa,YAAY;AAC3B,kBAAK,MAAM,MAAM,QAAQ;iBACpB;AACL,gBAAI,aAAa;AAAQ,yBAAW;AACpC,gBAAI,aAAa,YAAY;AAC3B,8BAAc,kBAAkB;AAChC,8BAAc;AACd,2BAAa;;;;AAInB,YAAI,eAAe,QAAQ;AACzB,yBAAa;;;AAIjB,UAAI,eAAa;AACf,aAAK,MAAM,QAAQ;AAEnB,YAAI,cAAY;AACd,cAAI,gBAAgB,OAAO;AACzB,iBAAK,KAAK,UAAU;iBACf;AACL,mBAAO,KAAK,KAAK;;AAEnB,eAAK,MAAM,MAAM,QAAQ;;AAG3B,eAAO;;;AAIX,WAAO;;AASF,eAAA,UAAA,SAAP,SACE,QACA,WACA,MAA0B;;AAE1B,QAAM,cAAc,KAAK,OAAO;AAChC,QAAI,aAAa;AACf,UAAM,WAAW,KAAK,cAAsB,aAAa;AACzD,UAAM,iBAAiB,aAAa,OAChC,KAAK,SAAS,kBAAkB,EAAE,UAAU,WAAW,UACvD;AACJ,aAAO,KAAK,OAAO,QAAQ,iBAAgB,OAAA,IACzC,IAAC,kBAAiB,oBAChB;;AAEN,WAAO;;AAGF,eAAA,UAAA,QAAP,SAAa,SAA2B;AACtC,QAAI,UAAU;AACd,QAAI,QAAQ,IAAI;AACd,UAAI,OAAO,KAAK,KAAK,MAAM,QAAQ,KAAK;AACtC,kBAAU,KAAK,OAAO,QAAQ,IAAI,QAAQ,WAAW,QAAQ;;AAE/D,UAAI,gBAAgB,OAAO;AACzB,kBAAU,KAAK,OAAO,MAAM,YAAY;;AAM1C,UAAI,QAAQ,aAAa,SAAS;AAChC,aAAK,MAAM,MAAM,QAAQ,IAAI,QAAQ,aAAa;;;AAGtD,WAAO;;AAGF,eAAA,UAAA,QAAP,WAAA;AACE,SAAK,QAAQ;;AAGR,eAAA,UAAA,UAAP,WAAA;AAAA,QAAA,QAAA;AACE,QAAM,MAAM,KAAK;AACjB,QAAM,eAAyB;AAC/B,SAAK,eAAe,QAAQ,SAAA,IAAE;AAC5B,UAAI,CAAC,OAAO,KAAK,MAAK,SAAS,mBAAmB,KAAK;AACrD,qBAAa,KAAK;;;AAGtB,QAAI,aAAa,QAAQ;AACvB,UAAI,SAAS,EAAE,cAAc,aAAa;;AAE5C,WAAO;;AAGF,eAAA,UAAA,UAAP,SAAe,SAAqC;AAApD,QAAA,QAAA;AACE,WAAO,KAAK,KAAK,MAAM,QAAQ,SAAA,QAAM;AACnC,UAAI,CAAE,YAAW,OAAO,KAAK,SAAS,UAAU;AAC9C,cAAK,OAAO;;;AAGhB,QAAI,SAAS;AACH,UAAA,SAAoB,QAAO,QAAhB,SAAI,OAAK,SAAtB,CAAA;AACN,aAAO,KAAK,QAAM,QAAQ,SAAA,QAAM;AAC9B,cAAK,MAAM,QAAQ,OAAK;;AAE1B,UAAI,QAAQ;AACV,eAAO,aAAa,QAAQ,KAAK,QAAQ;;;;AAiBxC,eAAA,UAAA,SAAP,SAAc,QAAc;AAC1B,WAAO,KAAK,QAAQ,UAAW,MAAK,QAAQ,WAAW,KAAK;;AAGvD,eAAA,UAAA,UAAP,SAAe,QAAc;AAC3B,QAAI,KAAK,QAAQ,UAAU,GAAG;AAC5B,UAAM,QAAQ,EAAE,KAAK,QAAQ;AAC7B,UAAI,CAAC;AAAO,eAAO,KAAK,QAAQ;AAChC,aAAO;;AAET,WAAO;;AAKF,eAAA,UAAA,eAAP,SAAoB,KAAuB;AAAvB,QAAA,QAAA,QAAA;AAAA,YAAA,IAAU;;AAC5B,WAAO,KAAK,KAAK,SAAS,QAAQ,IAAI,KAAK;AAC3C,QAAI,gBAAgB,OAAO;AACzB,WAAK,OAAO,aAAa;WACpB;AAIL,aAAO,KAAK,KAAK,SAAS,mBAAmB,QAAQ,IAAI,KAAK;;AAEhE,WAAO;;AAOF,eAAA,UAAA,KAAP,WAAA;AAAA,QAAA,QAAA;AACE,QAAM,MAAM,KAAK;AACjB,QAAM,WAAW,KAAK;AACtB,QAAI,QAAQ,SAAA,IAAE;AACZ,UAAI,OAAO,KAAK,UAAU,KAAK;AAI7B,eAAO,KAAK,MAAK,gBAAgB,KAAK,QAAQ,IAAI,KAAK;AAGvD,eAAO,SAAS;;;AAGpB,QAAM,cAAc,OAAO,KAAK;AAChC,QAAI,YAAY,QAAQ;AACtB,UAAI,SAAoB;AACxB,aAAO,kBAAgB;AAAO,iBAAO,OAAK;AAC1C,kBAAY,QAAQ,SAAA,IAAE;AAAI,eAAA,OAAK,OAAO;;;AAExC,WAAO;;AAQF,eAAA,UAAA,kBAAP,SAAuB,QAAc;AACnC,QAAI,CAAC,OAAO,KAAK,KAAK,MAAM,SAAS;AACnC,UAAM,UAAQ,KAAK,KAAK,UAAU,OAAO,OAAO;AAChD,UAAM,YAAU,IAAI,IAAI,CAAC,KAAK,KAAK;AAGnC,UAAM,gBAAc,SAAC,KAAQ;AAAK,eAAA,QAAQ,QAAQ,OAAO,QAAQ;;AACjE,gBAAQ,QAAQ,SAAA,KAAG;AACjB,YAAI,YAAY,MAAM;AACpB,kBAAM,IAAI,SAAS;mBACV,cAAY,MAAM;AAC3B,iBAAO,OAAO,KAGX,OAAO,eACP,QAAQ,UAAQ,KAAK;;;;AAI9B,WAAO,KAAK,KAAK;;AAIZ,eAAA,UAAA,eAAP,WAAA;AAAoB,QAAA,OAAA;aAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAAc;AAAd,WAAA,MAAA,UAAA;;AAClB,WAAO,KAAK,MAAM,SAAS,YAAY;;AAiD3C,SAAA;;AAiBA,IAAA,aAAA,WAAA;AAGE,uBAA4B,SAAgB;AAAhB,SAAA,UAAA;AAFpB,SAAA,IAAiD;AA6BzC,SAAA,WAAW,IAAI,KAAgB;AA1B7C,SAAK,IAAI,UAAU,QAAgB;;AAG9B,cAAA,UAAA,SAAP,SAAc,QAAgB,gBAAsB;AAClD,QAAI,KAAK,GAAG;AACV,WAAK,EAAE,WAAW,QAAQ;AAC1B,UAAM,YAAY,uBAAuB;AACzC,UAAI,cAAc,gBAAgB;AAMhC,aAAK,EAAE,WAAW,QAAQ;;;;AAKzB,cAAA,UAAA,QAAP,SAAa,QAAgB,gBAAsB;AACjD,QAAI,KAAK,GAAG;AACV,WAAK,EAAE,MAAM,WAAW,QAAQ;;;AAOtC,SAAA;;AAEA,oBAAoB,QAAgB,gBAAsB;AAIxD,SAAO,iBAAiB,MAAM;;AAGhC,AAAA,UAAiB,cAAW;AAE1B,MAAA,OAAA,SAAA,QAAA;AAA0B,cAAA,OAAA;AAQxB,mBAAY,KAQX;UAPC,WAAQ,IAAA,UACR,KAAA,IAAA,eAAA,gBAAa,OAAA,SAAG,OAAI,IACpB,OAAI,IAAA;AAHN,UAAA,QASE,OAAA,KAAA,MAAM,UAAU,IAAI,WAAW,mBAAe;AAkBhC,YAAA,cAAc,IAAI,KAAqB;AAjBrD,YAAK,mBAAmB,IAAI,WAAW;AACvC,UAAI;AAAM,cAAK,QAAQ;;;AAGlB,UAAA,UAAA,WAAP,SACE,SACA,QAAmC;AAGnC,aAAO,IAAI,MAAM,SAAS,MAAM,QAAQ,KAAK;;AAGxC,UAAA,UAAA,cAAP,WAAA;AAEE,aAAO;;AAIF,UAAA,UAAA,aAAP,WAAA;AACE,aAAO,KAAK,YAAY,YAAY;;AAExC,WAAA;IAvC0B;AAAb,eAAA,OAAI;GAFF,eAAA,eAAW;AA8C5B,IAAA,QAAA,SAAA,QAAA;AAAoB,YAAA,QAAA;AAClB,kBACkB,IACA,QACA,QACA,OAAiB;AAJnC,QAAA,QAME,OAAA,KAAA,MAAM,OAAO,UAAU,UAAM;AALb,UAAA,KAAA;AACA,UAAA,SAAA;AACA,UAAA,SAAA;AACA,UAAA,QAAA;AAGhB,WAAO;;;AAGF,SAAA,UAAA,WAAP,SACE,SACA,QAAmC;AAEnC,WAAO,IAAI,OAAM,SAAS,MAAM,QAAQ,KAAK;;AAGxC,SAAA,UAAA,cAAP,SAAmB,SAAe;AAAlC,QAAA,QAAA;AAEE,QAAM,SAAS,KAAK,OAAO,YAAY;AAEvC,QAAI,YAAY,KAAK,IAAI;AAEvB,UAAI,KAAK,MAAM,SAAS;AACtB,eAAO,KAAK,KAAK,MAAM,QAAQ,SAAA,QAAM;AAKnC,cAAI,MAAK,KAAK,YAAa,OAAiB,OAAO,SAAS;AAC1D,kBAAK,OAAO;;;;AAIlB,aAAO;;AAIT,QAAI,WAAW,KAAK;AAAQ,aAAO;AAGnC,WAAO,OAAO,SAAS,KAAK,IAAI,KAAK;;AAGhC,SAAA,UAAA,WAAP,WAAA;AACE,WAAA,SAAA,SAAA,IACK,KAAK,OAAO,aACZ,KAAK;;AAIL,SAAA,UAAA,kBAAP,SAAuB,QAAc;AACnC,QAAM,aAAa,KAAK,OAAO,gBAAgB;AAC/C,WAAO,OAAO,KAAK,KAAK,MAAM,UAAS,SAAA,SAAA,IAClC,aACA,OAAA,UAAM,gBAAe,KAAA,MAAC,WACvB;;AAGC,SAAA,UAAA,aAAP,WAAA;AACE,QAAI,IAAiB,KAAK;AAC1B,WAAQ,EAAY;AAAQ,UAAK,EAAY;AAC7C,WAAO,EAAE,WAAW,MAAM,GAAG;;AAEjC,SAAA;EAjEoB;AAmEpB,+BACE,gBACA,gBACA,UAAgB;AAEhB,MAAM,gBAAgB,eAAe;AACrC,MAAM,gBAAgB,eAAe;AAMrC,SAAO,MAAM,eAAe,iBAAiB,gBAAgB;;AAGzD,+BAAgC,OAAU;AAE9C,SAAO,CAAC,CAAE,kBAAiB,eAAe,MAAM,MAAM;;;;ACxkBxD,8BACE,KACA,SAAoB;AAEpB,SAAO,IAAI,kBACT,IAAI,SACJ,QAAQ,KAAK,SACb,QAAQ,OACR,QAAQ,YACR,QAAQ;;AAqBZ,IAAA,cAAA,WAAA;AACE,wBAAoB,QAAyB;AAA7C,QAAA,QAAA;AAAoB,SAAA,SAAA;AAsEZ,SAAA,sBAKJ,MAAK,SAAA,SAAO;AAAI,aAAA,MAAK,qBAAqB;OAAU;MACtD,SAAO,SAAC,SAAO;AACb,eAAO;UACL,QAAQ;UACR,QAAQ;UACR,QAAQ;;;MAKZ,cAAY,SAAC,cAAc,QAAQ,SAAO;AACxC,YAAI,sBAAsB,QAAQ,QAAQ;AACxC,iBAAO,QAAQ,MAAM,aACnB,cACA,YAAY,UAAU,OAAO,QAAQ,QACrC,QAAQ;;;;AAoKR,SAAA,eAAe,IAAI;AAGnB,SAAA,0BAA0B,MAAK,SAAC,SAAoC;AAC1E,aAAO,MAAK,yBAAyB;OACpC;MACD,cAAY,SAAC,KAAyB;YAAvB,QAAK,IAAA,OAAE,QAAK,IAAA,OAAE,UAAO,IAAA;AAClC,YAAI,sBAAsB,QAAQ,QAAQ;AACxC,iBAAO,QAAQ,MAAM,aACnB,OACA,OACA,QAAQ;;;;AAxQd,SAAK,SAAM,SAAA,EAAK,aAAa,QAAS;;AAUjC,eAAA,UAAA,wBAAP,SAAgC,KAMD;QAL7B,QAAK,IAAA,OACL,QAAK,IAAA,OACL,KAAA,IAAA,QAAA,SAAM,OAAA,SAAG,eAAY,IACrB,YAAS,IAAA,WACT,KAAA,IAAA,mBAAA,oBAAiB,OAAA,SAAG,OAAI;AAExB,QAAM,WAAW,KAAK,OAAO,MAAM;AAEnC,gBAAS,SAAA,SAAA,IACJ,iBAAiB,mBAAmB,UACpC;AAGL,QAAM,aAAa,KAAK,oBAAoB;MAC1C,cAAc,kBAAkB,OAAO;MACvC,mBAAmB,cAAc;MACjC,SAAS;QACP;QACA;QACA;QACA;QACA,WAAW,KAAK,UAAU;QAC1B,aAAa,kBAAkB,uBAAuB;QACtD,MAAM;QACN,YAAY;;;AAIhB,QAAM,mBACJ,WAAW,WAAW,WAAW,QAAQ,SAAS;AACpD,QAAI,oBAAoB,CAAC,mBAAmB;AAC1C,YAAM,WAAW,QAAS;;AAG5B,WAAO;MACL,QAAQ,WAAW;MACnB,SAAS,WAAW;MACpB,UAAU,CAAC;;;AAIR,eAAA,UAAA,UAAP,SACE,SACA,QACA,cACA,SAA+B;AAE/B,QAAI,sBAAsB,QAAQ,UAC9B,KAAK,aAAa,IAAI,aAAY,cAAc;AAClD,UAAM,SAAS,KAAK,oBAAoB,KAAK,cAAc,QAAQ;AACnE,UAAI,UAAU,YAAW,OAAO,QAAQ;AACtC,eAAO;;;AAGX,WAAO;;AA+BD,eAAA,UAAA,uBAAR,SAA6B,KAIH;AAJ1B,QAAA,QAAA;QACE,eAAY,IAAA,cACZ,oBAAiB,IAAA,mBACjB,UAAO,IAAA;AAEP,QAAI,YAAY,sBACZ,CAAC,QAAQ,SAAS,kBAAkB,kBAAkB,UACtD,CAAC,QAAQ,MAAM,IAAI,kBAAkB,QAAQ;AAC/C,aAAO;QACL,QAAQ;QACR,SAAS,CAAC,qBACR,QACE,IAAA,eAAiC,KAAA,IAAA,eAAuB,mCAG1D,kBAAA,QAAA,YAAA;;;AAIE,QAAA,YAA+B,QAAO,WAA3B,WAAoB,QAAO,UAAjB,QAAU,QAAO;AAC9C,QAAM,iBAA2C;AACjD,QAAM,cAA0B,EAAE,QAAQ;AAC1C,QAAM,WAAW,MAAM,cAAsB,mBAAmB;AAEhE,QAAI,KAAK,OAAO,eACZ,OAAO,aAAa,YACpB,CAAC,SAAS,kBAAkB,WAAW;AAIzC,qBAAe,KAAK,EAAE,YAAY;;AAGpC,0BAAmB;AACjB,aAAO,YAAY,WAAY,aAAY,UAAU;;AAGvD,2BAA0B,SAAqB;;AAC7C,UAAI,QAAO;AAAS,QAAA,OAAA,cAAa,KAAI,MAAA,KAAI,QAAO;AAChD,aAAO,QAAO;;AAGhB,QAAM,UAAU,IAAI,IAAI,aAAa;AAErC,YAAQ,QAAQ,SAAA,WAAS;;AAGvB,UAAI,CAAC,cAAc,WAAW;AAAY;AAE1C,UAAI,QAAQ,YAAY;AACtB,YAAI,aAAa,SAAS,UAAU;UAClC,WAAW,UAAU,KAAK;UAC1B,OAAO;UACP,WAAW,QAAQ;UACnB,MAAM;WACL;AAEH,YAAM,aAAa,uBAAuB;AAC1C,gBAAQ,KAAK,KAAK;AAKlB,YAAM,gBAAgB,QAAQ;AAG9B,gBAAQ,aAAa,iBAAiB,CAAC,CAIrC,WAAU,cACV,UAAU,WAAW,KAAK,SAAA,GAAC;AAAI,iBAAA,EAAE,KAAK,UAAU;;AAGlD,YAAI,eAAe,QAAQ;AACzB,cAAI,CAAC,sBAAsB,MAAM,YAAY;AAC3C,yBAAa,KACX,qBACE,QAAmB,IACjB,eAAe,KAAK,IAAA,eAEpB,uBAA8B,UAAA,KAAA,QAAA,UAAA,aAAA,qBAC1B,kBAAkB,QAAQ,YAC1B,YAAY,KAAK,UAAU,mBAAmB,MAAM,MAE1D;;mBAKG,MAAM,QAAQ,aAAa;AACpC,uBAAa,cAAc,MAAK,wBAAwB;YACtD,OAAO;YACP,OAAO;YACP;;mBAGO,CAAC,UAAU,cAAc;AAKlC,cAAI,MAAuC;AACzC,yCACE,QAAQ,OACR,WACA;AAEF,4BAAgB;;mBAGT,cAAc,MAAM;AAI7B,uBAAa,cAAc,MAAK,oBAAoB;YAClD,cAAc,UAAU;YACxB,mBAAmB;YACnB;;;AAIJ,YAAI,eAAe,QAAQ;AACzB,yBAAe,KAAI,OAAA,IAAG,IAAC,cAAa,YAAU;;AAGhD,gBAAQ,aAAa;AAErB,kBAAU,QAAQ,KAAK,UAAU;aAE5B;AACL,YAAM,WAAW,yBACf,WACA,QAAQ;AAGV,YAAI,YAAY,SAAS,gBAAgB,UAAU,WAAW;AAC5D,mBAAS,aAAa,WAAW,QAAQ,QAAQ,KAAK;;;;AAO5D,gBAAY,SAAS,eAAe;AAEpC,QAAI,MAAuC;AACzC,aAAO,OAAO,YAAY;;AAK5B,SAAK,aAAa,IAAI,YAAY,QAAQ;AAE1C,WAAO;;AAqBD,eAAA,UAAA,2BAAR,SAAiC,KAIH;AAJ9B,QAAA,QAAA;QACE,QAAK,IAAA,OACL,QAAK,IAAA,OACL,UAAO,IAAA;AAEP,QAAI;AAEJ,2BAA0B,aAA4B,GAAS;AAC7D,UAAI,YAAY,SAAS;AACvB,kBAAU,WAAW;AACrB,gBAAQ,KAAI,MAAZ,SAAgB,YAAY;;AAG9B,gBAAU,QAAQ,KAAK,UAAU;AAEjC,aAAO,YAAY;;AAGrB,QAAI,MAAM,cAAc;AACtB,cAAQ,MAAM,OAAO,QAAQ,MAAM;;AAGrC,YAAQ,MAAM,IAAI,SAAC,MAAM,GAAC;AAExB,UAAI,SAAS,MAAM;AACjB,eAAO;;AAGT,cAAQ,KAAK,KAAK;AAGlB,UAAI,MAAM,QAAQ,OAAO;AACvB,eAAO,cAAc,MAAK,wBAAwB;UAChD;UACA,OAAO;UACP;YACE;;AAIN,UAAI,MAAM,cAAc;AACtB,eAAO,cAAc,MAAK,oBAAoB;UAC5C,cAAc,MAAM;UACpB,mBAAmB;UACnB;YACE;;AAGN,UAAI,MAAuC;AACzC,qCAA6B,QAAQ,OAAO,OAAO;;AAGrD,gBAAU,QAAQ,KAAK,UAAU;AAEjC,aAAO;;AAGT,QAAI,MAAuC;AACzC,aAAO,OAAO;;AAGhB,WAAO,EAAE,QAAQ,OAAO;;AAE5B,SAAA;;AAEA,sCACE,OACA,OACA,YAAe;AAEf,MAAI,CAAC,MAAM,cAAc;AACvB,QAAM,YAAU,IAAI,IAAI,CAAC;AACzB,cAAQ,QAAQ,SAAA,OAAK;AACnB,UAAI,SAAS,OAAO,UAAU,UAAU;AACtC,gBAEE,UAAA,CAAA,YAAA,QAAA,KAAA,UACE,CAAA,YAAA,QAA2B,8CACA,2BAC7B,OAAA,SAAA,+BAAA,MAAA,KAAA;AACF,eAAO,OAAO,OAAO,QAAQ,UAAQ,KAAK;;;;;;;AC9XlD,IAAA,cAAA,WAAA;AACE,wBACkB,OACR,QAAoB;AADZ,SAAA,QAAA;AACR,SAAA,SAAA;;AAiBH,eAAA,UAAA,eAAP,SAAoB,KAME;QALpB,QAAK,IAAA,OACL,UAAM,IAAA,QACN,SAAM,IAAA,QACN,QAAK,IAAA,OACL,YAAS,IAAA;AAET,QAAM,sBAAsB,uBAAuB;AACnD,QAAM,SAAS;AAEf,gBAAS,SAAA,SAAA,IACJ,iBAAiB,uBACjB;AAGL,QAAM,MAAM,KAAK,oBAAoB;MACnC,QAAQ,WAAU,OAAO,OAAO;MAChC;MACA,cAAc,oBAAoB;MAClC,WAAW,EAAE,KAAK,IAAI;MACtB,SAAS;QACP;QACA,SAAS,OAAO,OAAO;QACvB,OAAA,SAAS,UAAa,UAAW;AAC/B,iBAAO,OAAO,MAAM,UAAU;;QAEhC;QACA,WAAW,KAAK,UAAU;QAC1B,aAAa,kBAAkB,uBAAuB;;;AAI1D,QAAI,CAAC,YAAY,MAAM;AACrB,YAAM,QAAmB,IAAA,eAAkC,KAAS,IAAC,eAAW,+BAAA,KAAA,UAAA;;AAQlF,UAAM,OAAO,IAAI;AAEjB,WAAO;;AAGD,eAAA,UAAA,sBAAR,SAA4B,KAQC;AAR7B,QAAA,QAAA;QACE,SAAM,IAAA,QACN,UAAM,IAAA,QACN,eAAY,IAAA,cACZ,UAAO,IAAA,SAGP,YAAS,IAAA;AAED,QAAA,WAAa,KAAK,MAAK;AAIzB,QAAA,KAAkB,SAAS,SAC/B,SAAQ,cAAc,QAAQ,cADzB,KAAE,GAAA,IAAE,YAAS,GAAA;AAKpB,aAAS,UAAU;AAEnB,QAAI,AAAa,OAAO,WAApB,UAA4B;AAM9B,UAAM,OAAO,QAAQ,QAAQ,WAAY,SAAQ,QAAQ,UAAU;AACnE,UAAM,MAAM,cAAc;AAC1B,UAAI,KAAK,QAAQ,iBAAiB;AAAG,eAAO;AAC5C,WAAK,KAAK;AAOV,UAAI,KAAK,UAAU,KAAK,OAAO,QAC7B,SACA,KACA,cACA,UACC;AACD,eAAO;;;AAMX,QAAI,iBAA8B,OAAO,OAAO;AAIhD,QAAI,WAAW;AACb,uBAAiB,QAAQ,MAAM,gBAAgB;;AAMjD,QAAM,WACH,UAAU,SAAS,kBAAkB,WACtC,sBAAsB,SAAQ,cAAc,QAAQ,gBACnD,UAAU,QAAQ,MAAM,IAAI,QAAQ;AAEvC,QAAI,AAAa,OAAO,aAApB,UAA8B;AAChC,qBAAe,aAAa;;AAG9B,QAAM,UAAU,IAAI,IAAI,aAAa;AAErC,YAAQ,QAAQ,SAAA,WAAS;;AACvB,UAAI,CAAC,cAAc,WAAW,QAAQ;AAAY;AAElD,UAAI,QAAQ,YAAY;AACtB,YAAM,iBAAiB,uBAAuB;AAC9C,YAAM,QAAQ,QAAO;AAErB,YAAI,OAAO,UAAU,aAAa;AAChC,cAAM,iBAAiB,SAAS,kBAAkB;YAChD;YACA,WAAW,UAAU,KAAK;YAC1B,OAAO;YACP,WAAW,QAAQ;;AAGrB,cAAM,YAAY,kBAAkB,WAAW;AAE/C,cAAI,gBACF,MAAK,kBAAkB,OAAO,WAAW,SAAS;AAEpD,cAAM,gBAAgB,UAAU,gBAC3B,QAAQ,MAAM,cAAsB,eAA8B,iBAClE;AAEL,cAAM,QAAQ,SAAS,iBACrB,UACA,UAAU,KAAK,OACf;AAGF,cAAI,OAAO;AACT,sBAAU,OAAO;cAGf,OAAO;cACP;cACA;;iBAEG;AACL,uCAA2B,WAAW;;AAGxC,2BAAiB,QAAQ,MAAM,gBAAc,OAAA,IAC3C,IAAC,kBAAiB;mBAIpB,SAAS,sBACT,CAAC,cAAc,CAAC,SAAS,WAAW,YACpC;AACA,gBAAM,QACc,IAAA,eAAc,KAAA,IAAQ,eACtC,oBAGA,iBACF,UAAA,KAAA,UAAA,SAAA,MAAA,GAAA,UAAA,GAAA;;aAEC;AAEL,YAAM,WAAW,yBACf,WACA,QAAQ;AAGV,YAAI,YAmBA,SAAS,gBAAgB,UAAU,UAAU,SAAQ,QAAQ,YAAY;AAC3E,mBAAS,aAAa,WAAW,QAAQ,QAAQ,KAAK;;;;AAK5D,QAAI,AAAa,OAAO,WAApB,UAA4B;AAC9B,UAAM,cAAY,cAAc;AAEhC,UAAI,UAAU,IAAI,MAAM;AACtB,yBAAiB,KAAK,YAAY,WAAW,aAAW,gBAAgB;;AAG1E,UAAI,MAAuC;AACzC,YAAM,oBAAkB,SAAC,gBAAsB;AAC7C,iBAAA,0BAAwB,IAAI,uBAAuB;;AACrD,YAAM,4BAA0B,IAAI;AACpC,gBAAQ,QAAQ,SAAA,WAAS;AACvB,cAAI,QAAQ,cAAc,UAAU,cAAc;AAChD,sCAAwB,IAAI,UAAU,KAAK;;;AAI/C,YAAM,qBAAmB,SAAC,gBAAsB;AAC9C,cAAM,YAAY,UAAU,IAAI,IAAI;AACpC,iBAAO,QAAQ,aAAa,UAAU,QAAQ,UAAU,KAAK;;AAG/D,eAAO,KAAK,gBAAgB,QAAQ,SAAA,gBAAc;AAKhD,cAAI,kBAAgB,mBAChB,CAAC,mBAAiB,iBAAiB;AACrC,8BACE,aACA,gBACA,gBACA,QAAQ;;;;AAMhB,cAAQ,MAAM,MAAM,QAAQ;AAE5B,aAAO;;AAGT,WAAO;;AAGD,eAAA,UAAA,oBAAR,SACE,OACA,OACA,SACA,WAAoB;AAJtB,QAAA,QAAA;AAME,QAAI,CAAC,MAAM,gBAAgB,UAAU,MAAM;AAIzC,aAAO,QAAwC,QAAQ,UAAU;;AAGnE,QAAI,MAAM,QAAQ,QAAQ;AACxB,aAAO,MAAM,IAAI,SAAC,MAAM,GAAC;AACvB,YAAM,SAAQ,MAAK,kBACjB,MAAM,OAAO,SAAS,kBAAkB,WAAW;AACrD,mCAA2B,WAAW;AACtC,eAAO;;;AAIX,WAAO,KAAK,oBAAoB;MAC9B,QAAQ;MACR,cAAc,MAAM;MACpB;MACA;;;AAII,eAAA,UAAA,cAAR,SACE,WACA,UACA,UACA,SACA,gBAAsD;;AALxD,QAAA,QAAA;AAOE,QAAI,UAAU,IAAI,QAAQ,CAAC,YAAY,WAAW;AAChD,UAAM,MAIJ,CAAC,MAAM,QAAQ,aAId,aAAY,aAAa,wBAAwB,aAChD,WAAW;AAKf,UAAM,MAAI;AAMV,UAAI,OAAK,CAAC,gBAAgB;AACxB,yBAAiB,CAAC,YAAY,OAAK,IAAE,QAAQ;;AAQ/C,UAAI;AAEJ,UAAM,aAAW,SACf,OACA,MAAqB;AAErB,eAAO,MAAM,QAAQ,SAChB,OAAO,SAAS,WAAW,MAAK,QAAQ,SACzC,QAAQ,MAAM,cAAc,OAAM,OAAO;;AAG/C,gBAAU,IAAI,QAAQ,SAAC,WAAW,gBAAc;AAC9C,YAAI,gBAAgB;AAClB,yBAAe,KAAK;;AAEtB,YAAM,OAAO,WAAS,KAAG;AACzB,YAAM,OAAO,WAAS,KAAG;AACzB,YAAM,OAAO,MAAK,YAChB,WACA,MACA,MACA,SACA;AAEF,YAAI,SAAS,MAAM;AACjB,4BAAgB,mBAAiB,IAAI;AACrC,0BAAc,IAAI,gBAAgB;;AAEpC,YAAI,gBAAgB;AAClB,oBAAU,eAAe,UAAU;;;AAIvC,UAAI,iBAAe;AAEjB,mBAAY,MAAM,QAAQ,OAAK,IAAE,MAAM,KAAI,SAAA,IAAM;AACjD,wBAAc,QAAQ,SAAC,OAAO,MAAI;AAC/B,mBAAiB,QAAQ;;;;AAKhC,QAAI,UAAU,MAAM;AAClB,aAAO,KAAK,MAAM,SAAS,iBACzB,UACA,UACA,UAAU,MACV,SACA,kBAAkB,OAAA,QAAQ,OAAM,WAAU,MAAA,KAAI;;AAIlD,WAAO;;AAEX,SAAA;;AAEA,IAAM,qBAAkC;AAExC,2BACE,KACA,MAAqB;MADnB,MAAG,IAAA;AAGL,MAAI,CAAC,IAAI,IAAI,OAAO;AAClB,QAAI,IAAI,MAAM,mBAAmB,SAAS,EAAE,KAAK,IAAI;;AAEvD,SAAO,IAAI,IAAI;;AAGjB,oCACE,KACA,MAAqB;MADnB,MAAG,IAAA;AAGL,MAAM,YAAY,IAAI,IAAI;AAC1B,MAAI,aACA,CAAC,UAAU,QACX,CAAC,UAAU,IAAI,MAAM;AACvB,uBAAmB,KAAK;AACxB,QAAI,OAAO;;;AAIf,IAAM,WAAW,IAAI;AAIrB,2BACE,aACA,aACA,gBACA,OAAsB;AAEtB,MAAM,WAAW,SAAC,UAAiC;AACjD,QAAM,QAAQ,MAAM,cAA2B,UAAU;AACzD,WAAO,OAAO,UAAU,YAAY;;AAGtC,MAAM,WAAW,SAAS;AAC1B,MAAI,CAAC;AAAU;AAEf,MAAM,WAAW,SAAS;AAC1B,MAAI,CAAC;AAAU;AAIf,MAAI,YAAY;AAAW;AAI3B,MAAI,MAAM,UAAU;AAAW;AAK/B,MAAI,OAAO,KAAK,UAAU,MACxB,SAAA,KAAG;AAAI,WAAA,MAAM,cAAc,UAAU,SAAS;MAAS;AACvD;;AAGF,MAAM,aACJ,MAAM,cAAsB,aAAa,iBACzC,MAAM,cAAsB,aAAa;AAC3C,MAAM,YAAY,uBAAuB;AACzC,MAAM,cAAiB,aAAU,MAAI;AAErC,MAAI,SAAS,IAAI;AAAc;AAC/B,WAAS,IAAI;AAEb,MAAM,iBAA2B;AAGjC,MAAI,CAAC,MAAM,QAAQ,aACf,CAAC,MAAM,QAAQ,WAAW;AAC5B,KAAC,UAAU,UAAU,QAAQ,SAAA,OAAK;AAChC,UAAM,WAAW,MAAM,cAAc,OAAO;AAC5C,UAAI,OAAO,aAAa,YACpB,CAAC,eAAe,SAAS,WAAW;AACtC,uBAAe,KAAK;;;;AAK1B,EACF,UAAA,KAAA,+CAA+E,YAAA,iBAAA,aAAA,gFAGxD,gBAAA,SACjB,uCACE,eAAe,KAAK,WAAW,gDACjC,MAAE,4CAEN,cAAW,6EAGC,KAAK,UAAU,UAAU,MAAM,GAAG,OAAK,mBACvC,KAAK,UAAU,UAAU,MAAM,GAAG,OAAK;;;;ACrhB9C,IAAM,YAAY,IAAI;AAE7B,IAAM,eAAe,IAAI;AAKzB,sBAAsB,OAAuB;AAC3C,MAAI,OAAO,aAAa,IAAI;AAC5B,MAAI,CAAC,MAAM;AACT,iBAAa,IAAI,OAAO,OAAO;MAC7B,MAAM,IAAI;MACV,KAAK;;;AAGT,SAAO;;AAGH,qBAAsB,OAAuB;AACjD,eAAa,OAAO,KAAK,QAAQ,SAAA,IAAE;AAAI,WAAA,GAAG,YAAY;;;AAWlD,qBAAsB,OAAuB;AACjD,eAAa,OAAO,KAAK,QAAQ,SAAA,IAAE;AAAI,WAAA,GAAG,YAAY;;;AAGlD,iBAAqB,OAAQ;AACjC,MAAM,UAAS,IAAI;AACnB,MAAM,YAAY,IAAI;AAEtB,MAAM,KAAqB,SAAU,UAAQ;AAC3C,QAAI,UAAU,SAAS,GAAG;AACxB,UAAI,UAAU,UAAU;AACtB,gBAAQ;AACR,gBAAO,QAAQ,SAAA,QAAK;AAIlB,uBAAa,QAAO,IAAI,MAAM;AAG9B,oBAAU;;AAGZ,YAAM,eAAe,MAAM,KAAK;AAChC,kBAAU;AACV,qBAAa,QAAQ,SAAA,UAAQ;AAAI,iBAAA,SAAS;;;WAEvC;AAIL,UAAM,QAAQ,UAAU;AACxB,UAAI,OAAO;AACT,eAAO;AACP,qBAAa,OAAO,IAAI;;;AAI5B,WAAO;;AAGT,KAAG,eAAe,SAAA,UAAQ;AACxB,cAAU,IAAI;AACd,WAAO,WAAA;AACL,gBAAU,OAAO;;;AAIrB,MAAM,SAAS,GAAG,cAAc,SAAA,OAAK;AACnC,YAAO,IAAI;AACX,iBAAa,OAAO,KAAK,IAAI;AAC7B,WAAO;;AAGT,KAAG,cAAc,SAAA,OAAK;AAAI,WAAA,QAAO,OAAO;;AAExC,SAAO;;AAST,mBAAmB,OAAoB;AACrC,MAAI,MAAM,kBAAkB;AAC1B,UAAM;;;;;ACmBV,gCAAgC,MAAoB;AAClD,SAAO,KAAK,SAAS,SAAS,KAAK,OACjC,KAAK,QAAQ,yBAAyB,KAAK,OAAO,KAAK,aAAa;;AAoFjE,IAAM,0BAA0B,SACrC,KACA,SAA0B;MADxB,aAAU,IAAA,YAAE,KAAE,IAAA,IAAE,MAAG,IAAA;AAGrB,MAAI,OAAO,eAAe,UAAU;AAClC,QAAI,SAAS;AACX,cAAQ,YACL,OAAO,SAAS,EAAG,OACpB,QAAQ,SAAS,EAAE,QACnB;;AAGJ,QAAI,OAAO;AAAQ,WAAK;AACxB,QAAI,OAAO,QAAQ;AACjB,aAAU,aAAU,MAClB,QAAO,OAAO,YACd,OAAO,OAAO,WACZ,KAAK,KAAK,UAAU;;;;AAK9B,IAAM,kBAAqC,WAAA;AAAM,SAAA;;AACjD,IAAM,kBAAmC,SAAC,OAAO,SAAO;AAAK,SAAA,QAAQ;;AAIrE,IAAM,cACJ,SAAC,UAAU,UAAU,KAAgB;MAAd,eAAY,IAAA;AAAO,SAAA,aAAa,UAAU;;AACnE,IAAM,eAAwC,SAAC,GAAG,UAAQ;AAAK,SAAA;;AAM/D,IAAA,WAAA,WAAA;AAsCE,qBAAoB,QAKnB;AALmB,SAAA,SAAA;AArCZ,SAAA,eAYJ,OAAO,OAAO;AAEV,SAAA,YAEJ,OAAO,OAAO;AAMV,SAAA,eAAe,IAAI;AAMnB,SAAA,gBAAgB,IAAI;AAIZ,SAAA,oBAA4C,OAAO,OAAO;AAC1D,SAAA,oBAA4C,OAAO,OAAO;AAE1D,SAAA,qBAAqB;AAQnC,SAAK,SAAM,SAAA,EACT,kBAAkB,2BACf;AAGL,SAAK,QAAQ,KAAK,OAAO;AAEzB,SAAK,gBAAgB;AACrB,SAAK,gBAAgB;AACrB,SAAK,gBAAgB;AAErB,QAAI,OAAO,eAAe;AACxB,WAAK,iBAAiB,OAAO;;AAG/B,QAAI,OAAO,cAAc;AACvB,WAAK,gBAAgB,OAAO;;;AAIzB,YAAA,UAAA,WAAP,SACE,QACA,cACA,aAAyB;AAGzB,QAAM,WAAW,gBAAgB,cAC7B,sBAAsB,QAAQ,cAAc,eAC5C,OAAO;AAQX,QAAI,aAAa,KAAK,kBAAkB,YAAY;AAClD,aAAO,CAAC;;AAGV,QAAM,UAA4B;MAChC;MACA;MACA;;AAGF,QAAI;AAEJ,QAAM,SAAS,YAAY,KAAK,cAAc;AAC9C,QAAI,QAAQ,UAAU,OAAO,SAAS,KAAK,OAAO;AAClD,WAAO,OAAO;AACZ,UAAM,gBAAgB,MAAM,QAAQ;AACpC,UAAI,MAAM,QAAQ,gBAAgB;AAChC,gBAAQ,yBAAyB;aAC5B;AACL,aAAK;AACL;;;AAIJ,SAAK,KAAK,OAAO,MAAM;AACvB,WAAO,QAAQ,YAAY,CAAC,IAAI,QAAQ,aAAa,CAAC;;AAGjD,YAAA,UAAA,kBAAP,SAAuB,cAA0B;AAAjD,QAAA,QAAA;AACE,WAAO,KAAK,cAAc,QAAQ,SAAA,UAAQ;AACxC,UAAM,MAKF,aAAa,WAJf,YAAS,IAAA,WACT,eAAY,IAAA,cACZ,mBAAgB,IAAA,kBACb,WAAQ,OAAA,KAJP,CAAA,aAAA,gBAAA;AAqBN,UAAI;AAAW,cAAK,gBAAgB,SAAS;AAC7C,UAAI;AAAc,cAAK,gBAAgB,YAAY;AACnD,UAAI;AAAkB,cAAK,gBAAgB,gBAAgB;AAE3D,UAAI,OAAO,KAAK,MAAK,WAAW,WAAW;AACzC,cAAK,UAAU,UAAU,KAAK;aACzB;AACL,cAAK,UAAU,YAAY,CAAC;;;;AAK1B,YAAA,UAAA,mBAAR,SAAyB,UAAkB,UAAoB;AAA/D,QAAA,QAAA;AACE,QAAM,WAAW,KAAK,cAAc;AAC5B,QAAA,YAAsB,SAAQ,WAAnB,SAAW,SAAQ;AAEtC,sBACE,WACA,OAAoC;AAEpC,gBAAS,QACP,OAAO,UAAU,aAAa,QAG9B,UAAU,OAAO,cAGjB,UAAU,QAAQ,eAClB,UAAS;;AAKb,aAAS,UAAU,SAAS;AAE5B,aAAS,QAEP,cAAc,QAAQ,kBAGtB,MAAM,QAAQ,aAAa,yBAAyB,aAEpD,OAAO,cAAc,aAAa,YAElC,SAAS;AAEX,QAAI,QAAQ;AACV,aAAO,KAAK,QAAQ,QAAQ,SAAA,WAAS;AACnC,YAAM,YAAW,MAAK,eAAe,UAAU,WAAW;AAC1D,YAAM,YAAW,OAAO;AAExB,YAAI,OAAO,cAAa,YAAY;AAClC,oBAAS,OAAO;eACX;AACG,cAAA,UAAyB,UAAQ,SAAxB,OAAgB,UAAQ,MAAlB,QAAU,UAAQ;AAEzC,oBAAS,QAGP,YAAY,QAAQ,kBAGpB,MAAM,QAAQ,WAAW,uBAAuB,WAEhD,OAAO,YAAY,aAAa,UAEhC,UAAS;AAEX,cAAI,OAAO,SAAS,YAAY;AAC9B,sBAAS,OAAO;;AAGlB,mBAAS,WAAU;;AAGrB,YAAI,UAAS,QAAQ,UAAS,OAAO;AAMnC,oBAAS,QAAQ,UAAS,SAAS;;;;;AAMnC,YAAA,UAAA,kBAAR,SACE,OACA,UAAwB;AAAxB,QAAA,aAAA,QAAA;AAAA,iBAAA;;AAEA,QAAM,SAAS,UAAU,MAAM;AAC/B,QAAM,MAAM,KAAK,kBAAkB;AACnC,QAAI,aAAa,KAAK;AACpB,cAAiC,UAAA,CAAA,OAAsB,QAAK,OAAA,KAAA,UAAA,CAAA,OAA8B,QAAA,OAAA,wBAAA,QAAA;AAG1F,UAAI;AAAK,eAAO,KAAK,kBAAkB;AAEvC,WAAK,kBAAkB,YAAY;AAEnC,WAAK,kBAAkB,UAAU;;;AAI9B,YAAA,UAAA,mBAAP,SAAwB,eAA+B;AAAvD,QAAA,QAAA;AACG,SAAK,qBAAiC;AACvC,WAAO,KAAK,eAAe,QAAQ,SAAA,WAAS;AAI1C,YAAK,gBAAgB,WAAW;AAEhC,oBAAc,WAAW,QAAQ,SAAA,SAAO;AACtC,cAAK,gBAAgB,SAAS,MAAO,IAAI;AACzC,YAAM,QAAQ,QAAQ,MAAM;AAC5B,YAAI,CAAC,SAAS,MAAM,OAAO,SAAS;AAElC,gBAAK,cAAc,IAAI,SAAS,IAAI,OAAO;;;;;AAM3C,YAAA,UAAA,gBAAR,SAAsB,UAAgB;AAAtC,QAAA,QAAA;AACE,QAAI,CAAC,OAAO,KAAK,KAAK,cAAc,WAAW;AAC7C,UAAM,WACJ,KAAK,aAAa,YAAY,OAAO,OAAO;AAC9C,eAAO,SAAS,OAAO,OAAO;AAuB9B,UAAM,aAAa,KAAK,aAAa,IAAI;AACzC,UAAI,cAAc,WAAW,MAAM;AACjC,mBAAW,QAAQ,SAAA,WAAS;AAC1B,cAAM,MAAsB,MAAK,cAAc,YAAvC,SAAM,IAAA,QAAK,OAAI,OAAA,KAAjB,CAAA;AACN,iBAAO,OAAO,UAAQ;AACtB,iBAAO,OAAO,SAAO,QAAQ;;;;AAKnC,QAAM,QAAQ,KAAK,UAAU;AAC7B,QAAI,SAAS,MAAM,QAAQ;AAGzB,YAAM,OAAO,GAAG,QAAQ,SAAA,QAAM;AAC5B,cAAK,iBAAiB,UAAU;;;AAIpC,WAAO,KAAK,aAAa;;AAGnB,YAAA,UAAA,iBAAR,SACE,UACA,WACA,iBAAwB;AAMxB,QAAI,UAAU;AACZ,UAAM,gBAAgB,KAAK,cAAc,UAAU;AACnD,aAAO,cAAc,cACnB,mBAAoB,eAAc,aAAa,OAAO,OAAO;;;AAI3D,YAAA,UAAA,kBAAR,SACE,SACA,iBAAwB;AAExB,QAAI,eAAe,KAAK,aAAa,IAAI;AACzC,QAAI,CAAC,gBAAgB,iBAAiB;AACpC,WAAK,aAAa,IAAI,SAAS,eAAe,IAAI;;AAEpD,WAAO;;AAGF,YAAA,UAAA,kBAAP,SACE,UACA,UACA,SACA,WAA+B;AAJjC,QAAA,QAAA;AAME,QAAI,CAAC,SAAS;AAAe,aAAO;AAIpC,QAAI,CAAC;AAAU,aAAO;AAEtB,QAAM,YAAY,SAAS,cAAc,KAAK;AAE9C,QAAI,aAAa;AAAW,aAAO;AAEnC,QAAI,KAAK,sBACL,KAAK,aAAa,IAAI,YAAY;AACpC,UAAM,uBAAuB,KAAK,gBAAgB,UAAU;AAC5D,UAAM,cAAY,CAAC;AACnB,UAAM,iBAAe,SAAC,SAAe;AACnC,YAAM,gBAAe,MAAK,gBAAgB,SAAS;AACnD,YAAI,iBACA,cAAa,QACb,YAAU,QAAQ,iBAAgB,GAAG;AACvC,sBAAU,KAAK;;;AAUnB,UAAI,2BAA2B,CAAC,CAAE,YAAU,KAAK,cAAc;AAC/D,UAAI,wBAAwB;AAI5B,eAAS,IAAI,GAAG,IAAI,YAAU,QAAQ,EAAE,GAAG;AACzC,YAAM,eAAe,YAAU;AAE/B,YAAI,aAAa,IAAI,YAAY;AAC/B,cAAI,CAAC,qBAAqB,IAAI,YAAY;AACxC,gBAAI,uBAAuB;AACzB,cAAoC,UAAQ,KAAA,uBAA8B,WAAA,mBAAA;;AAM5E,iCAAqB,IAAI;;AAE3B,iBAAO;;AAGT,qBAAa,QAAQ;AAErB,YAAI,4BAGA,MAAM,YAAU,SAAS,KAKzB,0BAA0B,SAAS,cAAc,SAAS,YAAY;AAIxE,qCAA2B;AAC3B,kCAAwB;AAMxB,eAAK,cAAc,QAAQ,SAAC,QAAQ,aAAW;AAC7C,gBAAM,QAAQ,SAAS,MAAM;AAC7B,gBAAI,SAAS,MAAM,OAAO,UAAU;AAClC,6BAAa;;;;;;AAOvB,WAAO;;AAGF,YAAA,UAAA,aAAP,SAAkB,UAA8B,WAAiB;AAC/D,QAAM,SAAS,KAAK,eAAe,UAAU,WAAW;AACxD,WAAO,CAAC,CAAE,WAAU,OAAO;;AAGtB,YAAA,UAAA,oBAAP,SAAyB,WAAyB;AACxC,QAAA,WAAwB,UAAS,UAAvB,YAAc,UAAS;AACzC,QAAM,SAAS,KAAK,eAAe,UAAU,WAAW;AACxD,QAAI;AAEJ,QAAI,QAAQ,UAAU,OAAO;AAC7B,QAAI,SAAS,UAAU;AACrB,UAAM,UAA0C;QAC9C;QACA;QACA,OAAO,UAAU,SAAS;QAC1B,WAAW,UAAU;;AAEvB,UAAM,OAAO,uBAAuB;AACpC,aAAO,OAAO;AACZ,YAAM,oBAAoB,MAAM,MAAM;AACtC,YAAI,MAAM,QAAQ,oBAAoB;AACpC,kBAAQ,uBAAuB;eAC1B;AAGL,2BAAiB,qBAAqB;AACtC;;;;AAKN,QAAI,mBAAmB,QAAQ;AAC7B,uBAAiB,UAAU,QACvB,sBAAsB,UAAU,OAAO,UAAU,aACjD,gBAAgB,WAAW,uBAAuB;;AAKxD,QAAI,mBAAmB,OAAO;AAC5B,aAAO;;AAMT,WAAO,cAAc,uBAAuB,kBACxC,iBACA,YAAY,MAAM;;AAGjB,YAAA,UAAA,YAAP,SACE,SACA,SAA+B;AAE/B,QAAM,oBAAoB,QAAQ;AAClC,QAAI,CAAC;AAAmB;AAExB,QAAM,cAAc,QAAQ,SAAS,QAAQ;AAC7C,QAAI,CAAC;AAAa;AAElB,QAAI,QAAQ,aAAa,QAAQ;AAC/B,UAAM,WAAW,QAAQ,MAAM,cAAsB,mBAAmB;AACxE,UAAI;AAAU,gBAAQ,WAAW;;AAGnC,QAAM,iBAAiB,KAAK,kBAAkB;AAC9C,QAAM,YAAY,uBAAuB;AACzC,QAAM,WAAW,QAAQ,MAAM,cAAiB,mBAAmB;AACnE,QAAM,SAAS,KAAK,eAAe,QAAQ,UAAU,WAAW;AAChE,QAAM,OAAO,UAAU,OAAO;AAE9B,QAAI,MAAM;AACR,UAAM,cAAc,yBAClB,MACA,mBACA,SACA,SACA,QAAQ,MAAM,WACZ,YAAY,qBACR,kBAAkB,QAClB,mBACJ;AAKJ,aAAO,UAAU,UACf,KAAK,OACL,MACA,CAAC,UAAU;;AAIf,WAAO;;AAGF,YAAA,UAAA,mBAAP,SACE,gBACA,WACA,eAAiC;AAEjC,QAAI,SAIF,KAAK,eAAe,gBAAgB,WAAW;AACjD,QAAI,QAAQ,UAAU,OAAO;AAC7B,QAAI,CAAC,SAAS,eAAe;AAC3B,eAAS,KAAK,cAAc;AAC5B,cAAQ,UAAU,OAAO;;AAE3B,WAAO;;AAGF,YAAA,UAAA,mBAAP,SACE,UACA,UACA,KACA,SACA,SAAqB;QAFnB,QAAK,IAAA,OAAE,WAAQ,IAAA,UAAE,QAAK,IAAA;AAIxB,QAAI,UAAU,aAAa;AAIzB,aAAO,yBACL,QAAQ,MAAM,eACd,UACA;;AAGJ,QAAI,UAAU,cAAc;AAE1B,aAAO;;AAGT,WAAO,MAAM,UAAU,UAAU,yBAC/B,MAYA,QACA,EAAE,UACA,WAAW,MAAM,KAAK,OACtB,OACA,WAAW,QAAQ,aACrB,SACA,WAAW,OAAO,OAAO;;AAG/B,SAAA;;AAEA,kCACE,UACA,mBACA,WACA,SACA,SAAoB;AAEpB,MAAM,iBAAiB,SAAS,kBAAkB;AAClD,MAAM,YAAY,uBAAuB;AACzC,MAAM,YAAY,UAAU,aAAa,QAAQ;AAC3C,MAAA,MAA0C,QAAQ,OAAhD,gBAAa,IAAA,eAAE,cAAW,IAAA,aAAE,UAAO,IAAA;AAE3C,SAAO;IACL,MAAM,uBAAuB;IAC7B,OAAO,UAAU,SAAS;IAC1B;IACA;IACA;IACA;IACA;IACA;IACA,OAAO,SAAS;IAChB;IAEA,WAAA,SACE,oBACA,OAA8B;AAE9B,UAAM,UACJ,OAAO,uBAAuB,WAAW;QACvC,WAAW;QACX,MAAI;UACH,SAAA,IAAM;AAEX,UAAI,AAAW,QAAQ,SAAnB,QAAyB;AAC3B,gBAAQ,OAAO;;AAGjB,UAAI,AAAW,QAAQ,cAAnB,QAA8B;AAChC,gBAAQ,YAAY;;AAGtB,aAAO,SAAS,UAAa,SAAS;;IAGxC,cAAc,yBAAyB;;;AAI3C,kCACE,eAA+B;AAE/B,SAAO,sBAAsB,UAAU,UAAQ;AAC7C,QAAI,MAAM,QAAQ,aAAa,MAAM,QAAQ,WAAW;AACtD,YAAM,QAAmB,IAAA,eAAqC,KAAA,IAAA,eAAA;;AAOhE,QAAI,YAAY,OAAO,aAAa,YAChC,YAAY,OAAO,aAAa,UAAU;AAC5C,UAAM,QAAQ,cAAc,UAAU;AACtC,UAAM,QAAQ,cAAc,UAAU;AACtC,UAAM,cAAc,SAAS,SAAS,UAAU;AAEhD,UAAI,eACA,CAAC,wBAAwB,aACzB,CAAC,wBAAwB,WAAW;AACtC,eAAO;;AAGT,aAAA,SAAA,SAAA,IAAY,WAAa;;AAG3B,WAAO;;;AAIX,gCACE,WAAuB;AAEvB,SAAO,SAAC,MAAM,SAAO;AACnB,WAAO,OAAU,QAAQ,YAAS,MAChC,KAAK,UAAU,iBAAiB,MAAM,WAAW,UAC9C,QAAQ;;;AAIjB,kCACE,WAAuB;AAEvB,MAAM,OAAO,IAAI,KAEd;AAEH,SAAO,SAAC,QAAQ,SAAO;AACrB,QAAI;AACJ,QAAI,QAAQ,gBAAgB,QAAQ,aAAa;AAC/C,UAAM,OAAO,KAAK,YAAY;QAC5B,QAAQ;QACR,QAAQ;;AAEV,iBAAW,KAAK,YACd,MAAK,WAAW,aAAa,QAAQ,cAAc,QAAQ;;AAI/D,QAAM,YAAY,QAAQ,YACxB,iBAAiB,QAAQ,WAAW,MAAM;AAE5C,WAAU,QAAQ,WAAQ,MAAI,KAAK,UAAU;;;AAajD,sBACE,cACA,aAAwB;AAExB,MAAI,MAAgB,OAAO,OAAO;AAElC,MAAM,YAAY,IAAI,IAAI,CAAC;AAC3B,YAAU,QAAQ,SAAA,eAAY;AAC5B,kBAAa,WAAW,QAAQ,SAAA,WAAS;AACvC,UAAI,QAAQ,YAAY;AACtB,YAAI,UAAU,OAAO;AACnB,cAAM,cAAc,UAAU,MAAM;AACpC,cAAM,WAAW,UAAU,KAAK;AAChC,cAAI,aAAa,aAAa;AAC5B,gBAAM,UAAU,IAAI,WAAY,KAAI,UAAU,OAAO,OAAO;AAC5D,oBAAQ,YAAY;;;AAGxB,YAAI,UAAU,cAAc;AAC1B,cAAM,UAAU,IAAI,WAAY,KAAI,UAAU,OAAO,OAAO;AAC5D,kBAAQ,UAAU,KAAK,SACrB,aAAa,UAAU,cAAc;;aAEpC;AACL,YAAM,WAAW,yBAAyB,WAAW;AACrD,YAAI,UAAU;AACZ,oBAAU,IAAI,SAAS;;;;;AAK/B,SAAO;;AAGT,0BACE,UACA,WACA,QACA,UAAmB;AAKnB,MAAM,SAAS,OAAO,OAAO;AAC7B,MAAI;AACJ,YAAU,QAAQ,SAAA,GAAC;AACjB,QAAI,MAAM,QAAQ,IAAI;AACpB,UAAI,OAAO,YAAY,UAAU;AAC/B,YAAM,UAAU,YAAY,SAAS;AACrC,YAAM,SAAS,WAAW,QAAQ;AAClC,eAAO,WAAW,iBAAiB,SAAS,UAAU,GAAG,QAAQ;;WAE9D;AACL,UAAM,UAAU,YAAY,SAAS;AACrC,UAAM,eAAe,WAAW,QAAQ,MAAM;AAC9C,UAAI,OAAO,KAAK,UAAU,eAAe;AACvC,eAAO,UAAU,KAAK,SAAS;aAC1B;AACL,gBAAqC,UAAA,CAAY,QAAA,KAAA,UAAA,CAAA,QAAA,oBAAgC,eAAA;AACjF,kBAAU;;;;AAIhB,SAAO;;;;AC39BT,IAAM,gBAAqC;EACzC,kBAAkB;EAClB,aAAa;EACb,eAAe;EACf,cAAc;;AAGhB,IAAA,gBAAA,SAAA,QAAA;AAAmC,YAAA,gBAAA;AAmBjC,0BAAY,QAAgC;AAAhC,QAAA,WAAA,QAAA;AAAA,eAAA;;AAAZ,QAAA,QACE,OAAA,KAAA,SAAO;AAfD,UAAA,UAAU,IAAI;AAGd,UAAA,wBAAwB,IAAI;AASpB,UAAA,UAAU;AAiPlB,UAAA,UAAU;AAoEV,UAAA,sBAAsB,MAAK,SACjC,GACA,2BAAmC;AAEnC,aAAO,MAAK,eAAe,KAAK,OAAM,GAAG,CAAC,CAAC;OAC1C;MACD,cAAc,SAAC,GAAqB;AAGlC,YAAM,QAAQ,EAAE,aAAa,MAAK,iBAAiB,MAAK;AACxD,YAAI,sBAAsB,QAAQ;AACxB,cAAA,aAAkC,EAAC,YAAvB,SAAsB,EAAC,QAAf,YAAc,EAAC;AAC3C,iBAAO,MAAM,aACX,EAAE,OAOF,EAAE,UACF,KAAK,UAAU,EAAE,YAAY,QAAQ;;;;AAMrC,UAAA,WAAW;AA5UjB,UAAK,SAAM,SAAA,SAAA,IAAQ,gBAAkB;AACrC,UAAK,cAAc,CAAC,CAAC,MAAK,OAAO;AAEjC,UAAK,WAAW,IAAI,SAAS;MAC3B,OAAO;MACP,kBAAkB,MAAK,OAAO;MAC9B,eAAe,MAAK,OAAO;MAC3B,cAAc,MAAK,OAAO;;AAM5B,UAAK,OAAO,IAAI,YAAY,KAAK;MAC/B,UAAU,MAAK;MACf,eAAe,MAAK,OAAO;;AAQ7B,UAAK,iBAAiB,MAAK;AAE3B,UAAK,cAAc,IAAI,YACrB,OACA,MAAK,cAAc,IAAI,YAAY;MACjC,OAAO;MACP,aAAa,MAAK;;;;AAKjB,iBAAA,UAAA,UAAP,SAAe,MAA2B;AACxC,QAAI;AAAM,WAAK,KAAK,QAAQ;AAC5B,WAAO;;AAGF,iBAAA,UAAA,UAAP,SAAe,YAA2B;AAA3B,QAAA,eAAA,QAAA;AAAA,mBAAA;;AACb,WAAQ,cAAa,KAAK,iBAAiB,KAAK,MAAM;;AAGjD,iBAAA,UAAA,OAAP,SAAe,SAA0B;AASrC,QAAA,MACE,QAAO,mBADT,oBAAiB,QAAA,SAAG,QAAK;AAE3B,QAAI;AACF,aAAO,KAAK,YAAY,sBAAyB;QAC/C,OAAO,QAAQ,aAAa,KAAK,iBAAiB,KAAK;QACvD,OAAO,QAAQ;QACf,WAAW,QAAQ;QACnB,QAAQ,QAAQ;QAChB,QAAQ,KAAK;QACb;SACC,UAAU;aACN,GAAP;AACA,UAAI,aAAa,mBAAmB;AAMlC,eAAO;;AAET,YAAM;;;AAIH,iBAAA,UAAA,QAAP,SAAa,SAA2B;AACtC,QAAI;AACF,QAAE,KAAK;AACP,aAAO,KAAK,YAAY,aAAa;QACnC,OAAO,KAAK;QACZ,OAAO,QAAQ;QACf,QAAQ,QAAQ;QAChB,QAAQ,QAAQ;QAChB,WAAW,QAAQ;;;AAGrB,UAAI,CAAC,EAAE,KAAK,WAAW,QAAQ,cAAc,OAAO;AAClD,aAAK;;;;AAKJ,iBAAA,UAAA,SAAP,SAAc,SAA4B;AACxC,QAAI,OAAO,KAAK,SAAS,SAAS,CAAC,QAAQ,IAAI;AAU7C,aAAO;;AAET,QAAM,QAAQ,QAAQ,aAClB,KAAK,iBACL,KAAK;AACT,QAAI;AACF,QAAE,KAAK;AACP,aAAO,MAAM,OAAO,QAAQ,MAAM,cAAc,QAAQ;;AAExD,UAAI,CAAC,EAAE,KAAK,WAAW,QAAQ,cAAc,OAAO;AAClD,aAAK;;;;AAKJ,iBAAA,UAAA,OAAP,SAAe,SAA0B;AACvC,WAAO,KAAK,YAAY,sBAAsB;MAC5C,OAAO,QAAQ,aAAa,KAAK,iBAAiB,KAAK;MACvD,QAAQ,QAAQ,MAAM;MACtB,OAAO,QAAQ;MACf,WAAW,QAAQ;MACnB,mBAAmB,QAAQ;MAC3B,QAAQ,KAAK;;;AAIV,iBAAA,UAAA,QAAP,SAAa,OAAyB;AAAtC,QAAA,QAAA;AACE,QAAI,CAAC,KAAK,QAAQ,MAAM;AAWtB,kBAAY;;AAEd,SAAK,QAAQ,IAAI;AACjB,QAAI,MAAM,WAAW;AACnB,WAAK,oBAAoB;;AAE3B,WAAO,WAAA;AAIL,UAAI,MAAK,QAAQ,OAAO,UAAU,CAAC,MAAK,QAAQ,MAAM;AACpD,oBAAY;;AAEd,YAAK,SAAS,MAAM;AAIpB,YAAK,oBAAoB,OAAO;;;AAK7B,iBAAA,UAAA,KAAP,WAAA;AACE,WAAO,KAAK,eAAe;;AAUtB,iBAAA,UAAA,SAAP,SAAc,QAAgB,YAAoB;AAChD,WAAQ,cAAa,KAAK,iBAAiB,KAAK,MAAM,OAAO;;AAQxD,iBAAA,UAAA,UAAP,SAAe,QAAgB,YAAoB;AACjD,WAAQ,cAAa,KAAK,iBAAiB,KAAK,MAAM,QAAQ;;AASzD,iBAAA,UAAA,WAAP,SAAgB,QAA+B;AAC7C,WAAO,YAAY,UAAU,OAAO,QAClC,KAAK,SAAS,SAAS,QAAQ;;AAG5B,iBAAA,UAAA,QAAP,SAAa,SAA2B;AACtC,QAAI,CAAC,QAAQ,IAAI;AACf,UAAI,OAAO,KAAK,SAAS,OAAO;AAG9B,eAAO;;AAET,gBAAO,SAAA,SAAA,IAAQ,UAAO,EAAE,IAAI;;AAE9B,QAAI;AAKF,QAAE,KAAK;AACP,aAAO,KAAK,eAAe,MAAM;;AAEjC,UAAI,CAAC,EAAE,KAAK,WAAW,QAAQ,cAAc,OAAO;AAClD,aAAK;;;;AAKJ,iBAAA,UAAA,QAAP,WAAA;AACE,SAAK,KAAK;AACV,SAAK,iBAAiB,KAAK;AAC3B,SAAK;AACL,WAAO,QAAQ;;AAGV,iBAAA,UAAA,mBAAP,SAAwB,YAAkB;AACxC,QAAM,oBAAoB,KAAK,eAAe,YAAY;AAC1D,QAAI,sBAAsB,KAAK,gBAAgB;AAC7C,WAAK,iBAAiB;AACtB,WAAK;;;AAMF,iBAAA,UAAA,qBAAP,SACE,aACA,cAA4B;AAF9B,QAAA,QAAA;AAIE,QAAM,UAAU,SAAC,OAAmB;AAC5B,UAAA,MAA2B,OAAzB,OAAI,IAAA,MAAE,iBAAc,IAAA;AAC5B,QAAE,MAAK;AACP,UAAI,OAAO;AACT,cAAK,OAAO,MAAK,iBAAiB;;AAEpC,UAAI;AACF,oBAAY;;AAEZ,UAAE,MAAK;AACP,cAAK,OAAO;AACZ,cAAK,iBAAiB;;;AAI1B,QAAI,4BAA4B;AAEhC,QAAI,OAAO,iBAAiB,UAAU;AAIpC,WAAK,iBAAiB,KAAK,eAAe,SAAS,cAAc;AACjE,kCAA4B;eACnB,iBAAiB,MAAM;AAMhC,cAAQ,KAAK;WACR;AAGL;;AAIF,SAAK,iBAAiB;;AAGjB,iBAAA,UAAA,oBAAP,SAAyB,UAAsB;AAC7C,QAAI,KAAK,aAAa;AACpB,UAAI,UAAS,KAAK,sBAAsB,IAAI;AAC5C,UAAI,CAAC,SAAQ;AACX,kBAAS,sBAAsB;AAC/B,aAAK,sBAAsB,IAAI,UAAU;AAIzC,aAAK,sBAAsB,IAAI,SAAQ;;AAEzC,aAAO;;AAET,WAAO;;AAGC,iBAAA,UAAA,mBAAV,SAA2B,2BAAmC;AAA9D,QAAA,QAAA;AACE,QAAI,CAAC,KAAK,SAAS;AACjB,WAAK,QAAQ,QAAQ,SAAA,GAAC;AAAI,eAAA,MAAK,oBAAoB,GAAG;;;;AAuClD,iBAAA,UAAA,iBAAR,SACE,GACA,2BAAkC;AASlC,SAAK,SAAS,MAAM;AAQpB,SAAK,SAAS;AAEd,QAAM,OAAO,KAAK,KAAU;MAC1B,OAAO,EAAE;MACT,WAAW,EAAE;MACb,YAAY,EAAE;;AAGhB,QAAI,EAAE,cAAc,2BAA2B;AAC7C,WAAK,4BAA4B;;AAGnC,MAAE,SAAS;;AAEf,SAAA;EA1YmC;;;AC4BnC,IAAA,aAAA,WAAA;AAME,uBAAY,KAKqB;QAJ/B,QAAK,IAAA,OACL,SAAM,IAAA,QACN,YAAS,IAAA,WACT,kBAAe,IAAA;AAEf,SAAK,QAAQ;AAEb,QAAI,QAAQ;AACV,WAAK,SAAS;;AAGhB,QAAI,WAAW;AACb,WAAK,aAAa;;AAGpB,QAAI,iBAAiB;AACnB,WAAK,mBAAmB;;;AAIrB,cAAA,UAAA,eAAP,SAAoB,WAAkC;AAAtD,QAAA,QAAA;AACE,SAAK,YAAY,KAAK,aAAa;AACnC,QAAI,MAAM,QAAQ,YAAY;AAC5B,gBAAU,QAAQ,SAAA,eAAa;AAC7B,cAAK,YAAY,UAAU,MAAK,WAAW;;WAExC;AACL,WAAK,YAAY,UAAU,KAAK,WAAW;;;AAIxC,cAAA,UAAA,eAAP,SAAoB,WAAkC;AACpD,SAAK,YAAY;AACjB,SAAK,aAAa;;AAGb,cAAA,UAAA,eAAP,WAAA;AACE,WAAO,KAAK,aAAa;;AAOd,cAAA,UAAA,eAAb,SAAiC,KAYhC;QAXC,WAAQ,IAAA,UACR,eAAY,IAAA,cACZ,UAAO,IAAA,SACP,YAAS,IAAA,WACT,KAAA,IAAA,wBAAA,yBAAsB,OAAA,SAAG,QAAK;;;AAQ9B,YAAI,UAAU;AACZ,iBAAA,CAAA,GAAO,KAAK,gBACV,UACA,aAAa,MACb,SACA,WACA,KAAK,iBACL,wBACA,KAAK,SAAA,aAAW;AAAI,mBAAA,SAAA,SAAA,IACjB,eAAY,EACf,MAAM,YAAY;;;AAItB,eAAA,CAAA,GAAO;;;;AAGF,cAAA,UAAA,qBAAP,SAA0B,iBAAgC;AACxD,SAAK,kBAAkB;;AAGlB,cAAA,UAAA,qBAAP,WAAA;AACE,WAAO,KAAK;;AAKP,cAAA,UAAA,cAAP,SAAmB,UAAsB;AACvC,QAAI,cAAc,CAAC,WAAW,WAAW;AACvC,UAAI,KAAK,WAAW;AAClB,eAAO;;;AAGX,WAAO;;AAIF,cAAA,UAAA,cAAP,SAAmB,UAAsB;AACvC,WAAO,6BAA6B;;AAG/B,cAAA,UAAA,iBAAP,SAAsB,SAA6B;AACzC,QAAA,QAAU,KAAI;AACtB,WAAA,SAAA,SAAA,IACK,UAAO;MACV;MAEA,aAAA,SAAY,KAAgB;AAC1B,eAAO,MAAM,SAAS;;;;AAQf,cAAA,UAAA,uBAAb,SACE,UACA,WACA,SAAY;AADZ,QAAA,cAAA,QAAA;AAAA,kBAAA;;AACA,QAAA,YAAA,QAAA;AAAA,gBAAA;;;;AAEA,YAAI,UAAU;AACZ,iBAAA,CAAA,GAAO,KAAK,gBACV,UACA,KAAK,wBAAwB,UAAU,cAAc,IACrD,KAAK,eAAe,UACpB,WACA,KAAK,SAAA,MAAI;AAAI,mBAAA,SAAA,SAAA,IACV,YACA,KAAK;;;AAIZ,eAAA,CAAA,GAAA,SAAA,IACK;;;;AAIA,cAAA,UAAA,uBAAP,SAA4B,UAAiB;AAC3C,QAAI,iBAAiB;AACrB,UAAM,UAAU;MACd,WAAW;QACT,OAAK,SAAC,MAAI;AACR,cAAI,KAAK,KAAK,UAAU,YAAY,KAAK,WAAW;AAClD,6BAAiB,KAAK,UAAU,KAC9B,SAAA,KAAG;AACD,qBAAA,IAAI,KAAK,UAAU,YACnB,IAAI,MAAM,SAAS,kBACnB,IAAI,MAAM,UAAU;;AAExB,gBAAI,gBAAgB;AAClB,qBAAO;;;;;;AAMjB,WAAO;;AAID,cAAA,UAAA,0BAAR,SACE,UACA,WAA+B;AAE/B,WAAO,KAAK,MAAM,KAAK;MACrB,OAAO,2BAA2B;MAClC;MACA,mBAAmB;MACnB,YAAY;OACX;;AAGS,cAAA,UAAA,kBAAd,SACE,UACA,WACA,SACA,WACA,iBACA,wBAAuC;AAHvC,QAAA,YAAA,QAAA;AAAA,gBAAA;;AACA,QAAA,cAAA,QAAA;AAAA,kBAAA;;AACA,QAAA,oBAAA,QAAA;AAAA,wBAAA,WAAA;AAAyC,eAAA;;;AACzC,QAAA,2BAAA,QAAA;AAAA,+BAAA;;;;;AAEM,yBAAiB,kBAAkB;AACnC,oBAAY,uBAAuB;AACnC,sBAAc,kBAAkB;AAEhC,8BAAuB,eAC1B;AAEG,+BAAuB,sBACzB,oBAAoB,OAAO,GAAG,gBAC9B,oBAAoB,MAAM,KAC1B;AAEE,cAAoB,MAAlB,QAAK,IAAA,OAAE,SAAM,IAAA;AACf,sBAA2B;UAC/B;UACA,SAAO,SAAA,SAAA,IACF,UAAO;YACV;YACA;;UAEF;UACA;UACA;UACA,mBAAmB;UACnB;;AAGF,eAAA,CAAA,GAAO,KAAK,oBACV,eAAe,cACf,WACA,aACA,KAAK,SAAA,SAAM;AAAI,iBAAC;YAChB,QAAM;YACN,mBAAmB,YAAY;;;;;;AAIrB,cAAA,UAAA,sBAAd,SACE,cACA,WACA,aAAwB;;;;;AAEhB,sBAAoC,YAAW,aAAlC,UAAuB,YAAW,SAAzB,YAAc,YAAW;AACjD,yBAA0B,CAAC;AAE3B,mBAAU,SAAO,WAAwB;AAAA,iBAAA,UAAA,OAAA,QAAA,QAAA,WAAA;;;AAC7C,kBAAI,CAAC,cAAc,WAAW,YAAY;AAExC,uBAAA,CAAA;;AAGF,kBAAI,QAAQ,YAAY;AACtB,uBAAA,CAAA,GAAO,KAAK,aAAa,WAAW,WAAW,aAAa,KAC1D,SAAA,aAAW;;AACT,sBAAI,OAAO,gBAAgB,aAAa;AACtC,mCAAe,KAAK,OAAA,IAClB,IAAC,uBAAuB,cAAa;;;;AAS/C,kBAAI,iBAAiB,YAAY;AAC/B,2BAAW;qBACN;AAEL,2BAAW,YAAY,UAAU,KAAK;AACtC,wBAAoB,UAAqB,UAAe,MAAS,UAAA,UAAA,uBAAA,UAAA,KAAA;;AAGnE,kBAAI,YAAY,SAAS,eAAe;AAChC,gCAAgB,SAAS,cAAc,KAAK;AAClD,oBAAI,YAAY,gBAAgB,WAAW,eAAe,UAAU;AAClE,yBAAA,CAAA,GAAO,KAAK,oBACV,SAAS,cACT,WACA,aACA,KAAK,SAAA,gBAAc;AACnB,mCAAe,KAAK;;;;;;;;AAM5B,eAAA,CAAA,GAAO,QAAQ,IAAI,aAAa,WAAW,IAAI,WAAU,KAAK,WAAA;AAC5D,iBAAO,eAAe;;;;;AAIZ,cAAA,UAAA,eAAd,SACE,OACA,WACA,aAAwB;;;;;AAEhB,oBAAc,YAAW;AAC3B,oBAAY,MAAM,KAAK;AACvB,2BAAmB,uBAAuB;AAC1C,oBAAY,cAAc;AAC1B,wBAAgB,UAAU,qBAAqB,UAAU;AAC3D,wBAAgB,QAAQ,QAAQ;AAMpC,YACE,CAAC,YAAY,0BACb,KAAK,qBAAqB,QAC1B;AACM,yBACJ,UAAU,cAAc,YAAY;AAChC,wBAAc,KAAK,aAAa,KAAK,UAAU;AACrD,cAAI,aAAa;AACT,sBAAU,YAAY,YAAY,YAAY;AACpD,gBAAI,SAAS;AACX,8BAAgB,QAAQ,QAGtB,UAAU,UAAU,KAAK,OAAO,SAAS;gBACvC;gBACA,yBAAyB,OAAO;gBAChC,YAAY;gBACZ,EAAE,OAAO,aAAa,YAAY;;;;;AAO5C,eAAA,CAAA,GAAO,cAAc,KAAK,SAAC,SAAsB;AAAtB,cAAA,YAAA,QAAA;AAAA,sBAAA;;AAGzB,cAAI,MAAM,YAAY;AACpB,kBAAM,WAAW,QAAQ,SAAA,WAAS;AAChC,kBAAI,UAAU,KAAK,UAAU,YAAY,UAAU,WAAW;AAC5D,0BAAU,UAAU,QAAQ,SAAA,KAAG;AAC7B,sBAAI,IAAI,KAAK,UAAU,QAAQ,IAAI,MAAM,SAAS,eAAe;AAC/D,gCAAY,kBAAkB,IAAI,MAAM,SAAS;;;;;;AAQ3D,cAAI,CAAC,MAAM,cAAc;AACvB,mBAAO;;AAKT,cAAI,WAAU,MAAM;AAElB,mBAAO;;AAGT,cAAI,MAAM,QAAQ,UAAS;AACzB,mBAAO,MAAK,wBAAwB,OAAO,SAAQ;;AAIrD,cAAI,MAAM,cAAc;AACtB,mBAAO,MAAK,oBACV,MAAM,cACN,SACA;;;;;;AAMA,cAAA,UAAA,0BAAR,SACE,OACA,SACA,aAAwB;AAH1B,QAAA,QAAA;AAKE,WAAO,QAAQ,IACb,QAAO,IAAI,SAAA,MAAI;AACb,UAAI,SAAS,MAAM;AACjB,eAAO;;AAIT,UAAI,MAAM,QAAQ,OAAO;AACvB,eAAO,MAAK,wBAAwB,OAAO,MAAM;;AAInD,UAAI,MAAM,cAAc;AACtB,eAAO,MAAK,oBAAoB,MAAM,cAAc,MAAM;;;;AAKpE,SAAA;;;;AC3aA,IAAM,0BAA0B,IAC9B,iBAAgB,UAAU;AAG5B,oCACE,OACA,YAAkC;AAElC,MAAM,WAAW,MAAM;AACvB,MAAI,OAAO,aAAa,YAAY;AAClC,UAAM,cAAc,WAAA;AAClB,8BAAwB,IACtB,OAKC,yBAAwB,IAAI,SAAU,KAAK;AAE9C,aAAO,SAAS,MAAM,MAAM;;;;AAKlC,6BAA6B,MAAe;AAC1C,MAAI,KAAK,kBAAkB;AACzB,iBAAa,KAAK;AAClB,SAAK,mBAAmB;;;AAgB5B,IAAA,YAAA,WAAA;AAWE,sBAAoB,OAAuB;AAAvB,SAAA,QAAA;AAVpB,SAAA,YAAY,IAAI;AAChB,SAAA,WAAgC;AAChC,SAAA,gBAAgB;AAChB,SAAA,gBAAgB,IAAI;AAKpB,SAAA,UAAU;AAwDF,SAAA,QAAiB;AAIjB,SAAA,OAAqC;AAmC7B,SAAA,kBAA+C;AAvF7D,QAAI,CAAC,wBAAwB,IAAI,QAAQ;AACvC,8BAAwB,IAAI,OAAO;AACnC,iCAA2B,OAAO;AAClC,iCAA2B,OAAO;AAClC,iCAA2B,OAAO;;;AAI/B,aAAA,UAAA,OAAP,SAAY,OASX;AACC,QAAI,gBAAgB,MAAM,iBAAiB,cAAc;AACzD,QAAI,KAAK,aACL,KAAK,kBAAkB,cAAc,WACrC,CAAC,MAAM,KAAK,WAAW,MAAM,YAAY;AAC3C,sBAAgB,cAAc;;AAGhC,QAAI,CAAC,MAAM,MAAM,WAAW,KAAK,YAAY;AAC3C,WAAK,OAAO;;AAGd,WAAO,OAAO,MAAM;MAClB,UAAU,MAAM;MAChB,WAAW,MAAM;MACjB,cAAc;MACd,eAAe,KAAK,iBAAiB;MACrC;;AAGF,QAAI,MAAM,iBAAiB;AACzB,WAAK,mBAAmB,MAAM;;AAGhC,QAAI,MAAM,eAAe;AACvB,WAAK,gBAAgB,MAAM;;AAG7B,WAAO;;AAST,aAAA,UAAA,QAAA,WAAA;AACE,wBAAoB;AACpB,SAAK,OAAO;AACZ,SAAK,QAAQ;;AAGf,aAAA,UAAA,UAAA,SAAQ,WAA0B;AAA1B,QAAA,cAAA,QAAA;AAAA,kBAAY,KAAK;;AACvB,QAAI,KAAK,QAAQ,MAAM,WAAW,KAAK,YAAY;AACjD,aAAO,KAAK;;AAGd,SAAK,YAAY,KAAK,YAAY;AAElC,WAAO,KAAK,OAAO,KAAK,MAAM,KAAK;MACjC,OAAO,KAAK;MACZ;MACA,mBAAmB;MACnB,YAAY;;;AAIhB,aAAA,UAAA,UAAA,SAAQ,MAAkC;AAA1C,QAAA,QAAA;AACE,QAAM,UAAU,KAAK;AACrB,SAAK,OAAO;AACZ,QAAI,CAAC,KAAK,SACL,SAAQ,KAAK,YAAa,YAAW,QAAQ,SAAS;AACzD,WAAK,QAAQ;AACb,UAAI,CAAC,KAAK,eAAe;AACvB,aAAK,gBAAgB,WAAW,WAAA;AAAM,iBAAA,MAAK;WAAU;;;;AAQ3D,aAAA,UAAA,qBAAA,SAAmB,IAA+B;AAAlD,QAAA,QAAA;AACE,QAAI,OAAO,KAAK;AAAiB;AAEjC,QAAI,KAAK,YAAY;AACnB,WAAK,UAAU,OAAO,KAAK;;AAG5B,SAAa,kBAAkB;AAEhC,QAAI,IAAI;AACN,SAAG,eAAe;AAClB,WAAK,UAAU,IAAI,KAAK,aAAa,WAAA;AAMnC,YAAI,MAAK,UAAU,2BAA2B;AAC5C,aAAG;eACE;AACL,aAAG;;;WAGF;AACL,aAAO,KAAK;;;AAIhB,aAAA,UAAA,SAAA,WAAA;AAAA,QAAA,QAAA;AACE,wBAAoB;AAEpB,QAAI,KAAK,gBAAgB;AACvB,WAAK,UAAU,QAAQ,SAAA,UAAQ;AAAI,eAAA,SAAS;;;AAG9C,SAAK,QAAQ;;AAGP,aAAA,UAAA,eAAR,WAAA;AACE,QAAI,CAAC,KAAK,SAAS,CAAC,KAAK,UAAU,MAAM;AACvC,aAAO;;AAGT,QAAI,yBAAyB,KAAK,kBAC9B,KAAK,iBAAiB;AAChB,UAAA,cAAgB,KAAK,gBAAgB,QAAO;AACpD,UAAI,gBAAgB,gBAChB,gBAAgB,qBAAqB;AACvC,eAAO;;;AAIX,WAAO;;AAGF,aAAA,UAAA,OAAP,WAAA;AACE,QAAI,CAAC,KAAK,SAAS;AACjB,WAAK,UAAU;AAGf,WAAK;AAEL,WAAK;AAGL,aAAO,KAAK;AAEZ,WAAK,cAAc,QAAQ,SAAA,KAAG;AAAI,eAAA,IAAI;;AAEtC,UAAM,KAAK,KAAK;AAChB,UAAI;AAAI,WAAG;;;AAMP,aAAA,UAAA,SAAR,WAAA;;AAIQ,aAAA,UAAA,cAAR,SAAoB,WAA0B;AAA9C,QAAA,QAAA;AAAoB,QAAA,cAAA,QAAA;AAAA,kBAAY,KAAK;;AACnC,QAAM,KAAK,KAAK;AAChB,QAAI,MAAM,GAAG,QAAQ,gBAAgB,YAAY;AAC/C;;AAEF,QAAI,CAAC,KAAK,aACN,KAAK,UAAU,UAAU,KAAK,YAC9B,CAAC,MAAM,WAAW,KAAK,UAAU,YAAY;AAC/C,WAAK;AACL,WAAK,SAAS,KAAK,MAAM,MAAM,KAAK,YAAY;QAC9C,OAAO,KAAK;QACZ;QACA,YAAY;QACZ,UAAU,SAAA,MAAI;AAAI,iBAAA,MAAK,QAAQ;;;;;AAW7B,aAAA,UAAA,cAAR,SACE,SACA,WAAyC;AAEjC,QAAA,YAAc,KAAI;AAC1B,WAAO,CACL,cAIA,UAAU,YAAY,wBAAwB,IAAI,KAAK,UACvD,MAAM,WAAW,UAAU,cAC3B,MAAM,QAAO,MAAM,UAAU,OAAO;;AAIjC,aAAA,UAAA,aAAP,SACE,SACA,SAIA,iBAAwB;AAN1B,QAAA,QAAA;AAQE,SAAK,gBAAgB,gBAAgB,QAAO,UAAU,QAAO,SAAS;AAItE,SAAK;AAEL,QAAI,QAAQ,gBAAgB,YAAY;AACtC,WAAK,OAAO,EAAE,QAAQ,QAAO,MAAM,UAAU;eAEpC,CAAC,KAAK,WAAW,iBAAiB;AAC3C,UAAI,kBAAkB,SAAQ,QAAQ,cAAc;AAKlD,aAAK,MAAM,mBAAmB,SAAA,OAAK;AACjC,cAAI,MAAK,YAAY,SAAQ,QAAQ,YAAY;AAC/C,kBAAM,WAAW;cACf,OAAO,MAAK;cACZ,MAAM,QAAO;cACb,WAAW,QAAQ;;AAGrB,kBAAK,YAAY;cACf,QAAM;cACN,WAAW,QAAQ;cACnB,SAAS,wBAAwB,IAAI,MAAK;;iBAEvC;AAiCL,gBAAI,MAAK,QAAQ,MAAK,KAAK,UAAU;AAGnC,sBAAO,OAAO,MAAK,KAAK;AACxB;;;AAMJ,cAAM,OAAO,MAAM,KAAQ;YACzB,OAAO,MAAK;YACZ,WAAW,QAAQ;YACnB,mBAAmB;YACnB,YAAY;;AAMd,cAAI,CAAC,MAAK,SAAS;AAGjB,kBAAK,YAAY,QAAQ;;AAQ3B,gBAAK,OAAO;AACZ,cAAI,KAAK,UAAU;AACjB,oBAAO,OAAO,KAAK;;;aAIlB;AACL,aAAK,YAAY;;;;AAKhB,aAAA,UAAA,YAAP,WAAA;AACE,SAAK,eAAe;AACpB,WAAO,KAAK,gBAAgB,cAAc;;AAGrC,aAAA,UAAA,YAAP,SAAiB,OAAkB;AACjC,SAAK,gBAAgB,cAAc;AACnC,SAAK,YAAY;AAEjB,SAAK;AAEL,QAAI,MAAM,eAAe;AACvB,WAAK,gBAAgB,MAAM;;AAG7B,QAAI,MAAM,cAAc;AACtB,WAAK,eAAe,MAAM;;AAG5B,WAAO;;AAEX,SAAA;;AAEM,2BACJ,SACA,aAAiC;AAAjC,MAAA,gBAAA,QAAA;AAAA,kBAAA;;AAEA,MAAM,eACJ,gBAAgB,YAChB,gBAAgB;AAClB,MAAI,kBAAkB,CAAC,sBAAsB;AAC7C,MAAI,CAAC,mBAAmB,gBAAgB,QAAO,MAAM;AACnD,sBAAkB;;AAEpB,SAAO;;;;AClZD,IAAA,kBAAmB,OAAO,UAAS;AAS3C,IAAA,eAAA,WAAA;AAuBE,yBAAY,KAkBX;QAjBC,QAAK,IAAA,OACL,OAAI,IAAA,MACJ,KAAA,IAAA,oBAAA,qBAAkB,OAAA,SAAG,QAAK,IAC1B,cAAW,IAAA,aACX,KAAA,IAAA,SAAA,UAAO,OAAA,SAAG,QAAK,IACf,KAAA,IAAA,iBAAA,kBAAe,OAAA,SAAG,KAAE,IACpB,aAAU,IAAA,YACV,yBAAsB,IAAA;AAxBhB,SAAA,kBAA0C;AAU1C,SAAA,UAAU,IAAI;AAId,SAAA,iBAAiB,IAAI;AA6XrB,SAAA,iBAAiB,IAAK,iBAAgB,UAAU;AAgIhD,SAAA,iBAAiB;AAKjB,SAAA,mBAAmB;AAKnB,SAAA,oBAAoB;AAgLpB,SAAA,0BAA0B,IAAI;AAlqBpC,SAAK,QAAQ;AACb,SAAK,OAAO;AACZ,SAAK,qBAAqB;AAC1B,SAAK,kBAAkB;AACvB,SAAK,aAAa,cAAc,IAAI,WAAW,EAAE;AACjD,SAAK,UAAU;AACf,SAAK,yBAAyB,CAAC,CAAC;AAChC,QAAK,KAAK,cAAc,aAAc;AACpC,WAAK,gBAAgB,OAAO,OAAO;;;AAQhC,gBAAA,UAAA,OAAP,WAAA;AAAA,QAAA,QAAA;AACE,SAAK,QAAQ,QAAQ,SAAC,OAAO,SAAO;AAClC,YAAK,qBAAqB;;AAG5B,SAAK,qBACH,QAAmB,IAAA,eAAA,MAAA,IACpB,eAAC;;AAGI,gBAAA,UAAA,uBAAR,SAA6B,OAAY;AACvC,SAAK,eAAe,QAAQ,SAAA,QAAM;AAAI,aAAA,OAAO;;AAC7C,SAAK,eAAe;;AAGT,gBAAA,UAAA,SAAb,SAAuB,KAWL;QAVhB,WAAQ,IAAA,UACR,YAAS,IAAA,WACT,qBAAkB,IAAA,oBAClB,gBAAa,IAAA,eACb,KAAA,IAAA,gBAAA,iBAAc,OAAA,SAAG,KAAE,IACnB,KAAA,IAAA,qBAAA,sBAAmB,OAAA,SAAG,QAAK,IACnB,oBAAiB,IAAA,QACzB,KAAA,IAAA,aAAA,cAAW,OAAA,SAAG,SAAM,IACpB,cAAW,IAAA,aACX,KAAA,IAAA,SAAA,UAAO,OAAA,SAAG,KAAE;;;;;;AAEZ,oBAEE,UAAA,UAAA,MAAA,UAAA,UAAA;AAGF,oBAC6B,UAAK,CAAA,eAChC,gBAAA,YAAA,MAAA,UAAA,CAAA,eAAA,gBAAA,YAAA;AAGI,yBAAa,KAAK;AACxB,uBAAW,KAAK,UAAU,UAAU;AAEpC,wBAAY,KAAK,aAAa,UAAU;iBAEpC,KAAK,UAAU,UAAU;AAAzB,qBAAA,CAAA,GAAA;AACU,mBAAA,CAAA,GAAM,KAAK,WAAW,qBAAqB,UAAU,WAAW;;AAA5E,wBAAY,GAAA;;;AAGR,iCACJ,KAAK,iBACJ,MAAK,cAAc,cAAc;cAChC;cACA;cACA,SAAS;cACT,OAAO;;AAGX,gBAAI,oBAAoB;AACtB,mBAAK,uBAA0B,oBAAoB;gBACjD;gBACA,UAAU;gBACV;gBACA;gBACA;gBACA,QAAQ;;;AAIZ,iBAAK;AAEC,oBAAO;AAEb,mBAAA,CAAA,GAAO,IAAI,QAAQ,SAAC,SAAS,QAAM;AACjC,kBAAI;AACJ,kBAAI;AAEJ,oBAAK,sBACH,UAAQ,SAAA,SAAA,IAEH,UAAO,EACV,uBAEF,WACA,OACA,UAAU;gBACV,MAAA,SAAK,SAAsB;AACzB,sBAAI,sBAAsB,YAAW,gBAAgB,QAAQ;AAC3D,4BAAQ,IAAI,YAAY;sBACtB,eAAe,QAAO;;AAExB;;AAGF,sBAAI,oBAAoB;AACtB,uCAAmB,UAAU;AAC7B,uCAAmB,QAAQ;;AAG7B,sBAAI,gBAAgB,YAAY;AAC9B,wBAAI;AACF,4BAAK,mBAAsB;wBACzB;wBACA,QAAM;wBACN,UAAU;wBACV;wBACA;wBACA;wBACA,QAAQ;;6BAEH,GAAP;AACA,8BAAQ,IAAI,YAAY;wBACtB,cAAc;;AAEhB;;;AAIJ,gCAAc;;gBAGhB,OAAA,SAAM,KAAU;AACd,sBAAI,oBAAoB;AACtB,uCAAmB,UAAU;AAC7B,uCAAmB,QAAQ;;AAE7B,sBAAI,oBAAoB;AACtB,0BAAK,MAAM,iBAAiB;;AAE9B,wBAAK;AACL,yBACE,IAAI,YAAY;oBACd,cAAc;;;gBAKpB,UAAA,WAAA;AACE,sBAAI,SAAS,oBAAoB;AAC/B,uCAAmB,UAAU;AAC7B,uCAAmB,QAAQ;;AAG7B,sBAAI,oBAAoB;AACtB,0BAAK,MAAM,iBAAiB;;AAG9B,wBAAK;AAEL,sBAAI,OAAO;AACT,2BAAO;AACP;;AAKF,sBAAI,OAAO,mBAAmB,YAAY;AACxC,qCAAiB,eAAe;;AAGlC,sBAAM,uBAEA;AAEN,sBAAI,gBAAgB,iBAAiB;AACnC,mCAAe,QAAQ,SAAA,cAAY;AACjC,0BAAI,OAAO,iBAAiB,UAAU;AACpC,8BAAK,QAAQ,QAAQ,SAAC,KAAmB;8BAAjB,kBAAe,IAAA;AACrC,8BAAI,mBACA,gBAAgB,kBAChB,gBAAgB,cAAc,cAAc;AAC9C,iDAAqB,KAAK,gBAAgB;;;6BAGzC;AACL,4BAAM,eAA6B;0BACjC,OAAO,aAAa;0BACpB,WAAW,aAAa;0BACxB,aAAa;;AAGf,4BAAI,aAAa,SAAS;AACxB,uCAAa,UAAU,aAAa;;AAGtC,6CAAqB,KAAK,MAAK,MAAM;;;;AAK3C,0BAAQ,IACN,sBAAsB,uBAAuB,IAC7C,KAAK,WAAA;AACL,wBACE,gBAAgB,YAChB,eACA,sBAAsB,cACtB;AACA,6BAAO,YAAY;;AAGrB,4BAAQ;qBACP;;;;;;;;AAMJ,gBAAA,UAAA,qBAAP,SACE,UAYA,OAAkB;AAbpB,QAAA,QAAA;AAaE,QAAA,UAAA,QAAA;AAAA,cAAQ,KAAK;;AAEb,QAAI,kBAAkB,SAAS,QAAQ,SAAS,cAAc;AAC5D,UAAM,gBAAoC,CAAC;QACzC,QAAQ,SAAS,OAAO;QACxB,QAAQ;QACR,OAAO,SAAS;QAChB,WAAW,SAAS;;AAGd,UAAA,kBAAkB,SAAQ;AAClC,UAAI,iBAAe;AACjB,aAAK,QAAQ,QAAQ,SAAC,KAAqB,SAAO;cAA1B,kBAAe,IAAA;AACrC,cAAM,YAAY,mBAAmB,gBAAgB;AACrD,cAAI,CAAC,aAAa,CAAC,gBAAe,KAAK,iBAAe,YAAY;AAChE;;AAEF,cAAM,UAAU,gBAAc;AACxB,cAAA,KAA0B,MAAK,QAAQ,IAAI,UAAzC,WAAQ,GAAA,UAAE,YAAS,GAAA;AAGrB,cAAA,KAA2C,MAAM,KAAY;YACjE,OAAO;YACP;YACA,mBAAmB;YACnB,YAAY;cAJE,qBAAkB,GAAA,QAAE,WAAQ,GAAA;AAO5C,cAAI,YAAY,oBAAoB;AAElC,gBAAM,kBAAkB,QAAQ,oBAAoB;cAClD,gBAAgB,SAAS;cACzB,WAAW,YAAY,iBAAiB,aAAa;cACrD,gBAAgB;;AAIlB,gBAAI,iBAAiB;AACnB,4BAAY,KAAK;gBACf,QAAQ;gBACR,QAAQ;gBACR,OAAO;gBACP;;;;;;AAOV,YAAM,mBAAmB,SAAA,GAAC;AACxB,sBAAY,QAAQ,SAAA,OAAK;AAAI,iBAAA,EAAE,MAAM;;AAK7B,YAAA,SAAW,SAAQ;AAC3B,YAAI,QAAQ;AACV,iBAAO,GAAG,SAAS;;SAEc;;;AAIlC,gBAAA,UAAA,yBAAP,SACE,oBACA,UAUC;AAZH,QAAA,QAAA;AAcE,QAAM,OAAO,OAAO,uBAAuB,aACvC,mBAAmB,SAAS,aAC5B;AAEJ,WAAO,KAAK,MAAM,4BAA4B,SAAA,OAAK;AACjD,UAAI;AACF,cAAK,mBAAkB,SAAA,SAAA,IAClB,WAAQ,EACX,QAAQ,EAAE,WACT;eACI,OAAP;AACA,QAAuB,UAAA,MAAA;;OAExB,SAAS;;AAGP,gBAAA,UAAA,aAAP,SACE,SACA,SACA,eAA6B;AAE7B,WAAO,KAAK,qBACV,SACA,SACA,eACA;;AAGG,gBAAA,UAAA,gBAAP,WAAA;AACE,QAAM,QAAyC,OAAO,OAAO;AAC7D,SAAK,QAAQ,QAAQ,SAAC,MAAM,SAAO;AACjC,YAAM,WAAW;QACf,WAAW,KAAK;QAChB,eAAe,KAAK;QACpB,cAAc,KAAK;QACnB,eAAe,KAAK;;;AAGxB,WAAO;;AAGF,gBAAA,UAAA,cAAP,SAAmB,SAAe;AAChC,QAAM,YAAY,KAAK,QAAQ,IAAI;AACnC,QAAI,WAAW;AACb,gBAAU,eAAe;AACzB,gBAAU,gBAAgB;;;AAgBvB,gBAAA,UAAA,YAAP,SAAiB,UAAsB;AAC7B,QAAA,iBAAmB,KAAI;AAE/B,QAAI,CAAC,eAAe,IAAI,WAAW;AACjC,UAAM,cAAc,KAAK,MAAM,kBAAkB;AACjD,UAAM,UAAU,sCACd,KAAK,MAAM,iBAAiB;AAE9B,UAAM,cAAc,KAAK,WAAW,YAAY;AAChD,UAAM,cAAc,WAAW,KAAK,WAAW,YAAY;AAE3D,UAAM,eAAa;QACjB,UAAU;QAGV,kBAAkB,iBAAiB;QACnC,oBAAoB,KAAK,WAAW,qBAAqB;QACzD;QACA;QACA,aAAa,iBACX,uBAAuB;;AAI3B,UAAM,MAAM,SAAC,KAAwB;AACnC,YAAI,OAAO,CAAC,eAAe,IAAI,MAAM;AACnC,yBAAe,IAAI,KAAK;;;AAM5B,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;;AAGN,WAAO,eAAe,IAAI;;AAGpB,gBAAA,UAAA,eAAR,SACE,UACA,WAA8B;AAE9B,WAAA,SAAA,SAAA,IACK,KAAK,UAAU,UAAU,cACzB;;AAIA,gBAAA,UAAA,aAAP,SACE,SAAyC;AAGzC,cAAO,SAAA,SAAA,IACF,UAAO,EACV,WAAW,KAAK,aACd,QAAQ,OACR,QAAQ;AAIZ,QAAI,OAAO,QAAQ,gCAAgC,aAAa;AAC9D,cAAQ,8BAA8B;;AAGxC,QAAM,YAAY,IAAI,UAAU,KAAK;AACrC,QAAM,aAAa,IAAI,gBAA+B;MACpD,cAAc;MACd;MACA;;AAGF,SAAK,QAAQ,IAAI,WAAW,SAAS;AAErC,cAAU,KAAK;MACb,UAAU,QAAQ;MAClB,iBAAiB;MACjB,WAAW,QAAQ;;AAGrB,WAAO;;AAGF,gBAAA,UAAA,QAAP,SACE,SAAmC;AADrC,QAAA,QAAA;AAGE,YAEE,UAAA,QAAA,OAAA,MAAA,UAAA,QAAA,OAAmE;AAIrE,YACyB,UACvB,QAAA,MAAA,SAAA,YAAA,MAAA,UACA,QAAA,MAAA,SAAA,YAAA;AAEF,YAEE,UAAA,CAAA,QAAA,mBAAA,MAAA,UAAwD,CACzD,QAAC,mBAAA;AAEF,YAEE,UAAA,CAAA,QAAA,cAAA,MAAA,UACA,CAAA,QAAA,cAAA;AAEF,QAAM,UAAU,KAAK;AACrB,WAAO,KAAK,WACV,SACA,SACA,QAAQ,WAAA;AAAM,aAAA,MAAK,UAAU;;;AAI1B,gBAAA,UAAA,kBAAP,WAAA;AACE,WAAO,OAAO,KAAK;;AAId,gBAAA,UAAA,oBAAP,WAAA;AACE,WAAO,KAAK;;AAIP,gBAAA,UAAA,qBAAP,WAAA;AACE,WAAO,OAAO,KAAK;;AAGd,gBAAA,UAAA,mBAAP,SAAwB,SAAe;AACrC,SAAK,4BAA4B;AACjC,SAAK;;AAGC,gBAAA,UAAA,8BAAR,SAAoC,SAAe;AACjD,QAAM,YAAY,KAAK,QAAQ,IAAI;AACnC,QAAI;AAAW,gBAAU;;AAGpB,gBAAA,UAAA,aAAP,WAAA;AAME,SAAK,qBAAqB,QACxB,IAAA,eAAA,MAAA,IAAA,eAAA;AAGF,SAAK,QAAQ,QAAQ,SAAA,WAAS;AAC5B,UAAI,UAAU,iBAAiB;AAG7B,kBAAU,gBAAgB,cAAc;aACnC;AACL,kBAAU;;;AAId,QAAI,KAAK,eAAe;AACtB,WAAK,gBAAgB,OAAO,OAAO;;AAIrC,WAAO,KAAK,MAAM;;AAGb,gBAAA,UAAA,aAAP,WAAA;AAAA,QAAA,QAAA;AAOE,WAAO,KAAK,aAAa,KAAK,WAAA;AAC5B,aAAO,MAAK;;;AAIT,gBAAA,UAAA,2BAAP,SACE,gBAA+B;AADjC,QAAA,QAAA;AACE,QAAA,mBAAA,QAAA;AAAA,uBAAA;;AAEA,QAAM,0BAA6D;AAEnE,SAAK,QAAQ,QAAQ,SAAC,KAAqB,SAAO;UAA1B,kBAAe,IAAA;AACrC,UAAI,mBAAmB,gBAAgB,gBAAgB;AACrD,YAAM,cAAc,gBAAgB,QAAQ;AAE5C,wBAAgB;AAChB,YACE,gBAAgB,gBACf,mBAAkB,gBAAgB,YACnC;AACA,kCAAwB,KAAK,gBAAgB;;AAG/C,cAAK,SAAS,SAAS,QAAQ;;;AAInC,SAAK;AAEL,WAAO,QAAQ,IAAI;;AAGd,gBAAA,UAAA,qBAAP,SAA0B,iBAA0C;AAClE,SAAK,SAAS,gBAAgB,SAAS,mBAAmB;;AAGrD,gBAAA,UAAA,2BAAP,SAAyC,KAMnB;AANtB,QAAA,QAAA;QACE,QAAK,IAAA,OACL,cAAW,IAAA,aACX,cAAW,IAAA,aACX,YAAS,IAAA,WACT,KAAA,IAAA,SAAA,UAAO,OAAA,SAAG,KAAE;AAEZ,YAAQ,KAAK,UAAU,OAAO;AAC9B,gBAAY,KAAK,aAAa,OAAO;AAErC,QAAM,iBAAiB,SAAC,YAA6B;AACnD,aAAA,MAAK,sBACH,OACA,SACA,YACA,OACA,IAAI,SAAA,SAAM;AACV,YAAI,gBAAgB,YAAY;AAG9B,cAAI,kBAAkB,SAAQ,cAAc;AAC1C,kBAAK,MAAM,MAAM;cACf;cACA,QAAQ,QAAO;cACf,QAAQ;cACR,WAAW;;;AAIf,gBAAK;;AAGP,YAAI,sBAAsB,UAAS;AACjC,gBAAM,IAAI,YAAY;YACpB,eAAe,QAAO;;;AAI1B,eAAO;;;AAGX,QAAI,KAAK,UAAU,OAAO,kBAAkB;AAC1C,UAAM,sBAAoB,KAAK,WAAW,qBACxC,OACA,WACA,SACA,KAAK;AAEP,aAAO,IAAI,8BAA2B,SAAA,UAAQ;AAC5C,YAAI,MAAqC;AACzC,4BAAkB,KAChB,SAAA,YAAU;AAAI,iBAAA,MAAM,WAAW,UAAU;WACzC,SAAS;AAEX,eAAO,WAAA;AAAM,iBAAA,OAAO,IAAI;;;;AAI5B,WAAO,eAAe;;AAGjB,gBAAA,UAAA,YAAP,SAAiB,SAAe;AAC9B,SAAK,qBAAqB;AAC1B,SAAK;;AAGC,gBAAA,UAAA,uBAAR,SAA6B,SAAe;AAC1C,SAAK,4BAA4B;AACjC,SAAK,YAAY;;AAGZ,gBAAA,UAAA,cAAP,SAAmB,SAAe;AAMhC,SAAK,eAAe,OAAO;AAC3B,SAAK,SAAS,SAAS;AACvB,SAAK,QAAQ,OAAO;;AAGf,gBAAA,UAAA,mBAAP,WAAA;AACE,QAAI,KAAK;AAAa,WAAK;AAC3B,SAAK,QAAQ,QAAQ,SAAA,MAAI;AAAI,aAAA,KAAK;;;AAG7B,gBAAA,UAAA,gBAAP,WAAA;AACE,WAAO,KAAK;;AAQN,gBAAA,UAAA,wBAAR,SACE,OACA,SACA,WACA,eAGyB;AAP3B,QAAA,QAAA;;AAIE,QAAA,kBAAA,QAAA;AAAA,sBAAA,OAEE,YAAO,QAAP,YAAO,SAAA,SAAP,QAAS,wBAAkB,QAAA,QAAA,SAAA,MAC3B,KAAK;;AAEP,QAAI;AAEI,QAAA,cAAgB,KAAK,UAAU,OAAM;AAC7C,QAAI,aAAa;AACT,UAAA,KAAoC,MAAlC,4BAAuB,GAAA,yBAAE,OAAI,GAAA;AAErC,UAAM,YAAY;QAChB,OAAO;QACP;QACA,eAAe,iBAAiB,gBAAgB;QAChD,SAAS,KAAK,eAAc,SAAA,SAAA,IACvB,UAAO,EACV,YAAY,CAAC;;AAIjB,gBAAU,UAAU;AAEpB,UAAI,eAAe;AACjB,YAAM,gBAAc,0BAAwB,IAAI,gBAAgB,IAAI;AACpE,kCAAwB,IAAI,aAAa;AAEzC,YAAM,YAAU,KAAK,UAAU;AAC/B,qBAAa,cAAY,IAAI;AAE7B,YAAI,CAAC,YAAY;AACf,cAAM,UAAU,IAAI,QAAQ;YAC1B,QAAQ,MAAM;;AAGhB,wBAAY,IAAI,WAAS,aAAa;AAEtC,kBAAQ,QAAQ,WAAA;AACd,gBAAI,cAAY,OAAO,cACnB,cAAY,OAAO,GAAG;AACxB,wCAAwB,OAAO;;;;aAKhC;AACL,qBAAa,IAAI,QAAQ;UACvB,QAAQ,MAAM;;;WAGb;AACL,mBAAa,IAAI,QAAQ;QACvB,8BAAW,GAAG,EAAE,MAAM;;AAExB,gBAAU,KAAK,eAAe;;AAGxB,QAAA,cAAgB,KAAK,UAAU,OAAM;AAC7C,QAAI,aAAa;AACf,mBAAa,SAAS,YAAY,SAAA,SAAM;AACtC,eAAO,MAAK,WAAW,aAAa;UAClC,UAAU;UACV,cAAc;UACd;UACA;;;;AAKN,WAAO;;AAGD,gBAAA,UAAA,qBAAR,SACE,WACA,iBACA,SAIkB;AAElB,QAAM,YAAY,UAAU,gBAAgB,KAAK;AAEjD,WAAO,SACL,KAAK,sBACH,UAAU,UACV,QAAQ,SACR,QAAQ,YAGV,SAAA,SAAM;AACJ,UAAM,YAAY,gBAAgB,QAAO;AAIzC,UAAI,aAAa,UAAU,eAAe;AACxC,YAAI,aAAa,QAAQ,gBAAgB,QAAQ;AAE/C,gBAAM,UAAU,UAAU,IAAI,YAAY;YACxC,eAAe,QAAO;;;AAG1B,kBAAU,WAAW,SAAQ,SAAS;AACtC,kBAAU;;AAGZ,UAAM,MAAgC;QACpC,MAAM,QAAO;QACb,SAAS;QACT,eAAe,UAAU,iBAAiB,cAAc;;AAG1D,UAAI,aAAa,QAAQ,gBAAgB,UAAU;AACjD,YAAI,SAAS,QAAO;;AAGtB,aAAO;OAGT,SAAA,cAAY;AACV,UAAM,QAAQ,cAAc,gBACxB,eACA,IAAI,YAAY,EAAE;AAGtB,UAAI,aAAa,UAAU,eAAe;AACxC,kBAAU,UAAU;;AAGtB,YAAM;;;AAKL,gBAAA,UAAA,uBAAP,SACE,SACA,SAIA,eAAqC;AANvC,QAAA,QAAA;AAME,QAAA,kBAAA,QAAA;AAAA,sBAAgB,cAAc;;AAE9B,QAAM,QAAQ,KAAK,UAAU,QAAQ,OAAO;AAC5C,QAAM,YAAY,KAAK,aAAa,OAAO,QAAQ;AACnD,QAAM,YAAY,KAAK,SAAS;AAChC,QAAM,mBAAmB,UAAU;AAGjC,QAAA,MAKE,QAAO,aALT,cAAW,QAAA,SAAG,gBAAsC,KACpD,KAIE,QAAO,aAJT,cAAW,OAAA,SAAG,SAAqB,IACnC,KAGE,QAAO,mBAHT,oBAAiB,OAAA,SAAG,QAAK,IACzB,KAEE,QAAO,6BAFT,8BAA2B,OAAA,SAAG,QAAK,IACnC,KACE,QAAO,SADT,UAAO,OAAA,SAAG,KAAE;AAGd,QAAM,kBACJ,gBAAgB,iBAChB,gBAAgB,uBAChB,gBAAgB,kBAChB,gBAAgB;AAElB,QAAI,mBACA,+BACA,OAAO,qBAAqB,YAC5B,qBAAqB,iBACrB,yBAAyB,gBAAgB;AAI3C,UAAI,gBAAgB,eAAe;AACjC,sBAAc;;AAEhB,0BAAoB;;AAGtB,QAAM,aAAa,OAAO,OAAO,IAAI,SAAS;MAC5C;MACA;MACA;MACA;MACA;MACA;MACA;;AAGF,QAAM,gBAAgB,SAAC,YAAgB;AAIrC,iBAAW,YAAY;AACvB,aAAO,MAAK,mBACV,WACA,YACA;;AAMJ,SAAK,eAAe,IAAI,SAAS,SAAA,QAAM;AAGrC,cAAQ,UAAU,KAAK,WAAA;AAAM,eAAA,QAAQ,OAAO;;;AAM9C,QAAM,UAAU,IAAI,QAQlB,KAAK,UAAU,WAAW,OAAO,mBAC7B,KAAK,WAAW,qBAChB,WAAW,OACX,WAAW,WACX,WAAW,SACX,KAAK,iBACL,cAAc,WAAW;AAG/B,YAAQ,QAAQ,WAAA;AACd,YAAK,eAAe,OAAO;AAEnB,UAAA,kBAAoB,QAAO;AACnC,UAAI,iBAAiB;AAInB,gBAAQ,kBAAkB;AAY1B,gBAAQ,cAAc,OAAO,oBAAoB,aAC7C,gBAAgB,KAAK,SAAS,QAAQ,eAAe,iBACrD;;;AAIR,WAAO;;AAGD,gBAAA,UAAA,qBAAR,SACE,WACA,SAIA,eAA4B;AAN9B,QAAA,QAAA;AASI,QAAA,QAME,QAAO,OALT,YAKE,QAAO,WAJT,cAIE,QAAO,aAHT,cAGE,QAAO,aAFT,oBAEE,QAAO,mBADT,UACE,QAAO;AAEX,cAAU,KAAK;MACb,UAAU;MACV;MACA;;AAGF,QAAM,YAAY,WAAA;AAAM,aAAA,UAAU,QAAQ;;AAE1C,QAAM,mBAAmB,SACvB,OACA,gBAAgE;AAAhE,UAAA,mBAAA,QAAA;AAAA,yBAAgB,UAAU,iBAAiB,cAAc;;AAEzD,UAAM,OAAO,MAAK;AAElB,UAAI,AACA,gBAAgB,MAAK,YACrB,CAAC,MAAM,MAAM,OACb,CAAC,mBAAmB;AACtB,QAAe,UACb,KAAK,kCAAmB,MAAK,QAAQ,IAAC,SAAO,GAC7C;AAAE,iBAAK,EAAA,KAAS,KAAA;WAAA,KAAA,OAAA,MAAA;;AAGpB,UAAM,WAAW,SAAC,OAAW;AAAK,eAAA,8BAAW,GAAG,SAAA,EAC9C,MAAI,OACJ,SAAS,yBAAyB,iBAClC,eAAa,kBACT,MAAK,WAAW,OAAO,EAAE,SAAS;;AAGxC,UAAI,MAAK,UAAU,OAAO,oBAAoB;AAC5C,eAAO,MAAK,WAAW,aAAa;UAClC,UAAU;UACV,cAAc,EAAE;UAChB;UACA;UACA,wBAAwB;WACvB,KAAK,SAAA,UAAQ;AAAI,iBAAA,SAAS,SAAS;;;AAGxC,aAAO,SAAS;;AAGlB,QAAM,kBAAkB,SAAC,iBAAwB;AAC/C,aAAA,MAAK,mBAAiC,WAAW,iBAAiB;QAChE;QACA;QACA;QACA;;;AAGJ,YAAQ;;WACM,eAAe;AAC3B,YAAM,OAAO;AAEb,YAAI,KAAK,UAAU;AACjB,iBAAO;YACL,iBAAiB,MAAM,UAAU;;;AAIrC,YAAI,mBAAmB;AACrB,iBAAO;YACL,iBAAiB;YACjB,gBAAgB;;;AAIpB,eAAO;UACL,gBAAgB;;;WAIf,qBAAqB;AACxB,YAAM,OAAO;AAEb,YAAI,KAAK,YAAY,mBAAmB;AACtC,iBAAO;YACL,iBAAiB;YACjB,gBAAgB;;;AAIpB,eAAO;UACL,gBAAgB;;;WAIf;AACH,eAAO;UACL,iBAAiB,aAAa,UAAU;;WAGvC;AACH,eAAO,CAAC,gBAAgB;WAErB;AACH,eAAO,CAAC,gBAAgB;WAErB;AACH,eAAO;;;AAIH,gBAAA,UAAA,WAAR,SAAiB,SAAe;AAC9B,QAAI,WAAW,CAAC,KAAK,QAAQ,IAAI,UAAU;AACzC,WAAK,QAAQ,IAAI,SAAS,IAAI,UAAU,KAAK;;AAE/C,WAAO,KAAK,QAAQ,IAAI;;AAGlB,gBAAA,UAAA,iBAAR,SAAuB,SAAY;AAAZ,QAAA,YAAA,QAAA;AAAA,gBAAA;;AACrB,QAAM,aAAa,KAAK,WAAW,eAAe;AAClD,WAAA,SAAA,SAAA,IACK,aAAU,EACb,iBAAiB,KAAK;;AAG5B,SAAA;;;;ACvmCA,IAAI,uBAAuB;AA0BrB,sBAGJ,UACA,SAAiB;AAEjB,SAAO,QAAQ,UAAU,SAAS,QAAQ,aAAa;IACrD,WAAS,SAAA,SAAA,IACJ,SAAS,YACT,QAAQ;;;AAWjB,IAAA,eAAA,WAAA;AAmDE,yBAAY,SAAyC;AAArD,QAAA,QAAA;AA7CO,SAAA,iBAAiC;AAKhC,SAAA,sBAAiD;AACjD,SAAA,sBAAiD;AAyCrD,QAAA,MAqBE,QAAO,KApBT,cAoBE,QAAO,aAnBT,UAmBE,QAAO,SAlBT,QAkBE,QAAO,OAjBT,MAiBE,QAAO,SAjBT,UAAO,QAAA,SAAG,QAAK,KACf,KAgBE,QAAO,oBAhBT,qBAAkB,OAAA,SAAG,IAAC,IACtB,KAeE,QAAO,mBAfT,oBAAiB,OAAA,SAIf,OAAO,WAAW,YAClB,CAAE,OAAe,qBACjB,OAAqC,IACvC,KAQE,QAAO,oBART,qBAAkB,OAAA,SAAG,OAAI,IACzB,kBAOE,QAAO,gBANT,KAME,QAAO,wBANT,yBAAsB,OAAA,SAAG,QAAK,IAC9B,YAKE,QAAO,WAJT,WAIE,QAAO,UAHT,kBAGE,QAAO,iBAFH,sBAEJ,QAAO,MADA,yBACP,QAAO;AAEL,QAAA,OAAS,QAAO;AAEtB,QAAI,CAAC,MAAM;AACT,aAAO,MACH,IAAI,SAAS,EAAE,KAAK,aAAa,aACjC,WAAW;;AAGjB,QAAI,CAAC,OAAO;AACV,YAAM,QACJ,IAAA,eAAA,KAAA,IAAA,eAAA;;AAMJ,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,wBAAwB,WAAW,qBAAqB;AAC7D,SAAK,qBAAqB;AAC1B,SAAK,iBAAiB,mBAAkB;AACxC,SAAK,WAAW;AAEhB,QAAI,oBAAoB;AACtB,iBACE,WAAA;AAAM,eAAC,MAAK,wBAAwB;SACpC;;AAIJ,SAAK,aAAa,KAAK,WAAW,KAAK;AACvC,SAAK,QAAQ,KAAK,MAAM,KAAK;AAC7B,SAAK,SAAS,KAAK,OAAO,KAAK;AAC/B,SAAK,aAAa,KAAK,WAAW,KAAK;AACvC,SAAK,2BAA2B,KAAK,yBAAyB,KAAK;AAEnE,QAAI,qBAAqB,OAAO,WAAW,UAAU;AAClD,aAAe,oBAAoB;;AAMtC,QAAI,CAAC,wBAAwB,MAAuC;AAClE,6BAAuB;AACvB,UACE,OAAO,WAAW,eAClB,OAAO,YACP,OAAO,QAAQ,OAAO,QACtB,CAAE,OAAe,iCACjB;AACA,YAAM,MAAM,OAAO;AACnB,YAAM,KAAK,OAAO,IAAI;AACtB,YAAI,MAAG;AACP,YAAI,OAAO,OAAO,UAAU;AAC1B,cAAI,GAAG,QAAQ,aAAa,IAAI;AAC9B,kBAAM;qBAEG,GAAG,QAAQ,cAAc,IAAI;AACtC,kBAAM;;;AAGV,YAAI,KAAK;AACP,oBAAU,IACR,uEACmB;;;;AAM3B,SAAK,UAAU;AAEf,SAAK,aAAa,IAAI,WAAW;MAC/B;MACA,QAAQ;MACR;MACA;;AAGF,SAAK,eAAe,IAAI,aAAa;MACnC,OAAO,KAAK;MACZ,MAAM,KAAK;MACX;MACA;MACA,iBAAiB;QACf,MAAM;QACN,SAAS;;MAEX,YAAY,KAAK;MACjB;MACA,aAAa,oBAAoB,WAAA;AAC/B,YAAI,MAAK,gBAAgB;AACvB,gBAAK,eAAe;YAClB,QAAQ;YACR,OAAO;cACL,SAAS,MAAK,aAAa;cAC3B,WAAW,MAAK,aAAa,iBAAiB;;YAEhD,2BAA2B,MAAK,MAAM,QAAQ;;;UAGhD;;;AAQD,gBAAA,UAAA,OAAP,WAAA;AACE,SAAK,aAAa;;AAsBb,gBAAA,UAAA,aAAP,SACE,SAAyC;AAEzC,QAAI,KAAK,eAAe,YAAY;AAClC,gBAAU,aAAa,KAAK,eAAe,YAAY;;AAIzD,QACE,KAAK,yBACJ,SAAQ,gBAAgB,kBACvB,QAAQ,gBAAgB,sBAC1B;AACA,gBAAO,SAAA,SAAA,IAAQ,UAAO,EAAE,aAAa;;AAGvC,WAAO,KAAK,aAAa,WAA0B;;AAY9C,gBAAA,UAAA,QAAP,SACE,SAAoC;AAEpC,QAAI,KAAK,eAAe,OAAO;AAC7B,gBAAU,aAAa,KAAK,eAAe,OAAO;;AAGpD,YACqD,UAAA,QACnD,gBAAA,qBAAA,MAAA,UAAA,QAAA,gBAA6E,qBAAA;AAM/E,QAAI,KAAK,yBAAyB,QAAQ,gBAAgB,gBAAgB;AACxE,gBAAO,SAAA,SAAA,IAAQ,UAAO,EAAE,aAAa;;AAGvC,WAAO,KAAK,aAAa,MAAqB;;AAUzC,gBAAA,UAAA,SAAP,SACE,SAAuC;AAEvC,QAAI,KAAK,eAAe,QAAQ;AAC9B,gBAAU,aAAa,KAAK,eAAe,QAAQ;;AAErD,WAAO,KAAK,aAAa,OAAU;;AAO9B,gBAAA,UAAA,YAAP,SACE,SAA2C;AAE3C,WAAO,KAAK,aAAa,yBAA4B;;AAYhD,gBAAA,UAAA,YAAP,SACE,SACA,YAA2B;AAA3B,QAAA,eAAA,QAAA;AAAA,mBAAA;;AAEA,WAAO,KAAK,MAAM,UAAyB,SAAS;;AAiB/C,gBAAA,UAAA,eAAP,SACE,SACA,YAA2B;AAA3B,QAAA,eAAA,QAAA;AAAA,mBAAA;;AAEA,WAAO,KAAK,MAAM,aAA4B,SAAS;;AAQlD,gBAAA,UAAA,aAAP,SACE,SAAuD;AAEvD,SAAK,MAAM,WAA8B;AACzC,SAAK,aAAa;;AAcb,gBAAA,UAAA,gBAAP,SACE,SAA0D;AAE1D,SAAK,MAAM,cAAiC;AAC5C,SAAK,aAAa;;AAGb,gBAAA,UAAA,0BAAP,SAA+B,IAAa;AAC1C,SAAK,iBAAiB;;AAGjB,gBAAA,UAAA,eAAP,SAAoB,SAAuB;AACzC,WAAO,QAAQ,KAAK,MAAM;;AAmBrB,gBAAA,UAAA,aAAP,WAAA;AAAA,QAAA,QAAA;AACE,WAAO,QAAQ,UACZ,KAAK,WAAA;AAAM,aAAA,MAAK,aAAa;OAC7B,KAAK,WAAA;AAAM,aAAA,QAAQ,IAAI,MAAK,oBAAoB,IAAI,SAAA,IAAE;AAAI,eAAA;;OAC1D,KAAK,WAAA;AAAM,aAAA,MAAK;;;AAOd,gBAAA,UAAA,aAAP,WAAA;AAAA,QAAA,QAAA;AACE,WAAO,QAAQ,UACZ,KAAK,WAAA;AAAM,aAAA,MAAK,aAAa;OAC7B,KAAK,WAAA;AAAM,aAAA,QAAQ,IAAI,MAAK,oBAAoB,IAAI,SAAA,IAAE;AAAI,eAAA;;;;AAQxD,gBAAA,UAAA,eAAP,SAAoB,IAAsB;AAA1C,QAAA,QAAA;AACE,SAAK,oBAAoB,KAAK;AAC9B,WAAO,WAAA;AACL,YAAK,sBAAsB,MAAK,oBAAoB,OAAO,SAAA,GAAC;AAAI,eAAA,MAAM;;;;AASnE,gBAAA,UAAA,eAAP,SAAoB,IAAsB;AAA1C,QAAA,QAAA;AACE,SAAK,oBAAoB,KAAK;AAC9B,WAAO,WAAA;AACL,YAAK,sBAAsB,MAAK,oBAAoB,OAAO,SAAA,GAAC;AAAI,eAAA,MAAM;;;;AAgBnE,gBAAA,UAAA,2BAAP,SACE,gBAAwB;AAExB,WAAO,KAAK,aAAa,yBAAyB;;AAM7C,gBAAA,UAAA,UAAP,SAAe,YAAoB;AACjC,WAAO,KAAK,MAAM,QAAQ;;AAUrB,gBAAA,UAAA,UAAP,SAAe,iBAA4B;AACzC,WAAO,KAAK,MAAM,QAAQ;;AAMrB,gBAAA,UAAA,eAAP,SAAoB,WAAkC;AACpD,SAAK,WAAW,aAAa;;AAMxB,gBAAA,UAAA,eAAP,SAAoB,WAAkC;AACpD,SAAK,WAAW,aAAa;;AAMxB,gBAAA,UAAA,eAAP,WAAA;AACE,WAAO,KAAK,WAAW;;AAMlB,gBAAA,UAAA,+BAAP,SAAoC,iBAAgC;AAClE,SAAK,WAAW,mBAAmB;;AAM9B,gBAAA,UAAA,UAAP,SAAe,SAAmB;AAChC,SAAK,OAAO,KAAK,aAAa,OAAO;;AAEzC,SAAA;;;;AC1jBA,qBAAkB;AAClB,IAAM;AAAA,EACF;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,IACA;;;ACjBJ,IAAM,WAAW,IAAI;AAGrB,IAAM,oBAAoB,IAAI;AAE9B,IAAI,wBAAwB;AAC5B,IAAI,gCAAgC;AAIpC,mBAAmB,QAAc;AAC/B,SAAO,OAAO,QAAQ,WAAW,KAAK;;AAGxC,yBAAyB,KAAa;AACpC,SAAO,UAAU,IAAI,OAAO,KAAK,UAAU,IAAI,OAAO,IAAI;;AAM5D,0BAA0B,KAAiB;AACzC,MAAM,WAAW,IAAI;AACrB,MAAM,cAAgC;AAEtC,MAAI,YAAY,QAAQ,SAAA,oBAAkB;AACxC,QAAI,mBAAmB,SAAS,sBAAsB;AACpD,UAAI,eAAe,mBAAmB,KAAK;AAC3C,UAAI,YAAY,gBAAgB,mBAAmB;AAGnD,UAAI,eAAe,kBAAkB,IAAI;AACzC,UAAI,gBAAgB,CAAC,aAAa,IAAI,YAAY;AAGhD,YAAI,uBAAuB;AACzB,kBAAQ,KAAK,iCAAiC,eAAe;;iBAItD,CAAC,cAAc;AACxB,0BAAkB,IAAI,cAAc,eAAe,IAAI;;AAGzD,mBAAa,IAAI;AAEjB,UAAI,CAAC,SAAS,IAAI,YAAY;AAC5B,iBAAS,IAAI;AACb,oBAAY,KAAK;;WAEd;AACL,kBAAY,KAAK;;;AAIrB,SAAA,UAAA,UAAA,IACK,MAAG,EACN;;AAIJ,kBAAkB,KAAiB;AACjC,MAAM,UAAU,IAAI,IAAyB,IAAI;AAEjD,UAAQ,QAAQ,SAAA,MAAI;AAClB,QAAI,KAAK;AAAK,aAAO,KAAK;AAC1B,WAAO,KAAK,MAAM,QAAQ,SAAA,KAAG;AAC3B,UAAM,QAAQ,KAAK;AACnB,UAAI,SAAS,OAAO,UAAU,UAAU;AACtC,gBAAQ,IAAI;;;;AAKlB,MAAM,MAAM,IAAI;AAChB,MAAI,KAAK;AACP,WAAO,IAAI;AACX,WAAO,IAAI;;AAGb,SAAO;;AAGT,uBAAuB,QAAc;AACnC,MAAI,WAAW,UAAU;AACzB,MAAI,CAAC,SAAS,IAAI,WAAW;AAC3B,QAAM,SAAS,MAAM,QAAQ;MAC3B;;AAEF,QAAI,CAAC,UAAU,OAAO,SAAS,YAAY;AACzC,YAAM,IAAI,MAAM;;AAElB,aAAS,IACP,UAGA,SAAS,iBAAiB;;AAG9B,SAAO,SAAS,IAAI;;AAIhB,aACJ,UAAoC;AACpC,MAAA,OAAA;WAAA,KAAA,GAAA,KAAA,UAAA,QAAA,MAAc;AAAd,SAAA,KAAA,KAAA,UAAA;;AAGA,MAAI,OAAO,aAAa,UAAU;AAChC,eAAW,CAAC;;AAGd,MAAI,UAAS,SAAS;AAEtB,OAAK,QAAQ,SAAC,KAAK,GAAC;AAClB,QAAI,OAAO,IAAI,SAAS,YAAY;AAClC,iBAAU,IAAI,IAAI,OAAO;WACpB;AACL,iBAAU;;AAEZ,eAAU,SAAS,IAAI;;AAGzB,SAAO,cAAc;;AAGjB,uBAAqB;AACzB,WAAS;AACT,oBAAkB;;AAGd,mCAAiC;AACrC,0BAAwB;;AAGpB,+CAA6C;AACjD,kCAAgC;;AAG5B,gDAA8C;AAClD,kCAAgC;;AAGlC,IAAM,SAAS;EACb;EACA;EACA;EACA;EACA;;AAGF,AAAA,UAAiB,OAAG;AAEhB,QAAA,MAKE,OAAM,KAJR,MAAA,cAIE,OAAM,aAHR,MAAA,0BAGE,OAAM,yBAFR,MAAA,sCAEE,OAAM,qCADR,MAAA,uCACE,OAAM;GAPK,OAAA,OAAG;AAUpB,IAAI,aAAU;AAEd,IAAA,cAAe;;;ACjFf,aAAa;",
"names": []
}