{"version":3,"file":"booksSlice-q4ErUwYf.js","sources":["../../../node_modules/@reduxjs/toolkit/node_modules/redux/dist/redux.mjs","../../../node_modules/immer/dist/immer.mjs","../../../node_modules/@reduxjs/toolkit/node_modules/redux-thunk/dist/redux-thunk.mjs","../../../node_modules/@reduxjs/toolkit/dist/redux-toolkit.modern.mjs","../../../app/javascript/hooks/fragments/useCurrentUser.ts","../../../app/javascript/icons/solid/chevron-down.svg","../../../app/javascript/hardcover-ui/components/Text.tsx","../../../app/javascript/store/ui/uiSlice.ts","../../../app/javascript/store/currentUser/currentUserSlice.ts","../../../node_modules/tslib/tslib.es6.mjs","../../../node_modules/ts-invariant/lib/invariant.js","../../../node_modules/@apollo/client/version.js","../../../node_modules/@apollo/client/utilities/globals/maybe.js","../../../node_modules/@apollo/client/utilities/globals/global.js","../../../node_modules/@apollo/client/utilities/common/makeUniqueId.js","../../../node_modules/@apollo/client/utilities/common/stringifyForDisplay.js","../../../node_modules/@apollo/client/utilities/globals/invariantWrappers.js","../../../node_modules/graphql/jsutils/devAssert.mjs","../../../node_modules/graphql/jsutils/isObjectLike.mjs","../../../node_modules/graphql/jsutils/invariant.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/ast.mjs","../../../node_modules/graphql/language/directiveLocation.mjs","../../../node_modules/graphql/language/kinds.mjs","../../../node_modules/graphql/language/characterClasses.mjs","../../../node_modules/graphql/language/blockString.mjs","../../../node_modules/graphql/language/tokenKind.mjs","../../../node_modules/graphql/language/lexer.mjs","../../../node_modules/graphql/jsutils/inspect.mjs","../../../node_modules/graphql/jsutils/instanceOf.mjs","../../../node_modules/graphql/language/source.mjs","../../../node_modules/graphql/language/parser.mjs","../../../node_modules/graphql/language/printString.mjs","../../../node_modules/graphql/language/visitor.mjs","../../../node_modules/graphql/language/printer.mjs","../../../node_modules/@apollo/client/utilities/graphql/directives.js","../../../node_modules/@wry/trie/lib/index.js","../../../node_modules/@apollo/client/utilities/common/canUse.js","../../../node_modules/@apollo/client/utilities/common/objects.js","../../../node_modules/@apollo/client/utilities/graphql/fragments.js","../../../node_modules/@wry/caches/lib/strong.js","../../../node_modules/@wry/caches/lib/weak.js","../../../node_modules/@apollo/client/utilities/caching/caches.js","../../../node_modules/@apollo/client/utilities/caching/sizes.js","../../../node_modules/@apollo/client/utilities/caching/getMemoryInternals.js","../../../node_modules/@apollo/client/utilities/common/canonicalStringify.js","../../../node_modules/@apollo/client/utilities/graphql/storeUtils.js","../../../node_modules/@apollo/client/utilities/graphql/getFromAST.js","../../../node_modules/optimism/node_modules/@wry/trie/lib/index.js","../../../node_modules/@wry/context/lib/slot.js","../../../node_modules/optimism/lib/context.js","../../../node_modules/optimism/lib/helpers.js","../../../node_modules/optimism/lib/entry.js","../../../node_modules/optimism/lib/dep.js","../../../node_modules/optimism/lib/index.js","../../../node_modules/@apollo/client/utilities/graphql/DocumentTransform.js","../../../node_modules/@apollo/client/utilities/graphql/print.js","../../../node_modules/@apollo/client/utilities/common/arrays.js","../../../node_modules/@apollo/client/utilities/graphql/transform.js","../../../node_modules/@apollo/client/utilities/common/mergeDeep.js","../../../node_modules/zen-observable-ts/module.js","../../../node_modules/@apollo/client/utilities/observables/Observable.js","../../../node_modules/@apollo/client/utilities/common/cloneDeep.js","../../../node_modules/@apollo/client/utilities/common/maybeDeepFreeze.js","../../../node_modules/@apollo/client/utilities/common/compact.js","../../../node_modules/@apollo/client/utilities/common/mergeOptions.js","../../../node_modules/@apollo/client/errors/index.js","../../../node_modules/@wry/equality/lib/index.js","../../../node_modules/@apollo/client/core/equalByQuery.js","../../../node_modules/@apollo/client/cache/core/cache.js","../../../node_modules/@apollo/client/cache/core/types/common.js","../../../node_modules/@apollo/client/cache/inmemory/helpers.js","../../../node_modules/@apollo/client/cache/inmemory/entityStore.js","../../../node_modules/@apollo/client/cache/inmemory/object-canon.js","../../../node_modules/@apollo/client/cache/inmemory/readFromStore.js","../../../node_modules/@apollo/client/cache/inmemory/reactiveVars.js","../../../node_modules/@apollo/client/cache/inmemory/key-extractor.js","../../../node_modules/@apollo/client/cache/inmemory/policies.js","../../../node_modules/@apollo/client/cache/inmemory/writeToStore.js","../../../node_modules/@apollo/client/cache/inmemory/inMemoryCache.js","../../../node_modules/@apollo/client/cache/inmemory/fragmentRegistry.js","../../../node_modules/@apollo/client/core/networkStatus.js","../../../node_modules/graphql-tag/lib/index.js","../../../app/javascript/queries/followed_lists/fragments/FollowedListFragment.ts","../../../app/javascript/queries/followed_prompts/fragments/FollowedPromptFragment.ts","../../../app/javascript/queries/followed_users/fragments/FollowedUserFragment.ts","../../../app/javascript/queries/user_books/fragments/UserBookStatusFragment.ts","../../../app/javascript/queries/users/fragments/OwnerFragment.ts","../../../app/javascript/queries/user_book_reads/fragments/UserBookReadFragment.ts","../../../app/javascript/queries/editions/fragments/EditionFragment.ts","../../../app/javascript/queries/publishers/fragments/PublisherFragment.ts","../../../app/javascript/queries/books/fragments/BookFragment.ts","../../../app/javascript/queries/books/fragments/BookSeriesFragment.ts","../../../app/javascript/queries/series/fragments/SeriesFragment.ts","../../../app/javascript/queries/authors/fragments/AuthorFragment.ts","../../../app/javascript/queries/users/fragments/UserBylineFragment.ts","../../../app/javascript/queries/lists/fragments/ListFragment.ts","../../../app/javascript/queries/listBooks/fragments/ListBookFragment.ts","../../../app/javascript/queries/likes/fragments/LikeFragment.ts","../../../app/javascript/queries/books/fragments/BookBylineFragment.ts","../../../app/javascript/queries/prompts/fragments/PromptFragment.ts","../../../app/javascript/queries/authors/fragments/AuthorBylineFragment.ts","../../../app/javascript/queries/prompts/fragments/PromptAnswerFragment.ts","../../../app/javascript/queries/users/fragments/UserInfoFragment.ts","../../../app/javascript/queries/collection_imports/fragments/CollectionImportResultFragment.ts","../../../app/javascript/queries/recommendations/fragments/MatchPercentageFragment.ts","../../../app/javascript/queries/journals/fragments/ReadingJournalSummaryFragment.ts","../../../app/javascript/queries/journals/fragments/ReadingJournalFragment.ts","../../../app/javascript/queries/user_books/fragments/UserBookFragment.ts","../../../app/javascript/queries/feed/fragments/ActivityFragment.ts","../../../app/javascript/queries/goals/fragments/GoalFragment.ts","../../../app/javascript/queries/notifications/fragments/NotificationFragment.ts","../../../app/javascript/queries/notifications/fragments/NotificationDeliveryFragment.ts","../../../app/javascript/queries/user_blocks/fragments/UserBlockFragment.ts","../../../app/javascript/queries/tags/fragments/TaggingFragment.ts","../../../app/javascript/queries/tags/fragments/TagFragment.ts","../../../app/javascript/queries/book_characters/fragments/BookCharacterFragment.ts","../../../app/javascript/queries/characters/fragments/CharacterFragment.ts","../../../app/javascript/queries/lists/fragments/ListBylineFragment.ts","../../../app/javascript/queries/images/fragments/ImageFragment.ts","../../../app/javascript/queries/book_mappings/fragments/BookMappingFragment.ts","../../../app/javascript/queries/editions/fragments/EditEditionFragment.ts","../../../app/javascript/queries/books/fragments/BookEditFragment.ts","../../../app/javascript/queries/collection_imports/fragments/CollectionImportFragment.ts","../../../app/javascript/queries/countries/fragments/CountryFragment.ts","../../../app/javascript/queries/languages/fragments/LanguageFragment.ts","../../../app/javascript/queries/notifications/fragments/NotificationTypeFragment.ts","../../../app/javascript/queries/user_books/fragments/UserBookFullFragment.ts","../../../app/javascript/queries/prompts/fragments/PromptBookSummaryFragment.ts","../../../app/javascript/queries/fragments.ts","../../../app/javascript/lib/apollo/cache.ts","../../../node_modules/rehackt/index.js","../../../node_modules/@apollo/client/react/context/ApolloContext.js","../../../node_modules/@apollo/client/react/hooks/useApolloClient.js","../../../app/javascript/hardcover-ui/theme/components/avatar.ts","../../../app/javascript/hardcover-ui/components/Avatar.tsx","../../../node_modules/sonner/dist/index.mjs","../../../app/javascript/hardcover-ui/components/TextLink.tsx","../../../app/javascript/store/bookButton/bookButtonSlice.ts","../../../app/javascript/store/books/booksSlice.ts"],"sourcesContent":["// src/utils/formatProdErrorMessage.ts\nfunction formatProdErrorMessage(code) {\n  return `Minified Redux error #${code}; visit https://redux.js.org/Errors?code=${code} for the full message or use the non-minified dev environment for full errors. `;\n}\n\n// src/utils/symbol-observable.ts\nvar $$observable = /* @__PURE__ */ (() => typeof Symbol === \"function\" && Symbol.observable || \"@@observable\")();\nvar symbol_observable_default = $$observable;\n\n// src/utils/actionTypes.ts\nvar randomString = () => Math.random().toString(36).substring(7).split(\"\").join(\".\");\nvar ActionTypes = {\n  INIT: `@@redux/INIT${/* @__PURE__ */ randomString()}`,\n  REPLACE: `@@redux/REPLACE${/* @__PURE__ */ randomString()}`,\n  PROBE_UNKNOWN_ACTION: () => `@@redux/PROBE_UNKNOWN_ACTION${randomString()}`\n};\nvar actionTypes_default = ActionTypes;\n\n// src/utils/isPlainObject.ts\nfunction isPlainObject(obj) {\n  if (typeof obj !== \"object\" || obj === null)\n    return false;\n  let proto = obj;\n  while (Object.getPrototypeOf(proto) !== null) {\n    proto = Object.getPrototypeOf(proto);\n  }\n  return Object.getPrototypeOf(obj) === proto || Object.getPrototypeOf(obj) === null;\n}\n\n// src/utils/kindOf.ts\nfunction miniKindOf(val) {\n  if (val === void 0)\n    return \"undefined\";\n  if (val === null)\n    return \"null\";\n  const type = typeof val;\n  switch (type) {\n    case \"boolean\":\n    case \"string\":\n    case \"number\":\n    case \"symbol\":\n    case \"function\": {\n      return type;\n    }\n  }\n  if (Array.isArray(val))\n    return \"array\";\n  if (isDate(val))\n    return \"date\";\n  if (isError(val))\n    return \"error\";\n  const constructorName = ctorName(val);\n  switch (constructorName) {\n    case \"Symbol\":\n    case \"Promise\":\n    case \"WeakMap\":\n    case \"WeakSet\":\n    case \"Map\":\n    case \"Set\":\n      return constructorName;\n  }\n  return Object.prototype.toString.call(val).slice(8, -1).toLowerCase().replace(/\\s/g, \"\");\n}\nfunction ctorName(val) {\n  return typeof val.constructor === \"function\" ? val.constructor.name : null;\n}\nfunction isError(val) {\n  return val instanceof Error || typeof val.message === \"string\" && val.constructor && typeof val.constructor.stackTraceLimit === \"number\";\n}\nfunction isDate(val) {\n  if (val instanceof Date)\n    return true;\n  return typeof val.toDateString === \"function\" && typeof val.getDate === \"function\" && typeof val.setDate === \"function\";\n}\nfunction kindOf(val) {\n  let typeOfVal = typeof val;\n  if (process.env.NODE_ENV !== \"production\") {\n    typeOfVal = miniKindOf(val);\n  }\n  return typeOfVal;\n}\n\n// src/createStore.ts\nfunction createStore(reducer, preloadedState, enhancer) {\n  if (typeof reducer !== \"function\") {\n    throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(2) : `Expected the root reducer to be a function. Instead, received: '${kindOf(reducer)}'`);\n  }\n  if (typeof preloadedState === \"function\" && typeof enhancer === \"function\" || typeof enhancer === \"function\" && typeof arguments[3] === \"function\") {\n    throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(0) : \"It looks like you are passing several store enhancers to createStore(). This is not supported. Instead, compose them together to a single function. See https://redux.js.org/tutorials/fundamentals/part-4-store#creating-a-store-with-enhancers for an example.\");\n  }\n  if (typeof preloadedState === \"function\" && typeof enhancer === \"undefined\") {\n    enhancer = preloadedState;\n    preloadedState = void 0;\n  }\n  if (typeof enhancer !== \"undefined\") {\n    if (typeof enhancer !== \"function\") {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(1) : `Expected the enhancer to be a function. Instead, received: '${kindOf(enhancer)}'`);\n    }\n    return enhancer(createStore)(reducer, preloadedState);\n  }\n  let currentReducer = reducer;\n  let currentState = preloadedState;\n  let currentListeners = /* @__PURE__ */ new Map();\n  let nextListeners = currentListeners;\n  let listenerIdCounter = 0;\n  let isDispatching = false;\n  function ensureCanMutateNextListeners() {\n    if (nextListeners === currentListeners) {\n      nextListeners = /* @__PURE__ */ new Map();\n      currentListeners.forEach((listener, key) => {\n        nextListeners.set(key, listener);\n      });\n    }\n  }\n  function getState() {\n    if (isDispatching) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(3) : \"You may not call store.getState() while the reducer is executing. The reducer has already received the state as an argument. Pass it down from the top reducer instead of reading it from the store.\");\n    }\n    return currentState;\n  }\n  function subscribe(listener) {\n    if (typeof listener !== \"function\") {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(4) : `Expected the listener to be a function. Instead, received: '${kindOf(listener)}'`);\n    }\n    if (isDispatching) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(5) : \"You may not call store.subscribe() while the reducer is executing. If you would like to be notified after the store has been updated, subscribe from a component and invoke store.getState() in the callback to access the latest state. See https://redux.js.org/api/store#subscribelistener for more details.\");\n    }\n    let isSubscribed = true;\n    ensureCanMutateNextListeners();\n    const listenerId = listenerIdCounter++;\n    nextListeners.set(listenerId, listener);\n    return function unsubscribe() {\n      if (!isSubscribed) {\n        return;\n      }\n      if (isDispatching) {\n        throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(6) : \"You may not unsubscribe from a store listener while the reducer is executing. See https://redux.js.org/api/store#subscribelistener for more details.\");\n      }\n      isSubscribed = false;\n      ensureCanMutateNextListeners();\n      nextListeners.delete(listenerId);\n      currentListeners = null;\n    };\n  }\n  function dispatch(action) {\n    if (!isPlainObject(action)) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(7) : `Actions must be plain objects. Instead, the actual type was: '${kindOf(action)}'. You may need to add middleware to your store setup to handle dispatching other values, such as 'redux-thunk' to handle dispatching functions. See https://redux.js.org/tutorials/fundamentals/part-4-store#middleware and https://redux.js.org/tutorials/fundamentals/part-6-async-logic#using-the-redux-thunk-middleware for examples.`);\n    }\n    if (typeof action.type === \"undefined\") {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(8) : 'Actions may not have an undefined \"type\" property. You may have misspelled an action type string constant.');\n    }\n    if (typeof action.type !== \"string\") {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(17) : `Action \"type\" property must be a string. Instead, the actual type was: '${kindOf(action.type)}'. Value was: '${action.type}' (stringified)`);\n    }\n    if (isDispatching) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(9) : \"Reducers may not dispatch actions.\");\n    }\n    try {\n      isDispatching = true;\n      currentState = currentReducer(currentState, action);\n    } finally {\n      isDispatching = false;\n    }\n    const listeners = currentListeners = nextListeners;\n    listeners.forEach((listener) => {\n      listener();\n    });\n    return action;\n  }\n  function replaceReducer(nextReducer) {\n    if (typeof nextReducer !== \"function\") {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(10) : `Expected the nextReducer to be a function. Instead, received: '${kindOf(nextReducer)}`);\n    }\n    currentReducer = nextReducer;\n    dispatch({\n      type: actionTypes_default.REPLACE\n    });\n  }\n  function observable() {\n    const outerSubscribe = subscribe;\n    return {\n      /**\n       * The minimal observable subscription method.\n       * @param observer Any object that can be used as an observer.\n       * The observer object should have a `next` method.\n       * @returns An object with an `unsubscribe` method that can\n       * be used to unsubscribe the observable from the store, and prevent further\n       * emission of values from the observable.\n       */\n      subscribe(observer) {\n        if (typeof observer !== \"object\" || observer === null) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(11) : `Expected the observer to be an object. Instead, received: '${kindOf(observer)}'`);\n        }\n        function observeState() {\n          const observerAsObserver = observer;\n          if (observerAsObserver.next) {\n            observerAsObserver.next(getState());\n          }\n        }\n        observeState();\n        const unsubscribe = outerSubscribe(observeState);\n        return {\n          unsubscribe\n        };\n      },\n      [symbol_observable_default]() {\n        return this;\n      }\n    };\n  }\n  dispatch({\n    type: actionTypes_default.INIT\n  });\n  const store = {\n    dispatch,\n    subscribe,\n    getState,\n    replaceReducer,\n    [symbol_observable_default]: observable\n  };\n  return store;\n}\nfunction legacy_createStore(reducer, preloadedState, enhancer) {\n  return createStore(reducer, preloadedState, enhancer);\n}\n\n// src/utils/warning.ts\nfunction warning(message) {\n  if (typeof console !== \"undefined\" && typeof console.error === \"function\") {\n    console.error(message);\n  }\n  try {\n    throw new Error(message);\n  } catch (e) {\n  }\n}\n\n// src/combineReducers.ts\nfunction getUnexpectedStateShapeWarningMessage(inputState, reducers, action, unexpectedKeyCache) {\n  const reducerKeys = Object.keys(reducers);\n  const argumentName = action && action.type === actionTypes_default.INIT ? \"preloadedState argument passed to createStore\" : \"previous state received by the reducer\";\n  if (reducerKeys.length === 0) {\n    return \"Store does not have a valid reducer. Make sure the argument passed to combineReducers is an object whose values are reducers.\";\n  }\n  if (!isPlainObject(inputState)) {\n    return `The ${argumentName} has unexpected type of \"${kindOf(inputState)}\". Expected argument to be an object with the following keys: \"${reducerKeys.join('\", \"')}\"`;\n  }\n  const unexpectedKeys = Object.keys(inputState).filter((key) => !reducers.hasOwnProperty(key) && !unexpectedKeyCache[key]);\n  unexpectedKeys.forEach((key) => {\n    unexpectedKeyCache[key] = true;\n  });\n  if (action && action.type === actionTypes_default.REPLACE)\n    return;\n  if (unexpectedKeys.length > 0) {\n    return `Unexpected ${unexpectedKeys.length > 1 ? \"keys\" : \"key\"} \"${unexpectedKeys.join('\", \"')}\" found in ${argumentName}. Expected to find one of the known reducer keys instead: \"${reducerKeys.join('\", \"')}\". Unexpected keys will be ignored.`;\n  }\n}\nfunction assertReducerShape(reducers) {\n  Object.keys(reducers).forEach((key) => {\n    const reducer = reducers[key];\n    const initialState = reducer(void 0, {\n      type: actionTypes_default.INIT\n    });\n    if (typeof initialState === \"undefined\") {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(12) : `The slice reducer for key \"${key}\" returned undefined during initialization. If the state passed to the reducer is undefined, you must explicitly return the initial state. The initial state may not be undefined. If you don't want to set a value for this reducer, you can use null instead of undefined.`);\n    }\n    if (typeof reducer(void 0, {\n      type: actionTypes_default.PROBE_UNKNOWN_ACTION()\n    }) === \"undefined\") {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(13) : `The slice reducer for key \"${key}\" returned undefined when probed with a random type. Don't try to handle '${actionTypes_default.INIT}' or other actions in \"redux/*\" namespace. They are considered private. Instead, you must return the current state for any unknown actions, unless it is undefined, in which case you must return the initial state, regardless of the action type. The initial state may not be undefined, but can be null.`);\n    }\n  });\n}\nfunction combineReducers(reducers) {\n  const reducerKeys = Object.keys(reducers);\n  const finalReducers = {};\n  for (let i = 0; i < reducerKeys.length; i++) {\n    const key = reducerKeys[i];\n    if (process.env.NODE_ENV !== \"production\") {\n      if (typeof reducers[key] === \"undefined\") {\n        warning(`No reducer provided for key \"${key}\"`);\n      }\n    }\n    if (typeof reducers[key] === \"function\") {\n      finalReducers[key] = reducers[key];\n    }\n  }\n  const finalReducerKeys = Object.keys(finalReducers);\n  let unexpectedKeyCache;\n  if (process.env.NODE_ENV !== \"production\") {\n    unexpectedKeyCache = {};\n  }\n  let shapeAssertionError;\n  try {\n    assertReducerShape(finalReducers);\n  } catch (e) {\n    shapeAssertionError = e;\n  }\n  return function combination(state = {}, action) {\n    if (shapeAssertionError) {\n      throw shapeAssertionError;\n    }\n    if (process.env.NODE_ENV !== \"production\") {\n      const warningMessage = getUnexpectedStateShapeWarningMessage(state, finalReducers, action, unexpectedKeyCache);\n      if (warningMessage) {\n        warning(warningMessage);\n      }\n    }\n    let hasChanged = false;\n    const nextState = {};\n    for (let i = 0; i < finalReducerKeys.length; i++) {\n      const key = finalReducerKeys[i];\n      const reducer = finalReducers[key];\n      const previousStateForKey = state[key];\n      const nextStateForKey = reducer(previousStateForKey, action);\n      if (typeof nextStateForKey === \"undefined\") {\n        const actionType = action && action.type;\n        throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(14) : `When called with an action of type ${actionType ? `\"${String(actionType)}\"` : \"(unknown type)\"}, the slice reducer for key \"${key}\" returned undefined. To ignore an action, you must explicitly return the previous state. If you want this reducer to hold no value, you can return null instead of undefined.`);\n      }\n      nextState[key] = nextStateForKey;\n      hasChanged = hasChanged || nextStateForKey !== previousStateForKey;\n    }\n    hasChanged = hasChanged || finalReducerKeys.length !== Object.keys(state).length;\n    return hasChanged ? nextState : state;\n  };\n}\n\n// src/bindActionCreators.ts\nfunction bindActionCreator(actionCreator, dispatch) {\n  return function(...args) {\n    return dispatch(actionCreator.apply(this, args));\n  };\n}\nfunction bindActionCreators(actionCreators, dispatch) {\n  if (typeof actionCreators === \"function\") {\n    return bindActionCreator(actionCreators, dispatch);\n  }\n  if (typeof actionCreators !== \"object\" || actionCreators === null) {\n    throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(16) : `bindActionCreators expected an object or a function, but instead received: '${kindOf(actionCreators)}'. Did you write \"import ActionCreators from\" instead of \"import * as ActionCreators from\"?`);\n  }\n  const boundActionCreators = {};\n  for (const key in actionCreators) {\n    const actionCreator = actionCreators[key];\n    if (typeof actionCreator === \"function\") {\n      boundActionCreators[key] = bindActionCreator(actionCreator, dispatch);\n    }\n  }\n  return boundActionCreators;\n}\n\n// src/compose.ts\nfunction compose(...funcs) {\n  if (funcs.length === 0) {\n    return (arg) => arg;\n  }\n  if (funcs.length === 1) {\n    return funcs[0];\n  }\n  return funcs.reduce((a, b) => (...args) => a(b(...args)));\n}\n\n// src/applyMiddleware.ts\nfunction applyMiddleware(...middlewares) {\n  return (createStore2) => (reducer, preloadedState) => {\n    const store = createStore2(reducer, preloadedState);\n    let dispatch = () => {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(15) : \"Dispatching while constructing your middleware is not allowed. Other middleware would not be applied to this dispatch.\");\n    };\n    const middlewareAPI = {\n      getState: store.getState,\n      dispatch: (action, ...args) => dispatch(action, ...args)\n    };\n    const chain = middlewares.map((middleware) => middleware(middlewareAPI));\n    dispatch = compose(...chain)(store.dispatch);\n    return {\n      ...store,\n      dispatch\n    };\n  };\n}\n\n// src/utils/isAction.ts\nfunction isAction(action) {\n  return isPlainObject(action) && \"type\" in action && typeof action.type === \"string\";\n}\nexport {\n  actionTypes_default as __DO_NOT_USE__ActionTypes,\n  applyMiddleware,\n  bindActionCreators,\n  combineReducers,\n  compose,\n  createStore,\n  isAction,\n  isPlainObject,\n  legacy_createStore\n};\n//# sourceMappingURL=redux.mjs.map","// src/utils/env.ts\nvar NOTHING = Symbol.for(\"immer-nothing\");\nvar DRAFTABLE = Symbol.for(\"immer-draftable\");\nvar DRAFT_STATE = Symbol.for(\"immer-state\");\n\n// src/utils/errors.ts\nvar errors = process.env.NODE_ENV !== \"production\" ? [\n  // All error codes, starting by 0:\n  function(plugin) {\n    return `The plugin for '${plugin}' has not been loaded into Immer. To enable the plugin, import and call \\`enable${plugin}()\\` when initializing your application.`;\n  },\n  function(thing) {\n    return `produce can only be called on things that are draftable: plain objects, arrays, Map, Set or classes that are marked with '[immerable]: true'. Got '${thing}'`;\n  },\n  \"This object has been frozen and should not be mutated\",\n  function(data) {\n    return \"Cannot use a proxy that has been revoked. Did you pass an object from inside an immer function to an async process? \" + data;\n  },\n  \"An immer producer returned a new value *and* modified its draft. Either return a new value *or* modify the draft.\",\n  \"Immer forbids circular references\",\n  \"The first or second argument to `produce` must be a function\",\n  \"The third argument to `produce` must be a function or undefined\",\n  \"First argument to `createDraft` must be a plain object, an array, or an immerable object\",\n  \"First argument to `finishDraft` must be a draft returned by `createDraft`\",\n  function(thing) {\n    return `'current' expects a draft, got: ${thing}`;\n  },\n  \"Object.defineProperty() cannot be used on an Immer draft\",\n  \"Object.setPrototypeOf() cannot be used on an Immer draft\",\n  \"Immer only supports deleting array indices\",\n  \"Immer only supports setting array indices and the 'length' property\",\n  function(thing) {\n    return `'original' expects a draft, got: ${thing}`;\n  }\n  // Note: if more errors are added, the errorOffset in Patches.ts should be increased\n  // See Patches.ts for additional errors\n] : [];\nfunction die(error, ...args) {\n  if (process.env.NODE_ENV !== \"production\") {\n    const e = errors[error];\n    const msg = typeof e === \"function\" ? e.apply(null, args) : e;\n    throw new Error(`[Immer] ${msg}`);\n  }\n  throw new Error(\n    `[Immer] minified error nr: ${error}. Full error at: https://bit.ly/3cXEKWf`\n  );\n}\n\n// src/utils/common.ts\nvar getPrototypeOf = Object.getPrototypeOf;\nfunction isDraft(value) {\n  return !!value && !!value[DRAFT_STATE];\n}\nfunction isDraftable(value) {\n  if (!value)\n    return false;\n  return isPlainObject(value) || Array.isArray(value) || !!value[DRAFTABLE] || !!value.constructor?.[DRAFTABLE] || isMap(value) || isSet(value);\n}\nvar objectCtorString = Object.prototype.constructor.toString();\nfunction isPlainObject(value) {\n  if (!value || typeof value !== \"object\")\n    return false;\n  const proto = getPrototypeOf(value);\n  if (proto === null) {\n    return true;\n  }\n  const Ctor = Object.hasOwnProperty.call(proto, \"constructor\") && proto.constructor;\n  if (Ctor === Object)\n    return true;\n  return typeof Ctor == \"function\" && Function.toString.call(Ctor) === objectCtorString;\n}\nfunction original(value) {\n  if (!isDraft(value))\n    die(15, value);\n  return value[DRAFT_STATE].base_;\n}\nfunction each(obj, iter) {\n  if (getArchtype(obj) === 0 /* Object */) {\n    Reflect.ownKeys(obj).forEach((key) => {\n      iter(key, obj[key], obj);\n    });\n  } else {\n    obj.forEach((entry, index) => iter(index, entry, obj));\n  }\n}\nfunction getArchtype(thing) {\n  const state = thing[DRAFT_STATE];\n  return state ? state.type_ : Array.isArray(thing) ? 1 /* Array */ : isMap(thing) ? 2 /* Map */ : isSet(thing) ? 3 /* Set */ : 0 /* Object */;\n}\nfunction has(thing, prop) {\n  return getArchtype(thing) === 2 /* Map */ ? thing.has(prop) : Object.prototype.hasOwnProperty.call(thing, prop);\n}\nfunction get(thing, prop) {\n  return getArchtype(thing) === 2 /* Map */ ? thing.get(prop) : thing[prop];\n}\nfunction set(thing, propOrOldValue, value) {\n  const t = getArchtype(thing);\n  if (t === 2 /* Map */)\n    thing.set(propOrOldValue, value);\n  else if (t === 3 /* Set */) {\n    thing.add(value);\n  } else\n    thing[propOrOldValue] = value;\n}\nfunction is(x, y) {\n  if (x === y) {\n    return x !== 0 || 1 / x === 1 / y;\n  } else {\n    return x !== x && y !== y;\n  }\n}\nfunction isMap(target) {\n  return target instanceof Map;\n}\nfunction isSet(target) {\n  return target instanceof Set;\n}\nfunction latest(state) {\n  return state.copy_ || state.base_;\n}\nfunction shallowCopy(base, strict) {\n  if (isMap(base)) {\n    return new Map(base);\n  }\n  if (isSet(base)) {\n    return new Set(base);\n  }\n  if (Array.isArray(base))\n    return Array.prototype.slice.call(base);\n  const isPlain = isPlainObject(base);\n  if (strict === true || strict === \"class_only\" && !isPlain) {\n    const descriptors = Object.getOwnPropertyDescriptors(base);\n    delete descriptors[DRAFT_STATE];\n    let keys = Reflect.ownKeys(descriptors);\n    for (let i = 0; i < keys.length; i++) {\n      const key = keys[i];\n      const desc = descriptors[key];\n      if (desc.writable === false) {\n        desc.writable = true;\n        desc.configurable = true;\n      }\n      if (desc.get || desc.set)\n        descriptors[key] = {\n          configurable: true,\n          writable: true,\n          // could live with !!desc.set as well here...\n          enumerable: desc.enumerable,\n          value: base[key]\n        };\n    }\n    return Object.create(getPrototypeOf(base), descriptors);\n  } else {\n    const proto = getPrototypeOf(base);\n    if (proto !== null && isPlain) {\n      return { ...base };\n    }\n    const obj = Object.create(proto);\n    return Object.assign(obj, base);\n  }\n}\nfunction freeze(obj, deep = false) {\n  if (isFrozen(obj) || isDraft(obj) || !isDraftable(obj))\n    return obj;\n  if (getArchtype(obj) > 1) {\n    obj.set = obj.add = obj.clear = obj.delete = dontMutateFrozenCollections;\n  }\n  Object.freeze(obj);\n  if (deep)\n    Object.entries(obj).forEach(([key, value]) => freeze(value, true));\n  return obj;\n}\nfunction dontMutateFrozenCollections() {\n  die(2);\n}\nfunction isFrozen(obj) {\n  return Object.isFrozen(obj);\n}\n\n// src/utils/plugins.ts\nvar plugins = {};\nfunction getPlugin(pluginKey) {\n  const plugin = plugins[pluginKey];\n  if (!plugin) {\n    die(0, pluginKey);\n  }\n  return plugin;\n}\nfunction loadPlugin(pluginKey, implementation) {\n  if (!plugins[pluginKey])\n    plugins[pluginKey] = implementation;\n}\n\n// src/core/scope.ts\nvar currentScope;\nfunction getCurrentScope() {\n  return currentScope;\n}\nfunction createScope(parent_, immer_) {\n  return {\n    drafts_: [],\n    parent_,\n    immer_,\n    // Whenever the modified draft contains a draft from another scope, we\n    // need to prevent auto-freezing so the unowned draft can be finalized.\n    canAutoFreeze_: true,\n    unfinalizedDrafts_: 0\n  };\n}\nfunction usePatchesInScope(scope, patchListener) {\n  if (patchListener) {\n    getPlugin(\"Patches\");\n    scope.patches_ = [];\n    scope.inversePatches_ = [];\n    scope.patchListener_ = patchListener;\n  }\n}\nfunction revokeScope(scope) {\n  leaveScope(scope);\n  scope.drafts_.forEach(revokeDraft);\n  scope.drafts_ = null;\n}\nfunction leaveScope(scope) {\n  if (scope === currentScope) {\n    currentScope = scope.parent_;\n  }\n}\nfunction enterScope(immer2) {\n  return currentScope = createScope(currentScope, immer2);\n}\nfunction revokeDraft(draft) {\n  const state = draft[DRAFT_STATE];\n  if (state.type_ === 0 /* Object */ || state.type_ === 1 /* Array */)\n    state.revoke_();\n  else\n    state.revoked_ = true;\n}\n\n// src/core/finalize.ts\nfunction processResult(result, scope) {\n  scope.unfinalizedDrafts_ = scope.drafts_.length;\n  const baseDraft = scope.drafts_[0];\n  const isReplaced = result !== void 0 && result !== baseDraft;\n  if (isReplaced) {\n    if (baseDraft[DRAFT_STATE].modified_) {\n      revokeScope(scope);\n      die(4);\n    }\n    if (isDraftable(result)) {\n      result = finalize(scope, result);\n      if (!scope.parent_)\n        maybeFreeze(scope, result);\n    }\n    if (scope.patches_) {\n      getPlugin(\"Patches\").generateReplacementPatches_(\n        baseDraft[DRAFT_STATE].base_,\n        result,\n        scope.patches_,\n        scope.inversePatches_\n      );\n    }\n  } else {\n    result = finalize(scope, baseDraft, []);\n  }\n  revokeScope(scope);\n  if (scope.patches_) {\n    scope.patchListener_(scope.patches_, scope.inversePatches_);\n  }\n  return result !== NOTHING ? result : void 0;\n}\nfunction finalize(rootScope, value, path) {\n  if (isFrozen(value))\n    return value;\n  const state = value[DRAFT_STATE];\n  if (!state) {\n    each(\n      value,\n      (key, childValue) => finalizeProperty(rootScope, state, value, key, childValue, path)\n    );\n    return value;\n  }\n  if (state.scope_ !== rootScope)\n    return value;\n  if (!state.modified_) {\n    maybeFreeze(rootScope, state.base_, true);\n    return state.base_;\n  }\n  if (!state.finalized_) {\n    state.finalized_ = true;\n    state.scope_.unfinalizedDrafts_--;\n    const result = state.copy_;\n    let resultEach = result;\n    let isSet2 = false;\n    if (state.type_ === 3 /* Set */) {\n      resultEach = new Set(result);\n      result.clear();\n      isSet2 = true;\n    }\n    each(\n      resultEach,\n      (key, childValue) => finalizeProperty(rootScope, state, result, key, childValue, path, isSet2)\n    );\n    maybeFreeze(rootScope, result, false);\n    if (path && rootScope.patches_) {\n      getPlugin(\"Patches\").generatePatches_(\n        state,\n        path,\n        rootScope.patches_,\n        rootScope.inversePatches_\n      );\n    }\n  }\n  return state.copy_;\n}\nfunction finalizeProperty(rootScope, parentState, targetObject, prop, childValue, rootPath, targetIsSet) {\n  if (process.env.NODE_ENV !== \"production\" && childValue === targetObject)\n    die(5);\n  if (isDraft(childValue)) {\n    const path = rootPath && parentState && parentState.type_ !== 3 /* Set */ && // Set objects are atomic since they have no keys.\n    !has(parentState.assigned_, prop) ? rootPath.concat(prop) : void 0;\n    const res = finalize(rootScope, childValue, path);\n    set(targetObject, prop, res);\n    if (isDraft(res)) {\n      rootScope.canAutoFreeze_ = false;\n    } else\n      return;\n  } else if (targetIsSet) {\n    targetObject.add(childValue);\n  }\n  if (isDraftable(childValue) && !isFrozen(childValue)) {\n    if (!rootScope.immer_.autoFreeze_ && rootScope.unfinalizedDrafts_ < 1) {\n      return;\n    }\n    finalize(rootScope, childValue);\n    if ((!parentState || !parentState.scope_.parent_) && typeof prop !== \"symbol\" && Object.prototype.propertyIsEnumerable.call(targetObject, prop))\n      maybeFreeze(rootScope, childValue);\n  }\n}\nfunction maybeFreeze(scope, value, deep = false) {\n  if (!scope.parent_ && scope.immer_.autoFreeze_ && scope.canAutoFreeze_) {\n    freeze(value, deep);\n  }\n}\n\n// src/core/proxy.ts\nfunction createProxyProxy(base, parent) {\n  const isArray = Array.isArray(base);\n  const state = {\n    type_: isArray ? 1 /* Array */ : 0 /* Object */,\n    // Track which produce call this is associated with.\n    scope_: parent ? parent.scope_ : getCurrentScope(),\n    // True for both shallow and deep changes.\n    modified_: false,\n    // Used during finalization.\n    finalized_: false,\n    // Track which properties have been assigned (true) or deleted (false).\n    assigned_: {},\n    // The parent draft state.\n    parent_: parent,\n    // The base state.\n    base_: base,\n    // The base proxy.\n    draft_: null,\n    // set below\n    // The base copy with any updated values.\n    copy_: null,\n    // Called by the `produce` function.\n    revoke_: null,\n    isManual_: false\n  };\n  let target = state;\n  let traps = objectTraps;\n  if (isArray) {\n    target = [state];\n    traps = arrayTraps;\n  }\n  const { revoke, proxy } = Proxy.revocable(target, traps);\n  state.draft_ = proxy;\n  state.revoke_ = revoke;\n  return proxy;\n}\nvar objectTraps = {\n  get(state, prop) {\n    if (prop === DRAFT_STATE)\n      return state;\n    const source = latest(state);\n    if (!has(source, prop)) {\n      return readPropFromProto(state, source, prop);\n    }\n    const value = source[prop];\n    if (state.finalized_ || !isDraftable(value)) {\n      return value;\n    }\n    if (value === peek(state.base_, prop)) {\n      prepareCopy(state);\n      return state.copy_[prop] = createProxy(value, state);\n    }\n    return value;\n  },\n  has(state, prop) {\n    return prop in latest(state);\n  },\n  ownKeys(state) {\n    return Reflect.ownKeys(latest(state));\n  },\n  set(state, prop, value) {\n    const desc = getDescriptorFromProto(latest(state), prop);\n    if (desc?.set) {\n      desc.set.call(state.draft_, value);\n      return true;\n    }\n    if (!state.modified_) {\n      const current2 = peek(latest(state), prop);\n      const currentState = current2?.[DRAFT_STATE];\n      if (currentState && currentState.base_ === value) {\n        state.copy_[prop] = value;\n        state.assigned_[prop] = false;\n        return true;\n      }\n      if (is(value, current2) && (value !== void 0 || has(state.base_, prop)))\n        return true;\n      prepareCopy(state);\n      markChanged(state);\n    }\n    if (state.copy_[prop] === value && // special case: handle new props with value 'undefined'\n    (value !== void 0 || prop in state.copy_) || // special case: NaN\n    Number.isNaN(value) && Number.isNaN(state.copy_[prop]))\n      return true;\n    state.copy_[prop] = value;\n    state.assigned_[prop] = true;\n    return true;\n  },\n  deleteProperty(state, prop) {\n    if (peek(state.base_, prop) !== void 0 || prop in state.base_) {\n      state.assigned_[prop] = false;\n      prepareCopy(state);\n      markChanged(state);\n    } else {\n      delete state.assigned_[prop];\n    }\n    if (state.copy_) {\n      delete state.copy_[prop];\n    }\n    return true;\n  },\n  // Note: We never coerce `desc.value` into an Immer draft, because we can't make\n  // the same guarantee in ES5 mode.\n  getOwnPropertyDescriptor(state, prop) {\n    const owner = latest(state);\n    const desc = Reflect.getOwnPropertyDescriptor(owner, prop);\n    if (!desc)\n      return desc;\n    return {\n      writable: true,\n      configurable: state.type_ !== 1 /* Array */ || prop !== \"length\",\n      enumerable: desc.enumerable,\n      value: owner[prop]\n    };\n  },\n  defineProperty() {\n    die(11);\n  },\n  getPrototypeOf(state) {\n    return getPrototypeOf(state.base_);\n  },\n  setPrototypeOf() {\n    die(12);\n  }\n};\nvar arrayTraps = {};\neach(objectTraps, (key, fn) => {\n  arrayTraps[key] = function() {\n    arguments[0] = arguments[0][0];\n    return fn.apply(this, arguments);\n  };\n});\narrayTraps.deleteProperty = function(state, prop) {\n  if (process.env.NODE_ENV !== \"production\" && isNaN(parseInt(prop)))\n    die(13);\n  return arrayTraps.set.call(this, state, prop, void 0);\n};\narrayTraps.set = function(state, prop, value) {\n  if (process.env.NODE_ENV !== \"production\" && prop !== \"length\" && isNaN(parseInt(prop)))\n    die(14);\n  return objectTraps.set.call(this, state[0], prop, value, state[0]);\n};\nfunction peek(draft, prop) {\n  const state = draft[DRAFT_STATE];\n  const source = state ? latest(state) : draft;\n  return source[prop];\n}\nfunction readPropFromProto(state, source, prop) {\n  const desc = getDescriptorFromProto(source, prop);\n  return desc ? `value` in desc ? desc.value : (\n    // This is a very special case, if the prop is a getter defined by the\n    // prototype, we should invoke it with the draft as context!\n    desc.get?.call(state.draft_)\n  ) : void 0;\n}\nfunction getDescriptorFromProto(source, prop) {\n  if (!(prop in source))\n    return void 0;\n  let proto = getPrototypeOf(source);\n  while (proto) {\n    const desc = Object.getOwnPropertyDescriptor(proto, prop);\n    if (desc)\n      return desc;\n    proto = getPrototypeOf(proto);\n  }\n  return void 0;\n}\nfunction markChanged(state) {\n  if (!state.modified_) {\n    state.modified_ = true;\n    if (state.parent_) {\n      markChanged(state.parent_);\n    }\n  }\n}\nfunction prepareCopy(state) {\n  if (!state.copy_) {\n    state.copy_ = shallowCopy(\n      state.base_,\n      state.scope_.immer_.useStrictShallowCopy_\n    );\n  }\n}\n\n// src/core/immerClass.ts\nvar Immer2 = class {\n  constructor(config) {\n    this.autoFreeze_ = true;\n    this.useStrictShallowCopy_ = false;\n    /**\n     * The `produce` function takes a value and a \"recipe function\" (whose\n     * return value often depends on the base state). The recipe function is\n     * free to mutate its first argument however it wants. All mutations are\n     * only ever applied to a __copy__ of the base state.\n     *\n     * Pass only a function to create a \"curried producer\" which relieves you\n     * from passing the recipe function every time.\n     *\n     * Only plain objects and arrays are made mutable. All other objects are\n     * considered uncopyable.\n     *\n     * Note: This function is __bound__ to its `Immer` instance.\n     *\n     * @param {any} base - the initial state\n     * @param {Function} recipe - function that receives a proxy of the base state as first argument and which can be freely modified\n     * @param {Function} patchListener - optional function that will be called with all the patches produced here\n     * @returns {any} a new state, or the initial state if nothing was modified\n     */\n    this.produce = (base, recipe, patchListener) => {\n      if (typeof base === \"function\" && typeof recipe !== \"function\") {\n        const defaultBase = recipe;\n        recipe = base;\n        const self = this;\n        return function curriedProduce(base2 = defaultBase, ...args) {\n          return self.produce(base2, (draft) => recipe.call(this, draft, ...args));\n        };\n      }\n      if (typeof recipe !== \"function\")\n        die(6);\n      if (patchListener !== void 0 && typeof patchListener !== \"function\")\n        die(7);\n      let result;\n      if (isDraftable(base)) {\n        const scope = enterScope(this);\n        const proxy = createProxy(base, void 0);\n        let hasError = true;\n        try {\n          result = recipe(proxy);\n          hasError = false;\n        } finally {\n          if (hasError)\n            revokeScope(scope);\n          else\n            leaveScope(scope);\n        }\n        usePatchesInScope(scope, patchListener);\n        return processResult(result, scope);\n      } else if (!base || typeof base !== \"object\") {\n        result = recipe(base);\n        if (result === void 0)\n          result = base;\n        if (result === NOTHING)\n          result = void 0;\n        if (this.autoFreeze_)\n          freeze(result, true);\n        if (patchListener) {\n          const p = [];\n          const ip = [];\n          getPlugin(\"Patches\").generateReplacementPatches_(base, result, p, ip);\n          patchListener(p, ip);\n        }\n        return result;\n      } else\n        die(1, base);\n    };\n    this.produceWithPatches = (base, recipe) => {\n      if (typeof base === \"function\") {\n        return (state, ...args) => this.produceWithPatches(state, (draft) => base(draft, ...args));\n      }\n      let patches, inversePatches;\n      const result = this.produce(base, recipe, (p, ip) => {\n        patches = p;\n        inversePatches = ip;\n      });\n      return [result, patches, inversePatches];\n    };\n    if (typeof config?.autoFreeze === \"boolean\")\n      this.setAutoFreeze(config.autoFreeze);\n    if (typeof config?.useStrictShallowCopy === \"boolean\")\n      this.setUseStrictShallowCopy(config.useStrictShallowCopy);\n  }\n  createDraft(base) {\n    if (!isDraftable(base))\n      die(8);\n    if (isDraft(base))\n      base = current(base);\n    const scope = enterScope(this);\n    const proxy = createProxy(base, void 0);\n    proxy[DRAFT_STATE].isManual_ = true;\n    leaveScope(scope);\n    return proxy;\n  }\n  finishDraft(draft, patchListener) {\n    const state = draft && draft[DRAFT_STATE];\n    if (!state || !state.isManual_)\n      die(9);\n    const { scope_: scope } = state;\n    usePatchesInScope(scope, patchListener);\n    return processResult(void 0, scope);\n  }\n  /**\n   * Pass true to automatically freeze all copies created by Immer.\n   *\n   * By default, auto-freezing is enabled.\n   */\n  setAutoFreeze(value) {\n    this.autoFreeze_ = value;\n  }\n  /**\n   * Pass true to enable strict shallow copy.\n   *\n   * By default, immer does not copy the object descriptors such as getter, setter and non-enumrable properties.\n   */\n  setUseStrictShallowCopy(value) {\n    this.useStrictShallowCopy_ = value;\n  }\n  applyPatches(base, patches) {\n    let i;\n    for (i = patches.length - 1; i >= 0; i--) {\n      const patch = patches[i];\n      if (patch.path.length === 0 && patch.op === \"replace\") {\n        base = patch.value;\n        break;\n      }\n    }\n    if (i > -1) {\n      patches = patches.slice(i + 1);\n    }\n    const applyPatchesImpl = getPlugin(\"Patches\").applyPatches_;\n    if (isDraft(base)) {\n      return applyPatchesImpl(base, patches);\n    }\n    return this.produce(\n      base,\n      (draft) => applyPatchesImpl(draft, patches)\n    );\n  }\n};\nfunction createProxy(value, parent) {\n  const draft = isMap(value) ? getPlugin(\"MapSet\").proxyMap_(value, parent) : isSet(value) ? getPlugin(\"MapSet\").proxySet_(value, parent) : createProxyProxy(value, parent);\n  const scope = parent ? parent.scope_ : getCurrentScope();\n  scope.drafts_.push(draft);\n  return draft;\n}\n\n// src/core/current.ts\nfunction current(value) {\n  if (!isDraft(value))\n    die(10, value);\n  return currentImpl(value);\n}\nfunction currentImpl(value) {\n  if (!isDraftable(value) || isFrozen(value))\n    return value;\n  const state = value[DRAFT_STATE];\n  let copy;\n  if (state) {\n    if (!state.modified_)\n      return state.base_;\n    state.finalized_ = true;\n    copy = shallowCopy(value, state.scope_.immer_.useStrictShallowCopy_);\n  } else {\n    copy = shallowCopy(value, true);\n  }\n  each(copy, (key, childValue) => {\n    set(copy, key, currentImpl(childValue));\n  });\n  if (state) {\n    state.finalized_ = false;\n  }\n  return copy;\n}\n\n// src/plugins/patches.ts\nfunction enablePatches() {\n  const errorOffset = 16;\n  if (process.env.NODE_ENV !== \"production\") {\n    errors.push(\n      'Sets cannot have \"replace\" patches.',\n      function(op) {\n        return \"Unsupported patch operation: \" + op;\n      },\n      function(path) {\n        return \"Cannot apply patch, path doesn't resolve: \" + path;\n      },\n      \"Patching reserved attributes like __proto__, prototype and constructor is not allowed\"\n    );\n  }\n  const REPLACE = \"replace\";\n  const ADD = \"add\";\n  const REMOVE = \"remove\";\n  function generatePatches_(state, basePath, patches, inversePatches) {\n    switch (state.type_) {\n      case 0 /* Object */:\n      case 2 /* Map */:\n        return generatePatchesFromAssigned(\n          state,\n          basePath,\n          patches,\n          inversePatches\n        );\n      case 1 /* Array */:\n        return generateArrayPatches(state, basePath, patches, inversePatches);\n      case 3 /* Set */:\n        return generateSetPatches(\n          state,\n          basePath,\n          patches,\n          inversePatches\n        );\n    }\n  }\n  function generateArrayPatches(state, basePath, patches, inversePatches) {\n    let { base_, assigned_ } = state;\n    let copy_ = state.copy_;\n    if (copy_.length < base_.length) {\n      ;\n      [base_, copy_] = [copy_, base_];\n      [patches, inversePatches] = [inversePatches, patches];\n    }\n    for (let i = 0; i < base_.length; i++) {\n      if (assigned_[i] && copy_[i] !== base_[i]) {\n        const path = basePath.concat([i]);\n        patches.push({\n          op: REPLACE,\n          path,\n          // Need to maybe clone it, as it can in fact be the original value\n          // due to the base/copy inversion at the start of this function\n          value: clonePatchValueIfNeeded(copy_[i])\n        });\n        inversePatches.push({\n          op: REPLACE,\n          path,\n          value: clonePatchValueIfNeeded(base_[i])\n        });\n      }\n    }\n    for (let i = base_.length; i < copy_.length; i++) {\n      const path = basePath.concat([i]);\n      patches.push({\n        op: ADD,\n        path,\n        // Need to maybe clone it, as it can in fact be the original value\n        // due to the base/copy inversion at the start of this function\n        value: clonePatchValueIfNeeded(copy_[i])\n      });\n    }\n    for (let i = copy_.length - 1; base_.length <= i; --i) {\n      const path = basePath.concat([i]);\n      inversePatches.push({\n        op: REMOVE,\n        path\n      });\n    }\n  }\n  function generatePatchesFromAssigned(state, basePath, patches, inversePatches) {\n    const { base_, copy_ } = state;\n    each(state.assigned_, (key, assignedValue) => {\n      const origValue = get(base_, key);\n      const value = get(copy_, key);\n      const op = !assignedValue ? REMOVE : has(base_, key) ? REPLACE : ADD;\n      if (origValue === value && op === REPLACE)\n        return;\n      const path = basePath.concat(key);\n      patches.push(op === REMOVE ? { op, path } : { op, path, value });\n      inversePatches.push(\n        op === ADD ? { op: REMOVE, path } : op === REMOVE ? { op: ADD, path, value: clonePatchValueIfNeeded(origValue) } : { op: REPLACE, path, value: clonePatchValueIfNeeded(origValue) }\n      );\n    });\n  }\n  function generateSetPatches(state, basePath, patches, inversePatches) {\n    let { base_, copy_ } = state;\n    let i = 0;\n    base_.forEach((value) => {\n      if (!copy_.has(value)) {\n        const path = basePath.concat([i]);\n        patches.push({\n          op: REMOVE,\n          path,\n          value\n        });\n        inversePatches.unshift({\n          op: ADD,\n          path,\n          value\n        });\n      }\n      i++;\n    });\n    i = 0;\n    copy_.forEach((value) => {\n      if (!base_.has(value)) {\n        const path = basePath.concat([i]);\n        patches.push({\n          op: ADD,\n          path,\n          value\n        });\n        inversePatches.unshift({\n          op: REMOVE,\n          path,\n          value\n        });\n      }\n      i++;\n    });\n  }\n  function generateReplacementPatches_(baseValue, replacement, patches, inversePatches) {\n    patches.push({\n      op: REPLACE,\n      path: [],\n      value: replacement === NOTHING ? void 0 : replacement\n    });\n    inversePatches.push({\n      op: REPLACE,\n      path: [],\n      value: baseValue\n    });\n  }\n  function applyPatches_(draft, patches) {\n    patches.forEach((patch) => {\n      const { path, op } = patch;\n      let base = draft;\n      for (let i = 0; i < path.length - 1; i++) {\n        const parentType = getArchtype(base);\n        let p = path[i];\n        if (typeof p !== \"string\" && typeof p !== \"number\") {\n          p = \"\" + p;\n        }\n        if ((parentType === 0 /* Object */ || parentType === 1 /* Array */) && (p === \"__proto__\" || p === \"constructor\"))\n          die(errorOffset + 3);\n        if (typeof base === \"function\" && p === \"prototype\")\n          die(errorOffset + 3);\n        base = get(base, p);\n        if (typeof base !== \"object\")\n          die(errorOffset + 2, path.join(\"/\"));\n      }\n      const type = getArchtype(base);\n      const value = deepClonePatchValue(patch.value);\n      const key = path[path.length - 1];\n      switch (op) {\n        case REPLACE:\n          switch (type) {\n            case 2 /* Map */:\n              return base.set(key, value);\n            case 3 /* Set */:\n              die(errorOffset);\n            default:\n              return base[key] = value;\n          }\n        case ADD:\n          switch (type) {\n            case 1 /* Array */:\n              return key === \"-\" ? base.push(value) : base.splice(key, 0, value);\n            case 2 /* Map */:\n              return base.set(key, value);\n            case 3 /* Set */:\n              return base.add(value);\n            default:\n              return base[key] = value;\n          }\n        case REMOVE:\n          switch (type) {\n            case 1 /* Array */:\n              return base.splice(key, 1);\n            case 2 /* Map */:\n              return base.delete(key);\n            case 3 /* Set */:\n              return base.delete(patch.value);\n            default:\n              return delete base[key];\n          }\n        default:\n          die(errorOffset + 1, op);\n      }\n    });\n    return draft;\n  }\n  function deepClonePatchValue(obj) {\n    if (!isDraftable(obj))\n      return obj;\n    if (Array.isArray(obj))\n      return obj.map(deepClonePatchValue);\n    if (isMap(obj))\n      return new Map(\n        Array.from(obj.entries()).map(([k, v]) => [k, deepClonePatchValue(v)])\n      );\n    if (isSet(obj))\n      return new Set(Array.from(obj).map(deepClonePatchValue));\n    const cloned = Object.create(getPrototypeOf(obj));\n    for (const key in obj)\n      cloned[key] = deepClonePatchValue(obj[key]);\n    if (has(obj, DRAFTABLE))\n      cloned[DRAFTABLE] = obj[DRAFTABLE];\n    return cloned;\n  }\n  function clonePatchValueIfNeeded(obj) {\n    if (isDraft(obj)) {\n      return deepClonePatchValue(obj);\n    } else\n      return obj;\n  }\n  loadPlugin(\"Patches\", {\n    applyPatches_,\n    generatePatches_,\n    generateReplacementPatches_\n  });\n}\n\n// src/plugins/mapset.ts\nfunction enableMapSet() {\n  class DraftMap extends Map {\n    constructor(target, parent) {\n      super();\n      this[DRAFT_STATE] = {\n        type_: 2 /* Map */,\n        parent_: parent,\n        scope_: parent ? parent.scope_ : getCurrentScope(),\n        modified_: false,\n        finalized_: false,\n        copy_: void 0,\n        assigned_: void 0,\n        base_: target,\n        draft_: this,\n        isManual_: false,\n        revoked_: false\n      };\n    }\n    get size() {\n      return latest(this[DRAFT_STATE]).size;\n    }\n    has(key) {\n      return latest(this[DRAFT_STATE]).has(key);\n    }\n    set(key, value) {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (!latest(state).has(key) || latest(state).get(key) !== value) {\n        prepareMapCopy(state);\n        markChanged(state);\n        state.assigned_.set(key, true);\n        state.copy_.set(key, value);\n        state.assigned_.set(key, true);\n      }\n      return this;\n    }\n    delete(key) {\n      if (!this.has(key)) {\n        return false;\n      }\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      prepareMapCopy(state);\n      markChanged(state);\n      if (state.base_.has(key)) {\n        state.assigned_.set(key, false);\n      } else {\n        state.assigned_.delete(key);\n      }\n      state.copy_.delete(key);\n      return true;\n    }\n    clear() {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (latest(state).size) {\n        prepareMapCopy(state);\n        markChanged(state);\n        state.assigned_ = /* @__PURE__ */ new Map();\n        each(state.base_, (key) => {\n          state.assigned_.set(key, false);\n        });\n        state.copy_.clear();\n      }\n    }\n    forEach(cb, thisArg) {\n      const state = this[DRAFT_STATE];\n      latest(state).forEach((_value, key, _map) => {\n        cb.call(thisArg, this.get(key), key, this);\n      });\n    }\n    get(key) {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      const value = latest(state).get(key);\n      if (state.finalized_ || !isDraftable(value)) {\n        return value;\n      }\n      if (value !== state.base_.get(key)) {\n        return value;\n      }\n      const draft = createProxy(value, state);\n      prepareMapCopy(state);\n      state.copy_.set(key, draft);\n      return draft;\n    }\n    keys() {\n      return latest(this[DRAFT_STATE]).keys();\n    }\n    values() {\n      const iterator = this.keys();\n      return {\n        [Symbol.iterator]: () => this.values(),\n        next: () => {\n          const r = iterator.next();\n          if (r.done)\n            return r;\n          const value = this.get(r.value);\n          return {\n            done: false,\n            value\n          };\n        }\n      };\n    }\n    entries() {\n      const iterator = this.keys();\n      return {\n        [Symbol.iterator]: () => this.entries(),\n        next: () => {\n          const r = iterator.next();\n          if (r.done)\n            return r;\n          const value = this.get(r.value);\n          return {\n            done: false,\n            value: [r.value, value]\n          };\n        }\n      };\n    }\n    [(DRAFT_STATE, Symbol.iterator)]() {\n      return this.entries();\n    }\n  }\n  function proxyMap_(target, parent) {\n    return new DraftMap(target, parent);\n  }\n  function prepareMapCopy(state) {\n    if (!state.copy_) {\n      state.assigned_ = /* @__PURE__ */ new Map();\n      state.copy_ = new Map(state.base_);\n    }\n  }\n  class DraftSet extends Set {\n    constructor(target, parent) {\n      super();\n      this[DRAFT_STATE] = {\n        type_: 3 /* Set */,\n        parent_: parent,\n        scope_: parent ? parent.scope_ : getCurrentScope(),\n        modified_: false,\n        finalized_: false,\n        copy_: void 0,\n        base_: target,\n        draft_: this,\n        drafts_: /* @__PURE__ */ new Map(),\n        revoked_: false,\n        isManual_: false\n      };\n    }\n    get size() {\n      return latest(this[DRAFT_STATE]).size;\n    }\n    has(value) {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (!state.copy_) {\n        return state.base_.has(value);\n      }\n      if (state.copy_.has(value))\n        return true;\n      if (state.drafts_.has(value) && state.copy_.has(state.drafts_.get(value)))\n        return true;\n      return false;\n    }\n    add(value) {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (!this.has(value)) {\n        prepareSetCopy(state);\n        markChanged(state);\n        state.copy_.add(value);\n      }\n      return this;\n    }\n    delete(value) {\n      if (!this.has(value)) {\n        return false;\n      }\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      prepareSetCopy(state);\n      markChanged(state);\n      return state.copy_.delete(value) || (state.drafts_.has(value) ? state.copy_.delete(state.drafts_.get(value)) : (\n        /* istanbul ignore next */\n        false\n      ));\n    }\n    clear() {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (latest(state).size) {\n        prepareSetCopy(state);\n        markChanged(state);\n        state.copy_.clear();\n      }\n    }\n    values() {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      prepareSetCopy(state);\n      return state.copy_.values();\n    }\n    entries() {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      prepareSetCopy(state);\n      return state.copy_.entries();\n    }\n    keys() {\n      return this.values();\n    }\n    [(DRAFT_STATE, Symbol.iterator)]() {\n      return this.values();\n    }\n    forEach(cb, thisArg) {\n      const iterator = this.values();\n      let result = iterator.next();\n      while (!result.done) {\n        cb.call(thisArg, result.value, result.value, this);\n        result = iterator.next();\n      }\n    }\n  }\n  function proxySet_(target, parent) {\n    return new DraftSet(target, parent);\n  }\n  function prepareSetCopy(state) {\n    if (!state.copy_) {\n      state.copy_ = /* @__PURE__ */ new Set();\n      state.base_.forEach((value) => {\n        if (isDraftable(value)) {\n          const draft = createProxy(value, state);\n          state.drafts_.set(value, draft);\n          state.copy_.add(draft);\n        } else {\n          state.copy_.add(value);\n        }\n      });\n    }\n  }\n  function assertUnrevoked(state) {\n    if (state.revoked_)\n      die(3, JSON.stringify(latest(state)));\n  }\n  loadPlugin(\"MapSet\", { proxyMap_, proxySet_ });\n}\n\n// src/immer.ts\nvar immer = new Immer2();\nvar produce = immer.produce;\nvar produceWithPatches = immer.produceWithPatches.bind(\n  immer\n);\nvar setAutoFreeze = immer.setAutoFreeze.bind(immer);\nvar setUseStrictShallowCopy = immer.setUseStrictShallowCopy.bind(immer);\nvar applyPatches = immer.applyPatches.bind(immer);\nvar createDraft = immer.createDraft.bind(immer);\nvar finishDraft = immer.finishDraft.bind(immer);\nfunction castDraft(value) {\n  return value;\n}\nfunction castImmutable(value) {\n  return value;\n}\nexport {\n  Immer2 as Immer,\n  applyPatches,\n  castDraft,\n  castImmutable,\n  createDraft,\n  current,\n  enableMapSet,\n  enablePatches,\n  finishDraft,\n  freeze,\n  DRAFTABLE as immerable,\n  isDraft,\n  isDraftable,\n  NOTHING as nothing,\n  original,\n  produce,\n  produceWithPatches,\n  setAutoFreeze,\n  setUseStrictShallowCopy\n};\n//# sourceMappingURL=immer.mjs.map","// src/index.ts\nfunction createThunkMiddleware(extraArgument) {\n  const middleware = ({ dispatch, getState }) => (next) => (action) => {\n    if (typeof action === \"function\") {\n      return action(dispatch, getState, extraArgument);\n    }\n    return next(action);\n  };\n  return middleware;\n}\nvar thunk = createThunkMiddleware();\nvar withExtraArgument = createThunkMiddleware;\nexport {\n  thunk,\n  withExtraArgument\n};\n","// src/index.ts\nexport * from \"redux\";\nimport { produce, current as current3, freeze, original as original2, isDraft as isDraft5 } from \"immer\";\nimport { createSelector, createSelectorCreator as createSelectorCreator2, lruMemoize, weakMapMemoize as weakMapMemoize2 } from \"reselect\";\n\n// src/createDraftSafeSelector.ts\nimport { current, isDraft } from \"immer\";\nimport { createSelectorCreator, weakMapMemoize } from \"reselect\";\nvar createDraftSafeSelectorCreator = (...args) => {\n  const createSelector2 = createSelectorCreator(...args);\n  const createDraftSafeSelector2 = Object.assign((...args2) => {\n    const selector = createSelector2(...args2);\n    const wrappedSelector = (value, ...rest) => selector(isDraft(value) ? current(value) : value, ...rest);\n    Object.assign(wrappedSelector, selector);\n    return wrappedSelector;\n  }, {\n    withTypes: () => createDraftSafeSelector2\n  });\n  return createDraftSafeSelector2;\n};\nvar createDraftSafeSelector = /* @__PURE__ */ createDraftSafeSelectorCreator(weakMapMemoize);\n\n// src/configureStore.ts\nimport { applyMiddleware, createStore, compose as compose2, combineReducers, isPlainObject as isPlainObject2 } from \"redux\";\n\n// src/devtoolsExtension.ts\nimport { compose } from \"redux\";\nvar composeWithDevTools = typeof window !== \"undefined\" && window.__REDUX_DEVTOOLS_EXTENSION_COMPOSE__ ? window.__REDUX_DEVTOOLS_EXTENSION_COMPOSE__ : function() {\n  if (arguments.length === 0) return void 0;\n  if (typeof arguments[0] === \"object\") return compose;\n  return compose.apply(null, arguments);\n};\nvar devToolsEnhancer = typeof window !== \"undefined\" && window.__REDUX_DEVTOOLS_EXTENSION__ ? window.__REDUX_DEVTOOLS_EXTENSION__ : function() {\n  return function(noop3) {\n    return noop3;\n  };\n};\n\n// src/getDefaultMiddleware.ts\nimport { thunk as thunkMiddleware, withExtraArgument } from \"redux-thunk\";\n\n// src/createAction.ts\nimport { isAction } from \"redux\";\n\n// src/tsHelpers.ts\nvar hasMatchFunction = (v) => {\n  return v && typeof v.match === \"function\";\n};\n\n// src/createAction.ts\nfunction createAction(type, prepareAction) {\n  function actionCreator(...args) {\n    if (prepareAction) {\n      let prepared = prepareAction(...args);\n      if (!prepared) {\n        throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(0) : \"prepareAction did not return an object\");\n      }\n      return {\n        type,\n        payload: prepared.payload,\n        ...\"meta\" in prepared && {\n          meta: prepared.meta\n        },\n        ...\"error\" in prepared && {\n          error: prepared.error\n        }\n      };\n    }\n    return {\n      type,\n      payload: args[0]\n    };\n  }\n  actionCreator.toString = () => `${type}`;\n  actionCreator.type = type;\n  actionCreator.match = (action) => isAction(action) && action.type === type;\n  return actionCreator;\n}\nfunction isActionCreator(action) {\n  return typeof action === \"function\" && \"type\" in action && // hasMatchFunction only wants Matchers but I don't see the point in rewriting it\n  hasMatchFunction(action);\n}\nfunction isFSA(action) {\n  return isAction(action) && Object.keys(action).every(isValidKey);\n}\nfunction isValidKey(key) {\n  return [\"type\", \"payload\", \"error\", \"meta\"].indexOf(key) > -1;\n}\n\n// src/actionCreatorInvariantMiddleware.ts\nfunction getMessage(type) {\n  const splitType = type ? `${type}`.split(\"/\") : [];\n  const actionName = splitType[splitType.length - 1] || \"actionCreator\";\n  return `Detected an action creator with type \"${type || \"unknown\"}\" being dispatched. \nMake sure you're calling the action creator before dispatching, i.e. \\`dispatch(${actionName}())\\` instead of \\`dispatch(${actionName})\\`. This is necessary even if the action has no payload.`;\n}\nfunction createActionCreatorInvariantMiddleware(options = {}) {\n  if (process.env.NODE_ENV === \"production\") {\n    return () => (next) => (action) => next(action);\n  }\n  const {\n    isActionCreator: isActionCreator2 = isActionCreator\n  } = options;\n  return () => (next) => (action) => {\n    if (isActionCreator2(action)) {\n      console.warn(getMessage(action.type));\n    }\n    return next(action);\n  };\n}\n\n// src/utils.ts\nimport { produce as createNextState, isDraftable } from \"immer\";\nfunction getTimeMeasureUtils(maxDelay, fnName) {\n  let elapsed = 0;\n  return {\n    measureTime(fn) {\n      const started = Date.now();\n      try {\n        return fn();\n      } finally {\n        const finished = Date.now();\n        elapsed += finished - started;\n      }\n    },\n    warnIfExceeded() {\n      if (elapsed > maxDelay) {\n        console.warn(`${fnName} took ${elapsed}ms, which is more than the warning threshold of ${maxDelay}ms. \nIf your state or actions are very large, you may want to disable the middleware as it might cause too much of a slowdown in development mode. See https://redux-toolkit.js.org/api/getDefaultMiddleware for instructions.\nIt is disabled in production builds, so you don't need to worry about that.`);\n      }\n    }\n  };\n}\nfunction find(iterable, comparator) {\n  for (const entry of iterable) {\n    if (comparator(entry)) {\n      return entry;\n    }\n  }\n  return void 0;\n}\nvar Tuple = class _Tuple extends Array {\n  constructor(...items) {\n    super(...items);\n    Object.setPrototypeOf(this, _Tuple.prototype);\n  }\n  static get [Symbol.species]() {\n    return _Tuple;\n  }\n  concat(...arr) {\n    return super.concat.apply(this, arr);\n  }\n  prepend(...arr) {\n    if (arr.length === 1 && Array.isArray(arr[0])) {\n      return new _Tuple(...arr[0].concat(this));\n    }\n    return new _Tuple(...arr.concat(this));\n  }\n};\nfunction freezeDraftable(val) {\n  return isDraftable(val) ? createNextState(val, () => {\n  }) : val;\n}\nfunction emplace(map, key, handler) {\n  if (map.has(key)) {\n    let value = map.get(key);\n    if (handler.update) {\n      value = handler.update(value, key, map);\n      map.set(key, value);\n    }\n    return value;\n  }\n  if (!handler.insert) throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(10) : \"No insert provided for key not already in map\");\n  const inserted = handler.insert(key, map);\n  map.set(key, inserted);\n  return inserted;\n}\n\n// src/immutableStateInvariantMiddleware.ts\nfunction isImmutableDefault(value) {\n  return typeof value !== \"object\" || value == null || Object.isFrozen(value);\n}\nfunction trackForMutations(isImmutable, ignorePaths, obj) {\n  const trackedProperties = trackProperties(isImmutable, ignorePaths, obj);\n  return {\n    detectMutations() {\n      return detectMutations(isImmutable, ignorePaths, trackedProperties, obj);\n    }\n  };\n}\nfunction trackProperties(isImmutable, ignorePaths = [], obj, path = \"\", checkedObjects = /* @__PURE__ */ new Set()) {\n  const tracked = {\n    value: obj\n  };\n  if (!isImmutable(obj) && !checkedObjects.has(obj)) {\n    checkedObjects.add(obj);\n    tracked.children = {};\n    for (const key in obj) {\n      const childPath = path ? path + \".\" + key : key;\n      if (ignorePaths.length && ignorePaths.indexOf(childPath) !== -1) {\n        continue;\n      }\n      tracked.children[key] = trackProperties(isImmutable, ignorePaths, obj[key], childPath);\n    }\n  }\n  return tracked;\n}\nfunction detectMutations(isImmutable, ignoredPaths = [], trackedProperty, obj, sameParentRef = false, path = \"\") {\n  const prevObj = trackedProperty ? trackedProperty.value : void 0;\n  const sameRef = prevObj === obj;\n  if (sameParentRef && !sameRef && !Number.isNaN(obj)) {\n    return {\n      wasMutated: true,\n      path\n    };\n  }\n  if (isImmutable(prevObj) || isImmutable(obj)) {\n    return {\n      wasMutated: false\n    };\n  }\n  const keysToDetect = {};\n  for (let key in trackedProperty.children) {\n    keysToDetect[key] = true;\n  }\n  for (let key in obj) {\n    keysToDetect[key] = true;\n  }\n  const hasIgnoredPaths = ignoredPaths.length > 0;\n  for (let key in keysToDetect) {\n    const nestedPath = path ? path + \".\" + key : key;\n    if (hasIgnoredPaths) {\n      const hasMatches = ignoredPaths.some((ignored) => {\n        if (ignored instanceof RegExp) {\n          return ignored.test(nestedPath);\n        }\n        return nestedPath === ignored;\n      });\n      if (hasMatches) {\n        continue;\n      }\n    }\n    const result = detectMutations(isImmutable, ignoredPaths, trackedProperty.children[key], obj[key], sameRef, nestedPath);\n    if (result.wasMutated) {\n      return result;\n    }\n  }\n  return {\n    wasMutated: false\n  };\n}\nfunction createImmutableStateInvariantMiddleware(options = {}) {\n  if (process.env.NODE_ENV === \"production\") {\n    return () => (next) => (action) => next(action);\n  } else {\n    let stringify2 = function(obj, serializer, indent, decycler) {\n      return JSON.stringify(obj, getSerialize2(serializer, decycler), indent);\n    }, getSerialize2 = function(serializer, decycler) {\n      let stack = [], keys = [];\n      if (!decycler) decycler = function(_, value) {\n        if (stack[0] === value) return \"[Circular ~]\";\n        return \"[Circular ~.\" + keys.slice(0, stack.indexOf(value)).join(\".\") + \"]\";\n      };\n      return function(key, value) {\n        if (stack.length > 0) {\n          var thisPos = stack.indexOf(this);\n          ~thisPos ? stack.splice(thisPos + 1) : stack.push(this);\n          ~thisPos ? keys.splice(thisPos, Infinity, key) : keys.push(key);\n          if (~stack.indexOf(value)) value = decycler.call(this, key, value);\n        } else stack.push(value);\n        return serializer == null ? value : serializer.call(this, key, value);\n      };\n    };\n    var stringify = stringify2, getSerialize = getSerialize2;\n    let {\n      isImmutable = isImmutableDefault,\n      ignoredPaths,\n      warnAfter = 32\n    } = options;\n    const track = trackForMutations.bind(null, isImmutable, ignoredPaths);\n    return ({\n      getState\n    }) => {\n      let state = getState();\n      let tracker = track(state);\n      let result;\n      return (next) => (action) => {\n        const measureUtils = getTimeMeasureUtils(warnAfter, \"ImmutableStateInvariantMiddleware\");\n        measureUtils.measureTime(() => {\n          state = getState();\n          result = tracker.detectMutations();\n          tracker = track(state);\n          if (result.wasMutated) {\n            throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(19) : `A state mutation was detected between dispatches, in the path '${result.path || \"\"}'.  This may cause incorrect behavior. (https://redux.js.org/style-guide/style-guide#do-not-mutate-state)`);\n          }\n        });\n        const dispatchedAction = next(action);\n        measureUtils.measureTime(() => {\n          state = getState();\n          result = tracker.detectMutations();\n          tracker = track(state);\n          if (result.wasMutated) {\n            throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(20) : `A state mutation was detected inside a dispatch, in the path: ${result.path || \"\"}. Take a look at the reducer(s) handling the action ${stringify2(action)}. (https://redux.js.org/style-guide/style-guide#do-not-mutate-state)`);\n          }\n        });\n        measureUtils.warnIfExceeded();\n        return dispatchedAction;\n      };\n    };\n  }\n}\n\n// src/serializableStateInvariantMiddleware.ts\nimport { isAction as isAction2, isPlainObject } from \"redux\";\nfunction isPlain(val) {\n  const type = typeof val;\n  return val == null || type === \"string\" || type === \"boolean\" || type === \"number\" || Array.isArray(val) || isPlainObject(val);\n}\nfunction findNonSerializableValue(value, path = \"\", isSerializable = isPlain, getEntries, ignoredPaths = [], cache) {\n  let foundNestedSerializable;\n  if (!isSerializable(value)) {\n    return {\n      keyPath: path || \"<root>\",\n      value\n    };\n  }\n  if (typeof value !== \"object\" || value === null) {\n    return false;\n  }\n  if (cache?.has(value)) return false;\n  const entries = getEntries != null ? getEntries(value) : Object.entries(value);\n  const hasIgnoredPaths = ignoredPaths.length > 0;\n  for (const [key, nestedValue] of entries) {\n    const nestedPath = path ? path + \".\" + key : key;\n    if (hasIgnoredPaths) {\n      const hasMatches = ignoredPaths.some((ignored) => {\n        if (ignored instanceof RegExp) {\n          return ignored.test(nestedPath);\n        }\n        return nestedPath === ignored;\n      });\n      if (hasMatches) {\n        continue;\n      }\n    }\n    if (!isSerializable(nestedValue)) {\n      return {\n        keyPath: nestedPath,\n        value: nestedValue\n      };\n    }\n    if (typeof nestedValue === \"object\") {\n      foundNestedSerializable = findNonSerializableValue(nestedValue, nestedPath, isSerializable, getEntries, ignoredPaths, cache);\n      if (foundNestedSerializable) {\n        return foundNestedSerializable;\n      }\n    }\n  }\n  if (cache && isNestedFrozen(value)) cache.add(value);\n  return false;\n}\nfunction isNestedFrozen(value) {\n  if (!Object.isFrozen(value)) return false;\n  for (const nestedValue of Object.values(value)) {\n    if (typeof nestedValue !== \"object\" || nestedValue === null) continue;\n    if (!isNestedFrozen(nestedValue)) return false;\n  }\n  return true;\n}\nfunction createSerializableStateInvariantMiddleware(options = {}) {\n  if (process.env.NODE_ENV === \"production\") {\n    return () => (next) => (action) => next(action);\n  } else {\n    const {\n      isSerializable = isPlain,\n      getEntries,\n      ignoredActions = [],\n      ignoredActionPaths = [\"meta.arg\", \"meta.baseQueryMeta\"],\n      ignoredPaths = [],\n      warnAfter = 32,\n      ignoreState = false,\n      ignoreActions = false,\n      disableCache = false\n    } = options;\n    const cache = !disableCache && WeakSet ? /* @__PURE__ */ new WeakSet() : void 0;\n    return (storeAPI) => (next) => (action) => {\n      if (!isAction2(action)) {\n        return next(action);\n      }\n      const result = next(action);\n      const measureUtils = getTimeMeasureUtils(warnAfter, \"SerializableStateInvariantMiddleware\");\n      if (!ignoreActions && !(ignoredActions.length && ignoredActions.indexOf(action.type) !== -1)) {\n        measureUtils.measureTime(() => {\n          const foundActionNonSerializableValue = findNonSerializableValue(action, \"\", isSerializable, getEntries, ignoredActionPaths, cache);\n          if (foundActionNonSerializableValue) {\n            const {\n              keyPath,\n              value\n            } = foundActionNonSerializableValue;\n            console.error(`A non-serializable value was detected in an action, in the path: \\`${keyPath}\\`. Value:`, value, \"\\nTake a look at the logic that dispatched this action: \", action, \"\\n(See https://redux.js.org/faq/actions#why-should-type-be-a-string-or-at-least-serializable-why-should-my-action-types-be-constants)\", \"\\n(To allow non-serializable values see: https://redux-toolkit.js.org/usage/usage-guide#working-with-non-serializable-data)\");\n          }\n        });\n      }\n      if (!ignoreState) {\n        measureUtils.measureTime(() => {\n          const state = storeAPI.getState();\n          const foundStateNonSerializableValue = findNonSerializableValue(state, \"\", isSerializable, getEntries, ignoredPaths, cache);\n          if (foundStateNonSerializableValue) {\n            const {\n              keyPath,\n              value\n            } = foundStateNonSerializableValue;\n            console.error(`A non-serializable value was detected in the state, in the path: \\`${keyPath}\\`. Value:`, value, `\nTake a look at the reducer(s) handling this action type: ${action.type}.\n(See https://redux.js.org/faq/organizing-state#can-i-put-functions-promises-or-other-non-serializable-items-in-my-store-state)`);\n          }\n        });\n        measureUtils.warnIfExceeded();\n      }\n      return result;\n    };\n  }\n}\n\n// src/getDefaultMiddleware.ts\nfunction isBoolean(x) {\n  return typeof x === \"boolean\";\n}\nvar buildGetDefaultMiddleware = () => function getDefaultMiddleware(options) {\n  const {\n    thunk = true,\n    immutableCheck = true,\n    serializableCheck = true,\n    actionCreatorCheck = true\n  } = options ?? {};\n  let middlewareArray = new Tuple();\n  if (thunk) {\n    if (isBoolean(thunk)) {\n      middlewareArray.push(thunkMiddleware);\n    } else {\n      middlewareArray.push(withExtraArgument(thunk.extraArgument));\n    }\n  }\n  if (process.env.NODE_ENV !== \"production\") {\n    if (immutableCheck) {\n      let immutableOptions = {};\n      if (!isBoolean(immutableCheck)) {\n        immutableOptions = immutableCheck;\n      }\n      middlewareArray.unshift(createImmutableStateInvariantMiddleware(immutableOptions));\n    }\n    if (serializableCheck) {\n      let serializableOptions = {};\n      if (!isBoolean(serializableCheck)) {\n        serializableOptions = serializableCheck;\n      }\n      middlewareArray.push(createSerializableStateInvariantMiddleware(serializableOptions));\n    }\n    if (actionCreatorCheck) {\n      let actionCreatorOptions = {};\n      if (!isBoolean(actionCreatorCheck)) {\n        actionCreatorOptions = actionCreatorCheck;\n      }\n      middlewareArray.unshift(createActionCreatorInvariantMiddleware(actionCreatorOptions));\n    }\n  }\n  return middlewareArray;\n};\n\n// src/autoBatchEnhancer.ts\nvar SHOULD_AUTOBATCH = \"RTK_autoBatch\";\nvar prepareAutoBatched = () => (payload) => ({\n  payload,\n  meta: {\n    [SHOULD_AUTOBATCH]: true\n  }\n});\nvar createQueueWithTimer = (timeout) => {\n  return (notify) => {\n    setTimeout(notify, timeout);\n  };\n};\nvar rAF = typeof window !== \"undefined\" && window.requestAnimationFrame ? window.requestAnimationFrame : createQueueWithTimer(10);\nvar autoBatchEnhancer = (options = {\n  type: \"raf\"\n}) => (next) => (...args) => {\n  const store = next(...args);\n  let notifying = true;\n  let shouldNotifyAtEndOfTick = false;\n  let notificationQueued = false;\n  const listeners = /* @__PURE__ */ new Set();\n  const queueCallback = options.type === \"tick\" ? queueMicrotask : options.type === \"raf\" ? rAF : options.type === \"callback\" ? options.queueNotification : createQueueWithTimer(options.timeout);\n  const notifyListeners = () => {\n    notificationQueued = false;\n    if (shouldNotifyAtEndOfTick) {\n      shouldNotifyAtEndOfTick = false;\n      listeners.forEach((l) => l());\n    }\n  };\n  return Object.assign({}, store, {\n    // Override the base `store.subscribe` method to keep original listeners\n    // from running if we're delaying notifications\n    subscribe(listener2) {\n      const wrappedListener = () => notifying && listener2();\n      const unsubscribe = store.subscribe(wrappedListener);\n      listeners.add(listener2);\n      return () => {\n        unsubscribe();\n        listeners.delete(listener2);\n      };\n    },\n    // Override the base `store.dispatch` method so that we can check actions\n    // for the `shouldAutoBatch` flag and determine if batching is active\n    dispatch(action) {\n      try {\n        notifying = !action?.meta?.[SHOULD_AUTOBATCH];\n        shouldNotifyAtEndOfTick = !notifying;\n        if (shouldNotifyAtEndOfTick) {\n          if (!notificationQueued) {\n            notificationQueued = true;\n            queueCallback(notifyListeners);\n          }\n        }\n        return store.dispatch(action);\n      } finally {\n        notifying = true;\n      }\n    }\n  });\n};\n\n// src/getDefaultEnhancers.ts\nvar buildGetDefaultEnhancers = (middlewareEnhancer) => function getDefaultEnhancers(options) {\n  const {\n    autoBatch = true\n  } = options ?? {};\n  let enhancerArray = new Tuple(middlewareEnhancer);\n  if (autoBatch) {\n    enhancerArray.push(autoBatchEnhancer(typeof autoBatch === \"object\" ? autoBatch : void 0));\n  }\n  return enhancerArray;\n};\n\n// src/configureStore.ts\nfunction configureStore(options) {\n  const getDefaultMiddleware = buildGetDefaultMiddleware();\n  const {\n    reducer = void 0,\n    middleware,\n    devTools = true,\n    preloadedState = void 0,\n    enhancers = void 0\n  } = options || {};\n  let rootReducer;\n  if (typeof reducer === \"function\") {\n    rootReducer = reducer;\n  } else if (isPlainObject2(reducer)) {\n    rootReducer = combineReducers(reducer);\n  } else {\n    throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(1) : \"`reducer` is a required argument, and must be a function or an object of functions that can be passed to combineReducers\");\n  }\n  if (process.env.NODE_ENV !== \"production\" && middleware && typeof middleware !== \"function\") {\n    throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(2) : \"`middleware` field must be a callback\");\n  }\n  let finalMiddleware;\n  if (typeof middleware === \"function\") {\n    finalMiddleware = middleware(getDefaultMiddleware);\n    if (process.env.NODE_ENV !== \"production\" && !Array.isArray(finalMiddleware)) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(3) : \"when using a middleware builder function, an array of middleware must be returned\");\n    }\n  } else {\n    finalMiddleware = getDefaultMiddleware();\n  }\n  if (process.env.NODE_ENV !== \"production\" && finalMiddleware.some((item) => typeof item !== \"function\")) {\n    throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(4) : \"each middleware provided to configureStore must be a function\");\n  }\n  let finalCompose = compose2;\n  if (devTools) {\n    finalCompose = composeWithDevTools({\n      // Enable capture of stack traces for dispatched Redux actions\n      trace: process.env.NODE_ENV !== \"production\",\n      ...typeof devTools === \"object\" && devTools\n    });\n  }\n  const middlewareEnhancer = applyMiddleware(...finalMiddleware);\n  const getDefaultEnhancers = buildGetDefaultEnhancers(middlewareEnhancer);\n  if (process.env.NODE_ENV !== \"production\" && enhancers && typeof enhancers !== \"function\") {\n    throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(5) : \"`enhancers` field must be a callback\");\n  }\n  let storeEnhancers = typeof enhancers === \"function\" ? enhancers(getDefaultEnhancers) : getDefaultEnhancers();\n  if (process.env.NODE_ENV !== \"production\" && !Array.isArray(storeEnhancers)) {\n    throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(6) : \"`enhancers` callback must return an array\");\n  }\n  if (process.env.NODE_ENV !== \"production\" && storeEnhancers.some((item) => typeof item !== \"function\")) {\n    throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(7) : \"each enhancer provided to configureStore must be a function\");\n  }\n  if (process.env.NODE_ENV !== \"production\" && finalMiddleware.length && !storeEnhancers.includes(middlewareEnhancer)) {\n    console.error(\"middlewares were provided, but middleware enhancer was not included in final enhancers - make sure to call `getDefaultEnhancers`\");\n  }\n  const composedEnhancer = finalCompose(...storeEnhancers);\n  return createStore(rootReducer, preloadedState, composedEnhancer);\n}\n\n// src/createReducer.ts\nimport { produce as createNextState2, isDraft as isDraft2, isDraftable as isDraftable2 } from \"immer\";\n\n// src/mapBuilders.ts\nfunction executeReducerBuilderCallback(builderCallback) {\n  const actionsMap = {};\n  const actionMatchers = [];\n  let defaultCaseReducer;\n  const builder = {\n    addCase(typeOrActionCreator, reducer) {\n      if (process.env.NODE_ENV !== \"production\") {\n        if (actionMatchers.length > 0) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(26) : \"`builder.addCase` should only be called before calling `builder.addMatcher`\");\n        }\n        if (defaultCaseReducer) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(27) : \"`builder.addCase` should only be called before calling `builder.addDefaultCase`\");\n        }\n      }\n      const type = typeof typeOrActionCreator === \"string\" ? typeOrActionCreator : typeOrActionCreator.type;\n      if (!type) {\n        throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(28) : \"`builder.addCase` cannot be called with an empty action type\");\n      }\n      if (type in actionsMap) {\n        throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(29) : `\\`builder.addCase\\` cannot be called with two reducers for the same action type '${type}'`);\n      }\n      actionsMap[type] = reducer;\n      return builder;\n    },\n    addMatcher(matcher, reducer) {\n      if (process.env.NODE_ENV !== \"production\") {\n        if (defaultCaseReducer) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(30) : \"`builder.addMatcher` should only be called before calling `builder.addDefaultCase`\");\n        }\n      }\n      actionMatchers.push({\n        matcher,\n        reducer\n      });\n      return builder;\n    },\n    addDefaultCase(reducer) {\n      if (process.env.NODE_ENV !== \"production\") {\n        if (defaultCaseReducer) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(31) : \"`builder.addDefaultCase` can only be called once\");\n        }\n      }\n      defaultCaseReducer = reducer;\n      return builder;\n    }\n  };\n  builderCallback(builder);\n  return [actionsMap, actionMatchers, defaultCaseReducer];\n}\n\n// src/createReducer.ts\nfunction isStateFunction(x) {\n  return typeof x === \"function\";\n}\nfunction createReducer(initialState, mapOrBuilderCallback) {\n  if (process.env.NODE_ENV !== \"production\") {\n    if (typeof mapOrBuilderCallback === \"object\") {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(8) : \"The object notation for `createReducer` has been removed. Please use the 'builder callback' notation instead: https://redux-toolkit.js.org/api/createReducer\");\n    }\n  }\n  let [actionsMap, finalActionMatchers, finalDefaultCaseReducer] = executeReducerBuilderCallback(mapOrBuilderCallback);\n  let getInitialState;\n  if (isStateFunction(initialState)) {\n    getInitialState = () => freezeDraftable(initialState());\n  } else {\n    const frozenInitialState = freezeDraftable(initialState);\n    getInitialState = () => frozenInitialState;\n  }\n  function reducer(state = getInitialState(), action) {\n    let caseReducers = [actionsMap[action.type], ...finalActionMatchers.filter(({\n      matcher\n    }) => matcher(action)).map(({\n      reducer: reducer2\n    }) => reducer2)];\n    if (caseReducers.filter((cr) => !!cr).length === 0) {\n      caseReducers = [finalDefaultCaseReducer];\n    }\n    return caseReducers.reduce((previousState, caseReducer) => {\n      if (caseReducer) {\n        if (isDraft2(previousState)) {\n          const draft = previousState;\n          const result = caseReducer(draft, action);\n          if (result === void 0) {\n            return previousState;\n          }\n          return result;\n        } else if (!isDraftable2(previousState)) {\n          const result = caseReducer(previousState, action);\n          if (result === void 0) {\n            if (previousState === null) {\n              return previousState;\n            }\n            throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(9) : \"A case reducer on a non-draftable value must not return undefined\");\n          }\n          return result;\n        } else {\n          return createNextState2(previousState, (draft) => {\n            return caseReducer(draft, action);\n          });\n        }\n      }\n      return previousState;\n    }, state);\n  }\n  reducer.getInitialState = getInitialState;\n  return reducer;\n}\n\n// src/matchers.ts\nvar matches = (matcher, action) => {\n  if (hasMatchFunction(matcher)) {\n    return matcher.match(action);\n  } else {\n    return matcher(action);\n  }\n};\nfunction isAnyOf(...matchers) {\n  return (action) => {\n    return matchers.some((matcher) => matches(matcher, action));\n  };\n}\nfunction isAllOf(...matchers) {\n  return (action) => {\n    return matchers.every((matcher) => matches(matcher, action));\n  };\n}\nfunction hasExpectedRequestMetadata(action, validStatus) {\n  if (!action || !action.meta) return false;\n  const hasValidRequestId = typeof action.meta.requestId === \"string\";\n  const hasValidRequestStatus = validStatus.indexOf(action.meta.requestStatus) > -1;\n  return hasValidRequestId && hasValidRequestStatus;\n}\nfunction isAsyncThunkArray(a) {\n  return typeof a[0] === \"function\" && \"pending\" in a[0] && \"fulfilled\" in a[0] && \"rejected\" in a[0];\n}\nfunction isPending(...asyncThunks) {\n  if (asyncThunks.length === 0) {\n    return (action) => hasExpectedRequestMetadata(action, [\"pending\"]);\n  }\n  if (!isAsyncThunkArray(asyncThunks)) {\n    return isPending()(asyncThunks[0]);\n  }\n  return isAnyOf(...asyncThunks.map((asyncThunk) => asyncThunk.pending));\n}\nfunction isRejected(...asyncThunks) {\n  if (asyncThunks.length === 0) {\n    return (action) => hasExpectedRequestMetadata(action, [\"rejected\"]);\n  }\n  if (!isAsyncThunkArray(asyncThunks)) {\n    return isRejected()(asyncThunks[0]);\n  }\n  return isAnyOf(...asyncThunks.map((asyncThunk) => asyncThunk.rejected));\n}\nfunction isRejectedWithValue(...asyncThunks) {\n  const hasFlag = (action) => {\n    return action && action.meta && action.meta.rejectedWithValue;\n  };\n  if (asyncThunks.length === 0) {\n    return isAllOf(isRejected(...asyncThunks), hasFlag);\n  }\n  if (!isAsyncThunkArray(asyncThunks)) {\n    return isRejectedWithValue()(asyncThunks[0]);\n  }\n  return isAllOf(isRejected(...asyncThunks), hasFlag);\n}\nfunction isFulfilled(...asyncThunks) {\n  if (asyncThunks.length === 0) {\n    return (action) => hasExpectedRequestMetadata(action, [\"fulfilled\"]);\n  }\n  if (!isAsyncThunkArray(asyncThunks)) {\n    return isFulfilled()(asyncThunks[0]);\n  }\n  return isAnyOf(...asyncThunks.map((asyncThunk) => asyncThunk.fulfilled));\n}\nfunction isAsyncThunkAction(...asyncThunks) {\n  if (asyncThunks.length === 0) {\n    return (action) => hasExpectedRequestMetadata(action, [\"pending\", \"fulfilled\", \"rejected\"]);\n  }\n  if (!isAsyncThunkArray(asyncThunks)) {\n    return isAsyncThunkAction()(asyncThunks[0]);\n  }\n  return isAnyOf(...asyncThunks.flatMap((asyncThunk) => [asyncThunk.pending, asyncThunk.rejected, asyncThunk.fulfilled]));\n}\n\n// src/nanoid.ts\nvar urlAlphabet = \"ModuleSymbhasOwnPr-0123456789ABCDEFGHNRVfgctiUvz_KqYTJkLxpZXIjQW\";\nvar nanoid = (size = 21) => {\n  let id = \"\";\n  let i = size;\n  while (i--) {\n    id += urlAlphabet[Math.random() * 64 | 0];\n  }\n  return id;\n};\n\n// src/createAsyncThunk.ts\nvar commonProperties = [\"name\", \"message\", \"stack\", \"code\"];\nvar RejectWithValue = class {\n  constructor(payload, meta) {\n    this.payload = payload;\n    this.meta = meta;\n  }\n  /*\n  type-only property to distinguish between RejectWithValue and FulfillWithMeta\n  does not exist at runtime\n  */\n  _type;\n};\nvar FulfillWithMeta = class {\n  constructor(payload, meta) {\n    this.payload = payload;\n    this.meta = meta;\n  }\n  /*\n  type-only property to distinguish between RejectWithValue and FulfillWithMeta\n  does not exist at runtime\n  */\n  _type;\n};\nvar miniSerializeError = (value) => {\n  if (typeof value === \"object\" && value !== null) {\n    const simpleError = {};\n    for (const property of commonProperties) {\n      if (typeof value[property] === \"string\") {\n        simpleError[property] = value[property];\n      }\n    }\n    return simpleError;\n  }\n  return {\n    message: String(value)\n  };\n};\nvar createAsyncThunk = /* @__PURE__ */ (() => {\n  function createAsyncThunk2(typePrefix, payloadCreator, options) {\n    const fulfilled = createAction(typePrefix + \"/fulfilled\", (payload, requestId, arg, meta) => ({\n      payload,\n      meta: {\n        ...meta || {},\n        arg,\n        requestId,\n        requestStatus: \"fulfilled\"\n      }\n    }));\n    const pending = createAction(typePrefix + \"/pending\", (requestId, arg, meta) => ({\n      payload: void 0,\n      meta: {\n        ...meta || {},\n        arg,\n        requestId,\n        requestStatus: \"pending\"\n      }\n    }));\n    const rejected = createAction(typePrefix + \"/rejected\", (error, requestId, arg, payload, meta) => ({\n      payload,\n      error: (options && options.serializeError || miniSerializeError)(error || \"Rejected\"),\n      meta: {\n        ...meta || {},\n        arg,\n        requestId,\n        rejectedWithValue: !!payload,\n        requestStatus: \"rejected\",\n        aborted: error?.name === \"AbortError\",\n        condition: error?.name === \"ConditionError\"\n      }\n    }));\n    function actionCreator(arg) {\n      return (dispatch, getState, extra) => {\n        const requestId = options?.idGenerator ? options.idGenerator(arg) : nanoid();\n        const abortController = new AbortController();\n        let abortHandler;\n        let abortReason;\n        function abort(reason) {\n          abortReason = reason;\n          abortController.abort();\n        }\n        const promise = async function() {\n          let finalAction;\n          try {\n            let conditionResult = options?.condition?.(arg, {\n              getState,\n              extra\n            });\n            if (isThenable(conditionResult)) {\n              conditionResult = await conditionResult;\n            }\n            if (conditionResult === false || abortController.signal.aborted) {\n              throw {\n                name: \"ConditionError\",\n                message: \"Aborted due to condition callback returning false.\"\n              };\n            }\n            const abortedPromise = new Promise((_, reject) => {\n              abortHandler = () => {\n                reject({\n                  name: \"AbortError\",\n                  message: abortReason || \"Aborted\"\n                });\n              };\n              abortController.signal.addEventListener(\"abort\", abortHandler);\n            });\n            dispatch(pending(requestId, arg, options?.getPendingMeta?.({\n              requestId,\n              arg\n            }, {\n              getState,\n              extra\n            })));\n            finalAction = await Promise.race([abortedPromise, Promise.resolve(payloadCreator(arg, {\n              dispatch,\n              getState,\n              extra,\n              requestId,\n              signal: abortController.signal,\n              abort,\n              rejectWithValue: (value, meta) => {\n                return new RejectWithValue(value, meta);\n              },\n              fulfillWithValue: (value, meta) => {\n                return new FulfillWithMeta(value, meta);\n              }\n            })).then((result) => {\n              if (result instanceof RejectWithValue) {\n                throw result;\n              }\n              if (result instanceof FulfillWithMeta) {\n                return fulfilled(result.payload, requestId, arg, result.meta);\n              }\n              return fulfilled(result, requestId, arg);\n            })]);\n          } catch (err) {\n            finalAction = err instanceof RejectWithValue ? rejected(null, requestId, arg, err.payload, err.meta) : rejected(err, requestId, arg);\n          } finally {\n            if (abortHandler) {\n              abortController.signal.removeEventListener(\"abort\", abortHandler);\n            }\n          }\n          const skipDispatch = options && !options.dispatchConditionRejection && rejected.match(finalAction) && finalAction.meta.condition;\n          if (!skipDispatch) {\n            dispatch(finalAction);\n          }\n          return finalAction;\n        }();\n        return Object.assign(promise, {\n          abort,\n          requestId,\n          arg,\n          unwrap() {\n            return promise.then(unwrapResult);\n          }\n        });\n      };\n    }\n    return Object.assign(actionCreator, {\n      pending,\n      rejected,\n      fulfilled,\n      settled: isAnyOf(rejected, fulfilled),\n      typePrefix\n    });\n  }\n  createAsyncThunk2.withTypes = () => createAsyncThunk2;\n  return createAsyncThunk2;\n})();\nfunction unwrapResult(action) {\n  if (action.meta && action.meta.rejectedWithValue) {\n    throw action.payload;\n  }\n  if (action.error) {\n    throw action.error;\n  }\n  return action.payload;\n}\nfunction isThenable(value) {\n  return value !== null && typeof value === \"object\" && typeof value.then === \"function\";\n}\n\n// src/createSlice.ts\nvar asyncThunkSymbol = /* @__PURE__ */ Symbol.for(\"rtk-slice-createasyncthunk\");\nvar asyncThunkCreator = {\n  [asyncThunkSymbol]: createAsyncThunk\n};\nvar ReducerType = /* @__PURE__ */ ((ReducerType2) => {\n  ReducerType2[\"reducer\"] = \"reducer\";\n  ReducerType2[\"reducerWithPrepare\"] = \"reducerWithPrepare\";\n  ReducerType2[\"asyncThunk\"] = \"asyncThunk\";\n  return ReducerType2;\n})(ReducerType || {});\nfunction getType(slice, actionKey) {\n  return `${slice}/${actionKey}`;\n}\nfunction buildCreateSlice({\n  creators\n} = {}) {\n  const cAT = creators?.asyncThunk?.[asyncThunkSymbol];\n  return function createSlice2(options) {\n    const {\n      name,\n      reducerPath = name\n    } = options;\n    if (!name) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(11) : \"`name` is a required option for createSlice\");\n    }\n    if (typeof process !== \"undefined\" && process.env.NODE_ENV === \"development\") {\n      if (options.initialState === void 0) {\n        console.error(\"You must provide an `initialState` value that is not `undefined`. You may have misspelled `initialState`\");\n      }\n    }\n    const reducers = (typeof options.reducers === \"function\" ? options.reducers(buildReducerCreators()) : options.reducers) || {};\n    const reducerNames = Object.keys(reducers);\n    const context = {\n      sliceCaseReducersByName: {},\n      sliceCaseReducersByType: {},\n      actionCreators: {},\n      sliceMatchers: []\n    };\n    const contextMethods = {\n      addCase(typeOrActionCreator, reducer2) {\n        const type = typeof typeOrActionCreator === \"string\" ? typeOrActionCreator : typeOrActionCreator.type;\n        if (!type) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(12) : \"`context.addCase` cannot be called with an empty action type\");\n        }\n        if (type in context.sliceCaseReducersByType) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(13) : \"`context.addCase` cannot be called with two reducers for the same action type: \" + type);\n        }\n        context.sliceCaseReducersByType[type] = reducer2;\n        return contextMethods;\n      },\n      addMatcher(matcher, reducer2) {\n        context.sliceMatchers.push({\n          matcher,\n          reducer: reducer2\n        });\n        return contextMethods;\n      },\n      exposeAction(name2, actionCreator) {\n        context.actionCreators[name2] = actionCreator;\n        return contextMethods;\n      },\n      exposeCaseReducer(name2, reducer2) {\n        context.sliceCaseReducersByName[name2] = reducer2;\n        return contextMethods;\n      }\n    };\n    reducerNames.forEach((reducerName) => {\n      const reducerDefinition = reducers[reducerName];\n      const reducerDetails = {\n        reducerName,\n        type: getType(name, reducerName),\n        createNotation: typeof options.reducers === \"function\"\n      };\n      if (isAsyncThunkSliceReducerDefinition(reducerDefinition)) {\n        handleThunkCaseReducerDefinition(reducerDetails, reducerDefinition, contextMethods, cAT);\n      } else {\n        handleNormalReducerDefinition(reducerDetails, reducerDefinition, contextMethods);\n      }\n    });\n    function buildReducer() {\n      if (process.env.NODE_ENV !== \"production\") {\n        if (typeof options.extraReducers === \"object\") {\n          throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(14) : \"The object notation for `createSlice.extraReducers` has been removed. Please use the 'builder callback' notation instead: https://redux-toolkit.js.org/api/createSlice\");\n        }\n      }\n      const [extraReducers = {}, actionMatchers = [], defaultCaseReducer = void 0] = typeof options.extraReducers === \"function\" ? executeReducerBuilderCallback(options.extraReducers) : [options.extraReducers];\n      const finalCaseReducers = {\n        ...extraReducers,\n        ...context.sliceCaseReducersByType\n      };\n      return createReducer(options.initialState, (builder) => {\n        for (let key in finalCaseReducers) {\n          builder.addCase(key, finalCaseReducers[key]);\n        }\n        for (let sM of context.sliceMatchers) {\n          builder.addMatcher(sM.matcher, sM.reducer);\n        }\n        for (let m of actionMatchers) {\n          builder.addMatcher(m.matcher, m.reducer);\n        }\n        if (defaultCaseReducer) {\n          builder.addDefaultCase(defaultCaseReducer);\n        }\n      });\n    }\n    const selectSelf = (state) => state;\n    const injectedSelectorCache = /* @__PURE__ */ new Map();\n    let _reducer;\n    function reducer(state, action) {\n      if (!_reducer) _reducer = buildReducer();\n      return _reducer(state, action);\n    }\n    function getInitialState() {\n      if (!_reducer) _reducer = buildReducer();\n      return _reducer.getInitialState();\n    }\n    function makeSelectorProps(reducerPath2, injected = false) {\n      function selectSlice(state) {\n        let sliceState = state[reducerPath2];\n        if (typeof sliceState === \"undefined\") {\n          if (injected) {\n            sliceState = getInitialState();\n          } else if (process.env.NODE_ENV !== \"production\") {\n            throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(15) : \"selectSlice returned undefined for an uninjected slice reducer\");\n          }\n        }\n        return sliceState;\n      }\n      function getSelectors(selectState = selectSelf) {\n        const selectorCache = emplace(injectedSelectorCache, injected, {\n          insert: () => /* @__PURE__ */ new WeakMap()\n        });\n        return emplace(selectorCache, selectState, {\n          insert: () => {\n            const map = {};\n            for (const [name2, selector] of Object.entries(options.selectors ?? {})) {\n              map[name2] = wrapSelector(selector, selectState, getInitialState, injected);\n            }\n            return map;\n          }\n        });\n      }\n      return {\n        reducerPath: reducerPath2,\n        getSelectors,\n        get selectors() {\n          return getSelectors(selectSlice);\n        },\n        selectSlice\n      };\n    }\n    const slice = {\n      name,\n      reducer,\n      actions: context.actionCreators,\n      caseReducers: context.sliceCaseReducersByName,\n      getInitialState,\n      ...makeSelectorProps(reducerPath),\n      injectInto(injectable, {\n        reducerPath: pathOpt,\n        ...config\n      } = {}) {\n        const newReducerPath = pathOpt ?? reducerPath;\n        injectable.inject({\n          reducerPath: newReducerPath,\n          reducer\n        }, config);\n        return {\n          ...slice,\n          ...makeSelectorProps(newReducerPath, true)\n        };\n      }\n    };\n    return slice;\n  };\n}\nfunction wrapSelector(selector, selectState, getInitialState, injected) {\n  function wrapper(rootState, ...args) {\n    let sliceState = selectState(rootState);\n    if (typeof sliceState === \"undefined\") {\n      if (injected) {\n        sliceState = getInitialState();\n      } else if (process.env.NODE_ENV !== \"production\") {\n        throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(16) : \"selectState returned undefined for an uninjected slice reducer\");\n      }\n    }\n    return selector(sliceState, ...args);\n  }\n  wrapper.unwrapped = selector;\n  return wrapper;\n}\nvar createSlice = /* @__PURE__ */ buildCreateSlice();\nfunction buildReducerCreators() {\n  function asyncThunk(payloadCreator, config) {\n    return {\n      _reducerDefinitionType: \"asyncThunk\" /* asyncThunk */,\n      payloadCreator,\n      ...config\n    };\n  }\n  asyncThunk.withTypes = () => asyncThunk;\n  return {\n    reducer(caseReducer) {\n      return Object.assign({\n        // hack so the wrapping function has the same name as the original\n        // we need to create a wrapper so the `reducerDefinitionType` is not assigned to the original\n        [caseReducer.name](...args) {\n          return caseReducer(...args);\n        }\n      }[caseReducer.name], {\n        _reducerDefinitionType: \"reducer\" /* reducer */\n      });\n    },\n    preparedReducer(prepare, reducer) {\n      return {\n        _reducerDefinitionType: \"reducerWithPrepare\" /* reducerWithPrepare */,\n        prepare,\n        reducer\n      };\n    },\n    asyncThunk\n  };\n}\nfunction handleNormalReducerDefinition({\n  type,\n  reducerName,\n  createNotation\n}, maybeReducerWithPrepare, context) {\n  let caseReducer;\n  let prepareCallback;\n  if (\"reducer\" in maybeReducerWithPrepare) {\n    if (createNotation && !isCaseReducerWithPrepareDefinition(maybeReducerWithPrepare)) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(17) : \"Please use the `create.preparedReducer` notation for prepared action creators with the `create` notation.\");\n    }\n    caseReducer = maybeReducerWithPrepare.reducer;\n    prepareCallback = maybeReducerWithPrepare.prepare;\n  } else {\n    caseReducer = maybeReducerWithPrepare;\n  }\n  context.addCase(type, caseReducer).exposeCaseReducer(reducerName, caseReducer).exposeAction(reducerName, prepareCallback ? createAction(type, prepareCallback) : createAction(type));\n}\nfunction isAsyncThunkSliceReducerDefinition(reducerDefinition) {\n  return reducerDefinition._reducerDefinitionType === \"asyncThunk\" /* asyncThunk */;\n}\nfunction isCaseReducerWithPrepareDefinition(reducerDefinition) {\n  return reducerDefinition._reducerDefinitionType === \"reducerWithPrepare\" /* reducerWithPrepare */;\n}\nfunction handleThunkCaseReducerDefinition({\n  type,\n  reducerName\n}, reducerDefinition, context, cAT) {\n  if (!cAT) {\n    throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(18) : \"Cannot use `create.asyncThunk` in the built-in `createSlice`. Use `buildCreateSlice({ creators: { asyncThunk: asyncThunkCreator } })` to create a customised version of `createSlice`.\");\n  }\n  const {\n    payloadCreator,\n    fulfilled,\n    pending,\n    rejected,\n    settled,\n    options\n  } = reducerDefinition;\n  const thunk = cAT(type, payloadCreator, options);\n  context.exposeAction(reducerName, thunk);\n  if (fulfilled) {\n    context.addCase(thunk.fulfilled, fulfilled);\n  }\n  if (pending) {\n    context.addCase(thunk.pending, pending);\n  }\n  if (rejected) {\n    context.addCase(thunk.rejected, rejected);\n  }\n  if (settled) {\n    context.addMatcher(thunk.settled, settled);\n  }\n  context.exposeCaseReducer(reducerName, {\n    fulfilled: fulfilled || noop,\n    pending: pending || noop,\n    rejected: rejected || noop,\n    settled: settled || noop\n  });\n}\nfunction noop() {\n}\n\n// src/entities/entity_state.ts\nfunction getInitialEntityState() {\n  return {\n    ids: [],\n    entities: {}\n  };\n}\nfunction createInitialStateFactory(stateAdapter) {\n  function getInitialState(additionalState = {}, entities) {\n    const state = Object.assign(getInitialEntityState(), additionalState);\n    return entities ? stateAdapter.setAll(state, entities) : state;\n  }\n  return {\n    getInitialState\n  };\n}\n\n// src/entities/state_selectors.ts\nfunction createSelectorsFactory() {\n  function getSelectors(selectState, options = {}) {\n    const {\n      createSelector: createSelector2 = createDraftSafeSelector\n    } = options;\n    const selectIds = (state) => state.ids;\n    const selectEntities = (state) => state.entities;\n    const selectAll = createSelector2(selectIds, selectEntities, (ids, entities) => ids.map((id) => entities[id]));\n    const selectId = (_, id) => id;\n    const selectById = (entities, id) => entities[id];\n    const selectTotal = createSelector2(selectIds, (ids) => ids.length);\n    if (!selectState) {\n      return {\n        selectIds,\n        selectEntities,\n        selectAll,\n        selectTotal,\n        selectById: createSelector2(selectEntities, selectId, selectById)\n      };\n    }\n    const selectGlobalizedEntities = createSelector2(selectState, selectEntities);\n    return {\n      selectIds: createSelector2(selectState, selectIds),\n      selectEntities: selectGlobalizedEntities,\n      selectAll: createSelector2(selectState, selectAll),\n      selectTotal: createSelector2(selectState, selectTotal),\n      selectById: createSelector2(selectGlobalizedEntities, selectId, selectById)\n    };\n  }\n  return {\n    getSelectors\n  };\n}\n\n// src/entities/state_adapter.ts\nimport { produce as createNextState3, isDraft as isDraft3 } from \"immer\";\nvar isDraftTyped = isDraft3;\nfunction createSingleArgumentStateOperator(mutator) {\n  const operator = createStateOperator((_, state) => mutator(state));\n  return function operation(state) {\n    return operator(state, void 0);\n  };\n}\nfunction createStateOperator(mutator) {\n  return function operation(state, arg) {\n    function isPayloadActionArgument(arg2) {\n      return isFSA(arg2);\n    }\n    const runMutator = (draft) => {\n      if (isPayloadActionArgument(arg)) {\n        mutator(arg.payload, draft);\n      } else {\n        mutator(arg, draft);\n      }\n    };\n    if (isDraftTyped(state)) {\n      runMutator(state);\n      return state;\n    }\n    return createNextState3(state, runMutator);\n  };\n}\n\n// src/entities/utils.ts\nimport { current as current2, isDraft as isDraft4 } from \"immer\";\nfunction selectIdValue(entity, selectId) {\n  const key = selectId(entity);\n  if (process.env.NODE_ENV !== \"production\" && key === void 0) {\n    console.warn(\"The entity passed to the `selectId` implementation returned undefined.\", \"You should probably provide your own `selectId` implementation.\", \"The entity that was passed:\", entity, \"The `selectId` implementation:\", selectId.toString());\n  }\n  return key;\n}\nfunction ensureEntitiesArray(entities) {\n  if (!Array.isArray(entities)) {\n    entities = Object.values(entities);\n  }\n  return entities;\n}\nfunction getCurrent(value) {\n  return isDraft4(value) ? current2(value) : value;\n}\nfunction splitAddedUpdatedEntities(newEntities, selectId, state) {\n  newEntities = ensureEntitiesArray(newEntities);\n  const existingIdsArray = getCurrent(state.ids);\n  const existingIds = new Set(existingIdsArray);\n  const added = [];\n  const updated = [];\n  for (const entity of newEntities) {\n    const id = selectIdValue(entity, selectId);\n    if (existingIds.has(id)) {\n      updated.push({\n        id,\n        changes: entity\n      });\n    } else {\n      added.push(entity);\n    }\n  }\n  return [added, updated, existingIdsArray];\n}\n\n// src/entities/unsorted_state_adapter.ts\nfunction createUnsortedStateAdapter(selectId) {\n  function addOneMutably(entity, state) {\n    const key = selectIdValue(entity, selectId);\n    if (key in state.entities) {\n      return;\n    }\n    state.ids.push(key);\n    state.entities[key] = entity;\n  }\n  function addManyMutably(newEntities, state) {\n    newEntities = ensureEntitiesArray(newEntities);\n    for (const entity of newEntities) {\n      addOneMutably(entity, state);\n    }\n  }\n  function setOneMutably(entity, state) {\n    const key = selectIdValue(entity, selectId);\n    if (!(key in state.entities)) {\n      state.ids.push(key);\n    }\n    ;\n    state.entities[key] = entity;\n  }\n  function setManyMutably(newEntities, state) {\n    newEntities = ensureEntitiesArray(newEntities);\n    for (const entity of newEntities) {\n      setOneMutably(entity, state);\n    }\n  }\n  function setAllMutably(newEntities, state) {\n    newEntities = ensureEntitiesArray(newEntities);\n    state.ids = [];\n    state.entities = {};\n    addManyMutably(newEntities, state);\n  }\n  function removeOneMutably(key, state) {\n    return removeManyMutably([key], state);\n  }\n  function removeManyMutably(keys, state) {\n    let didMutate = false;\n    keys.forEach((key) => {\n      if (key in state.entities) {\n        delete state.entities[key];\n        didMutate = true;\n      }\n    });\n    if (didMutate) {\n      state.ids = state.ids.filter((id) => id in state.entities);\n    }\n  }\n  function removeAllMutably(state) {\n    Object.assign(state, {\n      ids: [],\n      entities: {}\n    });\n  }\n  function takeNewKey(keys, update, state) {\n    const original3 = state.entities[update.id];\n    if (original3 === void 0) {\n      return false;\n    }\n    const updated = Object.assign({}, original3, update.changes);\n    const newKey = selectIdValue(updated, selectId);\n    const hasNewKey = newKey !== update.id;\n    if (hasNewKey) {\n      keys[update.id] = newKey;\n      delete state.entities[update.id];\n    }\n    ;\n    state.entities[newKey] = updated;\n    return hasNewKey;\n  }\n  function updateOneMutably(update, state) {\n    return updateManyMutably([update], state);\n  }\n  function updateManyMutably(updates, state) {\n    const newKeys = {};\n    const updatesPerEntity = {};\n    updates.forEach((update) => {\n      if (update.id in state.entities) {\n        updatesPerEntity[update.id] = {\n          id: update.id,\n          // Spreads ignore falsy values, so this works even if there isn't\n          // an existing update already at this key\n          changes: {\n            ...updatesPerEntity[update.id]?.changes,\n            ...update.changes\n          }\n        };\n      }\n    });\n    updates = Object.values(updatesPerEntity);\n    const didMutateEntities = updates.length > 0;\n    if (didMutateEntities) {\n      const didMutateIds = updates.filter((update) => takeNewKey(newKeys, update, state)).length > 0;\n      if (didMutateIds) {\n        state.ids = Object.values(state.entities).map((e) => selectIdValue(e, selectId));\n      }\n    }\n  }\n  function upsertOneMutably(entity, state) {\n    return upsertManyMutably([entity], state);\n  }\n  function upsertManyMutably(newEntities, state) {\n    const [added, updated] = splitAddedUpdatedEntities(newEntities, selectId, state);\n    updateManyMutably(updated, state);\n    addManyMutably(added, state);\n  }\n  return {\n    removeAll: createSingleArgumentStateOperator(removeAllMutably),\n    addOne: createStateOperator(addOneMutably),\n    addMany: createStateOperator(addManyMutably),\n    setOne: createStateOperator(setOneMutably),\n    setMany: createStateOperator(setManyMutably),\n    setAll: createStateOperator(setAllMutably),\n    updateOne: createStateOperator(updateOneMutably),\n    updateMany: createStateOperator(updateManyMutably),\n    upsertOne: createStateOperator(upsertOneMutably),\n    upsertMany: createStateOperator(upsertManyMutably),\n    removeOne: createStateOperator(removeOneMutably),\n    removeMany: createStateOperator(removeManyMutably)\n  };\n}\n\n// src/entities/sorted_state_adapter.ts\nfunction findInsertIndex(sortedItems, item, comparisonFunction) {\n  let lowIndex = 0;\n  let highIndex = sortedItems.length;\n  while (lowIndex < highIndex) {\n    let middleIndex = lowIndex + highIndex >>> 1;\n    const currentItem = sortedItems[middleIndex];\n    const res = comparisonFunction(item, currentItem);\n    if (res >= 0) {\n      lowIndex = middleIndex + 1;\n    } else {\n      highIndex = middleIndex;\n    }\n  }\n  return lowIndex;\n}\nfunction insert(sortedItems, item, comparisonFunction) {\n  const insertAtIndex = findInsertIndex(sortedItems, item, comparisonFunction);\n  sortedItems.splice(insertAtIndex, 0, item);\n  return sortedItems;\n}\nfunction createSortedStateAdapter(selectId, comparer) {\n  const {\n    removeOne,\n    removeMany,\n    removeAll\n  } = createUnsortedStateAdapter(selectId);\n  function addOneMutably(entity, state) {\n    return addManyMutably([entity], state);\n  }\n  function addManyMutably(newEntities, state, existingIds) {\n    newEntities = ensureEntitiesArray(newEntities);\n    const existingKeys = new Set(existingIds ?? getCurrent(state.ids));\n    const models = newEntities.filter((model) => !existingKeys.has(selectIdValue(model, selectId)));\n    if (models.length !== 0) {\n      mergeFunction(state, models);\n    }\n  }\n  function setOneMutably(entity, state) {\n    return setManyMutably([entity], state);\n  }\n  function setManyMutably(newEntities, state) {\n    newEntities = ensureEntitiesArray(newEntities);\n    if (newEntities.length !== 0) {\n      for (const item of newEntities) {\n        delete state.entities[selectId(item)];\n      }\n      mergeFunction(state, newEntities);\n    }\n  }\n  function setAllMutably(newEntities, state) {\n    newEntities = ensureEntitiesArray(newEntities);\n    state.entities = {};\n    state.ids = [];\n    addManyMutably(newEntities, state, []);\n  }\n  function updateOneMutably(update, state) {\n    return updateManyMutably([update], state);\n  }\n  function updateManyMutably(updates, state) {\n    let appliedUpdates = false;\n    let replacedIds = false;\n    for (let update of updates) {\n      const entity = state.entities[update.id];\n      if (!entity) {\n        continue;\n      }\n      appliedUpdates = true;\n      Object.assign(entity, update.changes);\n      const newId = selectId(entity);\n      if (update.id !== newId) {\n        replacedIds = true;\n        delete state.entities[update.id];\n        const oldIndex = state.ids.indexOf(update.id);\n        state.ids[oldIndex] = newId;\n        state.entities[newId] = entity;\n      }\n    }\n    if (appliedUpdates) {\n      mergeFunction(state, [], appliedUpdates, replacedIds);\n    }\n  }\n  function upsertOneMutably(entity, state) {\n    return upsertManyMutably([entity], state);\n  }\n  function upsertManyMutably(newEntities, state) {\n    const [added, updated, existingIdsArray] = splitAddedUpdatedEntities(newEntities, selectId, state);\n    if (updated.length) {\n      updateManyMutably(updated, state);\n    }\n    if (added.length) {\n      addManyMutably(added, state, existingIdsArray);\n    }\n  }\n  function areArraysEqual(a, b) {\n    if (a.length !== b.length) {\n      return false;\n    }\n    for (let i = 0; i < a.length; i++) {\n      if (a[i] === b[i]) {\n        continue;\n      }\n      return false;\n    }\n    return true;\n  }\n  const mergeFunction = (state, addedItems, appliedUpdates, replacedIds) => {\n    const currentEntities = getCurrent(state.entities);\n    const currentIds = getCurrent(state.ids);\n    const stateEntities = state.entities;\n    let ids = currentIds;\n    if (replacedIds) {\n      ids = new Set(currentIds);\n    }\n    let sortedEntities = [];\n    for (const id of ids) {\n      const entity = currentEntities[id];\n      if (entity) {\n        sortedEntities.push(entity);\n      }\n    }\n    const wasPreviouslyEmpty = sortedEntities.length === 0;\n    for (const item of addedItems) {\n      stateEntities[selectId(item)] = item;\n      if (!wasPreviouslyEmpty) {\n        insert(sortedEntities, item, comparer);\n      }\n    }\n    if (wasPreviouslyEmpty) {\n      sortedEntities = addedItems.slice().sort(comparer);\n    } else if (appliedUpdates) {\n      sortedEntities.sort(comparer);\n    }\n    const newSortedIds = sortedEntities.map(selectId);\n    if (!areArraysEqual(currentIds, newSortedIds)) {\n      state.ids = newSortedIds;\n    }\n  };\n  return {\n    removeOne,\n    removeMany,\n    removeAll,\n    addOne: createStateOperator(addOneMutably),\n    updateOne: createStateOperator(updateOneMutably),\n    upsertOne: createStateOperator(upsertOneMutably),\n    setOne: createStateOperator(setOneMutably),\n    setMany: createStateOperator(setManyMutably),\n    setAll: createStateOperator(setAllMutably),\n    addMany: createStateOperator(addManyMutably),\n    updateMany: createStateOperator(updateManyMutably),\n    upsertMany: createStateOperator(upsertManyMutably)\n  };\n}\n\n// src/entities/create_adapter.ts\nfunction createEntityAdapter(options = {}) {\n  const {\n    selectId,\n    sortComparer\n  } = {\n    sortComparer: false,\n    selectId: (instance) => instance.id,\n    ...options\n  };\n  const stateAdapter = sortComparer ? createSortedStateAdapter(selectId, sortComparer) : createUnsortedStateAdapter(selectId);\n  const stateFactory = createInitialStateFactory(stateAdapter);\n  const selectorsFactory = createSelectorsFactory();\n  return {\n    selectId,\n    sortComparer,\n    ...stateFactory,\n    ...selectorsFactory,\n    ...stateAdapter\n  };\n}\n\n// src/listenerMiddleware/index.ts\nimport { isAction as isAction3 } from \"redux\";\n\n// src/listenerMiddleware/exceptions.ts\nvar task = \"task\";\nvar listener = \"listener\";\nvar completed = \"completed\";\nvar cancelled = \"cancelled\";\nvar taskCancelled = `task-${cancelled}`;\nvar taskCompleted = `task-${completed}`;\nvar listenerCancelled = `${listener}-${cancelled}`;\nvar listenerCompleted = `${listener}-${completed}`;\nvar TaskAbortError = class {\n  constructor(code) {\n    this.code = code;\n    this.message = `${task} ${cancelled} (reason: ${code})`;\n  }\n  name = \"TaskAbortError\";\n  message;\n};\n\n// src/listenerMiddleware/utils.ts\nvar assertFunction = (func, expected) => {\n  if (typeof func !== \"function\") {\n    throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(32) : `${expected} is not a function`);\n  }\n};\nvar noop2 = () => {\n};\nvar catchRejection = (promise, onError = noop2) => {\n  promise.catch(onError);\n  return promise;\n};\nvar addAbortSignalListener = (abortSignal, callback) => {\n  abortSignal.addEventListener(\"abort\", callback, {\n    once: true\n  });\n  return () => abortSignal.removeEventListener(\"abort\", callback);\n};\nvar abortControllerWithReason = (abortController, reason) => {\n  const signal = abortController.signal;\n  if (signal.aborted) {\n    return;\n  }\n  if (!(\"reason\" in signal)) {\n    Object.defineProperty(signal, \"reason\", {\n      enumerable: true,\n      value: reason,\n      configurable: true,\n      writable: true\n    });\n  }\n  ;\n  abortController.abort(reason);\n};\n\n// src/listenerMiddleware/task.ts\nvar validateActive = (signal) => {\n  if (signal.aborted) {\n    const {\n      reason\n    } = signal;\n    throw new TaskAbortError(reason);\n  }\n};\nfunction raceWithSignal(signal, promise) {\n  let cleanup = noop2;\n  return new Promise((resolve, reject) => {\n    const notifyRejection = () => reject(new TaskAbortError(signal.reason));\n    if (signal.aborted) {\n      notifyRejection();\n      return;\n    }\n    cleanup = addAbortSignalListener(signal, notifyRejection);\n    promise.finally(() => cleanup()).then(resolve, reject);\n  }).finally(() => {\n    cleanup = noop2;\n  });\n}\nvar runTask = async (task2, cleanUp) => {\n  try {\n    await Promise.resolve();\n    const value = await task2();\n    return {\n      status: \"ok\",\n      value\n    };\n  } catch (error) {\n    return {\n      status: error instanceof TaskAbortError ? \"cancelled\" : \"rejected\",\n      error\n    };\n  } finally {\n    cleanUp?.();\n  }\n};\nvar createPause = (signal) => {\n  return (promise) => {\n    return catchRejection(raceWithSignal(signal, promise).then((output) => {\n      validateActive(signal);\n      return output;\n    }));\n  };\n};\nvar createDelay = (signal) => {\n  const pause = createPause(signal);\n  return (timeoutMs) => {\n    return pause(new Promise((resolve) => setTimeout(resolve, timeoutMs)));\n  };\n};\n\n// src/listenerMiddleware/index.ts\nvar {\n  assign\n} = Object;\nvar INTERNAL_NIL_TOKEN = {};\nvar alm = \"listenerMiddleware\";\nvar createFork = (parentAbortSignal, parentBlockingPromises) => {\n  const linkControllers = (controller) => addAbortSignalListener(parentAbortSignal, () => abortControllerWithReason(controller, parentAbortSignal.reason));\n  return (taskExecutor, opts) => {\n    assertFunction(taskExecutor, \"taskExecutor\");\n    const childAbortController = new AbortController();\n    linkControllers(childAbortController);\n    const result = runTask(async () => {\n      validateActive(parentAbortSignal);\n      validateActive(childAbortController.signal);\n      const result2 = await taskExecutor({\n        pause: createPause(childAbortController.signal),\n        delay: createDelay(childAbortController.signal),\n        signal: childAbortController.signal\n      });\n      validateActive(childAbortController.signal);\n      return result2;\n    }, () => abortControllerWithReason(childAbortController, taskCompleted));\n    if (opts?.autoJoin) {\n      parentBlockingPromises.push(result.catch(noop2));\n    }\n    return {\n      result: createPause(parentAbortSignal)(result),\n      cancel() {\n        abortControllerWithReason(childAbortController, taskCancelled);\n      }\n    };\n  };\n};\nvar createTakePattern = (startListening, signal) => {\n  const take = async (predicate, timeout) => {\n    validateActive(signal);\n    let unsubscribe = () => {\n    };\n    const tuplePromise = new Promise((resolve, reject) => {\n      let stopListening = startListening({\n        predicate,\n        effect: (action, listenerApi) => {\n          listenerApi.unsubscribe();\n          resolve([action, listenerApi.getState(), listenerApi.getOriginalState()]);\n        }\n      });\n      unsubscribe = () => {\n        stopListening();\n        reject();\n      };\n    });\n    const promises = [tuplePromise];\n    if (timeout != null) {\n      promises.push(new Promise((resolve) => setTimeout(resolve, timeout, null)));\n    }\n    try {\n      const output = await raceWithSignal(signal, Promise.race(promises));\n      validateActive(signal);\n      return output;\n    } finally {\n      unsubscribe();\n    }\n  };\n  return (predicate, timeout) => catchRejection(take(predicate, timeout));\n};\nvar getListenerEntryPropsFrom = (options) => {\n  let {\n    type,\n    actionCreator,\n    matcher,\n    predicate,\n    effect\n  } = options;\n  if (type) {\n    predicate = createAction(type).match;\n  } else if (actionCreator) {\n    type = actionCreator.type;\n    predicate = actionCreator.match;\n  } else if (matcher) {\n    predicate = matcher;\n  } else if (predicate) {\n  } else {\n    throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(21) : \"Creating or removing a listener requires one of the known fields for matching an action\");\n  }\n  assertFunction(effect, \"options.listener\");\n  return {\n    predicate,\n    type,\n    effect\n  };\n};\nvar createListenerEntry = /* @__PURE__ */ assign((options) => {\n  const {\n    type,\n    predicate,\n    effect\n  } = getListenerEntryPropsFrom(options);\n  const id = nanoid();\n  const entry = {\n    id,\n    effect,\n    type,\n    predicate,\n    pending: /* @__PURE__ */ new Set(),\n    unsubscribe: () => {\n      throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(22) : \"Unsubscribe not initialized\");\n    }\n  };\n  return entry;\n}, {\n  withTypes: () => createListenerEntry\n});\nvar cancelActiveListeners = (entry) => {\n  entry.pending.forEach((controller) => {\n    abortControllerWithReason(controller, listenerCancelled);\n  });\n};\nvar createClearListenerMiddleware = (listenerMap) => {\n  return () => {\n    listenerMap.forEach(cancelActiveListeners);\n    listenerMap.clear();\n  };\n};\nvar safelyNotifyError = (errorHandler, errorToNotify, errorInfo) => {\n  try {\n    errorHandler(errorToNotify, errorInfo);\n  } catch (errorHandlerError) {\n    setTimeout(() => {\n      throw errorHandlerError;\n    }, 0);\n  }\n};\nvar addListener = /* @__PURE__ */ assign(/* @__PURE__ */ createAction(`${alm}/add`), {\n  withTypes: () => addListener\n});\nvar clearAllListeners = /* @__PURE__ */ createAction(`${alm}/removeAll`);\nvar removeListener = /* @__PURE__ */ assign(/* @__PURE__ */ createAction(`${alm}/remove`), {\n  withTypes: () => removeListener\n});\nvar defaultErrorHandler = (...args) => {\n  console.error(`${alm}/error`, ...args);\n};\nvar createListenerMiddleware = (middlewareOptions = {}) => {\n  const listenerMap = /* @__PURE__ */ new Map();\n  const {\n    extra,\n    onError = defaultErrorHandler\n  } = middlewareOptions;\n  assertFunction(onError, \"onError\");\n  const insertEntry = (entry) => {\n    entry.unsubscribe = () => listenerMap.delete(entry.id);\n    listenerMap.set(entry.id, entry);\n    return (cancelOptions) => {\n      entry.unsubscribe();\n      if (cancelOptions?.cancelActive) {\n        cancelActiveListeners(entry);\n      }\n    };\n  };\n  const startListening = (options) => {\n    let entry = find(Array.from(listenerMap.values()), (existingEntry) => existingEntry.effect === options.effect);\n    if (!entry) {\n      entry = createListenerEntry(options);\n    }\n    return insertEntry(entry);\n  };\n  assign(startListening, {\n    withTypes: () => startListening\n  });\n  const stopListening = (options) => {\n    const {\n      type,\n      effect,\n      predicate\n    } = getListenerEntryPropsFrom(options);\n    const entry = find(Array.from(listenerMap.values()), (entry2) => {\n      const matchPredicateOrType = typeof type === \"string\" ? entry2.type === type : entry2.predicate === predicate;\n      return matchPredicateOrType && entry2.effect === effect;\n    });\n    if (entry) {\n      entry.unsubscribe();\n      if (options.cancelActive) {\n        cancelActiveListeners(entry);\n      }\n    }\n    return !!entry;\n  };\n  assign(stopListening, {\n    withTypes: () => stopListening\n  });\n  const notifyListener = async (entry, action, api, getOriginalState) => {\n    const internalTaskController = new AbortController();\n    const take = createTakePattern(startListening, internalTaskController.signal);\n    const autoJoinPromises = [];\n    try {\n      entry.pending.add(internalTaskController);\n      await Promise.resolve(entry.effect(\n        action,\n        // Use assign() rather than ... to avoid extra helper functions added to bundle\n        assign({}, api, {\n          getOriginalState,\n          condition: (predicate, timeout) => take(predicate, timeout).then(Boolean),\n          take,\n          delay: createDelay(internalTaskController.signal),\n          pause: createPause(internalTaskController.signal),\n          extra,\n          signal: internalTaskController.signal,\n          fork: createFork(internalTaskController.signal, autoJoinPromises),\n          unsubscribe: entry.unsubscribe,\n          subscribe: () => {\n            listenerMap.set(entry.id, entry);\n          },\n          cancelActiveListeners: () => {\n            entry.pending.forEach((controller, _, set) => {\n              if (controller !== internalTaskController) {\n                abortControllerWithReason(controller, listenerCancelled);\n                set.delete(controller);\n              }\n            });\n          },\n          cancel: () => {\n            abortControllerWithReason(internalTaskController, listenerCancelled);\n            entry.pending.delete(internalTaskController);\n          },\n          throwIfCancelled: () => {\n            validateActive(internalTaskController.signal);\n          }\n        })\n      ));\n    } catch (listenerError) {\n      if (!(listenerError instanceof TaskAbortError)) {\n        safelyNotifyError(onError, listenerError, {\n          raisedBy: \"effect\"\n        });\n      }\n    } finally {\n      await Promise.all(autoJoinPromises);\n      abortControllerWithReason(internalTaskController, listenerCompleted);\n      entry.pending.delete(internalTaskController);\n    }\n  };\n  const clearListenerMiddleware = createClearListenerMiddleware(listenerMap);\n  const middleware = (api) => (next) => (action) => {\n    if (!isAction3(action)) {\n      return next(action);\n    }\n    if (addListener.match(action)) {\n      return startListening(action.payload);\n    }\n    if (clearAllListeners.match(action)) {\n      clearListenerMiddleware();\n      return;\n    }\n    if (removeListener.match(action)) {\n      return stopListening(action.payload);\n    }\n    let originalState = api.getState();\n    const getOriginalState = () => {\n      if (originalState === INTERNAL_NIL_TOKEN) {\n        throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(23) : `${alm}: getOriginalState can only be called synchronously`);\n      }\n      return originalState;\n    };\n    let result;\n    try {\n      result = next(action);\n      if (listenerMap.size > 0) {\n        const currentState = api.getState();\n        const listenerEntries = Array.from(listenerMap.values());\n        for (const entry of listenerEntries) {\n          let runListener = false;\n          try {\n            runListener = entry.predicate(action, currentState, originalState);\n          } catch (predicateError) {\n            runListener = false;\n            safelyNotifyError(onError, predicateError, {\n              raisedBy: \"predicate\"\n            });\n          }\n          if (!runListener) {\n            continue;\n          }\n          notifyListener(entry, action, api, getOriginalState);\n        }\n      }\n    } finally {\n      originalState = INTERNAL_NIL_TOKEN;\n    }\n    return result;\n  };\n  return {\n    middleware,\n    startListening,\n    stopListening,\n    clearListeners: clearListenerMiddleware\n  };\n};\n\n// src/dynamicMiddleware/index.ts\nimport { compose as compose3 } from \"redux\";\nvar createMiddlewareEntry = (middleware) => ({\n  id: nanoid(),\n  middleware,\n  applied: /* @__PURE__ */ new Map()\n});\nvar matchInstance = (instanceId) => (action) => action?.meta?.instanceId === instanceId;\nvar createDynamicMiddleware = () => {\n  const instanceId = nanoid();\n  const middlewareMap = /* @__PURE__ */ new Map();\n  const withMiddleware = Object.assign(createAction(\"dynamicMiddleware/add\", (...middlewares) => ({\n    payload: middlewares,\n    meta: {\n      instanceId\n    }\n  })), {\n    withTypes: () => withMiddleware\n  });\n  const addMiddleware = Object.assign(function addMiddleware2(...middlewares) {\n    middlewares.forEach((middleware2) => {\n      let entry = find(Array.from(middlewareMap.values()), (entry2) => entry2.middleware === middleware2);\n      if (!entry) {\n        entry = createMiddlewareEntry(middleware2);\n      }\n      middlewareMap.set(entry.id, entry);\n    });\n  }, {\n    withTypes: () => addMiddleware\n  });\n  const getFinalMiddleware = (api) => {\n    const appliedMiddleware = Array.from(middlewareMap.values()).map((entry) => emplace(entry.applied, api, {\n      insert: () => entry.middleware(api)\n    }));\n    return compose3(...appliedMiddleware);\n  };\n  const isWithMiddleware = isAllOf(withMiddleware, matchInstance(instanceId));\n  const middleware = (api) => (next) => (action) => {\n    if (isWithMiddleware(action)) {\n      addMiddleware(...action.payload);\n      return api.dispatch;\n    }\n    return getFinalMiddleware(api)(next)(action);\n  };\n  return {\n    middleware,\n    addMiddleware,\n    withMiddleware,\n    instanceId\n  };\n};\n\n// src/combineSlices.ts\nimport { combineReducers as combineReducers2 } from \"redux\";\nvar isSliceLike = (maybeSliceLike) => \"reducerPath\" in maybeSliceLike && typeof maybeSliceLike.reducerPath === \"string\";\nvar getReducers = (slices) => slices.flatMap((sliceOrMap) => isSliceLike(sliceOrMap) ? [[sliceOrMap.reducerPath, sliceOrMap.reducer]] : Object.entries(sliceOrMap));\nvar ORIGINAL_STATE = Symbol.for(\"rtk-state-proxy-original\");\nvar isStateProxy = (value) => !!value && !!value[ORIGINAL_STATE];\nvar stateProxyMap = /* @__PURE__ */ new WeakMap();\nvar createStateProxy = (state, reducerMap) => emplace(stateProxyMap, state, {\n  insert: () => new Proxy(state, {\n    get: (target, prop, receiver) => {\n      if (prop === ORIGINAL_STATE) return target;\n      const result = Reflect.get(target, prop, receiver);\n      if (typeof result === \"undefined\") {\n        const reducer = reducerMap[prop.toString()];\n        if (reducer) {\n          const reducerResult = reducer(void 0, {\n            type: nanoid()\n          });\n          if (typeof reducerResult === \"undefined\") {\n            throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(24) : `The slice reducer for key \"${prop.toString()}\" returned undefined when called for selector(). If the state passed to the reducer is undefined, you must explicitly return the initial state. The initial state may not be undefined. If you don't want to set a value for this reducer, you can use null instead of undefined.`);\n          }\n          return reducerResult;\n        }\n      }\n      return result;\n    }\n  })\n});\nvar original = (state) => {\n  if (!isStateProxy(state)) {\n    throw new Error(process.env.NODE_ENV === \"production\" ? formatProdErrorMessage(25) : \"original must be used on state Proxy\");\n  }\n  return state[ORIGINAL_STATE];\n};\nvar noopReducer = (state = {}) => state;\nfunction combineSlices(...slices) {\n  const reducerMap = Object.fromEntries(getReducers(slices));\n  const getReducer = () => Object.keys(reducerMap).length ? combineReducers2(reducerMap) : noopReducer;\n  let reducer = getReducer();\n  function combinedReducer(state, action) {\n    return reducer(state, action);\n  }\n  combinedReducer.withLazyLoadedSlices = () => combinedReducer;\n  const inject = (slice, config = {}) => {\n    const {\n      reducerPath,\n      reducer: reducerToInject\n    } = slice;\n    const currentReducer = reducerMap[reducerPath];\n    if (!config.overrideExisting && currentReducer && currentReducer !== reducerToInject) {\n      if (typeof process !== \"undefined\" && process.env.NODE_ENV === \"development\") {\n        console.error(`called \\`inject\\` to override already-existing reducer ${reducerPath} without specifying \\`overrideExisting: true\\``);\n      }\n      return combinedReducer;\n    }\n    reducerMap[reducerPath] = reducerToInject;\n    reducer = getReducer();\n    return combinedReducer;\n  };\n  const selector = Object.assign(function makeSelector(selectorFn, selectState) {\n    return function selector2(state, ...args) {\n      return selectorFn(createStateProxy(selectState ? selectState(state, ...args) : state, reducerMap), ...args);\n    };\n  }, {\n    original\n  });\n  return Object.assign(combinedReducer, {\n    inject,\n    selector\n  });\n}\n\n// src/formatProdErrorMessage.ts\nfunction formatProdErrorMessage(code) {\n  return `Minified Redux Toolkit error #${code}; visit https://redux-toolkit.js.org/Errors?code=${code} for the full message or use the non-minified dev environment for full errors. `;\n}\nexport {\n  ReducerType,\n  SHOULD_AUTOBATCH,\n  TaskAbortError,\n  Tuple,\n  addListener,\n  asyncThunkCreator,\n  autoBatchEnhancer,\n  buildCreateSlice,\n  clearAllListeners,\n  combineSlices,\n  configureStore,\n  createAction,\n  createActionCreatorInvariantMiddleware,\n  createAsyncThunk,\n  createDraftSafeSelector,\n  createDraftSafeSelectorCreator,\n  createDynamicMiddleware,\n  createEntityAdapter,\n  createImmutableStateInvariantMiddleware,\n  createListenerMiddleware,\n  produce as createNextState,\n  createReducer,\n  createSelector,\n  createSelectorCreator2 as createSelectorCreator,\n  createSerializableStateInvariantMiddleware,\n  createSlice,\n  current3 as current,\n  findNonSerializableValue,\n  formatProdErrorMessage,\n  freeze,\n  isActionCreator,\n  isAllOf,\n  isAnyOf,\n  isAsyncThunkAction,\n  isDraft5 as isDraft,\n  isFSA as isFluxStandardAction,\n  isFulfilled,\n  isImmutableDefault,\n  isPending,\n  isPlain,\n  isRejected,\n  isRejectedWithValue,\n  lruMemoize,\n  miniSerializeError,\n  nanoid,\n  original2 as original,\n  prepareAutoBatched,\n  removeListener,\n  unwrapResult,\n  weakMapMemoize2 as weakMapMemoize\n};\n//# sourceMappingURL=redux-toolkit.modern.mjs.map","import {\n  getUserWithFilter,\n  CurrentUserFilter,\n} from \"store/currentUser/currentUserSelector\";\nimport { useSelector } from \"react-redux\";\n\nfunction defaultFilter(user) {\n  return user;\n}\nexport default function useCurrentUser(filter?: CurrentUserFilter) {\n  const f = filter || defaultFilter;\n  return useSelector((state) => {\n    return getUserWithFilter(state, f);\n  });\n}\n","import * as React from \"react\";\nconst SvgChevronDown = (props) => /* @__PURE__ */ React.createElement(\"svg\", { xmlns: \"http://www.w3.org/2000/svg\", viewBox: \"0 0 512 512\", ...props }, /* @__PURE__ */ React.createElement(\"path\", { d: \"M233.4 406.6a32.05 32.05 0 0 0 45.3 0l192-192c12.5-12.5 12.5-32.8 0-45.3s-32.8-12.5-45.3 0L256 338.7 86.6 169.4c-12.5-12.5-32.8-12.5-45.3 0s-12.5 32.8 0 45.3l192 192z\" }));\nexport default SvgChevronDown;\n","/* eslint-disable react/jsx-props-no-spreading */\nimport classNames from \"lib/classNames\";\nimport { forwardRef, HTMLAttributes, PropsWithChildren } from \"react\";\nimport { textTheme, TextThemeProps } from \"hardcover-ui/theme/components/text\";\n\ntype Props = {\n  as?: TextThemeProps[\"as\"];\n  size?: TextThemeProps[\"size\"];\n  variant?: TextThemeProps[\"variant\"];\n} & Partial<HTMLAttributes<HTMLParagraphElement>>;\n\nconst Text = forwardRef<HTMLParagraphElement, PropsWithChildren<Props>>(\n  (\n    {\n      size = \"md\",\n      as = \"span\",\n      variant = \"normal\",\n      children,\n      className,\n      ...rest\n    },\n    ref\n  ) => {\n    const finalClassName = classNames(\n      textTheme.variant[variant],\n      textTheme.size?.[size],\n      className\n    );\n\n    const props = {\n      ref,\n      className: finalClassName,\n      ...rest,\n    };\n\n    if (as === \"p\") {\n      return <p {...props}>{children}</p>;\n    }\n    if (as === \"div\") {\n      return <div {...props}>{children}</div>;\n    }\n    if (as === \"h2\") {\n      return <h2 {...props}>{children}</h2>;\n    }\n\n    return <span {...props}>{children}</span>;\n  }\n);\n\nexport default Text;\n","import { createSlice, PayloadAction } from \"@reduxjs/toolkit\";\n\nexport type LoginVisibleType = false | \"Join\" | \"Login\";\nexport type ReportableType = {\n  objectType: string;\n  objectId: number;\n  description: string;\n};\nexport type UiStateType = {\n  loginVisible?: LoginVisibleType;\n  theme: \"light\" | \"dark\";\n  report: null | ReportableType;\n  openButtonId: string | null;\n};\n\nexport const uiState: UiStateType = {\n  loginVisible: false,\n  theme: null,\n  report: null,\n  openButtonId: null,\n};\n\nexport const uiSlice = createSlice({\n  name: \"UiSlice\",\n  initialState: uiState,\n  reducers: {\n    toggleLoginVisible(state, { payload }: { payload: LoginVisibleType }) {\n      state.loginVisible = payload;\n    },\n    setTheme(state, { payload }: { payload: \"light\" | \"dark\" }) {\n      state.theme = payload;\n    },\n    startReport(state, { payload }: { payload: ReportableType }) {\n      state.report = payload;\n    },\n    endReport(state) {\n      state.report = null;\n    },\n    setOpenDropdown: (state, action: PayloadAction<string | null>) => {\n      // If clicking the same button that's already open, close it\n      if (state.openButtonId === action.payload) {\n        state.openButtonId = null;\n      } else {\n        // Otherwise, set the new button ID (closing any other open dropdown)\n        state.openButtonId = action.payload;\n      }\n    },\n  },\n});\n\nexport const uiActions = uiSlice.actions;\n\nexport default uiSlice.reducer;\n","import { createSlice } from \"@reduxjs/toolkit\";\nimport LikeableType from \"types/LikeableType\";\nimport SessionType from \"types/SessionType\";\nimport UserType from \"types/UserType\";\nimport { likeableKey } from \"./currentUserSelector\";\nimport ListBookType from \"types/ListBookType\";\n\nexport type CurrentUserStateType = {\n  followedListIds: number[];\n  followedUsers: Record<string, number>;\n  matchScores: Record<number, number>;\n  likes: Record<string, boolean>;\n  ownedEditions: Record<number, number>;\n  pinnedPromptIds: number[];\n  promptAnswers: Record<string, number>;\n  session: SessionType;\n  user: UserType | null;\n  unfoundBookMatchScores: number[];\n};\n\nexport const currentUserState: CurrentUserStateType = {\n  followedListIds: [],\n  followedUsers: {},\n  likes: {},\n  matchScores: {},\n  ownedEditions: {},\n  pinnedPromptIds: [],\n  promptAnswers: {},\n  session: null,\n  user: null,\n  unfoundBookMatchScores: [],\n};\n\nconst currentUserSlice = createSlice({\n  name: \"CurrentUserSlice\",\n  initialState: currentUserState,\n  reducers: {\n    setSession(state, { payload }) {\n      if (state.session !== payload) {\n        state.session = payload;\n      }\n    },\n    setMatchScore(state, { payload: { bookId, score } }: { payload: { bookId: number, score: number } }) {\n      const newScore = Math.round(score * 20);\n      state.matchScores[bookId] = newScore;\n    },\n    setNotificationsCount(state, { payload }: { payload: number }) {\n      if (state.user) {\n        state.user.notificationsCount = payload;\n      }\n    },\n    refreshAccessToken(\n      state,\n      { payload: { token, expiresAt } }: { payload: { token: string, expiresAt: number } }\n    ) {\n      state.session.jwt = token;\n      state.session.expiresAt = expiresAt;\n    },\n    toggleLike(state, { payload: { likeable } }: { payload: { likeable: LikeableType } }) {\n      const key = likeableKey(likeable)\n      if (state.likes[key]) {\n        delete state.likes[key];\n      } else {\n        state.likes[key] = true;\n      }\n    },\n    deleteOwnedEdition(state, { payload: { editionId } }: { payload: { editionId: number } }) {\n      delete state.ownedEditions[editionId];\n    },\n    addOwnedEdition(state, { payload: { listBook } }: { payload: { listBook: ListBookType } }) {\n      state.ownedEditions[listBook.editionId] = listBook.id;\n    },\n    appendUnfoundBookMatchScores(state, { payload }: { payload: number[] }) {\n      state.unfoundBookMatchScores = [\n        ...state.unfoundBookMatchScores,\n        ...payload,\n      ];\n    },\n    deletePromptAnswer(state, { payload: { bookId, promptId } }: { payload: { bookId: number, promptId: number } }) {\n      delete state.promptAnswers[`Prompt-${promptId}-${bookId}`];\n    },\n    addPromptAnswer(state, { payload: { bookId, promptId, answerId } }: { payload: { bookId: number, promptId: number, answerId: number } }) {\n      state.promptAnswers[`Prompt-${promptId}-${bookId}`] = answerId;\n    },\n    unfollowUser(state, { payload: { userId } }: { payload: { userId: number } }) {\n      // Followed only, or neither\n      state.followedUsers[userId] = state.followedUsers[userId] === 7 ? 2 : 0; \n    },\n    followUser(state, { payload: { userId } }: { payload: { userId: number } }) {\n      // Followed only, don't know if they follow by at this point\n      state.followedUsers[userId] = state.followedUsers[userId] === 2 ? 7 : 1; \n    },\n    pinPrompt(state, { payload: { promptId } }: { payload: { promptId: number } }) {\n      state.pinnedPromptIds.push(promptId);\n    },\n    unPinPrompt(state, { payload: { promptId } }: { payload: { promptId: number } }) {\n      state.pinnedPromptIds = state.pinnedPromptIds.filter((id) => id !== promptId);\n    },\n  },\n});\n\nexport const currentUserActions = currentUserSlice.actions;\n\nexport default currentUserSlice.reducer;\n\nexport const {\n  setMatchScore, \n  toggleLike, \n  deleteOwnedEdition, \n  addOwnedEdition, \n  deletePromptAnswer, \n  addPromptAnswer,\n  unfollowUser, \n  followUser,\n  pinPrompt,\n  unPinPrompt\n} = currentUserSlice.actions;\n","/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol, Iterator */\n\nvar extendStatics = function(d, b) {\n  extendStatics = Object.setPrototypeOf ||\n      ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n      function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n  return extendStatics(d, b);\n};\n\nexport function __extends(d, b) {\n  if (typeof b !== \"function\" && b !== null)\n      throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n  extendStatics(d, b);\n  function __() { this.constructor = d; }\n  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nexport var __assign = function() {\n  __assign = Object.assign || function __assign(t) {\n      for (var s, i = 1, n = arguments.length; i < n; i++) {\n          s = arguments[i];\n          for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n      }\n      return t;\n  }\n  return __assign.apply(this, arguments);\n}\n\nexport function __rest(s, e) {\n  var t = {};\n  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n      t[p] = s[p];\n  if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n      for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n          if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n              t[p[i]] = s[p[i]];\n      }\n  return t;\n}\n\nexport function __decorate(decorators, target, key, desc) {\n  var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n  if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\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;\n  return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nexport function __param(paramIndex, decorator) {\n  return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n  function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n  var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n  var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n  var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n  var _, done = false;\n  for (var i = decorators.length - 1; i >= 0; i--) {\n      var context = {};\n      for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n      for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n      context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n      var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n      if (kind === \"accessor\") {\n          if (result === void 0) continue;\n          if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n          if (_ = accept(result.get)) descriptor.get = _;\n          if (_ = accept(result.set)) descriptor.set = _;\n          if (_ = accept(result.init)) initializers.unshift(_);\n      }\n      else if (_ = accept(result)) {\n          if (kind === \"field\") initializers.unshift(_);\n          else descriptor[key] = _;\n      }\n  }\n  if (target) Object.defineProperty(target, contextIn.name, descriptor);\n  done = true;\n};\n\nexport function __runInitializers(thisArg, initializers, value) {\n  var useValue = arguments.length > 2;\n  for (var i = 0; i < initializers.length; i++) {\n      value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n  }\n  return useValue ? value : void 0;\n};\n\nexport function __propKey(x) {\n  return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nexport function __setFunctionName(f, name, prefix) {\n  if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n  return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nexport function __metadata(metadataKey, metadataValue) {\n  if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nexport function __awaiter(thisArg, _arguments, P, generator) {\n  function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n  return new (P || (P = Promise))(function (resolve, reject) {\n      function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n      function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n      function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n      step((generator = generator.apply(thisArg, _arguments || [])).next());\n  });\n}\n\nexport function __generator(thisArg, body) {\n  var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === \"function\" ? Iterator : Object).prototype);\n  return g.next = verb(0), g[\"throw\"] = verb(1), g[\"return\"] = verb(2), typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n  function verb(n) { return function (v) { return step([n, v]); }; }\n  function step(op) {\n      if (f) throw new TypeError(\"Generator is already executing.\");\n      while (g && (g = 0, op[0] && (_ = 0)), _) try {\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;\n          if (y = 0, t) op = [op[0] & 2, t.value];\n          switch (op[0]) {\n              case 0: case 1: t = op; break;\n              case 4: _.label++; return { value: op[1], done: false };\n              case 5: _.label++; y = op[1]; op = [0]; continue;\n              case 7: op = _.ops.pop(); _.trys.pop(); continue;\n              default:\n                  if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n                  if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n                  if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n                  if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n                  if (t[2]) _.ops.pop();\n                  _.trys.pop(); continue;\n          }\n          op = body.call(thisArg, _);\n      } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n      if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n  }\n}\n\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  var desc = Object.getOwnPropertyDescriptor(m, k);\n  if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n  }\n  Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  o[k2] = m[k];\n});\n\nexport function __exportStar(m, o) {\n  for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nexport function __values(o) {\n  var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n  if (m) return m.call(o);\n  if (o && typeof o.length === \"number\") return {\n      next: function () {\n          if (o && i >= o.length) o = void 0;\n          return { value: o && o[i++], done: !o };\n      }\n  };\n  throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nexport function __read(o, n) {\n  var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n  if (!m) return o;\n  var i = m.call(o), r, ar = [], e;\n  try {\n      while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n  }\n  catch (error) { e = { error: error }; }\n  finally {\n      try {\n          if (r && !r.done && (m = i[\"return\"])) m.call(i);\n      }\n      finally { if (e) throw e.error; }\n  }\n  return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n  for (var ar = [], i = 0; i < arguments.length; i++)\n      ar = ar.concat(__read(arguments[i]));\n  return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n  for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n  for (var r = Array(s), k = 0, i = 0; i < il; i++)\n      for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n          r[k] = a[j];\n  return r;\n}\n\nexport function __spreadArray(to, from, pack) {\n  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n      if (ar || !(i in from)) {\n          if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n          ar[i] = from[i];\n      }\n  }\n  return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nexport function __await(v) {\n  return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var g = generator.apply(thisArg, _arguments || []), i, q = [];\n  return i = Object.create((typeof AsyncIterator === \"function\" ? AsyncIterator : Object).prototype), verb(\"next\"), verb(\"throw\"), verb(\"return\", awaitReturn), i[Symbol.asyncIterator] = function () { return this; }, i;\n  function awaitReturn(f) { return function (v) { return Promise.resolve(v).then(f, reject); }; }\n  function verb(n, f) { if (g[n]) { i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; if (f) i[n] = f(i[n]); } }\n  function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n  function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n  function fulfill(value) { resume(\"next\", value); }\n  function reject(value) { resume(\"throw\", value); }\n  function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nexport function __asyncDelegator(o) {\n  var i, p;\n  return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n  function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nexport function __asyncValues(o) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var m = o[Symbol.asyncIterator], i;\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);\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); }); }; }\n  function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nexport function __makeTemplateObject(cooked, raw) {\n  if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n  return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n  Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n  o[\"default\"] = v;\n};\n\nexport function __importStar(mod) {\n  if (mod && mod.__esModule) return mod;\n  var result = {};\n  if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n  __setModuleDefault(result, mod);\n  return result;\n}\n\nexport function __importDefault(mod) {\n  return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\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\");\n  return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n  if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\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\");\n  return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nexport function __classPrivateFieldIn(state, receiver) {\n  if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n  return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nexport function __addDisposableResource(env, value, async) {\n  if (value !== null && value !== void 0) {\n    if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n    var dispose, inner;\n    if (async) {\n      if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n      dispose = value[Symbol.asyncDispose];\n    }\n    if (dispose === void 0) {\n      if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n      dispose = value[Symbol.dispose];\n      if (async) inner = dispose;\n    }\n    if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n    if (inner) dispose = function() { try { inner.call(this); } catch (e) { return Promise.reject(e); } };\n    env.stack.push({ value: value, dispose: dispose, async: async });\n  }\n  else if (async) {\n    env.stack.push({ async: true });\n  }\n  return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n  var e = new Error(message);\n  return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nexport function __disposeResources(env) {\n  function fail(e) {\n    env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n    env.hasError = true;\n  }\n  var r, s = 0;\n  function next() {\n    while (r = env.stack.pop()) {\n      try {\n        if (!r.async && s === 1) return s = 0, env.stack.push(r), Promise.resolve().then(next);\n        if (r.dispose) {\n          var result = r.dispose.call(r.value);\n          if (r.async) return s |= 2, Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n        }\n        else s |= 1;\n      }\n      catch (e) {\n        fail(e);\n      }\n    }\n    if (s === 1) return env.hasError ? Promise.reject(env.error) : Promise.resolve();\n    if (env.hasError) throw env.error;\n  }\n  return next();\n}\n\nexport default {\n  __extends,\n  __assign,\n  __rest,\n  __decorate,\n  __param,\n  __metadata,\n  __awaiter,\n  __generator,\n  __createBinding,\n  __exportStar,\n  __values,\n  __read,\n  __spread,\n  __spreadArrays,\n  __spreadArray,\n  __await,\n  __asyncGenerator,\n  __asyncDelegator,\n  __asyncValues,\n  __makeTemplateObject,\n  __importStar,\n  __importDefault,\n  __classPrivateFieldGet,\n  __classPrivateFieldSet,\n  __classPrivateFieldIn,\n  __addDisposableResource,\n  __disposeResources,\n};\n","import { __extends } from \"tslib\";\nvar genericMessage = \"Invariant Violation\";\nvar _a = Object.setPrototypeOf, setPrototypeOf = _a === void 0 ? function (obj, proto) {\n    obj.__proto__ = proto;\n    return obj;\n} : _a;\nvar InvariantError = /** @class */ (function (_super) {\n    __extends(InvariantError, _super);\n    function InvariantError(message) {\n        if (message === void 0) { message = genericMessage; }\n        var _this = _super.call(this, typeof message === \"number\"\n            ? genericMessage + \": \" + message + \" (see https://github.com/apollographql/invariant-packages)\"\n            : message) || this;\n        _this.framesToPop = 1;\n        _this.name = genericMessage;\n        setPrototypeOf(_this, InvariantError.prototype);\n        return _this;\n    }\n    return InvariantError;\n}(Error));\nexport { InvariantError };\nexport function invariant(condition, message) {\n    if (!condition) {\n        throw new InvariantError(message);\n    }\n}\nvar verbosityLevels = [\"debug\", \"log\", \"warn\", \"error\", \"silent\"];\nvar verbosityLevel = verbosityLevels.indexOf(\"log\");\nfunction wrapConsoleMethod(name) {\n    return function () {\n        if (verbosityLevels.indexOf(name) >= verbosityLevel) {\n            // Default to console.log if this host environment happens not to provide\n            // all the console.* methods we need.\n            var method = console[name] || console.log;\n            return method.apply(console, arguments);\n        }\n    };\n}\n(function (invariant) {\n    invariant.debug = wrapConsoleMethod(\"debug\");\n    invariant.log = wrapConsoleMethod(\"log\");\n    invariant.warn = wrapConsoleMethod(\"warn\");\n    invariant.error = wrapConsoleMethod(\"error\");\n})(invariant || (invariant = {}));\nexport function setVerbosity(level) {\n    var old = verbosityLevels[verbosityLevel];\n    verbosityLevel = Math.max(0, verbosityLevels.indexOf(level));\n    return old;\n}\nexport default invariant;\n//# sourceMappingURL=invariant.js.map","export var version = \"3.11.8\";\n//# sourceMappingURL=version.js.map","export function maybe(thunk) {\n    try {\n        return thunk();\n    }\n    catch (_a) { }\n}\n//# sourceMappingURL=maybe.js.map","import { maybe } from \"./maybe.js\";\nexport default (maybe(function () { return globalThis; }) ||\n    maybe(function () { return window; }) ||\n    maybe(function () { return self; }) ||\n    maybe(function () { return global; }) || // We don't expect the Function constructor ever to be invoked at runtime, as\n// long as at least one of globalThis, window, self, or global is defined, so\n// we are under no obligation to make it easy for static analysis tools to\n// detect syntactic usage of the Function constructor. If you think you can\n// improve your static analysis to detect this obfuscation, think again. This\n// is an arms race you cannot win, at least not in JavaScript.\nmaybe(function () {\n    return maybe.constructor(\"return this\")();\n}));\n//# sourceMappingURL=global.js.map","var prefixCounts = new Map();\n// These IDs won't be globally unique, but they will be unique within this\n// process, thanks to the counter, and unguessable thanks to the random suffix.\nexport function makeUniqueId(prefix) {\n    var count = prefixCounts.get(prefix) || 1;\n    prefixCounts.set(prefix, count + 1);\n    return \"\".concat(prefix, \":\").concat(count, \":\").concat(Math.random().toString(36).slice(2));\n}\n//# sourceMappingURL=makeUniqueId.js.map","import { makeUniqueId } from \"./makeUniqueId.js\";\nexport function stringifyForDisplay(value, space) {\n    if (space === void 0) { space = 0; }\n    var undefId = makeUniqueId(\"stringifyForDisplay\");\n    return JSON.stringify(value, function (key, value) {\n        return value === void 0 ? undefId : value;\n    }, space)\n        .split(JSON.stringify(undefId))\n        .join(\"<undefined>\");\n}\n//# sourceMappingURL=stringifyForDisplay.js.map","import { invariant as originalInvariant, InvariantError } from \"ts-invariant\";\nimport { version } from \"../../version.js\";\nimport global from \"./global.js\";\nimport { stringifyForDisplay } from \"../common/stringifyForDisplay.js\";\nfunction wrap(fn) {\n    return function (message) {\n        var args = [];\n        for (var _i = 1; _i < arguments.length; _i++) {\n            args[_i - 1] = arguments[_i];\n        }\n        if (typeof message === \"number\") {\n            var arg0 = message;\n            message = getHandledErrorMsg(arg0);\n            if (!message) {\n                message = getFallbackErrorMsg(arg0, args);\n                args = [];\n            }\n        }\n        fn.apply(void 0, [message].concat(args));\n    };\n}\nvar invariant = Object.assign(function invariant(condition, message) {\n    var args = [];\n    for (var _i = 2; _i < arguments.length; _i++) {\n        args[_i - 2] = arguments[_i];\n    }\n    if (!condition) {\n        originalInvariant(condition, getHandledErrorMsg(message, args) || getFallbackErrorMsg(message, args));\n    }\n}, {\n    debug: wrap(originalInvariant.debug),\n    log: wrap(originalInvariant.log),\n    warn: wrap(originalInvariant.warn),\n    error: wrap(originalInvariant.error),\n});\n/**\n * Returns an InvariantError.\n *\n * `message` can only be a string, a concatenation of strings, or a ternary statement\n * that results in a string. This will be enforced on build, where the message will\n * be replaced with a message number.\n * String substitutions with %s are supported and will also return\n * pretty-stringified objects.\n * Excess `optionalParams` will be swallowed.\n */\nfunction newInvariantError(message) {\n    var optionalParams = [];\n    for (var _i = 1; _i < arguments.length; _i++) {\n        optionalParams[_i - 1] = arguments[_i];\n    }\n    return new InvariantError(getHandledErrorMsg(message, optionalParams) ||\n        getFallbackErrorMsg(message, optionalParams));\n}\nvar ApolloErrorMessageHandler = Symbol.for(\"ApolloErrorMessageHandler_\" + version);\nfunction stringify(arg) {\n    if (typeof arg == \"string\") {\n        return arg;\n    }\n    try {\n        return stringifyForDisplay(arg, 2).slice(0, 1000);\n    }\n    catch (_a) {\n        return \"<non-serializable>\";\n    }\n}\nfunction getHandledErrorMsg(message, messageArgs) {\n    if (messageArgs === void 0) { messageArgs = []; }\n    if (!message)\n        return;\n    return (global[ApolloErrorMessageHandler] &&\n        global[ApolloErrorMessageHandler](message, messageArgs.map(stringify)));\n}\nfunction getFallbackErrorMsg(message, messageArgs) {\n    if (messageArgs === void 0) { messageArgs = []; }\n    if (!message)\n        return;\n    return \"An error occurred! For more details, see the full error text at https://go.apollo.dev/c/err#\".concat(encodeURIComponent(JSON.stringify({\n        version: version,\n        message: message,\n        args: messageArgs.map(stringify),\n    })));\n}\nexport { invariant, InvariantError, newInvariantError, ApolloErrorMessageHandler, };\n//# sourceMappingURL=invariantWrappers.js.map","export function devAssert(condition, message) {\n  const booleanCondition = Boolean(condition);\n\n  if (!booleanCondition) {\n    throw new Error(message);\n  }\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 function isObjectLike(value) {\n  return typeof value == 'object' && value !== null;\n}\n","export function invariant(condition, message) {\n  const booleanCondition = Boolean(condition);\n\n  if (!booleanCondition) {\n    throw new Error(\n      message != null ? message : 'Unexpected invariant triggered.',\n    );\n  }\n}\n","import { invariant } from '../jsutils/invariant.mjs';\nconst LineRegExp = /\\r\\n|[\\n\\r]/g;\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  let lastLineStart = 0;\n  let line = 1;\n\n  for (const match of source.body.matchAll(LineRegExp)) {\n    typeof match.index === 'number' || invariant(false);\n\n    if (match.index >= position) {\n      break;\n    }\n\n    lastLineStart = match.index + match[0].length;\n    line += 1;\n  }\n\n  return {\n    line,\n    column: position + 1 - lastLineStart,\n  };\n}\n","import { getLocation } from './location.mjs';\n\n/**\n * Render a helpful description of the location in the GraphQL Source document.\n */\nexport function printLocation(location) {\n  return printSourceLocation(\n    location.source,\n    getLocation(location.source, location.start),\n  );\n}\n/**\n * Render a helpful description of the location in the GraphQL Source document.\n */\n\nexport function printSourceLocation(source, sourceLocation) {\n  const firstLineColumnOffset = source.locationOffset.column - 1;\n  const body = ''.padStart(firstLineColumnOffset) + source.body;\n  const lineIndex = sourceLocation.line - 1;\n  const lineOffset = source.locationOffset.line - 1;\n  const lineNum = sourceLocation.line + lineOffset;\n  const columnOffset = sourceLocation.line === 1 ? firstLineColumnOffset : 0;\n  const columnNum = sourceLocation.column + columnOffset;\n  const locationStr = `${source.name}:${lineNum}:${columnNum}\\n`;\n  const lines = body.split(/\\r\\n|[\\n\\r]/g);\n  const locationLine = lines[lineIndex]; // Special case for minified documents\n\n  if (locationLine.length > 120) {\n    const subLineIndex = Math.floor(columnNum / 80);\n    const subLineColumnNum = columnNum % 80;\n    const subLines = [];\n\n    for (let i = 0; i < locationLine.length; i += 80) {\n      subLines.push(locationLine.slice(i, i + 80));\n    }\n\n    return (\n      locationStr +\n      printPrefixedLines([\n        [`${lineNum} |`, subLines[0]],\n        ...subLines.slice(1, subLineIndex + 1).map((subLine) => ['|', subLine]),\n        ['|', '^'.padStart(subLineColumnNum)],\n        ['|', subLines[subLineIndex + 1]],\n      ])\n    );\n  }\n\n  return (\n    locationStr +\n    printPrefixedLines([\n      // Lines specified like this: [\"prefix\", \"string\"],\n      [`${lineNum - 1} |`, lines[lineIndex - 1]],\n      [`${lineNum} |`, locationLine],\n      ['|', '^'.padStart(columnNum)],\n      [`${lineNum + 1} |`, lines[lineIndex + 1]],\n    ])\n  );\n}\n\nfunction printPrefixedLines(lines) {\n  const existingLines = lines.filter(([_, line]) => line !== undefined);\n  const padLen = Math.max(...existingLines.map(([prefix]) => prefix.length));\n  return existingLines\n    .map(([prefix, line]) => prefix.padStart(padLen) + (line ? ' ' + line : ''))\n    .join('\\n');\n}\n","import { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { getLocation } from '../language/location.mjs';\nimport {\n  printLocation,\n  printSourceLocation,\n} from '../language/printLocation.mjs';\n\nfunction toNormalizedOptions(args) {\n  const firstArg = args[0];\n\n  if (firstArg == null || 'kind' in firstArg || 'length' in firstArg) {\n    return {\n      nodes: firstArg,\n      source: args[1],\n      positions: args[2],\n      path: args[3],\n      originalError: args[4],\n      extensions: args[5],\n    };\n  }\n\n  return firstArg;\n}\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 class GraphQLError extends Error {\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\n  /**\n   * @deprecated Please use the `GraphQLErrorOptions` constructor overload instead.\n   */\n  constructor(message, ...rawArgs) {\n    var _this$nodes, _nodeLocations$, _ref;\n\n    const { nodes, source, positions, path, originalError, extensions } =\n      toNormalizedOptions(rawArgs);\n    super(message);\n    this.name = 'GraphQLError';\n    this.path = path !== null && path !== void 0 ? path : undefined;\n    this.originalError =\n      originalError !== null && originalError !== void 0\n        ? originalError\n        : undefined; // Compute list of blame nodes.\n\n    this.nodes = undefinedIfEmpty(\n      Array.isArray(nodes) ? nodes : nodes ? [nodes] : undefined,\n    );\n    const nodeLocations = undefinedIfEmpty(\n      (_this$nodes = this.nodes) === null || _this$nodes === void 0\n        ? void 0\n        : _this$nodes.map((node) => node.loc).filter((loc) => loc != null),\n    ); // Compute locations in the source for the given nodes/positions.\n\n    this.source =\n      source !== null && source !== void 0\n        ? source\n        : nodeLocations === null || nodeLocations === void 0\n        ? void 0\n        : (_nodeLocations$ = nodeLocations[0]) === null ||\n          _nodeLocations$ === void 0\n        ? void 0\n        : _nodeLocations$.source;\n    this.positions =\n      positions !== null && positions !== void 0\n        ? positions\n        : nodeLocations === null || nodeLocations === void 0\n        ? void 0\n        : nodeLocations.map((loc) => loc.start);\n    this.locations =\n      positions && source\n        ? positions.map((pos) => getLocation(source, pos))\n        : nodeLocations === null || nodeLocations === void 0\n        ? void 0\n        : nodeLocations.map((loc) => getLocation(loc.source, loc.start));\n    const originalExtensions = isObjectLike(\n      originalError === null || originalError === void 0\n        ? void 0\n        : originalError.extensions,\n    )\n      ? originalError === null || originalError === void 0\n        ? void 0\n        : originalError.extensions\n      : undefined;\n    this.extensions =\n      (_ref =\n        extensions !== null && extensions !== void 0\n          ? extensions\n          : originalExtensions) !== null && _ref !== void 0\n        ? _ref\n        : Object.create(null); // Only properties prescribed by the spec should be enumerable.\n    // Keep the rest as non-enumerable.\n\n    Object.defineProperties(this, {\n      message: {\n        writable: true,\n        enumerable: true,\n      },\n      name: {\n        enumerable: false,\n      },\n      nodes: {\n        enumerable: false,\n      },\n      source: {\n        enumerable: false,\n      },\n      positions: {\n        enumerable: false,\n      },\n      originalError: {\n        enumerable: false,\n      },\n    }); // Include (non-enumerable) stack trace.\n\n    /* c8 ignore start */\n    // FIXME: https://github.com/graphql/graphql-js/issues/2317\n\n    if (\n      originalError !== null &&\n      originalError !== void 0 &&\n      originalError.stack\n    ) {\n      Object.defineProperty(this, 'stack', {\n        value: originalError.stack,\n        writable: true,\n        configurable: true,\n      });\n    } else if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, GraphQLError);\n    } else {\n      Object.defineProperty(this, 'stack', {\n        value: Error().stack,\n        writable: true,\n        configurable: true,\n      });\n    }\n    /* c8 ignore stop */\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLError';\n  }\n\n  toString() {\n    let output = this.message;\n\n    if (this.nodes) {\n      for (const node of this.nodes) {\n        if (node.loc) {\n          output += '\\n\\n' + printLocation(node.loc);\n        }\n      }\n    } else if (this.source && this.locations) {\n      for (const location of this.locations) {\n        output += '\\n\\n' + printSourceLocation(this.source, location);\n      }\n    }\n\n    return output;\n  }\n\n  toJSON() {\n    const formattedError = {\n      message: this.message,\n    };\n\n    if (this.locations != null) {\n      formattedError.locations = this.locations;\n    }\n\n    if (this.path != null) {\n      formattedError.path = this.path;\n    }\n\n    if (this.extensions != null && Object.keys(this.extensions).length > 0) {\n      formattedError.extensions = this.extensions;\n    }\n\n    return formattedError;\n  }\n}\n\nfunction undefinedIfEmpty(array) {\n  return array === undefined || array.length === 0 ? undefined : array;\n}\n/**\n * See: https://spec.graphql.org/draft/#sec-Errors\n */\n\n/**\n * Prints a GraphQLError to a string, representing useful location information\n * about the error's position in the source.\n *\n * @deprecated Please use `error.toString` instead. Will be removed in v17\n */\nexport function printError(error) {\n  return error.toString();\n}\n/**\n * Given a GraphQLError, format it according to the rules described by the\n * Response Format, Errors section of the GraphQL Specification.\n *\n * @deprecated Please use `error.toJSON` instead. Will be removed in v17\n */\n\nexport function formatError(error) {\n  return error.toJSON();\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: ${description}`, {\n    source,\n    positions: [position],\n  });\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 class Location {\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  constructor(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  get [Symbol.toStringTag]() {\n    return 'Location';\n  }\n\n  toJSON() {\n    return {\n      start: this.start,\n      end: this.end,\n    };\n  }\n}\n/**\n * Represents a range of characters represented by a lexical token\n * within a Source.\n */\n\nexport class Token {\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   * Note: is undefined for punctuation tokens, but typed as string for\n   * convenience in the parser.\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  constructor(kind, start, end, line, column, value) {\n    this.kind = kind;\n    this.start = start;\n    this.end = end;\n    this.line = line;\n    this.column = column; // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\n    this.value = value;\n    this.prev = null;\n    this.next = null;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'Token';\n  }\n\n  toJSON() {\n    return {\n      kind: this.kind,\n      value: this.value,\n      line: this.line,\n      column: this.column,\n    };\n  }\n}\n/**\n * The list of all possible AST node types.\n */\n\n/**\n * @internal\n */\nexport const QueryDocumentKeys = {\n  Name: [],\n  Document: ['definitions'],\n  OperationDefinition: [\n    'name',\n    'variableDefinitions',\n    'directives',\n    'selectionSet',\n  ],\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: [\n    'name', // Note: fragment variable definitions are deprecated and will removed in v17.0.0\n    'variableDefinitions',\n    'typeCondition',\n    'directives',\n    'selectionSet',\n  ],\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: [\n    'description',\n    'name',\n    'interfaces',\n    'directives',\n    'fields',\n  ],\n  FieldDefinition: ['description', 'name', 'arguments', 'type', 'directives'],\n  InputValueDefinition: [\n    'description',\n    'name',\n    'type',\n    'defaultValue',\n    'directives',\n  ],\n  InterfaceTypeDefinition: [\n    'description',\n    'name',\n    'interfaces',\n    'directives',\n    'fields',\n  ],\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};\nconst kindValues = new Set(Object.keys(QueryDocumentKeys));\n/**\n * @internal\n */\n\nexport function isNode(maybeNode) {\n  const maybeKind =\n    maybeNode === null || maybeNode === void 0 ? void 0 : maybeNode.kind;\n  return typeof maybeKind === 'string' && kindValues.has(maybeKind);\n}\n/** Name */\n\nvar OperationTypeNode;\n\n(function (OperationTypeNode) {\n  OperationTypeNode['QUERY'] = 'query';\n  OperationTypeNode['MUTATION'] = 'mutation';\n  OperationTypeNode['SUBSCRIPTION'] = 'subscription';\n})(OperationTypeNode || (OperationTypeNode = {}));\n\nexport { OperationTypeNode };\n","/**\n * The set of allowed directive location values.\n */\nvar DirectiveLocation;\n\n(function (DirectiveLocation) {\n  DirectiveLocation['QUERY'] = 'QUERY';\n  DirectiveLocation['MUTATION'] = 'MUTATION';\n  DirectiveLocation['SUBSCRIPTION'] = 'SUBSCRIPTION';\n  DirectiveLocation['FIELD'] = 'FIELD';\n  DirectiveLocation['FRAGMENT_DEFINITION'] = 'FRAGMENT_DEFINITION';\n  DirectiveLocation['FRAGMENT_SPREAD'] = 'FRAGMENT_SPREAD';\n  DirectiveLocation['INLINE_FRAGMENT'] = 'INLINE_FRAGMENT';\n  DirectiveLocation['VARIABLE_DEFINITION'] = 'VARIABLE_DEFINITION';\n  DirectiveLocation['SCHEMA'] = 'SCHEMA';\n  DirectiveLocation['SCALAR'] = 'SCALAR';\n  DirectiveLocation['OBJECT'] = 'OBJECT';\n  DirectiveLocation['FIELD_DEFINITION'] = 'FIELD_DEFINITION';\n  DirectiveLocation['ARGUMENT_DEFINITION'] = 'ARGUMENT_DEFINITION';\n  DirectiveLocation['INTERFACE'] = 'INTERFACE';\n  DirectiveLocation['UNION'] = 'UNION';\n  DirectiveLocation['ENUM'] = 'ENUM';\n  DirectiveLocation['ENUM_VALUE'] = 'ENUM_VALUE';\n  DirectiveLocation['INPUT_OBJECT'] = 'INPUT_OBJECT';\n  DirectiveLocation['INPUT_FIELD_DEFINITION'] = 'INPUT_FIELD_DEFINITION';\n})(DirectiveLocation || (DirectiveLocation = {}));\n\nexport { DirectiveLocation };\n/**\n * The enum type representing the directive location values.\n *\n * @deprecated Please use `DirectiveLocation`. Will be remove in v17.\n */\n","/**\n * The set of allowed kind values for AST nodes.\n */\nvar Kind;\n\n(function (Kind) {\n  Kind['NAME'] = 'Name';\n  Kind['DOCUMENT'] = 'Document';\n  Kind['OPERATION_DEFINITION'] = 'OperationDefinition';\n  Kind['VARIABLE_DEFINITION'] = 'VariableDefinition';\n  Kind['SELECTION_SET'] = 'SelectionSet';\n  Kind['FIELD'] = 'Field';\n  Kind['ARGUMENT'] = 'Argument';\n  Kind['FRAGMENT_SPREAD'] = 'FragmentSpread';\n  Kind['INLINE_FRAGMENT'] = 'InlineFragment';\n  Kind['FRAGMENT_DEFINITION'] = 'FragmentDefinition';\n  Kind['VARIABLE'] = 'Variable';\n  Kind['INT'] = 'IntValue';\n  Kind['FLOAT'] = 'FloatValue';\n  Kind['STRING'] = 'StringValue';\n  Kind['BOOLEAN'] = 'BooleanValue';\n  Kind['NULL'] = 'NullValue';\n  Kind['ENUM'] = 'EnumValue';\n  Kind['LIST'] = 'ListValue';\n  Kind['OBJECT'] = 'ObjectValue';\n  Kind['OBJECT_FIELD'] = 'ObjectField';\n  Kind['DIRECTIVE'] = 'Directive';\n  Kind['NAMED_TYPE'] = 'NamedType';\n  Kind['LIST_TYPE'] = 'ListType';\n  Kind['NON_NULL_TYPE'] = 'NonNullType';\n  Kind['SCHEMA_DEFINITION'] = 'SchemaDefinition';\n  Kind['OPERATION_TYPE_DEFINITION'] = 'OperationTypeDefinition';\n  Kind['SCALAR_TYPE_DEFINITION'] = 'ScalarTypeDefinition';\n  Kind['OBJECT_TYPE_DEFINITION'] = 'ObjectTypeDefinition';\n  Kind['FIELD_DEFINITION'] = 'FieldDefinition';\n  Kind['INPUT_VALUE_DEFINITION'] = 'InputValueDefinition';\n  Kind['INTERFACE_TYPE_DEFINITION'] = 'InterfaceTypeDefinition';\n  Kind['UNION_TYPE_DEFINITION'] = 'UnionTypeDefinition';\n  Kind['ENUM_TYPE_DEFINITION'] = 'EnumTypeDefinition';\n  Kind['ENUM_VALUE_DEFINITION'] = 'EnumValueDefinition';\n  Kind['INPUT_OBJECT_TYPE_DEFINITION'] = 'InputObjectTypeDefinition';\n  Kind['DIRECTIVE_DEFINITION'] = 'DirectiveDefinition';\n  Kind['SCHEMA_EXTENSION'] = 'SchemaExtension';\n  Kind['SCALAR_TYPE_EXTENSION'] = 'ScalarTypeExtension';\n  Kind['OBJECT_TYPE_EXTENSION'] = 'ObjectTypeExtension';\n  Kind['INTERFACE_TYPE_EXTENSION'] = 'InterfaceTypeExtension';\n  Kind['UNION_TYPE_EXTENSION'] = 'UnionTypeExtension';\n  Kind['ENUM_TYPE_EXTENSION'] = 'EnumTypeExtension';\n  Kind['INPUT_OBJECT_TYPE_EXTENSION'] = 'InputObjectTypeExtension';\n})(Kind || (Kind = {}));\n\nexport { Kind };\n/**\n * The enum type representing the possible kind values of AST nodes.\n *\n * @deprecated Please use `Kind`. Will be remove in v17.\n */\n","/**\n * ```\n * WhiteSpace ::\n *   - \"Horizontal Tab (U+0009)\"\n *   - \"Space (U+0020)\"\n * ```\n * @internal\n */\nexport function isWhiteSpace(code) {\n  return code === 0x0009 || code === 0x0020;\n}\n/**\n * ```\n * Digit :: one of\n *   - `0` `1` `2` `3` `4` `5` `6` `7` `8` `9`\n * ```\n * @internal\n */\n\nexport function isDigit(code) {\n  return code >= 0x0030 && code <= 0x0039;\n}\n/**\n * ```\n * Letter :: one of\n *   - `A` `B` `C` `D` `E` `F` `G` `H` `I` `J` `K` `L` `M`\n *   - `N` `O` `P` `Q` `R` `S` `T` `U` `V` `W` `X` `Y` `Z`\n *   - `a` `b` `c` `d` `e` `f` `g` `h` `i` `j` `k` `l` `m`\n *   - `n` `o` `p` `q` `r` `s` `t` `u` `v` `w` `x` `y` `z`\n * ```\n * @internal\n */\n\nexport function isLetter(code) {\n  return (\n    (code >= 0x0061 && code <= 0x007a) || // A-Z\n    (code >= 0x0041 && code <= 0x005a) // a-z\n  );\n}\n/**\n * ```\n * NameStart ::\n *   - Letter\n *   - `_`\n * ```\n * @internal\n */\n\nexport function isNameStart(code) {\n  return isLetter(code) || code === 0x005f;\n}\n/**\n * ```\n * NameContinue ::\n *   - Letter\n *   - Digit\n *   - `_`\n * ```\n * @internal\n */\n\nexport function isNameContinue(code) {\n  return isLetter(code) || isDigit(code) || code === 0x005f;\n}\n","import { isWhiteSpace } from './characterClasses.mjs';\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 */\n\nexport function dedentBlockStringLines(lines) {\n  var _firstNonEmptyLine2;\n\n  let commonIndent = Number.MAX_SAFE_INTEGER;\n  let firstNonEmptyLine = null;\n  let lastNonEmptyLine = -1;\n\n  for (let i = 0; i < lines.length; ++i) {\n    var _firstNonEmptyLine;\n\n    const line = lines[i];\n    const indent = leadingWhitespace(line);\n\n    if (indent === line.length) {\n      continue; // skip empty lines\n    }\n\n    firstNonEmptyLine =\n      (_firstNonEmptyLine = firstNonEmptyLine) !== null &&\n      _firstNonEmptyLine !== void 0\n        ? _firstNonEmptyLine\n        : i;\n    lastNonEmptyLine = i;\n\n    if (i !== 0 && indent < commonIndent) {\n      commonIndent = indent;\n    }\n  }\n\n  return lines // Remove common indentation from all lines but first.\n    .map((line, i) => (i === 0 ? line : line.slice(commonIndent))) // Remove leading and trailing blank lines.\n    .slice(\n      (_firstNonEmptyLine2 = firstNonEmptyLine) !== null &&\n        _firstNonEmptyLine2 !== void 0\n        ? _firstNonEmptyLine2\n        : 0,\n      lastNonEmptyLine + 1,\n    );\n}\n\nfunction leadingWhitespace(str) {\n  let i = 0;\n\n  while (i < str.length && isWhiteSpace(str.charCodeAt(i))) {\n    ++i;\n  }\n\n  return i;\n}\n/**\n * @internal\n */\n\nexport function isPrintableAsBlockString(value) {\n  if (value === '') {\n    return true; // empty string is printable\n  }\n\n  let isEmptyLine = true;\n  let hasIndent = false;\n  let hasCommonIndent = true;\n  let seenNonEmptyLine = false;\n\n  for (let i = 0; i < value.length; ++i) {\n    switch (value.codePointAt(i)) {\n      case 0x0000:\n      case 0x0001:\n      case 0x0002:\n      case 0x0003:\n      case 0x0004:\n      case 0x0005:\n      case 0x0006:\n      case 0x0007:\n      case 0x0008:\n      case 0x000b:\n      case 0x000c:\n      case 0x000e:\n      case 0x000f:\n        return false;\n      // Has non-printable characters\n\n      case 0x000d:\n        //  \\r\n        return false;\n      // Has \\r or \\r\\n which will be replaced as \\n\n\n      case 10:\n        //  \\n\n        if (isEmptyLine && !seenNonEmptyLine) {\n          return false; // Has leading new line\n        }\n\n        seenNonEmptyLine = true;\n        isEmptyLine = true;\n        hasIndent = false;\n        break;\n\n      case 9: //   \\t\n\n      case 32:\n        //  <space>\n        hasIndent || (hasIndent = isEmptyLine);\n        break;\n\n      default:\n        hasCommonIndent && (hasCommonIndent = hasIndent);\n        isEmptyLine = false;\n    }\n  }\n\n  if (isEmptyLine) {\n    return false; // Has trailing empty lines\n  }\n\n  if (hasCommonIndent && seenNonEmptyLine) {\n    return false; // Has internal indent\n  }\n\n  return true;\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, options) {\n  const escapedValue = value.replace(/\"\"\"/g, '\\\\\"\"\"'); // Expand a block string's raw value into independent lines.\n\n  const lines = escapedValue.split(/\\r\\n|[\\n\\r]/g);\n  const isSingleLine = lines.length === 1; // If common indentation is found we can fix some of those cases by adding leading new line\n\n  const forceLeadingNewLine =\n    lines.length > 1 &&\n    lines\n      .slice(1)\n      .every((line) => line.length === 0 || isWhiteSpace(line.charCodeAt(0))); // Trailing triple quotes just looks confusing but doesn't force trailing new line\n\n  const hasTrailingTripleQuotes = escapedValue.endsWith('\\\\\"\"\"'); // Trailing quote (single or double) or slash forces trailing new line\n\n  const hasTrailingQuote = value.endsWith('\"') && !hasTrailingTripleQuotes;\n  const hasTrailingSlash = value.endsWith('\\\\');\n  const forceTrailingNewline = hasTrailingQuote || hasTrailingSlash;\n  const printAsMultipleLines =\n    !(options !== null && options !== void 0 && options.minimize) && // add leading and trailing new lines only if it improves readability\n    (!isSingleLine ||\n      value.length > 70 ||\n      forceTrailingNewline ||\n      forceLeadingNewLine ||\n      hasTrailingTripleQuotes);\n  let result = ''; // Format a multi-line block quote to account for leading space.\n\n  const skipLeadingNewLine = isSingleLine && isWhiteSpace(value.charCodeAt(0));\n\n  if ((printAsMultipleLines && !skipLeadingNewLine) || forceLeadingNewLine) {\n    result += '\\n';\n  }\n\n  result += escapedValue;\n\n  if (printAsMultipleLines || forceTrailingNewline) {\n    result += '\\n';\n  }\n\n  return '\"\"\"' + result + '\"\"\"';\n}\n","/**\n * An exported enum describing the different kinds of tokens that the\n * lexer emits.\n */\nvar TokenKind;\n\n(function (TokenKind) {\n  TokenKind['SOF'] = '<SOF>';\n  TokenKind['EOF'] = '<EOF>';\n  TokenKind['BANG'] = '!';\n  TokenKind['DOLLAR'] = '$';\n  TokenKind['AMP'] = '&';\n  TokenKind['PAREN_L'] = '(';\n  TokenKind['PAREN_R'] = ')';\n  TokenKind['SPREAD'] = '...';\n  TokenKind['COLON'] = ':';\n  TokenKind['EQUALS'] = '=';\n  TokenKind['AT'] = '@';\n  TokenKind['BRACKET_L'] = '[';\n  TokenKind['BRACKET_R'] = ']';\n  TokenKind['BRACE_L'] = '{';\n  TokenKind['PIPE'] = '|';\n  TokenKind['BRACE_R'] = '}';\n  TokenKind['NAME'] = 'Name';\n  TokenKind['INT'] = 'Int';\n  TokenKind['FLOAT'] = 'Float';\n  TokenKind['STRING'] = 'String';\n  TokenKind['BLOCK_STRING'] = 'BlockString';\n  TokenKind['COMMENT'] = 'Comment';\n})(TokenKind || (TokenKind = {}));\n\nexport { TokenKind };\n/**\n * The enum type representing the token kinds values.\n *\n * @deprecated Please use `TokenKind`. Will be remove in v17.\n */\n","import { syntaxError } from '../error/syntaxError.mjs';\nimport { Token } from './ast.mjs';\nimport { dedentBlockStringLines } from './blockString.mjs';\nimport { isDigit, isNameContinue, isNameStart } from './characterClasses.mjs';\nimport { TokenKind } from './tokenKind.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 class Lexer {\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  constructor(source) {\n    const startOfFileToken = new Token(TokenKind.SOF, 0, 0, 0, 0);\n    this.source = source;\n    this.lastToken = startOfFileToken;\n    this.token = startOfFileToken;\n    this.line = 1;\n    this.lineStart = 0;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'Lexer';\n  }\n  /**\n   * Advances the token stream to the next non-ignored token.\n   */\n\n  advance() {\n    this.lastToken = this.token;\n    const 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  lookahead() {\n    let token = this.token;\n\n    if (token.kind !== TokenKind.EOF) {\n      do {\n        if (token.next) {\n          token = token.next;\n        } else {\n          // Read the next token and form a link in the token linked-list.\n          const nextToken = readNextToken(this, token.end); // @ts-expect-error next is only mutable during parsing.\n\n          token.next = nextToken; // @ts-expect-error prev is only mutable during parsing.\n\n          nextToken.prev = token;\n          token = nextToken;\n        }\n      } while (token.kind === TokenKind.COMMENT);\n    }\n\n    return token;\n  }\n}\n/**\n * @internal\n */\n\nexport function isPunctuatorTokenKind(kind) {\n  return (\n    kind === TokenKind.BANG ||\n    kind === TokenKind.DOLLAR ||\n    kind === TokenKind.AMP ||\n    kind === TokenKind.PAREN_L ||\n    kind === TokenKind.PAREN_R ||\n    kind === TokenKind.SPREAD ||\n    kind === TokenKind.COLON ||\n    kind === TokenKind.EQUALS ||\n    kind === TokenKind.AT ||\n    kind === TokenKind.BRACKET_L ||\n    kind === TokenKind.BRACKET_R ||\n    kind === TokenKind.BRACE_L ||\n    kind === TokenKind.PIPE ||\n    kind === TokenKind.BRACE_R\n  );\n}\n/**\n * A Unicode scalar value is any Unicode code point except surrogate code\n * points. In other words, the inclusive ranges of values 0x0000 to 0xD7FF and\n * 0xE000 to 0x10FFFF.\n *\n * SourceCharacter ::\n *   - \"Any Unicode scalar value\"\n */\n\nfunction isUnicodeScalarValue(code) {\n  return (\n    (code >= 0x0000 && code <= 0xd7ff) || (code >= 0xe000 && code <= 0x10ffff)\n  );\n}\n/**\n * The GraphQL specification defines source text as a sequence of unicode scalar\n * values (which Unicode defines to exclude surrogate code points). However\n * JavaScript defines strings as a sequence of UTF-16 code units which may\n * include surrogates. A surrogate pair is a valid source character as it\n * encodes a supplementary code point (above U+FFFF), but unpaired surrogate\n * code points are not valid source characters.\n */\n\nfunction isSupplementaryCodePoint(body, location) {\n  return (\n    isLeadingSurrogate(body.charCodeAt(location)) &&\n    isTrailingSurrogate(body.charCodeAt(location + 1))\n  );\n}\n\nfunction isLeadingSurrogate(code) {\n  return code >= 0xd800 && code <= 0xdbff;\n}\n\nfunction isTrailingSurrogate(code) {\n  return code >= 0xdc00 && code <= 0xdfff;\n}\n/**\n * Prints the code point (or end of file reference) at a given location in a\n * source for use in error messages.\n *\n * Printable ASCII is printed quoted, while other points are printed in Unicode\n * code point form (ie. U+1234).\n */\n\nfunction printCodePointAt(lexer, location) {\n  const code = lexer.source.body.codePointAt(location);\n\n  if (code === undefined) {\n    return TokenKind.EOF;\n  } else if (code >= 0x0020 && code <= 0x007e) {\n    // Printable ASCII\n    const char = String.fromCodePoint(code);\n    return char === '\"' ? \"'\\\"'\" : `\"${char}\"`;\n  } // Unicode code point\n\n  return 'U+' + code.toString(16).toUpperCase().padStart(4, '0');\n}\n/**\n * Create a token with line and column location information.\n */\n\nfunction createToken(lexer, kind, start, end, value) {\n  const line = lexer.line;\n  const col = 1 + start - lexer.lineStart;\n  return new Token(kind, start, end, line, col, value);\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\nfunction readNextToken(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let position = start;\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position); // SourceCharacter\n\n    switch (code) {\n      // Ignored ::\n      //   - UnicodeBOM\n      //   - WhiteSpace\n      //   - LineTerminator\n      //   - Comment\n      //   - Comma\n      //\n      // UnicodeBOM :: \"Byte Order Mark (U+FEFF)\"\n      //\n      // WhiteSpace ::\n      //   - \"Horizontal Tab (U+0009)\"\n      //   - \"Space (U+0020)\"\n      //\n      // Comma :: ,\n      case 0xfeff: // <BOM>\n\n      case 0x0009: // \\t\n\n      case 0x0020: // <space>\n\n      case 0x002c:\n        // ,\n        ++position;\n        continue;\n      // LineTerminator ::\n      //   - \"New Line (U+000A)\"\n      //   - \"Carriage Return (U+000D)\" [lookahead != \"New Line (U+000A)\"]\n      //   - \"Carriage Return (U+000D)\" \"New Line (U+000A)\"\n\n      case 0x000a:\n        // \\n\n        ++position;\n        ++lexer.line;\n        lexer.lineStart = position;\n        continue;\n\n      case 0x000d:\n        // \\r\n        if (body.charCodeAt(position + 1) === 0x000a) {\n          position += 2;\n        } else {\n          ++position;\n        }\n\n        ++lexer.line;\n        lexer.lineStart = position;\n        continue;\n      // Comment\n\n      case 0x0023:\n        // #\n        return readComment(lexer, position);\n      // Token ::\n      //   - Punctuator\n      //   - Name\n      //   - IntValue\n      //   - FloatValue\n      //   - StringValue\n      //\n      // Punctuator :: one of ! $ & ( ) ... : = @ [ ] { | }\n\n      case 0x0021:\n        // !\n        return createToken(lexer, TokenKind.BANG, position, position + 1);\n\n      case 0x0024:\n        // $\n        return createToken(lexer, TokenKind.DOLLAR, position, position + 1);\n\n      case 0x0026:\n        // &\n        return createToken(lexer, TokenKind.AMP, position, position + 1);\n\n      case 0x0028:\n        // (\n        return createToken(lexer, TokenKind.PAREN_L, position, position + 1);\n\n      case 0x0029:\n        // )\n        return createToken(lexer, TokenKind.PAREN_R, position, position + 1);\n\n      case 0x002e:\n        // .\n        if (\n          body.charCodeAt(position + 1) === 0x002e &&\n          body.charCodeAt(position + 2) === 0x002e\n        ) {\n          return createToken(lexer, TokenKind.SPREAD, position, position + 3);\n        }\n\n        break;\n\n      case 0x003a:\n        // :\n        return createToken(lexer, TokenKind.COLON, position, position + 1);\n\n      case 0x003d:\n        // =\n        return createToken(lexer, TokenKind.EQUALS, position, position + 1);\n\n      case 0x0040:\n        // @\n        return createToken(lexer, TokenKind.AT, position, position + 1);\n\n      case 0x005b:\n        // [\n        return createToken(lexer, TokenKind.BRACKET_L, position, position + 1);\n\n      case 0x005d:\n        // ]\n        return createToken(lexer, TokenKind.BRACKET_R, position, position + 1);\n\n      case 0x007b:\n        // {\n        return createToken(lexer, TokenKind.BRACE_L, position, position + 1);\n\n      case 0x007c:\n        // |\n        return createToken(lexer, TokenKind.PIPE, position, position + 1);\n\n      case 0x007d:\n        // }\n        return createToken(lexer, TokenKind.BRACE_R, position, position + 1);\n      // StringValue\n\n      case 0x0022:\n        // \"\n        if (\n          body.charCodeAt(position + 1) === 0x0022 &&\n          body.charCodeAt(position + 2) === 0x0022\n        ) {\n          return readBlockString(lexer, position);\n        }\n\n        return readString(lexer, position);\n    } // IntValue | FloatValue (Digit | -)\n\n    if (isDigit(code) || code === 0x002d) {\n      return readNumber(lexer, position, code);\n    } // Name\n\n    if (isNameStart(code)) {\n      return readName(lexer, position);\n    }\n\n    throw syntaxError(\n      lexer.source,\n      position,\n      code === 0x0027\n        ? 'Unexpected single quote character (\\'), did you mean to use a double quote (\")?'\n        : isUnicodeScalarValue(code) || isSupplementaryCodePoint(body, position)\n        ? `Unexpected character: ${printCodePointAt(lexer, position)}.`\n        : `Invalid character: ${printCodePointAt(lexer, position)}.`,\n    );\n  }\n\n  return createToken(lexer, TokenKind.EOF, bodyLength, bodyLength);\n}\n/**\n * Reads a comment token from the source file.\n *\n * ```\n * Comment :: # CommentChar* [lookahead != CommentChar]\n *\n * CommentChar :: SourceCharacter but not LineTerminator\n * ```\n */\n\nfunction readComment(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let position = start + 1;\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position); // LineTerminator (\\n | \\r)\n\n    if (code === 0x000a || code === 0x000d) {\n      break;\n    } // SourceCharacter\n\n    if (isUnicodeScalarValue(code)) {\n      ++position;\n    } else if (isSupplementaryCodePoint(body, position)) {\n      position += 2;\n    } else {\n      break;\n    }\n  }\n\n  return createToken(\n    lexer,\n    TokenKind.COMMENT,\n    start,\n    position,\n    body.slice(start + 1, position),\n  );\n}\n/**\n * Reads a number token from the source file, either a FloatValue or an IntValue\n * depending on whether a FractionalPart or ExponentPart is encountered.\n *\n * ```\n * IntValue :: IntegerPart [lookahead != {Digit, `.`, NameStart}]\n *\n * IntegerPart ::\n *   - NegativeSign? 0\n *   - NegativeSign? NonZeroDigit Digit*\n *\n * NegativeSign :: -\n *\n * NonZeroDigit :: Digit but not `0`\n *\n * FloatValue ::\n *   - IntegerPart FractionalPart ExponentPart [lookahead != {Digit, `.`, NameStart}]\n *   - IntegerPart FractionalPart [lookahead != {Digit, `.`, NameStart}]\n *   - IntegerPart ExponentPart [lookahead != {Digit, `.`, NameStart}]\n *\n * FractionalPart :: . Digit+\n *\n * ExponentPart :: ExponentIndicator Sign? Digit+\n *\n * ExponentIndicator :: one of `e` `E`\n *\n * Sign :: one of + -\n * ```\n */\n\nfunction readNumber(lexer, start, firstCode) {\n  const body = lexer.source.body;\n  let position = start;\n  let code = firstCode;\n  let isFloat = false; // NegativeSign (-)\n\n  if (code === 0x002d) {\n    code = body.charCodeAt(++position);\n  } // Zero (0)\n\n  if (code === 0x0030) {\n    code = body.charCodeAt(++position);\n\n    if (isDigit(code)) {\n      throw syntaxError(\n        lexer.source,\n        position,\n        `Invalid number, unexpected digit after 0: ${printCodePointAt(\n          lexer,\n          position,\n        )}.`,\n      );\n    }\n  } else {\n    position = readDigits(lexer, position, code);\n    code = body.charCodeAt(position);\n  } // Full stop (.)\n\n  if (code === 0x002e) {\n    isFloat = true;\n    code = body.charCodeAt(++position);\n    position = readDigits(lexer, position, code);\n    code = body.charCodeAt(position);\n  } // E e\n\n  if (code === 0x0045 || code === 0x0065) {\n    isFloat = true;\n    code = body.charCodeAt(++position); // + -\n\n    if (code === 0x002b || code === 0x002d) {\n      code = body.charCodeAt(++position);\n    }\n\n    position = readDigits(lexer, position, code);\n    code = body.charCodeAt(position);\n  } // Numbers cannot be followed by . or NameStart\n\n  if (code === 0x002e || isNameStart(code)) {\n    throw syntaxError(\n      lexer.source,\n      position,\n      `Invalid number, expected digit but got: ${printCodePointAt(\n        lexer,\n        position,\n      )}.`,\n    );\n  }\n\n  return createToken(\n    lexer,\n    isFloat ? TokenKind.FLOAT : TokenKind.INT,\n    start,\n    position,\n    body.slice(start, position),\n  );\n}\n/**\n * Returns the new position in the source after reading one or more digits.\n */\n\nfunction readDigits(lexer, start, firstCode) {\n  if (!isDigit(firstCode)) {\n    throw syntaxError(\n      lexer.source,\n      start,\n      `Invalid number, expected digit but got: ${printCodePointAt(\n        lexer,\n        start,\n      )}.`,\n    );\n  }\n\n  const body = lexer.source.body;\n  let position = start + 1; // +1 to skip first firstCode\n\n  while (isDigit(body.charCodeAt(position))) {\n    ++position;\n  }\n\n  return position;\n}\n/**\n * Reads a single-quote string token from the source file.\n *\n * ```\n * StringValue ::\n *   - `\"\"` [lookahead != `\"`]\n *   - `\"` StringCharacter+ `\"`\n *\n * StringCharacter ::\n *   - SourceCharacter but not `\"` or `\\` or LineTerminator\n *   - `\\u` EscapedUnicode\n *   - `\\` EscapedCharacter\n *\n * EscapedUnicode ::\n *   - `{` HexDigit+ `}`\n *   - HexDigit HexDigit HexDigit HexDigit\n *\n * EscapedCharacter :: one of `\"` `\\` `/` `b` `f` `n` `r` `t`\n * ```\n */\n\nfunction readString(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let position = start + 1;\n  let chunkStart = position;\n  let value = '';\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position); // Closing Quote (\")\n\n    if (code === 0x0022) {\n      value += body.slice(chunkStart, position);\n      return createToken(lexer, TokenKind.STRING, start, position + 1, value);\n    } // Escape Sequence (\\)\n\n    if (code === 0x005c) {\n      value += body.slice(chunkStart, position);\n      const escape =\n        body.charCodeAt(position + 1) === 0x0075 // u\n          ? body.charCodeAt(position + 2) === 0x007b // {\n            ? readEscapedUnicodeVariableWidth(lexer, position)\n            : readEscapedUnicodeFixedWidth(lexer, position)\n          : readEscapedCharacter(lexer, position);\n      value += escape.value;\n      position += escape.size;\n      chunkStart = position;\n      continue;\n    } // LineTerminator (\\n | \\r)\n\n    if (code === 0x000a || code === 0x000d) {\n      break;\n    } // SourceCharacter\n\n    if (isUnicodeScalarValue(code)) {\n      ++position;\n    } else if (isSupplementaryCodePoint(body, position)) {\n      position += 2;\n    } else {\n      throw syntaxError(\n        lexer.source,\n        position,\n        `Invalid character within String: ${printCodePointAt(\n          lexer,\n          position,\n        )}.`,\n      );\n    }\n  }\n\n  throw syntaxError(lexer.source, position, 'Unterminated string.');\n} // The string value and lexed size of an escape sequence.\n\nfunction readEscapedUnicodeVariableWidth(lexer, position) {\n  const body = lexer.source.body;\n  let point = 0;\n  let size = 3; // Cannot be larger than 12 chars (\\u{00000000}).\n\n  while (size < 12) {\n    const code = body.charCodeAt(position + size++); // Closing Brace (})\n\n    if (code === 0x007d) {\n      // Must be at least 5 chars (\\u{0}) and encode a Unicode scalar value.\n      if (size < 5 || !isUnicodeScalarValue(point)) {\n        break;\n      }\n\n      return {\n        value: String.fromCodePoint(point),\n        size,\n      };\n    } // Append this hex digit to the code point.\n\n    point = (point << 4) | readHexDigit(code);\n\n    if (point < 0) {\n      break;\n    }\n  }\n\n  throw syntaxError(\n    lexer.source,\n    position,\n    `Invalid Unicode escape sequence: \"${body.slice(\n      position,\n      position + size,\n    )}\".`,\n  );\n}\n\nfunction readEscapedUnicodeFixedWidth(lexer, position) {\n  const body = lexer.source.body;\n  const code = read16BitHexCode(body, position + 2);\n\n  if (isUnicodeScalarValue(code)) {\n    return {\n      value: String.fromCodePoint(code),\n      size: 6,\n    };\n  } // GraphQL allows JSON-style surrogate pair escape sequences, but only when\n  // a valid pair is formed.\n\n  if (isLeadingSurrogate(code)) {\n    // \\u\n    if (\n      body.charCodeAt(position + 6) === 0x005c &&\n      body.charCodeAt(position + 7) === 0x0075\n    ) {\n      const trailingCode = read16BitHexCode(body, position + 8);\n\n      if (isTrailingSurrogate(trailingCode)) {\n        // JavaScript defines strings as a sequence of UTF-16 code units and\n        // encodes Unicode code points above U+FFFF using a surrogate pair of\n        // code units. Since this is a surrogate pair escape sequence, just\n        // include both codes into the JavaScript string value. Had JavaScript\n        // not been internally based on UTF-16, then this surrogate pair would\n        // be decoded to retrieve the supplementary code point.\n        return {\n          value: String.fromCodePoint(code, trailingCode),\n          size: 12,\n        };\n      }\n    }\n  }\n\n  throw syntaxError(\n    lexer.source,\n    position,\n    `Invalid Unicode escape sequence: \"${body.slice(position, position + 6)}\".`,\n  );\n}\n/**\n * Reads four hexadecimal characters and returns the positive integer that 16bit\n * hexadecimal string represents. For example, \"000f\" will return 15, and \"dead\"\n * will return 57005.\n *\n * Returns a negative number if any char was not a valid hexadecimal digit.\n */\n\nfunction read16BitHexCode(body, position) {\n  // readHexDigit() returns -1 on error. ORing a negative value with any other\n  // value always produces a negative value.\n  return (\n    (readHexDigit(body.charCodeAt(position)) << 12) |\n    (readHexDigit(body.charCodeAt(position + 1)) << 8) |\n    (readHexDigit(body.charCodeAt(position + 2)) << 4) |\n    readHexDigit(body.charCodeAt(position + 3))\n  );\n}\n/**\n * Reads a hexadecimal character and returns its positive integer value (0-15).\n *\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 if the provided character code was not a valid hexadecimal digit.\n *\n * HexDigit :: one of\n *   - `0` `1` `2` `3` `4` `5` `6` `7` `8` `9`\n *   - `A` `B` `C` `D` `E` `F`\n *   - `a` `b` `c` `d` `e` `f`\n */\n\nfunction readHexDigit(code) {\n  return code >= 0x0030 && code <= 0x0039 // 0-9\n    ? code - 0x0030\n    : code >= 0x0041 && code <= 0x0046 // A-F\n    ? code - 0x0037\n    : code >= 0x0061 && code <= 0x0066 // a-f\n    ? code - 0x0057\n    : -1;\n}\n/**\n * | Escaped Character | Code Point | Character Name               |\n * | ----------------- | ---------- | ---------------------------- |\n * | `\"`               | U+0022     | double quote                 |\n * | `\\`               | U+005C     | reverse solidus (back slash) |\n * | `/`               | U+002F     | solidus (forward slash)      |\n * | `b`               | U+0008     | backspace                    |\n * | `f`               | U+000C     | form feed                    |\n * | `n`               | U+000A     | line feed (new line)         |\n * | `r`               | U+000D     | carriage return              |\n * | `t`               | U+0009     | horizontal tab               |\n */\n\nfunction readEscapedCharacter(lexer, position) {\n  const body = lexer.source.body;\n  const code = body.charCodeAt(position + 1);\n\n  switch (code) {\n    case 0x0022:\n      // \"\n      return {\n        value: '\\u0022',\n        size: 2,\n      };\n\n    case 0x005c:\n      // \\\n      return {\n        value: '\\u005c',\n        size: 2,\n      };\n\n    case 0x002f:\n      // /\n      return {\n        value: '\\u002f',\n        size: 2,\n      };\n\n    case 0x0062:\n      // b\n      return {\n        value: '\\u0008',\n        size: 2,\n      };\n\n    case 0x0066:\n      // f\n      return {\n        value: '\\u000c',\n        size: 2,\n      };\n\n    case 0x006e:\n      // n\n      return {\n        value: '\\u000a',\n        size: 2,\n      };\n\n    case 0x0072:\n      // r\n      return {\n        value: '\\u000d',\n        size: 2,\n      };\n\n    case 0x0074:\n      // t\n      return {\n        value: '\\u0009',\n        size: 2,\n      };\n  }\n\n  throw syntaxError(\n    lexer.source,\n    position,\n    `Invalid character escape sequence: \"${body.slice(\n      position,\n      position + 2,\n    )}\".`,\n  );\n}\n/**\n * Reads a block string token from the source file.\n *\n * ```\n * StringValue ::\n *   - `\"\"\"` BlockStringCharacter* `\"\"\"`\n *\n * BlockStringCharacter ::\n *   - SourceCharacter but not `\"\"\"` or `\\\"\"\"`\n *   - `\\\"\"\"`\n * ```\n */\n\nfunction readBlockString(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let lineStart = lexer.lineStart;\n  let position = start + 3;\n  let chunkStart = position;\n  let currentLine = '';\n  const blockLines = [];\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position); // Closing Triple-Quote (\"\"\")\n\n    if (\n      code === 0x0022 &&\n      body.charCodeAt(position + 1) === 0x0022 &&\n      body.charCodeAt(position + 2) === 0x0022\n    ) {\n      currentLine += body.slice(chunkStart, position);\n      blockLines.push(currentLine);\n      const token = createToken(\n        lexer,\n        TokenKind.BLOCK_STRING,\n        start,\n        position + 3, // Return a string of the lines joined with U+000A.\n        dedentBlockStringLines(blockLines).join('\\n'),\n      );\n      lexer.line += blockLines.length - 1;\n      lexer.lineStart = lineStart;\n      return token;\n    } // Escaped Triple-Quote (\\\"\"\")\n\n    if (\n      code === 0x005c &&\n      body.charCodeAt(position + 1) === 0x0022 &&\n      body.charCodeAt(position + 2) === 0x0022 &&\n      body.charCodeAt(position + 3) === 0x0022\n    ) {\n      currentLine += body.slice(chunkStart, position);\n      chunkStart = position + 1; // skip only slash\n\n      position += 4;\n      continue;\n    } // LineTerminator\n\n    if (code === 0x000a || code === 0x000d) {\n      currentLine += body.slice(chunkStart, position);\n      blockLines.push(currentLine);\n\n      if (code === 0x000d && body.charCodeAt(position + 1) === 0x000a) {\n        position += 2;\n      } else {\n        ++position;\n      }\n\n      currentLine = '';\n      chunkStart = position;\n      lineStart = position;\n      continue;\n    } // SourceCharacter\n\n    if (isUnicodeScalarValue(code)) {\n      ++position;\n    } else if (isSupplementaryCodePoint(body, position)) {\n      position += 2;\n    } else {\n      throw syntaxError(\n        lexer.source,\n        position,\n        `Invalid character within String: ${printCodePointAt(\n          lexer,\n          position,\n        )}.`,\n      );\n    }\n  }\n\n  throw syntaxError(lexer.source, position, 'Unterminated string.');\n}\n/**\n * Reads an alphanumeric + underscore name from the source.\n *\n * ```\n * Name ::\n *   - NameStart NameContinue* [lookahead != NameContinue]\n * ```\n */\n\nfunction readName(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let position = start + 1;\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position);\n\n    if (isNameContinue(code)) {\n      ++position;\n    } else {\n      break;\n    }\n  }\n\n  return createToken(\n    lexer,\n    TokenKind.NAME,\n    start,\n    position,\n    body.slice(start, position),\n  );\n}\n","const MAX_ARRAY_LENGTH = 10;\nconst MAX_RECURSIVE_DEPTH = 2;\n/**\n * Used to print values in error messages.\n */\n\nexport 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 ${value.name}]` : '[function]';\n\n    case 'object':\n      return formatObjectValue(value, seenValues);\n\n    default:\n      return String(value);\n  }\n}\n\nfunction formatObjectValue(value, previouslySeenValues) {\n  if (value === null) {\n    return 'null';\n  }\n\n  if (previouslySeenValues.includes(value)) {\n    return '[Circular]';\n  }\n\n  const seenValues = [...previouslySeenValues, value];\n\n  if (isJSONable(value)) {\n    const jsonValue = value.toJSON(); // check for infinite recursion\n\n    if (jsonValue !== value) {\n      return typeof jsonValue === 'string'\n        ? jsonValue\n        : formatValue(jsonValue, seenValues);\n    }\n  } else if (Array.isArray(value)) {\n    return formatArray(value, seenValues);\n  }\n\n  return formatObject(value, seenValues);\n}\n\nfunction isJSONable(value) {\n  return typeof value.toJSON === 'function';\n}\n\nfunction formatObject(object, seenValues) {\n  const entries = Object.entries(object);\n\n  if (entries.length === 0) {\n    return '{}';\n  }\n\n  if (seenValues.length > MAX_RECURSIVE_DEPTH) {\n    return '[' + getObjectTag(object) + ']';\n  }\n\n  const properties = entries.map(\n    ([key, value]) => key + ': ' + formatValue(value, seenValues),\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  const len = Math.min(MAX_ARRAY_LENGTH, array.length);\n  const remaining = array.length - len;\n  const items = [];\n\n  for (let 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(`... ${remaining} more items`);\n  }\n\n  return '[' + items.join(', ') + ']';\n}\n\nfunction getObjectTag(object) {\n  const tag = Object.prototype.toString\n    .call(object)\n    .replace(/^\\[object /, '')\n    .replace(/]$/, '');\n\n  if (tag === 'Object' && typeof object.constructor === 'function') {\n    const name = object.constructor.name;\n\n    if (typeof name === 'string' && name !== '') {\n      return name;\n    }\n  }\n\n  return tag;\n}\n","import { inspect } from './inspect.mjs';\n/* c8 ignore next 3 */\n\nconst isProduction =\n  globalThis.process && // eslint-disable-next-line no-undef\n  process.env.NODE_ENV === 'production';\n/**\n * A replacement for instanceof which includes an error warning when multi-realm\n * constructors are detected.\n * See: https://expressjs.com/en/advanced/best-practice-performance.html#set-node_env-to-production\n * See: https://webpack.js.org/guides/production/\n */\n\nexport const instanceOf =\n  /* c8 ignore next 6 */\n  // FIXME: https://github.com/graphql/graphql-js/issues/2317\n  isProduction\n    ? function instanceOf(value, constructor) {\n        return value instanceof constructor;\n      }\n    : function instanceOf(value, constructor) {\n        if (value instanceof constructor) {\n          return true;\n        }\n\n        if (typeof value === 'object' && value !== null) {\n          var _value$constructor;\n\n          // Prefer Symbol.toStringTag since it is immune to minification.\n          const className = constructor.prototype[Symbol.toStringTag];\n          const valueClassName = // We still need to support constructor's name to detect conflicts with older versions of this library.\n            Symbol.toStringTag in value // @ts-expect-error TS bug see, https://github.com/microsoft/TypeScript/issues/38009\n              ? value[Symbol.toStringTag]\n              : (_value$constructor = value.constructor) === null ||\n                _value$constructor === void 0\n              ? void 0\n              : _value$constructor.name;\n\n          if (className === valueClassName) {\n            const stringifiedValue = inspect(value);\n            throw new Error(`Cannot use ${className} \"${stringifiedValue}\" 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","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.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 class Source {\n  constructor(\n    body,\n    name = 'GraphQL request',\n    locationOffset = {\n      line: 1,\n      column: 1,\n    },\n  ) {\n    typeof body === 'string' ||\n      devAssert(false, `Body must be a string. Received: ${inspect(body)}.`);\n    this.body = body;\n    this.name = name;\n    this.locationOffset = locationOffset;\n    this.locationOffset.line > 0 ||\n      devAssert(\n        false,\n        'line in locationOffset is 1-indexed and must be positive.',\n      );\n    this.locationOffset.column > 0 ||\n      devAssert(\n        false,\n        'column in locationOffset is 1-indexed and must be positive.',\n      );\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'Source';\n  }\n}\n/**\n * Test if the given value is a Source object.\n *\n * @internal\n */\n\nexport function isSource(source) {\n  return instanceOf(source, Source);\n}\n","import { syntaxError } from '../error/syntaxError.mjs';\nimport { Location, OperationTypeNode } from './ast.mjs';\nimport { DirectiveLocation } from './directiveLocation.mjs';\nimport { Kind } from './kinds.mjs';\nimport { isPunctuatorTokenKind, Lexer } from './lexer.mjs';\nimport { isSource, Source } from './source.mjs';\nimport { TokenKind } from './tokenKind.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  const 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  const parser = new Parser(source, options);\n  parser.expectToken(TokenKind.SOF);\n  const value = parser.parseValueLiteral(false);\n  parser.expectToken(TokenKind.EOF);\n  return value;\n}\n/**\n * Similar to parseValue(), but raises a parse error if it encounters a\n * variable. The return type will be a constant value.\n */\n\nexport function parseConstValue(source, options) {\n  const parser = new Parser(source, options);\n  parser.expectToken(TokenKind.SOF);\n  const value = parser.parseConstValueLiteral();\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  const parser = new Parser(source, options);\n  parser.expectToken(TokenKind.SOF);\n  const 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 class Parser {\n  constructor(source, options = {}) {\n    const sourceObj = isSource(source) ? source : new Source(source);\n    this._lexer = new Lexer(sourceObj);\n    this._options = options;\n    this._tokenCounter = 0;\n  }\n  /**\n   * Converts a name lex token into a name parse node.\n   */\n\n  parseName() {\n    const token = this.expectToken(TokenKind.NAME);\n    return this.node(token, {\n      kind: Kind.NAME,\n      value: token.value,\n    });\n  } // Implements the parsing rules in the Document section.\n\n  /**\n   * Document : Definition+\n   */\n\n  parseDocument() {\n    return this.node(this._lexer.token, {\n      kind: Kind.DOCUMENT,\n      definitions: this.many(\n        TokenKind.SOF,\n        this.parseDefinition,\n        TokenKind.EOF,\n      ),\n    });\n  }\n  /**\n   * Definition :\n   *   - ExecutableDefinition\n   *   - TypeSystemDefinition\n   *   - TypeSystemExtension\n   *\n   * ExecutableDefinition :\n   *   - OperationDefinition\n   *   - FragmentDefinition\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  parseDefinition() {\n    if (this.peek(TokenKind.BRACE_L)) {\n      return this.parseOperationDefinition();\n    } // Many definitions begin with a description and require a lookahead.\n\n    const hasDescription = this.peekDescription();\n    const keywordToken = hasDescription\n      ? this._lexer.lookahead()\n      : 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      if (hasDescription) {\n        throw syntaxError(\n          this._lexer.source,\n          this._lexer.token.start,\n          'Unexpected description, descriptions are supported only on type definitions.',\n        );\n      }\n\n      switch (keywordToken.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 'extend':\n          return this.parseTypeSystemExtension();\n      }\n    }\n\n    throw this.unexpected(keywordToken);\n  } // Implements the parsing rules in the Operations section.\n\n  /**\n   * OperationDefinition :\n   *  - SelectionSet\n   *  - OperationType Name? VariableDefinitions? Directives? SelectionSet\n   */\n\n  parseOperationDefinition() {\n    const start = this._lexer.token;\n\n    if (this.peek(TokenKind.BRACE_L)) {\n      return this.node(start, {\n        kind: Kind.OPERATION_DEFINITION,\n        operation: OperationTypeNode.QUERY,\n        name: undefined,\n        variableDefinitions: [],\n        directives: [],\n        selectionSet: this.parseSelectionSet(),\n      });\n    }\n\n    const operation = this.parseOperationType();\n    let name;\n\n    if (this.peek(TokenKind.NAME)) {\n      name = this.parseName();\n    }\n\n    return this.node(start, {\n      kind: Kind.OPERATION_DEFINITION,\n      operation,\n      name,\n      variableDefinitions: this.parseVariableDefinitions(),\n      directives: this.parseDirectives(false),\n      selectionSet: this.parseSelectionSet(),\n    });\n  }\n  /**\n   * OperationType : one of query mutation subscription\n   */\n\n  parseOperationType() {\n    const operationToken = this.expectToken(TokenKind.NAME);\n\n    switch (operationToken.value) {\n      case 'query':\n        return OperationTypeNode.QUERY;\n\n      case 'mutation':\n        return OperationTypeNode.MUTATION;\n\n      case 'subscription':\n        return OperationTypeNode.SUBSCRIPTION;\n    }\n\n    throw this.unexpected(operationToken);\n  }\n  /**\n   * VariableDefinitions : ( VariableDefinition+ )\n   */\n\n  parseVariableDefinitions() {\n    return this.optionalMany(\n      TokenKind.PAREN_L,\n      this.parseVariableDefinition,\n      TokenKind.PAREN_R,\n    );\n  }\n  /**\n   * VariableDefinition : Variable : Type DefaultValue? Directives[Const]?\n   */\n\n  parseVariableDefinition() {\n    return this.node(this._lexer.token, {\n      kind: Kind.VARIABLE_DEFINITION,\n      variable: this.parseVariable(),\n      type: (this.expectToken(TokenKind.COLON), this.parseTypeReference()),\n      defaultValue: this.expectOptionalToken(TokenKind.EQUALS)\n        ? this.parseConstValueLiteral()\n        : undefined,\n      directives: this.parseConstDirectives(),\n    });\n  }\n  /**\n   * Variable : $ Name\n   */\n\n  parseVariable() {\n    const start = this._lexer.token;\n    this.expectToken(TokenKind.DOLLAR);\n    return this.node(start, {\n      kind: Kind.VARIABLE,\n      name: this.parseName(),\n    });\n  }\n  /**\n   * ```\n   * SelectionSet : { Selection+ }\n   * ```\n   */\n\n  parseSelectionSet() {\n    return this.node(this._lexer.token, {\n      kind: Kind.SELECTION_SET,\n      selections: this.many(\n        TokenKind.BRACE_L,\n        this.parseSelection,\n        TokenKind.BRACE_R,\n      ),\n    });\n  }\n  /**\n   * Selection :\n   *   - Field\n   *   - FragmentSpread\n   *   - InlineFragment\n   */\n\n  parseSelection() {\n    return this.peek(TokenKind.SPREAD)\n      ? this.parseFragment()\n      : this.parseField();\n  }\n  /**\n   * Field : Alias? Name Arguments? Directives? SelectionSet?\n   *\n   * Alias : Name :\n   */\n\n  parseField() {\n    const start = this._lexer.token;\n    const nameOrAlias = this.parseName();\n    let alias;\n    let name;\n\n    if (this.expectOptionalToken(TokenKind.COLON)) {\n      alias = nameOrAlias;\n      name = this.parseName();\n    } else {\n      name = nameOrAlias;\n    }\n\n    return this.node(start, {\n      kind: Kind.FIELD,\n      alias,\n      name,\n      arguments: this.parseArguments(false),\n      directives: this.parseDirectives(false),\n      selectionSet: this.peek(TokenKind.BRACE_L)\n        ? this.parseSelectionSet()\n        : undefined,\n    });\n  }\n  /**\n   * Arguments[Const] : ( Argument[?Const]+ )\n   */\n\n  parseArguments(isConst) {\n    const 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  parseArgument(isConst = false) {\n    const start = this._lexer.token;\n    const name = this.parseName();\n    this.expectToken(TokenKind.COLON);\n    return this.node(start, {\n      kind: Kind.ARGUMENT,\n      name,\n      value: this.parseValueLiteral(isConst),\n    });\n  }\n\n  parseConstArgument() {\n    return this.parseArgument(true);\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  parseFragment() {\n    const start = this._lexer.token;\n    this.expectToken(TokenKind.SPREAD);\n    const hasTypeCondition = this.expectOptionalKeyword('on');\n\n    if (!hasTypeCondition && this.peek(TokenKind.NAME)) {\n      return this.node(start, {\n        kind: Kind.FRAGMENT_SPREAD,\n        name: this.parseFragmentName(),\n        directives: this.parseDirectives(false),\n      });\n    }\n\n    return this.node(start, {\n      kind: Kind.INLINE_FRAGMENT,\n      typeCondition: hasTypeCondition ? this.parseNamedType() : undefined,\n      directives: this.parseDirectives(false),\n      selectionSet: this.parseSelectionSet(),\n    });\n  }\n  /**\n   * FragmentDefinition :\n   *   - fragment FragmentName on TypeCondition Directives? SelectionSet\n   *\n   * TypeCondition : NamedType\n   */\n\n  parseFragmentDefinition() {\n    const start = this._lexer.token;\n    this.expectKeyword('fragment'); // Legacy 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.allowLegacyFragmentVariables === true) {\n      return this.node(start, {\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      });\n    }\n\n    return this.node(start, {\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    });\n  }\n  /**\n   * FragmentName : Name but not `on`\n   */\n\n  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  parseValueLiteral(isConst) {\n    const 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.advanceLexer();\n        return this.node(token, {\n          kind: Kind.INT,\n          value: token.value,\n        });\n\n      case TokenKind.FLOAT:\n        this.advanceLexer();\n        return this.node(token, {\n          kind: Kind.FLOAT,\n          value: token.value,\n        });\n\n      case TokenKind.STRING:\n      case TokenKind.BLOCK_STRING:\n        return this.parseStringLiteral();\n\n      case TokenKind.NAME:\n        this.advanceLexer();\n\n        switch (token.value) {\n          case 'true':\n            return this.node(token, {\n              kind: Kind.BOOLEAN,\n              value: true,\n            });\n\n          case 'false':\n            return this.node(token, {\n              kind: Kind.BOOLEAN,\n              value: false,\n            });\n\n          case 'null':\n            return this.node(token, {\n              kind: Kind.NULL,\n            });\n\n          default:\n            return this.node(token, {\n              kind: Kind.ENUM,\n              value: token.value,\n            });\n        }\n\n      case TokenKind.DOLLAR:\n        if (isConst) {\n          this.expectToken(TokenKind.DOLLAR);\n\n          if (this._lexer.token.kind === TokenKind.NAME) {\n            const varName = this._lexer.token.value;\n            throw syntaxError(\n              this._lexer.source,\n              token.start,\n              `Unexpected variable \"$${varName}\" in constant value.`,\n            );\n          } else {\n            throw this.unexpected(token);\n          }\n        }\n\n        return this.parseVariable();\n\n      default:\n        throw this.unexpected();\n    }\n  }\n\n  parseConstValueLiteral() {\n    return this.parseValueLiteral(true);\n  }\n\n  parseStringLiteral() {\n    const token = this._lexer.token;\n    this.advanceLexer();\n    return this.node(token, {\n      kind: Kind.STRING,\n      value: token.value,\n      block: token.kind === TokenKind.BLOCK_STRING,\n    });\n  }\n  /**\n   * ListValue[Const] :\n   *   - [ ]\n   *   - [ Value[?Const]+ ]\n   */\n\n  parseList(isConst) {\n    const item = () => this.parseValueLiteral(isConst);\n\n    return this.node(this._lexer.token, {\n      kind: Kind.LIST,\n      values: this.any(TokenKind.BRACKET_L, item, TokenKind.BRACKET_R),\n    });\n  }\n  /**\n   * ```\n   * ObjectValue[Const] :\n   *   - { }\n   *   - { ObjectField[?Const]+ }\n   * ```\n   */\n\n  parseObject(isConst) {\n    const item = () => this.parseObjectField(isConst);\n\n    return this.node(this._lexer.token, {\n      kind: Kind.OBJECT,\n      fields: this.any(TokenKind.BRACE_L, item, TokenKind.BRACE_R),\n    });\n  }\n  /**\n   * ObjectField[Const] : Name : Value[?Const]\n   */\n\n  parseObjectField(isConst) {\n    const start = this._lexer.token;\n    const name = this.parseName();\n    this.expectToken(TokenKind.COLON);\n    return this.node(start, {\n      kind: Kind.OBJECT_FIELD,\n      name,\n      value: this.parseValueLiteral(isConst),\n    });\n  } // Implements the parsing rules in the Directives section.\n\n  /**\n   * Directives[Const] : Directive[?Const]+\n   */\n\n  parseDirectives(isConst) {\n    const directives = [];\n\n    while (this.peek(TokenKind.AT)) {\n      directives.push(this.parseDirective(isConst));\n    }\n\n    return directives;\n  }\n\n  parseConstDirectives() {\n    return this.parseDirectives(true);\n  }\n  /**\n   * ```\n   * Directive[Const] : @ Name Arguments[?Const]?\n   * ```\n   */\n\n  parseDirective(isConst) {\n    const start = this._lexer.token;\n    this.expectToken(TokenKind.AT);\n    return this.node(start, {\n      kind: Kind.DIRECTIVE,\n      name: this.parseName(),\n      arguments: this.parseArguments(isConst),\n    });\n  } // Implements the parsing rules in the Types section.\n\n  /**\n   * Type :\n   *   - NamedType\n   *   - ListType\n   *   - NonNullType\n   */\n\n  parseTypeReference() {\n    const start = this._lexer.token;\n    let type;\n\n    if (this.expectOptionalToken(TokenKind.BRACKET_L)) {\n      const innerType = this.parseTypeReference();\n      this.expectToken(TokenKind.BRACKET_R);\n      type = this.node(start, {\n        kind: Kind.LIST_TYPE,\n        type: innerType,\n      });\n    } else {\n      type = this.parseNamedType();\n    }\n\n    if (this.expectOptionalToken(TokenKind.BANG)) {\n      return this.node(start, {\n        kind: Kind.NON_NULL_TYPE,\n        type,\n      });\n    }\n\n    return type;\n  }\n  /**\n   * NamedType : Name\n   */\n\n  parseNamedType() {\n    return this.node(this._lexer.token, {\n      kind: Kind.NAMED_TYPE,\n      name: this.parseName(),\n    });\n  } // Implements the parsing rules in the Type Definition section.\n\n  peekDescription() {\n    return this.peek(TokenKind.STRING) || this.peek(TokenKind.BLOCK_STRING);\n  }\n  /**\n   * Description : StringValue\n   */\n\n  parseDescription() {\n    if (this.peekDescription()) {\n      return this.parseStringLiteral();\n    }\n  }\n  /**\n   * ```\n   * SchemaDefinition : Description? schema Directives[Const]? { OperationTypeDefinition+ }\n   * ```\n   */\n\n  parseSchemaDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('schema');\n    const directives = this.parseConstDirectives();\n    const operationTypes = this.many(\n      TokenKind.BRACE_L,\n      this.parseOperationTypeDefinition,\n      TokenKind.BRACE_R,\n    );\n    return this.node(start, {\n      kind: Kind.SCHEMA_DEFINITION,\n      description,\n      directives,\n      operationTypes,\n    });\n  }\n  /**\n   * OperationTypeDefinition : OperationType : NamedType\n   */\n\n  parseOperationTypeDefinition() {\n    const start = this._lexer.token;\n    const operation = this.parseOperationType();\n    this.expectToken(TokenKind.COLON);\n    const type = this.parseNamedType();\n    return this.node(start, {\n      kind: Kind.OPERATION_TYPE_DEFINITION,\n      operation,\n      type,\n    });\n  }\n  /**\n   * ScalarTypeDefinition : Description? scalar Name Directives[Const]?\n   */\n\n  parseScalarTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('scalar');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    return this.node(start, {\n      kind: Kind.SCALAR_TYPE_DEFINITION,\n      description,\n      name,\n      directives,\n    });\n  }\n  /**\n   * ObjectTypeDefinition :\n   *   Description?\n   *   type Name ImplementsInterfaces? Directives[Const]? FieldsDefinition?\n   */\n\n  parseObjectTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('type');\n    const name = this.parseName();\n    const interfaces = this.parseImplementsInterfaces();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseFieldsDefinition();\n    return this.node(start, {\n      kind: Kind.OBJECT_TYPE_DEFINITION,\n      description,\n      name,\n      interfaces,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * ImplementsInterfaces :\n   *   - implements `&`? NamedType\n   *   - ImplementsInterfaces & NamedType\n   */\n\n  parseImplementsInterfaces() {\n    return this.expectOptionalKeyword('implements')\n      ? this.delimitedMany(TokenKind.AMP, this.parseNamedType)\n      : [];\n  }\n  /**\n   * ```\n   * FieldsDefinition : { FieldDefinition+ }\n   * ```\n   */\n\n  parseFieldsDefinition() {\n    return this.optionalMany(\n      TokenKind.BRACE_L,\n      this.parseFieldDefinition,\n      TokenKind.BRACE_R,\n    );\n  }\n  /**\n   * FieldDefinition :\n   *   - Description? Name ArgumentsDefinition? : Type Directives[Const]?\n   */\n\n  parseFieldDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    const name = this.parseName();\n    const args = this.parseArgumentDefs();\n    this.expectToken(TokenKind.COLON);\n    const type = this.parseTypeReference();\n    const directives = this.parseConstDirectives();\n    return this.node(start, {\n      kind: Kind.FIELD_DEFINITION,\n      description,\n      name,\n      arguments: args,\n      type,\n      directives,\n    });\n  }\n  /**\n   * ArgumentsDefinition : ( InputValueDefinition+ )\n   */\n\n  parseArgumentDefs() {\n    return this.optionalMany(\n      TokenKind.PAREN_L,\n      this.parseInputValueDef,\n      TokenKind.PAREN_R,\n    );\n  }\n  /**\n   * InputValueDefinition :\n   *   - Description? Name : Type DefaultValue? Directives[Const]?\n   */\n\n  parseInputValueDef() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    const name = this.parseName();\n    this.expectToken(TokenKind.COLON);\n    const type = this.parseTypeReference();\n    let defaultValue;\n\n    if (this.expectOptionalToken(TokenKind.EQUALS)) {\n      defaultValue = this.parseConstValueLiteral();\n    }\n\n    const directives = this.parseConstDirectives();\n    return this.node(start, {\n      kind: Kind.INPUT_VALUE_DEFINITION,\n      description,\n      name,\n      type,\n      defaultValue,\n      directives,\n    });\n  }\n  /**\n   * InterfaceTypeDefinition :\n   *   - Description? interface Name Directives[Const]? FieldsDefinition?\n   */\n\n  parseInterfaceTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('interface');\n    const name = this.parseName();\n    const interfaces = this.parseImplementsInterfaces();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseFieldsDefinition();\n    return this.node(start, {\n      kind: Kind.INTERFACE_TYPE_DEFINITION,\n      description,\n      name,\n      interfaces,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * UnionTypeDefinition :\n   *   - Description? union Name Directives[Const]? UnionMemberTypes?\n   */\n\n  parseUnionTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('union');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const types = this.parseUnionMemberTypes();\n    return this.node(start, {\n      kind: Kind.UNION_TYPE_DEFINITION,\n      description,\n      name,\n      directives,\n      types,\n    });\n  }\n  /**\n   * UnionMemberTypes :\n   *   - = `|`? NamedType\n   *   - UnionMemberTypes | NamedType\n   */\n\n  parseUnionMemberTypes() {\n    return this.expectOptionalToken(TokenKind.EQUALS)\n      ? this.delimitedMany(TokenKind.PIPE, this.parseNamedType)\n      : [];\n  }\n  /**\n   * EnumTypeDefinition :\n   *   - Description? enum Name Directives[Const]? EnumValuesDefinition?\n   */\n\n  parseEnumTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('enum');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const values = this.parseEnumValuesDefinition();\n    return this.node(start, {\n      kind: Kind.ENUM_TYPE_DEFINITION,\n      description,\n      name,\n      directives,\n      values,\n    });\n  }\n  /**\n   * ```\n   * EnumValuesDefinition : { EnumValueDefinition+ }\n   * ```\n   */\n\n  parseEnumValuesDefinition() {\n    return this.optionalMany(\n      TokenKind.BRACE_L,\n      this.parseEnumValueDefinition,\n      TokenKind.BRACE_R,\n    );\n  }\n  /**\n   * EnumValueDefinition : Description? EnumValue Directives[Const]?\n   */\n\n  parseEnumValueDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    const name = this.parseEnumValueName();\n    const directives = this.parseConstDirectives();\n    return this.node(start, {\n      kind: Kind.ENUM_VALUE_DEFINITION,\n      description,\n      name,\n      directives,\n    });\n  }\n  /**\n   * EnumValue : Name but not `true`, `false` or `null`\n   */\n\n  parseEnumValueName() {\n    if (\n      this._lexer.token.value === 'true' ||\n      this._lexer.token.value === 'false' ||\n      this._lexer.token.value === 'null'\n    ) {\n      throw syntaxError(\n        this._lexer.source,\n        this._lexer.token.start,\n        `${getTokenDesc(\n          this._lexer.token,\n        )} is reserved and cannot be used for an enum value.`,\n      );\n    }\n\n    return this.parseName();\n  }\n  /**\n   * InputObjectTypeDefinition :\n   *   - Description? input Name Directives[Const]? InputFieldsDefinition?\n   */\n\n  parseInputObjectTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('input');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseInputFieldsDefinition();\n    return this.node(start, {\n      kind: Kind.INPUT_OBJECT_TYPE_DEFINITION,\n      description,\n      name,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * ```\n   * InputFieldsDefinition : { InputValueDefinition+ }\n   * ```\n   */\n\n  parseInputFieldsDefinition() {\n    return this.optionalMany(\n      TokenKind.BRACE_L,\n      this.parseInputValueDef,\n      TokenKind.BRACE_R,\n    );\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  parseTypeSystemExtension() {\n    const 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   * ```\n   * SchemaExtension :\n   *  - extend schema Directives[Const]? { OperationTypeDefinition+ }\n   *  - extend schema Directives[Const]\n   * ```\n   */\n\n  parseSchemaExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('schema');\n    const directives = this.parseConstDirectives();\n    const operationTypes = this.optionalMany(\n      TokenKind.BRACE_L,\n      this.parseOperationTypeDefinition,\n      TokenKind.BRACE_R,\n    );\n\n    if (directives.length === 0 && operationTypes.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.SCHEMA_EXTENSION,\n      directives,\n      operationTypes,\n    });\n  }\n  /**\n   * ScalarTypeExtension :\n   *   - extend scalar Name Directives[Const]\n   */\n\n  parseScalarTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('scalar');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n\n    if (directives.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.SCALAR_TYPE_EXTENSION,\n      name,\n      directives,\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  parseObjectTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('type');\n    const name = this.parseName();\n    const interfaces = this.parseImplementsInterfaces();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseFieldsDefinition();\n\n    if (\n      interfaces.length === 0 &&\n      directives.length === 0 &&\n      fields.length === 0\n    ) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.OBJECT_TYPE_EXTENSION,\n      name,\n      interfaces,\n      directives,\n      fields,\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  parseInterfaceTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('interface');\n    const name = this.parseName();\n    const interfaces = this.parseImplementsInterfaces();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseFieldsDefinition();\n\n    if (\n      interfaces.length === 0 &&\n      directives.length === 0 &&\n      fields.length === 0\n    ) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.INTERFACE_TYPE_EXTENSION,\n      name,\n      interfaces,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * UnionTypeExtension :\n   *   - extend union Name Directives[Const]? UnionMemberTypes\n   *   - extend union Name Directives[Const]\n   */\n\n  parseUnionTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('union');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const types = this.parseUnionMemberTypes();\n\n    if (directives.length === 0 && types.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.UNION_TYPE_EXTENSION,\n      name,\n      directives,\n      types,\n    });\n  }\n  /**\n   * EnumTypeExtension :\n   *   - extend enum Name Directives[Const]? EnumValuesDefinition\n   *   - extend enum Name Directives[Const]\n   */\n\n  parseEnumTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('enum');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const values = this.parseEnumValuesDefinition();\n\n    if (directives.length === 0 && values.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.ENUM_TYPE_EXTENSION,\n      name,\n      directives,\n      values,\n    });\n  }\n  /**\n   * InputObjectTypeExtension :\n   *   - extend input Name Directives[Const]? InputFieldsDefinition\n   *   - extend input Name Directives[Const]\n   */\n\n  parseInputObjectTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('input');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseInputFieldsDefinition();\n\n    if (directives.length === 0 && fields.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.INPUT_OBJECT_TYPE_EXTENSION,\n      name,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * ```\n   * DirectiveDefinition :\n   *   - Description? directive @ Name ArgumentsDefinition? `repeatable`? on DirectiveLocations\n   * ```\n   */\n\n  parseDirectiveDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('directive');\n    this.expectToken(TokenKind.AT);\n    const name = this.parseName();\n    const args = this.parseArgumentDefs();\n    const repeatable = this.expectOptionalKeyword('repeatable');\n    this.expectKeyword('on');\n    const locations = this.parseDirectiveLocations();\n    return this.node(start, {\n      kind: Kind.DIRECTIVE_DEFINITION,\n      description,\n      name,\n      arguments: args,\n      repeatable,\n      locations,\n    });\n  }\n  /**\n   * DirectiveLocations :\n   *   - `|`? DirectiveLocation\n   *   - DirectiveLocations | DirectiveLocation\n   */\n\n  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  parseDirectiveLocation() {\n    const start = this._lexer.token;\n    const name = this.parseName();\n\n    if (Object.prototype.hasOwnProperty.call(DirectiveLocation, name.value)) {\n      return name;\n    }\n\n    throw this.unexpected(start);\n  } // Core parsing utility functions\n\n  /**\n   * Returns a node that, if configured to do so, sets a \"loc\" field as a\n   * location object, used to identify the place in the source that created a\n   * given parsed object.\n   */\n\n  node(startToken, node) {\n    if (this._options.noLocation !== true) {\n      node.loc = new Location(\n        startToken,\n        this._lexer.lastToken,\n        this._lexer.source,\n      );\n    }\n\n    return node;\n  }\n  /**\n   * Determines if the next token is of a given kind\n   */\n\n  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  expectToken(kind) {\n    const token = this._lexer.token;\n\n    if (token.kind === kind) {\n      this.advanceLexer();\n      return token;\n    }\n\n    throw syntaxError(\n      this._lexer.source,\n      token.start,\n      `Expected ${getTokenKindDesc(kind)}, found ${getTokenDesc(token)}.`,\n    );\n  }\n  /**\n   * If the next token is of the given kind, return \"true\" after advancing the lexer.\n   * Otherwise, do not change the parser state and return \"false\".\n   */\n\n  expectOptionalToken(kind) {\n    const token = this._lexer.token;\n\n    if (token.kind === kind) {\n      this.advanceLexer();\n      return true;\n    }\n\n    return false;\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  expectKeyword(value) {\n    const token = this._lexer.token;\n\n    if (token.kind === TokenKind.NAME && token.value === value) {\n      this.advanceLexer();\n    } else {\n      throw syntaxError(\n        this._lexer.source,\n        token.start,\n        `Expected \"${value}\", found ${getTokenDesc(token)}.`,\n      );\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  expectOptionalKeyword(value) {\n    const token = this._lexer.token;\n\n    if (token.kind === TokenKind.NAME && token.value === value) {\n      this.advanceLexer();\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  unexpected(atToken) {\n    const token =\n      atToken !== null && atToken !== void 0 ? atToken : this._lexer.token;\n    return syntaxError(\n      this._lexer.source,\n      token.start,\n      `Unexpected ${getTokenDesc(token)}.`,\n    );\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  any(openKind, parseFn, closeKind) {\n    this.expectToken(openKind);\n    const 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  optionalMany(openKind, parseFn, closeKind) {\n    if (this.expectOptionalToken(openKind)) {\n      const 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  many(openKind, parseFn, closeKind) {\n    this.expectToken(openKind);\n    const 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  delimitedMany(delimiterKind, parseFn) {\n    this.expectOptionalToken(delimiterKind);\n    const nodes = [];\n\n    do {\n      nodes.push(parseFn.call(this));\n    } while (this.expectOptionalToken(delimiterKind));\n\n    return nodes;\n  }\n\n  advanceLexer() {\n    const { maxTokens } = this._options;\n\n    const token = this._lexer.advance();\n\n    if (maxTokens !== undefined && token.kind !== TokenKind.EOF) {\n      ++this._tokenCounter;\n\n      if (this._tokenCounter > maxTokens) {\n        throw syntaxError(\n          this._lexer.source,\n          token.start,\n          `Document contains more that ${maxTokens} tokens. Parsing aborted.`,\n        );\n      }\n    }\n  }\n}\n/**\n * A helper function to describe a token as a string for debugging.\n */\n\nfunction getTokenDesc(token) {\n  const value = token.value;\n  return getTokenKindDesc(token.kind) + (value != null ? ` \"${value}\"` : '');\n}\n/**\n * A helper function to describe a token kind as a string for debugging.\n */\n\nfunction getTokenKindDesc(kind) {\n  return isPunctuatorTokenKind(kind) ? `\"${kind}\"` : kind;\n}\n","/**\n * Prints a string as a GraphQL StringValue literal. Replaces control characters\n * and excluded characters (\" U+0022 and \\\\ U+005C) with escape sequences.\n */\nexport function printString(str) {\n  return `\"${str.replace(escapedRegExp, escapedReplacer)}\"`;\n} // eslint-disable-next-line no-control-regex\n\nconst escapedRegExp = /[\\x00-\\x1f\\x22\\x5c\\x7f-\\x9f]/g;\n\nfunction escapedReplacer(str) {\n  return escapeSequences[str.charCodeAt(0)];\n} // prettier-ignore\n\nconst escapeSequences = [\n  '\\\\u0000',\n  '\\\\u0001',\n  '\\\\u0002',\n  '\\\\u0003',\n  '\\\\u0004',\n  '\\\\u0005',\n  '\\\\u0006',\n  '\\\\u0007',\n  '\\\\b',\n  '\\\\t',\n  '\\\\n',\n  '\\\\u000B',\n  '\\\\f',\n  '\\\\r',\n  '\\\\u000E',\n  '\\\\u000F',\n  '\\\\u0010',\n  '\\\\u0011',\n  '\\\\u0012',\n  '\\\\u0013',\n  '\\\\u0014',\n  '\\\\u0015',\n  '\\\\u0016',\n  '\\\\u0017',\n  '\\\\u0018',\n  '\\\\u0019',\n  '\\\\u001A',\n  '\\\\u001B',\n  '\\\\u001C',\n  '\\\\u001D',\n  '\\\\u001E',\n  '\\\\u001F',\n  '',\n  '',\n  '\\\\\"',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 2F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 3F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 4F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '\\\\\\\\',\n  '',\n  '',\n  '', // 5F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 6F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '\\\\u007F',\n  '\\\\u0080',\n  '\\\\u0081',\n  '\\\\u0082',\n  '\\\\u0083',\n  '\\\\u0084',\n  '\\\\u0085',\n  '\\\\u0086',\n  '\\\\u0087',\n  '\\\\u0088',\n  '\\\\u0089',\n  '\\\\u008A',\n  '\\\\u008B',\n  '\\\\u008C',\n  '\\\\u008D',\n  '\\\\u008E',\n  '\\\\u008F',\n  '\\\\u0090',\n  '\\\\u0091',\n  '\\\\u0092',\n  '\\\\u0093',\n  '\\\\u0094',\n  '\\\\u0095',\n  '\\\\u0096',\n  '\\\\u0097',\n  '\\\\u0098',\n  '\\\\u0099',\n  '\\\\u009A',\n  '\\\\u009B',\n  '\\\\u009C',\n  '\\\\u009D',\n  '\\\\u009E',\n  '\\\\u009F',\n];\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { isNode, QueryDocumentKeys } from './ast.mjs';\nimport { Kind } from './kinds.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 const 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 * ```ts\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 *\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 three permutations of the\n * visitor API:\n *\n * 1) Named visitors triggered when entering a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind(node) {\n *     // enter the \"Kind\" node\n *   }\n * })\n * ```\n *\n * 2) Named visitors that trigger upon entering and leaving a node of a specific kind.\n *\n * ```ts\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 *\n * 3) Generic visitors that trigger upon entering and leaving any node.\n *\n * ```ts\n * visit(ast, {\n *   enter(node) {\n *     // enter any node\n *   },\n *   leave(node) {\n *     // leave any node\n *   }\n * })\n * ```\n */\n\nexport function visit(root, visitor, visitorKeys = QueryDocumentKeys) {\n  const enterLeaveMap = new Map();\n\n  for (const kind of Object.values(Kind)) {\n    enterLeaveMap.set(kind, getEnterLeaveForKind(visitor, kind));\n  }\n  /* eslint-disable no-undef-init */\n\n  let stack = undefined;\n  let inArray = Array.isArray(root);\n  let keys = [root];\n  let index = -1;\n  let edits = [];\n  let node = root;\n  let key = undefined;\n  let parent = undefined;\n  const path = [];\n  const ancestors = [];\n  /* eslint-enable no-undef-init */\n\n  do {\n    index++;\n    const isLeaving = index === keys.length;\n    const 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          let editOffset = 0;\n\n          for (const [editKey, editValue] of edits) {\n            const arrayKey = editKey - editOffset;\n\n            if (editValue === null) {\n              node.splice(arrayKey, 1);\n              editOffset++;\n            } else {\n              node[arrayKey] = editValue;\n            }\n          }\n        } else {\n          node = Object.defineProperties(\n            {},\n            Object.getOwnPropertyDescriptors(node),\n          );\n\n          for (const [editKey, editValue] of edits) {\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 if (parent) {\n      key = inArray ? index : keys[index];\n      node = parent[key];\n\n      if (node === null || node === undefined) {\n        continue;\n      }\n\n      path.push(key);\n    }\n\n    let result;\n\n    if (!Array.isArray(node)) {\n      var _enterLeaveMap$get, _enterLeaveMap$get2;\n\n      isNode(node) || devAssert(false, `Invalid AST Node: ${inspect(node)}.`);\n      const visitFn = isLeaving\n        ? (_enterLeaveMap$get = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get === void 0\n          ? void 0\n          : _enterLeaveMap$get.leave\n        : (_enterLeaveMap$get2 = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get2 === void 0\n        ? void 0\n        : _enterLeaveMap$get2.enter;\n      result =\n        visitFn === null || visitFn === void 0\n          ? void 0\n          : 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    if (result === undefined && isEdited) {\n      edits.push([key, node]);\n    }\n\n    if (isLeaving) {\n      path.pop();\n    } else {\n      var _node$kind;\n\n      stack = {\n        inArray,\n        index,\n        keys,\n        edits,\n        prev: stack,\n      };\n      inArray = Array.isArray(node);\n      keys = inArray\n        ? node\n        : (_node$kind = visitorKeys[node.kind]) !== null &&\n          _node$kind !== void 0\n        ? _node$kind\n        : [];\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    // New root\n    return edits[edits.length - 1][1];\n  }\n\n  return root;\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  const skipping = new Array(visitors.length).fill(null);\n  const mergedVisitor = Object.create(null);\n\n  for (const kind of Object.values(Kind)) {\n    let hasVisitor = false;\n    const enterList = new Array(visitors.length).fill(undefined);\n    const leaveList = new Array(visitors.length).fill(undefined);\n\n    for (let i = 0; i < visitors.length; ++i) {\n      const { enter, leave } = getEnterLeaveForKind(visitors[i], kind);\n      hasVisitor || (hasVisitor = enter != null || leave != null);\n      enterList[i] = enter;\n      leaveList[i] = leave;\n    }\n\n    if (!hasVisitor) {\n      continue;\n    }\n\n    const mergedEnterLeave = {\n      enter(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _enterList$i;\n\n            const result =\n              (_enterList$i = enterList[i]) === null || _enterList$i === void 0\n                ? void 0\n                : _enterList$i.apply(visitors[i], args);\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(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _leaveList$i;\n\n            const result =\n              (_leaveList$i = leaveList[i]) === null || _leaveList$i === void 0\n                ? void 0\n                : _leaveList$i.apply(visitors[i], args);\n\n            if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined && result !== false) {\n              return result;\n            }\n          } else if (skipping[i] === node) {\n            skipping[i] = null;\n          }\n        }\n      },\n    };\n    mergedVisitor[kind] = mergedEnterLeave;\n  }\n\n  return mergedVisitor;\n}\n/**\n * Given a visitor instance and a node kind, return EnterLeaveVisitor for that kind.\n */\n\nexport function getEnterLeaveForKind(visitor, kind) {\n  const kindVisitor = visitor[kind];\n\n  if (typeof kindVisitor === 'object') {\n    // { Kind: { enter() {}, leave() {} } }\n    return kindVisitor;\n  } else if (typeof kindVisitor === 'function') {\n    // { Kind() {} }\n    return {\n      enter: kindVisitor,\n      leave: undefined,\n    };\n  } // { enter() {}, leave() {} }\n\n  return {\n    enter: visitor.enter,\n    leave: visitor.leave,\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 * @deprecated Please use `getEnterLeaveForKind` instead. Will be removed in v17\n */\n\n/* c8 ignore next 8 */\n\nexport function getVisitFn(visitor, kind, isLeaving) {\n  const { enter, leave } = getEnterLeaveForKind(visitor, kind);\n  return isLeaving ? leave : enter;\n}\n","import { printBlockString } from './blockString.mjs';\nimport { printString } from './printString.mjs';\nimport { visit } from './visitor.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, printDocASTReducer);\n}\nconst MAX_LINE_LENGTH = 80;\nconst printDocASTReducer = {\n  Name: {\n    leave: (node) => node.value,\n  },\n  Variable: {\n    leave: (node) => '$' + node.name,\n  },\n  // Document\n  Document: {\n    leave: (node) => join(node.definitions, '\\n\\n'),\n  },\n  OperationDefinition: {\n    leave(node) {\n      const varDefs = wrap('(', join(node.variableDefinitions, ', '), ')');\n      const prefix = join(\n        [\n          node.operation,\n          join([node.name, varDefs]),\n          join(node.directives, ' '),\n        ],\n        ' ',\n      ); // Anonymous queries with no directives or variable definitions can use\n      // the query short form.\n\n      return (prefix === 'query' ? '' : prefix + ' ') + node.selectionSet;\n    },\n  },\n  VariableDefinition: {\n    leave: ({ variable, type, defaultValue, directives }) =>\n      variable +\n      ': ' +\n      type +\n      wrap(' = ', defaultValue) +\n      wrap(' ', join(directives, ' ')),\n  },\n  SelectionSet: {\n    leave: ({ selections }) => block(selections),\n  },\n  Field: {\n    leave({ alias, name, arguments: args, directives, selectionSet }) {\n      const prefix = wrap('', alias, ': ') + name;\n      let 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  },\n  Argument: {\n    leave: ({ name, value }) => name + ': ' + value,\n  },\n  // Fragments\n  FragmentSpread: {\n    leave: ({ name, directives }) =>\n      '...' + name + wrap(' ', join(directives, ' ')),\n  },\n  InlineFragment: {\n    leave: ({ typeCondition, directives, selectionSet }) =>\n      join(\n        [\n          '...',\n          wrap('on ', typeCondition),\n          join(directives, ' '),\n          selectionSet,\n        ],\n        ' ',\n      ),\n  },\n  FragmentDefinition: {\n    leave: (\n      { name, typeCondition, variableDefinitions, directives, selectionSet }, // Note: fragment variable definitions are experimental and may be changed\n    ) =>\n      // or removed in the future.\n      `fragment ${name}${wrap('(', join(variableDefinitions, ', '), ')')} ` +\n      `on ${typeCondition} ${wrap('', join(directives, ' '), ' ')}` +\n      selectionSet,\n  },\n  // Value\n  IntValue: {\n    leave: ({ value }) => value,\n  },\n  FloatValue: {\n    leave: ({ value }) => value,\n  },\n  StringValue: {\n    leave: ({ value, block: isBlockString }) =>\n      isBlockString ? printBlockString(value) : printString(value),\n  },\n  BooleanValue: {\n    leave: ({ value }) => (value ? 'true' : 'false'),\n  },\n  NullValue: {\n    leave: () => 'null',\n  },\n  EnumValue: {\n    leave: ({ value }) => value,\n  },\n  ListValue: {\n    leave: ({ values }) => '[' + join(values, ', ') + ']',\n  },\n  ObjectValue: {\n    leave: ({ fields }) => '{' + join(fields, ', ') + '}',\n  },\n  ObjectField: {\n    leave: ({ name, value }) => name + ': ' + value,\n  },\n  // Directive\n  Directive: {\n    leave: ({ name, arguments: args }) =>\n      '@' + name + wrap('(', join(args, ', '), ')'),\n  },\n  // Type\n  NamedType: {\n    leave: ({ name }) => name,\n  },\n  ListType: {\n    leave: ({ type }) => '[' + type + ']',\n  },\n  NonNullType: {\n    leave: ({ type }) => type + '!',\n  },\n  // Type System Definitions\n  SchemaDefinition: {\n    leave: ({ description, directives, operationTypes }) =>\n      wrap('', description, '\\n') +\n      join(['schema', join(directives, ' '), block(operationTypes)], ' '),\n  },\n  OperationTypeDefinition: {\n    leave: ({ operation, type }) => operation + ': ' + type,\n  },\n  ScalarTypeDefinition: {\n    leave: ({ description, name, directives }) =>\n      wrap('', description, '\\n') +\n      join(['scalar', name, join(directives, ' ')], ' '),\n  },\n  ObjectTypeDefinition: {\n    leave: ({ description, name, interfaces, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(\n        [\n          'type',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  FieldDefinition: {\n    leave: ({ description, name, arguments: args, type, directives }) =>\n      wrap('', description, '\\n') +\n      name +\n      (hasMultilineItems(args)\n        ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n        : wrap('(', join(args, ', '), ')')) +\n      ': ' +\n      type +\n      wrap(' ', join(directives, ' ')),\n  },\n  InputValueDefinition: {\n    leave: ({ description, name, type, defaultValue, directives }) =>\n      wrap('', description, '\\n') +\n      join(\n        [name + ': ' + type, wrap('= ', defaultValue), join(directives, ' ')],\n        ' ',\n      ),\n  },\n  InterfaceTypeDefinition: {\n    leave: ({ description, name, interfaces, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(\n        [\n          'interface',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  UnionTypeDefinition: {\n    leave: ({ description, name, directives, types }) =>\n      wrap('', description, '\\n') +\n      join(\n        ['union', name, join(directives, ' '), wrap('= ', join(types, ' | '))],\n        ' ',\n      ),\n  },\n  EnumTypeDefinition: {\n    leave: ({ description, name, directives, values }) =>\n      wrap('', description, '\\n') +\n      join(['enum', name, join(directives, ' '), block(values)], ' '),\n  },\n  EnumValueDefinition: {\n    leave: ({ description, name, directives }) =>\n      wrap('', description, '\\n') + join([name, join(directives, ' ')], ' '),\n  },\n  InputObjectTypeDefinition: {\n    leave: ({ description, name, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(['input', name, join(directives, ' '), block(fields)], ' '),\n  },\n  DirectiveDefinition: {\n    leave: ({ description, name, arguments: args, repeatable, locations }) =>\n      wrap('', description, '\\n') +\n      'directive @' +\n      name +\n      (hasMultilineItems(args)\n        ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n        : wrap('(', join(args, ', '), ')')) +\n      (repeatable ? ' repeatable' : '') +\n      ' on ' +\n      join(locations, ' | '),\n  },\n  SchemaExtension: {\n    leave: ({ directives, operationTypes }) =>\n      join(\n        ['extend schema', join(directives, ' '), block(operationTypes)],\n        ' ',\n      ),\n  },\n  ScalarTypeExtension: {\n    leave: ({ name, directives }) =>\n      join(['extend scalar', name, join(directives, ' ')], ' '),\n  },\n  ObjectTypeExtension: {\n    leave: ({ name, interfaces, directives, fields }) =>\n      join(\n        [\n          'extend type',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  InterfaceTypeExtension: {\n    leave: ({ name, interfaces, directives, fields }) =>\n      join(\n        [\n          'extend interface',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  UnionTypeExtension: {\n    leave: ({ name, directives, types }) =>\n      join(\n        [\n          'extend union',\n          name,\n          join(directives, ' '),\n          wrap('= ', join(types, ' | ')),\n        ],\n        ' ',\n      ),\n  },\n  EnumTypeExtension: {\n    leave: ({ name, directives, values }) =>\n      join(['extend enum', name, join(directives, ' '), block(values)], ' '),\n  },\n  InputObjectTypeExtension: {\n    leave: ({ name, directives, fields }) =>\n      join(['extend input', name, join(directives, ' '), block(fields)], ' '),\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\nfunction join(maybeArray, separator = '') {\n  var _maybeArray$filter$jo;\n\n  return (_maybeArray$filter$jo =\n    maybeArray === null || maybeArray === void 0\n      ? void 0\n      : maybeArray.filter((x) => x).join(separator)) !== null &&\n    _maybeArray$filter$jo !== void 0\n    ? _maybeArray$filter$jo\n    : '';\n}\n/**\n * Given array, print each item on its own line, wrapped in an indented `{ }` block.\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\nfunction wrap(start, maybeString, end = '') {\n  return maybeString != null && maybeString !== ''\n    ? start + maybeString + end\n    : '';\n}\n\nfunction indent(str) {\n  return wrap('  ', str.replace(/\\n/g, '\\n  '));\n}\n\nfunction hasMultilineItems(maybeArray) {\n  var _maybeArray$some;\n\n  // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n  /* c8 ignore next */\n  return (_maybeArray$some =\n    maybeArray === null || maybeArray === void 0\n      ? void 0\n      : maybeArray.some((str) => str.includes('\\n'))) !== null &&\n    _maybeArray$some !== void 0\n    ? _maybeArray$some\n    : false;\n}\n","import { invariant } from \"../globals/index.js\";\nimport { visit, BREAK } from \"graphql\";\nexport function shouldInclude(_a, variables) {\n    var directives = _a.directives;\n    if (!directives || !directives.length) {\n        return true;\n    }\n    return getInclusionDirectives(directives).every(function (_a) {\n        var directive = _a.directive, ifArgument = _a.ifArgument;\n        var evaledValue = false;\n        if (ifArgument.value.kind === \"Variable\") {\n            evaledValue =\n                variables && variables[ifArgument.value.name.value];\n            invariant(evaledValue !== void 0, 70, directive.name.value);\n        }\n        else {\n            evaledValue = ifArgument.value.value;\n        }\n        return directive.name.value === \"skip\" ? !evaledValue : evaledValue;\n    });\n}\nexport function getDirectiveNames(root) {\n    var names = [];\n    visit(root, {\n        Directive: function (node) {\n            names.push(node.name.value);\n        },\n    });\n    return names;\n}\nexport var hasAnyDirectives = function (names, root) {\n    return hasDirectives(names, root, false);\n};\nexport var hasAllDirectives = function (names, root) {\n    return hasDirectives(names, root, true);\n};\nexport function hasDirectives(names, root, all) {\n    var nameSet = new Set(names);\n    var uniqueCount = nameSet.size;\n    visit(root, {\n        Directive: function (node) {\n            if (nameSet.delete(node.name.value) && (!all || !nameSet.size)) {\n                return BREAK;\n            }\n        },\n    });\n    // If we found all the names, nameSet will be empty. If we only care about\n    // finding some of them, the < condition is sufficient.\n    return all ? !nameSet.size : nameSet.size < uniqueCount;\n}\nexport function hasClientExports(document) {\n    return document && hasDirectives([\"client\", \"export\"], document, true);\n}\nfunction isInclusionDirective(_a) {\n    var value = _a.name.value;\n    return value === \"skip\" || value === \"include\";\n}\nexport function getInclusionDirectives(directives) {\n    var result = [];\n    if (directives && directives.length) {\n        directives.forEach(function (directive) {\n            if (!isInclusionDirective(directive))\n                return;\n            var directiveArguments = directive.arguments;\n            var directiveName = directive.name.value;\n            invariant(directiveArguments && directiveArguments.length === 1, 71, directiveName);\n            var ifArgument = directiveArguments[0];\n            invariant(ifArgument.name && ifArgument.name.value === \"if\", 72, directiveName);\n            var ifValue = ifArgument.value;\n            // means it has to be a variable value if this is a valid @skip or @include directive\n            invariant(ifValue &&\n                (ifValue.kind === \"Variable\" || ifValue.kind === \"BooleanValue\"), 73, directiveName);\n            result.push({ directive: directive, ifArgument: ifArgument });\n        });\n    }\n    return result;\n}\n//# sourceMappingURL=directives.js.map","// 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// If no makeData function is supplied, the looked-up data will be an empty,\n// null-prototype Object.\nconst defaultMakeData = () => Object.create(null);\n// Useful for processing arguments objects as well as arrays.\nconst { forEach, slice } = Array.prototype;\nconst { hasOwnProperty } = Object.prototype;\nexport class Trie {\n    constructor(weakness = true, makeData = defaultMakeData) {\n        this.weakness = weakness;\n        this.makeData = makeData;\n    }\n    lookup() {\n        return this.lookupArray(arguments);\n    }\n    lookupArray(array) {\n        let node = this;\n        forEach.call(array, key => node = node.getChildTrie(key));\n        return hasOwnProperty.call(node, \"data\")\n            ? node.data\n            : node.data = this.makeData(slice.call(array));\n    }\n    peek() {\n        return this.peekArray(arguments);\n    }\n    peekArray(array) {\n        let node = this;\n        for (let i = 0, len = array.length; node && i < len; ++i) {\n            const map = node.mapFor(array[i], false);\n            node = map && map.get(array[i]);\n        }\n        return node && node.data;\n    }\n    remove() {\n        return this.removeArray(arguments);\n    }\n    removeArray(array) {\n        let data;\n        if (array.length) {\n            const head = array[0];\n            const map = this.mapFor(head, false);\n            const child = map && map.get(head);\n            if (child) {\n                data = child.removeArray(slice.call(array, 1));\n                if (!child.data && !child.weak && !(child.strong && child.strong.size)) {\n                    map.delete(head);\n                }\n            }\n        }\n        else {\n            data = this.data;\n            delete this.data;\n        }\n        return data;\n    }\n    getChildTrie(key) {\n        const map = this.mapFor(key, true);\n        let child = map.get(key);\n        if (!child)\n            map.set(key, child = new Trie(this.weakness, this.makeData));\n        return child;\n    }\n    mapFor(key, create) {\n        return this.weakness && isObjRef(key)\n            ? this.weak || (create ? this.weak = new WeakMap : void 0)\n            : this.strong || (create ? this.strong = new Map : void 0);\n    }\n}\nfunction isObjRef(value) {\n    switch (typeof value) {\n        case \"object\":\n            if (value === null)\n                break;\n        // Fall through to return true...\n        case \"function\":\n            return true;\n    }\n    return false;\n}\n//# sourceMappingURL=index.js.map","import { maybe } from \"../globals/index.js\";\nvar isReactNative = maybe(function () { return navigator.product; }) == \"ReactNative\";\nexport var canUseWeakMap = typeof WeakMap === \"function\" &&\n    !(isReactNative && !global.HermesInternal);\nexport var canUseWeakSet = typeof WeakSet === \"function\";\nexport var canUseSymbol = typeof Symbol === \"function\" && typeof Symbol.for === \"function\";\nexport var canUseAsyncIteratorSymbol = canUseSymbol && Symbol.asyncIterator;\nexport var canUseDOM = typeof maybe(function () { return window.document.createElement; }) === \"function\";\nvar usingJSDOM = \n// Following advice found in this comment from @domenic (maintainer of jsdom):\n// https://github.com/jsdom/jsdom/issues/1537#issuecomment-229405327\n//\n// Since we control the version of Jest and jsdom used when running Apollo\n// Client tests, and that version is recent enought to include \" jsdom/x.y.z\"\n// at the end of the user agent string, I believe this case is all we need to\n// check. Testing for \"Node.js\" was recommended for backwards compatibility\n// with older version of jsdom, but we don't have that problem.\nmaybe(function () { return navigator.userAgent.indexOf(\"jsdom\") >= 0; }) || false;\n// Our tests should all continue to pass if we remove this !usingJSDOM\n// condition, thereby allowing useLayoutEffect when using jsdom. Unfortunately,\n// if we allow useLayoutEffect, then useSyncExternalStore generates many\n// warnings about useLayoutEffect doing nothing on the server. While these\n// warnings are harmless, this !usingJSDOM condition seems to be the best way to\n// prevent them (i.e. skipping useLayoutEffect when using jsdom).\nexport var canUseLayoutEffect = (canUseDOM || isReactNative) && !usingJSDOM;\n//# sourceMappingURL=canUse.js.map","export function isNonNullObject(obj) {\n    return obj !== null && typeof obj === \"object\";\n}\nexport function isPlainObject(obj) {\n    return (obj !== null &&\n        typeof obj === \"object\" &&\n        (Object.getPrototypeOf(obj) === Object.prototype ||\n            Object.getPrototypeOf(obj) === null));\n}\n//# sourceMappingURL=objects.js.map","import { __assign, __spreadArray } from \"tslib\";\nimport { invariant, newInvariantError } from \"../globals/index.js\";\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(document, fragmentName) {\n    var actualFragmentName = fragmentName;\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    var fragments = [];\n    document.definitions.forEach(function (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 newInvariantError(\n                74,\n                definition.operation,\n                definition.name ? \" named '\".concat(definition.name.value, \"'\") : \"\"\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    // 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(fragments.length === 1, 75, fragments.length);\n        actualFragmentName = fragments[0].name.value;\n    }\n    // Generate a query document with an operation that simply spreads the\n    // fragment inside of it.\n    var query = __assign(__assign({}, document), { definitions: __spreadArray([\n            {\n                kind: \"OperationDefinition\",\n                // OperationTypeNode is an enum\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, true) });\n    return query;\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(fragments) {\n    if (fragments === void 0) { fragments = []; }\n    var symTable = {};\n    fragments.forEach(function (fragment) {\n        symTable[fragment.name.value] = fragment;\n    });\n    return symTable;\n}\nexport function getFragmentFromSelection(selection, fragmentMap) {\n    switch (selection.kind) {\n        case \"InlineFragment\":\n            return selection;\n        case \"FragmentSpread\": {\n            var fragmentName = selection.name.value;\n            if (typeof fragmentMap === \"function\") {\n                return fragmentMap(fragmentName);\n            }\n            var fragment = fragmentMap && fragmentMap[fragmentName];\n            invariant(fragment, 76, fragmentName);\n            return fragment || null;\n        }\n        default:\n            return null;\n    }\n}\n//# sourceMappingURL=fragments.js.map","function defaultDispose() { }\nexport class StrongCache {\n    constructor(max = Infinity, dispose = defaultDispose) {\n        this.max = max;\n        this.dispose = dispose;\n        this.map = new Map();\n        this.newest = null;\n        this.oldest = null;\n    }\n    has(key) {\n        return this.map.has(key);\n    }\n    get(key) {\n        const node = this.getNode(key);\n        return node && node.value;\n    }\n    get size() {\n        return this.map.size;\n    }\n    getNode(key) {\n        const node = this.map.get(key);\n        if (node && node !== this.newest) {\n            const { older, newer } = node;\n            if (newer) {\n                newer.older = older;\n            }\n            if (older) {\n                older.newer = newer;\n            }\n            node.older = this.newest;\n            node.older.newer = node;\n            node.newer = null;\n            this.newest = node;\n            if (node === this.oldest) {\n                this.oldest = newer;\n            }\n        }\n        return node;\n    }\n    set(key, value) {\n        let node = this.getNode(key);\n        if (node) {\n            return node.value = value;\n        }\n        node = {\n            key,\n            value,\n            newer: null,\n            older: this.newest\n        };\n        if (this.newest) {\n            this.newest.newer = node;\n        }\n        this.newest = node;\n        this.oldest = this.oldest || node;\n        this.map.set(key, node);\n        return node.value;\n    }\n    clean() {\n        while (this.oldest && this.map.size > this.max) {\n            this.delete(this.oldest.key);\n        }\n    }\n    delete(key) {\n        const node = this.map.get(key);\n        if (node) {\n            if (node === this.newest) {\n                this.newest = node.older;\n            }\n            if (node === this.oldest) {\n                this.oldest = node.newer;\n            }\n            if (node.newer) {\n                node.newer.older = node.older;\n            }\n            if (node.older) {\n                node.older.newer = node.newer;\n            }\n            this.map.delete(key);\n            this.dispose(node.value, key);\n            return true;\n        }\n        return false;\n    }\n}\n//# sourceMappingURL=strong.js.map","function noop() { }\nconst defaultDispose = noop;\nconst _WeakRef = typeof WeakRef !== \"undefined\"\n    ? WeakRef\n    : function (value) {\n        return { deref: () => value };\n    };\nconst _WeakMap = typeof WeakMap !== \"undefined\" ? WeakMap : Map;\nconst _FinalizationRegistry = typeof FinalizationRegistry !== \"undefined\"\n    ? FinalizationRegistry\n    : function () {\n        return {\n            register: noop,\n            unregister: noop,\n        };\n    };\nconst finalizationBatchSize = 10024;\nexport class WeakCache {\n    constructor(max = Infinity, dispose = defaultDispose) {\n        this.max = max;\n        this.dispose = dispose;\n        this.map = new _WeakMap();\n        this.newest = null;\n        this.oldest = null;\n        this.unfinalizedNodes = new Set();\n        this.finalizationScheduled = false;\n        this.size = 0;\n        this.finalize = () => {\n            const iterator = this.unfinalizedNodes.values();\n            for (let i = 0; i < finalizationBatchSize; i++) {\n                const node = iterator.next().value;\n                if (!node)\n                    break;\n                this.unfinalizedNodes.delete(node);\n                const key = node.key;\n                delete node.key;\n                node.keyRef = new _WeakRef(key);\n                this.registry.register(key, node, node);\n            }\n            if (this.unfinalizedNodes.size > 0) {\n                queueMicrotask(this.finalize);\n            }\n            else {\n                this.finalizationScheduled = false;\n            }\n        };\n        this.registry = new _FinalizationRegistry(this.deleteNode.bind(this));\n    }\n    has(key) {\n        return this.map.has(key);\n    }\n    get(key) {\n        const node = this.getNode(key);\n        return node && node.value;\n    }\n    getNode(key) {\n        const node = this.map.get(key);\n        if (node && node !== this.newest) {\n            const { older, newer } = node;\n            if (newer) {\n                newer.older = older;\n            }\n            if (older) {\n                older.newer = newer;\n            }\n            node.older = this.newest;\n            node.older.newer = node;\n            node.newer = null;\n            this.newest = node;\n            if (node === this.oldest) {\n                this.oldest = newer;\n            }\n        }\n        return node;\n    }\n    set(key, value) {\n        let node = this.getNode(key);\n        if (node) {\n            return (node.value = value);\n        }\n        node = {\n            key,\n            value,\n            newer: null,\n            older: this.newest,\n        };\n        if (this.newest) {\n            this.newest.newer = node;\n        }\n        this.newest = node;\n        this.oldest = this.oldest || node;\n        this.scheduleFinalization(node);\n        this.map.set(key, node);\n        this.size++;\n        return node.value;\n    }\n    clean() {\n        while (this.oldest && this.size > this.max) {\n            this.deleteNode(this.oldest);\n        }\n    }\n    deleteNode(node) {\n        if (node === this.newest) {\n            this.newest = node.older;\n        }\n        if (node === this.oldest) {\n            this.oldest = node.newer;\n        }\n        if (node.newer) {\n            node.newer.older = node.older;\n        }\n        if (node.older) {\n            node.older.newer = node.newer;\n        }\n        this.size--;\n        const key = node.key || (node.keyRef && node.keyRef.deref());\n        this.dispose(node.value, key);\n        if (!node.keyRef) {\n            this.unfinalizedNodes.delete(node);\n        }\n        else {\n            this.registry.unregister(node);\n        }\n        if (key)\n            this.map.delete(key);\n    }\n    delete(key) {\n        const node = this.map.get(key);\n        if (node) {\n            this.deleteNode(node);\n            return true;\n        }\n        return false;\n    }\n    scheduleFinalization(node) {\n        this.unfinalizedNodes.add(node);\n        if (!this.finalizationScheduled) {\n            this.finalizationScheduled = true;\n            queueMicrotask(this.finalize);\n        }\n    }\n}\n//# sourceMappingURL=weak.js.map","import { WeakCache, StrongCache } from \"@wry/caches\";\nvar scheduledCleanup = new WeakSet();\nfunction schedule(cache) {\n    if (cache.size <= (cache.max || -1)) {\n        return;\n    }\n    if (!scheduledCleanup.has(cache)) {\n        scheduledCleanup.add(cache);\n        setTimeout(function () {\n            cache.clean();\n            scheduledCleanup.delete(cache);\n        }, 100);\n    }\n}\n/**\n * @internal\n * A version of WeakCache that will auto-schedule a cleanup of the cache when\n * a new item is added and the cache reached maximum size.\n * Throttled to once per 100ms.\n *\n * @privateRemarks\n * Should be used throughout the rest of the codebase instead of WeakCache,\n * with the notable exception of usage in `wrap` from `optimism` - that one\n * already handles cleanup and should remain a `WeakCache`.\n */\nexport var AutoCleanedWeakCache = function (max, dispose) {\n    /*\n    Some builds of `WeakCache` are function prototypes, some are classes.\n    This library still builds with an ES5 target, so we can't extend the\n    real classes.\n    Instead, we have to use this workaround until we switch to a newer build\n    target.\n    */\n    var cache = new WeakCache(max, dispose);\n    cache.set = function (key, value) {\n        var ret = WeakCache.prototype.set.call(this, key, value);\n        schedule(this);\n        return ret;\n    };\n    return cache;\n};\n/**\n * @internal\n * A version of StrongCache that will auto-schedule a cleanup of the cache when\n * a new item is added and the cache reached maximum size.\n * Throttled to once per 100ms.\n *\n * @privateRemarks\n * Should be used throughout the rest of the codebase instead of StrongCache,\n * with the notable exception of usage in `wrap` from `optimism` - that one\n * already handles cleanup and should remain a `StrongCache`.\n */\nexport var AutoCleanedStrongCache = function (max, dispose) {\n    /*\n    Some builds of `StrongCache` are function prototypes, some are classes.\n    This library still builds with an ES5 target, so we can't extend the\n    real classes.\n    Instead, we have to use this workaround until we switch to a newer build\n    target.\n    */\n    var cache = new StrongCache(max, dispose);\n    cache.set = function (key, value) {\n        var ret = StrongCache.prototype.set.call(this, key, value);\n        schedule(this);\n        return ret;\n    };\n    return cache;\n};\n//# sourceMappingURL=caches.js.map","import { __assign } from \"tslib\";\nimport { global } from \"../globals/index.js\";\nvar cacheSizeSymbol = Symbol.for(\"apollo.cacheSize\");\n/**\n *\n * The global cache size configuration for Apollo Client.\n *\n * @remarks\n *\n * You can directly modify this object, but any modification will\n * only have an effect on caches that are created after the modification.\n *\n * So for global caches, such as `parser`, `canonicalStringify` and `print`,\n * you might need to call `.reset` on them, which will essentially re-create them.\n *\n * Alternatively, you can set `globalThis[Symbol.for(\"apollo.cacheSize\")]` before\n * you load the Apollo Client package:\n *\n * @example\n * ```ts\n * globalThis[Symbol.for(\"apollo.cacheSize\")] = {\n *   parser: 100\n * } satisfies Partial<CacheSizes> // the `satisfies` is optional if using TypeScript\n * ```\n */\nexport var cacheSizes = __assign({}, global[cacheSizeSymbol]);\n//# sourceMappingURL=sizes.js.map","import { __assign, __spreadArray } from \"tslib\";\nimport { cacheSizes } from \"./sizes.js\";\nvar globalCaches = {};\nexport function registerGlobalCache(name, getSize) {\n    globalCaches[name] = getSize;\n}\n/**\n * For internal purposes only - please call `ApolloClient.getMemoryInternals` instead\n * @internal\n */\nexport var getApolloClientMemoryInternals = globalThis.__DEV__ !== false ?\n    _getApolloClientMemoryInternals\n    : undefined;\n/**\n * For internal purposes only - please call `ApolloClient.getMemoryInternals` instead\n * @internal\n */\nexport var getInMemoryCacheMemoryInternals = globalThis.__DEV__ !== false ?\n    _getInMemoryCacheMemoryInternals\n    : undefined;\n/**\n * For internal purposes only - please call `ApolloClient.getMemoryInternals` instead\n * @internal\n */\nexport var getApolloCacheMemoryInternals = globalThis.__DEV__ !== false ?\n    _getApolloCacheMemoryInternals\n    : undefined;\nfunction getCurrentCacheSizes() {\n    // `defaultCacheSizes` is a `const enum` that will be inlined during build, so we have to reconstruct it's shape here\n    var defaults = {\n        parser: 1000 /* defaultCacheSizes[\"parser\"] */,\n        canonicalStringify: 1000 /* defaultCacheSizes[\"canonicalStringify\"] */,\n        print: 2000 /* defaultCacheSizes[\"print\"] */,\n        \"documentTransform.cache\": 2000 /* defaultCacheSizes[\"documentTransform.cache\"] */,\n        \"queryManager.getDocumentInfo\": 2000 /* defaultCacheSizes[\"queryManager.getDocumentInfo\"] */,\n        \"PersistedQueryLink.persistedQueryHashes\": 2000 /* defaultCacheSizes[\"PersistedQueryLink.persistedQueryHashes\"] */,\n        \"fragmentRegistry.transform\": 2000 /* defaultCacheSizes[\"fragmentRegistry.transform\"] */,\n        \"fragmentRegistry.lookup\": 1000 /* defaultCacheSizes[\"fragmentRegistry.lookup\"] */,\n        \"fragmentRegistry.findFragmentSpreads\": 4000 /* defaultCacheSizes[\"fragmentRegistry.findFragmentSpreads\"] */,\n        \"cache.fragmentQueryDocuments\": 1000 /* defaultCacheSizes[\"cache.fragmentQueryDocuments\"] */,\n        \"removeTypenameFromVariables.getVariableDefinitions\": 2000 /* defaultCacheSizes[\"removeTypenameFromVariables.getVariableDefinitions\"] */,\n        \"inMemoryCache.maybeBroadcastWatch\": 5000 /* defaultCacheSizes[\"inMemoryCache.maybeBroadcastWatch\"] */,\n        \"inMemoryCache.executeSelectionSet\": 50000 /* defaultCacheSizes[\"inMemoryCache.executeSelectionSet\"] */,\n        \"inMemoryCache.executeSubSelectedArray\": 10000 /* defaultCacheSizes[\"inMemoryCache.executeSubSelectedArray\"] */,\n    };\n    return Object.fromEntries(Object.entries(defaults).map(function (_a) {\n        var k = _a[0], v = _a[1];\n        return [\n            k,\n            cacheSizes[k] || v,\n        ];\n    }));\n}\nfunction _getApolloClientMemoryInternals() {\n    var _a, _b, _c, _d, _e;\n    if (!(globalThis.__DEV__ !== false))\n        throw new Error(\"only supported in development mode\");\n    return {\n        limits: getCurrentCacheSizes(),\n        sizes: __assign({ print: (_a = globalCaches.print) === null || _a === void 0 ? void 0 : _a.call(globalCaches), parser: (_b = globalCaches.parser) === null || _b === void 0 ? void 0 : _b.call(globalCaches), canonicalStringify: (_c = globalCaches.canonicalStringify) === null || _c === void 0 ? void 0 : _c.call(globalCaches), links: linkInfo(this.link), queryManager: {\n                getDocumentInfo: this[\"queryManager\"][\"transformCache\"].size,\n                documentTransforms: transformInfo(this[\"queryManager\"].documentTransform),\n            } }, (_e = (_d = this.cache).getMemoryInternals) === null || _e === void 0 ? void 0 : _e.call(_d)),\n    };\n}\nfunction _getApolloCacheMemoryInternals() {\n    return {\n        cache: {\n            fragmentQueryDocuments: getWrapperInformation(this[\"getFragmentDoc\"]),\n        },\n    };\n}\nfunction _getInMemoryCacheMemoryInternals() {\n    var fragments = this.config.fragments;\n    return __assign(__assign({}, _getApolloCacheMemoryInternals.apply(this)), { addTypenameDocumentTransform: transformInfo(this[\"addTypenameTransform\"]), inMemoryCache: {\n            executeSelectionSet: getWrapperInformation(this[\"storeReader\"][\"executeSelectionSet\"]),\n            executeSubSelectedArray: getWrapperInformation(this[\"storeReader\"][\"executeSubSelectedArray\"]),\n            maybeBroadcastWatch: getWrapperInformation(this[\"maybeBroadcastWatch\"]),\n        }, fragmentRegistry: {\n            findFragmentSpreads: getWrapperInformation(fragments === null || fragments === void 0 ? void 0 : fragments.findFragmentSpreads),\n            lookup: getWrapperInformation(fragments === null || fragments === void 0 ? void 0 : fragments.lookup),\n            transform: getWrapperInformation(fragments === null || fragments === void 0 ? void 0 : fragments.transform),\n        } });\n}\nfunction isWrapper(f) {\n    return !!f && \"dirtyKey\" in f;\n}\nfunction getWrapperInformation(f) {\n    return isWrapper(f) ? f.size : undefined;\n}\nfunction isDefined(value) {\n    return value != null;\n}\nfunction transformInfo(transform) {\n    return recurseTransformInfo(transform).map(function (cache) { return ({ cache: cache }); });\n}\nfunction recurseTransformInfo(transform) {\n    return transform ?\n        __spreadArray(__spreadArray([\n            getWrapperInformation(transform === null || transform === void 0 ? void 0 : transform[\"performWork\"])\n        ], recurseTransformInfo(transform === null || transform === void 0 ? void 0 : transform[\"left\"]), true), recurseTransformInfo(transform === null || transform === void 0 ? void 0 : transform[\"right\"]), true).filter(isDefined)\n        : [];\n}\nfunction linkInfo(link) {\n    var _a;\n    return link ?\n        __spreadArray(__spreadArray([\n            (_a = link === null || link === void 0 ? void 0 : link.getMemoryInternals) === null || _a === void 0 ? void 0 : _a.call(link)\n        ], linkInfo(link === null || link === void 0 ? void 0 : link.left), true), linkInfo(link === null || link === void 0 ? void 0 : link.right), true).filter(isDefined)\n        : [];\n}\n//# sourceMappingURL=getMemoryInternals.js.map","import { AutoCleanedStrongCache, cacheSizes, } from \"../../utilities/caching/index.js\";\nimport { registerGlobalCache } from \"../caching/getMemoryInternals.js\";\n/**\n * Like JSON.stringify, but with object keys always sorted in the same order.\n *\n * To achieve performant sorting, this function uses a Map from JSON-serialized\n * arrays of keys (in any order) to sorted arrays of the same keys, with a\n * single sorted array reference shared by all permutations of the keys.\n *\n * As a drawback, this function will add a little bit more memory for every\n * object encountered that has different (more, less, a different order of) keys\n * than in the past.\n *\n * In a typical application, this extra memory usage should not play a\n * significant role, as `canonicalStringify` will be called for only a limited\n * number of object shapes, and the cache will not grow beyond a certain point.\n * But in some edge cases, this could be a problem, so we provide\n * canonicalStringify.reset() as a way of clearing the cache.\n * */\nexport var canonicalStringify = Object.assign(function canonicalStringify(value) {\n    return JSON.stringify(value, stableObjectReplacer);\n}, {\n    reset: function () {\n        // Clearing the sortingMap will reclaim all cached memory, without\n        // affecting the logical results of canonicalStringify, but potentially\n        // sacrificing performance until the cache is refilled.\n        sortingMap = new AutoCleanedStrongCache(cacheSizes.canonicalStringify || 1000 /* defaultCacheSizes.canonicalStringify */);\n    },\n});\nif (globalThis.__DEV__ !== false) {\n    registerGlobalCache(\"canonicalStringify\", function () { return sortingMap.size; });\n}\n// Values are JSON-serialized arrays of object keys (in any order), and values\n// are sorted arrays of the same keys.\nvar sortingMap;\ncanonicalStringify.reset();\n// The JSON.stringify function takes an optional second argument called a\n// replacer function. This function is called for each key-value pair in the\n// object being stringified, and its return value is used instead of the\n// original value. If the replacer function returns a new value, that value is\n// stringified as JSON instead of the original value of the property.\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify#the_replacer_parameter\nfunction stableObjectReplacer(key, value) {\n    if (value && typeof value === \"object\") {\n        var proto = Object.getPrototypeOf(value);\n        // We don't want to mess with objects that are not \"plain\" objects, which\n        // means their prototype is either Object.prototype or null. This check also\n        // prevents needlessly rearranging the indices of arrays.\n        if (proto === Object.prototype || proto === null) {\n            var keys = Object.keys(value);\n            // If keys is already sorted, let JSON.stringify serialize the original\n            // value instead of creating a new object with keys in the same order.\n            if (keys.every(everyKeyInOrder))\n                return value;\n            var unsortedKey = JSON.stringify(keys);\n            var sortedKeys = sortingMap.get(unsortedKey);\n            if (!sortedKeys) {\n                keys.sort();\n                var sortedKey = JSON.stringify(keys);\n                // Checking for sortedKey in the sortingMap allows us to share the same\n                // sorted array reference for all permutations of the same set of keys.\n                sortedKeys = sortingMap.get(sortedKey) || keys;\n                sortingMap.set(unsortedKey, sortedKeys);\n                sortingMap.set(sortedKey, sortedKeys);\n            }\n            var sortedObject_1 = Object.create(proto);\n            // Reassigning the keys in sorted order will cause JSON.stringify to\n            // serialize them in sorted order.\n            sortedKeys.forEach(function (key) {\n                sortedObject_1[key] = value[key];\n            });\n            return sortedObject_1;\n        }\n    }\n    return value;\n}\n// Since everything that happens in stableObjectReplacer benefits from being as\n// efficient as possible, we use a static function as the callback for\n// keys.every in order to test if the provided keys are already sorted without\n// allocating extra memory for a callback.\nfunction everyKeyInOrder(key, i, keys) {\n    return i === 0 || keys[i - 1] <= key;\n}\n//# sourceMappingURL=canonicalStringify.js.map","import { newInvariantError } from \"../globals/index.js\";\nimport { isNonNullObject } from \"../common/objects.js\";\nimport { getFragmentFromSelection } from \"./fragments.js\";\nimport { canonicalStringify } from \"../common/canonicalStringify.js\";\nexport function makeReference(id) {\n    return { __ref: String(id) };\n}\nexport function isReference(obj) {\n    return Boolean(obj && typeof obj === \"object\" && typeof obj.__ref === \"string\");\n}\nexport function isDocumentNode(value) {\n    return (isNonNullObject(value) &&\n        value.kind === \"Document\" &&\n        Array.isArray(value.definitions));\n}\nfunction isStringValue(value) {\n    return value.kind === \"StringValue\";\n}\nfunction isBooleanValue(value) {\n    return value.kind === \"BooleanValue\";\n}\nfunction isIntValue(value) {\n    return value.kind === \"IntValue\";\n}\nfunction isFloatValue(value) {\n    return value.kind === \"FloatValue\";\n}\nfunction isVariable(value) {\n    return value.kind === \"Variable\";\n}\nfunction isObjectValue(value) {\n    return value.kind === \"ObjectValue\";\n}\nfunction isListValue(value) {\n    return value.kind === \"ListValue\";\n}\nfunction isEnumValue(value) {\n    return value.kind === \"EnumValue\";\n}\nfunction isNullValue(value) {\n    return value.kind === \"NullValue\";\n}\nexport function valueToObjectRepresentation(argObj, name, value, variables) {\n    if (isIntValue(value) || isFloatValue(value)) {\n        argObj[name.value] = Number(value.value);\n    }\n    else if (isBooleanValue(value) || isStringValue(value)) {\n        argObj[name.value] = value.value;\n    }\n    else if (isObjectValue(value)) {\n        var nestedArgObj_1 = {};\n        value.fields.map(function (obj) {\n            return valueToObjectRepresentation(nestedArgObj_1, obj.name, obj.value, variables);\n        });\n        argObj[name.value] = nestedArgObj_1;\n    }\n    else if (isVariable(value)) {\n        var variableValue = (variables || {})[value.name.value];\n        argObj[name.value] = variableValue;\n    }\n    else if (isListValue(value)) {\n        argObj[name.value] = value.values.map(function (listValue) {\n            var nestedArgArrayObj = {};\n            valueToObjectRepresentation(nestedArgArrayObj, name, listValue, variables);\n            return nestedArgArrayObj[name.value];\n        });\n    }\n    else if (isEnumValue(value)) {\n        argObj[name.value] = value.value;\n    }\n    else if (isNullValue(value)) {\n        argObj[name.value] = null;\n    }\n    else {\n        throw newInvariantError(85, name.value, value.kind);\n    }\n}\nexport function storeKeyNameFromField(field, variables) {\n    var directivesObj = null;\n    if (field.directives) {\n        directivesObj = {};\n        field.directives.forEach(function (directive) {\n            directivesObj[directive.name.value] = {};\n            if (directive.arguments) {\n                directive.arguments.forEach(function (_a) {\n                    var name = _a.name, value = _a.value;\n                    return valueToObjectRepresentation(directivesObj[directive.name.value], name, value, variables);\n                });\n            }\n        });\n    }\n    var argObj = null;\n    if (field.arguments && field.arguments.length) {\n        argObj = {};\n        field.arguments.forEach(function (_a) {\n            var name = _a.name, value = _a.value;\n            return valueToObjectRepresentation(argObj, name, value, variables);\n        });\n    }\n    return getStoreKeyName(field.name.value, argObj, directivesObj);\n}\nvar KNOWN_DIRECTIVES = [\n    \"connection\",\n    \"include\",\n    \"skip\",\n    \"client\",\n    \"rest\",\n    \"export\",\n    \"nonreactive\",\n];\n// Default stable JSON.stringify implementation used by getStoreKeyName. Can be\n// updated/replaced with something better by calling\n// getStoreKeyName.setStringify(newStringifyFunction).\nvar storeKeyNameStringify = canonicalStringify;\nexport var getStoreKeyName = Object.assign(function (fieldName, args, directives) {\n    if (args &&\n        directives &&\n        directives[\"connection\"] &&\n        directives[\"connection\"][\"key\"]) {\n        if (directives[\"connection\"][\"filter\"] &&\n            directives[\"connection\"][\"filter\"].length > 0) {\n            var filterKeys = directives[\"connection\"][\"filter\"] ?\n                directives[\"connection\"][\"filter\"]\n                : [];\n            filterKeys.sort();\n            var filteredArgs_1 = {};\n            filterKeys.forEach(function (key) {\n                filteredArgs_1[key] = args[key];\n            });\n            return \"\".concat(directives[\"connection\"][\"key\"], \"(\").concat(storeKeyNameStringify(filteredArgs_1), \")\");\n        }\n        else {\n            return directives[\"connection\"][\"key\"];\n        }\n    }\n    var completeFieldName = fieldName;\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        var stringifiedArgs = storeKeyNameStringify(args);\n        completeFieldName += \"(\".concat(stringifiedArgs, \")\");\n    }\n    if (directives) {\n        Object.keys(directives).forEach(function (key) {\n            if (KNOWN_DIRECTIVES.indexOf(key) !== -1)\n                return;\n            if (directives[key] && Object.keys(directives[key]).length) {\n                completeFieldName += \"@\".concat(key, \"(\").concat(storeKeyNameStringify(directives[key]), \")\");\n            }\n            else {\n                completeFieldName += \"@\".concat(key);\n            }\n        });\n    }\n    return completeFieldName;\n}, {\n    setStringify: function (s) {\n        var previous = storeKeyNameStringify;\n        storeKeyNameStringify = s;\n        return previous;\n    },\n});\nexport function argumentsObjectFromField(field, variables) {\n    if (field.arguments && field.arguments.length) {\n        var argObj_1 = {};\n        field.arguments.forEach(function (_a) {\n            var name = _a.name, value = _a.value;\n            return valueToObjectRepresentation(argObj_1, name, value, variables);\n        });\n        return argObj_1;\n    }\n    return null;\n}\nexport function resultKeyNameFromField(field) {\n    return field.alias ? field.alias.value : field.name.value;\n}\nexport function getTypenameFromResult(result, selectionSet, fragmentMap) {\n    var fragments;\n    for (var _i = 0, _a = selectionSet.selections; _i < _a.length; _i++) {\n        var selection = _a[_i];\n        if (isField(selection)) {\n            if (selection.name.value === \"__typename\") {\n                return result[resultKeyNameFromField(selection)];\n            }\n        }\n        else if (fragments) {\n            fragments.push(selection);\n        }\n        else {\n            fragments = [selection];\n        }\n    }\n    if (typeof result.__typename === \"string\") {\n        return result.__typename;\n    }\n    if (fragments) {\n        for (var _b = 0, fragments_1 = fragments; _b < fragments_1.length; _b++) {\n            var selection = fragments_1[_b];\n            var typename = getTypenameFromResult(result, getFragmentFromSelection(selection, fragmentMap).selectionSet, fragmentMap);\n            if (typeof typename === \"string\") {\n                return typename;\n            }\n        }\n    }\n}\nexport function isField(selection) {\n    return selection.kind === \"Field\";\n}\nexport function isInlineFragment(selection) {\n    return selection.kind === \"InlineFragment\";\n}\n//# sourceMappingURL=storeUtils.js.map","import { invariant, newInvariantError } from \"../globals/index.js\";\nimport { valueToObjectRepresentation } from \"./storeUtils.js\";\n// Checks the document for errors and throws an exception if there is an error.\nexport function checkDocument(doc) {\n    invariant(doc && doc.kind === \"Document\", 77);\n    var operations = doc.definitions\n        .filter(function (d) { return d.kind !== \"FragmentDefinition\"; })\n        .map(function (definition) {\n        if (definition.kind !== \"OperationDefinition\") {\n            throw newInvariantError(78, definition.kind);\n        }\n        return definition;\n    });\n    invariant(operations.length <= 1, 79, operations.length);\n    return doc;\n}\nexport function getOperationDefinition(doc) {\n    checkDocument(doc);\n    return doc.definitions.filter(function (definition) {\n        return definition.kind === \"OperationDefinition\";\n    })[0];\n}\nexport function getOperationName(doc) {\n    return (doc.definitions\n        .filter(function (definition) {\n        return definition.kind === \"OperationDefinition\" && !!definition.name;\n    })\n        .map(function (x) { return x.name.value; })[0] || null);\n}\n// Returns the FragmentDefinitions from a particular document as an array\nexport function getFragmentDefinitions(doc) {\n    return doc.definitions.filter(function (definition) {\n        return definition.kind === \"FragmentDefinition\";\n    });\n}\nexport function getQueryDefinition(doc) {\n    var queryDef = getOperationDefinition(doc);\n    invariant(queryDef && queryDef.operation === \"query\", 80);\n    return queryDef;\n}\nexport function getFragmentDefinition(doc) {\n    invariant(doc.kind === \"Document\", 81);\n    invariant(doc.definitions.length <= 1, 82);\n    var fragmentDef = doc.definitions[0];\n    invariant(fragmentDef.kind === \"FragmentDefinition\", 83);\n    return fragmentDef;\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(queryDoc) {\n    checkDocument(queryDoc);\n    var fragmentDefinition;\n    for (var _i = 0, _a = queryDoc.definitions; _i < _a.length; _i++) {\n        var definition = _a[_i];\n        if (definition.kind === \"OperationDefinition\") {\n            var operation = definition.operation;\n            if (operation === \"query\" ||\n                operation === \"mutation\" ||\n                operation === \"subscription\") {\n                return definition;\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;\n        }\n    }\n    if (fragmentDefinition) {\n        return fragmentDefinition;\n    }\n    throw newInvariantError(84);\n}\nexport function getDefaultValues(definition) {\n    var defaultValues = Object.create(null);\n    var defs = definition && definition.variableDefinitions;\n    if (defs && defs.length) {\n        defs.forEach(function (def) {\n            if (def.defaultValue) {\n                valueToObjectRepresentation(defaultValues, def.variable.name, def.defaultValue);\n            }\n        });\n    }\n    return defaultValues;\n}\n//# sourceMappingURL=getFromAST.js.map","// 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// If no makeData function is supplied, the looked-up data will be an empty,\n// null-prototype Object.\nconst defaultMakeData = () => Object.create(null);\n// Useful for processing arguments objects as well as arrays.\nconst { forEach, slice } = Array.prototype;\nconst { hasOwnProperty } = Object.prototype;\nexport class Trie {\n    constructor(weakness = true, makeData = defaultMakeData) {\n        this.weakness = weakness;\n        this.makeData = makeData;\n    }\n    lookup(...array) {\n        return this.lookupArray(array);\n    }\n    lookupArray(array) {\n        let node = this;\n        forEach.call(array, key => node = node.getChildTrie(key));\n        return hasOwnProperty.call(node, \"data\")\n            ? node.data\n            : node.data = this.makeData(slice.call(array));\n    }\n    peek(...array) {\n        return this.peekArray(array);\n    }\n    peekArray(array) {\n        let node = this;\n        for (let i = 0, len = array.length; node && i < len; ++i) {\n            const map = this.weakness && isObjRef(array[i]) ? node.weak : node.strong;\n            node = map && map.get(array[i]);\n        }\n        return node && node.data;\n    }\n    getChildTrie(key) {\n        const map = this.weakness && isObjRef(key)\n            ? this.weak || (this.weak = new WeakMap())\n            : this.strong || (this.strong = new Map());\n        let child = map.get(key);\n        if (!child)\n            map.set(key, child = new Trie(this.weakness, this.makeData));\n        return child;\n    }\n}\nfunction isObjRef(value) {\n    switch (typeof value) {\n        case \"object\":\n            if (value === null)\n                break;\n        // Fall through to return true...\n        case \"function\":\n            return true;\n    }\n    return false;\n}\n//# sourceMappingURL=index.js.map","// 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 = null;\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 = {};\nlet idCounter = 1;\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 {\n    constructor() {\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        this.id = [\n            \"slot\",\n            idCounter++,\n            Date.now(),\n            Math.random().toString(36).slice(2),\n        ].join(\":\");\n    }\n    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)\n                    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    getValue() {\n        if (this.hasValue()) {\n            return currentContext.slots[this.id];\n        }\n    }\n    withValue(value, callback, \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, thisArg) {\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        }\n        finally {\n            currentContext = parent;\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(callback) {\n        const context = currentContext;\n        return function () {\n            const saved = currentContext;\n            try {\n                currentContext = context;\n                return callback.apply(this, arguments);\n            }\n            finally {\n                currentContext = saved;\n            }\n        };\n    }\n    // Immediately run a callback function without any captured context.\n    static noContext(callback, \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, thisArg) {\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            }\n            finally {\n                currentContext = saved;\n            }\n        }\n        else {\n            return callback.apply(thisArg, args);\n        }\n    }\n};\nfunction maybe(fn) {\n    try {\n        return fn();\n    }\n    catch (ignored) { }\n}\n// We store a single global implementation of the Slot class as a permanent\n// non-enumerable property of the globalThis object. This obfuscation does\n// nothing to prevent access to the Slot class, but at least it ensures the\n// implementation (i.e. currentContext) cannot be tampered with, and all copies\n// of the @wry/context package (hopefully just one) will share the same Slot\n// implementation. Since the first copy of the @wry/context package to be\n// imported wins, this technique imposes a steep cost for any future breaking\n// changes to the Slot class.\nconst globalKey = \"@wry/context:Slot\";\nconst host = \n// Prefer globalThis when available.\n// https://github.com/benjamn/wryware/issues/347\nmaybe(() => globalThis) ||\n    // Fall back to global, which works in Node.js and may be converted by some\n    // bundlers to the appropriate identifier (window, self, ...) depending on the\n    // bundling target. https://github.com/endojs/endo/issues/576#issuecomment-1178515224\n    maybe(() => global) ||\n    // Otherwise, use a dummy host that's local to this module. We used to fall\n    // back to using the Array constructor as a namespace, but that was flagged in\n    // https://github.com/benjamn/wryware/issues/347, and can be avoided.\n    Object.create(null);\n// Whichever globalHost we're using, make TypeScript happy about the additional\n// globalKey property.\nconst globalHost = host;\nexport const Slot = globalHost[globalKey] ||\n    // Earlier versions of this package stored the globalKey property on the Array\n    // constructor, so we check there as well, to prevent Slot class duplication.\n    Array[globalKey] ||\n    (function (Slot) {\n        try {\n            Object.defineProperty(globalHost, globalKey, {\n                value: Slot,\n                enumerable: false,\n                writable: false,\n                // When it was possible for globalHost to be the Array constructor (a\n                // legacy Slot dedup strategy), it was important for the property to be\n                // configurable:true so it could be deleted. That does not seem to be as\n                // important when globalHost is the global object, but I don't want to\n                // cause similar problems again, and configurable:true seems safest.\n                // https://github.com/endojs/endo/issues/576#issuecomment-1178274008\n                configurable: true\n            });\n        }\n        finally {\n            return Slot;\n        }\n    })(makeSlotClass());\n//# sourceMappingURL=slot.js.map","import { Slot } from \"@wry/context\";\nexport const parentEntrySlot = new Slot();\nexport function nonReactive(fn) {\n    return parentEntrySlot.withValue(void 0, fn);\n}\nexport { Slot };\nexport { bind as bindContext, noContext, setTimeout, asyncFromGen, } from \"@wry/context\";\n//# sourceMappingURL=context.js.map","export const { hasOwnProperty, } = Object.prototype;\nexport const arrayFromSet = Array.from ||\n    function (set) {\n        const array = [];\n        set.forEach(item => array.push(item));\n        return array;\n    };\nexport function maybeUnsubscribe(entryOrDep) {\n    const { unsubscribe } = entryOrDep;\n    if (typeof unsubscribe === \"function\") {\n        entryOrDep.unsubscribe = void 0;\n        unsubscribe();\n    }\n}\n//# sourceMappingURL=helpers.js.map","import { parentEntrySlot } from \"./context.js\";\nimport { maybeUnsubscribe, arrayFromSet } from \"./helpers.js\";\nconst emptySetPool = [];\nconst POOL_TARGET_SIZE = 100;\n// Since this package might be used browsers, we should avoid using the\n// Node built-in assert module.\nfunction assert(condition, optionalMessage) {\n    if (!condition) {\n        throw new Error(optionalMessage || \"assertion failure\");\n    }\n}\nfunction valueIs(a, b) {\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}\nfunction valueGet(value) {\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}\nfunction valueCopy(value) {\n    return value.slice(0);\n}\nexport class Entry {\n    constructor(fn) {\n        this.fn = fn;\n        this.parents = new Set();\n        this.childValues = new Map();\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        this.dirtyChildren = null;\n        this.dirty = true;\n        this.recomputing = false;\n        this.value = [];\n        this.deps = null;\n        ++Entry.count;\n    }\n    peek() {\n        if (this.value.length === 1 && !mightBeDirty(this)) {\n            rememberParent(this);\n            return this.value[0];\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    recompute(args) {\n        assert(!this.recomputing, \"already recomputing\");\n        rememberParent(this);\n        return mightBeDirty(this)\n            ? reallyRecompute(this, args)\n            : valueGet(this.value);\n    }\n    setDirty() {\n        if (this.dirty)\n            return;\n        this.dirty = true;\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    dispose() {\n        this.setDirty();\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        // 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    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    dependOn(dep) {\n        dep.add(this);\n        if (!this.deps) {\n            this.deps = emptySetPool.pop() || new Set();\n        }\n        this.deps.add(dep);\n    }\n    forgetDeps() {\n        if (this.deps) {\n            arrayFromSet(this.deps).forEach(dep => dep.delete(this));\n            this.deps.clear();\n            emptySetPool.push(this.deps);\n            this.deps = null;\n        }\n    }\n}\nEntry.count = 0;\nfunction rememberParent(child) {\n    const parent = parentEntrySlot.getValue();\n    if (parent) {\n        child.parents.add(parent);\n        if (!parent.childValues.has(child)) {\n            parent.childValues.set(child, []);\n        }\n        if (mightBeDirty(child)) {\n            reportDirtyChild(parent, child);\n        }\n        else {\n            reportCleanChild(parent, child);\n        }\n        return parent;\n    }\n}\nfunction reallyRecompute(entry, args) {\n    forgetChildren(entry);\n    // Set entry as the parent entry while calling recomputeNewValue(entry).\n    parentEntrySlot.withValue(entry, recomputeNewValue, [entry, args]);\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    return valueGet(entry.value);\n}\nfunction recomputeNewValue(entry, args) {\n    entry.recomputing = true;\n    const { normalizeResult } = entry;\n    let oldValueCopy;\n    if (normalizeResult && entry.value.length === 1) {\n        oldValueCopy = valueCopy(entry.value);\n    }\n    // Make entry.value an empty array, representing an unknown value.\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        // If we have a viable oldValueCopy to compare with the (successfully\n        // recomputed) new entry.value, and they are not already === identical, give\n        // normalizeResult a chance to pick/choose/reuse parts of oldValueCopy[0]\n        // and/or entry.value[0] to determine the final cached entry.value.\n        if (normalizeResult && oldValueCopy && !valueIs(oldValueCopy, entry.value)) {\n            try {\n                entry.value[0] = normalizeResult(entry.value[0], oldValueCopy[0]);\n            }\n            catch (_a) {\n                // If normalizeResult throws, just use the newer value, rather than\n                // saving the exception as entry.value[1].\n            }\n        }\n    }\n    catch (e) {\n        // If entry.fn throws, entry.value will hold that exception.\n        entry.value[1] = e;\n    }\n    // Either way, this line is always reached.\n    entry.recomputing = false;\n}\nfunction mightBeDirty(entry) {\n    return entry.dirty || !!(entry.dirtyChildren && entry.dirtyChildren.size);\n}\nfunction setClean(entry) {\n    entry.dirty = false;\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    reportClean(entry);\n}\nfunction reportDirty(child) {\n    eachParent(child, reportDirtyChild);\n}\nfunction reportClean(child) {\n    eachParent(child, reportCleanChild);\n}\nfunction eachParent(child, callback) {\n    const parentCount = child.parents.size;\n    if (parentCount) {\n        const parents = arrayFromSet(child.parents);\n        for (let i = 0; i < parentCount; ++i) {\n            callback(parents[i], child);\n        }\n    }\n}\n// Let a parent Entry know that one of its children may be dirty.\nfunction reportDirtyChild(parent, child) {\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    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    parent.dirtyChildren.add(child);\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// Let a parent Entry know that one of its children is no longer dirty.\nfunction reportCleanChild(parent, child) {\n    // Must have called rememberChild(child) before calling\n    // reportCleanChild(parent, child).\n    assert(parent.childValues.has(child));\n    assert(!mightBeDirty(child));\n    const childValue = parent.childValues.get(child);\n    if (childValue.length === 0) {\n        parent.childValues.set(child, valueCopy(child.value));\n    }\n    else if (!valueIs(childValue, child.value)) {\n        parent.setDirty();\n    }\n    removeDirtyChild(parent, child);\n    if (mightBeDirty(parent)) {\n        return;\n    }\n    reportClean(parent);\n}\nfunction removeDirtyChild(parent, child) {\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// Removes all children from this entry and returns an array of the\n// removed children.\nfunction forgetChildren(parent) {\n    if (parent.childValues.size > 0) {\n        parent.childValues.forEach((_value, child) => {\n            forgetChild(parent, child);\n        });\n    }\n    // Remove this parent Entry from any sets to which it was added by the\n    // addToSet method.\n    parent.forgetDeps();\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}\nfunction forgetChild(parent, child) {\n    child.parents.delete(parent);\n    parent.childValues.delete(child);\n    removeDirtyChild(parent, child);\n}\nfunction maybeSubscribe(entry, args) {\n    if (typeof entry.subscribe === \"function\") {\n        try {\n            maybeUnsubscribe(entry); // Prevent double subscriptions.\n            entry.unsubscribe = entry.subscribe.apply(null, args);\n        }\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    // Returning true indicates either that there was no entry.subscribe\n    // function or that it succeeded.\n    return true;\n}\n//# sourceMappingURL=entry.js.map","import { parentEntrySlot } from \"./context.js\";\nimport { hasOwnProperty, maybeUnsubscribe, arrayFromSet, } from \"./helpers.js\";\nconst EntryMethods = {\n    setDirty: true,\n    dispose: true,\n    forget: true, // Fully remove parent Entry from LRU cache and computation graph\n};\nexport function dep(options) {\n    const depsByKey = new Map();\n    const subscribe = options && options.subscribe;\n    function depend(key) {\n        const parent = parentEntrySlot.getValue();\n        if (parent) {\n            let dep = depsByKey.get(key);\n            if (!dep) {\n                depsByKey.set(key, dep = new Set);\n            }\n            parent.dependOn(dep);\n            if (typeof subscribe === \"function\") {\n                maybeUnsubscribe(dep);\n                dep.unsubscribe = subscribe(key);\n            }\n        }\n    }\n    depend.dirty = function dirty(key, entryMethodName) {\n        const dep = depsByKey.get(key);\n        if (dep) {\n            const m = (entryMethodName &&\n                hasOwnProperty.call(EntryMethods, entryMethodName)) ? entryMethodName : \"setDirty\";\n            // We have to use arrayFromSet(dep).forEach instead of dep.forEach,\n            // because modifying a Set while iterating over it can cause elements in\n            // the Set to be removed from the Set before they've been iterated over.\n            arrayFromSet(dep).forEach(entry => entry[m]());\n            depsByKey.delete(key);\n            maybeUnsubscribe(dep);\n        }\n    };\n    return depend;\n}\n//# sourceMappingURL=dep.js.map","import { Trie } from \"@wry/trie\";\nimport { StrongCache } from \"@wry/caches\";\nimport { Entry } from \"./entry.js\";\nimport { parentEntrySlot } from \"./context.js\";\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 { bindContext, noContext, nonReactive, setTimeout, asyncFromGen, Slot, } from \"./context.js\";\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 } from \"./dep.js\";\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.\nlet defaultKeyTrie;\nexport function defaultMakeCacheKey(...args) {\n    const trie = defaultKeyTrie || (defaultKeyTrie = new Trie(typeof WeakMap === \"function\"));\n    return trie.lookupArray(args);\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;\nconst caches = new Set();\nexport function wrap(originalFunction, { max = Math.pow(2, 16), keyArgs, makeCacheKey = defaultMakeCacheKey, normalizeResult, subscribe, cache: cacheOption = StrongCache, } = Object.create(null)) {\n    const cache = typeof cacheOption === \"function\"\n        ? new cacheOption(max, entry => entry.dispose())\n        : cacheOption;\n    const optimistic = function () {\n        const key = makeCacheKey.apply(null, keyArgs ? keyArgs.apply(null, arguments) : arguments);\n        if (key === void 0) {\n            return originalFunction.apply(null, arguments);\n        }\n        let entry = cache.get(key);\n        if (!entry) {\n            cache.set(key, entry = new Entry(originalFunction));\n            entry.normalizeResult = normalizeResult;\n            entry.subscribe = 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        const value = entry.recompute(Array.prototype.slice.call(arguments));\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        caches.add(cache);\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        return value;\n    };\n    Object.defineProperty(optimistic, \"size\", {\n        get: () => cache.size,\n        configurable: false,\n        enumerable: false,\n    });\n    Object.freeze(optimistic.options = {\n        max,\n        keyArgs,\n        makeCacheKey,\n        normalizeResult,\n        subscribe,\n        cache,\n    });\n    function dirtyKey(key) {\n        const entry = key && 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));\n    };\n    function peekKey(key) {\n        const entry = key && 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));\n    };\n    function forgetKey(key) {\n        return key ? cache.delete(key) : false;\n    }\n    optimistic.forgetKey = forgetKey;\n    optimistic.forget = function forget() {\n        return forgetKey(makeCacheKey.apply(null, arguments));\n    };\n    optimistic.makeCacheKey = makeCacheKey;\n    optimistic.getKey = keyArgs ? function getKey() {\n        return makeCacheKey.apply(null, keyArgs.apply(null, arguments));\n    } : makeCacheKey;\n    return Object.freeze(optimistic);\n}\n//# sourceMappingURL=index.js.map","import { Trie } from \"@wry/trie\";\nimport { canUseWeakMap, canUseWeakSet } from \"../common/canUse.js\";\nimport { checkDocument } from \"./getFromAST.js\";\nimport { invariant } from \"../globals/index.js\";\nimport { WeakCache } from \"@wry/caches\";\nimport { wrap } from \"optimism\";\nimport { cacheSizes } from \"../caching/index.js\";\nfunction identity(document) {\n    return document;\n}\nvar DocumentTransform = /** @class */ (function () {\n    function DocumentTransform(transform, options) {\n        if (options === void 0) { options = Object.create(null); }\n        this.resultCache = canUseWeakSet ? new WeakSet() : new Set();\n        this.transform = transform;\n        if (options.getCacheKey) {\n            // Override default `getCacheKey` function, which returns [document].\n            this.getCacheKey = options.getCacheKey;\n        }\n        this.cached = options.cache !== false;\n        this.resetCache();\n    }\n    // This default implementation of getCacheKey can be overridden by providing\n    // options.getCacheKey to the DocumentTransform constructor. In general, a\n    // getCacheKey function may either return an array of keys (often including\n    // the document) to be used as a cache key, or undefined to indicate the\n    // transform for this document should not be cached.\n    DocumentTransform.prototype.getCacheKey = function (document) {\n        return [document];\n    };\n    DocumentTransform.identity = function () {\n        // No need to cache this transform since it just returns the document\n        // unchanged. This should save a bit of memory that would otherwise be\n        // needed to populate the `documentCache` of this transform.\n        return new DocumentTransform(identity, { cache: false });\n    };\n    DocumentTransform.split = function (predicate, left, right) {\n        if (right === void 0) { right = DocumentTransform.identity(); }\n        return Object.assign(new DocumentTransform(function (document) {\n            var documentTransform = predicate(document) ? left : right;\n            return documentTransform.transformDocument(document);\n        }, \n        // Reasonably assume both `left` and `right` transforms handle their own caching\n        { cache: false }), { left: left, right: right });\n    };\n    /**\n     * Resets the internal cache of this transform, if it has one.\n     */\n    DocumentTransform.prototype.resetCache = function () {\n        var _this = this;\n        if (this.cached) {\n            var stableCacheKeys_1 = new Trie(canUseWeakMap);\n            this.performWork = wrap(DocumentTransform.prototype.performWork.bind(this), {\n                makeCacheKey: function (document) {\n                    var cacheKeys = _this.getCacheKey(document);\n                    if (cacheKeys) {\n                        invariant(Array.isArray(cacheKeys), 69);\n                        return stableCacheKeys_1.lookupArray(cacheKeys);\n                    }\n                },\n                max: cacheSizes[\"documentTransform.cache\"],\n                cache: (WeakCache),\n            });\n        }\n    };\n    DocumentTransform.prototype.performWork = function (document) {\n        checkDocument(document);\n        return this.transform(document);\n    };\n    DocumentTransform.prototype.transformDocument = function (document) {\n        // If a user passes an already transformed result back to this function,\n        // immediately return it.\n        if (this.resultCache.has(document)) {\n            return document;\n        }\n        var transformedDocument = this.performWork(document);\n        this.resultCache.add(transformedDocument);\n        return transformedDocument;\n    };\n    DocumentTransform.prototype.concat = function (otherTransform) {\n        var _this = this;\n        return Object.assign(new DocumentTransform(function (document) {\n            return otherTransform.transformDocument(_this.transformDocument(document));\n        }, \n        // Reasonably assume both transforms handle their own caching\n        { cache: false }), {\n            left: this,\n            right: otherTransform,\n        });\n    };\n    return DocumentTransform;\n}());\nexport { DocumentTransform };\n//# sourceMappingURL=DocumentTransform.js.map","import { print as origPrint } from \"graphql\";\nimport { AutoCleanedWeakCache, cacheSizes, } from \"../caching/index.js\";\nimport { registerGlobalCache } from \"../caching/getMemoryInternals.js\";\nvar printCache;\nexport var print = Object.assign(function (ast) {\n    var result = printCache.get(ast);\n    if (!result) {\n        result = origPrint(ast);\n        printCache.set(ast, result);\n    }\n    return result;\n}, {\n    reset: function () {\n        printCache = new AutoCleanedWeakCache(cacheSizes.print || 2000 /* defaultCacheSizes.print */);\n    },\n});\nprint.reset();\nif (globalThis.__DEV__ !== false) {\n    registerGlobalCache(\"print\", function () { return (printCache ? printCache.size : 0); });\n}\n//# sourceMappingURL=print.js.map","// A version of Array.isArray that works better with readonly arrays.\nexport var isArray = Array.isArray;\nexport function isNonEmptyArray(value) {\n    return Array.isArray(value) && value.length > 0;\n}\n//# sourceMappingURL=arrays.js.map","import { __assign, __spreadArray } from \"tslib\";\nimport { invariant } from \"../globals/index.js\";\nimport { visit, Kind } from \"graphql\";\nimport { checkDocument, getOperationDefinition, getFragmentDefinition, getFragmentDefinitions, getMainDefinition, } from \"./getFromAST.js\";\nimport { isField } from \"./storeUtils.js\";\nimport { createFragmentMap } from \"./fragments.js\";\nimport { isArray, isNonEmptyArray } from \"../common/arrays.js\";\nvar TYPENAME_FIELD = {\n    kind: Kind.FIELD,\n    name: {\n        kind: Kind.NAME,\n        value: \"__typename\",\n    },\n};\nfunction isEmpty(op, fragmentMap) {\n    return (!op ||\n        op.selectionSet.selections.every(function (selection) {\n            return selection.kind === Kind.FRAGMENT_SPREAD &&\n                isEmpty(fragmentMap[selection.name.value], fragmentMap);\n        }));\n}\nfunction nullIfDocIsEmpty(doc) {\n    return (isEmpty(getOperationDefinition(doc) || getFragmentDefinition(doc), createFragmentMap(getFragmentDefinitions(doc)))) ?\n        null\n        : doc;\n}\nfunction getDirectiveMatcher(configs) {\n    var names = new Map();\n    var tests = new Map();\n    configs.forEach(function (directive) {\n        if (directive) {\n            if (directive.name) {\n                names.set(directive.name, directive);\n            }\n            else if (directive.test) {\n                tests.set(directive.test, directive);\n            }\n        }\n    });\n    return function (directive) {\n        var config = names.get(directive.name.value);\n        if (!config && tests.size) {\n            tests.forEach(function (testConfig, test) {\n                if (test(directive)) {\n                    config = testConfig;\n                }\n            });\n        }\n        return config;\n    };\n}\nfunction makeInUseGetterFunction(defaultKey) {\n    var map = new Map();\n    return function inUseGetterFunction(key) {\n        if (key === void 0) { key = defaultKey; }\n        var inUse = map.get(key);\n        if (!inUse) {\n            map.set(key, (inUse = {\n                // Variable and fragment spread names used directly within this\n                // operation or fragment definition, as identified by key. These sets\n                // will be populated during the first traversal of the document in\n                // removeDirectivesFromDocument below.\n                variables: new Set(),\n                fragmentSpreads: new Set(),\n            }));\n        }\n        return inUse;\n    };\n}\nexport function removeDirectivesFromDocument(directives, doc) {\n    checkDocument(doc);\n    // Passing empty strings to makeInUseGetterFunction means we handle anonymous\n    // operations as if their names were \"\". Anonymous fragment definitions are\n    // not supposed to be possible, but the same default naming strategy seems\n    // appropriate for that case as well.\n    var getInUseByOperationName = makeInUseGetterFunction(\"\");\n    var getInUseByFragmentName = makeInUseGetterFunction(\"\");\n    var getInUse = function (ancestors) {\n        for (var p = 0, ancestor = void 0; p < ancestors.length && (ancestor = ancestors[p]); ++p) {\n            if (isArray(ancestor))\n                continue;\n            if (ancestor.kind === Kind.OPERATION_DEFINITION) {\n                // If an operation is anonymous, we use the empty string as its key.\n                return getInUseByOperationName(ancestor.name && ancestor.name.value);\n            }\n            if (ancestor.kind === Kind.FRAGMENT_DEFINITION) {\n                return getInUseByFragmentName(ancestor.name.value);\n            }\n        }\n        globalThis.__DEV__ !== false && invariant.error(86);\n        return null;\n    };\n    var operationCount = 0;\n    for (var i = doc.definitions.length - 1; i >= 0; --i) {\n        if (doc.definitions[i].kind === Kind.OPERATION_DEFINITION) {\n            ++operationCount;\n        }\n    }\n    var directiveMatcher = getDirectiveMatcher(directives);\n    var shouldRemoveField = function (nodeDirectives) {\n        return isNonEmptyArray(nodeDirectives) &&\n            nodeDirectives\n                .map(directiveMatcher)\n                .some(function (config) { return config && config.remove; });\n    };\n    var originalFragmentDefsByPath = new Map();\n    // Any time the first traversal of the document below makes a change like\n    // removing a fragment (by returning null), this variable should be set to\n    // true. Once it becomes true, it should never be set to false again. If this\n    // variable remains false throughout the traversal, then we can return the\n    // original doc immediately without any modifications.\n    var firstVisitMadeChanges = false;\n    var fieldOrInlineFragmentVisitor = {\n        enter: function (node) {\n            if (shouldRemoveField(node.directives)) {\n                firstVisitMadeChanges = true;\n                return null;\n            }\n        },\n    };\n    var docWithoutDirectiveSubtrees = visit(doc, {\n        // These two AST node types share the same implementation, defined above.\n        Field: fieldOrInlineFragmentVisitor,\n        InlineFragment: fieldOrInlineFragmentVisitor,\n        VariableDefinition: {\n            enter: function () {\n                // VariableDefinition nodes do not count as variables in use, though\n                // they do contain Variable nodes that might be visited below. To avoid\n                // counting variable declarations as usages, we skip visiting the\n                // contents of this VariableDefinition node by returning false.\n                return false;\n            },\n        },\n        Variable: {\n            enter: function (node, _key, _parent, _path, ancestors) {\n                var inUse = getInUse(ancestors);\n                if (inUse) {\n                    inUse.variables.add(node.name.value);\n                }\n            },\n        },\n        FragmentSpread: {\n            enter: function (node, _key, _parent, _path, ancestors) {\n                if (shouldRemoveField(node.directives)) {\n                    firstVisitMadeChanges = true;\n                    return null;\n                }\n                var inUse = getInUse(ancestors);\n                if (inUse) {\n                    inUse.fragmentSpreads.add(node.name.value);\n                }\n                // We might like to remove this FragmentSpread by returning null here if\n                // the corresponding FragmentDefinition node is also going to be removed\n                // by the logic below, but we can't control the relative order of those\n                // events, so we have to postpone the removal of dangling FragmentSpread\n                // nodes until after the current visit of the document has finished.\n            },\n        },\n        FragmentDefinition: {\n            enter: function (node, _key, _parent, path) {\n                originalFragmentDefsByPath.set(JSON.stringify(path), node);\n            },\n            leave: function (node, _key, _parent, path) {\n                var originalNode = originalFragmentDefsByPath.get(JSON.stringify(path));\n                if (node === originalNode) {\n                    // If the FragmentNode received by this leave function is identical to\n                    // the one received by the corresponding enter function (above), then\n                    // the visitor must not have made any changes within this\n                    // FragmentDefinition node. This fragment definition may still be\n                    // removed if there are no ...spread references to it, but it won't be\n                    // removed just because it has only a __typename field.\n                    return node;\n                }\n                if (\n                // This logic applies only if the document contains one or more\n                // operations, since removing all fragments from a document containing\n                // only fragments makes the document useless.\n                operationCount > 0 &&\n                    node.selectionSet.selections.every(function (selection) {\n                        return selection.kind === Kind.FIELD &&\n                            selection.name.value === \"__typename\";\n                    })) {\n                    // This is a somewhat opinionated choice: if a FragmentDefinition ends\n                    // up having no fields other than __typename, we remove the whole\n                    // fragment definition, and later prune ...spread references to it.\n                    getInUseByFragmentName(node.name.value).removed = true;\n                    firstVisitMadeChanges = true;\n                    return null;\n                }\n            },\n        },\n        Directive: {\n            leave: function (node) {\n                // If a matching directive is found, remove the directive itself. Note\n                // that this does not remove the target (field, argument, etc) of the\n                // directive, but only the directive itself.\n                if (directiveMatcher(node)) {\n                    firstVisitMadeChanges = true;\n                    return null;\n                }\n            },\n        },\n    });\n    if (!firstVisitMadeChanges) {\n        // If our first pass did not change anything about the document, then there\n        // is no cleanup we need to do, and we can return the original doc.\n        return doc;\n    }\n    // Utility for making sure inUse.transitiveVars is recursively populated.\n    // Because this logic assumes inUse.fragmentSpreads has been completely\n    // populated and inUse.removed has been set if appropriate,\n    // populateTransitiveVars must be called after that information has been\n    // collected by the first traversal of the document.\n    var populateTransitiveVars = function (inUse) {\n        if (!inUse.transitiveVars) {\n            inUse.transitiveVars = new Set(inUse.variables);\n            if (!inUse.removed) {\n                inUse.fragmentSpreads.forEach(function (childFragmentName) {\n                    populateTransitiveVars(getInUseByFragmentName(childFragmentName)).transitiveVars.forEach(function (varName) {\n                        inUse.transitiveVars.add(varName);\n                    });\n                });\n            }\n        }\n        return inUse;\n    };\n    // Since we've been keeping track of fragment spreads used by particular\n    // operations and fragment definitions, we now need to compute the set of all\n    // spreads used (transitively) by any operations in the document.\n    var allFragmentNamesUsed = new Set();\n    docWithoutDirectiveSubtrees.definitions.forEach(function (def) {\n        if (def.kind === Kind.OPERATION_DEFINITION) {\n            populateTransitiveVars(getInUseByOperationName(def.name && def.name.value)).fragmentSpreads.forEach(function (childFragmentName) {\n                allFragmentNamesUsed.add(childFragmentName);\n            });\n        }\n        else if (def.kind === Kind.FRAGMENT_DEFINITION &&\n            // If there are no operations in the document, then all fragment\n            // definitions count as usages of their own fragment names. This heuristic\n            // prevents accidentally removing all fragment definitions from the\n            // document just because it contains no operations that use the fragments.\n            operationCount === 0 &&\n            !getInUseByFragmentName(def.name.value).removed) {\n            allFragmentNamesUsed.add(def.name.value);\n        }\n    });\n    // Now that we have added all fragment spreads used by operations to the\n    // allFragmentNamesUsed set, we can complete the set by transitively adding\n    // all fragment spreads used by those fragments, and so on.\n    allFragmentNamesUsed.forEach(function (fragmentName) {\n        // Once all the childFragmentName strings added here have been seen already,\n        // the top-level allFragmentNamesUsed.forEach loop will terminate.\n        populateTransitiveVars(getInUseByFragmentName(fragmentName)).fragmentSpreads.forEach(function (childFragmentName) {\n            allFragmentNamesUsed.add(childFragmentName);\n        });\n    });\n    var fragmentWillBeRemoved = function (fragmentName) {\n        return !!(\n        // A fragment definition will be removed if there are no spreads that refer\n        // to it, or the fragment was explicitly removed because it had no fields\n        // other than __typename.\n        (!allFragmentNamesUsed.has(fragmentName) ||\n            getInUseByFragmentName(fragmentName).removed));\n    };\n    var enterVisitor = {\n        enter: function (node) {\n            if (fragmentWillBeRemoved(node.name.value)) {\n                return null;\n            }\n        },\n    };\n    return nullIfDocIsEmpty(visit(docWithoutDirectiveSubtrees, {\n        // If the fragment is going to be removed, then leaving any dangling\n        // FragmentSpread nodes with the same name would be a mistake.\n        FragmentSpread: enterVisitor,\n        // This is where the fragment definition is actually removed.\n        FragmentDefinition: enterVisitor,\n        OperationDefinition: {\n            leave: function (node) {\n                // Upon leaving each operation in the depth-first AST traversal, prune\n                // any variables that are declared by the operation but unused within.\n                if (node.variableDefinitions) {\n                    var usedVariableNames_1 = populateTransitiveVars(\n                    // If an operation is anonymous, we use the empty string as its key.\n                    getInUseByOperationName(node.name && node.name.value)).transitiveVars;\n                    // According to the GraphQL spec, all variables declared by an\n                    // operation must either be used by that operation or used by some\n                    // fragment included transitively into that operation:\n                    // https://spec.graphql.org/draft/#sec-All-Variables-Used\n                    //\n                    // To stay on the right side of this validation rule, if/when we\n                    // remove the last $var references from an operation or its fragments,\n                    // we must also remove the corresponding $var declaration from the\n                    // enclosing operation. This pruning applies only to operations and\n                    // not fragment definitions, at the moment. Fragments may be able to\n                    // declare variables eventually, but today they can only consume them.\n                    if (usedVariableNames_1.size < node.variableDefinitions.length) {\n                        return __assign(__assign({}, node), { variableDefinitions: node.variableDefinitions.filter(function (varDef) {\n                                return usedVariableNames_1.has(varDef.variable.name.value);\n                            }) });\n                    }\n                }\n            },\n        },\n    }));\n}\nexport var addTypenameToDocument = Object.assign(function (doc) {\n    return visit(doc, {\n        SelectionSet: {\n            enter: function (node, _key, parent) {\n                // Don't add __typename to OperationDefinitions.\n                if (parent &&\n                    parent.kind ===\n                        Kind.OPERATION_DEFINITION) {\n                    return;\n                }\n                // No changes if no selections.\n                var selections = node.selections;\n                if (!selections) {\n                    return;\n                }\n                // If selections already have a __typename, or are part of an\n                // introspection query, do nothing.\n                var skip = selections.some(function (selection) {\n                    return (isField(selection) &&\n                        (selection.name.value === \"__typename\" ||\n                            selection.name.value.lastIndexOf(\"__\", 0) === 0));\n                });\n                if (skip) {\n                    return;\n                }\n                // If this SelectionSet is @export-ed as an input variable, it should\n                // not have a __typename field (see issue #4691).\n                var field = parent;\n                if (isField(field) &&\n                    field.directives &&\n                    field.directives.some(function (d) { return d.name.value === \"export\"; })) {\n                    return;\n                }\n                // Create and return a new SelectionSet with a __typename Field.\n                return __assign(__assign({}, node), { selections: __spreadArray(__spreadArray([], selections, true), [TYPENAME_FIELD], false) });\n            },\n        },\n    });\n}, {\n    added: function (field) {\n        return field === TYPENAME_FIELD;\n    },\n});\nvar connectionRemoveConfig = {\n    test: function (directive) {\n        var willRemove = directive.name.value === \"connection\";\n        if (willRemove) {\n            if (!directive.arguments ||\n                !directive.arguments.some(function (arg) { return arg.name.value === \"key\"; })) {\n                globalThis.__DEV__ !== false && invariant.warn(87);\n            }\n        }\n        return willRemove;\n    },\n};\nexport function removeConnectionDirectiveFromDocument(doc) {\n    return removeDirectivesFromDocument([connectionRemoveConfig], checkDocument(doc));\n}\nfunction hasDirectivesInSelectionSet(directives, selectionSet, nestedCheck) {\n    if (nestedCheck === void 0) { nestedCheck = true; }\n    return (!!selectionSet &&\n        selectionSet.selections &&\n        selectionSet.selections.some(function (selection) {\n            return hasDirectivesInSelection(directives, selection, nestedCheck);\n        }));\n}\nfunction hasDirectivesInSelection(directives, selection, nestedCheck) {\n    if (nestedCheck === void 0) { nestedCheck = true; }\n    if (!isField(selection)) {\n        return true;\n    }\n    if (!selection.directives) {\n        return false;\n    }\n    return (selection.directives.some(getDirectiveMatcher(directives)) ||\n        (nestedCheck &&\n            hasDirectivesInSelectionSet(directives, selection.selectionSet, nestedCheck)));\n}\nfunction getArgumentMatcher(config) {\n    return function argumentMatcher(argument) {\n        return config.some(function (aConfig) {\n            return argument.value &&\n                argument.value.kind === Kind.VARIABLE &&\n                argument.value.name &&\n                (aConfig.name === argument.value.name.value ||\n                    (aConfig.test && aConfig.test(argument)));\n        });\n    };\n}\nexport function removeArgumentsFromDocument(config, doc) {\n    var argMatcher = getArgumentMatcher(config);\n    return nullIfDocIsEmpty(visit(doc, {\n        OperationDefinition: {\n            enter: function (node) {\n                return __assign(__assign({}, node), { \n                    // Remove matching top level variables definitions.\n                    variableDefinitions: node.variableDefinitions ?\n                        node.variableDefinitions.filter(function (varDef) {\n                            return !config.some(function (arg) { return arg.name === varDef.variable.name.value; });\n                        })\n                        : [] });\n            },\n        },\n        Field: {\n            enter: function (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                var shouldRemoveField = config.some(function (argConfig) { return argConfig.remove; });\n                if (shouldRemoveField) {\n                    var argMatchCount_1 = 0;\n                    if (node.arguments) {\n                        node.arguments.forEach(function (arg) {\n                            if (argMatcher(arg)) {\n                                argMatchCount_1 += 1;\n                            }\n                        });\n                    }\n                    if (argMatchCount_1 === 1) {\n                        return null;\n                    }\n                }\n            },\n        },\n        Argument: {\n            enter: function (node) {\n                // Remove all matching arguments.\n                if (argMatcher(node)) {\n                    return null;\n                }\n            },\n        },\n    }));\n}\nexport function removeFragmentSpreadFromDocument(config, doc) {\n    function enter(node) {\n        if (config.some(function (def) { return def.name === node.name.value; })) {\n            return null;\n        }\n    }\n    return nullIfDocIsEmpty(visit(doc, {\n        FragmentSpread: { enter: enter },\n        FragmentDefinition: { enter: enter },\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(document) {\n    var definition = getMainDefinition(document);\n    var definitionOperation = definition.operation;\n    if (definitionOperation === \"query\") {\n        // Already a query, so return the existing document.\n        return document;\n    }\n    // Build a new query using the selection set of the main operation.\n    var modifiedDoc = visit(document, {\n        OperationDefinition: {\n            enter: function (node) {\n                return __assign(__assign({}, node), { operation: \"query\" });\n            },\n        },\n    });\n    return modifiedDoc;\n}\n// Remove fields / selection sets that include an @client directive.\nexport function removeClientSetsFromDocument(document) {\n    checkDocument(document);\n    var modifiedDoc = removeDirectivesFromDocument([\n        {\n            test: function (directive) { return directive.name.value === \"client\"; },\n            remove: true,\n        },\n    ], document);\n    return modifiedDoc;\n}\n//# sourceMappingURL=transform.js.map","import { __assign, __spreadArray } from \"tslib\";\nimport { isNonNullObject } from \"./objects.js\";\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nexport function mergeDeep() {\n    var sources = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        sources[_i] = arguments[_i];\n    }\n    return mergeDeepArray(sources);\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(sources) {\n    var target = sources[0] || {};\n    var count = sources.length;\n    if (count > 1) {\n        var merger = new DeepMerger();\n        for (var i = 1; i < count; ++i) {\n            target = merger.merge(target, sources[i]);\n        }\n    }\n    return target;\n}\nvar defaultReconciler = function (target, source, property) {\n    return this.merge(target[property], source[property]);\n};\nvar DeepMerger = /** @class */ (function () {\n    function DeepMerger(reconciler) {\n        if (reconciler === void 0) { reconciler = defaultReconciler; }\n        this.reconciler = reconciler;\n        this.isObject = isNonNullObject;\n        this.pastCopies = new Set();\n    }\n    DeepMerger.prototype.merge = function (target, source) {\n        var _this = this;\n        var context = [];\n        for (var _i = 2; _i < arguments.length; _i++) {\n            context[_i - 2] = arguments[_i];\n        }\n        if (isNonNullObject(source) && isNonNullObject(target)) {\n            Object.keys(source).forEach(function (sourceKey) {\n                if (hasOwnProperty.call(target, sourceKey)) {\n                    var targetValue = target[sourceKey];\n                    if (source[sourceKey] !== targetValue) {\n                        var result = _this.reconciler.apply(_this, __spreadArray([target,\n                            source,\n                            sourceKey], context, false));\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                }\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            return target;\n        }\n        // If source (or target) is not an object, let source replace target.\n        return source;\n    };\n    DeepMerger.prototype.shallowCopyForMerge = function (value) {\n        if (isNonNullObject(value)) {\n            if (!this.pastCopies.has(value)) {\n                if (Array.isArray(value)) {\n                    value = value.slice(0);\n                }\n                else {\n                    value = __assign({ __proto__: Object.getPrototypeOf(value) }, value);\n                }\n                this.pastCopies.add(value);\n            }\n        }\n        return value;\n    };\n    return DeepMerger;\n}());\nexport { DeepMerger };\n//# sourceMappingURL=mergeDeep.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\n\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\n\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\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); Object.defineProperty(Constructor, \"prototype\", { writable: false }); 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 = /*#__PURE__*/function () {\n  function Subscription(observer, subscriber) {\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  var _proto = Subscription.prototype;\n\n  _proto.unsubscribe = function unsubscribe() {\n    if (this._state !== 'closed') {\n      closeSubscription(this);\n      cleanupSubscription(this);\n    }\n  };\n\n  _createClass(Subscription, [{\n    key: \"closed\",\n    get: function () {\n      return this._state === 'closed';\n    }\n  }]);\n\n  return Subscription;\n}();\n\nvar SubscriptionObserver = /*#__PURE__*/function () {\n  function SubscriptionObserver(subscription) {\n    this._subscription = subscription;\n  }\n\n  var _proto2 = SubscriptionObserver.prototype;\n\n  _proto2.next = function next(value) {\n    onNotify(this._subscription, 'next', value);\n  };\n\n  _proto2.error = function error(value) {\n    onNotify(this._subscription, 'error', value);\n  };\n\n  _proto2.complete = function complete() {\n    onNotify(this._subscription, 'complete');\n  };\n\n  _createClass(SubscriptionObserver, [{\n    key: \"closed\",\n    get: function () {\n      return this._subscription._state === 'closed';\n    }\n  }]);\n\n  return SubscriptionObserver;\n}();\n\nvar Observable = /*#__PURE__*/function () {\n  function Observable(subscriber) {\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  var _proto3 = Observable.prototype;\n\n  _proto3.subscribe = 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  _proto3.forEach = 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  _proto3.map = 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  _proto3.filter = 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  _proto3.reduce = 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  _proto3.concat = 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  _proto3.flatMap = 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  _proto3[SymbolObservable] = function () {\n    return this;\n  };\n\n  Observable.from = 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\n            for (var _iterator = _createForOfIteratorHelperLoose(method.call(x)), _step; !(_step = _iterator()).done;) {\n              var item = _step.value;\n              observer.next(item);\n              if (observer.closed) return;\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  Observable.of = 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  _createClass(Observable, null, [{\n    key: SymbolSpecies,\n    get: function () {\n      return this;\n    }\n  }]);\n\n  return Observable;\n}();\n\nif (hasSymbols()) {\n  Object.defineProperty(Observable, Symbol('extensions'), {\n    value: {\n      symbol: SymbolObservable,\n      hostReportError: hostReportError\n    },\n    configurable: true\n  });\n}\n\nexport { Observable };\n","import { Observable } from \"zen-observable-ts\";\n// This simplified polyfill attempts to follow the ECMAScript Observable\n// proposal (https://github.com/zenparsing/es-observable)\nimport \"symbol-observable\";\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.\nvar prototype = Observable.prototype;\nvar fakeObsSymbol = \"@@observable\";\nif (!prototype[fakeObsSymbol]) {\n    // @ts-expect-error\n    prototype[fakeObsSymbol] = function () {\n        return this;\n    };\n}\nexport { Observable };\n//# sourceMappingURL=Observable.js.map","var toString = Object.prototype.toString;\n/**\n * Deeply clones a value to create a new instance.\n */\nexport function cloneDeep(value) {\n    return cloneDeepHelper(value);\n}\nfunction cloneDeepHelper(val, seen) {\n    switch (toString.call(val)) {\n        case \"[object Array]\": {\n            seen = seen || new Map();\n            if (seen.has(val))\n                return seen.get(val);\n            var copy_1 = val.slice(0);\n            seen.set(val, copy_1);\n            copy_1.forEach(function (child, i) {\n                copy_1[i] = cloneDeepHelper(child, seen);\n            });\n            return copy_1;\n        }\n        case \"[object Object]\": {\n            seen = seen || new Map();\n            if (seen.has(val))\n                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            var copy_2 = Object.create(Object.getPrototypeOf(val));\n            seen.set(val, copy_2);\n            Object.keys(val).forEach(function (key) {\n                copy_2[key] = cloneDeepHelper(val[key], seen);\n            });\n            return copy_2;\n        }\n        default:\n            return val;\n    }\n}\n//# sourceMappingURL=cloneDeep.js.map","import { isNonNullObject } from \"./objects.js\";\nfunction deepFreeze(value) {\n    var workSet = new Set([value]);\n    workSet.forEach(function (obj) {\n        if (isNonNullObject(obj) && shallowFreeze(obj) === obj) {\n            Object.getOwnPropertyNames(obj).forEach(function (name) {\n                if (isNonNullObject(obj[name]))\n                    workSet.add(obj[name]);\n            });\n        }\n    });\n    return value;\n}\nfunction shallowFreeze(obj) {\n    if (globalThis.__DEV__ !== false && !Object.isFrozen(obj)) {\n        try {\n            Object.freeze(obj);\n        }\n        catch (e) {\n            // Some types like Uint8Array and Node.js's Buffer cannot be frozen, but\n            // they all throw a TypeError when you try, so we re-throw any exceptions\n            // that are not TypeErrors, since that would be unexpected.\n            if (e instanceof TypeError)\n                return null;\n            throw e;\n        }\n    }\n    return obj;\n}\nexport function maybeDeepFreeze(obj) {\n    if (globalThis.__DEV__ !== false) {\n        deepFreeze(obj);\n    }\n    return obj;\n}\n//# sourceMappingURL=maybeDeepFreeze.js.map","/**\n * Merges the provided objects shallowly and removes\n * all properties with an `undefined` value\n */\nexport function compact() {\n    var objects = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        objects[_i] = arguments[_i];\n    }\n    var result = Object.create(null);\n    objects.forEach(function (obj) {\n        if (!obj)\n            return;\n        Object.keys(obj).forEach(function (key) {\n            var value = obj[key];\n            if (value !== void 0) {\n                result[key] = value;\n            }\n        });\n    });\n    return result;\n}\n//# sourceMappingURL=compact.js.map","import { __assign } from \"tslib\";\nimport { compact } from \"./compact.js\";\nexport function mergeOptions(defaults, options) {\n    return compact(defaults, options, options.variables && {\n        variables: compact(__assign(__assign({}, (defaults && defaults.variables)), options.variables)),\n    });\n}\n//# sourceMappingURL=mergeOptions.js.map","import { __extends, __spreadArray } from \"tslib\";\nimport \"../utilities/globals/index.js\";\nimport { isNonNullObject } from \"../utilities/index.js\";\n// This Symbol allows us to pass transport-specific errors from the link chain\n// into QueryManager/client internals without risking a naming collision within\n// extensions (which implementers can use as they see fit).\nexport var PROTOCOL_ERRORS_SYMBOL = Symbol();\nexport function graphQLResultHasProtocolErrors(result) {\n    if (result.extensions) {\n        return Array.isArray(result.extensions[PROTOCOL_ERRORS_SYMBOL]);\n    }\n    return false;\n}\nexport function isApolloError(err) {\n    return err.hasOwnProperty(\"graphQLErrors\");\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.\nvar generateErrorMessage = function (err) {\n    var errors = __spreadArray(__spreadArray(__spreadArray([], err.graphQLErrors, true), err.clientErrors, true), err.protocolErrors, true);\n    if (err.networkError)\n        errors.push(err.networkError);\n    return (errors\n        // The rest of the code sometimes unsafely types non-Error objects as GraphQLErrors\n        .map(function (err) {\n        return (isNonNullObject(err) && err.message) || \"Error message not found.\";\n    })\n        .join(\"\\n\"));\n};\nvar ApolloError = /** @class */ (function (_super) {\n    __extends(ApolloError, _super);\n    // Constructs an instance of ApolloError given serialized GraphQL errors,\n    // client errors, protocol errors or network errors.\n    // Note that one of these has to be a valid\n    // value or the constructed error will be meaningless.\n    function ApolloError(_a) {\n        var graphQLErrors = _a.graphQLErrors, protocolErrors = _a.protocolErrors, clientErrors = _a.clientErrors, networkError = _a.networkError, errorMessage = _a.errorMessage, extraInfo = _a.extraInfo;\n        var _this = _super.call(this, errorMessage) || this;\n        _this.name = \"ApolloError\";\n        _this.graphQLErrors = graphQLErrors || [];\n        _this.protocolErrors = protocolErrors || [];\n        _this.clientErrors = clientErrors || [];\n        _this.networkError = networkError || null;\n        _this.message = errorMessage || generateErrorMessage(_this);\n        _this.extraInfo = extraInfo;\n        _this.cause =\n            __spreadArray(__spreadArray(__spreadArray([\n                networkError\n            ], (graphQLErrors || []), true), (protocolErrors || []), true), (clientErrors || []), true).find(function (e) { return !!e; }) || null;\n        // We're not using `Object.setPrototypeOf` here as it isn't fully\n        // supported on Android (see issue #3236).\n        _this.__proto__ = ApolloError.prototype;\n        return _this;\n    }\n    return ApolloError;\n}(Error));\nexport { ApolloError };\n//# sourceMappingURL=index.js.map","const { toString, hasOwnProperty } = Object.prototype;\nconst fnToStr = Function.prototype.toString;\nconst previousComparisons = new Map();\n/**\n * Performs a deep equality check on two JavaScript values, tolerating cycles.\n */\nexport function equal(a, b) {\n    try {\n        return check(a, b);\n    }\n    finally {\n        previousComparisons.clear();\n    }\n}\n// Allow default imports as well.\nexport default equal;\nfunction check(a, b) {\n    // If the two values are strictly equal, our job is easy.\n    if (a === b) {\n        return true;\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    // 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    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)\n                return false;\n        // Fall through to object case...\n        case '[object Object]': {\n            if (previouslyCompared(a, b))\n                return true;\n            const aKeys = definedKeys(a);\n            const bKeys = definedKeys(b);\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)\n                return false;\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            // 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            return true;\n        }\n        case '[object Error]':\n            return a.name === b.name && a.message === b.message;\n        case '[object Number]':\n            // Handle NaN, which is !== itself.\n            if (a !== a)\n                return b !== b;\n        // Fall through to shared +a === +b case...\n        case '[object Boolean]':\n        case '[object Date]':\n            return +a === +b;\n        case '[object RegExp]':\n        case '[object String]':\n            return a == `${b}`;\n        case '[object Map]':\n        case '[object Set]': {\n            if (a.size !== b.size)\n                return false;\n            if (previouslyCompared(a, b))\n                return true;\n            const aIterator = a.entries();\n            const isMap = aTag === '[object Map]';\n            while (true) {\n                const info = aIterator.next();\n                if (info.done)\n                    break;\n                // If a instanceof Set, aValue === aKey.\n                const [aKey, aValue] = info.value;\n                // So this works the same way for both Set and Map.\n                if (!b.has(aKey)) {\n                    return false;\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            return true;\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        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            // 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    // Otherwise the values are not equal.\n    return false;\n}\nfunction definedKeys(obj) {\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(key) {\n    return this[key] !== void 0;\n}\nconst nativeCodeSuffix = \"{ [native code] }\";\nfunction endsWith(full, suffix) {\n    const fromIndex = full.length - suffix.length;\n    return fromIndex >= 0 &&\n        full.indexOf(suffix, fromIndex) === fromIndex;\n}\nfunction previouslyCompared(a, b) {\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))\n            return true;\n    }\n    else {\n        previousComparisons.set(a, bSet = new Set);\n    }\n    bSet.add(b);\n    return false;\n}\n//# sourceMappingURL=index.js.map","import { __rest } from \"tslib\";\nimport equal from \"@wry/equality\";\nimport { createFragmentMap, getFragmentDefinitions, getFragmentFromSelection, getMainDefinition, isField, resultKeyNameFromField, shouldInclude, } from \"../utilities/index.js\";\n// Returns true if aResult and bResult are deeply equal according to the fields\n// selected by the given query, ignoring any fields marked as @nonreactive.\nexport function equalByQuery(query, _a, _b, variables) {\n    var aData = _a.data, aRest = __rest(_a, [\"data\"]);\n    var bData = _b.data, bRest = __rest(_b, [\"data\"]);\n    return (equal(aRest, bRest) &&\n        equalBySelectionSet(getMainDefinition(query).selectionSet, aData, bData, {\n            fragmentMap: createFragmentMap(getFragmentDefinitions(query)),\n            variables: variables,\n        }));\n}\nfunction equalBySelectionSet(selectionSet, aResult, bResult, context) {\n    if (aResult === bResult) {\n        return true;\n    }\n    var seenSelections = new Set();\n    // Returning true from this Array.prototype.every callback function skips the\n    // current field/subtree. Returning false aborts the entire traversal\n    // immediately, causing equalBySelectionSet to return false.\n    return selectionSet.selections.every(function (selection) {\n        // Avoid re-processing the same selection at the same level of recursion, in\n        // case the same field gets included via multiple indirect fragment spreads.\n        if (seenSelections.has(selection))\n            return true;\n        seenSelections.add(selection);\n        // Ignore @skip(if: true) and @include(if: false) fields.\n        if (!shouldInclude(selection, context.variables))\n            return true;\n        // If the field or (named) fragment spread has a @nonreactive directive on\n        // it, we don't care if it's different, so we pretend it's the same.\n        if (selectionHasNonreactiveDirective(selection))\n            return true;\n        if (isField(selection)) {\n            var resultKey = resultKeyNameFromField(selection);\n            var aResultChild = aResult && aResult[resultKey];\n            var bResultChild = bResult && bResult[resultKey];\n            var childSelectionSet = selection.selectionSet;\n            if (!childSelectionSet) {\n                // These are scalar values, so we can compare them with deep equal\n                // without redoing the main recursive work.\n                return equal(aResultChild, bResultChild);\n            }\n            var aChildIsArray = Array.isArray(aResultChild);\n            var bChildIsArray = Array.isArray(bResultChild);\n            if (aChildIsArray !== bChildIsArray)\n                return false;\n            if (aChildIsArray && bChildIsArray) {\n                var length_1 = aResultChild.length;\n                if (bResultChild.length !== length_1) {\n                    return false;\n                }\n                for (var i = 0; i < length_1; ++i) {\n                    if (!equalBySelectionSet(childSelectionSet, aResultChild[i], bResultChild[i], context)) {\n                        return false;\n                    }\n                }\n                return true;\n            }\n            return equalBySelectionSet(childSelectionSet, aResultChild, bResultChild, context);\n        }\n        else {\n            var fragment = getFragmentFromSelection(selection, context.fragmentMap);\n            if (fragment) {\n                // The fragment might === selection if it's an inline fragment, but\n                // could be !== if it's a named fragment ...spread.\n                if (selectionHasNonreactiveDirective(fragment))\n                    return true;\n                return equalBySelectionSet(fragment.selectionSet, \n                // Notice that we reuse the same aResult and bResult values here,\n                // since the fragment ...spread does not specify a field name, but\n                // consists of multiple fields (within the fragment's selection set)\n                // that should be applied to the current result value(s).\n                aResult, bResult, context);\n            }\n        }\n    });\n}\nfunction selectionHasNonreactiveDirective(selection) {\n    return (!!selection.directives && selection.directives.some(directiveIsNonreactive));\n}\nfunction directiveIsNonreactive(dir) {\n    return dir.name.value === \"nonreactive\";\n}\n//# sourceMappingURL=equalByQuery.js.map","import { __assign, __rest } from \"tslib\";\nimport { wrap } from \"optimism\";\nimport { Observable, cacheSizes, getFragmentQueryDocument, mergeDeepArray, } from \"../../utilities/index.js\";\nimport { WeakCache } from \"@wry/caches\";\nimport { getApolloCacheMemoryInternals } from \"../../utilities/caching/getMemoryInternals.js\";\nimport { equalByQuery } from \"../../core/equalByQuery.js\";\nvar ApolloCache = /** @class */ (function () {\n    function ApolloCache() {\n        this.assumeImmutableResults = false;\n        // Make sure we compute the same (===) fragment query document every\n        // time we receive the same fragment in readFragment.\n        this.getFragmentDoc = wrap(getFragmentQueryDocument, {\n            max: cacheSizes[\"cache.fragmentQueryDocuments\"] ||\n                1000 /* defaultCacheSizes[\"cache.fragmentQueryDocuments\"] */,\n            cache: WeakCache,\n        });\n    }\n    // Transactional API\n    // The batch method is intended to replace/subsume both performTransaction\n    // and recordOptimisticTransaction, but performTransaction came first, so we\n    // provide a default batch implementation that's just another way of calling\n    // performTransaction. Subclasses of ApolloCache (such as InMemoryCache) can\n    // override the batch method to do more interesting things with its options.\n    ApolloCache.prototype.batch = function (options) {\n        var _this = this;\n        var optimisticId = typeof options.optimistic === \"string\" ? options.optimistic\n            : options.optimistic === false ? null\n                : void 0;\n        var updateResult;\n        this.performTransaction(function () { return (updateResult = options.update(_this)); }, optimisticId);\n        return updateResult;\n    };\n    ApolloCache.prototype.recordOptimisticTransaction = function (transaction, optimisticId) {\n        this.performTransaction(transaction, optimisticId);\n    };\n    // Optional API\n    // Called once per input document, allowing the cache to make static changes\n    // to the query, such as adding __typename fields.\n    ApolloCache.prototype.transformDocument = function (document) {\n        return document;\n    };\n    // Called before each ApolloLink request, allowing the cache to make dynamic\n    // changes to the query, such as filling in missing fragment definitions.\n    ApolloCache.prototype.transformForLink = function (document) {\n        return document;\n    };\n    ApolloCache.prototype.identify = function (object) {\n        return;\n    };\n    ApolloCache.prototype.gc = function () {\n        return [];\n    };\n    ApolloCache.prototype.modify = function (options) {\n        return false;\n    };\n    // DataProxy API\n    ApolloCache.prototype.readQuery = function (options, optimistic) {\n        if (optimistic === void 0) { optimistic = !!options.optimistic; }\n        return this.read(__assign(__assign({}, options), { rootId: options.id || \"ROOT_QUERY\", optimistic: optimistic }));\n    };\n    /** {@inheritDoc @apollo/client!ApolloClient#watchFragment:member(1)} */\n    ApolloCache.prototype.watchFragment = function (options) {\n        var _this = this;\n        var fragment = options.fragment, fragmentName = options.fragmentName, from = options.from, _a = options.optimistic, optimistic = _a === void 0 ? true : _a, otherOptions = __rest(options, [\"fragment\", \"fragmentName\", \"from\", \"optimistic\"]);\n        var query = this.getFragmentDoc(fragment, fragmentName);\n        var diffOptions = __assign(__assign({}, otherOptions), { returnPartialData: true, id: \n            // While our TypeScript types do not allow for `undefined` as a valid\n            // `from`, its possible `useFragment` gives us an `undefined` since it\n            // calls` cache.identify` and provides that value to `from`. We are\n            // adding this fix here however to ensure those using plain JavaScript\n            // and using `cache.identify` themselves will avoid seeing the obscure\n            // warning.\n            typeof from === \"undefined\" || typeof from === \"string\" ?\n                from\n                : this.identify(from), query: query, optimistic: optimistic });\n        var latestDiff;\n        return new Observable(function (observer) {\n            return _this.watch(__assign(__assign({}, diffOptions), { immediate: true, callback: function (diff) {\n                    if (\n                    // Always ensure we deliver the first result\n                    latestDiff &&\n                        equalByQuery(query, { data: latestDiff === null || latestDiff === void 0 ? void 0 : latestDiff.result }, { data: diff.result })) {\n                        return;\n                    }\n                    var result = {\n                        data: diff.result,\n                        complete: !!diff.complete,\n                    };\n                    if (diff.missing) {\n                        result.missing = mergeDeepArray(diff.missing.map(function (error) { return error.missing; }));\n                    }\n                    latestDiff = diff;\n                    observer.next(result);\n                } }));\n        });\n    };\n    ApolloCache.prototype.readFragment = function (options, optimistic) {\n        if (optimistic === void 0) { optimistic = !!options.optimistic; }\n        return this.read(__assign(__assign({}, options), { query: this.getFragmentDoc(options.fragment, options.fragmentName), rootId: options.id, optimistic: optimistic }));\n    };\n    ApolloCache.prototype.writeQuery = function (_a) {\n        var id = _a.id, data = _a.data, options = __rest(_a, [\"id\", \"data\"]);\n        return this.write(Object.assign(options, {\n            dataId: id || \"ROOT_QUERY\",\n            result: data,\n        }));\n    };\n    ApolloCache.prototype.writeFragment = function (_a) {\n        var id = _a.id, data = _a.data, fragment = _a.fragment, fragmentName = _a.fragmentName, options = __rest(_a, [\"id\", \"data\", \"fragment\", \"fragmentName\"]);\n        return this.write(Object.assign(options, {\n            query: this.getFragmentDoc(fragment, fragmentName),\n            dataId: id,\n            result: data,\n        }));\n    };\n    ApolloCache.prototype.updateQuery = function (options, update) {\n        return this.batch({\n            update: function (cache) {\n                var value = cache.readQuery(options);\n                var data = update(value);\n                if (data === void 0 || data === null)\n                    return value;\n                cache.writeQuery(__assign(__assign({}, options), { data: data }));\n                return data;\n            },\n        });\n    };\n    ApolloCache.prototype.updateFragment = function (options, update) {\n        return this.batch({\n            update: function (cache) {\n                var value = cache.readFragment(options);\n                var data = update(value);\n                if (data === void 0 || data === null)\n                    return value;\n                cache.writeFragment(__assign(__assign({}, options), { data: data }));\n                return data;\n            },\n        });\n    };\n    return ApolloCache;\n}());\nexport { ApolloCache };\nif (globalThis.__DEV__ !== false) {\n    ApolloCache.prototype.getMemoryInternals = getApolloCacheMemoryInternals;\n}\n//# sourceMappingURL=cache.js.map","import { __extends } from \"tslib\";\nvar MissingFieldError = /** @class */ (function (_super) {\n    __extends(MissingFieldError, _super);\n    function MissingFieldError(message, path, query, variables) {\n        var _a;\n        // 'Error' breaks prototype chain here\n        var _this = _super.call(this, message) || this;\n        _this.message = message;\n        _this.path = path;\n        _this.query = query;\n        _this.variables = variables;\n        if (Array.isArray(_this.path)) {\n            _this.missing = _this.message;\n            for (var i = _this.path.length - 1; i >= 0; --i) {\n                _this.missing = (_a = {}, _a[_this.path[i]] = _this.missing, _a);\n            }\n        }\n        else {\n            _this.missing = _this.path;\n        }\n        // We're not using `Object.setPrototypeOf` here as it isn't fully supported\n        // on Android (see issue #3236).\n        _this.__proto__ = MissingFieldError.prototype;\n        return _this;\n    }\n    return MissingFieldError;\n}(Error));\nexport { MissingFieldError };\n//# sourceMappingURL=common.js.map","import { isReference, isField, DeepMerger, resultKeyNameFromField, shouldInclude, isNonNullObject, compact, createFragmentMap, getFragmentDefinitions, isArray, } from \"../../utilities/index.js\";\nexport var hasOwn = Object.prototype.hasOwnProperty;\nexport function isNullish(value) {\n    return value === null || value === void 0;\n}\nexport { isArray };\nexport function defaultDataIdFromObject(_a, context) {\n    var __typename = _a.__typename, id = _a.id, _id = _a._id;\n    if (typeof __typename === \"string\") {\n        if (context) {\n            context.keyObject =\n                !isNullish(id) ? { id: id }\n                    : !isNullish(_id) ? { _id: _id }\n                        : void 0;\n        }\n        // If there is no object.id, fall back to object._id.\n        if (isNullish(id) && !isNullish(_id)) {\n            id = _id;\n        }\n        if (!isNullish(id)) {\n            return \"\".concat(__typename, \":\").concat(typeof id === \"number\" || typeof id === \"string\" ?\n                id\n                : JSON.stringify(id));\n        }\n    }\n}\nvar defaultConfig = {\n    dataIdFromObject: defaultDataIdFromObject,\n    addTypename: true,\n    resultCaching: true,\n    // Thanks to the shouldCanonizeResults helper, this should be the only line\n    // you have to change to reenable canonization by default in the future.\n    canonizeResults: false,\n};\nexport function normalizeConfig(config) {\n    return compact(defaultConfig, config);\n}\nexport function shouldCanonizeResults(config) {\n    var value = config.canonizeResults;\n    return value === void 0 ? defaultConfig.canonizeResults : value;\n}\nexport function getTypenameFromStoreObject(store, objectOrReference) {\n    return isReference(objectOrReference) ?\n        store.get(objectOrReference.__ref, \"__typename\")\n        : objectOrReference && objectOrReference.__typename;\n}\nexport var TypeOrFieldNameRegExp = /^[_a-z][_0-9a-z]*/i;\nexport function fieldNameFromStoreName(storeFieldName) {\n    var match = storeFieldName.match(TypeOrFieldNameRegExp);\n    return match ? match[0] : storeFieldName;\n}\nexport function selectionSetMatchesResult(selectionSet, result, variables) {\n    if (isNonNullObject(result)) {\n        return isArray(result) ?\n            result.every(function (item) {\n                return selectionSetMatchesResult(selectionSet, item, variables);\n            })\n            : selectionSet.selections.every(function (field) {\n                if (isField(field) && shouldInclude(field, variables)) {\n                    var 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}\nexport function storeValueIsStoreObject(value) {\n    return isNonNullObject(value) && !isReference(value) && !isArray(value);\n}\nexport function makeProcessedFieldsMerger() {\n    return new DeepMerger();\n}\nexport function extractFragmentContext(document, fragments) {\n    // FragmentMap consisting only of fragments defined directly in document, not\n    // including other fragments registered in the FragmentRegistry.\n    var fragmentMap = createFragmentMap(getFragmentDefinitions(document));\n    return {\n        fragmentMap: fragmentMap,\n        lookupFragment: function (name) {\n            var def = fragmentMap[name];\n            if (!def && fragments) {\n                def = fragments.lookup(name);\n            }\n            return def || null;\n        },\n    };\n}\n//# sourceMappingURL=helpers.js.map","import { __assign, __extends, __rest } from \"tslib\";\nimport { invariant } from \"../../utilities/globals/index.js\";\nimport { dep } from \"optimism\";\nimport { equal } from \"@wry/equality\";\nimport { Trie } from \"@wry/trie\";\nimport { isReference, makeReference, DeepMerger, maybeDeepFreeze, canUseWeakMap, isNonNullObject, } from \"../../utilities/index.js\";\nimport { hasOwn, fieldNameFromStoreName } from \"./helpers.js\";\nvar DELETE = Object.create(null);\nvar delModifier = function () { return DELETE; };\nvar INVALIDATE = Object.create(null);\nvar EntityStore = /** @class */ (function () {\n    function EntityStore(policies, group) {\n        var _this = this;\n        this.policies = policies;\n        this.group = group;\n        this.data = Object.create(null);\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        this.rootIds = Object.create(null);\n        // Lazily tracks { __ref: <dataId> } strings contained by this.data[dataId].\n        this.refs = Object.create(null);\n        // Bound function that can be passed around to provide easy access to fields\n        // of Reference objects as well as ordinary objects.\n        this.getFieldValue = function (objectOrReference, storeFieldName) {\n            return maybeDeepFreeze(isReference(objectOrReference) ?\n                _this.get(objectOrReference.__ref, storeFieldName)\n                : objectOrReference && objectOrReference[storeFieldName]);\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        this.canRead = function (objOrRef) {\n            return isReference(objOrRef) ?\n                _this.has(objOrRef.__ref)\n                : typeof objOrRef === \"object\";\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        this.toReference = function (objOrIdOrRef, mergeIntoStore) {\n            if (typeof objOrIdOrRef === \"string\") {\n                return makeReference(objOrIdOrRef);\n            }\n            if (isReference(objOrIdOrRef)) {\n                return objOrIdOrRef;\n            }\n            var id = _this.policies.identify(objOrIdOrRef)[0];\n            if (id) {\n                var ref = makeReference(id);\n                if (mergeIntoStore) {\n                    _this.merge(id, objOrIdOrRef);\n                }\n                return ref;\n            }\n        };\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    EntityStore.prototype.toObject = function () {\n        return __assign({}, this.data);\n    };\n    EntityStore.prototype.has = function (dataId) {\n        return this.lookup(dataId, true) !== void 0;\n    };\n    EntityStore.prototype.get = function (dataId, fieldName) {\n        this.group.depend(dataId, fieldName);\n        if (hasOwn.call(this.data, dataId)) {\n            var 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    EntityStore.prototype.lookup = function (dataId, dependOnExistence) {\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)\n            this.group.depend(dataId, \"__exists\");\n        if (hasOwn.call(this.data, dataId)) {\n            return this.data[dataId];\n        }\n        if (this instanceof Layer) {\n            return this.parent.lookup(dataId, dependOnExistence);\n        }\n        if (this.policies.rootTypenamesById[dataId]) {\n            return Object.create(null);\n        }\n    };\n    EntityStore.prototype.merge = function (older, newer) {\n        var _this = this;\n        var dataId;\n        // Convert unexpected references to ID strings.\n        if (isReference(older))\n            older = older.__ref;\n        if (isReference(newer))\n            newer = newer.__ref;\n        var existing = typeof older === \"string\" ? this.lookup((dataId = older)) : older;\n        var incoming = typeof newer === \"string\" ? this.lookup((dataId = newer)) : newer;\n        // If newer was a string ID, but that ID was not defined in this store,\n        // then there are no fields to be merged, so we're done.\n        if (!incoming)\n            return;\n        invariant(typeof dataId === \"string\", 1);\n        var merged = 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                var fieldsToDirty_1 = Object.create(null);\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)\n                    fieldsToDirty_1.__exists = 1;\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(function (storeFieldName) {\n                    if (!existing ||\n                        existing[storeFieldName] !== merged[storeFieldName]) {\n                        // Always dirty the full storeFieldName, which may include\n                        // serialized arguments following the fieldName prefix.\n                        fieldsToDirty_1[storeFieldName] = 1;\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                        var fieldName = fieldNameFromStoreName(storeFieldName);\n                        if (fieldName !== storeFieldName &&\n                            !_this.policies.hasKeyArgs(merged.__typename, fieldName)) {\n                            fieldsToDirty_1[fieldName] = 1;\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                if (fieldsToDirty_1.__typename &&\n                    !(existing && existing.__typename) &&\n                    // Since we return default root __typename strings\n                    // automatically from store.get, we don't need to dirty the\n                    // ROOT_QUERY.__typename field if merged.__typename is equal\n                    // to the default string (usually \"Query\").\n                    this.policies.rootTypenamesById[dataId] === merged.__typename) {\n                    delete fieldsToDirty_1.__typename;\n                }\n                Object.keys(fieldsToDirty_1).forEach(function (fieldName) {\n                    return _this.group.dirty(dataId, fieldName);\n                });\n            }\n        }\n    };\n    EntityStore.prototype.modify = function (dataId, fields) {\n        var _this = this;\n        var storeObject = this.lookup(dataId);\n        if (storeObject) {\n            var changedFields_1 = Object.create(null);\n            var needToMerge_1 = false;\n            var allDeleted_1 = true;\n            var sharedDetails_1 = {\n                DELETE: DELETE,\n                INVALIDATE: INVALIDATE,\n                isReference: isReference,\n                toReference: this.toReference,\n                canRead: this.canRead,\n                readField: function (fieldNameOrOptions, from) {\n                    return _this.policies.readField(typeof fieldNameOrOptions === \"string\" ?\n                        {\n                            fieldName: fieldNameOrOptions,\n                            from: from || makeReference(dataId),\n                        }\n                        : fieldNameOrOptions, { store: _this });\n                },\n            };\n            Object.keys(storeObject).forEach(function (storeFieldName) {\n                var fieldName = fieldNameFromStoreName(storeFieldName);\n                var fieldValue = storeObject[storeFieldName];\n                if (fieldValue === void 0)\n                    return;\n                var modify = typeof fields === \"function\" ? fields : (fields[storeFieldName] || fields[fieldName]);\n                if (modify) {\n                    var newValue = modify === delModifier ? DELETE : (modify(maybeDeepFreeze(fieldValue), __assign(__assign({}, sharedDetails_1), { fieldName: fieldName, storeFieldName: storeFieldName, storage: _this.getStorage(dataId, storeFieldName) })));\n                    if (newValue === INVALIDATE) {\n                        _this.group.dirty(dataId, storeFieldName);\n                    }\n                    else {\n                        if (newValue === DELETE)\n                            newValue = void 0;\n                        if (newValue !== fieldValue) {\n                            changedFields_1[storeFieldName] = newValue;\n                            needToMerge_1 = true;\n                            fieldValue = newValue;\n                            if (globalThis.__DEV__ !== false) {\n                                var checkReference = function (ref) {\n                                    if (_this.lookup(ref.__ref) === undefined) {\n                                        globalThis.__DEV__ !== false && invariant.warn(2, ref);\n                                        return true;\n                                    }\n                                };\n                                if (isReference(newValue)) {\n                                    checkReference(newValue);\n                                }\n                                else if (Array.isArray(newValue)) {\n                                    // Warn about writing \"mixed\" arrays of Reference and non-Reference objects\n                                    var seenReference = false;\n                                    var someNonReference = void 0;\n                                    for (var _i = 0, newValue_1 = newValue; _i < newValue_1.length; _i++) {\n                                        var value = newValue_1[_i];\n                                        if (isReference(value)) {\n                                            seenReference = true;\n                                            if (checkReference(value))\n                                                break;\n                                        }\n                                        else {\n                                            // Do not warn on primitive values, since those could never be represented\n                                            // by a reference. This is a valid (albeit uncommon) use case.\n                                            if (typeof value === \"object\" && !!value) {\n                                                var id = _this.policies.identify(value)[0];\n                                                // check if object could even be referenced, otherwise we are not interested in it for this warning\n                                                if (id) {\n                                                    someNonReference = value;\n                                                }\n                                            }\n                                        }\n                                        if (seenReference && someNonReference !== undefined) {\n                                            globalThis.__DEV__ !== false && invariant.warn(3, someNonReference);\n                                            break;\n                                        }\n                                    }\n                                }\n                            }\n                        }\n                    }\n                }\n                if (fieldValue !== void 0) {\n                    allDeleted_1 = false;\n                }\n            });\n            if (needToMerge_1) {\n                this.merge(dataId, changedFields_1);\n                if (allDeleted_1) {\n                    if (this instanceof Layer) {\n                        this.data[dataId] = void 0;\n                    }\n                    else {\n                        delete this.data[dataId];\n                    }\n                    this.group.dirty(dataId, \"__exists\");\n                }\n                return true;\n            }\n        }\n        return false;\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    EntityStore.prototype.delete = function (dataId, fieldName, args) {\n        var _a;\n        var storeObject = this.lookup(dataId);\n        if (storeObject) {\n            var typename = this.getFieldValue(storeObject, \"__typename\");\n            var storeFieldName = fieldName && args ?\n                this.policies.getStoreFieldName({ typename: typename, fieldName: fieldName, args: args })\n                : fieldName;\n            return this.modify(dataId, storeFieldName ? (_a = {},\n                _a[storeFieldName] = delModifier,\n                _a) : delModifier);\n        }\n        return false;\n    };\n    EntityStore.prototype.evict = function (options, limit) {\n        var 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 && this !== limit) {\n                evicted = this.parent.evict(options, limit) || 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    EntityStore.prototype.clear = function () {\n        this.replace(null);\n    };\n    EntityStore.prototype.extract = function () {\n        var _this = this;\n        var obj = this.toObject();\n        var extraRootIds = [];\n        this.getRootIdSet().forEach(function (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    EntityStore.prototype.replace = function (newData) {\n        var _this = this;\n        Object.keys(this.data).forEach(function (dataId) {\n            if (!(newData && hasOwn.call(newData, dataId))) {\n                _this.delete(dataId);\n            }\n        });\n        if (newData) {\n            var __META = newData.__META, rest_1 = __rest(newData, [\"__META\"]);\n            Object.keys(rest_1).forEach(function (dataId) {\n                _this.merge(dataId, rest_1[dataId]);\n            });\n            if (__META) {\n                __META.extraRootIds.forEach(this.retain, this);\n            }\n        }\n    };\n    EntityStore.prototype.retain = function (rootId) {\n        return (this.rootIds[rootId] = (this.rootIds[rootId] || 0) + 1);\n    };\n    EntityStore.prototype.release = function (rootId) {\n        if (this.rootIds[rootId] > 0) {\n            var count = --this.rootIds[rootId];\n            if (!count)\n                delete this.rootIds[rootId];\n            return count;\n        }\n        return 0;\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    EntityStore.prototype.getRootIdSet = function (ids) {\n        if (ids === void 0) { ids = new Set(); }\n        Object.keys(this.rootIds).forEach(ids.add, ids);\n        if (this instanceof Layer) {\n            this.parent.getRootIdSet(ids);\n        }\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    // 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    EntityStore.prototype.gc = function () {\n        var _this = this;\n        var ids = this.getRootIdSet();\n        var snapshot = this.toObject();\n        ids.forEach(function (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        var idsToRemove = Object.keys(snapshot);\n        if (idsToRemove.length) {\n            var root_1 = this;\n            while (root_1 instanceof Layer)\n                root_1 = root_1.parent;\n            idsToRemove.forEach(function (id) { return root_1.delete(id); });\n        }\n        return idsToRemove;\n    };\n    EntityStore.prototype.findChildRefIds = function (dataId) {\n        if (!hasOwn.call(this.refs, dataId)) {\n            var found_1 = (this.refs[dataId] = Object.create(null));\n            var root = this.data[dataId];\n            if (!root)\n                return found_1;\n            var workSet_1 = new Set([root]);\n            // Within the store, only arrays and objects can contain child entity\n            // references, so we can prune the traversal using this predicate:\n            workSet_1.forEach(function (obj) {\n                if (isReference(obj)) {\n                    found_1[obj.__ref] = true;\n                    // In rare cases, a { __ref } Reference object may have other fields.\n                    // This often indicates a mismerging of References with StoreObjects,\n                    // but garbage collection should not be fooled by a stray __ref\n                    // property in a StoreObject (ignoring all the other fields just\n                    // because the StoreObject looks like a Reference). To avoid this\n                    // premature termination of findChildRefIds recursion, we fall through\n                    // to the code below, which will handle any other properties of obj.\n                }\n                if (isNonNullObject(obj)) {\n                    Object.keys(obj).forEach(function (key) {\n                        var child = obj[key];\n                        // No need to add primitive values to the workSet, since they cannot\n                        // contain reference objects.\n                        if (isNonNullObject(child)) {\n                            workSet_1.add(child);\n                        }\n                    });\n                }\n            });\n        }\n        return this.refs[dataId];\n    };\n    EntityStore.prototype.makeCacheKey = function () {\n        return this.group.keyMaker.lookupArray(arguments);\n    };\n    return EntityStore;\n}());\nexport { EntityStore };\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.\nvar CacheGroup = /** @class */ (function () {\n    function CacheGroup(caching, parent) {\n        if (parent === void 0) { parent = null; }\n        this.caching = caching;\n        this.parent = parent;\n        this.d = null;\n        this.resetCaching();\n    }\n    CacheGroup.prototype.resetCaching = function () {\n        this.d = this.caching ? dep() : null;\n        this.keyMaker = new Trie(canUseWeakMap);\n    };\n    CacheGroup.prototype.depend = function (dataId, storeFieldName) {\n        if (this.d) {\n            this.d(makeDepKey(dataId, storeFieldName));\n            var 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            if (this.parent) {\n                this.parent.depend(dataId, storeFieldName);\n            }\n        }\n    };\n    CacheGroup.prototype.dirty = function (dataId, storeFieldName) {\n        if (this.d) {\n            this.d.dirty(makeDepKey(dataId, storeFieldName), \n            // When storeFieldName === \"__exists\", that means the entity identified\n            // by dataId has either disappeared from the cache or was newly added,\n            // so the result caching system would do well to \"forget everything it\n            // knows\" about that object. To achieve that kind of invalidation, we\n            // not only dirty the associated result cache entry, but also remove it\n            // completely from the dependency graph. For the optimism implementation\n            // details, see https://github.com/benjamn/optimism/pull/195.\n            storeFieldName === \"__exists\" ? \"forget\" : \"setDirty\");\n        }\n    };\n    return CacheGroup;\n}());\nfunction makeDepKey(dataId, storeFieldName) {\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}\nexport function maybeDependOnExistenceOfEntity(store, entityId) {\n    if (supportsResultCaching(store)) {\n        // We use this pseudo-field __exists elsewhere in the EntityStore code to\n        // represent changes in the existence of the entity object identified by\n        // entityId. This dependency gets reliably dirtied whenever an object with\n        // this ID is deleted (or newly created) within this group, so any result\n        // cache entries (for example, StoreReader#executeSelectionSet results) that\n        // depend on __exists for this entityId will get dirtied as well, leading to\n        // the eventual recomputation (instead of reuse) of those result objects the\n        // next time someone reads them from the cache.\n        store.group.depend(entityId, \"__exists\");\n    }\n}\n(function (EntityStore) {\n    // Refer to this class as EntityStore.Root outside this namespace.\n    var Root = /** @class */ (function (_super) {\n        __extends(Root, _super);\n        function Root(_a) {\n            var policies = _a.policies, _b = _a.resultCaching, resultCaching = _b === void 0 ? true : _b, seed = _a.seed;\n            var _this = _super.call(this, policies, new CacheGroup(resultCaching)) || this;\n            _this.stump = new Stump(_this);\n            _this.storageTrie = new Trie(canUseWeakMap);\n            if (seed)\n                _this.replace(seed);\n            return _this;\n        }\n        Root.prototype.addLayer = function (layerId, replay) {\n            // Adding an optimistic Layer on top of the Root actually adds the Layer\n            // on top of the Stump, so the Stump always comes between the Root and\n            // any Layer objects that we've added.\n            return this.stump.addLayer(layerId, replay);\n        };\n        Root.prototype.removeLayer = function () {\n            // Never remove the root layer.\n            return this;\n        };\n        Root.prototype.getStorage = function () {\n            return this.storageTrie.lookupArray(arguments);\n        };\n        return Root;\n    }(EntityStore));\n    EntityStore.Root = Root;\n})(EntityStore || (EntityStore = {}));\n// Not exported, since all Layer instances are created by the addLayer method\n// of the EntityStore.Root class.\nvar Layer = /** @class */ (function (_super) {\n    __extends(Layer, _super);\n    function Layer(id, parent, replay, group) {\n        var _this = _super.call(this, parent.policies, group) || this;\n        _this.id = id;\n        _this.parent = parent;\n        _this.replay = replay;\n        _this.group = group;\n        replay(_this);\n        return _this;\n    }\n    Layer.prototype.addLayer = function (layerId, replay) {\n        return new Layer(layerId, this, replay, this.group);\n    };\n    Layer.prototype.removeLayer = function (layerId) {\n        var _this = this;\n        // Remove all instances of the given id, not just the first one.\n        var parent = this.parent.removeLayer(layerId);\n        if (layerId === this.id) {\n            if (this.group.caching) {\n                // Dirty every ID we're removing. Technically we might be able to avoid\n                // dirtying fields that have values in higher layers, but we don't have\n                // easy access to higher layers here, and we're about to recreate those\n                // layers anyway (see parent.addLayer below).\n                Object.keys(this.data).forEach(function (dataId) {\n                    var ownStoreObject = _this.data[dataId];\n                    var parentStoreObject = parent[\"lookup\"](dataId);\n                    if (!parentStoreObject) {\n                        // The StoreObject identified by dataId was defined in this layer\n                        // but will be undefined in the parent layer, so we can delete the\n                        // whole entity using this.delete(dataId). Since we're about to\n                        // throw this layer away, the only goal of this deletion is to dirty\n                        // the removed fields.\n                        _this.delete(dataId);\n                    }\n                    else if (!ownStoreObject) {\n                        // This layer had an entry for dataId but it was undefined, which\n                        // means the entity was deleted in this layer, and it's about to\n                        // become undeleted when we remove this layer, so we need to dirty\n                        // all fields that are about to be reexposed.\n                        _this.group.dirty(dataId, \"__exists\");\n                        Object.keys(parentStoreObject).forEach(function (storeFieldName) {\n                            _this.group.dirty(dataId, storeFieldName);\n                        });\n                    }\n                    else if (ownStoreObject !== parentStoreObject) {\n                        // If ownStoreObject is not exactly the same as parentStoreObject,\n                        // dirty any fields whose values will change as a result of this\n                        // removal.\n                        Object.keys(ownStoreObject).forEach(function (storeFieldName) {\n                            if (!equal(ownStoreObject[storeFieldName], parentStoreObject[storeFieldName])) {\n                                _this.group.dirty(dataId, storeFieldName);\n                            }\n                        });\n                    }\n                });\n            }\n            return parent;\n        }\n        // No changes are necessary if the parent chain remains identical.\n        if (parent === this.parent)\n            return this;\n        // Recreate this layer on top of the new parent.\n        return parent.addLayer(this.id, this.replay);\n    };\n    Layer.prototype.toObject = function () {\n        return __assign(__assign({}, this.parent.toObject()), this.data);\n    };\n    Layer.prototype.findChildRefIds = function (dataId) {\n        var fromParent = this.parent.findChildRefIds(dataId);\n        return hasOwn.call(this.data, dataId) ? __assign(__assign({}, fromParent), _super.prototype.findChildRefIds.call(this, dataId)) : fromParent;\n    };\n    Layer.prototype.getStorage = function () {\n        var p = this.parent;\n        while (p.parent)\n            p = p.parent;\n        return p.getStorage.apply(p, \n        // @ts-expect-error\n        arguments);\n    };\n    return Layer;\n}(EntityStore));\n// Represents a Layer permanently installed just above the Root, which allows\n// reading optimistically (and registering optimistic dependencies) even when\n// no optimistic layers are currently active. The stump.group CacheGroup object\n// is shared by any/all Layer objects added on top of the Stump.\nvar Stump = /** @class */ (function (_super) {\n    __extends(Stump, _super);\n    function Stump(root) {\n        return _super.call(this, \"EntityStore.Stump\", root, function () { }, new CacheGroup(root.group.caching, root.group)) || this;\n    }\n    Stump.prototype.removeLayer = function () {\n        // Never remove the Stump layer.\n        return this;\n    };\n    Stump.prototype.merge = function (older, newer) {\n        // We never want to write any data into the Stump, so we forward any merge\n        // calls to the Root instead. Another option here would be to throw an\n        // exception, but the toReference(object, true) function can sometimes\n        // trigger Stump writes (which used to be Root writes, before the Stump\n        // concept was introduced).\n        return this.parent.merge(older, newer);\n    };\n    return Stump;\n}(Layer));\nfunction storeObjectReconciler(existingObject, incomingObject, property) {\n    var existingValue = existingObject[property];\n    var 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}\nexport function supportsResultCaching(store) {\n    // When result caching is disabled, store.depend will be null.\n    return !!(store instanceof EntityStore && store.group.caching);\n}\n//# sourceMappingURL=entityStore.js.map","import { __assign } from \"tslib\";\nimport { Trie } from \"@wry/trie\";\nimport { canUseWeakMap, canUseWeakSet, isNonNullObject as isObjectOrArray, } from \"../../utilities/index.js\";\nimport { isArray } from \"./helpers.js\";\nfunction shallowCopy(value) {\n    if (isObjectOrArray(value)) {\n        return isArray(value) ?\n            value.slice(0)\n            : __assign({ __proto__: Object.getPrototypeOf(value) }, value);\n    }\n    return value;\n}\n// When programmers talk about the \"canonical form\" of an object, they\n// usually have the following meaning in mind, which I've copied from\n// https://en.wiktionary.org/wiki/canonical_form:\n//\n// 1. A standard or normal presentation of a mathematical entity [or\n//    object]. A canonical form is an element of a set of representatives\n//    of equivalence classes of forms such that there is a function or\n//    procedure which projects every element of each equivalence class\n//    onto that one element, the canonical form of that equivalence\n//    class. The canonical form is expected to be simpler than the rest of\n//    the forms in some way.\n//\n// That's a long-winded way of saying any two objects that have the same\n// canonical form may be considered equivalent, even if they are !==,\n// which usually means the objects are structurally equivalent (deeply\n// equal), but don't necessarily use the same memory.\n//\n// Like a literary or musical canon, this ObjectCanon class represents a\n// collection of unique canonical items (JavaScript objects), with the\n// important property that canon.admit(a) === canon.admit(b) if a and b\n// are deeply equal to each other. In terms of the definition above, the\n// canon.admit method is the \"function or procedure which projects every\"\n// object \"onto that one element, the canonical form.\"\n//\n// In the worst case, the canonicalization process may involve looking at\n// every property in the provided object tree, so it takes the same order\n// of time as deep equality checking. Fortunately, already-canonicalized\n// objects are returned immediately from canon.admit, so the presence of\n// canonical subtrees tends to speed up canonicalization.\n//\n// Since consumers of canonical objects can check for deep equality in\n// constant time, canonicalizing cache results can massively improve the\n// performance of application code that skips re-rendering unchanged\n// results, such as \"pure\" UI components in a framework like React.\n//\n// Of course, since canonical objects may be shared widely between\n// unrelated consumers, it's important to think of them as immutable, even\n// though they are not actually frozen with Object.freeze in production,\n// due to the extra performance overhead that comes with frozen objects.\n//\n// Custom scalar objects whose internal class name is neither Array nor\n// Object can be included safely in the admitted tree, but they will not\n// be replaced with a canonical version (to put it another way, they are\n// assumed to be canonical already).\n//\n// If we ignore custom objects, no detection of cycles or repeated object\n// references is currently required by the StoreReader class, since\n// GraphQL result objects are JSON-serializable trees (and thus contain\n// neither cycles nor repeated subtrees), so we can avoid the complexity\n// of keeping track of objects we've already seen during the recursion of\n// the admit method.\n//\n// In the future, we may consider adding additional cases to the switch\n// statement to handle other common object types, such as \"[object Date]\"\n// objects, as needed.\nvar ObjectCanon = /** @class */ (function () {\n    function ObjectCanon() {\n        // Set of all canonical objects this ObjectCanon has admitted, allowing\n        // canon.admit to return previously-canonicalized objects immediately.\n        this.known = new (canUseWeakSet ? WeakSet : Set)();\n        // Efficient storage/lookup structure for canonical objects.\n        this.pool = new Trie(canUseWeakMap);\n        // Make the ObjectCanon assume this value has already been\n        // canonicalized.\n        this.passes = new WeakMap();\n        // Arrays that contain the same elements in a different order can share\n        // the same SortedKeysInfo object, to save memory.\n        this.keysByJSON = new Map();\n        // This has to come last because it depends on keysByJSON.\n        this.empty = this.admit({});\n    }\n    ObjectCanon.prototype.isKnown = function (value) {\n        return isObjectOrArray(value) && this.known.has(value);\n    };\n    ObjectCanon.prototype.pass = function (value) {\n        if (isObjectOrArray(value)) {\n            var copy = shallowCopy(value);\n            this.passes.set(copy, value);\n            return copy;\n        }\n        return value;\n    };\n    ObjectCanon.prototype.admit = function (value) {\n        var _this = this;\n        if (isObjectOrArray(value)) {\n            var original = this.passes.get(value);\n            if (original)\n                return original;\n            var proto = Object.getPrototypeOf(value);\n            switch (proto) {\n                case Array.prototype: {\n                    if (this.known.has(value))\n                        return value;\n                    var array = value.map(this.admit, this);\n                    // Arrays are looked up in the Trie using their recursively\n                    // canonicalized elements, and the known version of the array is\n                    // preserved as node.array.\n                    var node = this.pool.lookupArray(array);\n                    if (!node.array) {\n                        this.known.add((node.array = array));\n                        // Since canonical arrays may be shared widely between\n                        // unrelated consumers, it's important to regard them as\n                        // immutable, even if they are not frozen in production.\n                        if (globalThis.__DEV__ !== false) {\n                            Object.freeze(array);\n                        }\n                    }\n                    return node.array;\n                }\n                case null:\n                case Object.prototype: {\n                    if (this.known.has(value))\n                        return value;\n                    var proto_1 = Object.getPrototypeOf(value);\n                    var array_1 = [proto_1];\n                    var keys = this.sortedKeys(value);\n                    array_1.push(keys.json);\n                    var firstValueIndex_1 = array_1.length;\n                    keys.sorted.forEach(function (key) {\n                        array_1.push(_this.admit(value[key]));\n                    });\n                    // Objects are looked up in the Trie by their prototype (which\n                    // is *not* recursively canonicalized), followed by a JSON\n                    // representation of their (sorted) keys, followed by the\n                    // sequence of recursively canonicalized values corresponding to\n                    // those keys. To keep the final results unambiguous with other\n                    // sequences (such as arrays that just happen to contain [proto,\n                    // keys.json, value1, value2, ...]), the known version of the\n                    // object is stored as node.object.\n                    var node = this.pool.lookupArray(array_1);\n                    if (!node.object) {\n                        var obj_1 = (node.object = Object.create(proto_1));\n                        this.known.add(obj_1);\n                        keys.sorted.forEach(function (key, i) {\n                            obj_1[key] = array_1[firstValueIndex_1 + i];\n                        });\n                        // Since canonical objects may be shared widely between\n                        // unrelated consumers, it's important to regard them as\n                        // immutable, even if they are not frozen in production.\n                        if (globalThis.__DEV__ !== false) {\n                            Object.freeze(obj_1);\n                        }\n                    }\n                    return node.object;\n                }\n            }\n        }\n        return value;\n    };\n    // It's worthwhile to cache the sorting of arrays of strings, since the\n    // same initial unsorted arrays tend to be encountered many times.\n    // Fortunately, we can reuse the Trie machinery to look up the sorted\n    // arrays in linear time (which is faster than sorting large arrays).\n    ObjectCanon.prototype.sortedKeys = function (obj) {\n        var keys = Object.keys(obj);\n        var node = this.pool.lookupArray(keys);\n        if (!node.keys) {\n            keys.sort();\n            var json = JSON.stringify(keys);\n            if (!(node.keys = this.keysByJSON.get(json))) {\n                this.keysByJSON.set(json, (node.keys = { sorted: keys, json: json }));\n            }\n        }\n        return node.keys;\n    };\n    return ObjectCanon;\n}());\nexport { ObjectCanon };\n//# sourceMappingURL=object-canon.js.map","import { __assign } from \"tslib\";\nimport { invariant, newInvariantError } from \"../../utilities/globals/index.js\";\nimport { Kind } from \"graphql\";\nimport { wrap } from \"optimism\";\nimport { isField, resultKeyNameFromField, isReference, makeReference, shouldInclude, addTypenameToDocument, getDefaultValues, getMainDefinition, getQueryDefinition, getFragmentFromSelection, maybeDeepFreeze, mergeDeepArray, DeepMerger, isNonNullObject, canUseWeakMap, compact, canonicalStringify, cacheSizes, } from \"../../utilities/index.js\";\nimport { maybeDependOnExistenceOfEntity, supportsResultCaching, } from \"./entityStore.js\";\nimport { isArray, extractFragmentContext, getTypenameFromStoreObject, shouldCanonizeResults, } from \"./helpers.js\";\nimport { MissingFieldError } from \"../core/types/common.js\";\nimport { ObjectCanon } from \"./object-canon.js\";\nfunction execSelectionSetKeyArgs(options) {\n    return [\n        options.selectionSet,\n        options.objectOrReference,\n        options.context,\n        // We split out this property so we can pass different values\n        // independently without modifying options.context itself.\n        options.context.canonizeResults,\n    ];\n}\nvar StoreReader = /** @class */ (function () {\n    function StoreReader(config) {\n        var _this = this;\n        this.knownResults = new (canUseWeakMap ? WeakMap : Map)();\n        this.config = compact(config, {\n            addTypename: config.addTypename !== false,\n            canonizeResults: shouldCanonizeResults(config),\n        });\n        this.canon = config.canon || new ObjectCanon();\n        // memoized functions in this class will be \"garbage-collected\"\n        // by recreating the whole `StoreReader` in\n        // `InMemoryCache.resetResultsCache`\n        // (triggered from `InMemoryCache.gc` with `resetResultCache: true`)\n        this.executeSelectionSet = wrap(function (options) {\n            var _a;\n            var canonizeResults = options.context.canonizeResults;\n            var peekArgs = execSelectionSetKeyArgs(options);\n            // Negate this boolean option so we can find out if we've already read\n            // this result using the other boolean value.\n            peekArgs[3] = !canonizeResults;\n            var other = (_a = _this.executeSelectionSet).peek.apply(_a, peekArgs);\n            if (other) {\n                if (canonizeResults) {\n                    return __assign(__assign({}, other), { \n                        // If we previously read this result without canonizing it, we can\n                        // reuse that result simply by canonizing it now.\n                        result: _this.canon.admit(other.result) });\n                }\n                // If we previously read this result with canonization enabled, we can\n                // return that canonized result as-is.\n                return other;\n            }\n            maybeDependOnExistenceOfEntity(options.context.store, options.enclosingRef.__ref);\n            // Finally, if we didn't find any useful previous results, run the real\n            // execSelectionSetImpl method with the given options.\n            return _this.execSelectionSetImpl(options);\n        }, {\n            max: this.config.resultCacheMaxSize ||\n                cacheSizes[\"inMemoryCache.executeSelectionSet\"] ||\n                50000 /* defaultCacheSizes[\"inMemoryCache.executeSelectionSet\"] */,\n            keyArgs: execSelectionSetKeyArgs,\n            // Note that the parameters of makeCacheKey are determined by the\n            // array returned by keyArgs.\n            makeCacheKey: function (selectionSet, parent, context, canonizeResults) {\n                if (supportsResultCaching(context.store)) {\n                    return context.store.makeCacheKey(selectionSet, isReference(parent) ? parent.__ref : parent, context.varString, canonizeResults);\n                }\n            },\n        });\n        this.executeSubSelectedArray = wrap(function (options) {\n            maybeDependOnExistenceOfEntity(options.context.store, options.enclosingRef.__ref);\n            return _this.execSubSelectedArrayImpl(options);\n        }, {\n            max: this.config.resultCacheMaxSize ||\n                cacheSizes[\"inMemoryCache.executeSubSelectedArray\"] ||\n                10000 /* defaultCacheSizes[\"inMemoryCache.executeSubSelectedArray\"] */,\n            makeCacheKey: function (_a) {\n                var field = _a.field, array = _a.array, context = _a.context;\n                if (supportsResultCaching(context.store)) {\n                    return context.store.makeCacheKey(field, array, context.varString);\n                }\n            },\n        });\n    }\n    StoreReader.prototype.resetCanon = function () {\n        this.canon = new ObjectCanon();\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     */\n    StoreReader.prototype.diffQueryAgainstStore = function (_a) {\n        var store = _a.store, query = _a.query, _b = _a.rootId, rootId = _b === void 0 ? \"ROOT_QUERY\" : _b, variables = _a.variables, _c = _a.returnPartialData, returnPartialData = _c === void 0 ? true : _c, _d = _a.canonizeResults, canonizeResults = _d === void 0 ? this.config.canonizeResults : _d;\n        var policies = this.config.cache.policies;\n        variables = __assign(__assign({}, getDefaultValues(getQueryDefinition(query))), variables);\n        var rootRef = makeReference(rootId);\n        var execResult = this.executeSelectionSet({\n            selectionSet: getMainDefinition(query).selectionSet,\n            objectOrReference: rootRef,\n            enclosingRef: rootRef,\n            context: __assign({ store: store, query: query, policies: policies, variables: variables, varString: canonicalStringify(variables), canonizeResults: canonizeResults }, extractFragmentContext(query, this.config.fragments)),\n        });\n        var missing;\n        if (execResult.missing) {\n            // For backwards compatibility we still report an array of\n            // MissingFieldError objects, even though there will only ever be at most\n            // one of them, now that all missing field error messages are grouped\n            // together in the execResult.missing tree.\n            missing = [\n                new MissingFieldError(firstMissing(execResult.missing), execResult.missing, query, variables),\n            ];\n            if (!returnPartialData) {\n                throw missing[0];\n            }\n        }\n        return {\n            result: execResult.result,\n            complete: !missing,\n            missing: missing,\n        };\n    };\n    StoreReader.prototype.isFresh = function (result, parent, selectionSet, context) {\n        if (supportsResultCaching(context.store) &&\n            this.knownResults.get(result) === selectionSet) {\n            var latest = this.executeSelectionSet.peek(selectionSet, parent, context, \n            // If result is canonical, then it could only have been previously\n            // cached by the canonizing version of executeSelectionSet, so we can\n            // avoid checking both possibilities here.\n            this.canon.isKnown(result));\n            if (latest && result === latest.result) {\n                return true;\n            }\n        }\n        return false;\n    };\n    // Uncached version of executeSelectionSet.\n    StoreReader.prototype.execSelectionSetImpl = function (_a) {\n        var _this = this;\n        var selectionSet = _a.selectionSet, objectOrReference = _a.objectOrReference, enclosingRef = _a.enclosingRef, context = _a.context;\n        if (isReference(objectOrReference) &&\n            !context.policies.rootTypenamesById[objectOrReference.__ref] &&\n            !context.store.has(objectOrReference.__ref)) {\n            return {\n                result: this.canon.empty,\n                missing: \"Dangling reference to missing \".concat(objectOrReference.__ref, \" object\"),\n            };\n        }\n        var variables = context.variables, policies = context.policies, store = context.store;\n        var typename = store.getFieldValue(objectOrReference, \"__typename\");\n        var objectsToMerge = [];\n        var missing;\n        var missingMerger = new DeepMerger();\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        function handleMissing(result, resultName) {\n            var _a;\n            if (result.missing) {\n                missing = missingMerger.merge(missing, (_a = {},\n                    _a[resultName] = result.missing,\n                    _a));\n            }\n            return result.result;\n        }\n        var workSet = new Set(selectionSet.selections);\n        workSet.forEach(function (selection) {\n            var _a, _b;\n            // Omit fields with directives @skip(if: <truthy value>) or\n            // @include(if: <falsy value>).\n            if (!shouldInclude(selection, variables))\n                return;\n            if (isField(selection)) {\n                var fieldValue = policies.readField({\n                    fieldName: selection.name.value,\n                    field: selection,\n                    variables: context.variables,\n                    from: objectOrReference,\n                }, context);\n                var resultName = resultKeyNameFromField(selection);\n                if (fieldValue === void 0) {\n                    if (!addTypenameToDocument.added(selection)) {\n                        missing = missingMerger.merge(missing, (_a = {},\n                            _a[resultName] = \"Can't find field '\".concat(selection.name.value, \"' on \").concat(isReference(objectOrReference) ?\n                                objectOrReference.__ref + \" object\"\n                                : \"object \" + JSON.stringify(objectOrReference, null, 2)),\n                            _a));\n                    }\n                }\n                else if (isArray(fieldValue)) {\n                    if (fieldValue.length > 0) {\n                        fieldValue = handleMissing(_this.executeSubSelectedArray({\n                            field: selection,\n                            array: fieldValue,\n                            enclosingRef: enclosingRef,\n                            context: context,\n                        }), resultName);\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. To keep this.canon from canonicalizing\n                    // this value, we use this.canon.pass to wrap fieldValue in a\n                    // Pass object that this.canon.admit will later unwrap as-is.\n                    if (context.canonizeResults) {\n                        fieldValue = _this.canon.pass(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,\n                        enclosingRef: isReference(fieldValue) ? fieldValue : enclosingRef,\n                        context: context,\n                    }), resultName);\n                }\n                if (fieldValue !== void 0) {\n                    objectsToMerge.push((_b = {}, _b[resultName] = fieldValue, _b));\n                }\n            }\n            else {\n                var fragment = getFragmentFromSelection(selection, context.lookupFragment);\n                if (!fragment && selection.kind === Kind.FRAGMENT_SPREAD) {\n                    throw newInvariantError(9, selection.name.value);\n                }\n                if (fragment && policies.fragmentMatches(fragment, typename)) {\n                    fragment.selectionSet.selections.forEach(workSet.add, workSet);\n                }\n            }\n        });\n        var result = mergeDeepArray(objectsToMerge);\n        var finalResult = { result: result, missing: missing };\n        var frozen = context.canonizeResults ?\n            this.canon.admit(finalResult)\n            // Since this.canon is normally responsible for freezing results (only in\n            // development), freeze them manually if canonization is disabled.\n            : maybeDeepFreeze(finalResult);\n        // Store this result with its selection set so that we can quickly\n        // recognize it again in the StoreReader#isFresh method.\n        if (frozen.result) {\n            this.knownResults.set(frozen.result, selectionSet);\n        }\n        return frozen;\n    };\n    // Uncached version of executeSubSelectedArray.\n    StoreReader.prototype.execSubSelectedArrayImpl = function (_a) {\n        var _this = this;\n        var field = _a.field, array = _a.array, enclosingRef = _a.enclosingRef, context = _a.context;\n        var missing;\n        var missingMerger = new DeepMerger();\n        function handleMissing(childResult, i) {\n            var _a;\n            if (childResult.missing) {\n                missing = missingMerger.merge(missing, (_a = {}, _a[i] = childResult.missing, _a));\n            }\n            return childResult.result;\n        }\n        if (field.selectionSet) {\n            array = array.filter(context.store.canRead);\n        }\n        array = array.map(function (item, i) {\n            // null value in array\n            if (item === null) {\n                return null;\n            }\n            // This is a nested array, recurse\n            if (isArray(item)) {\n                return handleMissing(_this.executeSubSelectedArray({\n                    field: field,\n                    array: item,\n                    enclosingRef: enclosingRef,\n                    context: context,\n                }), i);\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                    enclosingRef: isReference(item) ? item : enclosingRef,\n                    context: context,\n                }), i);\n            }\n            if (globalThis.__DEV__ !== false) {\n                assertSelectionSetForIdValue(context.store, field, item);\n            }\n            return item;\n        });\n        return {\n            result: context.canonizeResults ? this.canon.admit(array) : array,\n            missing: missing,\n        };\n    };\n    return StoreReader;\n}());\nexport { StoreReader };\nfunction firstMissing(tree) {\n    try {\n        JSON.stringify(tree, function (_, value) {\n            if (typeof value === \"string\")\n                throw value;\n            return value;\n        });\n    }\n    catch (result) {\n        return result;\n    }\n}\nfunction assertSelectionSetForIdValue(store, field, fieldValue) {\n    if (!field.selectionSet) {\n        var workSet_1 = new Set([fieldValue]);\n        workSet_1.forEach(function (value) {\n            if (isNonNullObject(value)) {\n                invariant(\n                    !isReference(value),\n                    10,\n                    getTypenameFromStoreObject(store, value),\n                    field.name.value\n                );\n                Object.values(value).forEach(workSet_1.add, workSet_1);\n            }\n        });\n    }\n}\n//# sourceMappingURL=readFromStore.js.map","import { dep, Slot } from \"optimism\";\n// Contextual Slot that acquires its value when custom read functions are\n// called in Policies#readField.\nexport var cacheSlot = new Slot();\nvar cacheInfoMap = new WeakMap();\nfunction getCacheInfo(cache) {\n    var 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}\nexport function forgetCache(cache) {\n    getCacheInfo(cache).vars.forEach(function (rv) { return rv.forgetCache(cache); });\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) {\n    getCacheInfo(cache).vars.forEach(function (rv) { return rv.attachCache(cache); });\n}\nexport function makeVar(value) {\n    var caches = new Set();\n    var listeners = new Set();\n    var rv = function (newValue) {\n        if (arguments.length > 0) {\n            if (value !== newValue) {\n                value = newValue;\n                caches.forEach(function (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                var oldListeners = Array.from(listeners);\n                listeners.clear();\n                oldListeners.forEach(function (listener) { return listener(value); });\n            }\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            var cache = cacheSlot.getValue();\n            if (cache) {\n                attach(cache);\n                getCacheInfo(cache).dep(rv);\n            }\n        }\n        return value;\n    };\n    rv.onNextChange = function (listener) {\n        listeners.add(listener);\n        return function () {\n            listeners.delete(listener);\n        };\n    };\n    var attach = (rv.attachCache = function (cache) {\n        caches.add(cache);\n        getCacheInfo(cache).vars.add(rv);\n        return rv;\n    });\n    rv.forgetCache = function (cache) { return caches.delete(cache); };\n    return rv;\n}\nfunction broadcast(cache) {\n    if (cache.broadcastWatches) {\n        cache.broadcastWatches();\n    }\n}\n//# sourceMappingURL=reactiveVars.js.map","import { invariant } from \"../../utilities/globals/index.js\";\nimport { argumentsObjectFromField, DeepMerger, isNonEmptyArray, isNonNullObject, } from \"../../utilities/index.js\";\nimport { hasOwn, isArray } from \"./helpers.js\";\n// Mapping from JSON-encoded KeySpecifier strings to associated information.\nvar specifierInfoCache = Object.create(null);\nfunction lookupSpecifierInfo(spec) {\n    // It's safe to encode KeySpecifier arrays with JSON.stringify, since they're\n    // just arrays of strings or nested KeySpecifier arrays, and the order of the\n    // array elements is important (and suitably preserved by JSON.stringify).\n    var cacheKey = JSON.stringify(spec);\n    return (specifierInfoCache[cacheKey] ||\n        (specifierInfoCache[cacheKey] = Object.create(null)));\n}\nexport function keyFieldsFnFromSpecifier(specifier) {\n    var info = lookupSpecifierInfo(specifier);\n    return (info.keyFieldsFn || (info.keyFieldsFn = function (object, context) {\n            var extract = function (from, key) {\n                return context.readField(key, from);\n            };\n            var keyObject = (context.keyObject = collectSpecifierPaths(specifier, function (schemaKeyPath) {\n                var extracted = extractKeyPath(context.storeObject, schemaKeyPath, \n                // Using context.readField to extract paths from context.storeObject\n                // allows the extraction to see through Reference objects and respect\n                // custom read functions.\n                extract);\n                if (extracted === void 0 &&\n                    object !== context.storeObject &&\n                    hasOwn.call(object, schemaKeyPath[0])) {\n                    // If context.storeObject fails to provide a value for the requested\n                    // path, fall back to the raw result object, if it has a top-level key\n                    // matching the first key in the path (schemaKeyPath[0]). This allows\n                    // key fields included in the written data to be saved in the cache\n                    // even if they are not selected explicitly in context.selectionSet.\n                    // Not being mentioned by context.selectionSet is convenient here,\n                    // since it means these extra fields cannot be affected by field\n                    // aliasing, which is why we can use extractKey instead of\n                    // context.readField for this extraction.\n                    extracted = extractKeyPath(object, schemaKeyPath, extractKey);\n                }\n                invariant(extracted !== void 0, 4, schemaKeyPath.join(\".\"), object);\n                return extracted;\n            }));\n            return \"\".concat(context.typename, \":\").concat(JSON.stringify(keyObject));\n        }));\n}\n// The keyArgs extraction process is roughly analogous to keyFields extraction,\n// but there are no aliases involved, missing fields are tolerated (by merely\n// omitting them from the key), and drawing from field.directives or variables\n// is allowed (in addition to drawing from the field's arguments object).\n// Concretely, these differences mean passing a different key path extractor\n// function to collectSpecifierPaths, reusing the shared extractKeyPath helper\n// wherever possible.\nexport function keyArgsFnFromSpecifier(specifier) {\n    var info = lookupSpecifierInfo(specifier);\n    return (info.keyArgsFn ||\n        (info.keyArgsFn = function (args, _a) {\n            var field = _a.field, variables = _a.variables, fieldName = _a.fieldName;\n            var collected = collectSpecifierPaths(specifier, function (keyPath) {\n                var firstKey = keyPath[0];\n                var firstChar = firstKey.charAt(0);\n                if (firstChar === \"@\") {\n                    if (field && isNonEmptyArray(field.directives)) {\n                        var directiveName_1 = firstKey.slice(1);\n                        // If the directive appears multiple times, only the first\n                        // occurrence's arguments will be used. TODO Allow repetition?\n                        // TODO Cache this work somehow, a la aliasMap?\n                        var d = field.directives.find(function (d) { return d.name.value === directiveName_1; });\n                        // Fortunately argumentsObjectFromField works for DirectiveNode!\n                        var directiveArgs = d && argumentsObjectFromField(d, variables);\n                        // For directives without arguments (d defined, but directiveArgs ===\n                        // null), the presence or absence of the directive still counts as\n                        // part of the field key, so we return null in those cases. If no\n                        // directive with this name was found for this field (d undefined and\n                        // thus directiveArgs undefined), we return undefined, which causes\n                        // this value to be omitted from the key object returned by\n                        // collectSpecifierPaths.\n                        return (directiveArgs &&\n                            extractKeyPath(directiveArgs, \n                            // If keyPath.length === 1, this code calls extractKeyPath with an\n                            // empty path, which works because it uses directiveArgs as the\n                            // extracted value.\n                            keyPath.slice(1)));\n                    }\n                    // If the key started with @ but there was no corresponding directive,\n                    // we want to omit this value from the key object, not fall through to\n                    // treating @whatever as a normal argument name.\n                    return;\n                }\n                if (firstChar === \"$\") {\n                    var variableName = firstKey.slice(1);\n                    if (variables && hasOwn.call(variables, variableName)) {\n                        var varKeyPath = keyPath.slice(0);\n                        varKeyPath[0] = variableName;\n                        return extractKeyPath(variables, varKeyPath);\n                    }\n                    // If the key started with $ but there was no corresponding variable, we\n                    // want to omit this value from the key object, not fall through to\n                    // treating $whatever as a normal argument name.\n                    return;\n                }\n                if (args) {\n                    return extractKeyPath(args, keyPath);\n                }\n            });\n            var suffix = JSON.stringify(collected);\n            // If no arguments were passed to this field, and it didn't have any other\n            // field key contributions from directives or variables, hide the empty\n            // :{} suffix from the field key. However, a field passed no arguments can\n            // still end up with a non-empty :{...} suffix if its key configuration\n            // refers to directives or variables.\n            if (args || suffix !== \"{}\") {\n                fieldName += \":\" + suffix;\n            }\n            return fieldName;\n        }));\n}\nexport function collectSpecifierPaths(specifier, extractor) {\n    // For each path specified by specifier, invoke the extractor, and repeatedly\n    // merge the results together, with appropriate ancestor context.\n    var merger = new DeepMerger();\n    return getSpecifierPaths(specifier).reduce(function (collected, path) {\n        var _a;\n        var toMerge = extractor(path);\n        if (toMerge !== void 0) {\n            // This path is not expected to contain array indexes, so the toMerge\n            // reconstruction will not contain arrays. TODO Fix this?\n            for (var i = path.length - 1; i >= 0; --i) {\n                toMerge = (_a = {}, _a[path[i]] = toMerge, _a);\n            }\n            collected = merger.merge(collected, toMerge);\n        }\n        return collected;\n    }, Object.create(null));\n}\nexport function getSpecifierPaths(spec) {\n    var info = lookupSpecifierInfo(spec);\n    if (!info.paths) {\n        var paths_1 = (info.paths = []);\n        var currentPath_1 = [];\n        spec.forEach(function (s, i) {\n            if (isArray(s)) {\n                getSpecifierPaths(s).forEach(function (p) { return paths_1.push(currentPath_1.concat(p)); });\n                currentPath_1.length = 0;\n            }\n            else {\n                currentPath_1.push(s);\n                if (!isArray(spec[i + 1])) {\n                    paths_1.push(currentPath_1.slice(0));\n                    currentPath_1.length = 0;\n                }\n            }\n        });\n    }\n    return info.paths;\n}\nfunction extractKey(object, key) {\n    return object[key];\n}\nexport function extractKeyPath(object, path, extract) {\n    // For each key in path, extract the corresponding child property from obj,\n    // flattening arrays if encountered (uncommon for keyFields and keyArgs, but\n    // possible). The final result of path.reduce is normalized so unexpected leaf\n    // objects have their keys safely sorted. That final result is difficult to\n    // type as anything other than any. You're welcome to try to improve the\n    // return type, but keep in mind extractKeyPath is not a public function\n    // (exported only for testing), so the effort may not be worthwhile unless the\n    // limited set of actual callers (see above) pass arguments that TypeScript\n    // can statically type. If we know only that path is some array of strings\n    // (and not, say, a specific tuple of statically known strings), any (or\n    // possibly unknown) is the honest answer.\n    extract = extract || extractKey;\n    return normalize(path.reduce(function reducer(obj, key) {\n        return isArray(obj) ?\n            obj.map(function (child) { return reducer(child, key); })\n            : obj && extract(obj, key);\n    }, object));\n}\nfunction normalize(value) {\n    // Usually the extracted value will be a scalar value, since most primary\n    // key fields are scalar, but just in case we get an object or an array, we\n    // need to do some normalization of the order of (nested) keys.\n    if (isNonNullObject(value)) {\n        if (isArray(value)) {\n            return value.map(normalize);\n        }\n        return collectSpecifierPaths(Object.keys(value).sort(), function (path) {\n            return extractKeyPath(value, path);\n        });\n    }\n    return value;\n}\n//# sourceMappingURL=key-extractor.js.map","import { __assign, __rest } from \"tslib\";\nimport { invariant, newInvariantError } from \"../../utilities/globals/index.js\";\nimport { storeKeyNameFromField, argumentsObjectFromField, isReference, getStoreKeyName, isNonNullObject, stringifyForDisplay, } from \"../../utilities/index.js\";\nimport { hasOwn, fieldNameFromStoreName, storeValueIsStoreObject, selectionSetMatchesResult, TypeOrFieldNameRegExp, defaultDataIdFromObject, isArray, } from \"./helpers.js\";\nimport { cacheSlot } from \"./reactiveVars.js\";\nimport { keyArgsFnFromSpecifier, keyFieldsFnFromSpecifier, } from \"./key-extractor.js\";\nfunction argsFromFieldSpecifier(spec) {\n    return (spec.args !== void 0 ? spec.args\n        : spec.field ? argumentsObjectFromField(spec.field, spec.variables)\n            : null);\n}\nvar nullKeyFieldsFn = function () { return void 0; };\nvar simpleKeyArgsFn = function (_args, context) { return context.fieldName; };\n// These merge functions can be selected by specifying merge:true or\n// merge:false in a field policy.\nvar mergeTrueFn = function (existing, incoming, _a) {\n    var mergeObjects = _a.mergeObjects;\n    return mergeObjects(existing, incoming);\n};\nvar mergeFalseFn = function (_, incoming) { return incoming; };\nvar Policies = /** @class */ (function () {\n    function Policies(config) {\n        this.config = config;\n        this.typePolicies = Object.create(null);\n        this.toBeAdded = Object.create(null);\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        this.supertypeMap = new Map();\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        this.fuzzySubtypes = new Map();\n        this.rootIdsByTypename = Object.create(null);\n        this.rootTypenamesById = Object.create(null);\n        this.usingPossibleTypes = false;\n        this.config = __assign({ dataIdFromObject: defaultDataIdFromObject }, config);\n        this.cache = this.config.cache;\n        this.setRootTypename(\"Query\");\n        this.setRootTypename(\"Mutation\");\n        this.setRootTypename(\"Subscription\");\n        if (config.possibleTypes) {\n            this.addPossibleTypes(config.possibleTypes);\n        }\n        if (config.typePolicies) {\n            this.addTypePolicies(config.typePolicies);\n        }\n    }\n    Policies.prototype.identify = function (object, partialContext) {\n        var _a;\n        var policies = this;\n        var typename = (partialContext &&\n            (partialContext.typename || ((_a = partialContext.storeObject) === null || _a === void 0 ? void 0 : _a.__typename))) ||\n            object.__typename;\n        // It should be possible to write root Query fields with writeFragment,\n        // using { __typename: \"Query\", ... } as the data, but it does not make\n        // sense to allow the same identification behavior for the Mutation and\n        // Subscription types, since application code should never be writing\n        // directly to (or reading directly from) those root objects.\n        if (typename === this.rootTypenamesById.ROOT_QUERY) {\n            return [\"ROOT_QUERY\"];\n        }\n        // Default context.storeObject to object if not otherwise provided.\n        var storeObject = (partialContext && partialContext.storeObject) || object;\n        var context = __assign(__assign({}, partialContext), { typename: typename, storeObject: storeObject, readField: (partialContext && partialContext.readField) ||\n                function () {\n                    var options = normalizeReadFieldOptions(arguments, storeObject);\n                    return policies.readField(options, {\n                        store: policies.cache[\"data\"],\n                        variables: options.variables,\n                    });\n                } });\n        var id;\n        var policy = typename && this.getTypePolicy(typename);\n        var keyFn = (policy && policy.keyFn) || this.config.dataIdFromObject;\n        while (keyFn) {\n            var specifierOrId = keyFn(__assign(__assign({}, object), storeObject), context);\n            if (isArray(specifierOrId)) {\n                keyFn = keyFieldsFnFromSpecifier(specifierOrId);\n            }\n            else {\n                id = specifierOrId;\n                break;\n            }\n        }\n        id = id ? String(id) : void 0;\n        return context.keyObject ? [id, context.keyObject] : [id];\n    };\n    Policies.prototype.addTypePolicies = function (typePolicies) {\n        var _this = this;\n        Object.keys(typePolicies).forEach(function (typename) {\n            var _a = typePolicies[typename], queryType = _a.queryType, mutationType = _a.mutationType, subscriptionType = _a.subscriptionType, incoming = __rest(_a, [\"queryType\", \"mutationType\", \"subscriptionType\"]);\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)\n                _this.setRootTypename(\"Query\", typename);\n            if (mutationType)\n                _this.setRootTypename(\"Mutation\", typename);\n            if (subscriptionType)\n                _this.setRootTypename(\"Subscription\", typename);\n            if (hasOwn.call(_this.toBeAdded, typename)) {\n                _this.toBeAdded[typename].push(incoming);\n            }\n            else {\n                _this.toBeAdded[typename] = [incoming];\n            }\n        });\n    };\n    Policies.prototype.updateTypePolicy = function (typename, incoming) {\n        var _this = this;\n        var existing = this.getTypePolicy(typename);\n        var keyFields = incoming.keyFields, fields = incoming.fields;\n        function setMerge(existing, merge) {\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        // Type policies can define merge functions, as an alternative to\n        // using field policies to merge child objects.\n        setMerge(existing, incoming.merge);\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                : 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        if (fields) {\n            Object.keys(fields).forEach(function (fieldName) {\n                var existing = _this.getFieldPolicy(typename, fieldName, true);\n                var incoming = fields[fieldName];\n                if (typeof incoming === \"function\") {\n                    existing.read = incoming;\n                }\n                else {\n                    var keyArgs = incoming.keyArgs, read = incoming.read, merge = incoming.merge;\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                            : 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                    if (typeof read === \"function\") {\n                        existing.read = read;\n                    }\n                    setMerge(existing, merge);\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    Policies.prototype.setRootTypename = function (which, typename) {\n        if (typename === void 0) { typename = which; }\n        var rootId = \"ROOT_\" + which.toUpperCase();\n        var old = this.rootTypenamesById[rootId];\n        if (typename !== old) {\n            invariant(!old || old === which, 5, which);\n            // First, delete any old __typename associated with this rootId from\n            // rootIdsByTypename.\n            if (old)\n                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    Policies.prototype.addPossibleTypes = function (possibleTypes) {\n        var _this = this;\n        this.usingPossibleTypes = true;\n        Object.keys(possibleTypes).forEach(function (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            possibleTypes[supertype].forEach(function (subtype) {\n                _this.getSupertypeSet(subtype, true).add(supertype);\n                var 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    Policies.prototype.getTypePolicy = function (typename) {\n        var _this = this;\n        if (!hasOwn.call(this.typePolicies, typename)) {\n            var policy_1 = (this.typePolicies[typename] = Object.create(null));\n            policy_1.fields = Object.create(null);\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 properties can\n            // still be updated directly using addTypePolicies, but future changes to\n            // inherited supertype policies will not be reflected in this subtype\n            // policy, because this code runs at most once per typename.\n            var supertypes_1 = this.supertypeMap.get(typename);\n            if (!supertypes_1 && this.fuzzySubtypes.size) {\n                // To make the inheritance logic work for unknown typename strings that\n                // may have fuzzy supertypes, we give this typename an empty supertype\n                // set and then populate it with any fuzzy supertypes that match.\n                supertypes_1 = this.getSupertypeSet(typename, true);\n                // This only works for typenames that are directly matched by a fuzzy\n                // supertype. What if there is an intermediate chain of supertypes?\n                // While possible, that situation can only be solved effectively by\n                // specifying the intermediate relationships via possibleTypes, manually\n                // and in a non-fuzzy way.\n                this.fuzzySubtypes.forEach(function (regExp, fuzzy) {\n                    if (regExp.test(typename)) {\n                        // The fuzzy parameter is just the original string version of regExp\n                        // (not a valid __typename string), but we can look up the\n                        // associated supertype(s) in this.supertypeMap.\n                        var fuzzySupertypes = _this.supertypeMap.get(fuzzy);\n                        if (fuzzySupertypes) {\n                            fuzzySupertypes.forEach(function (supertype) {\n                                return supertypes_1.add(supertype);\n                            });\n                        }\n                    }\n                });\n            }\n            if (supertypes_1 && supertypes_1.size) {\n                supertypes_1.forEach(function (supertype) {\n                    var _a = _this.getTypePolicy(supertype), fields = _a.fields, rest = __rest(_a, [\"fields\"]);\n                    Object.assign(policy_1, rest);\n                    Object.assign(policy_1.fields, fields);\n                });\n            }\n        }\n        var 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(function (policy) {\n                _this.updateTypePolicy(typename, policy);\n            });\n        }\n        return this.typePolicies[typename];\n    };\n    Policies.prototype.getFieldPolicy = function (typename, fieldName, createIfMissing) {\n        if (typename) {\n            var fieldPolicies = this.getTypePolicy(typename).fields;\n            return (fieldPolicies[fieldName] ||\n                (createIfMissing && (fieldPolicies[fieldName] = Object.create(null))));\n        }\n    };\n    Policies.prototype.getSupertypeSet = function (subtype, createIfMissing) {\n        var supertypeSet = this.supertypeMap.get(subtype);\n        if (!supertypeSet && createIfMissing) {\n            this.supertypeMap.set(subtype, (supertypeSet = new Set()));\n        }\n        return supertypeSet;\n    };\n    Policies.prototype.fragmentMatches = function (fragment, typename, result, variables) {\n        var _this = this;\n        if (!fragment.typeCondition)\n            return true;\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)\n            return false;\n        var supertype = fragment.typeCondition.name.value;\n        // Common case: fragment type condition and __typename are the same.\n        if (typename === supertype)\n            return true;\n        if (this.usingPossibleTypes && this.supertypeMap.has(supertype)) {\n            var typenameSupertypeSet = this.getSupertypeSet(typename, true);\n            var workQueue_1 = [typenameSupertypeSet];\n            var maybeEnqueue_1 = function (subtype) {\n                var supertypeSet = _this.getSupertypeSet(subtype, false);\n                if (supertypeSet &&\n                    supertypeSet.size &&\n                    workQueue_1.indexOf(supertypeSet) < 0) {\n                    workQueue_1.push(supertypeSet);\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            var needToCheckFuzzySubtypes = !!(result && this.fuzzySubtypes.size);\n            var checkingFuzzySubtypes = false;\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 (var i = 0; i < workQueue_1.length; ++i) {\n                var supertypeSet = workQueue_1[i];\n                if (supertypeSet.has(supertype)) {\n                    if (!typenameSupertypeSet.has(supertype)) {\n                        if (checkingFuzzySubtypes) {\n                            globalThis.__DEV__ !== false && invariant.warn(6, typename, 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                supertypeSet.forEach(maybeEnqueue_1);\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_1.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                    // 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(function (regExp, fuzzyString) {\n                        var match = typename.match(regExp);\n                        if (match && match[0] === typename) {\n                            maybeEnqueue_1(fuzzyString);\n                        }\n                    });\n                }\n            }\n        }\n        return false;\n    };\n    Policies.prototype.hasKeyArgs = function (typename, fieldName) {\n        var policy = this.getFieldPolicy(typename, fieldName, false);\n        return !!(policy && policy.keyFn);\n    };\n    Policies.prototype.getStoreFieldName = function (fieldSpec) {\n        var typename = fieldSpec.typename, fieldName = fieldSpec.fieldName;\n        var policy = this.getFieldPolicy(typename, fieldName, false);\n        var storeFieldName;\n        var keyFn = policy && policy.keyFn;\n        if (keyFn && typename) {\n            var context = {\n                typename: typename,\n                fieldName: fieldName,\n                field: fieldSpec.field || null,\n                variables: fieldSpec.variables,\n            };\n            var args = argsFromFieldSpecifier(fieldSpec);\n            while (keyFn) {\n                var specifierOrString = keyFn(args, context);\n                if (isArray(specifierOrString)) {\n                    keyFn = keyArgsFnFromSpecifier(specifierOrString);\n                }\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        if (storeFieldName === void 0) {\n            storeFieldName =\n                fieldSpec.field ?\n                    storeKeyNameFromField(fieldSpec.field, fieldSpec.variables)\n                    : getStoreKeyName(fieldName, argsFromFieldSpecifier(fieldSpec));\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        // 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) ? storeFieldName\n            : fieldName + \":\" + storeFieldName;\n    };\n    Policies.prototype.readField = function (options, context) {\n        var objectOrReference = options.from;\n        if (!objectOrReference)\n            return;\n        var nameOrField = options.field || options.fieldName;\n        if (!nameOrField)\n            return;\n        if (options.typename === void 0) {\n            var typename = context.store.getFieldValue(objectOrReference, \"__typename\");\n            if (typename)\n                options.typename = typename;\n        }\n        var storeFieldName = this.getStoreFieldName(options);\n        var fieldName = fieldNameFromStoreName(storeFieldName);\n        var existing = context.store.getFieldValue(objectOrReference, storeFieldName);\n        var policy = this.getFieldPolicy(options.typename, fieldName, false);\n        var read = policy && policy.read;\n        if (read) {\n            var readOptions = makeFieldFunctionOptions(this, objectOrReference, options, context, context.store.getStorage(isReference(objectOrReference) ?\n                objectOrReference.__ref\n                : objectOrReference, storeFieldName));\n            // Call read(existing, readOptions) with cacheSlot holding this.cache.\n            return cacheSlot.withValue(this.cache, read, [\n                existing,\n                readOptions,\n            ]);\n        }\n        return existing;\n    };\n    Policies.prototype.getReadFunction = function (typename, fieldName) {\n        var policy = this.getFieldPolicy(typename, fieldName, false);\n        return policy && policy.read;\n    };\n    Policies.prototype.getMergeFunction = function (parentTypename, fieldName, childTypename) {\n        var policy = this.getFieldPolicy(parentTypename, fieldName, false);\n        var merge = policy && policy.merge;\n        if (!merge && childTypename) {\n            policy = this.getTypePolicy(childTypename);\n            merge = policy && policy.merge;\n        }\n        return merge;\n    };\n    Policies.prototype.runMergeFunction = function (existing, incoming, _a, context, storage) {\n        var field = _a.field, typename = _a.typename, merge = _a.merge;\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(context.store)(existing, incoming);\n        }\n        if (merge === mergeFalseFn) {\n            // Likewise for mergeFalseFn, whose implementation is even simpler.\n            return incoming;\n        }\n        // If cache.writeQuery or cache.writeFragment was called with\n        // options.overwrite set to true, we still call merge functions, but\n        // the existing data is always undefined, so the merge function will\n        // not attempt to combine the incoming data with the existing data.\n        if (context.overwrite) {\n            existing = void 0;\n        }\n        return merge(existing, incoming, makeFieldFunctionOptions(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: typename,\n            fieldName: field.name.value,\n            field: field,\n            variables: context.variables,\n        }, context, storage || Object.create(null)));\n    };\n    return Policies;\n}());\nexport { Policies };\nfunction makeFieldFunctionOptions(policies, objectOrReference, fieldSpec, context, storage) {\n    var storeFieldName = policies.getStoreFieldName(fieldSpec);\n    var fieldName = fieldNameFromStoreName(storeFieldName);\n    var variables = fieldSpec.variables || context.variables;\n    var _a = context.store, toReference = _a.toReference, canRead = _a.canRead;\n    return {\n        args: argsFromFieldSpecifier(fieldSpec),\n        field: fieldSpec.field || null,\n        fieldName: fieldName,\n        storeFieldName: storeFieldName,\n        variables: variables,\n        isReference: isReference,\n        toReference: toReference,\n        storage: storage,\n        cache: policies.cache,\n        canRead: canRead,\n        readField: function () {\n            return policies.readField(normalizeReadFieldOptions(arguments, objectOrReference, variables), context);\n        },\n        mergeObjects: makeMergeObjectsFunction(context.store),\n    };\n}\nexport function normalizeReadFieldOptions(readFieldArgs, objectOrReference, variables) {\n    var fieldNameOrOptions = readFieldArgs[0], from = readFieldArgs[1], argc = readFieldArgs.length;\n    var options;\n    if (typeof fieldNameOrOptions === \"string\") {\n        options = {\n            fieldName: fieldNameOrOptions,\n            // Default to objectOrReference only when no second argument was\n            // passed for the from parameter, not when undefined is explicitly\n            // passed as the second argument.\n            from: argc > 1 ? from : objectOrReference,\n        };\n    }\n    else {\n        options = __assign({}, fieldNameOrOptions);\n        // Default to objectOrReference only when fieldNameOrOptions.from is\n        // actually omitted, rather than just undefined.\n        if (!hasOwn.call(options, \"from\")) {\n            options.from = objectOrReference;\n        }\n    }\n    if (globalThis.__DEV__ !== false && options.from === void 0) {\n        globalThis.__DEV__ !== false && invariant.warn(7, stringifyForDisplay(Array.from(readFieldArgs)));\n    }\n    if (void 0 === options.variables) {\n        options.variables = variables;\n    }\n    return options;\n}\nfunction makeMergeObjectsFunction(store) {\n    return function mergeObjects(existing, incoming) {\n        if (isArray(existing) || isArray(incoming)) {\n            throw newInvariantError(8);\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 (isNonNullObject(existing) && isNonNullObject(incoming)) {\n            var eType = store.getFieldValue(existing, \"__typename\");\n            var iType = store.getFieldValue(incoming, \"__typename\");\n            var typesDiffer = eType && iType && eType !== iType;\n            if (typesDiffer) {\n                return incoming;\n            }\n            if (isReference(existing) && storeValueIsStoreObject(incoming)) {\n                // Update the normalized EntityStore for the entity identified by\n                // existing.__ref, preferring/overwriting any fields contributed by the\n                // newer incoming StoreObject.\n                store.merge(existing.__ref, incoming);\n                return existing;\n            }\n            if (storeValueIsStoreObject(existing) && isReference(incoming)) {\n                // Update the normalized EntityStore for the entity identified by\n                // incoming.__ref, taking fields from the older existing object only if\n                // those fields are not already present in the newer StoreObject\n                // identified by incoming.__ref.\n                store.merge(existing, incoming.__ref);\n                return incoming;\n            }\n            if (storeValueIsStoreObject(existing) &&\n                storeValueIsStoreObject(incoming)) {\n                return __assign(__assign({}, existing), incoming);\n            }\n        }\n        return incoming;\n    };\n}\n//# sourceMappingURL=policies.js.map","import { __assign } from \"tslib\";\nimport { invariant, newInvariantError } from \"../../utilities/globals/index.js\";\nimport { equal } from \"@wry/equality\";\nimport { Trie } from \"@wry/trie\";\nimport { Kind } from \"graphql\";\nimport { getFragmentFromSelection, getDefaultValues, getOperationDefinition, getTypenameFromResult, makeReference, isField, resultKeyNameFromField, isReference, shouldInclude, cloneDeep, addTypenameToDocument, isNonEmptyArray, argumentsObjectFromField, canonicalStringify, } from \"../../utilities/index.js\";\nimport { isArray, makeProcessedFieldsMerger, fieldNameFromStoreName, storeValueIsStoreObject, extractFragmentContext, } from \"./helpers.js\";\nimport { normalizeReadFieldOptions } from \"./policies.js\";\n// Since there are only four possible combinations of context.clientOnly and\n// context.deferred values, we should need at most four \"flavors\" of any given\n// WriteContext. To avoid creating multiple copies of the same context, we cache\n// the contexts in the context.flavors Map (shared by all flavors) according to\n// their clientOnly and deferred values (always in that order).\nfunction getContextFlavor(context, clientOnly, deferred) {\n    var key = \"\".concat(clientOnly).concat(deferred);\n    var flavored = context.flavors.get(key);\n    if (!flavored) {\n        context.flavors.set(key, (flavored =\n            context.clientOnly === clientOnly && context.deferred === deferred ?\n                context\n                : __assign(__assign({}, context), { clientOnly: clientOnly, deferred: deferred })));\n    }\n    return flavored;\n}\nvar StoreWriter = /** @class */ (function () {\n    function StoreWriter(cache, reader, fragments) {\n        this.cache = cache;\n        this.reader = reader;\n        this.fragments = fragments;\n    }\n    StoreWriter.prototype.writeToStore = function (store, _a) {\n        var _this = this;\n        var query = _a.query, result = _a.result, dataId = _a.dataId, variables = _a.variables, overwrite = _a.overwrite;\n        var operationDefinition = getOperationDefinition(query);\n        var merger = makeProcessedFieldsMerger();\n        variables = __assign(__assign({}, getDefaultValues(operationDefinition)), variables);\n        var context = __assign(__assign({ store: store, written: Object.create(null), merge: function (existing, incoming) {\n                return merger.merge(existing, incoming);\n            }, variables: variables, varString: canonicalStringify(variables) }, extractFragmentContext(query, this.fragments)), { overwrite: !!overwrite, incomingById: new Map(), clientOnly: false, deferred: false, flavors: new Map() });\n        var ref = this.processSelectionSet({\n            result: result || Object.create(null),\n            dataId: dataId,\n            selectionSet: operationDefinition.selectionSet,\n            mergeTree: { map: new Map() },\n            context: context,\n        });\n        if (!isReference(ref)) {\n            throw newInvariantError(11, result);\n        }\n        // So far, the store has not been modified, so now it's time to process\n        // context.incomingById and merge those incoming fields into context.store.\n        context.incomingById.forEach(function (_a, dataId) {\n            var storeObject = _a.storeObject, mergeTree = _a.mergeTree, fieldNodeSet = _a.fieldNodeSet;\n            var entityRef = makeReference(dataId);\n            if (mergeTree && mergeTree.map.size) {\n                var applied = _this.applyMerges(mergeTree, entityRef, storeObject, context);\n                if (isReference(applied)) {\n                    // Assume References returned by applyMerges have already been merged\n                    // into the store. See makeMergeObjectsFunction in policies.ts for an\n                    // example of how this can happen.\n                    return;\n                }\n                // Otherwise, applyMerges returned a StoreObject, whose fields we should\n                // merge into the store (see store.merge statement below).\n                storeObject = applied;\n            }\n            if (globalThis.__DEV__ !== false && !context.overwrite) {\n                var fieldsWithSelectionSets_1 = Object.create(null);\n                fieldNodeSet.forEach(function (field) {\n                    if (field.selectionSet) {\n                        fieldsWithSelectionSets_1[field.name.value] = true;\n                    }\n                });\n                var hasSelectionSet_1 = function (storeFieldName) {\n                    return fieldsWithSelectionSets_1[fieldNameFromStoreName(storeFieldName)] ===\n                        true;\n                };\n                var hasMergeFunction_1 = function (storeFieldName) {\n                    var childTree = mergeTree && mergeTree.map.get(storeFieldName);\n                    return Boolean(childTree && childTree.info && childTree.info.merge);\n                };\n                Object.keys(storeObject).forEach(function (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_1(storeFieldName) &&\n                        !hasMergeFunction_1(storeFieldName)) {\n                        warnAboutDataLoss(entityRef, storeObject, storeFieldName, context.store);\n                    }\n                });\n            }\n            store.merge(dataId, storeObject);\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        return ref;\n    };\n    StoreWriter.prototype.processSelectionSet = function (_a) {\n        var _this = this;\n        var dataId = _a.dataId, result = _a.result, selectionSet = _a.selectionSet, context = _a.context, \n        // This object allows processSelectionSet to report useful information\n        // to its callers without explicitly returning that information.\n        mergeTree = _a.mergeTree;\n        var policies = this.cache.policies;\n        // This variable will be repeatedly updated using context.merge to\n        // accumulate all fields that need to be written into the store.\n        var incoming = Object.create(null);\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        var typename = (dataId && policies.rootTypenamesById[dataId]) ||\n            getTypenameFromResult(result, selectionSet, context.fragmentMap) ||\n            (dataId && context.store.get(dataId, \"__typename\"));\n        if (\"string\" === typeof typename) {\n            incoming.__typename = typename;\n        }\n        // This readField function will be passed as context.readField in the\n        // KeyFieldsContext object created within policies.identify (called below).\n        // In addition to reading from the existing context.store (thanks to the\n        // policies.readField(options, context) line at the very bottom), this\n        // version of readField can read from Reference objects that are currently\n        // pending in context.incomingById, which is important whenever keyFields\n        // need to be extracted from a child object that processSelectionSet has\n        // turned into a Reference.\n        var readField = function () {\n            var options = normalizeReadFieldOptions(arguments, incoming, context.variables);\n            if (isReference(options.from)) {\n                var info = context.incomingById.get(options.from.__ref);\n                if (info) {\n                    var result_1 = policies.readField(__assign(__assign({}, options), { from: info.storeObject }), context);\n                    if (result_1 !== void 0) {\n                        return result_1;\n                    }\n                }\n            }\n            return policies.readField(options, context);\n        };\n        var fieldNodeSet = new Set();\n        this.flattenFields(selectionSet, result, \n        // This WriteContext will be the default context value for fields returned\n        // by the flattenFields method, but some fields may be assigned a modified\n        // context, depending on the presence of @client and other directives.\n        context, typename).forEach(function (context, field) {\n            var _a;\n            var resultFieldKey = resultKeyNameFromField(field);\n            var value = result[resultFieldKey];\n            fieldNodeSet.add(field);\n            if (value !== void 0) {\n                var storeFieldName = policies.getStoreFieldName({\n                    typename: typename,\n                    fieldName: field.name.value,\n                    field: field,\n                    variables: context.variables,\n                });\n                var childTree = getChildMergeTree(mergeTree, storeFieldName);\n                var incomingValue = _this.processFieldValue(value, field, \n                // Reset context.clientOnly and context.deferred to their default\n                // values before processing nested selection sets.\n                field.selectionSet ?\n                    getContextFlavor(context, false, false)\n                    : context, childTree);\n                // To determine if this field holds a child object with a merge function\n                // defined in its type policy (see PR #7070), we need to figure out the\n                // child object's __typename.\n                var childTypename = void 0;\n                // The field's value can be an object that has a __typename only if the\n                // field has a selection set. Otherwise incomingValue is scalar.\n                if (field.selectionSet &&\n                    (isReference(incomingValue) || storeValueIsStoreObject(incomingValue))) {\n                    childTypename = readField(\"__typename\", incomingValue);\n                }\n                var merge = policies.getMergeFunction(typename, field.name.value, childTypename);\n                if (merge) {\n                    childTree.info = {\n                        // TODO Check compatibility against any existing childTree.field?\n                        field: field,\n                        typename: typename,\n                        merge: merge,\n                    };\n                }\n                else {\n                    maybeRecycleChildMergeTree(mergeTree, storeFieldName);\n                }\n                incoming = context.merge(incoming, (_a = {},\n                    _a[storeFieldName] = incomingValue,\n                    _a));\n            }\n            else if (globalThis.__DEV__ !== false &&\n                !context.clientOnly &&\n                !context.deferred &&\n                !addTypenameToDocument.added(field) &&\n                // If the field has a read function, it may be a synthetic field or\n                // provide a default value, so its absence from the written data should\n                // not be cause for alarm.\n                !policies.getReadFunction(typename, field.name.value)) {\n                globalThis.__DEV__ !== false && invariant.error(12, resultKeyNameFromField(field), result);\n            }\n        });\n        // Identify the result object, even if dataId was already provided,\n        // since we always need keyObject below.\n        try {\n            var _b = policies.identify(result, {\n                typename: typename,\n                selectionSet: selectionSet,\n                fragmentMap: context.fragmentMap,\n                storeObject: incoming,\n                readField: readField,\n            }), id = _b[0], keyObject = _b[1];\n            // If dataId was not provided, fall back to the id just generated by\n            // policies.identify.\n            dataId = dataId || id;\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                // TODO Reverse the order of the arguments?\n                incoming = context.merge(incoming, keyObject);\n            }\n        }\n        catch (e) {\n            // If dataId was provided, tolerate failure of policies.identify.\n            if (!dataId)\n                throw e;\n        }\n        if (\"string\" === typeof dataId) {\n            var dataRef = makeReference(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            var sets = context.written[dataId] || (context.written[dataId] = []);\n            if (sets.indexOf(selectionSet) >= 0)\n                return dataRef;\n            sets.push(selectionSet);\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 &&\n                this.reader.isFresh(result, dataRef, selectionSet, context)) {\n                return dataRef;\n            }\n            var previous_1 = context.incomingById.get(dataId);\n            if (previous_1) {\n                previous_1.storeObject = context.merge(previous_1.storeObject, incoming);\n                previous_1.mergeTree = mergeMergeTrees(previous_1.mergeTree, mergeTree);\n                fieldNodeSet.forEach(function (field) { return previous_1.fieldNodeSet.add(field); });\n            }\n            else {\n                context.incomingById.set(dataId, {\n                    storeObject: incoming,\n                    // Save a reference to mergeTree only if it is not empty, because\n                    // empty MergeTrees may be recycled by maybeRecycleChildMergeTree and\n                    // reused for entirely different parts of the result tree.\n                    mergeTree: mergeTreeIsEmpty(mergeTree) ? void 0 : mergeTree,\n                    fieldNodeSet: fieldNodeSet,\n                });\n            }\n            return dataRef;\n        }\n        return incoming;\n    };\n    StoreWriter.prototype.processFieldValue = function (value, field, context, mergeTree) {\n        var _this = this;\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 globalThis.__DEV__ !== false ? cloneDeep(value) : value;\n        }\n        if (isArray(value)) {\n            return value.map(function (item, i) {\n                var value = _this.processFieldValue(item, field, context, getChildMergeTree(mergeTree, i));\n                maybeRecycleChildMergeTree(mergeTree, i);\n                return value;\n            });\n        }\n        return this.processSelectionSet({\n            result: value,\n            selectionSet: field.selectionSet,\n            context: context,\n            mergeTree: mergeTree,\n        });\n    };\n    // Implements https://spec.graphql.org/draft/#sec-Field-Collection, but with\n    // some additions for tracking @client and @defer directives.\n    StoreWriter.prototype.flattenFields = function (selectionSet, result, context, typename) {\n        if (typename === void 0) { typename = getTypenameFromResult(result, selectionSet, context.fragmentMap); }\n        var fieldMap = new Map();\n        var policies = this.cache.policies;\n        var limitingTrie = new Trie(false); // No need for WeakMap, since limitingTrie does not escape.\n        (function flatten(selectionSet, inheritedContext) {\n            var visitedNode = limitingTrie.lookup(selectionSet, \n            // Because we take inheritedClientOnly and inheritedDeferred into\n            // consideration here (in addition to selectionSet), it's possible for\n            // the same selection set to be flattened more than once, if it appears\n            // in the query with different @client and/or @directive configurations.\n            inheritedContext.clientOnly, inheritedContext.deferred);\n            if (visitedNode.visited)\n                return;\n            visitedNode.visited = true;\n            selectionSet.selections.forEach(function (selection) {\n                if (!shouldInclude(selection, context.variables))\n                    return;\n                var clientOnly = inheritedContext.clientOnly, deferred = inheritedContext.deferred;\n                if (\n                // Since the presence of @client or @defer on this field can only\n                // cause clientOnly or deferred to become true, we can skip the\n                // forEach loop if both clientOnly and deferred are already true.\n                !(clientOnly && deferred) &&\n                    isNonEmptyArray(selection.directives)) {\n                    selection.directives.forEach(function (dir) {\n                        var name = dir.name.value;\n                        if (name === \"client\")\n                            clientOnly = true;\n                        if (name === \"defer\") {\n                            var args = argumentsObjectFromField(dir, context.variables);\n                            // The @defer directive takes an optional args.if boolean\n                            // argument, similar to @include(if: boolean). Note that\n                            // @defer(if: false) does not make context.deferred false, but\n                            // instead behaves as if there was no @defer directive.\n                            if (!args || args.if !== false) {\n                                deferred = true;\n                            }\n                            // TODO In the future, we may want to record args.label using\n                            // context.deferred, if a label is specified.\n                        }\n                    });\n                }\n                if (isField(selection)) {\n                    var existing = fieldMap.get(selection);\n                    if (existing) {\n                        // If this field has been visited along another recursive path\n                        // before, the final context should have clientOnly or deferred set\n                        // to true only if *all* paths have the directive (hence the &&).\n                        clientOnly = clientOnly && existing.clientOnly;\n                        deferred = deferred && existing.deferred;\n                    }\n                    fieldMap.set(selection, getContextFlavor(context, clientOnly, deferred));\n                }\n                else {\n                    var fragment = getFragmentFromSelection(selection, context.lookupFragment);\n                    if (!fragment && selection.kind === Kind.FRAGMENT_SPREAD) {\n                        throw newInvariantError(13, selection.name.value);\n                    }\n                    if (fragment &&\n                        policies.fragmentMatches(fragment, typename, result, context.variables)) {\n                        flatten(fragment.selectionSet, getContextFlavor(context, clientOnly, deferred));\n                    }\n                }\n            });\n        })(selectionSet, context);\n        return fieldMap;\n    };\n    StoreWriter.prototype.applyMerges = function (mergeTree, existing, incoming, context, getStorageArgs) {\n        var _a;\n        var _this = this;\n        if (mergeTree.map.size && !isReference(incoming)) {\n            var e_1 = \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            (!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\n                : void 0;\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            var i_1 = incoming;\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_1 && !getStorageArgs) {\n                getStorageArgs = [isReference(e_1) ? e_1.__ref : e_1];\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            var changedFields_1;\n            var getValue_1 = function (from, name) {\n                return (isArray(from) ?\n                    typeof name === \"number\" ?\n                        from[name]\n                        : void 0\n                    : context.store.getFieldValue(from, String(name)));\n            };\n            mergeTree.map.forEach(function (childTree, storeFieldName) {\n                var eVal = getValue_1(e_1, storeFieldName);\n                var iVal = getValue_1(i_1, storeFieldName);\n                // If we have no incoming data, leave any existing data untouched.\n                if (void 0 === iVal)\n                    return;\n                if (getStorageArgs) {\n                    getStorageArgs.push(storeFieldName);\n                }\n                var aVal = _this.applyMerges(childTree, eVal, iVal, context, getStorageArgs);\n                if (aVal !== iVal) {\n                    changedFields_1 = changedFields_1 || new Map();\n                    changedFields_1.set(storeFieldName, aVal);\n                }\n                if (getStorageArgs) {\n                    invariant(getStorageArgs.pop() === storeFieldName);\n                }\n            });\n            if (changedFields_1) {\n                // Shallow clone i so we can add changed fields to it.\n                incoming = (isArray(i_1) ? i_1.slice(0) : __assign({}, i_1));\n                changedFields_1.forEach(function (value, name) {\n                    incoming[name] = value;\n                });\n            }\n        }\n        if (mergeTree.info) {\n            return this.cache.policies.runMergeFunction(existing, incoming, mergeTree.info, context, getStorageArgs && (_a = context.store).getStorage.apply(_a, getStorageArgs));\n        }\n        return incoming;\n    };\n    return StoreWriter;\n}());\nexport { StoreWriter };\nvar emptyMergeTreePool = [];\nfunction getChildMergeTree(_a, name) {\n    var map = _a.map;\n    if (!map.has(name)) {\n        map.set(name, emptyMergeTreePool.pop() || { map: new Map() });\n    }\n    return map.get(name);\n}\nfunction mergeMergeTrees(left, right) {\n    if (left === right || !right || mergeTreeIsEmpty(right))\n        return left;\n    if (!left || mergeTreeIsEmpty(left))\n        return right;\n    var info = left.info && right.info ? __assign(__assign({}, left.info), right.info) : left.info || right.info;\n    var needToMergeMaps = left.map.size && right.map.size;\n    var map = needToMergeMaps ? new Map()\n        : left.map.size ? left.map\n            : right.map;\n    var merged = { info: info, map: map };\n    if (needToMergeMaps) {\n        var remainingRightKeys_1 = new Set(right.map.keys());\n        left.map.forEach(function (leftTree, key) {\n            merged.map.set(key, mergeMergeTrees(leftTree, right.map.get(key)));\n            remainingRightKeys_1.delete(key);\n        });\n        remainingRightKeys_1.forEach(function (key) {\n            merged.map.set(key, mergeMergeTrees(right.map.get(key), left.map.get(key)));\n        });\n    }\n    return merged;\n}\nfunction mergeTreeIsEmpty(tree) {\n    return !tree || !(tree.info || tree.map.size);\n}\nfunction maybeRecycleChildMergeTree(_a, name) {\n    var map = _a.map;\n    var childTree = map.get(name);\n    if (childTree && mergeTreeIsEmpty(childTree)) {\n        emptyMergeTreePool.push(childTree);\n        map.delete(name);\n    }\n}\nvar warnings = new Set();\n// Note that this function is unused in production, and thus should be\n// pruned by any well-configured minifier.\nfunction warnAboutDataLoss(existingRef, incomingObj, storeFieldName, store) {\n    var getChild = function (objOrRef) {\n        var child = store.getFieldValue(objOrRef, storeFieldName);\n        return typeof child === \"object\" && child;\n    };\n    var existing = getChild(existingRef);\n    if (!existing)\n        return;\n    var incoming = getChild(incomingObj);\n    if (!incoming)\n        return;\n    // It's always safe to replace a reference, since it refers to data\n    // safely stored elsewhere.\n    if (isReference(existing))\n        return;\n    // If the values are structurally equivalent, we do not need to worry\n    // about incoming replacing existing.\n    if (equal(existing, incoming))\n        return;\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(function (key) { return store.getFieldValue(incoming, key) !== void 0; })) {\n        return;\n    }\n    var parentType = store.getFieldValue(existingRef, \"__typename\") ||\n        store.getFieldValue(incomingObj, \"__typename\");\n    var fieldName = fieldNameFromStoreName(storeFieldName);\n    var typeDotName = \"\".concat(parentType, \".\").concat(fieldName);\n    // Avoid warning more than once for the same type and field name.\n    if (warnings.has(typeDotName))\n        return;\n    warnings.add(typeDotName);\n    var childTypenames = [];\n    // Arrays do not have __typename fields, and always need a custom merge\n    // function, even if their elements are normalized entities.\n    if (!isArray(existing) && !isArray(incoming)) {\n        [existing, incoming].forEach(function (child) {\n            var typename = store.getFieldValue(child, \"__typename\");\n            if (typeof typename === \"string\" && !childTypenames.includes(typename)) {\n                childTypenames.push(typename);\n            }\n        });\n    }\n    globalThis.__DEV__ !== false && invariant.warn(14, fieldName, parentType, childTypenames.length ?\n        \"either ensure all objects of type \" +\n            childTypenames.join(\" and \") +\n            \" have an ID or a custom merge function, or \"\n        : \"\", typeDotName, __assign({}, existing), __assign({}, incoming));\n}\n//# sourceMappingURL=writeToStore.js.map","import { __assign, __extends } from \"tslib\";\nimport { invariant } from \"../../utilities/globals/index.js\";\n// Make builtins like Map and Set safe to use with non-extensible objects.\nimport \"./fixPolyfills.js\";\nimport { wrap } from \"optimism\";\nimport { equal } from \"@wry/equality\";\nimport { ApolloCache } from \"../core/cache.js\";\nimport { MissingFieldError } from \"../core/types/common.js\";\nimport { addTypenameToDocument, isReference, DocumentTransform, canonicalStringify, print, cacheSizes, } from \"../../utilities/index.js\";\nimport { StoreReader } from \"./readFromStore.js\";\nimport { StoreWriter } from \"./writeToStore.js\";\nimport { EntityStore, supportsResultCaching } from \"./entityStore.js\";\nimport { makeVar, forgetCache, recallCache } from \"./reactiveVars.js\";\nimport { Policies } from \"./policies.js\";\nimport { hasOwn, normalizeConfig, shouldCanonizeResults } from \"./helpers.js\";\nimport { getInMemoryCacheMemoryInternals } from \"../../utilities/caching/getMemoryInternals.js\";\nvar InMemoryCache = /** @class */ (function (_super) {\n    __extends(InMemoryCache, _super);\n    function InMemoryCache(config) {\n        if (config === void 0) { config = {}; }\n        var _this = _super.call(this) || this;\n        _this.watches = new Set();\n        _this.addTypenameTransform = new DocumentTransform(addTypenameToDocument);\n        // Override the default value, since InMemoryCache result objects are frozen\n        // in development and expected to remain logically immutable in production.\n        _this.assumeImmutableResults = true;\n        _this.makeVar = makeVar;\n        _this.txCount = 0;\n        _this.config = normalizeConfig(config);\n        _this.addTypename = !!_this.config.addTypename;\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        _this.init();\n        return _this;\n    }\n    InMemoryCache.prototype.init = function () {\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        var rootStore = (this.data = new EntityStore.Root({\n            policies: this.policies,\n            resultCaching: this.config.resultCaching,\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 EntityStore Layer objects that terminates with the\n        // original this.data cache object.\n        this.optimisticData = rootStore.stump;\n        this.resetResultCache();\n    };\n    InMemoryCache.prototype.resetResultCache = function (resetResultIdentities) {\n        var _this = this;\n        var previousReader = this.storeReader;\n        var fragments = this.config.fragments;\n        // The StoreWriter is mostly stateless and so doesn't really need to be\n        // reset, but it does need to have its writer.storeReader reference updated,\n        // so it's simpler to update this.storeWriter as well.\n        this.storeWriter = new StoreWriter(this, (this.storeReader = new StoreReader({\n            cache: this,\n            addTypename: this.addTypename,\n            resultCacheMaxSize: this.config.resultCacheMaxSize,\n            canonizeResults: shouldCanonizeResults(this.config),\n            canon: resetResultIdentities ? void 0 : (previousReader && previousReader.canon),\n            fragments: fragments,\n        })), fragments);\n        this.maybeBroadcastWatch = wrap(function (c, options) {\n            return _this.broadcastWatch(c, options);\n        }, {\n            max: this.config.resultCacheMaxSize ||\n                cacheSizes[\"inMemoryCache.maybeBroadcastWatch\"] ||\n                5000 /* defaultCacheSizes[\"inMemoryCache.maybeBroadcastWatch\"] */,\n            makeCacheKey: function (c) {\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                var store = c.optimistic ? _this.optimisticData : _this.data;\n                if (supportsResultCaching(store)) {\n                    var optimistic = c.optimistic, id = c.id, variables = c.variables;\n                    return store.makeCacheKey(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, canonicalStringify({ optimistic: optimistic, id: id, variables: variables }));\n                }\n            },\n        });\n        // Since we have thrown away all the cached functions that depend on the\n        // CacheGroup dependencies maintained by EntityStore, we should also reset\n        // all CacheGroup dependency information.\n        new Set([this.data.group, this.optimisticData.group]).forEach(function (group) {\n            return group.resetCaching();\n        });\n    };\n    InMemoryCache.prototype.restore = function (data) {\n        this.init();\n        // Since calling this.init() discards/replaces the entire StoreReader, along\n        // with the result caches it maintains, this.data.replace(data) won't have\n        // to bother deleting the old data.\n        if (data)\n            this.data.replace(data);\n        return this;\n    };\n    InMemoryCache.prototype.extract = function (optimistic) {\n        if (optimistic === void 0) { optimistic = false; }\n        return (optimistic ? this.optimisticData : this.data).extract();\n    };\n    InMemoryCache.prototype.read = function (options) {\n        var \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        _a = options.returnPartialData, \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 = _a === void 0 ? false : _a;\n        try {\n            return (this.storeReader.diffQueryAgainstStore(__assign(__assign({}, options), { store: options.optimistic ? this.optimisticData : this.data, config: this.config, returnPartialData: returnPartialData })).result || null);\n        }\n        catch (e) {\n            if (e instanceof MissingFieldError) {\n                // Swallow MissingFieldError and return null, so callers do not need to\n                // worry about catching \"normal\" exceptions resulting from incomplete\n                // cache data. Unexpected errors will be re-thrown. If you need more\n                // information about which fields were missing, use cache.diff instead,\n                // and examine diffResult.missing.\n                return null;\n            }\n            throw e;\n        }\n    };\n    InMemoryCache.prototype.write = function (options) {\n        try {\n            ++this.txCount;\n            return this.storeWriter.writeToStore(this.data, options);\n        }\n        finally {\n            if (!--this.txCount && options.broadcast !== false) {\n                this.broadcastWatches();\n            }\n        }\n    };\n    InMemoryCache.prototype.modify = function (options) {\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        var store = ((options.optimistic) // Defaults to false.\n        ) ?\n            this.optimisticData\n            : this.data;\n        try {\n            ++this.txCount;\n            return store.modify(options.id || \"ROOT_QUERY\", options.fields);\n        }\n        finally {\n            if (!--this.txCount && options.broadcast !== false) {\n                this.broadcastWatches();\n            }\n        }\n    };\n    InMemoryCache.prototype.diff = function (options) {\n        return this.storeReader.diffQueryAgainstStore(__assign(__assign({}, options), { store: options.optimistic ? this.optimisticData : this.data, rootId: options.id || \"ROOT_QUERY\", config: this.config }));\n    };\n    InMemoryCache.prototype.watch = function (watch) {\n        var _this = this;\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 function () {\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            // 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    InMemoryCache.prototype.gc = function (options) {\n        var _a;\n        canonicalStringify.reset();\n        print.reset();\n        this.addTypenameTransform.resetCache();\n        (_a = this.config.fragments) === null || _a === void 0 ? void 0 : _a.resetCaches();\n        var ids = this.optimisticData.gc();\n        if (options && !this.txCount) {\n            if (options.resetResultCache) {\n                this.resetResultCache(options.resetResultIdentities);\n            }\n            else if (options.resetResultIdentities) {\n                this.storeReader.resetCanon();\n            }\n        }\n        return ids;\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    InMemoryCache.prototype.retain = function (rootId, optimistic) {\n        return (optimistic ? this.optimisticData : this.data).retain(rootId);\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    InMemoryCache.prototype.release = function (rootId, optimistic) {\n        return (optimistic ? this.optimisticData : this.data).release(rootId);\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    InMemoryCache.prototype.identify = function (object) {\n        if (isReference(object))\n            return object.__ref;\n        try {\n            return this.policies.identify(object)[0];\n        }\n        catch (e) {\n            globalThis.__DEV__ !== false && invariant.warn(e);\n        }\n    };\n    InMemoryCache.prototype.evict = function (options) {\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 = __assign(__assign({}, 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            // Pass this.data as a limit on the depth of the eviction, so evictions\n            // during optimistic updates (when this.data is temporarily set equal to\n            // this.optimisticData) do not escape their optimistic Layer.\n            return this.optimisticData.evict(options, this.data);\n        }\n        finally {\n            if (!--this.txCount && options.broadcast !== false) {\n                this.broadcastWatches();\n            }\n        }\n    };\n    InMemoryCache.prototype.reset = function (options) {\n        var _this = this;\n        this.init();\n        canonicalStringify.reset();\n        if (options && options.discardWatches) {\n            // Similar to what happens in the unsubscribe function returned by\n            // cache.watch, applied to all current watches.\n            this.watches.forEach(function (watch) { return _this.maybeBroadcastWatch.forget(watch); });\n            this.watches.clear();\n            forgetCache(this);\n        }\n        else {\n            // Calling this.init() above unblocks all maybeBroadcastWatch caching, so\n            // this.broadcastWatches() triggers a broadcast to every current watcher\n            // (letting them know their data is now missing). This default behavior is\n            // convenient because it means the watches do not have to be manually\n            // reestablished after resetting the cache. To prevent this broadcast and\n            // cancel all watches, pass true for options.discardWatches.\n            this.broadcastWatches();\n        }\n        return Promise.resolve();\n    };\n    InMemoryCache.prototype.removeOptimistic = function (idToRemove) {\n        var newOptimisticData = this.optimisticData.removeLayer(idToRemove);\n        if (newOptimisticData !== this.optimisticData) {\n            this.optimisticData = newOptimisticData;\n            this.broadcastWatches();\n        }\n    };\n    InMemoryCache.prototype.batch = function (options) {\n        var _this = this;\n        var update = options.update, _a = options.optimistic, optimistic = _a === void 0 ? true : _a, removeOptimistic = options.removeOptimistic, onWatchUpdated = options.onWatchUpdated;\n        var updateResult;\n        var perform = function (layer) {\n            var _a = _this, data = _a.data, optimisticData = _a.optimisticData;\n            ++_this.txCount;\n            if (layer) {\n                _this.data = _this.optimisticData = layer;\n            }\n            try {\n                return (updateResult = update(_this));\n            }\n            finally {\n                --_this.txCount;\n                _this.data = data;\n                _this.optimisticData = optimisticData;\n            }\n        };\n        var alreadyDirty = new Set();\n        if (onWatchUpdated && !this.txCount) {\n            // If an options.onWatchUpdated callback is provided, we want to call it\n            // with only the Cache.WatchOptions objects affected by options.update,\n            // but there might be dirty watchers already waiting to be broadcast that\n            // have nothing to do with the update. To prevent including those watchers\n            // in the post-update broadcast, we perform this initial broadcast to\n            // collect the dirty watchers, so we can re-dirty them later, after the\n            // post-update broadcast, allowing them to receive their pending\n            // broadcasts the next time broadcastWatches is called, just as they would\n            // if we never called cache.batch.\n            this.broadcastWatches(__assign(__assign({}, options), { onWatchUpdated: function (watch) {\n                    alreadyDirty.add(watch);\n                    return false;\n                } }));\n        }\n        if (typeof optimistic === \"string\") {\n            // Note that there can be multiple layers with the same optimistic ID.\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(optimistic, perform);\n        }\n        else if (optimistic === false) {\n            // Ensure both this.data and this.optimisticData refer to the root\n            // (non-optimistic) layer of the cache during the update. Note that\n            // this.data could be a Layer if we are currently executing an optimistic\n            // update function, but otherwise will always be an EntityStore.Root\n            // instance.\n            perform(this.data);\n        }\n        else {\n            // Otherwise, leave this.data and this.optimisticData unchanged and run\n            // the update with broadcast batching.\n            perform();\n        }\n        if (typeof removeOptimistic === \"string\") {\n            this.optimisticData = this.optimisticData.removeLayer(removeOptimistic);\n        }\n        // Note: if this.txCount > 0, then alreadyDirty.size === 0, so this code\n        // takes the else branch and calls this.broadcastWatches(options), which\n        // does nothing when this.txCount > 0.\n        if (onWatchUpdated && alreadyDirty.size) {\n            this.broadcastWatches(__assign(__assign({}, options), { onWatchUpdated: function (watch, diff) {\n                    var result = onWatchUpdated.call(this, watch, diff);\n                    if (result !== false) {\n                        // Since onWatchUpdated did not return false, this diff is\n                        // about to be broadcast to watch.callback, so we don't need\n                        // to re-dirty it with the other alreadyDirty watches below.\n                        alreadyDirty.delete(watch);\n                    }\n                    return result;\n                } }));\n            // Silently re-dirty any watches that were already dirty before the update\n            // was performed, and were not broadcast just now.\n            if (alreadyDirty.size) {\n                alreadyDirty.forEach(function (watch) { return _this.maybeBroadcastWatch.dirty(watch); });\n            }\n        }\n        else {\n            // If alreadyDirty is empty or we don't have an onWatchUpdated\n            // function, we don't need to go to the trouble of wrapping\n            // options.onWatchUpdated.\n            this.broadcastWatches(options);\n        }\n        return updateResult;\n    };\n    InMemoryCache.prototype.performTransaction = function (update, optimisticId) {\n        return this.batch({\n            update: update,\n            optimistic: optimisticId || optimisticId !== null,\n        });\n    };\n    InMemoryCache.prototype.transformDocument = function (document) {\n        return this.addTypenameToDocument(this.addFragmentsToDocument(document));\n    };\n    InMemoryCache.prototype.broadcastWatches = function (options) {\n        var _this = this;\n        if (!this.txCount) {\n            this.watches.forEach(function (c) { return _this.maybeBroadcastWatch(c, options); });\n        }\n    };\n    InMemoryCache.prototype.addFragmentsToDocument = function (document) {\n        var fragments = this.config.fragments;\n        return fragments ? fragments.transform(document) : document;\n    };\n    InMemoryCache.prototype.addTypenameToDocument = function (document) {\n        if (this.addTypename) {\n            return this.addTypenameTransform.transformDocument(document);\n        }\n        return document;\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    InMemoryCache.prototype.broadcastWatch = function (c, options) {\n        var lastDiff = c.lastDiff;\n        // Both WatchOptions and DiffOptions extend ReadOptions, and DiffOptions\n        // currently requires no additional properties, so we can use c (a\n        // WatchOptions object) as DiffOptions, without having to allocate a new\n        // object, and without having to enumerate the relevant properties (query,\n        // variables, etc.) explicitly. There will be some additional properties\n        // (lastDiff, callback, etc.), but cache.diff ignores them.\n        var diff = this.diff(c);\n        if (options) {\n            if (c.optimistic && typeof options.optimistic === \"string\") {\n                diff.fromOptimisticTransaction = true;\n            }\n            if (options.onWatchUpdated &&\n                options.onWatchUpdated.call(this, c, diff, lastDiff) === false) {\n                // Returning false from the onWatchUpdated callback will prevent\n                // calling c.callback(diff) for this watcher.\n                return;\n            }\n        }\n        if (!lastDiff || !equal(lastDiff.result, diff.result)) {\n            c.callback((c.lastDiff = diff), lastDiff);\n        }\n    };\n    return InMemoryCache;\n}(ApolloCache));\nexport { InMemoryCache };\nif (globalThis.__DEV__ !== false) {\n    InMemoryCache.prototype.getMemoryInternals = getInMemoryCacheMemoryInternals;\n}\n//# sourceMappingURL=inMemoryCache.js.map","import { __assign, __spreadArray } from \"tslib\";\nimport { visit } from \"graphql\";\nimport { wrap } from \"optimism\";\nimport { cacheSizes, getFragmentDefinitions, } from \"../../utilities/index.js\";\nimport { WeakCache } from \"@wry/caches\";\n// As long as createFragmentRegistry is not imported or used, the\n// FragmentRegistry example implementation provided below should not be bundled\n// (by tree-shaking bundlers like Rollup), because the implementation of\n// InMemoryCache refers only to the TypeScript interface FragmentRegistryAPI,\n// never the concrete implementation FragmentRegistry (which is deliberately not\n// exported from this module).\nexport function createFragmentRegistry() {\n    var fragments = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        fragments[_i] = arguments[_i];\n    }\n    return new (FragmentRegistry.bind.apply(FragmentRegistry, __spreadArray([void 0], fragments, false)))();\n}\nvar FragmentRegistry = /** @class */ (function () {\n    // Call `createFragmentRegistry` instead of invoking the\n    // FragmentRegistry constructor directly. This reserves the constructor for\n    // future configuration of the FragmentRegistry.\n    function FragmentRegistry() {\n        var fragments = [];\n        for (var _i = 0; _i < arguments.length; _i++) {\n            fragments[_i] = arguments[_i];\n        }\n        this.registry = Object.create(null);\n        this.resetCaches();\n        if (fragments.length) {\n            this.register.apply(this, fragments);\n        }\n    }\n    FragmentRegistry.prototype.register = function () {\n        var _this = this;\n        var fragments = [];\n        for (var _i = 0; _i < arguments.length; _i++) {\n            fragments[_i] = arguments[_i];\n        }\n        var definitions = new Map();\n        fragments.forEach(function (doc) {\n            getFragmentDefinitions(doc).forEach(function (node) {\n                definitions.set(node.name.value, node);\n            });\n        });\n        definitions.forEach(function (node, name) {\n            if (node !== _this.registry[name]) {\n                _this.registry[name] = node;\n                _this.invalidate(name);\n            }\n        });\n        return this;\n    };\n    // Overridden in the resetCaches method below.\n    FragmentRegistry.prototype.invalidate = function (name) { };\n    FragmentRegistry.prototype.resetCaches = function () {\n        var proto = FragmentRegistry.prototype;\n        this.invalidate = (this.lookup = wrap(proto.lookup.bind(this), {\n            makeCacheKey: function (arg) { return arg; },\n            max: cacheSizes[\"fragmentRegistry.lookup\"] ||\n                1000 /* defaultCacheSizes[\"fragmentRegistry.lookup\"] */,\n        })).dirty; // This dirty function is bound to the wrapped lookup method.\n        this.transform = wrap(proto.transform.bind(this), {\n            cache: WeakCache,\n            max: cacheSizes[\"fragmentRegistry.transform\"] ||\n                2000 /* defaultCacheSizes[\"fragmentRegistry.transform\"] */,\n        });\n        this.findFragmentSpreads = wrap(proto.findFragmentSpreads.bind(this), {\n            cache: WeakCache,\n            max: cacheSizes[\"fragmentRegistry.findFragmentSpreads\"] ||\n                4000 /* defaultCacheSizes[\"fragmentRegistry.findFragmentSpreads\"] */,\n        });\n    };\n    /*\n     * Note:\n     * This method is only memoized so it can serve as a dependency to `tranform`,\n     * so calling `invalidate` will invalidate cache entries for `transform`.\n     */\n    FragmentRegistry.prototype.lookup = function (fragmentName) {\n        return this.registry[fragmentName] || null;\n    };\n    FragmentRegistry.prototype.transform = function (document) {\n        var _this = this;\n        var defined = new Map();\n        getFragmentDefinitions(document).forEach(function (def) {\n            defined.set(def.name.value, def);\n        });\n        var unbound = new Set();\n        var enqueue = function (spreadName) {\n            if (!defined.has(spreadName)) {\n                unbound.add(spreadName);\n            }\n        };\n        var enqueueChildSpreads = function (node) {\n            return Object.keys(_this.findFragmentSpreads(node)).forEach(enqueue);\n        };\n        enqueueChildSpreads(document);\n        var missing = [];\n        var map = Object.create(null);\n        // This Set forEach loop can be extended during iteration by adding\n        // additional strings to the unbound set.\n        unbound.forEach(function (fragmentName) {\n            var knownFragmentDef = defined.get(fragmentName);\n            if (knownFragmentDef) {\n                enqueueChildSpreads((map[fragmentName] = knownFragmentDef));\n            }\n            else {\n                missing.push(fragmentName);\n                var def = _this.lookup(fragmentName);\n                if (def) {\n                    enqueueChildSpreads((map[fragmentName] = def));\n                }\n            }\n        });\n        if (missing.length) {\n            var defsToAppend_1 = [];\n            missing.forEach(function (name) {\n                var def = map[name];\n                if (def) {\n                    defsToAppend_1.push(def);\n                }\n            });\n            if (defsToAppend_1.length) {\n                document = __assign(__assign({}, document), { definitions: document.definitions.concat(defsToAppend_1) });\n            }\n        }\n        return document;\n    };\n    FragmentRegistry.prototype.findFragmentSpreads = function (root) {\n        var spreads = Object.create(null);\n        visit(root, {\n            FragmentSpread: function (node) {\n                spreads[node.name.value] = node;\n            },\n        });\n        return spreads;\n    };\n    return FragmentRegistry;\n}());\n//# sourceMappingURL=fragmentRegistry.js.map","/**\n * The current status of a query’s execution in our system.\n */\nexport var NetworkStatus;\n(function (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    NetworkStatus[NetworkStatus[\"loading\"] = 1] = \"loading\";\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    NetworkStatus[NetworkStatus[\"setVariables\"] = 2] = \"setVariables\";\n    /**\n     * Indicates that `fetchMore` was called on this query and that the query created is currently in\n     * flight.\n     */\n    NetworkStatus[NetworkStatus[\"fetchMore\"] = 3] = \"fetchMore\";\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    NetworkStatus[NetworkStatus[\"refetch\"] = 4] = \"refetch\";\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    NetworkStatus[NetworkStatus[\"poll\"] = 6] = \"poll\";\n    /**\n     * No request is in flight for this query, and no errors happened. Everything is OK.\n     */\n    NetworkStatus[NetworkStatus[\"ready\"] = 7] = \"ready\";\n    /**\n     * No request is in flight for this query, but one or more errors were detected.\n     */\n    NetworkStatus[NetworkStatus[\"error\"] = 8] = \"error\";\n})(NetworkStatus || (NetworkStatus = {}));\n/**\n * Returns true if there is currently a network request in flight according to a given network\n * status.\n */\nexport function isNetworkRequestInFlight(networkStatus) {\n    return networkStatus ? networkStatus < 7 : false;\n}\n/**\n * Returns true if the network request is in ready or error state according to a given network\n * status.\n */\nexport function isNetworkRequestSettled(networkStatus) {\n    return networkStatus === 7 || networkStatus === 8;\n}\n//# sourceMappingURL=networkStatus.js.map","import { __assign } from \"tslib\";\nimport { parse } from 'graphql';\nvar docCache = new Map();\nvar fragmentSourceMap = new Map();\nvar printFragmentWarnings = true;\nvar experimentalFragmentVariables = false;\nfunction normalize(string) {\n    return string.replace(/[\\s,]+/g, ' ').trim();\n}\nfunction cacheKeyFromLoc(loc) {\n    return normalize(loc.source.body.substring(loc.start, loc.end));\n}\nfunction processFragments(ast) {\n    var seenKeys = new Set();\n    var definitions = [];\n    ast.definitions.forEach(function (fragmentDefinition) {\n        if (fragmentDefinition.kind === 'FragmentDefinition') {\n            var fragmentName = fragmentDefinition.name.value;\n            var sourceKey = cacheKeyFromLoc(fragmentDefinition.loc);\n            var sourceKeySet = fragmentSourceMap.get(fragmentName);\n            if (sourceKeySet && !sourceKeySet.has(sourceKey)) {\n                if (printFragmentWarnings) {\n                    console.warn(\"Warning: fragment with name \" + fragmentName + \" already exists.\\n\"\n                        + \"graphql-tag enforces all fragment names across your application to be unique; read more about\\n\"\n                        + \"this in the docs: http://dev.apollodata.com/core/fragments.html#unique-names\");\n                }\n            }\n            else if (!sourceKeySet) {\n                fragmentSourceMap.set(fragmentName, sourceKeySet = new Set);\n            }\n            sourceKeySet.add(sourceKey);\n            if (!seenKeys.has(sourceKey)) {\n                seenKeys.add(sourceKey);\n                definitions.push(fragmentDefinition);\n            }\n        }\n        else {\n            definitions.push(fragmentDefinition);\n        }\n    });\n    return __assign(__assign({}, ast), { definitions: definitions });\n}\nfunction stripLoc(doc) {\n    var workSet = new Set(doc.definitions);\n    workSet.forEach(function (node) {\n        if (node.loc)\n            delete node.loc;\n        Object.keys(node).forEach(function (key) {\n            var value = node[key];\n            if (value && typeof value === 'object') {\n                workSet.add(value);\n            }\n        });\n    });\n    var loc = doc.loc;\n    if (loc) {\n        delete loc.startToken;\n        delete loc.endToken;\n    }\n    return doc;\n}\nfunction parseDocument(source) {\n    var cacheKey = normalize(source);\n    if (!docCache.has(cacheKey)) {\n        var parsed = parse(source, {\n            experimentalFragmentVariables: experimentalFragmentVariables,\n            allowLegacyFragmentVariables: experimentalFragmentVariables\n        });\n        if (!parsed || parsed.kind !== 'Document') {\n            throw new Error('Not a valid GraphQL document.');\n        }\n        docCache.set(cacheKey, stripLoc(processFragments(parsed)));\n    }\n    return docCache.get(cacheKey);\n}\nexport function gql(literals) {\n    var args = [];\n    for (var _i = 1; _i < arguments.length; _i++) {\n        args[_i - 1] = arguments[_i];\n    }\n    if (typeof literals === 'string') {\n        literals = [literals];\n    }\n    var result = literals[0];\n    args.forEach(function (arg, i) {\n        if (arg && arg.kind === 'Document') {\n            result += arg.loc.source.body;\n        }\n        else {\n            result += arg;\n        }\n        result += literals[i + 1];\n    });\n    return parseDocument(result);\n}\nexport function resetCaches() {\n    docCache.clear();\n    fragmentSourceMap.clear();\n}\nexport function disableFragmentWarnings() {\n    printFragmentWarnings = false;\n}\nexport function enableExperimentalFragmentVariables() {\n    experimentalFragmentVariables = true;\n}\nexport function disableExperimentalFragmentVariables() {\n    experimentalFragmentVariables = false;\n}\nvar extras = {\n    gql: gql,\n    resetCaches: resetCaches,\n    disableFragmentWarnings: disableFragmentWarnings,\n    enableExperimentalFragmentVariables: enableExperimentalFragmentVariables,\n    disableExperimentalFragmentVariables: disableExperimentalFragmentVariables\n};\n(function (gql_1) {\n    gql_1.gql = extras.gql, gql_1.resetCaches = extras.resetCaches, gql_1.disableFragmentWarnings = extras.disableFragmentWarnings, gql_1.enableExperimentalFragmentVariables = extras.enableExperimentalFragmentVariables, gql_1.disableExperimentalFragmentVariables = extras.disableExperimentalFragmentVariables;\n})(gql || (gql = {}));\ngql[\"default\"] = gql;\nexport default gql;\n//# sourceMappingURL=index.js.map","export default `\nfragment FollowedListFragment on followed_lists {\n  userId: user_id\n  listId: list_id\n}\n`;\n","export default `\nfragment FollowedPromptFragment on followed_prompts {\n  userId: user_id\n  promptId: prompt_id\n}\n`;\n","export default `\nfragment FollowedUserFragment on followed_users {\n  userId: user_id\n  followedUserId: followed_user_id\n}\n`;\n","export default `\nfragment UserBookStatusFragment on user_books {\n  bookId:book_id\n  userId:user_id\n  statusId:status_id\n}\n`;\n","export default `\n  fragment OwnerFragment on users {\n    id\n    image:cached_image\n    cover:cached_cover\n    name\n    username\n    flair\n    pro\n    bio\n    location\n    link\n    membership\n    admin\n    followersCount:followers_count\n    followedUsersCount:followed_users_count\n    accountPrivacySettingId:account_privacy_setting_id\n    statusId:status_id\n    createdAt:created_at\n    pronounPersonal:pronoun_personal\n    pronounPossessive:pronoun_possessive\n    onboarded\n    confirmedAt: confirmed_at\n    confirmationSentAt: confirmation_sent_at\n    email\n    unconfirmedEmail: unconfirmed_email\n    activityPrivacySettingsId:activity_privacy_settings_id\n    birthdate\n    booksCount:books_count\n    librarianRoles:librarian_roles\n\n    followedUsers: followed_users {\n      ...FollowedUserFragment @nonreactive\n    }\n    followedLists: followed_lists {\n      ...FollowedListFragment @nonreactive\n    }\n    followedPrompts: followed_prompts {\n      ...FollowedPromptFragment @nonreactive\n    }\n    userBooks: user_books @nonreactive {\n      ...UserBookStatusFragment @nonreactive\n    }\n\n    notifications: notification_deliveries_aggregate(\n      where: { channel_id: { _eq: 1 }, read: { _eq: false } }\n    ) {\n      aggregate {\n        count\n      }\n    }\n  }\n`;\n","export default `\nfragment UserBookReadFragment on user_book_reads {\n  id\n  userBookId:user_book_id\n  startedAt:started_at\n  finishedAt:finished_at\n  editionId:edition_id\n  progress\n  progressPages:progress_pages\n  progressSeconds:progress_seconds\n  edition {\n    ...EditionFragment\n  }\n}\n`;\n","export default `\nfragment EditionFragment on editions {\n  id\n  title\n  asin\n  isbn10:isbn_10\n  isbn13:isbn_13\n  releaseDate:release_date\n  releaseYear:release_year\n  pages\n  audioSeconds:audio_seconds\n  readingFormatId:reading_format_id\n  usersCount:users_count\n  image:cached_image\n  editionFormat:edition_format\n  editionInformation:edition_information\n  language {\n    id\n    language\n    code:code2\n  }\n  readingFormat:reading_format {\n    format\n  }\n  country {\n    name\n  }\n  publisher {\n    ...PublisherFragment\n  }\n}\n`;\n","export default `\nfragment PublisherFragment on publishers {\n  id\n  name\n  slug\n  state\n  editionsCount: editions_count\n  userId: user_id\n}\n`;\n","export default `\nfragment BookFragment on books {\n  id\n  slug\n  title\n  image:cached_image\n  headline\n  description\n  releaseDate:release_date\n  releaseYear:release_year\n  tags:cached_tags\n  usersCount:users_count\n  usersReadCount:users_read_count\n  journalsCount:journals_count\n  reviewsCount:reviews_count\n  pages\n  audioSeconds:audio_seconds\n  ratingsCount:ratings_count\n  rating\n  compilation\n  contributions {\n    contribution\n    author {\n      id\n      name\n      slug\n      image:cached_image\n      booksCount:books_count\n    }\n  }\n\n  bookSeries: book_series(\n    where: {\n      book: { book_status_id: { _eq: 1 } }\n      series: { canonical_id: { _is_null: true } }\n    }\n  ) {\n    ...BookSeriesFragment\n    series {\n      ...SeriesFragment\n    }\n  }\n}\n`;\n","export default `\nfragment BookSeriesFragment on book_series {\n  bookId: book_id\n  seriesId: series_id\n  position\n  details\n  featured\n}\n`;\n","export default `\nfragment SeriesFragment on series {\n  id\n  name\n  slug\n  booksCount:books_count\n  primaryBooksCount:primary_books_count\n  isCompleted:is_completed\n  description\n}\n`;\n","export default `\nfragment AuthorFragment on authors {\n  id\n  slug\n  name\n  bio\n  image:cached_image\n  bornDate:born_date\n  bornYear:born_year\n  deathDate:death_date\n  deathYear:death_year\n  links\n  booksCount:books_count\n  namePersonal:name_personal\n  location\n  isBipoc:is_bipoc\n  isLgbtq:is_lgbtq\n  aliasId:alias_id\n  genderId:gender_id\n  locked\n  imageId:image_id\n  createdByUserId:user_id\n  alias {\n    id\n    name\n    slug\n    image:cached_image\n  }\n}\n`;\n","export default `\n  fragment UserBylineFragment on users {\n    id\n    username\n    name\n    image:cached_image\n    cover:cached_cover\n    flair\n    booksCount: books_count\n    followersCount: followers_count\n    bio\n  }\n`;\n","export default `\n  fragment ListFragment on lists {\n    id\n    objectType:object_type\n    name\n    userId:user_id\n    slug\n    ranked\n    description\n    url\n    privacySettingId:privacy_setting_id\n    booksCount:books_count\n    likesCount:likes_count\n    featuredProfile:featured_profile\n    defaultView:default_view\n    createdAt: created_at\n    updatedAt: updated_at\n  }\n`;\n","export default `\n  fragment ListBookFragment on list_books {\n    id\n    listId:list_id\n    bookId:book_id\n    editionId:edition_id\n    position\n    reason\n  }\n`;\n","export default `\nfragment LikeFragment on likes {\n  likeableId: likeable_id,\n  likeableType: likeable_type\n  userId: user_id\n}\n`;\n","export default `\nfragment BookBylineFragment on books {\n  id\n  slug\n  title\n  rating\n  releaseDate:release_date\n  releaseYear:release_year\n  image:cached_image\n  usersCount:users_count\n  usersReadCount:users_read_count\n  compilation\n  contributions {\n    contribution\n    author {\n      name\n      slug\n      image:cached_image\n      booksCount:books_count\n    }\n  }\n}\n`;\n","export default `\n  fragment PromptFragment on prompts {\n    id\n    userId:user_id\n    createdAt:created_at\n    question\n    privacySettingId:privacy_setting_id\n    description\n    featured\n    usersCount:users_count\n    booksCount:books_count\n    answersCount:answers_count\n    slug\n  }\n`;\n","export default `\n  fragment AuthorBylineFragment on authors {\n    id\n    slug\n    name\n    booksCount:books_count\n    image:cached_image\n  }\n`;\n","export default `\n  fragment PromptAnswerFragment on prompt_answers {\n    id\n    createdAt:created_at\n    promptId:prompt_id\n    bookId:book_id\n    userId:user_id\n    description\n  }\n`;\n","export default `\n  fragment UserInfoFragment on users {\n    id\n    image:cached_image\n    cover:cached_cover\n    name\n    username\n    flair\n    membership\n    statusId:status_id\n    bio\n    birthdate\n    location\n    link\n    followersCount:followers_count\n    followedUsersCount:followed_users_count\n    accountPrivacySettingId:account_privacy_setting_id\n    activityPrivacySettingsId:activity_privacy_settings_id\n    statusId:status_id\n    createdAt: created_at\n    pronounPersonal:pronoun_personal\n    pronounPossessive:pronoun_possessive\n    booksCount:books_count\n    librarianRoles:librarian_roles\n    cachedGenres:cached_genres\n    onboarded\n    pro\n  }\n`;\n","export default `\n  fragment CollectionImportResultFragment on collection_import_results {\n    id\n    title\n    author\n    state\n    bookFoundMethod:book_found_method\n    report\n  }\n`;\n","export default `\nfragment MatchPercentageFragment on recommendations {\n  subjectType:subject_type\n  subjectId:subject_id\n  itemType:item_type\n  itemId:item_id\n  context\n  score\n}\n`;\n","export default `\n  fragment ReadingJournalSummaryFragment on reading_journals_summary {\n    userId:user_id\n    bookId:book_id\n    journalsCount:journals_count\n    lastUpdatedAtRaw:last_updated_at\n  }\n`;\n","export default `\n  fragment ReadingJournalFragment on reading_journals {\n    id\n    createdAtRaw:created_at\n    updatedAtRaw:updated_at\n    event\n    entry\n    userId:user_id\n    bookId:book_id\n    privacySettingId:privacy_setting_id\n    metadata\n    likesCount:likes_count\n    objectType:object_type\n\n    taggings {\n      ...TaggingFragment\n      tag {\n        ...TagFragment\n      }\n    }\n\n    edition {\n      ...EditionFragment\n    }\n\n    likes(limit: 5, order_by: { created_at: desc }) {\n      ...LikeFragment\n      user {\n        ...UserBylineFragment\n      }\n    }\n  }\n`;\n","export default `\nfragment UserBookFragment on user_books {\n  id\n  bookId: book_id\n  editionId: edition_id\n  userId: user_id\n  statusId: status_id\n  rating\n  privacySettingId: privacy_setting_id\n  hasReview: has_review\n\n  edition {\n    ...EditionFragment\n  }\n\n  datesRead:user_book_reads {\n    ...UserBookReadFragment\n  }\n}\n`;\n","export default `\n  fragment ActivityFragment on activities {\n    id\n    data\n    event\n    likesCount:likes_count\n    createdAt:created_at\n    userId:user_id\n    objectType:object_type\n  }\n`;\n","export default `\n  fragment GoalFragment on goals {\n    id\n    archived\n    userId:user_id\n    completedAt:completed_at\n    conditions\n    endDate:end_date\n    metric\n    progress\n    startDate:start_date\n    description\n    goal\n    privacySettingId:privacy_setting_id\n  }\n`;\n","export default `\n  fragment NotificationFragment on notifications {\n    id\n    title\n    link\n    linkText:link_text\n    description\n    priority\n    notificationTypeId: notification_type_id\n  }\n`;\n","export default `\n  fragment NotificationDeliveryFragment on notification_deliveries {\n    id\n    userId:user_id\n    notificationId:notification_id\n    read\n    readAt:read_at\n    sentAt:sent_at\n    channelId:channel_id\n  }\n`;\n","export default `\nfragment UserBlockFragment on user_blocks {\n  id\n  userId:user_id\n  blockedUserId:blocked_user_id\n}\n`;\n","export default `\nfragment TaggingFragment on taggings {\n  id\n  userId:user_id\n  tagId:tag_id\n  spoiler\n}\n`;\n","export default `\nfragment TagFragment on tags {\n  id\n  tag\n  count\n  slug\n  tagCategory:tag_category {\n    category\n    slug\n  }\n}\n`;\n","export default `\nfragment BookCharacterFragment on book_characters {\n  id\n  position\n  spoiler\n  onlyMentioned: only_mentioned\n  bookId: book_id\n  characterId: character_id\n}\n`;\n","export default `\nfragment CharacterFragment on characters {\n  id\n  name\n  biography\n  slug\n  state\n  genderId: gender_id\n  booksCount: books_count\n  userId: user_id\n  isLgbtq: is_lgbtq\n  isPoc: is_poc\n  hasDisability: has_disability\n}\n`;\n","export default `\n  fragment ListBylineFragment on lists {\n    id\n    name\n    slug\n    booksCount:books_count\n    likesCount:likes_count\n    privacySettingId:privacy_setting_id\n  }\n`;\n","export default `\n  fragment ImageFragment on images {\n    id\n    url\n    color\n    height\n    width\n    imageableId:imageable_id\n    imageableType:imageable_type\n  }\n`;\n","export default `\nfragment BookMappingFragment on book_mappings {\n  id\n  bookId: book_id\n  editionId:edition_id\n  platformId:platform_id\n  platform {\n    name\n  }\n  state\n  externalId:external_id\n  verifiedAt:verified_at\n  loadedAt:loaded_at\n  dtoExternal:dto_external\n}\n`;\n","export default `\nfragment EditEditionFragment on editions {\n  bookId: book_id\n  book {\n    ...BookFragment\n  }\n  id\n  title\n  isbn10: isbn_10\n  isbn13: isbn_13\n  releaseDate: release_date\n  pages\n  readingFormatId: reading_format_id\n  audioSeconds:audio_seconds\n  imageId:image_id\n  createdByUserId:created_by_user_id\n  language {\n    language\n  }\n  reading_format {\n    format\n  }\n  image {\n    ...ImageFragment\n  }\n  images {\n    ...ImageFragment\n  }\n  dto\n  dtoCombined: dto_combined\n  dtoExternal: dto_external\n  bookMappings:book_mappings {\n    ...BookMappingFragment\n  }\n  publisher {\n    ...PublisherFragment\n  }\n}\n`;\n","export default `\n  fragment BookEditFragment on books {\n    id\n    bookStatusId:book_status_id\n    slug\n    title\n    description\n    locked\n    dto\n    dtoCombined:dto_combined\n    dtoExternal:dto_external\n    userAdded:user_added\n    literaryTypeId: literary_type_id\n    bookCategoryId: book_category_id\n    createdByUserId: created_by_user_id\n    defaultCoverEditionId:default_cover_edition_id\n    defaultPhysicalEditionId:default_physical_edition_id\n    defaultAudioEditionId:default_audio_edition_id\n    defaultEbookEditionId:default_ebook_edition_id\n    state\n\n    contributions {\n      author {\n        name\n      }\n    }\n\n    canonical {\n      ...BookBylineFragment\n    }\n\n    defaultCoverEdition:default_cover_edition {\n      ...EditionFragment\n    }\n    defaultPhysicalEdition:default_physical_edition {\n      ...EditionFragment\n    }\n    defaultAudioEdition:default_audio_edition {\n      ...EditionFragment\n    }\n    defaultEbookEdition:default_ebook_edition {\n      ...EditionFragment\n    }\n\n    bookCharacters: book_characters(order_by: { position: asc }) {\n      ...BookCharacterFragment\n      character {\n        ...CharacterFragment\n      }\n    }\n  }\n`;\n","export default `\n  fragment CollectionImportFragment on collection_imports {\n    id\n    createdAt:created_at\n    updatedAt:updated_at\n    userId:user_id\n    state\n    reimportCount:reimport_count\n    successCount:success_count\n    processedCount:processed_count\n    totalCount:total_count\n    failureCount:failure_count\n    currentBook:current_book\n  }\n`;\n","export default `\n  fragment CountryFragment on countries {\n    id\n    name\n  }\n`;\n","export default `\n  fragment LanguageFragment on languages {\n    id\n    language\n    code2\n    code3\n  }\n`;\n","export default `\n  fragment NotificationTypeFragment on notification_types {\n    id\n    defaultChannelIds:default_channel_ids\n    defaultPriority:default_priority\n    description\n    name\n    uid\n  }\n`;\n","export default `\nfragment UserBookFullFragment on user_books {\n  id\n  dateAdded:date_added\n  owned\n  rating\n  lastReadDate:last_read_date\n  firstReadDate:first_read_date\n  statusId:status_id\n  bookId:book_id\n  userId:user_id\n  editionId:edition_id\n  updatedAt:updated_at\n  privacySettingId:privacy_setting_id\n  reviewedAt:reviewed_at\n  url\n  mediaUrl:media_url\n  objectType:object_type\n  likesCount:likes_count\n  hasReview:has_review\n  reviewSlate:review_slate,\n  reviewLength:review_length\n  reviewHasSpoilers:review_has_spoilers\n  sponsoredReview:sponsored_review\n\n  edition {\n    ...EditionFragment\n  }\n}\n`;\n","export default `\n  fragment PromptBookSummaryFragment on prompt_books_summary {\n    promptId:prompt_id\n    bookId:book_id\n    answersCount:answers_count\n  }\n`;\n","import { gql } from \"graphql-tag\";\n\nimport FollowedListFragment from \"queries/followed_lists/fragments/FollowedListFragment\";\nimport FollowedPromptFragment from \"queries/followed_prompts/fragments/FollowedPromptFragment\";\nimport FollowedUserFragment from \"queries/followed_users/fragments/FollowedUserFragment\";\nimport UserBookStatusFragment from \"queries/user_books/fragments/UserBookStatusFragment\";\nimport OwnerFragment from \"queries/users/fragments/OwnerFragment\";\nimport UserBookReadFragment from \"./user_book_reads/fragments/UserBookReadFragment\";\nimport EditionFragment from \"./editions/fragments/EditionFragment\";\nimport PublisherFragment from \"./publishers/fragments/PublisherFragment\";\nimport BookFragment from \"./books/fragments/BookFragment\";\nimport BookSeriesFragment from \"./books/fragments/BookSeriesFragment\";\nimport SeriesFragment from \"./series/fragments/SeriesFragment\";\nimport AuthorFragment from \"./authors/fragments/AuthorFragment\";\nimport UserBylineFragment from \"./users/fragments/UserBylineFragment\";\nimport ListFragment from \"./lists/fragments/ListFragment\";\nimport ListBookFragment from \"./listBooks/fragments/ListBookFragment\";\nimport LikeFragment from \"./likes/fragments/LikeFragment\";\nimport BookBylineFragment from \"./books/fragments/BookBylineFragment\";\nimport PromptFragment from \"./prompts/fragments/PromptFragment\";\nimport AuthorBylineFragment from \"./authors/fragments/AuthorBylineFragment\";\nimport PromptAnswerFragment from \"./prompts/fragments/PromptAnswerFragment\";\nimport UserInfoFragment from \"./users/fragments/UserInfoFragment\";\nimport CollectionImportResultFragment from \"./collection_imports/fragments/CollectionImportResultFragment\";\nimport MatchPercentageFragment from \"./recommendations/fragments/MatchPercentageFragment\";\nimport ReadingJournalSummaryFragment from \"./journals/fragments/ReadingJournalSummaryFragment\";\nimport ReadingJournalFragment from \"./journals/fragments/ReadingJournalFragment\";\nimport UserBookFragment from \"./user_books/fragments/UserBookFragment\";\nimport ActivityFragment from \"./feed/fragments/ActivityFragment\";\nimport GoalFragment from \"./goals/fragments/GoalFragment\";\nimport NotificationFragment from \"./notifications/fragments/NotificationFragment\";\nimport NotificationDeliveryFragment from \"./notifications/fragments/NotificationDeliveryFragment\";\nimport UserBlockFragment from \"./user_blocks/fragments/UserBlockFragment\";\nimport TaggingFragment from \"./tags/fragments/TaggingFragment\";\nimport TagFragment from \"./tags/fragments/TagFragment\";\nimport BookCharacterFragment from \"./book_characters/fragments/BookCharacterFragment\";\nimport CharacterFragment from \"./characters/fragments/CharacterFragment\";\nimport ListBylineFragment from \"./lists/fragments/ListBylineFragment\";\nimport ImageFragment from \"./images/fragments/ImageFragment\";\nimport BookMappingFragment from \"./book_mappings/fragments/BookMappingFragment\";\nimport EditEditionFragment from \"./editions/fragments/EditEditionFragment\";\nimport BookEditFragment from \"./books/fragments/BookEditFragment\";\nimport CollectionImportFragment from \"./collection_imports/fragments/CollectionImportFragment\";\nimport CountryFragment from \"./countries/fragments/CountryFragment\";\nimport LanguageFragment from \"./languages/fragments/LanguageFragment\";\nimport NotificationTypeFragment from \"./notifications/fragments/NotificationTypeFragment\";\nimport UserBookFullFragment from \"./user_books/fragments/UserBookFullFragment\";\nimport PromptBookSummaryFragment from \"./prompts/fragments/PromptBookSummaryFragment\";\n\nexport default gql`\n  ${ActivityFragment}\n  ${AuthorBylineFragment}\n  ${AuthorFragment}\n  ${BookBylineFragment}\n  ${BookEditFragment}\n  ${BookCharacterFragment}\n  ${BookFragment}\n  ${BookMappingFragment}\n  ${BookSeriesFragment}\n  ${CharacterFragment}\n  ${CollectionImportFragment}\n  ${CollectionImportResultFragment}\n  ${CountryFragment}\n  ${EditEditionFragment}\n  ${EditionFragment}\n  ${FollowedListFragment}\n  ${FollowedPromptFragment}\n  ${FollowedUserFragment}\n  ${GoalFragment}\n  ${ImageFragment}\n  ${LanguageFragment}\n  ${LikeFragment}\n  ${ListFragment}\n  ${ListBookFragment}\n  ${ListBylineFragment}\n  ${MatchPercentageFragment}\n  ${NotificationDeliveryFragment}\n  ${NotificationFragment}\n  ${NotificationTypeFragment}\n  ${OwnerFragment}\n  ${PromptAnswerFragment}\n  ${PromptFragment}\n  ${PublisherFragment}\n  ${ReadingJournalFragment}\n  ${ReadingJournalSummaryFragment}\n  ${SeriesFragment}\n  ${TagFragment}\n  ${TaggingFragment}\n  ${UserBlockFragment}\n  ${UserBookFragment}\n  ${UserBookFullFragment}\n  ${UserBookReadFragment}\n  ${UserBookStatusFragment}\n  ${UserBylineFragment}\n  ${UserInfoFragment}\n  ${PromptBookSummaryFragment}\n`;\n","import { InMemoryCache, createFragmentRegistry } from \"@apollo/client/cache\";\nimport fragments from \"queries/fragments\";\n\nconst cache = new InMemoryCache({\n  fragments: createFragmentRegistry(fragments),\n  typePolicies: {\n    followed_lists: {\n      keyFields: [\"userId\", \"listId\"],\n    },\n    followed_prompts: {\n      keyFields: [\"userId\", \"promptId\"],\n    },\n    followed_users: {\n      keyFields: [\"userId\", \"followedUserId\"],\n    },\n    likes: {\n      keyFields: [\"likeableId\", \"likeableType\", \"userId\"],\n    },\n    list_books: {\n      keyFields: [\"listId\", \"bookId\"],\n    },\n    prompt_answers: {\n      keyFields: [\"promptId\", \"bookId\", \"userId\"],\n    },\n    prompt_books_summary: {\n      keyFields: [\"promptId\", \"bookId\"],\n    },\n    recommendations: {\n      keyFields: [\"subjectType\", \"subjectId\", \"itemType\", \"itemId\", \"context\"],\n    },\n    user_books: {\n      keyFields: [\"userId\", \"bookId\"],\n    },\n  },\n});\n\nexport default cache;\n","\"use strict\";\nif (0) {\n  // Trick cjs-module-lexer into adding named exports for all React exports.\n  // (if imported with `import()`, they will appear in `.default` as well.)\n  // This way, cjs-module-lexer will let all of react's (named) exports through unchanged.\n  module.exports = require(\"react\");\n}\n// We don't want bundlers to error when they encounter usage of any of these exports.\n// It's up to the package author to ensure that if they access React internals,\n// they do so in a safe way that won't break if React changes how they use these internals.\n// (e.g. only access them in development, and only in an optional way that won't\n// break if internals are not there or do not have the expected structure)\n// @ts-ignore\nmodule.exports.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED = undefined;\n// @ts-ignore\nmodule.exports.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE = undefined;\n// @ts-ignore\nmodule.exports.__SERVER_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE = undefined;\n// Here we actually pull in the React library and add everything\n// it exports to our own `module.exports`.\n// If React suddenly were to add one of the above \"polyfilled\" exports,\n// the React version would overwrite our version, so this should be\n// future-proof.\nObject.assign(module.exports, require(\"react\"));\n","import * as React from \"rehackt\";\nimport { canUseSymbol } from \"../../utilities/index.js\";\nimport { invariant } from \"../../utilities/globals/index.js\";\n// To make sure Apollo Client doesn't create more than one React context\n// (which can lead to problems like having an Apollo Client instance added\n// in one context, then attempting to retrieve it from another different\n// context), a single Apollo context is created and tracked in global state.\nvar contextKey = canUseSymbol ? Symbol.for(\"__APOLLO_CONTEXT__\") : \"__APOLLO_CONTEXT__\";\nexport function getApolloContext() {\n    invariant(\"createContext\" in React, 46);\n    var context = React.createContext[contextKey];\n    if (!context) {\n        Object.defineProperty(React.createContext, contextKey, {\n            value: (context = React.createContext({})),\n            enumerable: false,\n            writable: false,\n            configurable: true,\n        });\n        context.displayName = \"ApolloContext\";\n    }\n    return context;\n}\n/**\n * @deprecated This function has no \"resetting\" effect since Apollo Client 3.4.12,\n * and will be removed in the next major version of Apollo Client.\n * If you want to get the Apollo Context, use `getApolloContext` instead.\n */\nexport var resetApolloContext = getApolloContext;\n//# sourceMappingURL=ApolloContext.js.map","import { invariant } from \"../../utilities/globals/index.js\";\nimport * as React from \"rehackt\";\nimport { getApolloContext } from \"../context/index.js\";\n/**\n * @example\n * ```jsx\n * import { useApolloClient } from '@apollo/client';\n *\n * function SomeComponent() {\n *   const client = useApolloClient();\n *   // `client` is now set to the `ApolloClient` instance being used by the\n *   // application (that was configured using something like `ApolloProvider`)\n * }\n * ```\n *\n * @since 3.0.0\n * @returns The `ApolloClient` instance being used by the application.\n */\nexport function useApolloClient(override) {\n    var context = React.useContext(getApolloContext());\n    var client = override || context.client;\n    invariant(!!client, 50);\n    return client;\n}\n//# sourceMappingURL=useApolloClient.js.map","export type AvatarThemeProps = {\n  subject: \"user\" | \"author\";\n  variant: \"normal\" | \"bordered\";\n  size: \"xs\" | \"sm\" | \"md\" | \"lg\" | \"xl\" | \"2xl\" | \"full\";\n  dimensions: \"sm\" | \"md\" | \"lg\" | \"xl\" | \"2xl\" | \"full\";\n};\n\nexport const avatarTheme = {\n  variant: {\n    normal: \"inline-block overflow-hidden\",\n    bordered: \"overflow-hidden border border-secondary\",\n  },\n  size: {\n    xs: \"rounded-full\",\n    sm: \"rounded-full\",\n    md: \"rounded-full\",\n    lg: \"rounded-full\",\n    xl: \"rounded-xl shadow-md\",\n    \"2xl\": \"rounded-xl shadow-md\",\n    full: \"\",\n  },\n  dimensions: {\n    xs: 20,\n    sm: 30,\n    md: 40,\n    lg: 60,\n    xl: 80,\n    \"2xl\": 180,\n    full: 500,\n  },\n};\n","/* eslint-disable react/jsx-props-no-spreading */\n/* eslint-disable jsx-a11y/alt-text */\nimport { forwardRef, HTMLAttributes, PropsWithChildren } from \"react\";\nimport {\n  avatarTheme,\n  AvatarThemeProps,\n} from \"hardcover-ui/theme/components/avatar\";\nimport ImageType from \"types/ImageType\";\nimport classNames from \"lib/classNames\";\nimport {\n  AUTHOR_AVATAR_URL,\n  AVATAR_URL,\n  enlargeUrl,\n  normalizeImageUrl,\n} from \"lib/imageTools\";\nimport _ from \"lodash\";\n\ntype Props = {\n  image: ImageType;\n  subject?: AvatarThemeProps[\"subject\"];\n  variant?: AvatarThemeProps[\"variant\"];\n  size?: AvatarThemeProps[\"size\"];\n  className?: string;\n  inline?: boolean;\n  alt: string;\n  lazy?: boolean;\n} & Partial<HTMLAttributes<HTMLDivElement>>;\n\nfunction calculateSourceUrl(subject: AvatarThemeProps[\"subject\"], url: string) {\n  if (url) {\n    return url;\n  }\n  return subject === \"user\" ? AVATAR_URL : AUTHOR_AVATAR_URL;\n}\n\nfunction urlFor(\n  subject: AvatarThemeProps[\"subject\"],\n  url: string,\n  dimension: number\n) {\n  // Use larger images than expected for mobile\n  const url1Width = Math.round(dimension);\n  const url2Width = Math.round(dimension * 1.5);\n\n  const sourceUrl = normalizeImageUrl(calculateSourceUrl(subject, url));\n\n  const url2x = enlargeUrl({\n    url: sourceUrl,\n    width: url2Width,\n    height: Math.round(dimension * 1.5),\n  });\n  const url1x = enlargeUrl({\n    url: sourceUrl,\n    width: url1Width,\n    height: Math.round(dimension),\n  });\n\n  return {\n    url1x,\n    url1Width,\n    url2x,\n    url2Width,\n  };\n}\n\nconst Avatar = forwardRef<HTMLDivElement, PropsWithChildren<Props>>(\n  (\n    {\n      image,\n      subject = \"user\",\n      variant = \"bordered\",\n      size = \"md\",\n      lazy = true,\n      inline = false,\n      alt = \"\",\n      className,\n      ...rest\n    },\n    ref\n  ) => {\n    const finalClassName = classNames(\n      avatarTheme.variant[variant],\n      avatarTheme.size?.[size],\n      inline ? \"inline-block\" : \"\",\n      className\n    );\n\n    const dimension = avatarTheme.dimensions[size];\n    const { url1x, url1Width, url2x, url2Width } = urlFor(\n      subject,\n      image?.url || AVATAR_URL,\n      dimension\n    );\n    const timmedAlt = alt ? alt.trim() : \"\";\n    const finalAlt = timmedAlt.length === 0 ? \"User Avatar\" : timmedAlt;\n\n    const props = {\n      ref,\n      className: finalClassName,\n      style: { width: `${dimension}px`, height: `${dimension}px` },\n      ...rest,\n    };\n\n    return (\n      <div {...props}>\n        <img\n          src={url1x}\n          srcSet={`${url1x} ${url1Width}w, ${url2x} ${url2Width}w`}\n          alt={finalAlt}\n          width={dimension}\n          height={dimension}\n          loading={lazy ? \"lazy\" : \"eager\"}\n          className=\"avatar cursor-pointer object-cover bg-cover w-full h-full hover:opacity-80 group-hover:opacity-80  transition-all\"\n        />\n      </div>\n    );\n  }\n);\n\nexport default Avatar;\n","\"use client\";import e from\"react\";import Gt from\"react-dom\";import E from\"react\";var Ct=s=>{switch(s){case\"success\":return $t;case\"info\":return _t;case\"warning\":return Wt;case\"error\":return Ut;default:return null}},Ft=Array(12).fill(0),It=({visible:s})=>E.createElement(\"div\",{className:\"sonner-loading-wrapper\",\"data-visible\":s},E.createElement(\"div\",{className:\"sonner-spinner\"},Ft.map((o,t)=>E.createElement(\"div\",{className:\"sonner-loading-bar\",key:`spinner-bar-${t}`})))),$t=E.createElement(\"svg\",{xmlns:\"http://www.w3.org/2000/svg\",viewBox:\"0 0 20 20\",fill:\"currentColor\",height:\"20\",width:\"20\"},E.createElement(\"path\",{fillRule:\"evenodd\",d:\"M10 18a8 8 0 100-16 8 8 0 000 16zm3.857-9.809a.75.75 0 00-1.214-.882l-3.483 4.79-1.88-1.88a.75.75 0 10-1.06 1.061l2.5 2.5a.75.75 0 001.137-.089l4-5.5z\",clipRule:\"evenodd\"})),Wt=E.createElement(\"svg\",{xmlns:\"http://www.w3.org/2000/svg\",viewBox:\"0 0 24 24\",fill:\"currentColor\",height:\"20\",width:\"20\"},E.createElement(\"path\",{fillRule:\"evenodd\",d:\"M9.401 3.003c1.155-2 4.043-2 5.197 0l7.355 12.748c1.154 2-.29 4.5-2.599 4.5H4.645c-2.309 0-3.752-2.5-2.598-4.5L9.4 3.003zM12 8.25a.75.75 0 01.75.75v3.75a.75.75 0 01-1.5 0V9a.75.75 0 01.75-.75zm0 8.25a.75.75 0 100-1.5.75.75 0 000 1.5z\",clipRule:\"evenodd\"})),_t=E.createElement(\"svg\",{xmlns:\"http://www.w3.org/2000/svg\",viewBox:\"0 0 20 20\",fill:\"currentColor\",height:\"20\",width:\"20\"},E.createElement(\"path\",{fillRule:\"evenodd\",d:\"M18 10a8 8 0 11-16 0 8 8 0 0116 0zm-7-4a1 1 0 11-2 0 1 1 0 012 0zM9 9a.75.75 0 000 1.5h.253a.25.25 0 01.244.304l-.459 2.066A1.75 1.75 0 0010.747 15H11a.75.75 0 000-1.5h-.253a.25.25 0 01-.244-.304l.459-2.066A1.75 1.75 0 009.253 9H9z\",clipRule:\"evenodd\"})),Ut=E.createElement(\"svg\",{xmlns:\"http://www.w3.org/2000/svg\",viewBox:\"0 0 20 20\",fill:\"currentColor\",height:\"20\",width:\"20\"},E.createElement(\"path\",{fillRule:\"evenodd\",d:\"M18 10a8 8 0 11-16 0 8 8 0 0116 0zm-8-5a.75.75 0 01.75.75v4.5a.75.75 0 01-1.5 0v-4.5A.75.75 0 0110 5zm0 10a1 1 0 100-2 1 1 0 000 2z\",clipRule:\"evenodd\"}));import kt from\"react\";var Dt=()=>{let[s,o]=kt.useState(document.hidden);return kt.useEffect(()=>{let t=()=>{o(document.hidden)};return document.addEventListener(\"visibilitychange\",t),()=>window.removeEventListener(\"visibilitychange\",t)},[]),s};var ct=1,ut=class{constructor(){this.subscribe=o=>(this.subscribers.push(o),()=>{let t=this.subscribers.indexOf(o);this.subscribers.splice(t,1)});this.publish=o=>{this.subscribers.forEach(t=>t(o))};this.addToast=o=>{this.publish(o),this.toasts=[...this.toasts,o]};this.create=o=>{var b;let{message:t,...n}=o,h=typeof(o==null?void 0:o.id)==\"number\"||((b=o.id)==null?void 0:b.length)>0?o.id:ct++,u=this.toasts.find(d=>d.id===h),g=o.dismissible===void 0?!0:o.dismissible;return u?this.toasts=this.toasts.map(d=>d.id===h?(this.publish({...d,...o,id:h,title:t}),{...d,...o,id:h,dismissible:g,title:t}):d):this.addToast({title:t,...n,dismissible:g,id:h}),h};this.dismiss=o=>(o||this.toasts.forEach(t=>{this.subscribers.forEach(n=>n({id:t.id,dismiss:!0}))}),this.subscribers.forEach(t=>t({id:o,dismiss:!0})),o);this.message=(o,t)=>this.create({...t,message:o});this.error=(o,t)=>this.create({...t,message:o,type:\"error\"});this.success=(o,t)=>this.create({...t,type:\"success\",message:o});this.info=(o,t)=>this.create({...t,type:\"info\",message:o});this.warning=(o,t)=>this.create({...t,type:\"warning\",message:o});this.loading=(o,t)=>this.create({...t,type:\"loading\",message:o});this.promise=(o,t)=>{if(!t)return;let n;t.loading!==void 0&&(n=this.create({...t,promise:o,type:\"loading\",message:t.loading,description:typeof t.description!=\"function\"?t.description:void 0}));let h=o instanceof Promise?o:o(),u=n!==void 0;return h.then(async g=>{if(Ot(g)&&!g.ok){u=!1;let b=typeof t.error==\"function\"?await t.error(`HTTP error! status: ${g.status}`):t.error,d=typeof t.description==\"function\"?await t.description(`HTTP error! status: ${g.status}`):t.description;this.create({id:n,type:\"error\",message:b,description:d})}else if(t.success!==void 0){u=!1;let b=typeof t.success==\"function\"?await t.success(g):t.success,d=typeof t.description==\"function\"?await t.description(g):t.description;this.create({id:n,type:\"success\",message:b,description:d})}}).catch(async g=>{if(t.error!==void 0){u=!1;let b=typeof t.error==\"function\"?await t.error(g):t.error,d=typeof t.description==\"function\"?await t.description(g):t.description;this.create({id:n,type:\"error\",message:b,description:d})}}).finally(()=>{var g;u&&(this.dismiss(n),n=void 0),(g=t.finally)==null||g.call(t)}),n};this.custom=(o,t)=>{let n=(t==null?void 0:t.id)||ct++;return this.create({jsx:o(n),id:n,...t}),n};this.subscribers=[],this.toasts=[]}},v=new ut,Vt=(s,o)=>{let t=(o==null?void 0:o.id)||ct++;return v.addToast({title:s,...o,id:t}),t},Ot=s=>s&&typeof s==\"object\"&&\"ok\"in s&&typeof s.ok==\"boolean\"&&\"status\"in s&&typeof s.status==\"number\",Kt=Vt,Xt=()=>v.toasts,Jt=Object.assign(Kt,{success:v.success,info:v.info,warning:v.warning,error:v.error,custom:v.custom,message:v.message,promise:v.promise,dismiss:v.dismiss,loading:v.loading},{getHistory:Xt});function ft(s,{insertAt:o}={}){if(!s||typeof document==\"undefined\")return;let t=document.head||document.getElementsByTagName(\"head\")[0],n=document.createElement(\"style\");n.type=\"text/css\",o===\"top\"&&t.firstChild?t.insertBefore(n,t.firstChild):t.appendChild(n),n.styleSheet?n.styleSheet.cssText=s:n.appendChild(document.createTextNode(s))}ft(`:where(html[dir=\"ltr\"]),:where([data-sonner-toaster][dir=\"ltr\"]){--toast-icon-margin-start: -3px;--toast-icon-margin-end: 4px;--toast-svg-margin-start: -1px;--toast-svg-margin-end: 0px;--toast-button-margin-start: auto;--toast-button-margin-end: 0;--toast-close-button-start: 0;--toast-close-button-end: unset;--toast-close-button-transform: translate(-35%, -35%)}:where(html[dir=\"rtl\"]),:where([data-sonner-toaster][dir=\"rtl\"]){--toast-icon-margin-start: 4px;--toast-icon-margin-end: -3px;--toast-svg-margin-start: 0px;--toast-svg-margin-end: -1px;--toast-button-margin-start: 0;--toast-button-margin-end: auto;--toast-close-button-start: unset;--toast-close-button-end: 0;--toast-close-button-transform: translate(35%, -35%)}:where([data-sonner-toaster]){position:fixed;width:var(--width);font-family:ui-sans-serif,system-ui,-apple-system,BlinkMacSystemFont,Segoe UI,Roboto,Helvetica Neue,Arial,Noto Sans,sans-serif,Apple Color Emoji,Segoe UI Emoji,Segoe UI Symbol,Noto Color Emoji;--gray1: hsl(0, 0%, 99%);--gray2: hsl(0, 0%, 97.3%);--gray3: hsl(0, 0%, 95.1%);--gray4: hsl(0, 0%, 93%);--gray5: hsl(0, 0%, 90.9%);--gray6: hsl(0, 0%, 88.7%);--gray7: hsl(0, 0%, 85.8%);--gray8: hsl(0, 0%, 78%);--gray9: hsl(0, 0%, 56.1%);--gray10: hsl(0, 0%, 52.3%);--gray11: hsl(0, 0%, 43.5%);--gray12: hsl(0, 0%, 9%);--border-radius: 8px;box-sizing:border-box;padding:0;margin:0;list-style:none;outline:none;z-index:999999999}:where([data-sonner-toaster][data-x-position=\"right\"]){right:max(var(--offset),env(safe-area-inset-right))}:where([data-sonner-toaster][data-x-position=\"left\"]){left:max(var(--offset),env(safe-area-inset-left))}:where([data-sonner-toaster][data-x-position=\"center\"]){left:50%;transform:translate(-50%)}:where([data-sonner-toaster][data-y-position=\"top\"]){top:max(var(--offset),env(safe-area-inset-top))}:where([data-sonner-toaster][data-y-position=\"bottom\"]){bottom:max(var(--offset),env(safe-area-inset-bottom))}:where([data-sonner-toast]){--y: translateY(100%);--lift-amount: calc(var(--lift) * var(--gap));z-index:var(--z-index);position:absolute;opacity:0;transform:var(--y);filter:blur(0);touch-action:none;transition:transform .4s,opacity .4s,height .4s,box-shadow .2s;box-sizing:border-box;outline:none;overflow-wrap:anywhere}:where([data-sonner-toast][data-styled=\"true\"]){padding:16px;background:var(--normal-bg);border:1px solid var(--normal-border);color:var(--normal-text);border-radius:var(--border-radius);box-shadow:0 4px 12px #0000001a;width:var(--width);font-size:13px;display:flex;align-items:center;gap:6px}:where([data-sonner-toast]:focus-visible){box-shadow:0 4px 12px #0000001a,0 0 0 2px #0003}:where([data-sonner-toast][data-y-position=\"top\"]){top:0;--y: translateY(-100%);--lift: 1;--lift-amount: calc(1 * var(--gap))}:where([data-sonner-toast][data-y-position=\"bottom\"]){bottom:0;--y: translateY(100%);--lift: -1;--lift-amount: calc(var(--lift) * var(--gap))}:where([data-sonner-toast]) :where([data-description]){font-weight:400;line-height:1.4;color:inherit}:where([data-sonner-toast]) :where([data-title]){font-weight:500;line-height:1.5;color:inherit}:where([data-sonner-toast]) :where([data-icon]){display:flex;height:16px;width:16px;position:relative;justify-content:flex-start;align-items:center;flex-shrink:0;margin-left:var(--toast-icon-margin-start);margin-right:var(--toast-icon-margin-end)}:where([data-sonner-toast][data-promise=\"true\"]) :where([data-icon])>svg{opacity:0;transform:scale(.8);transform-origin:center;animation:sonner-fade-in .3s ease forwards}:where([data-sonner-toast]) :where([data-icon])>*{flex-shrink:0}:where([data-sonner-toast]) :where([data-icon]) svg{margin-left:var(--toast-svg-margin-start);margin-right:var(--toast-svg-margin-end)}:where([data-sonner-toast]) :where([data-content]){display:flex;flex-direction:column;gap:2px}[data-sonner-toast][data-styled=true] [data-button]{border-radius:4px;padding-left:8px;padding-right:8px;height:24px;font-size:12px;color:var(--normal-bg);background:var(--normal-text);margin-left:var(--toast-button-margin-start);margin-right:var(--toast-button-margin-end);border:none;cursor:pointer;outline:none;display:flex;align-items:center;flex-shrink:0;transition:opacity .4s,box-shadow .2s}:where([data-sonner-toast]) :where([data-button]):focus-visible{box-shadow:0 0 0 2px #0006}:where([data-sonner-toast]) :where([data-button]):first-of-type{margin-left:var(--toast-button-margin-start);margin-right:var(--toast-button-margin-end)}:where([data-sonner-toast]) :where([data-cancel]){color:var(--normal-text);background:rgba(0,0,0,.08)}:where([data-sonner-toast][data-theme=\"dark\"]) :where([data-cancel]){background:rgba(255,255,255,.3)}:where([data-sonner-toast]) :where([data-close-button]){position:absolute;left:var(--toast-close-button-start);right:var(--toast-close-button-end);top:0;height:20px;width:20px;display:flex;justify-content:center;align-items:center;padding:0;background:var(--gray1);color:var(--gray12);border:1px solid var(--gray4);transform:var(--toast-close-button-transform);border-radius:50%;cursor:pointer;z-index:1;transition:opacity .1s,background .2s,border-color .2s}:where([data-sonner-toast]) :where([data-close-button]):focus-visible{box-shadow:0 4px 12px #0000001a,0 0 0 2px #0003}:where([data-sonner-toast]) :where([data-disabled=\"true\"]){cursor:not-allowed}:where([data-sonner-toast]):hover :where([data-close-button]):hover{background:var(--gray2);border-color:var(--gray5)}:where([data-sonner-toast][data-swiping=\"true\"]):before{content:\"\";position:absolute;left:0;right:0;height:100%;z-index:-1}:where([data-sonner-toast][data-y-position=\"top\"][data-swiping=\"true\"]):before{bottom:50%;transform:scaleY(3) translateY(50%)}:where([data-sonner-toast][data-y-position=\"bottom\"][data-swiping=\"true\"]):before{top:50%;transform:scaleY(3) translateY(-50%)}:where([data-sonner-toast][data-swiping=\"false\"][data-removed=\"true\"]):before{content:\"\";position:absolute;inset:0;transform:scaleY(2)}:where([data-sonner-toast]):after{content:\"\";position:absolute;left:0;height:calc(var(--gap) + 1px);bottom:100%;width:100%}:where([data-sonner-toast][data-mounted=\"true\"]){--y: translateY(0);opacity:1}:where([data-sonner-toast][data-expanded=\"false\"][data-front=\"false\"]){--scale: var(--toasts-before) * .05 + 1;--y: translateY(calc(var(--lift-amount) * var(--toasts-before))) scale(calc(-1 * var(--scale)));height:var(--front-toast-height)}:where([data-sonner-toast])>*{transition:opacity .4s}:where([data-sonner-toast][data-expanded=\"false\"][data-front=\"false\"][data-styled=\"true\"])>*{opacity:0}:where([data-sonner-toast][data-visible=\"false\"]){opacity:0;pointer-events:none}:where([data-sonner-toast][data-mounted=\"true\"][data-expanded=\"true\"]){--y: translateY(calc(var(--lift) * var(--offset)));height:var(--initial-height)}:where([data-sonner-toast][data-removed=\"true\"][data-front=\"true\"][data-swipe-out=\"false\"]){--y: translateY(calc(var(--lift) * -100%));opacity:0}:where([data-sonner-toast][data-removed=\"true\"][data-front=\"false\"][data-swipe-out=\"false\"][data-expanded=\"true\"]){--y: translateY(calc(var(--lift) * var(--offset) + var(--lift) * -100%));opacity:0}:where([data-sonner-toast][data-removed=\"true\"][data-front=\"false\"][data-swipe-out=\"false\"][data-expanded=\"false\"]){--y: translateY(40%);opacity:0;transition:transform .5s,opacity .2s}:where([data-sonner-toast][data-removed=\"true\"][data-front=\"false\"]):before{height:calc(var(--initial-height) + 20%)}[data-sonner-toast][data-swiping=true]{transform:var(--y) translateY(var(--swipe-amount, 0px));transition:none}[data-sonner-toast][data-swipe-out=true][data-y-position=bottom],[data-sonner-toast][data-swipe-out=true][data-y-position=top]{animation:swipe-out .2s ease-out forwards}@keyframes swipe-out{0%{transform:translateY(calc(var(--lift) * var(--offset) + var(--swipe-amount)));opacity:1}to{transform:translateY(calc(var(--lift) * var(--offset) + var(--swipe-amount) + var(--lift) * -100%));opacity:0}}@media (max-width: 600px){[data-sonner-toaster]{position:fixed;--mobile-offset: 16px;right:var(--mobile-offset);left:var(--mobile-offset);width:100%}[data-sonner-toaster] [data-sonner-toast]{left:0;right:0;width:calc(100% - var(--mobile-offset) * 2)}[data-sonner-toaster][data-x-position=left]{left:var(--mobile-offset)}[data-sonner-toaster][data-y-position=bottom]{bottom:20px}[data-sonner-toaster][data-y-position=top]{top:20px}[data-sonner-toaster][data-x-position=center]{left:var(--mobile-offset);right:var(--mobile-offset);transform:none}}[data-sonner-toaster][data-theme=light]{--normal-bg: #fff;--normal-border: var(--gray4);--normal-text: var(--gray12);--success-bg: hsl(143, 85%, 96%);--success-border: hsl(145, 92%, 91%);--success-text: hsl(140, 100%, 27%);--info-bg: hsl(208, 100%, 97%);--info-border: hsl(221, 91%, 91%);--info-text: hsl(210, 92%, 45%);--warning-bg: hsl(49, 100%, 97%);--warning-border: hsl(49, 91%, 91%);--warning-text: hsl(31, 92%, 45%);--error-bg: hsl(359, 100%, 97%);--error-border: hsl(359, 100%, 94%);--error-text: hsl(360, 100%, 45%)}[data-sonner-toaster][data-theme=light] [data-sonner-toast][data-invert=true]{--normal-bg: #000;--normal-border: hsl(0, 0%, 20%);--normal-text: var(--gray1)}[data-sonner-toaster][data-theme=dark] [data-sonner-toast][data-invert=true]{--normal-bg: #fff;--normal-border: var(--gray3);--normal-text: var(--gray12)}[data-sonner-toaster][data-theme=dark]{--normal-bg: #000;--normal-border: hsl(0, 0%, 20%);--normal-text: var(--gray1);--success-bg: hsl(150, 100%, 6%);--success-border: hsl(147, 100%, 12%);--success-text: hsl(150, 86%, 65%);--info-bg: hsl(215, 100%, 6%);--info-border: hsl(223, 100%, 12%);--info-text: hsl(216, 87%, 65%);--warning-bg: hsl(64, 100%, 6%);--warning-border: hsl(60, 100%, 12%);--warning-text: hsl(46, 87%, 65%);--error-bg: hsl(358, 76%, 10%);--error-border: hsl(357, 89%, 16%);--error-text: hsl(358, 100%, 81%)}[data-rich-colors=true][data-sonner-toast][data-type=success],[data-rich-colors=true][data-sonner-toast][data-type=success] [data-close-button]{background:var(--success-bg);border-color:var(--success-border);color:var(--success-text)}[data-rich-colors=true][data-sonner-toast][data-type=info],[data-rich-colors=true][data-sonner-toast][data-type=info] [data-close-button]{background:var(--info-bg);border-color:var(--info-border);color:var(--info-text)}[data-rich-colors=true][data-sonner-toast][data-type=warning],[data-rich-colors=true][data-sonner-toast][data-type=warning] [data-close-button]{background:var(--warning-bg);border-color:var(--warning-border);color:var(--warning-text)}[data-rich-colors=true][data-sonner-toast][data-type=error],[data-rich-colors=true][data-sonner-toast][data-type=error] [data-close-button]{background:var(--error-bg);border-color:var(--error-border);color:var(--error-text)}.sonner-loading-wrapper{--size: 16px;height:var(--size);width:var(--size);position:absolute;inset:0;z-index:10}.sonner-loading-wrapper[data-visible=false]{transform-origin:center;animation:sonner-fade-out .2s ease forwards}.sonner-spinner{position:relative;top:50%;left:50%;height:var(--size);width:var(--size)}.sonner-loading-bar{animation:sonner-spin 1.2s linear infinite;background:var(--gray11);border-radius:6px;height:8%;left:-10%;position:absolute;top:-3.9%;width:24%}.sonner-loading-bar:nth-child(1){animation-delay:-1.2s;transform:rotate(.0001deg) translate(146%)}.sonner-loading-bar:nth-child(2){animation-delay:-1.1s;transform:rotate(30deg) translate(146%)}.sonner-loading-bar:nth-child(3){animation-delay:-1s;transform:rotate(60deg) translate(146%)}.sonner-loading-bar:nth-child(4){animation-delay:-.9s;transform:rotate(90deg) translate(146%)}.sonner-loading-bar:nth-child(5){animation-delay:-.8s;transform:rotate(120deg) translate(146%)}.sonner-loading-bar:nth-child(6){animation-delay:-.7s;transform:rotate(150deg) translate(146%)}.sonner-loading-bar:nth-child(7){animation-delay:-.6s;transform:rotate(180deg) translate(146%)}.sonner-loading-bar:nth-child(8){animation-delay:-.5s;transform:rotate(210deg) translate(146%)}.sonner-loading-bar:nth-child(9){animation-delay:-.4s;transform:rotate(240deg) translate(146%)}.sonner-loading-bar:nth-child(10){animation-delay:-.3s;transform:rotate(270deg) translate(146%)}.sonner-loading-bar:nth-child(11){animation-delay:-.2s;transform:rotate(300deg) translate(146%)}.sonner-loading-bar:nth-child(12){animation-delay:-.1s;transform:rotate(330deg) translate(146%)}@keyframes sonner-fade-in{0%{opacity:0;transform:scale(.8)}to{opacity:1;transform:scale(1)}}@keyframes sonner-fade-out{0%{opacity:1;transform:scale(1)}to{opacity:0;transform:scale(.8)}}@keyframes sonner-spin{0%{opacity:1}to{opacity:.15}}@media (prefers-reduced-motion){[data-sonner-toast],[data-sonner-toast]>*,.sonner-loading-bar{transition:none!important;animation:none!important}}.sonner-loader{position:absolute;top:50%;left:50%;transform:translate(-50%,-50%);transform-origin:center;transition:opacity .2s,transform .2s}.sonner-loader[data-visible=false]{opacity:0;transform:scale(.8) translate(-50%,-50%)}\n`);function U(s){return s.label!==void 0}var qt=3,Qt=\"32px\",Zt=4e3,te=356,ee=14,oe=20,ae=200;function ne(...s){return s.filter(Boolean).join(\" \")}var se=s=>{var yt,xt,vt,wt,Tt,St,Rt,Et,Nt,Pt;let{invert:o,toast:t,unstyled:n,interacting:h,setHeights:u,visibleToasts:g,heights:b,index:d,toasts:q,expanded:$,removeToast:V,defaultRichColors:Q,closeButton:i,style:O,cancelButtonStyle:K,actionButtonStyle:Z,className:tt=\"\",descriptionClassName:et=\"\",duration:X,position:ot,gap:w,loadingIcon:j,expandByDefault:W,classNames:r,icons:I,closeButtonAriaLabel:at=\"Close toast\",pauseWhenPageIsHidden:k,cn:T}=s,[z,nt]=e.useState(!1),[D,H]=e.useState(!1),[st,N]=e.useState(!1),[M,rt]=e.useState(!1),[c,m]=e.useState(0),[y,S]=e.useState(0),A=e.useRef(null),l=e.useRef(null),_=d===0,J=d+1<=g,x=t.type,P=t.dismissible!==!1,Mt=t.className||\"\",At=t.descriptionClassName||\"\",G=e.useMemo(()=>b.findIndex(a=>a.toastId===t.id)||0,[b,t.id]),Lt=e.useMemo(()=>{var a;return(a=t.closeButton)!=null?a:i},[t.closeButton,i]),mt=e.useMemo(()=>t.duration||X||Zt,[t.duration,X]),it=e.useRef(0),Y=e.useRef(0),pt=e.useRef(0),F=e.useRef(null),[gt,zt]=ot.split(\"-\"),ht=e.useMemo(()=>b.reduce((a,f,p)=>p>=G?a:a+f.height,0),[b,G]),bt=Dt(),jt=t.invert||o,lt=x===\"loading\";Y.current=e.useMemo(()=>G*w+ht,[G,ht]),e.useEffect(()=>{nt(!0)},[]),e.useLayoutEffect(()=>{if(!z)return;let a=l.current,f=a.style.height;a.style.height=\"auto\";let p=a.getBoundingClientRect().height;a.style.height=f,S(p),u(B=>B.find(R=>R.toastId===t.id)?B.map(R=>R.toastId===t.id?{...R,height:p}:R):[{toastId:t.id,height:p,position:t.position},...B])},[z,t.title,t.description,u,t.id]);let L=e.useCallback(()=>{H(!0),m(Y.current),u(a=>a.filter(f=>f.toastId!==t.id)),setTimeout(()=>{V(t)},ae)},[t,V,u,Y]);e.useEffect(()=>{if(t.promise&&x===\"loading\"||t.duration===1/0||t.type===\"loading\")return;let a,f=mt;return $||h||k&&bt?(()=>{if(pt.current<it.current){let C=new Date().getTime()-it.current;f=f-C}pt.current=new Date().getTime()})():(()=>{f!==1/0&&(it.current=new Date().getTime(),a=setTimeout(()=>{var C;(C=t.onAutoClose)==null||C.call(t,t),L()},f))})(),()=>clearTimeout(a)},[$,h,W,t,mt,L,t.promise,x,k,bt]),e.useEffect(()=>{let a=l.current;if(a){let f=a.getBoundingClientRect().height;return S(f),u(p=>[{toastId:t.id,height:f,position:t.position},...p]),()=>u(p=>p.filter(B=>B.toastId!==t.id))}},[u,t.id]),e.useEffect(()=>{t.delete&&L()},[L,t.delete]);function Yt(){return I!=null&&I.loading?e.createElement(\"div\",{className:\"sonner-loader\",\"data-visible\":x===\"loading\"},I.loading):j?e.createElement(\"div\",{className:\"sonner-loader\",\"data-visible\":x===\"loading\"},j):e.createElement(It,{visible:x===\"loading\"})}return e.createElement(\"li\",{\"aria-live\":t.important?\"assertive\":\"polite\",\"aria-atomic\":\"true\",role:\"status\",tabIndex:0,ref:l,className:T(tt,Mt,r==null?void 0:r.toast,(yt=t==null?void 0:t.classNames)==null?void 0:yt.toast,r==null?void 0:r.default,r==null?void 0:r[x],(xt=t==null?void 0:t.classNames)==null?void 0:xt[x]),\"data-sonner-toast\":\"\",\"data-rich-colors\":(vt=t.richColors)!=null?vt:Q,\"data-styled\":!(t.jsx||t.unstyled||n),\"data-mounted\":z,\"data-promise\":!!t.promise,\"data-removed\":D,\"data-visible\":J,\"data-y-position\":gt,\"data-x-position\":zt,\"data-index\":d,\"data-front\":_,\"data-swiping\":st,\"data-dismissible\":P,\"data-type\":x,\"data-invert\":jt,\"data-swipe-out\":M,\"data-expanded\":!!($||W&&z),style:{\"--index\":d,\"--toasts-before\":d,\"--z-index\":q.length-d,\"--offset\":`${D?c:Y.current}px`,\"--initial-height\":W?\"auto\":`${y}px`,...O,...t.style},onPointerDown:a=>{lt||!P||(A.current=new Date,m(Y.current),a.target.setPointerCapture(a.pointerId),a.target.tagName!==\"BUTTON\"&&(N(!0),F.current={x:a.clientX,y:a.clientY}))},onPointerUp:()=>{var B,C,R,dt;if(M||!P)return;F.current=null;let a=Number(((B=l.current)==null?void 0:B.style.getPropertyValue(\"--swipe-amount\").replace(\"px\",\"\"))||0),f=new Date().getTime()-((C=A.current)==null?void 0:C.getTime()),p=Math.abs(a)/f;if(Math.abs(a)>=oe||p>.11){m(Y.current),(R=t.onDismiss)==null||R.call(t,t),L(),rt(!0);return}(dt=l.current)==null||dt.style.setProperty(\"--swipe-amount\",\"0px\"),N(!1)},onPointerMove:a=>{var Bt;if(!F.current||!P)return;let f=a.clientY-F.current.y,p=a.clientX-F.current.x,C=(gt===\"top\"?Math.min:Math.max)(0,f),R=a.pointerType===\"touch\"?10:2;Math.abs(C)>R?(Bt=l.current)==null||Bt.style.setProperty(\"--swipe-amount\",`${f}px`):Math.abs(p)>R&&(F.current=null)}},Lt&&!t.jsx?e.createElement(\"button\",{\"aria-label\":at,\"data-disabled\":lt,\"data-close-button\":!0,onClick:lt||!P?()=>{}:()=>{var a;L(),(a=t.onDismiss)==null||a.call(t,t)},className:T(r==null?void 0:r.closeButton,(wt=t==null?void 0:t.classNames)==null?void 0:wt.closeButton)},e.createElement(\"svg\",{xmlns:\"http://www.w3.org/2000/svg\",width:\"12\",height:\"12\",viewBox:\"0 0 24 24\",fill:\"none\",stroke:\"currentColor\",strokeWidth:\"1.5\",strokeLinecap:\"round\",strokeLinejoin:\"round\"},e.createElement(\"line\",{x1:\"18\",y1:\"6\",x2:\"6\",y2:\"18\"}),e.createElement(\"line\",{x1:\"6\",y1:\"6\",x2:\"18\",y2:\"18\"}))):null,t.jsx||e.isValidElement(t.title)?t.jsx||t.title:e.createElement(e.Fragment,null,x||t.icon||t.promise?e.createElement(\"div\",{\"data-icon\":\"\",className:T(r==null?void 0:r.icon,(Tt=t==null?void 0:t.classNames)==null?void 0:Tt.icon)},t.promise||t.type===\"loading\"&&!t.icon?t.icon||Yt():null,t.type!==\"loading\"?t.icon||(I==null?void 0:I[x])||Ct(x):null):null,e.createElement(\"div\",{\"data-content\":\"\",className:T(r==null?void 0:r.content,(St=t==null?void 0:t.classNames)==null?void 0:St.content)},e.createElement(\"div\",{\"data-title\":\"\",className:T(r==null?void 0:r.title,(Rt=t==null?void 0:t.classNames)==null?void 0:Rt.title)},t.title),t.description?e.createElement(\"div\",{\"data-description\":\"\",className:T(et,At,r==null?void 0:r.description,(Et=t==null?void 0:t.classNames)==null?void 0:Et.description)},t.description):null),e.isValidElement(t.cancel)?t.cancel:t.cancel&&U(t.cancel)?e.createElement(\"button\",{\"data-button\":!0,\"data-cancel\":!0,style:t.cancelButtonStyle||K,onClick:a=>{var f,p;U(t.cancel)&&P&&((p=(f=t.cancel).onClick)==null||p.call(f,a),L())},className:T(r==null?void 0:r.cancelButton,(Nt=t==null?void 0:t.classNames)==null?void 0:Nt.cancelButton)},t.cancel.label):null,e.isValidElement(t.action)?t.action:t.action&&U(t.action)?e.createElement(\"button\",{\"data-button\":!0,\"data-action\":!0,style:t.actionButtonStyle||Z,onClick:a=>{var f,p;U(t.action)&&(a.defaultPrevented||((p=(f=t.action).onClick)==null||p.call(f,a),L()))},className:T(r==null?void 0:r.actionButton,(Pt=t==null?void 0:t.classNames)==null?void 0:Pt.actionButton)},t.action.label):null))};function Ht(){if(typeof window==\"undefined\"||typeof document==\"undefined\")return\"ltr\";let s=document.documentElement.getAttribute(\"dir\");return s===\"auto\"||!s?window.getComputedStyle(document.documentElement).direction:s}function we(){let[s,o]=e.useState([]);return e.useEffect(()=>v.subscribe(t=>{o(n=>{if(\"dismiss\"in t&&t.dismiss)return n.filter(u=>u.id!==t.id);let h=n.findIndex(u=>u.id===t.id);if(h!==-1){let u=[...n];return u[h]={...u[h],...t},u}else return[t,...n]})}),[]),{toasts:s}}var Te=s=>{let{invert:o,position:t=\"bottom-right\",hotkey:n=[\"altKey\",\"KeyT\"],expand:h,closeButton:u,className:g,offset:b,theme:d=\"light\",richColors:q,duration:$,style:V,visibleToasts:Q=qt,toastOptions:i,dir:O=Ht(),gap:K=ee,loadingIcon:Z,icons:tt,containerAriaLabel:et=\"Notifications\",pauseWhenPageIsHidden:X,cn:ot=ne}=s,[w,j]=e.useState([]),W=e.useMemo(()=>Array.from(new Set([t].concat(w.filter(c=>c.position).map(c=>c.position)))),[w,t]),[r,I]=e.useState([]),[at,k]=e.useState(!1),[T,z]=e.useState(!1),[nt,D]=e.useState(d!==\"system\"?d:typeof window!=\"undefined\"&&window.matchMedia&&window.matchMedia(\"(prefers-color-scheme: dark)\").matches?\"dark\":\"light\"),H=e.useRef(null),st=n.join(\"+\").replace(/Key/g,\"\").replace(/Digit/g,\"\"),N=e.useRef(null),M=e.useRef(!1),rt=e.useCallback(c=>{var m;(m=w.find(y=>y.id===c.id))!=null&&m.delete||v.dismiss(c.id),j(y=>y.filter(({id:S})=>S!==c.id))},[w]);return e.useEffect(()=>v.subscribe(c=>{if(c.dismiss){j(m=>m.map(y=>y.id===c.id?{...y,delete:!0}:y));return}setTimeout(()=>{Gt.flushSync(()=>{j(m=>{let y=m.findIndex(S=>S.id===c.id);return y!==-1?[...m.slice(0,y),{...m[y],...c},...m.slice(y+1)]:[c,...m]})})})}),[]),e.useEffect(()=>{if(d!==\"system\"){D(d);return}d===\"system\"&&(window.matchMedia&&window.matchMedia(\"(prefers-color-scheme: dark)\").matches?D(\"dark\"):D(\"light\")),typeof window!=\"undefined\"&&window.matchMedia(\"(prefers-color-scheme: dark)\").addEventListener(\"change\",({matches:c})=>{D(c?\"dark\":\"light\")})},[d]),e.useEffect(()=>{w.length<=1&&k(!1)},[w]),e.useEffect(()=>{let c=m=>{var S,A;n.every(l=>m[l]||m.code===l)&&(k(!0),(S=H.current)==null||S.focus()),m.code===\"Escape\"&&(document.activeElement===H.current||(A=H.current)!=null&&A.contains(document.activeElement))&&k(!1)};return document.addEventListener(\"keydown\",c),()=>document.removeEventListener(\"keydown\",c)},[n]),e.useEffect(()=>{if(H.current)return()=>{N.current&&(N.current.focus({preventScroll:!0}),N.current=null,M.current=!1)}},[H.current]),w.length?e.createElement(\"section\",{\"aria-label\":`${et} ${st}`,tabIndex:-1},W.map((c,m)=>{var A;let[y,S]=c.split(\"-\");return e.createElement(\"ol\",{key:c,dir:O===\"auto\"?Ht():O,tabIndex:-1,ref:H,className:g,\"data-sonner-toaster\":!0,\"data-theme\":nt,\"data-y-position\":y,\"data-x-position\":S,style:{\"--front-toast-height\":`${((A=r[0])==null?void 0:A.height)||0}px`,\"--offset\":typeof b==\"number\"?`${b}px`:b||Qt,\"--width\":`${te}px`,\"--gap\":`${K}px`,...V},onBlur:l=>{M.current&&!l.currentTarget.contains(l.relatedTarget)&&(M.current=!1,N.current&&(N.current.focus({preventScroll:!0}),N.current=null))},onFocus:l=>{l.target instanceof HTMLElement&&l.target.dataset.dismissible===\"false\"||M.current||(M.current=!0,N.current=l.relatedTarget)},onMouseEnter:()=>k(!0),onMouseMove:()=>k(!0),onMouseLeave:()=>{T||k(!1)},onPointerDown:l=>{l.target instanceof HTMLElement&&l.target.dataset.dismissible===\"false\"||z(!0)},onPointerUp:()=>z(!1)},w.filter(l=>!l.position&&m===0||l.position===c).map((l,_)=>{var J,x;return e.createElement(se,{key:l.id,icons:tt,index:_,toast:l,defaultRichColors:q,duration:(J=i==null?void 0:i.duration)!=null?J:$,className:i==null?void 0:i.className,descriptionClassName:i==null?void 0:i.descriptionClassName,invert:o,visibleToasts:Q,closeButton:(x=i==null?void 0:i.closeButton)!=null?x:u,interacting:T,position:c,style:i==null?void 0:i.style,unstyled:i==null?void 0:i.unstyled,classNames:i==null?void 0:i.classNames,cancelButtonStyle:i==null?void 0:i.cancelButtonStyle,actionButtonStyle:i==null?void 0:i.actionButtonStyle,removeToast:rt,toasts:w.filter(P=>P.position==l.position),heights:r.filter(P=>P.position==l.position),setHeights:I,expandByDefault:h,gap:K,loadingIcon:Z,expanded:at,pauseWhenPageIsHidden:X,cn:ot})}))})):null};export{Te as Toaster,Jt as toast,we as useSonner};\n//# sourceMappingURL=index.mjs.map","/* eslint-disable react/jsx-props-no-spreading */\nimport classNames from \"lib/classNames\";\nimport { Link } from \"@inertiajs/react\";\nimport {\n  TextLinkThemeProps,\n  textLinkTheme,\n} from \"hardcover-ui/theme/components/text\";\nimport { AnchorHTMLAttributes, PropsWithChildren, forwardRef } from \"react\";\n\ntype Props = {\n  size?: TextLinkThemeProps[\"size\"];\n  external?: boolean;\n  variant?: TextLinkThemeProps[\"variant\"];\n  underline?: boolean;\n  prefetch?: boolean;\n} & Partial<AnchorHTMLAttributes<HTMLAnchorElement>>;\n\nconst TextLink = forwardRef<HTMLAnchorElement, PropsWithChildren<Props>>(\n  (\n    {\n      size = \"md\",\n      external = false,\n      variant = \"normal\",\n      children,\n      underline = true,\n      className,\n      ...rest\n    },\n    ref\n  ) => {\n    const finalClassName = classNames(\n      textLinkTheme.variant[variant],\n      textLinkTheme.size[size],\n      underline\n        ? \"underline hover:no-underline\"\n        : \"no-underline hover:underline\",\n      className\n    );\n\n    const props = {\n      ref,\n      className: finalClassName,\n      ...rest,\n    };\n\n    if (external) {\n      return <a {...props}>{children}</a>;\n    }\n\n    return (\n      <Link ref={ref} href={props.href} className={finalClassName}>\n        {children}\n      </Link>\n    );\n  }\n);\n\nexport default TextLink;\n","import { createSlice } from \"@reduxjs/toolkit\";\nimport { UserBookSerializersUserBook } from \"types/serializers\";\n\nexport type BookButtonStateType = {\n  open: boolean;\n  bookId: number;\n  referrerUserId: number;\n  isLoaded: boolean;\n  userBookStatusMap: Record<number, number> | null;\n};\n\nexport const bookButtonState: BookButtonStateType = {\n  open: false,\n  bookId: null,\n  referrerUserId: null,\n  isLoaded: false,\n  userBookStatusMap: undefined,\n};\n\nconst bookButtonSlice = createSlice({\n  name: \"BookButtonSlice\",\n  initialState: bookButtonState,\n  reducers: {\n    showBookDrawer(\n      state,\n      {\n        payload: { bookId, referrerUserId },\n      }: {\n        payload: {\n          bookId: number;\n          referrerUserId?: number;\n        };\n      }\n    ) {\n      state.open = true;\n      state.bookId = bookId;\n      state.referrerUserId = referrerUserId;\n    },\n    isLoaded(state) {\n      state.isLoaded = true;\n    },\n    hideBookDrawer(state) {\n      state.open = false;\n      state.bookId = null;\n      state.referrerUserId = null;\n    },\n    reset(state) {\n      state.bookId = null;\n      state.referrerUserId = null;\n    },\n    setUserBookStatusMap(state, { payload }: { payload: Record<number, number> | undefined }) {\n      state.userBookStatusMap = payload;\n    },\n    setUserBook(\n      state,\n      { payload: { userBook } }: { payload: { userBook: UserBookSerializersUserBook } }\n    ) {\n      state.userBookStatusMap[userBook.bookId] = userBook.statusId;\n    },\n    removeUserBook(state, { payload: { bookId } }: { payload: { bookId: number } }) {\n      delete state.userBookStatusMap[bookId];\n    },\n  },\n});\n\nexport const bookButtonActions = bookButtonSlice.actions;\n\nexport default bookButtonSlice.reducer;\n","import { createSlice } from \"@reduxjs/toolkit\";\nimport { BookStoreType } from \"types/BookType\";\nimport { ListSerializersListBook, ReadingJournalSerializersJournal, TagSerializersBasicTag, UserBookSerializersUserBook, UserBookSerializersUserBookDate } from \"types/serializers\";\n\nexport type BooksStateType = {\n  books: Record<number, BookStoreType>;\n};\n\nexport const booksState: BooksStateType = {\n  books: {}\n};\n\nconst booksSlice = createSlice({\n  name: \"BooksSlice\",\n  initialState: booksState,\n  reducers: {\n    setBook(state, { payload: { book } }: { payload: { book: BookStoreType } }) {\n      state.books[book.book.id] = book;\n    },\n    setUserBook(\n      state,\n      { payload: { userBook } }: { payload: { userBook: UserBookSerializersUserBook } }\n    ) {\n      state.books[userBook.bookId] = state.books[userBook.bookId] || {} as unknown as BookStoreType;\n      state.books[userBook.bookId].userBook = userBook;\n    },\n    removeUserBook(state, { payload: { bookId } }: { payload: { bookId: number } }) {\n      if(state.books[String(bookId)]?.userBook) {\n        delete state.books[String(bookId)].userBook;\n      }\n    },\n    setUserBookRead(\n      state,\n      { payload: { bookId, userBookRead } }: { payload: { bookId: number; userBookRead: UserBookSerializersUserBookDate } }\n    ) {\n      // Check if this is an update or an addition\n      let found = false;\n      state.books[bookId] = state.books[bookId] || {} as unknown as BookStoreType;\n      state.books[bookId].userBook.datesRead.forEach((dateRead, index) => {\n        if (dateRead.id === userBookRead.id) {\n          state.books[bookId].userBook.datesRead[index] = userBookRead;\n          found = true;\n        }\n      });\n\n      if(!found) {\n        state.books[bookId].userBook.datesRead.push(userBookRead);\n      }\n    },\n    removeUserBookRead(state, { payload: { bookId, userBookReadId } }: { payload: { bookId: number; userBookReadId: number } }) {\n      state.books[bookId].userBook.datesRead = state.books[bookId].userBook.datesRead.filter((ubr) => ubr.id !== userBookReadId);\n    },\n    setListBook(\n      state,\n      { payload: { bookId, listBook } }: { payload: { bookId: number; listBook: ListSerializersListBook } }\n    ) {\n      // Check if this is an update or an addition\n      let found = false;\n      state.books[bookId].listBooks.forEach((lb, index) => {\n        if (lb.id === listBook.id) {\n          state.books[bookId].listBooks[index] = listBook;\n          found = true;\n        }\n      });\n\n      if(!found) {\n        state.books[bookId].listBooks.push(listBook);\n      }\n    },\n    setListBooks(\n      state,\n      { payload: { bookId, listBooks } }: { payload: { bookId: number; listBooks: ListSerializersListBook[] } }\n    ) {\n      state.books[bookId].listBooks = listBooks;\n    },\n    removeListBook(state, { payload: { bookId, listBookId } }: { payload: { bookId: number; listBookId: number } }) {\n      state.books[bookId].listBooks = state.books[bookId].listBooks.filter((listBook) => listBook.id !== listBookId);\n    },\n    setTags(\n      state,\n      { payload: { bookId, tags } }: { payload: { bookId: number; tags: TagSerializersBasicTag[] } }\n    ) {\n      state.books[bookId].tags = tags;\n    },\n    removeJournal(state, { payload: { bookId, journalId } }: { payload: { bookId: number; journalId: number } }) {\n      state.books[bookId].journals = state.books[bookId].journals.filter((journal) => journal.id !== journalId);\n    },\n    setJournals(\n      state,\n      { payload: { bookId, journals } }: { payload: { bookId: number; journals: ReadingJournalSerializersJournal[] } }\n    ) {\n      state.books[bookId].journals = journals;\n    },\n  },\n});\n\nexport const bookActions = booksSlice.actions;\n\nexport default booksSlice.reducer;\n\nexport const { setBook, setUserBook, removeUserBook, setUserBookRead, removeUserBookRead, setListBook, removeListBook, setListBooks, setTags, removeJournal, setJournals } = booksSlice.actions;\n"],"names":["formatProdErrorMessage","code","$$observable","symbol_observable_default","randomString","ActionTypes","actionTypes_default","isPlainObject","obj","proto","createStore","reducer","preloadedState","enhancer","currentReducer","currentState","currentListeners","nextListeners","listenerIdCounter","isDispatching","ensureCanMutateNextListeners","listener","key","getState","subscribe","isSubscribed","listenerId","dispatch","action","replaceReducer","nextReducer","observable","outerSubscribe","observer","observeState","observerAsObserver","assertReducerShape","reducers","combineReducers","reducerKeys","finalReducers","i","finalReducerKeys","shapeAssertionError","e","state","hasChanged","nextState","previousStateForKey","nextStateForKey","compose","funcs","arg","a","b","args","applyMiddleware","middlewares","createStore2","store","middlewareAPI","chain","middleware","isAction","NOTHING","DRAFTABLE","DRAFT_STATE","die","error","getPrototypeOf","isDraft","value","isDraftable","_a","isMap","isSet","objectCtorString","Ctor","each","iter","getArchtype","entry","index","thing","has","prop","set","propOrOldValue","t","is","x","y","target","latest","shallowCopy","base","strict","isPlain","descriptors","keys","desc","freeze","deep","isFrozen","dontMutateFrozenCollections","plugins","getPlugin","pluginKey","plugin","currentScope","getCurrentScope","createScope","parent_","immer_","usePatchesInScope","scope","patchListener","revokeScope","leaveScope","revokeDraft","enterScope","immer2","draft","processResult","result","baseDraft","finalize","maybeFreeze","rootScope","path","childValue","finalizeProperty","resultEach","isSet2","parentState","targetObject","rootPath","targetIsSet","res","createProxyProxy","parent","isArray","traps","objectTraps","arrayTraps","revoke","proxy","source","readPropFromProto","peek","prepareCopy","createProxy","getDescriptorFromProto","current2","markChanged","owner","fn","Immer2","config","recipe","defaultBase","self","base2","hasError","p","ip","patches","inversePatches","current","patch","applyPatchesImpl","currentImpl","copy","immer","produce","createThunkMiddleware","extraArgument","next","thunk","withExtraArgument","composeWithDevTools","createAction","type","prepareAction","actionCreator","prepared","Tuple","_Tuple","items","arr","freezeDraftable","val","createNextState","emplace","map","handler","inserted","isBoolean","buildGetDefaultMiddleware","options","immutableCheck","serializableCheck","actionCreatorCheck","middlewareArray","thunkMiddleware","SHOULD_AUTOBATCH","createQueueWithTimer","timeout","notify","rAF","autoBatchEnhancer","notifying","shouldNotifyAtEndOfTick","notificationQueued","listeners","queueCallback","notifyListeners","l","listener2","wrappedListener","unsubscribe","buildGetDefaultEnhancers","middlewareEnhancer","autoBatch","enhancerArray","configureStore","getDefaultMiddleware","devTools","enhancers","rootReducer","isPlainObject2","finalMiddleware","finalCompose","compose2","getDefaultEnhancers","storeEnhancers","composedEnhancer","executeReducerBuilderCallback","builderCallback","actionsMap","actionMatchers","defaultCaseReducer","builder","typeOrActionCreator","matcher","isStateFunction","createReducer","initialState","mapOrBuilderCallback","finalActionMatchers","finalDefaultCaseReducer","getInitialState","frozenInitialState","caseReducers","reducer2","cr","previousState","caseReducer","isDraft2","isDraftable2","createNextState2","asyncThunkSymbol","getType","slice","actionKey","buildCreateSlice","creators","cAT","name","reducerPath","buildReducerCreators","reducerNames","context","contextMethods","name2","reducerName","reducerDefinition","reducerDetails","isAsyncThunkSliceReducerDefinition","handleThunkCaseReducerDefinition","handleNormalReducerDefinition","buildReducer","extraReducers","finalCaseReducers","sM","m","selectSelf","injectedSelectorCache","_reducer","makeSelectorProps","reducerPath2","injected","selectSlice","sliceState","getSelectors","selectState","selectorCache","selector","wrapSelector","injectable","pathOpt","newReducerPath","wrapper","rootState","createSlice","asyncThunk","payloadCreator","prepare","createNotation","maybeReducerWithPrepare","prepareCallback","isCaseReducerWithPrepareDefinition","fulfilled","pending","rejected","settled","noop","defaultFilter","user","useCurrentUser","filter","f","useSelector","getUserWithFilter","SvgChevronDown","props","React.createElement","Text","forwardRef","size","as","variant","children","className","rest","ref","finalClassName","classNames","textTheme","jsx","uiState","uiSlice","payload","uiActions","ui","currentUserState","currentUserSlice","bookId","score","newScore","token","expiresAt","likeable","likeableKey","editionId","listBook","promptId","answerId","userId","id","currentUserActions","currentUser","setMatchScore","toggleLike","deleteOwnedEdition","addOwnedEdition","deletePromptAnswer","addPromptAnswer","unfollowUser","followUser","pinPrompt","unPinPrompt","extendStatics","d","__extends","__","__assign","s","n","__rest","__awaiter","thisArg","_arguments","P","generator","adopt","resolve","reject","step","__generator","body","_","g","verb","v","op","__spreadArray","to","from","pack","ar","genericMessage","setPrototypeOf","InvariantError","_super","message","_this","invariant","condition","verbosityLevels","verbosityLevel","wrapConsoleMethod","method","version","maybe","global$1","prefixCounts","makeUniqueId","prefix","count","stringifyForDisplay","space","undefId","wrap","_i","arg0","getHandledErrorMsg","getFallbackErrorMsg","originalInvariant","newInvariantError","optionalParams","ApolloErrorMessageHandler","stringify","messageArgs","global","devAssert","isObjectLike","LineRegExp","getLocation","position","lastLineStart","line","match","printLocation","location","printSourceLocation","sourceLocation","firstLineColumnOffset","lineIndex","lineOffset","lineNum","columnOffset","columnNum","locationStr","lines","locationLine","subLineIndex","subLineColumnNum","subLines","printPrefixedLines","subLine","existingLines","padLen","toNormalizedOptions","firstArg","GraphQLError","rawArgs","_this$nodes","_nodeLocations$","_ref","nodes","positions","originalError","extensions","undefinedIfEmpty","nodeLocations","node","loc","pos","originalExtensions","output","formattedError","array","syntaxError","description","Location","startToken","endToken","Token","kind","start","end","column","QueryDocumentKeys","kindValues","isNode","maybeNode","maybeKind","OperationTypeNode","DirectiveLocation","Kind","isWhiteSpace","isDigit","isLetter","isNameStart","isNameContinue","dedentBlockStringLines","_firstNonEmptyLine2","commonIndent","firstNonEmptyLine","lastNonEmptyLine","_firstNonEmptyLine","indent","leadingWhitespace","str","printBlockString","escapedValue","isSingleLine","forceLeadingNewLine","hasTrailingTripleQuotes","hasTrailingQuote","hasTrailingSlash","forceTrailingNewline","printAsMultipleLines","skipLeadingNewLine","TokenKind","Lexer","startOfFileToken","nextToken","readNextToken","isPunctuatorTokenKind","isUnicodeScalarValue","isSupplementaryCodePoint","isLeadingSurrogate","isTrailingSurrogate","printCodePointAt","lexer","char","createToken","col","bodyLength","readComment","readBlockString","readString","readNumber","readName","firstCode","isFloat","readDigits","chunkStart","escape","readEscapedUnicodeVariableWidth","readEscapedUnicodeFixedWidth","readEscapedCharacter","point","readHexDigit","read16BitHexCode","trailingCode","lineStart","currentLine","blockLines","MAX_ARRAY_LENGTH","MAX_RECURSIVE_DEPTH","inspect","formatValue","seenValues","formatObjectValue","previouslySeenValues","isJSONable","jsonValue","formatArray","formatObject","object","entries","getObjectTag","len","remaining","tag","isProduction","instanceOf","constructor","_value$constructor","valueClassName","stringifiedValue","Source","locationOffset","isSource","parse","Parser","sourceObj","hasDescription","keywordToken","operation","operationToken","nameOrAlias","alias","isConst","item","hasTypeCondition","varName","directives","innerType","operationTypes","interfaces","fields","defaultValue","types","values","getTokenDesc","repeatable","locations","getTokenKindDesc","atToken","openKind","parseFn","closeKind","delimiterKind","maxTokens","printString","escapedRegExp","escapedReplacer","escapeSequences","BREAK","visit","root","visitor","visitorKeys","enterLeaveMap","getEnterLeaveForKind","stack","inArray","edits","ancestors","isLeaving","isEdited","editOffset","editKey","editValue","arrayKey","_enterLeaveMap$get","_enterLeaveMap$get2","visitFn","_node$kind","kindVisitor","print","ast","printDocASTReducer","MAX_LINE_LENGTH","join","varDefs","variable","selections","block","selectionSet","argsLine","typeCondition","variableDefinitions","isBlockString","hasMultilineItems","maybeArray","separator","_maybeArray$filter$jo","maybeString","_maybeArray$some","shouldInclude","variables","getInclusionDirectives","directive","ifArgument","evaledValue","hasDirectives","names","all","nameSet","uniqueCount","hasClientExports","document","isInclusionDirective","directiveArguments","directiveName","ifValue","defaultMakeData","forEach","hasOwnProperty","Trie$1","Trie","weakness","makeData","data","head","child","create","isObjRef","isReactNative","canUseWeakMap","canUseWeakSet","canUseSymbol","canUseAsyncIteratorSymbol","canUseDOM","usingJSDOM","canUseLayoutEffect","isNonNullObject","getFragmentQueryDocument","fragmentName","actualFragmentName","fragments","definition","query","createFragmentMap","symTable","fragment","getFragmentFromSelection","selection","fragmentMap","defaultDispose","StrongCache","max","dispose","older","newer","_WeakRef","_WeakMap","_FinalizationRegistry","finalizationBatchSize","WeakCache","iterator","scheduledCleanup","schedule","cache","AutoCleanedWeakCache","ret","AutoCleanedStrongCache","cacheSizeSymbol","cacheSizes","globalCaches","registerGlobalCache","getSize","getApolloClientMemoryInternals","_getApolloClientMemoryInternals","getInMemoryCacheMemoryInternals","_getInMemoryCacheMemoryInternals","getApolloCacheMemoryInternals","_getApolloCacheMemoryInternals","getCurrentCacheSizes","defaults","k","_b","_c","_d","_e","linkInfo","transformInfo","getWrapperInformation","isWrapper","isDefined","transform","recurseTransformInfo","link","canonicalStringify","stableObjectReplacer","sortingMap","everyKeyInOrder","unsortedKey","sortedKeys","sortedKey","sortedObject_1","makeReference","isReference","isDocumentNode","isStringValue","isBooleanValue","isIntValue","isFloatValue","isVariable","isObjectValue","isListValue","isEnumValue","isNullValue","valueToObjectRepresentation","argObj","nestedArgObj_1","variableValue","listValue","nestedArgArrayObj","storeKeyNameFromField","field","directivesObj","getStoreKeyName","KNOWN_DIRECTIVES","storeKeyNameStringify","fieldName","filterKeys","filteredArgs_1","completeFieldName","stringifiedArgs","previous","argumentsObjectFromField","argObj_1","resultKeyNameFromField","getTypenameFromResult","isField","fragments_1","typename","isInlineFragment","checkDocument","doc","operations","getOperationDefinition","getOperationName","getFragmentDefinitions","getQueryDefinition","queryDef","getFragmentDefinition","fragmentDef","getMainDefinition","queryDoc","fragmentDefinition","getDefaultValues","defaultValues","defs","def","currentContext","MISSING_VALUE","idCounter","makeSlotClass","callback","slots","saved","globalKey","host","globalHost","Slot","parentEntrySlot","arrayFromSet","maybeUnsubscribe","entryOrDep","emptySetPool","POOL_TARGET_SIZE","assert","optionalMessage","valueIs","valueGet","valueCopy","Entry","mightBeDirty","rememberParent","reallyRecompute","reportDirty","forgetChildren","eachParent","forgetChild","dep","reportDirtyChild","reportCleanChild","recomputeNewValue","maybeSubscribe","setClean","normalizeResult","oldValueCopy","reportClean","parentCount","parents","parentWasClean","removeDirtyChild","dc","_value","EntryMethods","depsByKey","depend","entryMethodName","defaultKeyTrie","defaultMakeCacheKey","caches","originalFunction","keyArgs","makeCacheKey","cacheOption","optimistic","dirtyKey","peekKey","forgetKey","identity","DocumentTransform","predicate","left","right","documentTransform","stableCacheKeys_1","cacheKeys","transformedDocument","otherTransform","printCache","origPrint","isNonEmptyArray","TYPENAME_FIELD","isEmpty","nullIfDocIsEmpty","getDirectiveMatcher","configs","tests","testConfig","test","makeInUseGetterFunction","defaultKey","inUse","removeDirectivesFromDocument","getInUseByOperationName","getInUseByFragmentName","getInUse","ancestor","operationCount","directiveMatcher","shouldRemoveField","nodeDirectives","originalFragmentDefsByPath","firstVisitMadeChanges","fieldOrInlineFragmentVisitor","docWithoutDirectiveSubtrees","_key","_parent","_path","originalNode","populateTransitiveVars","childFragmentName","allFragmentNamesUsed","fragmentWillBeRemoved","enterVisitor","usedVariableNames_1","varDef","addTypenameToDocument","skip","buildQueryFromSelectionSet","definitionOperation","modifiedDoc","removeClientSetsFromDocument","mergeDeep","sources","mergeDeepArray","merger","DeepMerger","defaultReconciler","property","reconciler","sourceKey","targetValue","_createForOfIteratorHelperLoose","o","allowArrayLike","it","_unsupportedIterableToArray","minLen","_arrayLikeToArray","arr2","_defineProperties","descriptor","_createClass","Constructor","protoProps","staticProps","hasSymbols","hasSymbol","getSymbol","SymbolIterator","SymbolObservable","SymbolSpecies","getMethod","getSpecies","ctor","Observable","isObservable","hostReportError","enqueue","cleanupSubscription","subscription","cleanup","closeSubscription","flushSubscription","queue","notifySubscription","onNotify","Subscription","subscriber","subscriptionObserver","SubscriptionObserver","_proto","_proto2","_proto3","done","_this2","C","_this3","_this4","hasSeed","hasValue","seed","acc","first","_this5","_len","startNext","_this6","subscriptions","outer","inner","completeIfDone","_iterator","_step","_len2","_key2","prototype","fakeObsSymbol","toString","cloneDeep","cloneDeepHelper","seen","copy_1","copy_2","deepFreeze","workSet","shallowFreeze","maybeDeepFreeze","compact","objects","mergeOptions","PROTOCOL_ERRORS_SYMBOL","graphQLResultHasProtocolErrors","isApolloError","err","generateErrorMessage","errors","ApolloError","graphQLErrors","protocolErrors","clientErrors","networkError","errorMessage","extraInfo","fnToStr","previousComparisons","equal","check","aTag","bTag","previouslyCompared","aKeys","definedKeys","bKeys","keyCount","aIterator","info","aKey","aValue","aCode","endsWith","nativeCodeSuffix","isDefinedKey","full","suffix","fromIndex","bSet","equalByQuery","aData","aRest","bData","bRest","equalBySelectionSet","aResult","bResult","seenSelections","selectionHasNonreactiveDirective","resultKey","aResultChild","bResultChild","childSelectionSet","aChildIsArray","bChildIsArray","length_1","directiveIsNonreactive","dir","ApolloCache","optimisticId","updateResult","transaction","otherOptions","diffOptions","latestDiff","diff","update","MissingFieldError","hasOwn","isNullish","defaultDataIdFromObject","__typename","_id","defaultConfig","normalizeConfig","shouldCanonizeResults","getTypenameFromStoreObject","objectOrReference","TypeOrFieldNameRegExp","fieldNameFromStoreName","storeFieldName","selectionSetMatchesResult","storeValueIsStoreObject","makeProcessedFieldsMerger","extractFragmentContext","DELETE","delModifier","INVALIDATE","EntityStore","policies","group","objOrRef","objOrIdOrRef","mergeIntoStore","dataId","storeObject","Layer","dependOnExistence","existing","incoming","merged","storeObjectReconciler","fieldsToDirty_1","changedFields_1","needToMerge_1","allDeleted_1","sharedDetails_1","fieldNameOrOptions","fieldValue","modify","newValue","checkReference","seenReference","someNonReference","newValue_1","limit","evicted","extraRootIds","newData","__META","rest_1","rootId","ids","snapshot","idsToRemove","root_1","found_1","workSet_1","CacheGroup","caching","makeDepKey","maybeDependOnExistenceOfEntity","entityId","supportsResultCaching","Root","resultCaching","Stump","layerId","replay","ownStoreObject","parentStoreObject","fromParent","existingObject","incomingObject","existingValue","incomingValue","isObjectOrArray","ObjectCanon","original","proto_1","array_1","firstValueIndex_1","obj_1","json","execSelectionSetKeyArgs","StoreReader","canonizeResults","peekArgs","other","returnPartialData","rootRef","execResult","missing","firstMissing","enclosingRef","objectsToMerge","missingMerger","handleMissing","resultName","finalResult","frozen","childResult","assertSelectionSetForIdValue","tree","cacheSlot","cacheInfoMap","getCacheInfo","forgetCache","rv","recallCache","makeVar","broadcast","oldListeners","attach","specifierInfoCache","lookupSpecifierInfo","spec","cacheKey","keyFieldsFnFromSpecifier","specifier","extract","keyObject","collectSpecifierPaths","schemaKeyPath","extracted","extractKeyPath","extractKey","keyArgsFnFromSpecifier","collected","keyPath","firstKey","firstChar","directiveName_1","directiveArgs","variableName","varKeyPath","extractor","getSpecifierPaths","toMerge","paths_1","currentPath_1","normalize","argsFromFieldSpecifier","nullKeyFieldsFn","simpleKeyArgsFn","_args","mergeTrueFn","mergeObjects","mergeFalseFn","Policies","partialContext","normalizeReadFieldOptions","policy","keyFn","specifierOrId","typePolicies","queryType","mutationType","subscriptionType","keyFields","setMerge","merge","read","which","old","possibleTypes","supertype","subtype","policy_1","supertypes_1","regExp","fuzzy","fuzzySupertypes","inbox","createIfMissing","fieldPolicies","supertypeSet","typenameSupertypeSet","workQueue_1","maybeEnqueue_1","needToCheckFuzzySubtypes","checkingFuzzySubtypes","fuzzyString","fieldSpec","specifierOrString","nameOrField","readOptions","makeFieldFunctionOptions","parentTypename","childTypename","storage","makeMergeObjectsFunction","toReference","canRead","readFieldArgs","argc","eType","iType","typesDiffer","getContextFlavor","clientOnly","deferred","flavored","StoreWriter","reader","overwrite","operationDefinition","mergeTree","fieldNodeSet","entityRef","applied","fieldsWithSelectionSets_1","hasSelectionSet_1","hasMergeFunction_1","childTree","warnAboutDataLoss","readField","result_1","resultFieldKey","getChildMergeTree","maybeRecycleChildMergeTree","dataRef","sets","previous_1","mergeMergeTrees","mergeTreeIsEmpty","fieldMap","limitingTrie","flatten","inheritedContext","visitedNode","getStorageArgs","e_1","i_1","getValue_1","eVal","iVal","aVal","emptyMergeTreePool","needToMergeMaps","remainingRightKeys_1","leftTree","warnings","existingRef","incomingObj","getChild","parentType","typeDotName","childTypenames","InMemoryCache","rootStore","resetResultIdentities","previousReader","c","watch","idToRemove","newOptimisticData","removeOptimistic","onWatchUpdated","perform","layer","optimisticData","alreadyDirty","lastDiff","createFragmentRegistry","FragmentRegistry","definitions","defined","unbound","spreadName","enqueueChildSpreads","knownFragmentDef","defsToAppend_1","spreads","NetworkStatus","isNetworkRequestInFlight","networkStatus","docCache","fragmentSourceMap","printFragmentWarnings","experimentalFragmentVariables","string","cacheKeyFromLoc","processFragments","seenKeys","sourceKeySet","stripLoc","parseDocument","parsed","gql","literals","resetCaches","disableFragmentWarnings","enableExperimentalFragmentVariables","disableExperimentalFragmentVariables","extras","gql_1","FollowedListFragment","FollowedPromptFragment","FollowedUserFragment","UserBookStatusFragment","OwnerFragment","UserBookReadFragment","EditionFragment","PublisherFragment","BookFragment","BookSeriesFragment","SeriesFragment","AuthorFragment","UserBylineFragment","ListFragment","ListBookFragment","LikeFragment","BookBylineFragment","PromptFragment","AuthorBylineFragment","PromptAnswerFragment","UserInfoFragment","CollectionImportResultFragment","MatchPercentageFragment","ReadingJournalSummaryFragment","ReadingJournalFragment","UserBookFragment","ActivityFragment","GoalFragment","NotificationFragment","NotificationDeliveryFragment","UserBlockFragment","TaggingFragment","TagFragment","BookCharacterFragment","CharacterFragment","ListBylineFragment","ImageFragment","BookMappingFragment","EditEditionFragment","BookEditFragment","CollectionImportFragment","CountryFragment","LanguageFragment","NotificationTypeFragment","UserBookFullFragment","PromptBookSummaryFragment","module","require$$0","contextKey","getApolloContext","React","React.createContext","useApolloClient","override","React.useContext","client","avatarTheme","calculateSourceUrl","subject","url","AVATAR_URL","AUTHOR_AVATAR_URL","urlFor","dimension","url1Width","url2Width","sourceUrl","normalizeImageUrl","url2x","enlargeUrl","Avatar","image","lazy","inline","alt","url1x","timmedAlt","finalAlt","Ct","$t","_t","Wt","Ut","Ft","It","E","Dt","kt","ct","ut","h","u","Ot","Vt","Kt","Xt","Jt","ft","U","qt","Qt","Zt","te","ee","oe","ae","ne","se","yt","xt","vt","wt","Tt","St","Rt","Et","Nt","Pt","q","$","V","Q","O","K","Z","tt","et","X","ot","w","j","W","r","I","at","T","z","nt","D","H","st","N","M","rt","S","A","J","Mt","At","G","Lt","mt","Y","pt","F","gt","zt","ht","bt","jt","lt","B","R","L","Yt","dt","Bt","Ht","Te","Gt","TextLink","external","underline","textLinkTheme","Link","bookButtonState","bookButtonSlice","referrerUserId","userBook","bookButtonActions","bookButton","booksState","booksSlice","book","userBookRead","found","dateRead","userBookReadId","ubr","lb","listBooks","listBookId","tags","journalId","journal","journals","books","setBook","setUserBook","removeUserBook","setUserBookRead","removeUserBookRead","setListBook","removeListBook","setListBooks","setTags","removeJournal","setJournals"],"mappings":"yoBACA,SAASA,EAAuBC,EAAM,CAC7B,MAAA,yBAAyBA,CAAI,4CAA4CA,CAAI,iFACtF,CAGA,IAAIC,GAAsC,OAAO,QAAW,YAAc,OAAO,YAAc,eAC3FC,GAA4BD,GAG5BE,GAAe,IAAM,KAAK,OAAA,EAAS,SAAS,EAAE,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,KAAK,GAAG,EAC/EC,GAAc,CAChB,KAAM,eAA+BD,GAAA,CAAc,GACnD,QAAS,kBAAkCA,GAAA,CAAc,GACzD,qBAAsB,IAAM,+BAA+BA,GAAc,CAAA,EAC3E,EACIE,GAAsBD,GAG1B,SAASE,GAAcC,EAAK,CACtB,GAAA,OAAOA,GAAQ,UAAYA,IAAQ,KAC9B,MAAA,GACT,IAAIC,EAAQD,EACZ,KAAO,OAAO,eAAeC,CAAK,IAAM,MAC9BA,EAAA,OAAO,eAAeA,CAAK,EAE9B,OAAA,OAAO,eAAeD,CAAG,IAAMC,GAAS,OAAO,eAAeD,CAAG,IAAM,IAChF,CAwDA,SAASE,GAAYC,EAASC,EAAgBC,EAAU,CAClD,GAAA,OAAOF,GAAY,WACf,MAAA,IAAI,MAA8CX,EAAuB,CAAC,CAAyF,EAE3K,GAAI,OAAOY,GAAmB,YAAc,OAAOC,GAAa,YAAc,OAAOA,GAAa,YAAc,OAAO,UAAU,CAAC,GAAM,WACtI,MAAM,IAAI,MAA8Cb,EAAuB,CAAC,CAAsQ,EAMpV,GAJA,OAAOY,GAAmB,YAAc,OAAOC,EAAa,MACnDA,EAAAD,EACMA,EAAA,QAEf,OAAOC,EAAa,IAAa,CAC/B,GAAA,OAAOA,GAAa,WAChB,MAAA,IAAI,MAA8Cb,EAAuB,CAAC,CAAsF,EAExK,OAAOa,EAASH,EAAW,EAAEC,EAASC,CAAc,CACtD,CACA,IAAIE,EAAiBH,EACjBI,EAAeH,EACfI,MAAuC,IACvCC,EAAgBD,EAChBE,EAAoB,EACpBC,EAAgB,GACpB,SAASC,GAA+B,CAClCH,IAAkBD,IACpBC,MAAoC,IACnBD,EAAA,QAAQ,CAACK,EAAUC,IAAQ,CAC5BL,EAAA,IAAIK,EAAKD,CAAQ,CAAA,CAChC,EAEL,CACA,SAASE,GAAW,CAClB,GAAIJ,EACF,MAAM,IAAI,MAA8CnB,EAAuB,CAAC,CAA0M,EAErR,OAAAe,CACT,CACA,SAASS,EAAUH,EAAU,CACvB,GAAA,OAAOA,GAAa,WAChB,MAAA,IAAI,MAA8CrB,EAAuB,CAAC,CAAsF,EAExK,GAAImB,EACF,MAAM,IAAI,MAA8CnB,EAAuB,CAAC,CAAqT,EAEvY,IAAIyB,EAAe,GACUL,IAC7B,MAAMM,EAAaR,IACL,OAAAD,EAAA,IAAIS,EAAYL,CAAQ,EAC/B,UAAuB,CAC5B,GAAKI,EAGL,IAAIN,EACF,MAAM,IAAI,MAA8CnB,EAAuB,CAAC,CAA0J,EAE7NyB,EAAA,GACcL,IAC7BH,EAAc,OAAOS,CAAU,EACZV,EAAA,KAAA,CAEvB,CACA,SAASW,EAASC,EAAQ,CACpB,GAAA,CAACrB,GAAcqB,CAAM,EACjB,MAAA,IAAI,MAA8C5B,EAAuB,CAAC,CAA+Z,EAE7e,GAAA,OAAO4B,EAAO,KAAS,IACzB,MAAM,IAAI,MAA8C5B,EAAuB,CAAC,CAAgH,EAE9L,GAAA,OAAO4B,EAAO,MAAS,SACzB,MAAM,IAAI,MAA8C5B,EAAuB,EAAE,CAAgJ,EAEnO,GAAImB,EACF,MAAM,IAAI,MAA8CnB,EAAuB,CAAC,CAAwC,EAEtH,GAAA,CACcmB,EAAA,GACDJ,EAAAD,EAAeC,EAAca,CAAM,CAAA,QAClD,CACgBT,EAAA,EAClB,CAEU,OADQH,EAAmBC,GAC3B,QAASI,GAAa,CACrBA,GAAA,CACV,EACMO,CACT,CACA,SAASC,EAAeC,EAAa,CAC/B,GAAA,OAAOA,GAAgB,WACnB,MAAA,IAAI,MAA8C9B,EAAuB,EAAE,CAA2F,EAE7Jc,EAAAgB,EACRH,EAAA,CACP,KAAMrB,GAAoB,OAAA,CAC3B,CACH,CACA,SAASyB,GAAa,CACpB,MAAMC,EAAiBR,EAChB,MAAA,CASL,UAAUS,EAAU,CAClB,GAAI,OAAOA,GAAa,UAAYA,IAAa,KACzC,MAAA,IAAI,MAA8CjC,EAAuB,EAAE,CAAqF,EAExK,SAASkC,GAAe,CACtB,MAAMC,EAAqBF,EACvBE,EAAmB,MACFA,EAAA,KAAKZ,GAAU,CAEtC,CACa,OAAAW,IAEN,CACL,YAFkBF,EAAeE,CAAY,CAE7C,CAEJ,EACA,CAAC/B,EAAyB,GAAI,CACrB,OAAA,IACT,CAAA,CAEJ,CACS,OAAAwB,EAAA,CACP,KAAMrB,GAAoB,IAAA,CAC3B,EACa,CACZ,SAAAqB,EACA,UAAAH,EACA,SAAAD,EACA,eAAAM,EACA,CAAC1B,EAAyB,EAAG4B,CAAA,CAGjC,CAoCA,SAASK,GAAmBC,EAAU,CACpC,OAAO,KAAKA,CAAQ,EAAE,QAASf,GAAQ,CAC/B,MAAAX,EAAU0B,EAASf,CAAG,EAIxB,GAAA,OAHiBX,EAAQ,OAAQ,CACnC,KAAML,GAAoB,IAAA,CAC3B,EAC2B,IACpB,MAAA,IAAI,MAA8CN,EAAuB,EAAE,CAAmT,EAElY,GAAA,OAAOW,EAAQ,OAAQ,CACzB,KAAML,GAAoB,qBAAqB,CAChD,CAAA,EAAM,IACC,MAAA,IAAI,MAA8CN,EAAuB,EAAE,CAAwb,CAC3gB,CACD,CACH,CACA,SAASsC,GAAgBD,EAAU,CAC3B,MAAAE,EAAc,OAAO,KAAKF,CAAQ,EAClCG,EAAgB,CAAA,EACtB,QAASC,EAAI,EAAGA,EAAIF,EAAY,OAAQE,IAAK,CACrC,MAAAnB,EAAMiB,EAAYE,CAAC,EAMrB,OAAOJ,EAASf,CAAG,GAAM,aACbkB,EAAAlB,CAAG,EAAIe,EAASf,CAAG,EAErC,CACM,MAAAoB,EAAmB,OAAO,KAAKF,CAAa,EAK9C,IAAAG,EACA,GAAA,CACFP,GAAmBI,CAAa,QACzBI,EAAG,CACYD,EAAAC,CACxB,CACA,OAAO,SAAqBC,EAAQ,CAAA,EAAIjB,EAAQ,CAC9C,GAAIe,EACI,MAAAA,EAQR,IAAIG,EAAa,GACjB,MAAMC,EAAY,CAAA,EAClB,QAASN,EAAI,EAAGA,EAAIC,EAAiB,OAAQD,IAAK,CAC1C,MAAAnB,EAAMoB,EAAiBD,CAAC,EACxB9B,EAAU6B,EAAclB,CAAG,EAC3B0B,EAAsBH,EAAMvB,CAAG,EAC/B2B,EAAkBtC,EAAQqC,EAAqBpB,CAAM,EACvD,GAAA,OAAOqB,EAAoB,IACV,MAAArB,GAAUA,EAAO,KAC9B,IAAI,MAA8C5B,EAAuB,EAAE,CAAsT,EAEzY+C,EAAUzB,CAAG,EAAI2B,EACjBH,EAAaA,GAAcG,IAAoBD,CACjD,CACA,OAAAF,EAAaA,GAAcJ,EAAiB,SAAW,OAAO,KAAKG,CAAK,EAAE,OACnEC,EAAaC,EAAYF,CAAA,CAEpC,CA0BA,SAASK,MAAWC,EAAO,CACrB,OAAAA,EAAM,SAAW,EACXC,GAAQA,EAEdD,EAAM,SAAW,EACZA,EAAM,CAAC,EAETA,EAAM,OAAO,CAACE,EAAGC,IAAM,IAAIC,IAASF,EAAEC,EAAE,GAAGC,CAAI,CAAC,CAAC,CAC1D,CAGA,SAASC,MAAmBC,EAAa,CACvC,OAAQC,GAAiB,CAAC/C,EAASC,IAAmB,CAC9C,MAAA+C,EAAQD,EAAa/C,EAASC,CAAc,EAClD,IAAIe,EAAW,IAAM,CACnB,MAAM,IAAI,MAA8C3B,EAAuB,EAAE,CAA4H,CAAA,EAE/M,MAAM4D,EAAgB,CACpB,SAAUD,EAAM,SAChB,SAAU,CAAC/B,KAAW2B,IAAS5B,EAASC,EAAQ,GAAG2B,CAAI,CAAA,EAEnDM,EAAQJ,EAAY,IAAKK,GAAeA,EAAWF,CAAa,CAAC,EACvE,OAAAjC,EAAWuB,GAAQ,GAAGW,CAAK,EAAEF,EAAM,QAAQ,EACpC,CACL,GAAGA,EACH,SAAAhC,CAAA,CACF,CAEJ,CAGA,SAASoC,GAASnC,EAAQ,CACxB,OAAOrB,GAAcqB,CAAM,GAAK,SAAUA,GAAU,OAAOA,EAAO,MAAS,QAC7E,CC/XA,IAAIoC,GAAU,OAAO,IAAI,eAAe,EACpCC,GAAY,OAAO,IAAI,iBAAiB,EACxCC,EAAc,OAAO,IAAI,aAAa,EAkC1C,SAASC,GAAIC,KAAUb,EAAM,CAM3B,MAAM,IAAI,MACR,8BAA8Ba,CAAK,yCAAA,CAEvC,CAGA,IAAIC,GAAiB,OAAO,eAC5B,SAASC,GAAQC,EAAO,CACtB,MAAO,CAAC,CAACA,GAAS,CAAC,CAACA,EAAML,CAAW,CACvC,CACA,SAASM,GAAYD,EAAO,OAC1B,OAAKA,EAEEhE,GAAcgE,CAAK,GAAK,MAAM,QAAQA,CAAK,GAAK,CAAC,CAACA,EAAMN,EAAS,GAAK,CAAC,GAACQ,EAAAF,EAAM,cAAN,MAAAE,EAAoBR,MAAcS,GAAMH,CAAK,GAAKI,GAAMJ,CAAK,EADnI,EAEX,CACA,IAAIK,GAAmB,OAAO,UAAU,YAAY,SAAS,EAC7D,SAASrE,GAAcgE,EAAO,CACxB,GAAA,CAACA,GAAS,OAAOA,GAAU,SACtB,MAAA,GACH,MAAA9D,EAAQ4D,GAAeE,CAAK,EAClC,GAAI9D,IAAU,KACL,MAAA,GAET,MAAMoE,EAAO,OAAO,eAAe,KAAKpE,EAAO,aAAa,GAAKA,EAAM,YACvE,OAAIoE,IAAS,OACJ,GACF,OAAOA,GAAQ,YAAc,SAAS,SAAS,KAAKA,CAAI,IAAMD,EACvE,CAMA,SAASE,GAAKtE,EAAKuE,EAAM,CACnBC,GAAYxE,CAAG,IAAM,EACvB,QAAQ,QAAQA,CAAG,EAAE,QAASc,GAAQ,CACpCyD,EAAKzD,EAAKd,EAAIc,CAAG,EAAGd,CAAG,CAAA,CACxB,EAEGA,EAAA,QAAQ,CAACyE,EAAOC,IAAUH,EAAKG,EAAOD,EAAOzE,CAAG,CAAC,CAEzD,CACA,SAASwE,GAAYG,EAAO,CACpB,MAAAtC,EAAQsC,EAAMjB,CAAW,EAC/B,OAAOrB,EAAQA,EAAM,MAAQ,MAAM,QAAQsC,CAAK,EAAI,EAAgBT,GAAMS,CAAK,EAAI,EAAcR,GAAMQ,CAAK,EAAI,EAAc,CAChI,CACA,SAASC,GAAID,EAAOE,EAAM,CACxB,OAAOL,GAAYG,CAAK,IAAM,EAAcA,EAAM,IAAIE,CAAI,EAAI,OAAO,UAAU,eAAe,KAAKF,EAAOE,CAAI,CAChH,CAIA,SAASC,GAAIH,EAAOI,EAAgBhB,EAAO,CACnC,MAAAiB,EAAIR,GAAYG,CAAK,EACvBK,IAAM,EACFL,EAAA,IAAII,EAAgBhB,CAAK,EACxBiB,IAAM,EACbL,EAAM,IAAIZ,CAAK,EAEfY,EAAMI,CAAc,EAAIhB,CAC5B,CACA,SAASkB,GAAGC,EAAGC,EAAG,CAChB,OAAID,IAAMC,EACDD,IAAM,GAAK,EAAIA,IAAM,EAAIC,EAEzBD,IAAMA,GAAKC,IAAMA,CAE5B,CACA,SAASjB,GAAMkB,EAAQ,CACrB,OAAOA,aAAkB,GAC3B,CACA,SAASjB,GAAMiB,EAAQ,CACrB,OAAOA,aAAkB,GAC3B,CACA,SAASC,GAAOhD,EAAO,CACd,OAAAA,EAAM,OAASA,EAAM,KAC9B,CACA,SAASiD,GAAYC,EAAMC,EAAQ,CAC7B,GAAAtB,GAAMqB,CAAI,EACL,OAAA,IAAI,IAAIA,CAAI,EAEjB,GAAApB,GAAMoB,CAAI,EACL,OAAA,IAAI,IAAIA,CAAI,EAEjB,GAAA,MAAM,QAAQA,CAAI,EACpB,OAAO,MAAM,UAAU,MAAM,KAAKA,CAAI,EAClC,MAAAE,EAAU1F,GAAcwF,CAAI,EAClC,GAAIC,IAAW,IAAQA,IAAW,cAAgB,CAACC,EAAS,CACpD,MAAAC,EAAc,OAAO,0BAA0BH,CAAI,EACzD,OAAOG,EAAYhC,CAAW,EAC1B,IAAAiC,EAAO,QAAQ,QAAQD,CAAW,EACtC,QAASzD,EAAI,EAAGA,EAAI0D,EAAK,OAAQ1D,IAAK,CAC9B,MAAAnB,EAAM6E,EAAK1D,CAAC,EACZ2D,EAAOF,EAAY5E,CAAG,EACxB8E,EAAK,WAAa,KACpBA,EAAK,SAAW,GAChBA,EAAK,aAAe,KAElBA,EAAK,KAAOA,EAAK,OACnBF,EAAY5E,CAAG,EAAI,CACjB,aAAc,GACd,SAAU,GAEV,WAAY8E,EAAK,WACjB,MAAOL,EAAKzE,CAAG,CAAA,EAErB,CACA,OAAO,OAAO,OAAO+C,GAAe0B,CAAI,EAAGG,CAAW,CAAA,KACjD,CACC,MAAAzF,EAAQ4D,GAAe0B,CAAI,EAC7B,GAAAtF,IAAU,MAAQwF,EACb,MAAA,CAAE,GAAGF,GAER,MAAAvF,EAAM,OAAO,OAAOC,CAAK,EACxB,OAAA,OAAO,OAAOD,EAAKuF,CAAI,CAChC,CACF,CACA,SAASM,GAAO7F,EAAK8F,EAAO,GAAO,CAC7B,OAAAC,GAAS/F,CAAG,GAAK8D,GAAQ9D,CAAG,GAAK,CAACgE,GAAYhE,CAAG,IAEjDwE,GAAYxE,CAAG,EAAI,IACrBA,EAAI,IAAMA,EAAI,IAAMA,EAAI,MAAQA,EAAI,OAASgG,IAE/C,OAAO,OAAOhG,CAAG,EACb8F,GACF,OAAO,QAAQ9F,CAAG,EAAE,QAAQ,CAAC,CAACc,EAAKiD,CAAK,IAAM8B,GAAO9B,EAAO,EAAI,CAAC,GAC5D/D,CACT,CACA,SAASgG,IAA8B,CACrCrC,GAAI,CAAC,CACP,CACA,SAASoC,GAAS/F,EAAK,CACd,OAAA,OAAO,SAASA,CAAG,CAC5B,CAGA,IAAIiG,GAAU,CAAA,EACd,SAASC,GAAUC,EAAW,CACtB,MAAAC,EAASH,GAAQE,CAAS,EAChC,OAAKC,GACHzC,GAAI,EAAGwC,CAAS,EAEXC,CACT,CAOA,IAAIC,GACJ,SAASC,IAAkB,CAClB,OAAAD,EACT,CACA,SAASE,GAAYC,EAASC,EAAQ,CAC7B,MAAA,CACL,QAAS,CAAC,EACV,QAAAD,EACA,OAAAC,EAGA,eAAgB,GAChB,mBAAoB,CAAA,CAExB,CACA,SAASC,GAAkBC,EAAOC,EAAe,CAC3CA,IACFV,GAAU,SAAS,EACnBS,EAAM,SAAW,GACjBA,EAAM,gBAAkB,GACxBA,EAAM,eAAiBC,EAE3B,CACA,SAASC,GAAYF,EAAO,CAC1BG,GAAWH,CAAK,EACVA,EAAA,QAAQ,QAAQI,EAAW,EACjCJ,EAAM,QAAU,IAClB,CACA,SAASG,GAAWH,EAAO,CACrBA,IAAUN,KACZA,GAAeM,EAAM,QAEzB,CACA,SAASK,GAAWC,EAAQ,CACnB,OAAAZ,GAAeE,GAAYF,GAAcY,CAAM,CACxD,CACA,SAASF,GAAYG,EAAO,CACpB,MAAA7E,EAAQ6E,EAAMxD,CAAW,EAC3BrB,EAAM,QAAU,GAAkBA,EAAM,QAAU,EACpDA,EAAM,QAAQ,EAEdA,EAAM,SAAW,EACrB,CAGA,SAAS8E,GAAcC,EAAQT,EAAO,CAC9BA,EAAA,mBAAqBA,EAAM,QAAQ,OACnC,MAAAU,EAAYV,EAAM,QAAQ,CAAC,EAEjC,OADmBS,IAAW,QAAUA,IAAWC,GAE7CA,EAAU3D,CAAW,EAAE,YACzBmD,GAAYF,CAAK,EACjBhD,GAAI,CAAC,GAEHK,GAAYoD,CAAM,IACXA,EAAAE,GAASX,EAAOS,CAAM,EAC1BT,EAAM,SACTY,GAAYZ,EAAOS,CAAM,GAEzBT,EAAM,UACRT,GAAU,SAAS,EAAE,4BACnBmB,EAAU3D,CAAW,EAAE,MACvB0D,EACAT,EAAM,SACNA,EAAM,eAAA,GAIVS,EAASE,GAASX,EAAOU,EAAW,CAAE,CAAA,EAExCR,GAAYF,CAAK,EACbA,EAAM,UACRA,EAAM,eAAeA,EAAM,SAAUA,EAAM,eAAe,EAErDS,IAAW5D,GAAU4D,EAAS,MACvC,CACA,SAASE,GAASE,EAAWzD,EAAO0D,EAAM,CACxC,GAAI1B,GAAShC,CAAK,EACT,OAAAA,EACH,MAAA1B,EAAQ0B,EAAML,CAAW,EAC/B,GAAI,CAACrB,EACH,OAAAiC,GACEP,EACA,CAACjD,EAAK4G,IAAeC,GAAiBH,EAAWnF,EAAO0B,EAAOjD,EAAK4G,EAAYD,CAAI,CAAA,EAE/E1D,EAET,GAAI1B,EAAM,SAAWmF,EACZ,OAAAzD,EACL,GAAA,CAAC1B,EAAM,UACG,OAAAkF,GAAAC,EAAWnF,EAAM,MAAO,EAAI,EACjCA,EAAM,MAEX,GAAA,CAACA,EAAM,WAAY,CACrBA,EAAM,WAAa,GACnBA,EAAM,OAAO,qBACb,MAAM+E,EAAS/E,EAAM,MACrB,IAAIuF,EAAaR,EACbS,EAAS,GACTxF,EAAM,QAAU,IACLuF,EAAA,IAAI,IAAIR,CAAM,EAC3BA,EAAO,MAAM,EACJS,EAAA,IAEXvD,GACEsD,EACA,CAAC9G,EAAK4G,IAAeC,GAAiBH,EAAWnF,EAAO+E,EAAQtG,EAAK4G,EAAYD,EAAMI,CAAM,CAAA,EAEnFN,GAAAC,EAAWJ,EAAQ,EAAK,EAChCK,GAAQD,EAAU,UACpBtB,GAAU,SAAS,EAAE,iBACnB7D,EACAoF,EACAD,EAAU,SACVA,EAAU,eAAA,CAGhB,CACA,OAAOnF,EAAM,KACf,CACA,SAASsF,GAAiBH,EAAWM,EAAaC,EAAclD,EAAM6C,EAAYM,EAAUC,EAAa,CAGnG,GAAAnE,GAAQ4D,CAAU,EAAG,CACvB,MAAMD,EAAOO,GAAYF,GAAeA,EAAY,QAAU,GAC9D,CAAClD,GAAIkD,EAAY,UAAWjD,CAAI,EAAImD,EAAS,OAAOnD,CAAI,EAAI,OACtDqD,EAAMZ,GAASE,EAAWE,EAAYD,CAAI,EAE5C,GADA3C,GAAAiD,EAAclD,EAAMqD,CAAG,EACvBpE,GAAQoE,CAAG,EACbV,EAAU,eAAiB,OAE3B,aACOS,GACTF,EAAa,IAAIL,CAAU,EAE7B,GAAI1D,GAAY0D,CAAU,GAAK,CAAC3B,GAAS2B,CAAU,EAAG,CACpD,GAAI,CAACF,EAAU,OAAO,aAAeA,EAAU,mBAAqB,EAClE,OAEFF,GAASE,EAAWE,CAAU,GACzB,CAACI,GAAe,CAACA,EAAY,OAAO,UAAY,OAAOjD,GAAS,UAAY,OAAO,UAAU,qBAAqB,KAAKkD,EAAclD,CAAI,GAC5I0C,GAAYC,EAAWE,CAAU,CACrC,CACF,CACA,SAASH,GAAYZ,EAAO5C,EAAO+B,EAAO,GAAO,CAC3C,CAACa,EAAM,SAAWA,EAAM,OAAO,aAAeA,EAAM,gBACtDd,GAAO9B,EAAO+B,CAAI,CAEtB,CAGA,SAASqC,GAAiB5C,EAAM6C,EAAQ,CAChC,MAAAC,EAAU,MAAM,QAAQ9C,CAAI,EAC5BlD,EAAQ,CACZ,MAAOgG,EAAU,EAAgB,EAEjC,OAAQD,EAASA,EAAO,OAAS9B,GAAgB,EAEjD,UAAW,GAEX,WAAY,GAEZ,UAAW,CAAC,EAEZ,QAAS8B,EAET,MAAO7C,EAEP,OAAQ,KAGR,MAAO,KAEP,QAAS,KACT,UAAW,EAAA,EAEb,IAAIH,EAAS/C,EACTiG,EAAQC,GACRF,IACFjD,EAAS,CAAC/C,CAAK,EACPiG,EAAAE,IAEV,KAAM,CAAE,OAAAC,EAAQ,MAAAC,GAAU,MAAM,UAAUtD,EAAQkD,CAAK,EACvD,OAAAjG,EAAM,OAASqG,EACfrG,EAAM,QAAUoG,EACTC,CACT,CACA,IAAIH,GAAc,CAChB,IAAIlG,EAAOwC,EAAM,CACf,GAAIA,IAASnB,EACJ,OAAArB,EACH,MAAAsG,EAAStD,GAAOhD,CAAK,EAC3B,GAAI,CAACuC,GAAI+D,EAAQ9D,CAAI,EACZ,OAAA+D,GAAkBvG,EAAOsG,EAAQ9D,CAAI,EAExC,MAAAd,EAAQ4E,EAAO9D,CAAI,EACzB,OAAIxC,EAAM,YAAc,CAAC2B,GAAYD,CAAK,EACjCA,EAELA,IAAU8E,GAAKxG,EAAM,MAAOwC,CAAI,GAClCiE,GAAYzG,CAAK,EACVA,EAAM,MAAMwC,CAAI,EAAIkE,GAAYhF,EAAO1B,CAAK,GAE9C0B,CACT,EACA,IAAI1B,EAAOwC,EAAM,CACR,OAAAA,KAAQQ,GAAOhD,CAAK,CAC7B,EACA,QAAQA,EAAO,CACb,OAAO,QAAQ,QAAQgD,GAAOhD,CAAK,CAAC,CACtC,EACA,IAAIA,EAAOwC,EAAMd,EAAO,CACtB,MAAM6B,EAAOoD,GAAuB3D,GAAOhD,CAAK,EAAGwC,CAAI,EACvD,GAAIe,GAAA,MAAAA,EAAM,IACR,OAAAA,EAAK,IAAI,KAAKvD,EAAM,OAAQ0B,CAAK,EAC1B,GAEL,GAAA,CAAC1B,EAAM,UAAW,CACpB,MAAM4G,EAAWJ,GAAKxD,GAAOhD,CAAK,EAAGwC,CAAI,EACnCtE,EAAe0I,GAAA,YAAAA,EAAWvF,GAC5B,GAAAnD,GAAgBA,EAAa,QAAUwD,EACnC,OAAA1B,EAAA,MAAMwC,CAAI,EAAId,EACd1B,EAAA,UAAUwC,CAAI,EAAI,GACjB,GAEL,GAAAI,GAAGlB,EAAOkF,CAAQ,IAAMlF,IAAU,QAAUa,GAAIvC,EAAM,MAAOwC,CAAI,GAC5D,MAAA,GACTiE,GAAYzG,CAAK,EACjB6G,GAAY7G,CAAK,CACnB,CACI,OAAAA,EAAM,MAAMwC,CAAI,IAAMd,IACzBA,IAAU,QAAUc,KAAQxC,EAAM,QACnC,OAAO,MAAM0B,CAAK,GAAK,OAAO,MAAM1B,EAAM,MAAMwC,CAAI,CAAC,IAE/CxC,EAAA,MAAMwC,CAAI,EAAId,EACd1B,EAAA,UAAUwC,CAAI,EAAI,IACjB,EACT,EACA,eAAexC,EAAOwC,EAAM,CACtB,OAAAgE,GAAKxG,EAAM,MAAOwC,CAAI,IAAM,QAAUA,KAAQxC,EAAM,OAChDA,EAAA,UAAUwC,CAAI,EAAI,GACxBiE,GAAYzG,CAAK,EACjB6G,GAAY7G,CAAK,GAEV,OAAAA,EAAM,UAAUwC,CAAI,EAEzBxC,EAAM,OACD,OAAAA,EAAM,MAAMwC,CAAI,EAElB,EACT,EAGA,yBAAyBxC,EAAOwC,EAAM,CAC9B,MAAAsE,EAAQ9D,GAAOhD,CAAK,EACpBuD,EAAO,QAAQ,yBAAyBuD,EAAOtE,CAAI,EACzD,OAAKe,GAEE,CACL,SAAU,GACV,aAAcvD,EAAM,QAAU,GAAiBwC,IAAS,SACxD,WAAYe,EAAK,WACjB,MAAOuD,EAAMtE,CAAI,CAAA,CAErB,EACA,gBAAiB,CACflB,GAAI,EAAE,CACR,EACA,eAAetB,EAAO,CACb,OAAAwB,GAAexB,EAAM,KAAK,CACnC,EACA,gBAAiB,CACfsB,GAAI,EAAE,CACR,CACF,EACI6E,GAAa,CAAA,EACjBlE,GAAKiE,GAAa,CAACzH,EAAKsI,IAAO,CAClBZ,GAAA1H,CAAG,EAAI,UAAW,CAC3B,iBAAU,CAAC,EAAI,UAAU,CAAC,EAAE,CAAC,EACtBsI,EAAG,MAAM,KAAM,SAAS,CAAA,CAEnC,CAAC,EACDZ,GAAW,eAAiB,SAASnG,EAAOwC,EAAM,CAGhD,OAAO2D,GAAW,IAAI,KAAK,KAAMnG,EAAOwC,EAAM,MAAM,CACtD,EACA2D,GAAW,IAAM,SAASnG,EAAOwC,EAAMd,EAAO,CAGrC,OAAAwE,GAAY,IAAI,KAAK,KAAMlG,EAAM,CAAC,EAAGwC,EAAMd,EAAO1B,EAAM,CAAC,CAAC,CACnE,EACA,SAASwG,GAAK3B,EAAOrC,EAAM,CACnB,MAAAxC,EAAQ6E,EAAMxD,CAAW,EAE/B,OADerB,EAAQgD,GAAOhD,CAAK,EAAI6E,GACzBrC,CAAI,CACpB,CACA,SAAS+D,GAAkBvG,EAAOsG,EAAQ9D,EAAM,OACxC,MAAAe,EAAOoD,GAAuBL,EAAQ9D,CAAI,EACzC,OAAAe,EAAO,UAAWA,EAAOA,EAAK,OAGnC3B,EAAA2B,EAAK,MAAL,YAAA3B,EAAU,KAAK5B,EAAM,QACnB,MACN,CACA,SAAS2G,GAAuBL,EAAQ9D,EAAM,CAC5C,GAAI,EAAEA,KAAQ8D,GACL,OACL,IAAA1I,EAAQ4D,GAAe8E,CAAM,EACjC,KAAO1I,GAAO,CACZ,MAAM2F,EAAO,OAAO,yBAAyB3F,EAAO4E,CAAI,EACpD,GAAAe,EACK,OAAAA,EACT3F,EAAQ4D,GAAe5D,CAAK,CAC9B,CAEF,CACA,SAASiJ,GAAY7G,EAAO,CACrBA,EAAM,YACTA,EAAM,UAAY,GACdA,EAAM,SACR6G,GAAY7G,EAAM,OAAO,EAG/B,CACA,SAASyG,GAAYzG,EAAO,CACrBA,EAAM,QACTA,EAAM,MAAQiD,GACZjD,EAAM,MACNA,EAAM,OAAO,OAAO,qBAAA,EAG1B,CAGA,IAAIgH,GAAS,KAAM,CACjB,YAAYC,EAAQ,CAClB,KAAK,YAAc,GACnB,KAAK,sBAAwB,GAoB7B,KAAK,QAAU,CAAC/D,EAAMgE,EAAQ3C,IAAkB,CAC9C,GAAI,OAAOrB,GAAS,YAAc,OAAOgE,GAAW,WAAY,CAC9D,MAAMC,EAAcD,EACXA,EAAAhE,EACT,MAAMkE,EAAO,KACb,OAAO,SAAwBC,EAAQF,KAAgBzG,EAAM,CACpD,OAAA0G,EAAK,QAAQC,EAAQxC,GAAUqC,EAAO,KAAK,KAAMrC,EAAO,GAAGnE,CAAI,CAAC,CAAA,CAE3E,CACI,OAAOwG,GAAW,YACpB5F,GAAI,CAAC,EACHiD,IAAkB,QAAU,OAAOA,GAAkB,YACvDjD,GAAI,CAAC,EACH,IAAAyD,EACA,GAAApD,GAAYuB,CAAI,EAAG,CACf,MAAAoB,EAAQK,GAAW,IAAI,EACvB0B,EAAQK,GAAYxD,EAAM,MAAM,EACtC,IAAIoE,EAAW,GACX,GAAA,CACFvC,EAASmC,EAAOb,CAAK,EACViB,EAAA,EAAA,QACX,CACIA,EACF9C,GAAYF,CAAK,EAEjBG,GAAWH,CAAK,CACpB,CACA,OAAAD,GAAkBC,EAAOC,CAAa,EAC/BO,GAAcC,EAAQT,CAAK,CACzB,SAAA,CAACpB,GAAQ,OAAOA,GAAS,SAAU,CAQ5C,GAPA6B,EAASmC,EAAOhE,CAAI,EAChB6B,IAAW,SACJA,EAAA7B,GACP6B,IAAW5D,KACJ4D,EAAA,QACP,KAAK,aACPvB,GAAOuB,EAAQ,EAAI,EACjBR,EAAe,CACjB,MAAMgD,EAAI,CAAA,EACJC,EAAK,CAAA,EACX3D,GAAU,SAAS,EAAE,4BAA4BX,EAAM6B,EAAQwC,EAAGC,CAAE,EACpEjD,EAAcgD,EAAGC,CAAE,CACrB,CACO,OAAAzC,CACT,MACEzD,GAAI,EAAG4B,CAAI,CAAA,EAEV,KAAA,mBAAqB,CAACA,EAAMgE,IAAW,CACtC,GAAA,OAAOhE,GAAS,WAClB,MAAO,CAAClD,KAAUU,IAAS,KAAK,mBAAmBV,EAAQ6E,GAAU3B,EAAK2B,EAAO,GAAGnE,CAAI,CAAC,EAE3F,IAAI+G,EAASC,EAKN,MAAA,CAJQ,KAAK,QAAQxE,EAAMgE,EAAQ,CAACK,EAAGC,IAAO,CACzCC,EAAAF,EACOG,EAAAF,CAAA,CAClB,EACeC,EAASC,CAAc,CAAA,EAErC,OAAOT,GAAA,YAAAA,EAAQ,aAAe,WAC3B,KAAA,cAAcA,EAAO,UAAU,EAClC,OAAOA,GAAA,YAAAA,EAAQ,uBAAyB,WACrC,KAAA,wBAAwBA,EAAO,oBAAoB,CAC5D,CACA,YAAY/D,EAAM,CACXvB,GAAYuB,CAAI,GACnB5B,GAAI,CAAC,EACHG,GAAQyB,CAAI,IACdA,EAAOyE,GAAQzE,CAAI,GACf,MAAAoB,EAAQK,GAAW,IAAI,EACvB0B,EAAQK,GAAYxD,EAAM,MAAM,EAChC,OAAAmD,EAAAhF,CAAW,EAAE,UAAY,GAC/BoD,GAAWH,CAAK,EACT+B,CACT,CACA,YAAYxB,EAAON,EAAe,CAC1B,MAAAvE,EAAQ6E,GAASA,EAAMxD,CAAW,GACpC,CAACrB,GAAS,CAACA,EAAM,YACnBsB,GAAI,CAAC,EACD,KAAA,CAAE,OAAQgD,CAAU,EAAAtE,EAC1B,OAAAqE,GAAkBC,EAAOC,CAAa,EAC/BO,GAAc,OAAQR,CAAK,CACpC,CAMA,cAAc5C,EAAO,CACnB,KAAK,YAAcA,CACrB,CAMA,wBAAwBA,EAAO,CAC7B,KAAK,sBAAwBA,CAC/B,CACA,aAAawB,EAAMuE,EAAS,CACtB,IAAA7H,EACJ,IAAKA,EAAI6H,EAAQ,OAAS,EAAG7H,GAAK,EAAGA,IAAK,CAClC,MAAAgI,EAAQH,EAAQ7H,CAAC,EACvB,GAAIgI,EAAM,KAAK,SAAW,GAAKA,EAAM,KAAO,UAAW,CACrD1E,EAAO0E,EAAM,MACb,KACF,CACF,CACIhI,EAAI,KACI6H,EAAAA,EAAQ,MAAM7H,EAAI,CAAC,GAEzB,MAAAiI,EAAmBhE,GAAU,SAAS,EAAE,cAC1C,OAAApC,GAAQyB,CAAI,EACP2E,EAAiB3E,EAAMuE,CAAO,EAEhC,KAAK,QACVvE,EACC2B,GAAUgD,EAAiBhD,EAAO4C,CAAO,CAAA,CAE9C,CACF,EACA,SAASf,GAAYhF,EAAOqE,EAAQ,CAC5B,MAAAlB,EAAQhD,GAAMH,CAAK,EAAImC,GAAU,QAAQ,EAAE,UAAUnC,EAAOqE,CAAM,EAAIjE,GAAMJ,CAAK,EAAImC,GAAU,QAAQ,EAAE,UAAUnC,EAAOqE,CAAM,EAAID,GAAiBpE,EAAOqE,CAAM,EAElK,OADQA,EAASA,EAAO,OAAS9B,GAAgB,GACjD,QAAQ,KAAKY,CAAK,EACjBA,CACT,CAGA,SAAS8C,GAAQjG,EAAO,CAClB,OAACD,GAAQC,CAAK,GAChBJ,GAAI,GAAII,CAAK,EACRoG,GAAYpG,CAAK,CAC1B,CACA,SAASoG,GAAYpG,EAAO,CAC1B,GAAI,CAACC,GAAYD,CAAK,GAAKgC,GAAShC,CAAK,EAChC,OAAAA,EACH,MAAA1B,EAAQ0B,EAAML,CAAW,EAC3B,IAAA0G,EACJ,GAAI/H,EAAO,CACT,GAAI,CAACA,EAAM,UACT,OAAOA,EAAM,MACfA,EAAM,WAAa,GACnB+H,EAAO9E,GAAYvB,EAAO1B,EAAM,OAAO,OAAO,qBAAqB,CAAA,MAE5D+H,EAAA9E,GAAYvB,EAAO,EAAI,EAE3B,OAAAO,GAAA8F,EAAM,CAACtJ,EAAK4G,IAAe,CAC9B5C,GAAIsF,EAAMtJ,EAAKqJ,GAAYzC,CAAU,CAAC,CAAA,CACvC,EACGrF,IACFA,EAAM,WAAa,IAEd+H,CACT,CAyeA,IAAIC,EAAQ,IAAIhB,GACZiB,GAAUD,EAAM,QACKA,EAAM,mBAAmB,KAChDA,CACF,EACoBA,EAAM,cAAc,KAAKA,CAAK,EACpBA,EAAM,wBAAwB,KAAKA,CAAK,EACnDA,EAAM,aAAa,KAAKA,CAAK,EAC9BA,EAAM,YAAY,KAAKA,CAAK,EAC5BA,EAAM,YAAY,KAAKA,CAAK,ECjrC9C,SAASE,GAAsBC,EAAe,CAO5C,MANmB,CAAC,CAAE,SAAArJ,EAAU,SAAAJ,CAAQ,IAAQ0J,GAAUrJ,GACpD,OAAOA,GAAW,WACbA,EAAOD,EAAUJ,EAAUyJ,CAAa,EAE1CC,EAAKrJ,CAAM,CAGtB,CACA,IAAIsJ,GAAQH,GAAqB,EAC7BI,GAAoBJ,GCgBpBK,GAAsB,OAAO,OAAW,KAAe,OAAO,qCAAuC,OAAO,qCAAuC,UAAW,CAC5J,GAAA,UAAU,SAAW,EACzB,OAAI,OAAO,UAAU,CAAC,GAAM,SAAiBlI,GACtCA,GAAQ,MAAM,KAAM,SAAS,CACtC,EAmBA,SAASmI,GAAaC,EAAMC,EAAe,CACzC,SAASC,KAAiBjI,EAAM,CAC9B,GAAIgI,EAAe,CACb,IAAAE,EAAWF,EAAc,GAAGhI,CAAI,EACpC,GAAI,CAACkI,EACH,MAAM,IAAI,MAA8CzL,GAAuB,CAAC,CAA4C,EAEvH,MAAA,CACL,KAAAsL,EACA,QAASG,EAAS,QAClB,GAAG,SAAUA,GAAY,CACvB,KAAMA,EAAS,IACjB,EACA,GAAG,UAAWA,GAAY,CACxB,MAAOA,EAAS,KAClB,CAAA,CAEJ,CACO,MAAA,CACL,KAAAH,EACA,QAAS/H,EAAK,CAAC,CAAA,CAEnB,CACc,OAAAiI,EAAA,SAAW,IAAM,GAAGF,CAAI,GACtCE,EAAc,KAAOF,EACrBE,EAAc,MAAS5J,GAAWmC,GAASnC,CAAM,GAAKA,EAAO,OAAS0J,EAC/DE,CACT,CAiEA,IAAIE,GAAQ,MAAMC,WAAe,KAAM,CACrC,eAAeC,EAAO,CACpB,MAAM,GAAGA,CAAK,EACP,OAAA,eAAe,KAAMD,GAAO,SAAS,CAC9C,CACA,WAAY,OAAO,OAAO,GAAI,CACrB,OAAAA,EACT,CACA,UAAUE,EAAK,CACb,OAAO,MAAM,OAAO,MAAM,KAAMA,CAAG,CACrC,CACA,WAAWA,EAAK,CACV,OAAAA,EAAI,SAAW,GAAK,MAAM,QAAQA,EAAI,CAAC,CAAC,EACnC,IAAIF,GAAO,GAAGE,EAAI,CAAC,EAAE,OAAO,IAAI,CAAC,EAEnC,IAAIF,GAAO,GAAGE,EAAI,OAAO,IAAI,CAAC,CACvC,CACF,EACA,SAASC,GAAgBC,EAAK,CAC5B,OAAOvH,GAAYuH,CAAG,EAAIC,GAAgBD,EAAK,IAAM,CACpD,CAAA,EAAIA,CACP,CACA,SAASE,GAAQC,EAAK5K,EAAK6K,EAAS,CAC9B,GAAAD,EAAI,IAAI5K,CAAG,EAAG,CACZ,IAAAiD,EAAQ2H,EAAI,IAAI5K,CAAG,EACvB,OAAI6K,EAAQ,SACV5H,EAAQ4H,EAAQ,OAAO5H,EAAOjD,EAAK4K,CAAG,EAClCA,EAAA,IAAI5K,EAAKiD,CAAK,GAEbA,CACT,CACI,GAAA,CAAC4H,EAAQ,OAAc,MAAA,IAAI,MAA8CnM,GAAuB,EAAE,CAAmD,EACzJ,MAAMoM,EAAWD,EAAQ,OAAO7K,EAAK4K,CAAG,EACpC,OAAAA,EAAA,IAAI5K,EAAK8K,CAAQ,EACdA,CACT,CAyPA,SAASC,GAAU3G,EAAG,CACpB,OAAO,OAAOA,GAAM,SACtB,CACA,IAAI4G,GAA4B,IAAM,SAA8BC,EAAS,CACrE,KAAA,CACJrB,MAAAA,EAAQ,GACR,eAAAsB,EAAiB,GACjB,kBAAAC,EAAoB,GACpB,mBAAAC,EAAqB,EAAA,EACnBH,GAAW,CAAA,EACX,IAAAI,EAAkB,IAAIjB,GAC1B,OAAIR,IACEmB,GAAUnB,CAAK,EACjByB,EAAgB,KAAKC,EAAe,EAEpCD,EAAgB,KAAKxB,GAAkBD,EAAM,aAAa,CAAC,GA0BxDyB,CACT,EAGIE,GAAmB,gBAOnBC,GAAwBC,GAClBC,GAAW,CACjB,WAAWA,EAAQD,CAAO,CAAA,EAG1BE,GAAM,OAAO,OAAW,KAAe,OAAO,sBAAwB,OAAO,sBAAwBH,GAAqB,EAAE,EAC5HI,GAAoB,CAACX,EAAU,CACjC,KAAM,KACR,IAAOtB,GAAS,IAAI1H,IAAS,CACrB,MAAAI,EAAQsH,EAAK,GAAG1H,CAAI,EAC1B,IAAI4J,EAAY,GACZC,EAA0B,GAC1BC,EAAqB,GACnB,MAAAC,MAAgC,IAChCC,EAAgBhB,EAAQ,OAAS,OAAS,eAAiBA,EAAQ,OAAS,MAAQU,GAAMV,EAAQ,OAAS,WAAaA,EAAQ,kBAAoBO,GAAqBP,EAAQ,OAAO,EACxLiB,EAAkB,IAAM,CACPH,EAAA,GACjBD,IACwBA,EAAA,GAC1BE,EAAU,QAASG,GAAMA,EAAG,CAAA,EAC9B,EAEF,OAAO,OAAO,OAAO,CAAC,EAAG9J,EAAO,CAG9B,UAAU+J,EAAW,CACb,MAAAC,EAAkB,IAAMR,GAAaO,IACrCE,EAAcjK,EAAM,UAAUgK,CAAe,EACnD,OAAAL,EAAU,IAAII,CAAS,EAChB,IAAM,CACCE,IACZN,EAAU,OAAOI,CAAS,CAAA,CAE9B,EAGA,SAAS9L,EAAQ,OACX,GAAA,CACU,OAAAuL,EAAA,GAAC1I,EAAA7C,GAAA,YAAAA,EAAQ,OAAR,MAAA6C,EAAeoI,KAC5BO,EAA0B,CAACD,EACvBC,IACGC,IACkBA,EAAA,GACrBE,EAAcC,CAAe,IAG1B7J,EAAM,SAAS/B,CAAM,CAAA,QAC5B,CACYuL,EAAA,EACd,CACF,CAAA,CACD,CACH,EAGIU,GAA4BC,GAAuB,SAA6BvB,EAAS,CACrF,KAAA,CACJ,UAAAwB,EAAY,EAAA,EACVxB,GAAW,CAAA,EACX,IAAAyB,EAAgB,IAAItC,GAAMoC,CAAkB,EAChD,OAAIC,GACFC,EAAc,KAAKd,GAAkB,OAAOa,GAAc,SAAWA,EAAY,MAAM,CAAC,EAEnFC,CACT,EAGA,SAASC,GAAe1B,EAAS,CAC/B,MAAM2B,EAAuB5B,KACvB,CACJ,QAAA3L,EAAU,OACV,WAAAmD,EACA,SAAAqK,EAAW,GACX,eAAAvN,EAAiB,OACjB,UAAAwN,EAAY,MAAA,EACV7B,GAAW,CAAA,EACX,IAAA8B,EACA,GAAA,OAAO1N,GAAY,WACP0N,EAAA1N,UACL2N,GAAe3N,CAAO,EAC/B0N,EAAc/L,GAAgB3B,CAAO,MAErC,OAAM,IAAI,MAA8CX,GAAuB,CAAC,CAA8H,EAK5M,IAAAuO,EACA,OAAOzK,GAAe,WACxByK,EAAkBzK,EAAWoK,CAAoB,EAKjDK,EAAkBL,EAAqB,EAKzC,IAAIM,EAAeC,GACfN,IACFK,EAAepD,GAAoB,CAEjC,MAAO,GACP,GAAG,OAAO+C,GAAa,UAAYA,CAAA,CACpC,GAEG,MAAAL,EAAqBtK,GAAgB,GAAG+K,CAAe,EACvDG,EAAsBb,GAAyBC,CAAkB,EAIvE,IAAIa,EAAiB,OAAOP,GAAc,WAAaA,EAAUM,CAAmB,EAAIA,IAUlF,MAAAE,EAAmBJ,EAAa,GAAGG,CAAc,EAChD,OAAAjO,GAAY2N,EAAazN,EAAgBgO,CAAgB,CAClE,CAMA,SAASC,GAA8BC,EAAiB,CACtD,MAAMC,EAAa,CAAA,EACbC,EAAiB,CAAA,EACnB,IAAAC,EACJ,MAAMC,EAAU,CACd,QAAQC,EAAqBxO,EAAS,CASpC,MAAM2K,EAAO,OAAO6D,GAAwB,SAAWA,EAAsBA,EAAoB,KACjG,GAAI,CAAC7D,EACH,MAAM,IAAI,MAA8CtL,GAAuB,EAAE,CAAkE,EAErJ,GAAIsL,KAAQyD,EACJ,MAAA,IAAI,MAA8C/O,GAAuB,EAAE,CAA+F,EAElL,OAAA+O,EAAWzD,CAAI,EAAI3K,EACZuO,CACT,EACA,WAAWE,EAASzO,EAAS,CAM3B,OAAAqO,EAAe,KAAK,CAClB,QAAAI,EACA,QAAAzO,CAAA,CACD,EACMuO,CACT,EACA,eAAevO,EAAS,CAMD,OAAAsO,EAAAtO,EACduO,CACT,CAAA,EAEF,OAAAJ,EAAgBI,CAAO,EAChB,CAACH,EAAYC,EAAgBC,CAAkB,CACxD,CAGA,SAASI,GAAgB3J,EAAG,CAC1B,OAAO,OAAOA,GAAM,UACtB,CACA,SAAS4J,GAAcC,EAAcC,EAAsB,CAMzD,GAAI,CAACT,EAAYU,EAAqBC,CAAuB,EAAIb,GAA8BW,CAAoB,EAC/GG,EACA,GAAAN,GAAgBE,CAAY,EACZI,EAAA,IAAM7D,GAAgByD,EAAA,CAAc,MACjD,CACC,MAAAK,EAAqB9D,GAAgByD,CAAY,EACvDI,EAAkB,IAAMC,CAC1B,CACA,SAASjP,EAAQkC,EAAQ8M,EAAgB,EAAG/N,EAAQ,CAC9C,IAAAiO,EAAe,CAACd,EAAWnN,EAAO,IAAI,EAAG,GAAG6N,EAAoB,OAAO,CAAC,CAC1E,QAAAL,KACIA,EAAQxN,CAAM,CAAC,EAAE,IAAI,CAAC,CAC1B,QAASkO,CAAA,IACLA,CAAQ,CAAC,EACX,OAAAD,EAAa,OAAQE,GAAO,CAAC,CAACA,CAAE,EAAE,SAAW,IAC/CF,EAAe,CAACH,CAAuB,GAElCG,EAAa,OAAO,CAACG,EAAeC,IAAgB,CACzD,GAAIA,EACE,GAAAC,GAASF,CAAa,EAAG,CAErB,MAAApI,EAASqI,EADDD,EACoBpO,CAAM,EACxC,OAAIgG,IAAW,OACNoI,EAEFpI,CAAA,KACE,IAACuI,GAAaH,CAAa,EAU7B,OAAAI,GAAiBJ,EAAgBtI,GAC/BuI,EAAYvI,EAAO9F,CAAM,CACjC,EAZsC,CACjC,MAAAgG,EAASqI,EAAYD,EAAepO,CAAM,EAChD,GAAIgG,IAAW,OAAQ,CACrB,GAAIoI,IAAkB,KACb,OAAAA,EAET,MAAM,IAAI,MAA8ChQ,GAAuB,CAAC,CAAuE,CACzJ,CACO,OAAA4H,CAAA,EAOJ,OAAAoI,GACNnN,CAAK,CACV,CACA,OAAAlC,EAAQ,gBAAkBgP,EACnBhP,CACT,CAgRA,IAAI0P,GAA0C,OAAA,IAAI,4BAA4B,EAU9E,SAASC,GAAQC,EAAOC,EAAW,CAC1B,MAAA,GAAGD,CAAK,IAAIC,CAAS,EAC9B,CACA,SAASC,GAAiB,CACxB,SAAAC,CACF,EAAI,GAAI,OACA,MAAAC,GAAMlM,EAAAiM,GAAA,YAAAA,EAAU,aAAV,YAAAjM,EAAuB4L,IAC5B,OAAA,SAAsB9D,EAAS,CAC9B,KAAA,CACJ,KAAAqE,EACA,YAAAC,EAAcD,CACZ,EAAArE,EACJ,GAAI,CAACqE,EACH,MAAM,IAAI,MAA8C5Q,GAAuB,EAAE,CAAiD,EAEhI,OAAO,QAAY,IAKvB,MAAMqC,GAAY,OAAOkK,EAAQ,UAAa,WAAaA,EAAQ,SAASuE,GAAA,CAAsB,EAAIvE,EAAQ,WAAa,CAAA,EACrHwE,EAAe,OAAO,KAAK1O,CAAQ,EACnC2O,EAAU,CACd,wBAAyB,CAAC,EAC1B,wBAAyB,CAAC,EAC1B,eAAgB,CAAC,EACjB,cAAe,CAAC,CAAA,EAEZC,EAAiB,CACrB,QAAQ9B,EAAqBW,EAAU,CACrC,MAAMxE,EAAO,OAAO6D,GAAwB,SAAWA,EAAsBA,EAAoB,KACjG,GAAI,CAAC7D,EACH,MAAM,IAAI,MAA8CtL,GAAuB,EAAE,CAAkE,EAEjJ,GAAAsL,KAAQ0F,EAAQ,wBAClB,MAAM,IAAI,MAA8ChR,GAAuB,EAAE,CAA4F,EAEvK,OAAAgR,EAAA,wBAAwB1F,CAAI,EAAIwE,EACjCmB,CACT,EACA,WAAW7B,EAASU,EAAU,CAC5B,OAAAkB,EAAQ,cAAc,KAAK,CACzB,QAAA5B,EACA,QAASU,CAAA,CACV,EACMmB,CACT,EACA,aAAaC,EAAO1F,EAAe,CACzB,OAAAwF,EAAA,eAAeE,CAAK,EAAI1F,EACzByF,CACT,EACA,kBAAkBC,EAAOpB,EAAU,CACzB,OAAAkB,EAAA,wBAAwBE,CAAK,EAAIpB,EAClCmB,CACT,CAAA,EAEWF,EAAA,QAASI,GAAgB,CAC9B,MAAAC,EAAoB/O,EAAS8O,CAAW,EACxCE,EAAiB,CACrB,YAAAF,EACA,KAAMb,GAAQM,EAAMO,CAAW,EAC/B,eAAgB,OAAO5E,EAAQ,UAAa,UAAA,EAE1C+E,GAAmCF,CAAiB,EACrBG,GAAAF,EAAgBD,EAAmBH,EAAgBN,CAAG,EAEzDa,GAAAH,EAAgBD,EAAmBH,CAAc,CACjF,CACD,EACD,SAASQ,GAAe,CAMhB,KAAA,CAACC,EAAgB,GAAI1C,EAAiB,CAAA,EAAIC,EAAqB,MAAM,EAAI,OAAO1C,EAAQ,eAAkB,WAAasC,GAA8BtC,EAAQ,aAAa,EAAI,CAACA,EAAQ,aAAa,EACpMoF,EAAoB,CACxB,GAAGD,EACH,GAAGV,EAAQ,uBAAA,EAEb,OAAO1B,GAAc/C,EAAQ,aAAe2C,GAAY,CACtD,QAAS5N,KAAOqQ,EACdzC,EAAQ,QAAQ5N,EAAKqQ,EAAkBrQ,CAAG,CAAC,EAEpC,QAAAsQ,KAAMZ,EAAQ,cACrB9B,EAAQ,WAAW0C,EAAG,QAASA,EAAG,OAAO,EAE3C,QAASC,KAAK7C,EACZE,EAAQ,WAAW2C,EAAE,QAASA,EAAE,OAAO,EAErC5C,GACFC,EAAQ,eAAeD,CAAkB,CAC3C,CACD,CACH,CACM,MAAA6C,EAAcjP,GAAUA,EACxBkP,MAA4C,IAC9C,IAAAC,EACK,SAAArR,EAAQkC,EAAOjB,EAAQ,CAC1B,OAACoQ,IAAUA,EAAWP,KACnBO,EAASnP,EAAOjB,CAAM,CAC/B,CACA,SAAS+N,GAAkB,CACrB,OAACqC,IAAUA,EAAWP,KACnBO,EAAS,iBAClB,CACS,SAAAC,EAAkBC,EAAcC,EAAW,GAAO,CACzD,SAASC,EAAYvP,EAAO,CACtB,IAAAwP,EAAaxP,EAAMqP,CAAY,EAC/B,OAAA,OAAOG,EAAe,KACpBF,IACFE,EAAa1C,EAAgB,GAK1B0C,CACT,CACS,SAAAC,EAAaC,EAAcT,EAAY,CACxC,MAAAU,EAAgBvG,GAAQ8F,EAAuBI,EAAU,CAC7D,OAAQ,IAAsB,IAAI,OAAQ,CAC3C,EACM,OAAAlG,GAAQuG,EAAeD,EAAa,CACzC,OAAQ,IAAM,CACZ,MAAMrG,GAAM,CAAA,EACD,SAAA,CAACgF,GAAOuB,CAAQ,IAAK,OAAO,QAAQlG,EAAQ,WAAa,CAAA,CAAE,EACpEL,GAAIgF,EAAK,EAAIwB,GAAaD,EAAUF,EAAa5C,EAAiBwC,CAAQ,EAErE,OAAAjG,EACT,CAAA,CACD,CACH,CACO,MAAA,CACL,YAAagG,EACb,aAAAI,EACA,IAAI,WAAY,CACd,OAAOA,EAAaF,CAAW,CACjC,EACA,YAAAA,CAAA,CAEJ,CACA,MAAM7B,EAAQ,CACZ,KAAAK,EACA,QAAAjQ,EACA,QAASqQ,EAAQ,eACjB,aAAcA,EAAQ,wBACtB,gBAAArB,EACA,GAAGsC,EAAkBpB,CAAW,EAChC,WAAW8B,EAAY,CACrB,YAAaC,EACb,GAAG9I,CACL,EAAI,GAAI,CACN,MAAM+I,EAAiBD,GAAW/B,EAClC,OAAA8B,EAAW,OAAO,CAChB,YAAaE,EACb,QAAAlS,GACCmJ,CAAM,EACF,CACL,GAAGyG,EACH,GAAG0B,EAAkBY,EAAgB,EAAI,CAAA,CAE7C,CAAA,EAEK,OAAAtC,CAAA,CAEX,CACA,SAASmC,GAAaD,EAAUF,EAAa5C,EAAiBwC,EAAU,CAC7D,SAAAW,EAAQC,KAAcxP,EAAM,CAC/B,IAAA8O,EAAaE,EAAYQ,CAAS,EAClC,OAAA,OAAOV,EAAe,KACpBF,IACFE,EAAa1C,EAAgB,GAK1B8C,EAASJ,EAAY,GAAG9O,CAAI,CACrC,CACA,OAAAuP,EAAQ,UAAYL,EACbK,CACT,CACA,IAAIE,GAA+CvC,GAAA,EACnD,SAASK,IAAuB,CACrB,SAAAmC,EAAWC,EAAgBpJ,EAAQ,CACnC,MAAA,CACL,uBAAwB,aACxB,eAAAoJ,EACA,GAAGpJ,CAAA,CAEP,CACA,OAAAmJ,EAAW,UAAY,IAAMA,EACtB,CACL,QAAQhD,EAAa,CACnB,OAAO,OAAO,OAAO,CAGnB,CAACA,EAAY,IAAI,KAAK1M,EAAM,CACnB,OAAA0M,EAAY,GAAG1M,CAAI,CAC5B,CAAA,EACA0M,EAAY,IAAI,EAAG,CACnB,uBAAwB,SAAA,CACzB,CACH,EACA,gBAAgBkD,EAASxS,EAAS,CACzB,MAAA,CACL,uBAAwB,qBACxB,QAAAwS,EACA,QAAAxS,CAAA,CAEJ,EACA,WAAAsS,CAAA,CAEJ,CACA,SAASzB,GAA8B,CACrC,KAAAlG,EACA,YAAA6F,EACA,eAAAiC,CACF,EAAGC,EAAyBrC,EAAS,CAC/B,IAAAf,EACAqD,EACJ,GAAI,YAAaD,EAAyB,CACxC,GAAID,GAAkB,CAACG,GAAmCF,CAAuB,EAC/E,MAAM,IAAI,MAA8CrT,GAAuB,EAAE,CAA+G,EAElMiQ,EAAcoD,EAAwB,QACtCC,EAAkBD,EAAwB,OAAA,MAE5BpD,EAAAoD,EAEhBrC,EAAQ,QAAQ1F,EAAM2E,CAAW,EAAE,kBAAkBkB,EAAalB,CAAW,EAAE,aAAakB,EAAamC,EAAkBjI,GAAaC,EAAMgI,CAAe,EAAIjI,GAAaC,CAAI,CAAC,CACrL,CACA,SAASgG,GAAmCF,EAAmB,CAC7D,OAAOA,EAAkB,yBAA2B,YACtD,CACA,SAASmC,GAAmCnC,EAAmB,CAC7D,OAAOA,EAAkB,yBAA2B,oBACtD,CACA,SAASG,GAAiC,CACxC,KAAAjG,EACA,YAAA6F,CACF,EAAGC,EAAmBJ,EAASL,EAAK,CAClC,GAAI,CAACA,EACH,MAAM,IAAI,MAA8C3Q,GAAuB,EAAE,CAA4L,EAEzQ,KAAA,CACJ,eAAAkT,EACA,UAAAM,EACA,QAAAC,EACA,SAAAC,EACA,QAAAC,EACA,QAAApH,CACE,EAAA6E,EACElG,EAAQyF,EAAIrF,EAAM4H,EAAgB3G,CAAO,EACvCyE,EAAA,aAAaG,EAAajG,CAAK,EACnCsI,GACMxC,EAAA,QAAQ9F,EAAM,UAAWsI,CAAS,EAExCC,GACMzC,EAAA,QAAQ9F,EAAM,QAASuI,CAAO,EAEpCC,GACM1C,EAAA,QAAQ9F,EAAM,SAAUwI,CAAQ,EAEtCC,GACM3C,EAAA,WAAW9F,EAAM,QAASyI,CAAO,EAE3C3C,EAAQ,kBAAkBG,EAAa,CACrC,UAAWqC,GAAaI,GACxB,QAASH,GAAWG,GACpB,SAAUF,GAAYE,GACtB,QAASD,GAAWC,EAAA,CACrB,CACH,CACA,SAASA,IAAO,CAChB,CA67BA,SAAS5T,GAAuBC,EAAM,CAC7B,MAAA,iCAAiCA,CAAI,oDAAoDA,CAAI,iFACtG,CC/qEA,SAAS4T,GAAcC,EAAM,CACpB,OAAAA,CACT,CACA,SAAwBC,GAAeC,EAA4B,CACjE,MAAMC,EAAID,GAAUH,GACb,OAAAK,GAAarR,GACXsR,GAAkBtR,EAAOoR,CAAC,CAClC,CACH,CCbK,MAACG,GAAkBC,GAA0BC,GAAAA,cAAoB,MAAO,CAAE,MAAO,6BAA8B,QAAS,cAAe,GAAGD,CAAK,EAAoBC,GAAmB,cAAC,OAAQ,CAAE,EAAG,yKAA0K,CAAC,ECU9WC,GAAOC,GAAA,WACX,CACE,CACE,KAAAC,EAAO,KACP,GAAAC,EAAK,OACL,QAAAC,EAAU,SACV,SAAAC,EACA,UAAAC,EACA,GAAGC,GAELC,IACG,OACH,MAAMC,EAAiBC,GACrBC,GAAU,QAAQP,CAAO,GACzBlQ,EAAAyQ,GAAU,OAAV,YAAAzQ,EAAiBgQ,GACjBI,CAAA,EAGIR,EAAQ,CACZ,IAAAU,EACA,UAAWC,EACX,GAAGF,CAAA,EAGL,OAAIJ,IAAO,IACDS,GAAAA,IAAA,IAAA,CAAG,GAAGd,EAAQ,SAAAO,CAAS,CAAA,EAE7BF,IAAO,MACDS,GAAAA,IAAA,MAAA,CAAK,GAAGd,EAAQ,SAAAO,CAAS,CAAA,EAE/BF,IAAO,KACDS,GAAAA,IAAA,KAAA,CAAI,GAAGd,EAAQ,SAAAO,CAAS,CAAA,EAG1BO,GAAAA,IAAA,OAAA,CAAM,GAAGd,EAAQ,SAAAO,CAAS,CAAA,CACpC,CACF,EChCaQ,GAAuB,CAClC,aAAc,GACd,MAAO,KACP,OAAQ,KACR,aAAc,IAChB,EAEaC,GAAUrC,GAAY,CACjC,KAAM,UACN,aAAcoC,GACd,SAAU,CACR,mBAAmBvS,EAAO,CAAE,QAAAyS,GAA0C,CACpEzS,EAAM,aAAeyS,CACvB,EACA,SAASzS,EAAO,CAAE,QAAAyS,GAA0C,CAC1DzS,EAAM,MAAQyS,CAChB,EACA,YAAYzS,EAAO,CAAE,QAAAyS,GAAwC,CAC3DzS,EAAM,OAASyS,CACjB,EACA,UAAUzS,EAAO,CACfA,EAAM,OAAS,IACjB,EACA,gBAAiB,CAACA,EAAOjB,IAAyC,CAE5DiB,EAAM,eAAiBjB,EAAO,QAChCiB,EAAM,aAAe,KAGrBA,EAAM,aAAejB,EAAO,OAEhC,CACF,CACF,CAAC,EAEY2T,GAAYF,GAAQ,QAElBG,GAAAH,GAAQ,QChCVI,GAAyC,CACpD,gBAAiB,CAAC,EAClB,cAAe,CAAC,EAChB,MAAO,CAAC,EACR,YAAa,CAAC,EACd,cAAe,CAAC,EAChB,gBAAiB,CAAC,EAClB,cAAe,CAAC,EAChB,QAAS,KACT,KAAM,KACN,uBAAwB,CAAC,CAC3B,EAEMC,GAAmB1C,GAAY,CACnC,KAAM,mBACN,aAAcyC,GACd,SAAU,CACR,WAAW5S,EAAO,CAAE,QAAAyS,GAAW,CACzBzS,EAAM,UAAYyS,IACpBzS,EAAM,QAAUyS,EAEpB,EACA,cAAczS,EAAO,CAAE,QAAS,CAAE,OAAA8S,EAAQ,MAAAC,CAAA,GAA2D,CACnG,MAAMC,EAAW,KAAK,MAAMD,EAAQ,EAAE,EAChC/S,EAAA,YAAY8S,CAAM,EAAIE,CAC9B,EACA,sBAAsBhT,EAAO,CAAE,QAAAyS,GAAgC,CACzDzS,EAAM,OACRA,EAAM,KAAK,mBAAqByS,EAEpC,EACA,mBACEzS,EACA,CAAE,QAAS,CAAE,MAAAiT,EAAO,UAAAC,CAAA,GACpB,CACAlT,EAAM,QAAQ,IAAMiT,EACpBjT,EAAM,QAAQ,UAAYkT,CAC5B,EACA,WAAWlT,EAAO,CAAE,QAAS,CAAE,SAAAmT,IAAuD,CAC9E,MAAA1U,EAAM2U,GAAYD,CAAQ,EAC5BnT,EAAM,MAAMvB,CAAG,EACV,OAAAuB,EAAM,MAAMvB,CAAG,EAEhBuB,EAAA,MAAMvB,CAAG,EAAI,EAEvB,EACA,mBAAmBuB,EAAO,CAAE,QAAS,CAAE,UAAAqT,IAAmD,CACjF,OAAArT,EAAM,cAAcqT,CAAS,CACtC,EACA,gBAAgBrT,EAAO,CAAE,QAAS,CAAE,SAAAsT,IAAuD,CACzFtT,EAAM,cAAcsT,EAAS,SAAS,EAAIA,EAAS,EACrD,EACA,6BAA6BtT,EAAO,CAAE,QAAAyS,GAAkC,CACtEzS,EAAM,uBAAyB,CAC7B,GAAGA,EAAM,uBACT,GAAGyS,CAAA,CAEP,EACA,mBAAmBzS,EAAO,CAAE,QAAS,CAAE,OAAA8S,EAAQ,SAAAS,CAAA,GAAiE,CAC9G,OAAOvT,EAAM,cAAc,UAAUuT,CAAQ,IAAIT,CAAM,EAAE,CAC3D,EACA,gBAAgB9S,EAAO,CAAE,QAAS,CAAE,OAAA8S,EAAQ,SAAAS,EAAU,SAAAC,CAAS,GAA0E,CACvIxT,EAAM,cAAc,UAAUuT,CAAQ,IAAIT,CAAM,EAAE,EAAIU,CACxD,EACA,aAAaxT,EAAO,CAAE,QAAS,CAAE,OAAAyT,IAA6C,CAEtEzT,EAAA,cAAcyT,CAAM,EAAIzT,EAAM,cAAcyT,CAAM,IAAM,EAAI,EAAI,CACxE,EACA,WAAWzT,EAAO,CAAE,QAAS,CAAE,OAAAyT,IAA6C,CAEpEzT,EAAA,cAAcyT,CAAM,EAAIzT,EAAM,cAAcyT,CAAM,IAAM,EAAI,EAAI,CACxE,EACA,UAAUzT,EAAO,CAAE,QAAS,CAAE,SAAAuT,IAAiD,CACvEvT,EAAA,gBAAgB,KAAKuT,CAAQ,CACrC,EACA,YAAYvT,EAAO,CAAE,QAAS,CAAE,SAAAuT,IAAiD,CAC/EvT,EAAM,gBAAkBA,EAAM,gBAAgB,OAAQ0T,GAAOA,IAAOH,CAAQ,CAC9E,CACF,CACF,CAAC,EAEYI,GAAqBd,GAAiB,QAEpCe,GAAAf,GAAiB,QAEnB,CACX,cAAAgB,GACA,WAAAC,GACA,mBAAAC,GACA,gBAAAC,GACA,mBAAAC,GACA,gBAAAC,GACA,aAAAC,GACA,WAAAC,GACA,UAAAC,GACA,YAAAC,EACF,EAAIzB,GAAiB,QCpGrB,IAAI0B,GAAgB,SAASC,EAAG/T,EAAG,CACjC,OAAA8T,GAAgB,OAAO,gBAClB,CAAE,UAAW,CAAA,aAAgB,OAAS,SAAUC,EAAG/T,EAAG,CAAE+T,EAAE,UAAY/T,CAAE,GACzE,SAAU+T,EAAG/T,EAAG,CAAE,QAAS8G,KAAK9G,EAAO,OAAO,UAAU,eAAe,KAAKA,EAAG8G,CAAC,IAAGiN,EAAEjN,CAAC,EAAI9G,EAAE8G,CAAC,IAC1FgN,GAAcC,EAAG/T,CAAC,CAC3B,EAEO,SAASgU,GAAUD,EAAG/T,EAAG,CAC9B,GAAI,OAAOA,GAAM,YAAcA,IAAM,KACjC,MAAM,IAAI,UAAU,uBAAyB,OAAOA,CAAC,EAAI,+BAA+B,EAC5F8T,GAAcC,EAAG/T,CAAC,EAClB,SAASiU,GAAK,CAAE,KAAK,YAAcF,CAAI,CACvCA,EAAE,UAAY/T,IAAM,KAAO,OAAO,OAAOA,CAAC,GAAKiU,EAAG,UAAYjU,EAAE,UAAW,IAAIiU,EACjF,CAEU,IAACC,EAAW,UAAW,CAC/B,OAAAA,EAAW,OAAO,QAAU,SAAkB,EAAG,CAC7C,QAASC,EAAGhV,EAAI,EAAGiV,EAAI,UAAU,OAAQjV,EAAIiV,EAAGjV,IAAK,CACjDgV,EAAI,UAAUhV,CAAC,EACf,QAAS2H,KAAKqN,EAAO,OAAO,UAAU,eAAe,KAAKA,EAAGrN,CAAC,IAAG,EAAEA,CAAC,EAAIqN,EAAErN,CAAC,EAC9E,CACD,OAAO,CACV,EACMoN,EAAS,MAAM,KAAM,SAAS,CACvC,EAEO,SAASG,GAAOF,EAAG7U,EAAG,CAC3B,IAAI4C,EAAI,CAAA,EACR,QAAS4E,KAAKqN,EAAO,OAAO,UAAU,eAAe,KAAKA,EAAGrN,CAAC,GAAKxH,EAAE,QAAQwH,CAAC,EAAI,IAC9E5E,EAAE4E,CAAC,EAAIqN,EAAErN,CAAC,GACd,GAAIqN,GAAK,MAAQ,OAAO,OAAO,uBAA0B,WACrD,QAAS,EAAI,EAAGrN,EAAI,OAAO,sBAAsBqN,CAAC,EAAG,EAAIrN,EAAE,OAAQ,IAC3DxH,EAAE,QAAQwH,EAAE,CAAC,CAAC,EAAI,GAAK,OAAO,UAAU,qBAAqB,KAAKqN,EAAGrN,EAAE,CAAC,CAAC,IACzE5E,EAAE4E,EAAE,CAAC,CAAC,EAAIqN,EAAErN,EAAE,CAAC,CAAC,GAE5B,OAAO5E,CACT,CA8DO,SAASoS,GAAUC,EAASC,EAAYC,EAAGC,EAAW,CAC3D,SAASC,EAAM1T,EAAO,CAAE,OAAOA,aAAiBwT,EAAIxT,EAAQ,IAAIwT,EAAE,SAAUG,EAAS,CAAEA,EAAQ3T,CAAK,CAAE,CAAE,CAAI,CAC5G,OAAO,IAAKwT,IAAMA,EAAI,UAAU,SAAUG,EAASC,EAAQ,CACvD,SAAS3E,EAAUjP,EAAO,CAAE,GAAI,CAAE6T,EAAKJ,EAAU,KAAKzT,CAAK,CAAC,CAAE,OAAU3B,EAAG,CAAEuV,EAAOvV,CAAC,EAAM,CAC3F,SAAS8Q,EAASnP,EAAO,CAAE,GAAI,CAAE6T,EAAKJ,EAAU,MAASzT,CAAK,CAAC,CAAI,OAAQ3B,EAAG,CAAEuV,EAAOvV,CAAC,EAAM,CAC9F,SAASwV,EAAKxQ,EAAQ,CAAEA,EAAO,KAAOsQ,EAAQtQ,EAAO,KAAK,EAAIqQ,EAAMrQ,EAAO,KAAK,EAAE,KAAK4L,EAAWE,CAAQ,CAAI,CAC9G0E,GAAMJ,EAAYA,EAAU,MAAMH,EAASC,GAAc,CAAE,CAAA,GAAG,KAAI,CAAE,CAC1E,CAAG,CACH,CAEO,SAASO,GAAYR,EAASS,EAAM,CACzC,IAAIC,EAAI,CAAE,MAAO,EAAG,KAAM,UAAW,CAAE,GAAI/S,EAAE,CAAC,EAAI,EAAG,MAAMA,EAAE,CAAC,EAAG,OAAOA,EAAE,CAAC,CAAE,EAAI,KAAM,CAAA,EAAI,IAAK,CAAE,CAAA,EAAIyO,EAAGtO,EAAGH,EAAGgT,EAAI,OAAO,QAAQ,OAAO,UAAa,WAAa,SAAW,QAAQ,SAAS,EAC/L,OAAOA,EAAE,KAAOC,EAAK,CAAC,EAAGD,EAAE,MAAWC,EAAK,CAAC,EAAGD,EAAE,OAAYC,EAAK,CAAC,EAAG,OAAO,QAAW,aAAeD,EAAE,OAAO,QAAQ,EAAI,UAAW,CAAE,OAAO,IAAO,GAAGA,EAC1J,SAASC,EAAKf,EAAG,CAAE,OAAO,SAAUgB,EAAG,CAAE,OAAON,EAAK,CAACV,EAAGgB,CAAC,CAAC,CAAI,CAAG,CAClE,SAASN,EAAKO,EAAI,CACd,GAAI1E,EAAG,MAAM,IAAI,UAAU,iCAAiC,EAC5D,KAAOuE,IAAMA,EAAI,EAAGG,EAAG,CAAC,IAAMJ,EAAI,IAAKA,GAAG,GAAI,CAC1C,GAAItE,EAAI,EAAGtO,IAAMH,EAAImT,EAAG,CAAC,EAAI,EAAIhT,EAAE,OAAYgT,EAAG,CAAC,EAAIhT,EAAE,SAAcH,EAAIG,EAAE,SAAcH,EAAE,KAAKG,CAAC,EAAG,GAAKA,EAAE,OAAS,EAAEH,EAAIA,EAAE,KAAKG,EAAGgT,EAAG,CAAC,CAAC,GAAG,KAAM,OAAOnT,EAE3J,OADIG,EAAI,EAAGH,IAAGmT,EAAK,CAACA,EAAG,CAAC,EAAI,EAAGnT,EAAE,KAAK,GAC9BmT,EAAG,CAAC,EAAC,CACT,IAAK,GAAG,IAAK,GAAGnT,EAAImT,EAAI,MACxB,IAAK,GAAG,OAAAJ,EAAE,QAAgB,CAAE,MAAOI,EAAG,CAAC,EAAG,KAAM,EAAK,EACrD,IAAK,GAAGJ,EAAE,QAAS5S,EAAIgT,EAAG,CAAC,EAAGA,EAAK,CAAC,CAAC,EAAG,SACxC,IAAK,GAAGA,EAAKJ,EAAE,IAAI,MAAOA,EAAE,KAAK,IAAG,EAAI,SACxC,QACI,GAAM/S,EAAI+S,EAAE,KAAM,EAAA/S,EAAIA,EAAE,OAAS,GAAKA,EAAEA,EAAE,OAAS,CAAC,KAAOmT,EAAG,CAAC,IAAM,GAAKA,EAAG,CAAC,IAAM,GAAI,CAAEJ,EAAI,EAAG,QAAW,CAC5G,GAAII,EAAG,CAAC,IAAM,IAAM,CAACnT,GAAMmT,EAAG,CAAC,EAAInT,EAAE,CAAC,GAAKmT,EAAG,CAAC,EAAInT,EAAE,CAAC,GAAK,CAAE+S,EAAE,MAAQI,EAAG,CAAC,EAAG,KAAQ,CACtF,GAAIA,EAAG,CAAC,IAAM,GAAKJ,EAAE,MAAQ/S,EAAE,CAAC,EAAG,CAAE+S,EAAE,MAAQ/S,EAAE,CAAC,EAAGA,EAAImT,EAAI,KAAQ,CACrE,GAAInT,GAAK+S,EAAE,MAAQ/S,EAAE,CAAC,EAAG,CAAE+S,EAAE,MAAQ/S,EAAE,CAAC,EAAG+S,EAAE,IAAI,KAAKI,CAAE,EAAG,KAAQ,CAC/DnT,EAAE,CAAC,GAAG+S,EAAE,IAAI,IAAG,EACnBA,EAAE,KAAK,IAAK,EAAE,QACrB,CACDI,EAAKL,EAAK,KAAKT,EAASU,CAAC,CAC5B,OAAQ3V,EAAG,CAAE+V,EAAK,CAAC,EAAG/V,CAAC,EAAG+C,EAAI,CAAE,QAAW,CAAEsO,EAAIzO,EAAI,CAAI,CAC1D,GAAImT,EAAG,CAAC,EAAI,EAAG,MAAMA,EAAG,CAAC,EAAG,MAAO,CAAE,MAAOA,EAAG,CAAC,EAAIA,EAAG,CAAC,EAAI,OAAQ,KAAM,GAC7E,CACH,CA+DO,SAASC,EAAcC,EAAIC,EAAMC,EAAM,CAC5C,GAAIA,GAAQ,UAAU,SAAW,EAAG,QAAStW,EAAI,EAAGgL,EAAIqL,EAAK,OAAQE,EAAIvW,EAAIgL,EAAGhL,KACxEuW,GAAM,EAAEvW,KAAKqW,MACRE,IAAIA,EAAK,MAAM,UAAU,MAAM,KAAKF,EAAM,EAAGrW,CAAC,GACnDuW,EAAGvW,CAAC,EAAIqW,EAAKrW,CAAC,GAGtB,OAAOoW,EAAG,OAAOG,GAAM,MAAM,UAAU,MAAM,KAAKF,CAAI,CAAC,CACzD,CC5NA,IAAIG,GAAiB,sBACjBxU,GAAK,OAAO,eAAgByU,GAAiBzU,KAAO,OAAS,SAAUjE,EAAKC,EAAO,CACnF,OAAAD,EAAI,UAAYC,EACTD,CACX,EAAIiE,GACA0U,GAAgC,SAAUC,EAAQ,CAClD9B,GAAU6B,EAAgBC,CAAM,EAChC,SAASD,EAAeE,EAAS,CACzBA,IAAY,SAAUA,EAAUJ,IACpC,IAAIK,EAAQF,EAAO,KAAK,KAAM,OAAOC,GAAY,SAC3CJ,GAAiB,KAAOI,EAAU,6DAClCA,CAAO,GAAK,KAClB,OAAAC,EAAM,YAAc,EACpBA,EAAM,KAAOL,GACbC,GAAeI,EAAOH,EAAe,SAAS,EACvCG,CACV,CACD,OAAOH,CACX,EAAE,KAAK,EAEA,SAASI,GAAUC,EAAWH,EAAS,CAC1C,GAAI,CAACG,EACD,MAAM,IAAIL,GAAeE,CAAO,CAExC,CACA,IAAII,GAAkB,CAAC,QAAS,MAAO,OAAQ,QAAS,QAAQ,EAC5DC,GAAiBD,GAAgB,QAAQ,KAAK,EAClD,SAASE,GAAkB/I,EAAM,CAC7B,OAAO,UAAY,CACf,GAAI6I,GAAgB,QAAQ7I,CAAI,GAAK8I,GAAgB,CAGjD,IAAIE,EAAS,QAAQhJ,CAAI,GAAK,QAAQ,IACtC,OAAOgJ,EAAO,MAAM,QAAS,SAAS,CACzC,CACT,CACA,EACC,SAAUL,EAAW,CAClBA,EAAU,MAAQI,GAAkB,OAAO,EAC3CJ,EAAU,IAAMI,GAAkB,KAAK,EACvCJ,EAAU,KAAOI,GAAkB,MAAM,EACzCJ,EAAU,MAAQI,GAAkB,OAAO,CAC/C,GAAGJ,KAAcA,GAAY,CAAA,EAAG,EC3CtB,IAACM,GAAU,SCAd,SAASC,GAAM5O,EAAO,CACzB,GAAI,CACA,OAAOA,EAAK,CACf,MACU,CAAG,CAClB,CCJA,MAAe6O,GAACD,GAAM,UAAY,CAAE,OAAO,UAAW,CAAE,GACpDA,GAAM,UAAY,CAAE,OAAO,OAAS,GACpCA,GAAM,UAAY,CAAE,OAAO,KAAO,GAClCA,GAAM,UAAY,CAAE,OAAO,OAAS,GAMxCA,GAAM,UAAY,CACd,OAAOA,GAAM,YAAY,aAAa,GAC1C,CAAC,ECZD,IAAIE,GAAe,IAAI,IAGhB,SAASC,GAAaC,EAAQ,CACjC,IAAIC,EAAQH,GAAa,IAAIE,CAAM,GAAK,EACxC,OAAAF,GAAa,IAAIE,EAAQC,EAAQ,CAAC,EAC3B,GAAG,OAAOD,EAAQ,GAAG,EAAE,OAAOC,EAAO,GAAG,EAAE,OAAO,KAAK,OAAM,EAAG,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC,CAC/F,CCNO,SAASC,GAAoB7V,EAAO8V,EAAO,CAC1CA,IAAU,SAAUA,EAAQ,GAChC,IAAIC,EAAUL,GAAa,qBAAqB,EAChD,OAAO,KAAK,UAAU1V,EAAO,SAAUjD,EAAKiD,EAAO,CAC/C,OAAOA,IAAU,OAAS+V,EAAU/V,CACvC,EAAE8V,CAAK,EACH,MAAM,KAAK,UAAUC,CAAO,CAAC,EAC7B,KAAK,aAAa,CAC3B,CCLA,SAASC,GAAK3Q,EAAI,CACd,OAAO,SAAUyP,EAAS,CAEtB,QADI9V,EAAO,CAAA,EACFiX,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCjX,EAAKiX,EAAK,CAAC,EAAI,UAAUA,CAAE,EAE/B,GAAI,OAAOnB,GAAY,SAAU,CAC7B,IAAIoB,EAAOpB,EACXA,EAAUqB,GAAmBD,CAAI,EAC5BpB,IACDA,EAAUsB,GAAoBF,EAAMlX,CAAI,EACxCA,EAAO,CAAA,EAEd,CACDqG,EAAG,MAAM,OAAQ,CAACyP,CAAO,EAAE,OAAO9V,CAAI,CAAC,CAC/C,CACA,CACG,IAACgW,EAAY,OAAO,OAAO,SAAmBC,EAAWH,EAAS,CAEjE,QADI9V,EAAO,CAAA,EACFiX,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCjX,EAAKiX,EAAK,CAAC,EAAI,UAAUA,CAAE,EAE1BhB,GACDoB,GAAkBpB,EAAWkB,GAAmBrB,EAAS9V,CAAI,GAAKoX,GAAoBtB,EAAS9V,CAAI,CAAC,CAE5G,EAAG,CACC,MAAOgX,GAAKK,GAAkB,KAAK,EACnC,IAAKL,GAAKK,GAAkB,GAAG,EAC/B,KAAML,GAAKK,GAAkB,IAAI,EACjC,MAAOL,GAAKK,GAAkB,KAAK,CACvC,CAAC,EAWD,SAASC,GAAkBxB,EAAS,CAEhC,QADIyB,EAAiB,CAAA,EACZN,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCM,EAAeN,EAAK,CAAC,EAAI,UAAUA,CAAE,EAEzC,OAAO,IAAIrB,GAAeuB,GAAmBrB,EAASyB,CAAc,GAChEH,GAAoBtB,EAASyB,CAAc,CAAC,CACpD,CACA,IAAIC,GAA4B,OAAO,IAAI,6BAA+BlB,EAAO,EACjF,SAASmB,GAAU5X,EAAK,CACpB,GAAI,OAAOA,GAAO,SACd,OAAOA,EAEX,GAAI,CACA,OAAOgX,GAAoBhX,EAAK,CAAC,EAAE,MAAM,EAAG,GAAI,CACnD,MACU,CACP,MAAO,oBACV,CACL,CACA,SAASsX,GAAmBrB,EAAS4B,EAAa,CAE9C,GADIA,IAAgB,SAAUA,EAAc,CAAE,GAC1C,EAAC5B,EAEL,OAAQ6B,GAAOH,EAAyB,GACpCG,GAAOH,EAAyB,EAAE1B,EAAS4B,EAAY,IAAID,EAAS,CAAC,CAC7E,CACA,SAASL,GAAoBtB,EAAS4B,EAAa,CAE/C,GADIA,IAAgB,SAAUA,EAAc,CAAE,GAC1C,EAAC5B,EAEL,MAAO,+FAA+F,OAAO,mBAAmB,KAAK,UAAU,CAC3I,QAASQ,GACT,QAASR,EACT,KAAM4B,EAAY,IAAID,EAAS,CAClC,CAAA,CAAC,CAAC,CACP,CCjFO,SAASG,GAAU3B,EAAWH,EAAS,CAG5C,GAAI,CAFqB,EAAQG,EAG/B,MAAM,IAAI,MAAMH,CAAO,CAE3B,CCFO,SAAS+B,GAAa7W,EAAO,CAClC,OAAO,OAAOA,GAAS,UAAYA,IAAU,IAC/C,CCNO,SAASgV,GAAUC,EAAWH,EAAS,CAG5C,GAAI,CAFqB,EAAQG,EAG/B,MAAM,IAAI,MACoB,iCAClC,CAEA,CCPA,MAAM6B,GAAa,eASZ,SAASC,GAAYnS,EAAQoS,EAAU,CAC5C,IAAIC,EAAgB,EAChBC,EAAO,EAEX,UAAWC,KAASvS,EAAO,KAAK,SAASkS,EAAU,EAAG,CAGpD,GAFA,OAAOK,EAAM,OAAU,UAAYnC,GAAU,EAAK,EAE9CmC,EAAM,OAASH,EACjB,MAGFC,EAAgBE,EAAM,MAAQA,EAAM,CAAC,EAAE,OACvCD,GAAQ,CACT,CAED,MAAO,CACL,KAAAA,EACA,OAAQF,EAAW,EAAIC,CAC3B,CACA,CCxBO,SAASG,GAAcC,EAAU,CACtC,OAAOC,GACLD,EAAS,OACTN,GAAYM,EAAS,OAAQA,EAAS,KAAK,CAC/C,CACA,CAKO,SAASC,GAAoB1S,EAAQ2S,EAAgB,CAC1D,MAAMC,EAAwB5S,EAAO,eAAe,OAAS,EACvDmP,EAAO,GAAG,SAASyD,CAAqB,EAAI5S,EAAO,KACnD6S,EAAYF,EAAe,KAAO,EAClCG,EAAa9S,EAAO,eAAe,KAAO,EAC1C+S,EAAUJ,EAAe,KAAOG,EAChCE,EAAeL,EAAe,OAAS,EAAIC,EAAwB,EACnEK,EAAYN,EAAe,OAASK,EACpCE,EAAc,GAAGlT,EAAO,IAAI,IAAI+S,CAAO,IAAIE,CAAS;AAAA,EACpDE,EAAQhE,EAAK,MAAM,cAAc,EACjCiE,EAAeD,EAAMN,CAAS,EAEpC,GAAIO,EAAa,OAAS,IAAK,CAC7B,MAAMC,EAAe,KAAK,MAAMJ,EAAY,EAAE,EACxCK,EAAmBL,EAAY,GAC/BM,EAAW,CAAA,EAEjB,QAASja,EAAI,EAAGA,EAAI8Z,EAAa,OAAQ9Z,GAAK,GAC5Cia,EAAS,KAAKH,EAAa,MAAM9Z,EAAGA,EAAI,EAAE,CAAC,EAG7C,OACE4Z,EACAM,GAAmB,CACjB,CAAC,GAAGT,CAAO,KAAMQ,EAAS,CAAC,CAAC,EAC5B,GAAGA,EAAS,MAAM,EAAGF,EAAe,CAAC,EAAE,IAAKI,GAAY,CAAC,IAAKA,CAAO,CAAC,EACtE,CAAC,IAAK,IAAI,SAASH,CAAgB,CAAC,EACpC,CAAC,IAAKC,EAASF,EAAe,CAAC,CAAC,CACxC,CAAO,CAEJ,CAED,OACEH,EACAM,GAAmB,CAEjB,CAAC,GAAGT,EAAU,CAAC,KAAMI,EAAMN,EAAY,CAAC,CAAC,EACzC,CAAC,GAAGE,CAAO,KAAMK,CAAY,EAC7B,CAAC,IAAK,IAAI,SAASH,CAAS,CAAC,EAC7B,CAAC,GAAGF,EAAU,CAAC,KAAMI,EAAMN,EAAY,CAAC,CAAC,CAC/C,CAAK,CAEL,CAEA,SAASW,GAAmBL,EAAO,CACjC,MAAMO,EAAgBP,EAAM,OAAO,CAAC,CAAC/D,EAAGkD,CAAI,IAAMA,IAAS,MAAS,EAC9DqB,EAAS,KAAK,IAAI,GAAGD,EAAc,IAAI,CAAC,CAAC3C,CAAM,IAAMA,EAAO,MAAM,CAAC,EACzE,OAAO2C,EACJ,IAAI,CAAC,CAAC3C,EAAQuB,CAAI,IAAMvB,EAAO,SAAS4C,CAAM,GAAKrB,EAAO,IAAMA,EAAO,GAAG,EAC1E,KAAK;AAAA,CAAI,CACd,CC1DA,SAASsB,GAAoBxZ,EAAM,CACjC,MAAMyZ,EAAWzZ,EAAK,CAAC,EAEvB,OAAIyZ,GAAY,MAAQ,SAAUA,GAAY,WAAYA,EACjD,CACL,MAAOA,EACP,OAAQzZ,EAAK,CAAC,EACd,UAAWA,EAAK,CAAC,EACjB,KAAMA,EAAK,CAAC,EACZ,cAAeA,EAAK,CAAC,EACrB,WAAYA,EAAK,CAAC,CACxB,EAGSyZ,CACT,CAQO,MAAMC,WAAqB,KAAM,CA8CtC,YAAY5D,KAAY6D,EAAS,CAC/B,IAAIC,EAAaC,EAAiBC,EAElC,KAAM,CAAE,MAAAC,EAAO,OAAAnU,EAAQ,UAAAoU,EAAW,KAAAtV,EAAM,cAAAuV,EAAe,WAAAC,CAAY,EACjEV,GAAoBG,CAAO,EAC7B,MAAM7D,CAAO,EACb,KAAK,KAAO,eACZ,KAAK,KAAOpR,GAA0C,OACtD,KAAK,cACHuV,GAEI,OAEN,KAAK,MAAQE,GACX,MAAM,QAAQJ,CAAK,EAAIA,EAAQA,EAAQ,CAACA,CAAK,EAAI,MACvD,EACI,MAAMK,EAAgBD,IACnBP,EAAc,KAAK,SAAW,MAAQA,IAAgB,OACnD,OACAA,EAAY,IAAKS,GAASA,EAAK,GAAG,EAAE,OAAQC,GAAQA,GAAO,IAAI,CACzE,EAEI,KAAK,OACH1U,IAEIwU,GAAkB,OAEjBP,EAAkBO,EAAc,CAAC,KAAO,MACzCP,IAAoB,OAFpB,OAIAA,EAAgB,QACtB,KAAK,UACHG,IAEII,GAAkB,KAClB,OACAA,EAAc,IAAKE,GAAQA,EAAI,KAAK,GAC1C,KAAK,UACHN,GAAapU,EACToU,EAAU,IAAKO,GAAQxC,GAAYnS,EAAQ2U,CAAG,CAAC,EAC/CH,GAAkB,KAClB,OACAA,EAAc,IAAKE,GAAQvC,GAAYuC,EAAI,OAAQA,EAAI,KAAK,CAAC,EACnE,MAAME,EAAqB3C,GACzBoC,GAAkB,KACd,OACAA,EAAc,UACnB,EACGA,GAAkB,KAChB,OACAA,EAAc,WAChB,OACJ,KAAK,YACFH,EACCI,GAEIM,KAAwB,MAAQV,IAAS,OAC3CA,EACA,OAAO,OAAO,IAAI,EAGxB,OAAO,iBAAiB,KAAM,CAC5B,QAAS,CACP,SAAU,GACV,WAAY,EACb,EACD,KAAM,CACJ,WAAY,EACb,EACD,MAAO,CACL,WAAY,EACb,EACD,OAAQ,CACN,WAAY,EACb,EACD,UAAW,CACT,WAAY,EACb,EACD,cAAe,CACb,WAAY,EACb,CACP,CAAK,EAMCG,GAAkB,MAElBA,EAAc,MAEd,OAAO,eAAe,KAAM,QAAS,CACnC,MAAOA,EAAc,MACrB,SAAU,GACV,aAAc,EACtB,CAAO,EACQ,MAAM,kBACf,MAAM,kBAAkB,KAAMP,EAAY,EAE1C,OAAO,eAAe,KAAM,QAAS,CACnC,MAAO,MAAK,EAAG,MACf,SAAU,GACV,aAAc,EACtB,CAAO,CAGJ,CAED,IAAK,OAAO,WAAW,GAAI,CACzB,MAAO,cACR,CAED,UAAW,CACT,IAAIe,EAAS,KAAK,QAElB,GAAI,KAAK,MACP,UAAWJ,KAAQ,KAAK,MAClBA,EAAK,MACPI,GAAU;AAAA;AAAA,EAASrC,GAAciC,EAAK,GAAG,WAGpC,KAAK,QAAU,KAAK,UAC7B,UAAWhC,KAAY,KAAK,UAC1BoC,GAAU;AAAA;AAAA,EAASnC,GAAoB,KAAK,OAAQD,CAAQ,EAIhE,OAAOoC,CACR,CAED,QAAS,CACP,MAAMC,EAAiB,CACrB,QAAS,KAAK,OACpB,EAEI,OAAI,KAAK,WAAa,OACpBA,EAAe,UAAY,KAAK,WAG9B,KAAK,MAAQ,OACfA,EAAe,KAAO,KAAK,MAGzB,KAAK,YAAc,MAAQ,OAAO,KAAK,KAAK,UAAU,EAAE,OAAS,IACnEA,EAAe,WAAa,KAAK,YAG5BA,CACR,CACH,CAEA,SAASP,GAAiBQ,EAAO,CAC/B,OAAOA,IAAU,QAAaA,EAAM,SAAW,EAAI,OAAYA,CACjE,CC/NO,SAASC,EAAYhV,EAAQoS,EAAU6C,EAAa,CACzD,OAAO,IAAInB,GAAa,iBAAiBmB,CAAW,GAAI,CACtD,OAAAjV,EACA,UAAW,CAACoS,CAAQ,CACxB,CAAG,CACH,CCPO,MAAM8C,EAAS,CAoBpB,YAAYC,EAAYC,EAAUpV,EAAQ,CACxC,KAAK,MAAQmV,EAAW,MACxB,KAAK,IAAMC,EAAS,IACpB,KAAK,WAAaD,EAClB,KAAK,SAAWC,EAChB,KAAK,OAASpV,CACf,CAED,IAAK,OAAO,WAAW,GAAI,CACzB,MAAO,UACR,CAED,QAAS,CACP,MAAO,CACL,MAAO,KAAK,MACZ,IAAK,KAAK,GAChB,CACG,CACH,CAMO,MAAMqV,EAAM,CAiCjB,YAAYC,EAAMC,EAAOC,EAAKlD,EAAMmD,EAAQra,EAAO,CACjD,KAAK,KAAOka,EACZ,KAAK,MAAQC,EACb,KAAK,IAAMC,EACX,KAAK,KAAOlD,EACZ,KAAK,OAASmD,EAEd,KAAK,MAAQra,EACb,KAAK,KAAO,KACZ,KAAK,KAAO,IACb,CAED,IAAK,OAAO,WAAW,GAAI,CACzB,MAAO,OACR,CAED,QAAS,CACP,MAAO,CACL,KAAM,KAAK,KACX,MAAO,KAAK,MACZ,KAAM,KAAK,KACX,OAAQ,KAAK,MACnB,CACG,CACH,CAQO,MAAMsa,GAAoB,CAC/B,KAAM,CAAE,EACR,SAAU,CAAC,aAAa,EACxB,oBAAqB,CACnB,OACA,sBACA,aACA,cACD,EACD,mBAAoB,CAAC,WAAY,OAAQ,eAAgB,YAAY,EACrE,SAAU,CAAC,MAAM,EACjB,aAAc,CAAC,YAAY,EAC3B,MAAO,CAAC,QAAS,OAAQ,YAAa,aAAc,cAAc,EAClE,SAAU,CAAC,OAAQ,OAAO,EAC1B,eAAgB,CAAC,OAAQ,YAAY,EACrC,eAAgB,CAAC,gBAAiB,aAAc,cAAc,EAC9D,mBAAoB,CAClB,OACA,sBACA,gBACA,aACA,cACD,EACD,SAAU,CAAE,EACZ,WAAY,CAAE,EACd,YAAa,CAAE,EACf,aAAc,CAAE,EAChB,UAAW,CAAE,EACb,UAAW,CAAE,EACb,UAAW,CAAC,QAAQ,EACpB,YAAa,CAAC,QAAQ,EACtB,YAAa,CAAC,OAAQ,OAAO,EAC7B,UAAW,CAAC,OAAQ,WAAW,EAC/B,UAAW,CAAC,MAAM,EAClB,SAAU,CAAC,MAAM,EACjB,YAAa,CAAC,MAAM,EACpB,iBAAkB,CAAC,cAAe,aAAc,gBAAgB,EAChE,wBAAyB,CAAC,MAAM,EAChC,qBAAsB,CAAC,cAAe,OAAQ,YAAY,EAC1D,qBAAsB,CACpB,cACA,OACA,aACA,aACA,QACD,EACD,gBAAiB,CAAC,cAAe,OAAQ,YAAa,OAAQ,YAAY,EAC1E,qBAAsB,CACpB,cACA,OACA,OACA,eACA,YACD,EACD,wBAAyB,CACvB,cACA,OACA,aACA,aACA,QACD,EACD,oBAAqB,CAAC,cAAe,OAAQ,aAAc,OAAO,EAClE,mBAAoB,CAAC,cAAe,OAAQ,aAAc,QAAQ,EAClE,oBAAqB,CAAC,cAAe,OAAQ,YAAY,EACzD,0BAA2B,CAAC,cAAe,OAAQ,aAAc,QAAQ,EACzE,oBAAqB,CAAC,cAAe,OAAQ,YAAa,WAAW,EACrE,gBAAiB,CAAC,aAAc,gBAAgB,EAChD,oBAAqB,CAAC,OAAQ,YAAY,EAC1C,oBAAqB,CAAC,OAAQ,aAAc,aAAc,QAAQ,EAClE,uBAAwB,CAAC,OAAQ,aAAc,aAAc,QAAQ,EACrE,mBAAoB,CAAC,OAAQ,aAAc,OAAO,EAClD,kBAAmB,CAAC,OAAQ,aAAc,QAAQ,EAClD,yBAA0B,CAAC,OAAQ,aAAc,QAAQ,CAC3D,EACMC,GAAa,IAAI,IAAI,OAAO,KAAKD,EAAiB,CAAC,EAKlD,SAASE,GAAOC,EAAW,CAChC,MAAMC,EACJD,GAAc,KAA+B,OAASA,EAAU,KAClE,OAAO,OAAOC,GAAc,UAAYH,GAAW,IAAIG,CAAS,CAClE,CAGA,IAAIC,IAEH,SAAUA,EAAmB,CAC5BA,EAAkB,MAAW,QAC7BA,EAAkB,SAAc,WAChCA,EAAkB,aAAkB,cACtC,GAAGA,KAAsBA,GAAoB,CAAA,EAAG,EC1MhD,IAAIC,IAEH,SAAUA,EAAmB,CAC5BA,EAAkB,MAAW,QAC7BA,EAAkB,SAAc,WAChCA,EAAkB,aAAkB,eACpCA,EAAkB,MAAW,QAC7BA,EAAkB,oBAAyB,sBAC3CA,EAAkB,gBAAqB,kBACvCA,EAAkB,gBAAqB,kBACvCA,EAAkB,oBAAyB,sBAC3CA,EAAkB,OAAY,SAC9BA,EAAkB,OAAY,SAC9BA,EAAkB,OAAY,SAC9BA,EAAkB,iBAAsB,mBACxCA,EAAkB,oBAAyB,sBAC3CA,EAAkB,UAAe,YACjCA,EAAkB,MAAW,QAC7BA,EAAkB,KAAU,OAC5BA,EAAkB,WAAgB,aAClCA,EAAkB,aAAkB,eACpCA,EAAkB,uBAA4B,wBAChD,GAAGA,KAAsBA,GAAoB,CAAE,EAAC,ECtB7C,IAACC,GAEH,SAAUA,EAAM,CACfA,EAAK,KAAU,OACfA,EAAK,SAAc,WACnBA,EAAK,qBAA0B,sBAC/BA,EAAK,oBAAyB,qBAC9BA,EAAK,cAAmB,eACxBA,EAAK,MAAW,QAChBA,EAAK,SAAc,WACnBA,EAAK,gBAAqB,iBAC1BA,EAAK,gBAAqB,iBAC1BA,EAAK,oBAAyB,qBAC9BA,EAAK,SAAc,WACnBA,EAAK,IAAS,WACdA,EAAK,MAAW,aAChBA,EAAK,OAAY,cACjBA,EAAK,QAAa,eAClBA,EAAK,KAAU,YACfA,EAAK,KAAU,YACfA,EAAK,KAAU,YACfA,EAAK,OAAY,cACjBA,EAAK,aAAkB,cACvBA,EAAK,UAAe,YACpBA,EAAK,WAAgB,YACrBA,EAAK,UAAe,WACpBA,EAAK,cAAmB,cACxBA,EAAK,kBAAuB,mBAC5BA,EAAK,0BAA+B,0BACpCA,EAAK,uBAA4B,uBACjCA,EAAK,uBAA4B,uBACjCA,EAAK,iBAAsB,kBAC3BA,EAAK,uBAA4B,uBACjCA,EAAK,0BAA+B,0BACpCA,EAAK,sBAA2B,sBAChCA,EAAK,qBAA0B,qBAC/BA,EAAK,sBAA2B,sBAChCA,EAAK,6BAAkC,4BACvCA,EAAK,qBAA0B,sBAC/BA,EAAK,iBAAsB,kBAC3BA,EAAK,sBAA2B,sBAChCA,EAAK,sBAA2B,sBAChCA,EAAK,yBAA8B,yBACnCA,EAAK,qBAA0B,qBAC/BA,EAAK,oBAAyB,oBAC9BA,EAAK,4BAAiC,0BACxC,GAAGA,IAASA,EAAO,CAAE,EAAC,ECzCf,SAASC,GAAapf,EAAM,CACjC,OAAOA,IAAS,GAAUA,IAAS,EACrC,CASO,SAASqf,GAAQrf,EAAM,CAC5B,OAAOA,GAAQ,IAAUA,GAAQ,EACnC,CAYO,SAASsf,GAAStf,EAAM,CAC7B,OACGA,GAAQ,IAAUA,GAAQ,KAC1BA,GAAQ,IAAUA,GAAQ,EAE/B,CAUO,SAASuf,GAAYvf,EAAM,CAChC,OAAOsf,GAAStf,CAAI,GAAKA,IAAS,EACpC,CAWO,SAASwf,GAAexf,EAAM,CACnC,OAAOsf,GAAStf,CAAI,GAAKqf,GAAQrf,CAAI,GAAKA,IAAS,EACrD,CCrDO,SAASyf,GAAuBpD,EAAO,CAC5C,IAAIqD,EAEJ,IAAIC,EAAe,OAAO,iBACtBC,EAAoB,KACpBC,EAAmB,GAEvB,QAASrd,EAAI,EAAGA,EAAI6Z,EAAM,OAAQ,EAAE7Z,EAAG,CACrC,IAAIsd,EAEJ,MAAMtE,EAAOa,EAAM7Z,CAAC,EACdud,EAASC,GAAkBxE,CAAI,EAEjCuE,IAAWvE,EAAK,SAIpBoE,GACGE,EAAqBF,KAAuB,MAC7CE,IAAuB,OACnBA,EACAtd,EACNqd,EAAmBrd,EAEfA,IAAM,GAAKud,EAASJ,IACtBA,EAAeI,GAElB,CAED,OAAO1D,EACJ,IAAI,CAACb,EAAMhZ,IAAOA,IAAM,EAAIgZ,EAAOA,EAAK,MAAMmE,CAAY,CAAE,EAC5D,OACED,EAAsBE,KAAuB,MAC5CF,IAAwB,OACtBA,EACA,EACJG,EAAmB,CACzB,CACA,CAEA,SAASG,GAAkBC,EAAK,CAC9B,IAAIzd,EAAI,EAER,KAAOA,EAAIyd,EAAI,QAAUb,GAAaa,EAAI,WAAWzd,CAAC,CAAC,GACrD,EAAEA,EAGJ,OAAOA,CACT,CAgFO,SAAS0d,GAAiB5b,EAAOgI,EAAS,CAC/C,MAAM6T,EAAe7b,EAAM,QAAQ,OAAQ,OAAO,EAE5C+X,EAAQ8D,EAAa,MAAM,cAAc,EACzCC,EAAe/D,EAAM,SAAW,EAEhCgE,EACJhE,EAAM,OAAS,GACfA,EACG,MAAM,CAAC,EACP,MAAOb,GAASA,EAAK,SAAW,GAAK4D,GAAa5D,EAAK,WAAW,CAAC,CAAC,CAAC,EAEpE8E,EAA0BH,EAAa,SAAS,OAAO,EAEvDI,EAAmBjc,EAAM,SAAS,GAAG,GAAK,CAACgc,EAC3CE,EAAmBlc,EAAM,SAAS,IAAI,EACtCmc,EAAuBF,GAAoBC,EAC3CE,EAEH,CAACN,GACA9b,EAAM,OAAS,IACfmc,GACAJ,GACAC,EACJ,IAAI3Y,EAAS,GAEb,MAAMgZ,EAAqBP,GAAgBhB,GAAa9a,EAAM,WAAW,CAAC,CAAC,EAE3E,OAAKoc,GAAwB,CAACC,GAAuBN,KACnD1Y,GAAU;AAAA,GAGZA,GAAUwY,GAENO,GAAwBD,KAC1B9Y,GAAU;AAAA,GAGL,MAAQA,EAAS,KAC1B,CC7KA,IAAIiZ,GAEH,SAAUA,EAAW,CACpBA,EAAU,IAAS,QACnBA,EAAU,IAAS,QACnBA,EAAU,KAAU,IACpBA,EAAU,OAAY,IACtBA,EAAU,IAAS,IACnBA,EAAU,QAAa,IACvBA,EAAU,QAAa,IACvBA,EAAU,OAAY,MACtBA,EAAU,MAAW,IACrBA,EAAU,OAAY,IACtBA,EAAU,GAAQ,IAClBA,EAAU,UAAe,IACzBA,EAAU,UAAe,IACzBA,EAAU,QAAa,IACvBA,EAAU,KAAU,IACpBA,EAAU,QAAa,IACvBA,EAAU,KAAU,OACpBA,EAAU,IAAS,MACnBA,EAAU,MAAW,QACrBA,EAAU,OAAY,SACtBA,EAAU,aAAkB,cAC5BA,EAAU,QAAa,SACzB,GAAGA,IAAcA,EAAY,CAAE,EAAC,ECfzB,MAAMC,EAAM,CAgBjB,YAAY3X,EAAQ,CAClB,MAAM4X,EAAmB,IAAIvC,GAAMqC,EAAU,IAAK,EAAG,EAAG,EAAG,CAAC,EAC5D,KAAK,OAAS1X,EACd,KAAK,UAAY4X,EACjB,KAAK,MAAQA,EACb,KAAK,KAAO,EACZ,KAAK,UAAY,CAClB,CAED,IAAK,OAAO,WAAW,GAAI,CACzB,MAAO,OACR,CAKD,SAAU,CACR,YAAK,UAAY,KAAK,MACP,KAAK,MAAQ,KAAK,UAAW,CAE7C,CAMD,WAAY,CACV,IAAIjL,EAAQ,KAAK,MAEjB,GAAIA,EAAM,OAAS+K,EAAU,IAC3B,EACE,IAAI/K,EAAM,KACRA,EAAQA,EAAM,SACT,CAEL,MAAMkL,EAAYC,GAAc,KAAMnL,EAAM,GAAG,EAE/CA,EAAM,KAAOkL,EAEbA,EAAU,KAAOlL,EACjBA,EAAQkL,CACT,OACMlL,EAAM,OAAS+K,EAAU,SAGpC,OAAO/K,CACR,CACH,CAKO,SAASoL,GAAsBzC,EAAM,CAC1C,OACEA,IAASoC,EAAU,MACnBpC,IAASoC,EAAU,QACnBpC,IAASoC,EAAU,KACnBpC,IAASoC,EAAU,SACnBpC,IAASoC,EAAU,SACnBpC,IAASoC,EAAU,QACnBpC,IAASoC,EAAU,OACnBpC,IAASoC,EAAU,QACnBpC,IAASoC,EAAU,IACnBpC,IAASoC,EAAU,WACnBpC,IAASoC,EAAU,WACnBpC,IAASoC,EAAU,SACnBpC,IAASoC,EAAU,MACnBpC,IAASoC,EAAU,OAEvB,CAUA,SAASM,GAAqBlhB,EAAM,CAClC,OACGA,GAAQ,GAAUA,GAAQ,OAAYA,GAAQ,OAAUA,GAAQ,OAErE,CAUA,SAASmhB,GAAyB9I,EAAMsD,EAAU,CAChD,OACEyF,GAAmB/I,EAAK,WAAWsD,CAAQ,CAAC,GAC5C0F,GAAoBhJ,EAAK,WAAWsD,EAAW,CAAC,CAAC,CAErD,CAEA,SAASyF,GAAmBphB,EAAM,CAChC,OAAOA,GAAQ,OAAUA,GAAQ,KACnC,CAEA,SAASqhB,GAAoBrhB,EAAM,CACjC,OAAOA,GAAQ,OAAUA,GAAQ,KACnC,CASA,SAASshB,GAAiBC,EAAO5F,EAAU,CACzC,MAAM3b,EAAOuhB,EAAM,OAAO,KAAK,YAAY5F,CAAQ,EAEnD,GAAI3b,IAAS,OACX,OAAO4gB,EAAU,IACZ,GAAI5gB,GAAQ,IAAUA,GAAQ,IAAQ,CAE3C,MAAMwhB,EAAO,OAAO,cAAcxhB,CAAI,EACtC,OAAOwhB,IAAS,IAAM,MAAS,IAAIA,CAAI,GACxC,CAED,MAAO,KAAOxhB,EAAK,SAAS,EAAE,EAAE,YAAW,EAAG,SAAS,EAAG,GAAG,CAC/D,CAKA,SAASyhB,EAAYF,EAAO/C,EAAMC,EAAOC,EAAKpa,EAAO,CACnD,MAAMkX,EAAO+F,EAAM,KACbG,EAAM,EAAIjD,EAAQ8C,EAAM,UAC9B,OAAO,IAAIhD,GAAMC,EAAMC,EAAOC,EAAKlD,EAAMkG,EAAKpd,CAAK,CACrD,CASA,SAAS0c,GAAcO,EAAO9C,EAAO,CACnC,MAAMpG,EAAOkJ,EAAM,OAAO,KACpBI,EAAatJ,EAAK,OACxB,IAAIiD,EAAWmD,EAEf,KAAOnD,EAAWqG,GAAY,CAC5B,MAAM3hB,EAAOqY,EAAK,WAAWiD,CAAQ,EAErC,OAAQtb,EAAI,CAeV,IAAK,OAEL,IAAK,GAEL,IAAK,IAEL,IAAK,IAEH,EAAEsb,EACF,SAMF,IAAK,IAEH,EAAEA,EACF,EAAEiG,EAAM,KACRA,EAAM,UAAYjG,EAClB,SAEF,IAAK,IAECjD,EAAK,WAAWiD,EAAW,CAAC,IAAM,GACpCA,GAAY,EAEZ,EAAEA,EAGJ,EAAEiG,EAAM,KACRA,EAAM,UAAYjG,EAClB,SAGF,IAAK,IAEH,OAAOsG,GAAYL,EAAOjG,CAAQ,EAUpC,IAAK,IAEH,OAAOmG,EAAYF,EAAOX,EAAU,KAAMtF,EAAUA,EAAW,CAAC,EAElE,IAAK,IAEH,OAAOmG,EAAYF,EAAOX,EAAU,OAAQtF,EAAUA,EAAW,CAAC,EAEpE,IAAK,IAEH,OAAOmG,EAAYF,EAAOX,EAAU,IAAKtF,EAAUA,EAAW,CAAC,EAEjE,IAAK,IAEH,OAAOmG,EAAYF,EAAOX,EAAU,QAAStF,EAAUA,EAAW,CAAC,EAErE,IAAK,IAEH,OAAOmG,EAAYF,EAAOX,EAAU,QAAStF,EAAUA,EAAW,CAAC,EAErE,IAAK,IAEH,GACEjD,EAAK,WAAWiD,EAAW,CAAC,IAAM,IAClCjD,EAAK,WAAWiD,EAAW,CAAC,IAAM,GAElC,OAAOmG,EAAYF,EAAOX,EAAU,OAAQtF,EAAUA,EAAW,CAAC,EAGpE,MAEF,IAAK,IAEH,OAAOmG,EAAYF,EAAOX,EAAU,MAAOtF,EAAUA,EAAW,CAAC,EAEnE,IAAK,IAEH,OAAOmG,EAAYF,EAAOX,EAAU,OAAQtF,EAAUA,EAAW,CAAC,EAEpE,IAAK,IAEH,OAAOmG,EAAYF,EAAOX,EAAU,GAAItF,EAAUA,EAAW,CAAC,EAEhE,IAAK,IAEH,OAAOmG,EAAYF,EAAOX,EAAU,UAAWtF,EAAUA,EAAW,CAAC,EAEvE,IAAK,IAEH,OAAOmG,EAAYF,EAAOX,EAAU,UAAWtF,EAAUA,EAAW,CAAC,EAEvE,IAAK,KAEH,OAAOmG,EAAYF,EAAOX,EAAU,QAAStF,EAAUA,EAAW,CAAC,EAErE,IAAK,KAEH,OAAOmG,EAAYF,EAAOX,EAAU,KAAMtF,EAAUA,EAAW,CAAC,EAElE,IAAK,KAEH,OAAOmG,EAAYF,EAAOX,EAAU,QAAStF,EAAUA,EAAW,CAAC,EAGrE,IAAK,IAEH,OACEjD,EAAK,WAAWiD,EAAW,CAAC,IAAM,IAClCjD,EAAK,WAAWiD,EAAW,CAAC,IAAM,GAE3BuG,GAAgBN,EAAOjG,CAAQ,EAGjCwG,GAAWP,EAAOjG,CAAQ,CACpC,CAED,GAAI+D,GAAQrf,CAAI,GAAKA,IAAS,GAC5B,OAAO+hB,GAAWR,EAAOjG,EAAUtb,CAAI,EAGzC,GAAIuf,GAAYvf,CAAI,EAClB,OAAOgiB,GAAST,EAAOjG,CAAQ,EAGjC,MAAM4C,EACJqD,EAAM,OACNjG,EACAtb,IAAS,GACL,iFACAkhB,GAAqBlhB,CAAI,GAAKmhB,GAAyB9I,EAAMiD,CAAQ,EACrE,yBAAyBgG,GAAiBC,EAAOjG,CAAQ,CAAC,IAC1D,sBAAsBgG,GAAiBC,EAAOjG,CAAQ,CAAC,GACjE,CACG,CAED,OAAOmG,EAAYF,EAAOX,EAAU,IAAKe,EAAYA,CAAU,CACjE,CAWA,SAASC,GAAYL,EAAO9C,EAAO,CACjC,MAAMpG,EAAOkJ,EAAM,OAAO,KACpBI,EAAatJ,EAAK,OACxB,IAAIiD,EAAWmD,EAAQ,EAEvB,KAAOnD,EAAWqG,GAAY,CAC5B,MAAM3hB,EAAOqY,EAAK,WAAWiD,CAAQ,EAErC,GAAItb,IAAS,IAAUA,IAAS,GAC9B,MAGF,GAAIkhB,GAAqBlhB,CAAI,EAC3B,EAAEsb,UACO6F,GAAyB9I,EAAMiD,CAAQ,EAChDA,GAAY,MAEZ,MAEH,CAED,OAAOmG,EACLF,EACAX,EAAU,QACVnC,EACAnD,EACAjD,EAAK,MAAMoG,EAAQ,EAAGnD,CAAQ,CAClC,CACA,CA+BA,SAASyG,GAAWR,EAAO9C,EAAOwD,EAAW,CAC3C,MAAM5J,EAAOkJ,EAAM,OAAO,KAC1B,IAAIjG,EAAWmD,EACXze,EAAOiiB,EACPC,EAAU,GAMd,GAJIliB,IAAS,KACXA,EAAOqY,EAAK,WAAW,EAAEiD,CAAQ,GAG/Btb,IAAS,IAGX,GAFAA,EAAOqY,EAAK,WAAW,EAAEiD,CAAQ,EAE7B+D,GAAQrf,CAAI,EACd,MAAMke,EACJqD,EAAM,OACNjG,EACA,6CAA6CgG,GAC3CC,EACAjG,CACD,CAAA,GACT,OAGIA,EAAW6G,GAAWZ,EAAOjG,EAAUtb,CAAI,EAC3CA,EAAOqY,EAAK,WAAWiD,CAAQ,EAsBjC,GAnBItb,IAAS,KACXkiB,EAAU,GACVliB,EAAOqY,EAAK,WAAW,EAAEiD,CAAQ,EACjCA,EAAW6G,GAAWZ,EAAOjG,EAAUtb,CAAI,EAC3CA,EAAOqY,EAAK,WAAWiD,CAAQ,IAG7Btb,IAAS,IAAUA,IAAS,OAC9BkiB,EAAU,GACVliB,EAAOqY,EAAK,WAAW,EAAEiD,CAAQ,GAE7Btb,IAAS,IAAUA,IAAS,MAC9BA,EAAOqY,EAAK,WAAW,EAAEiD,CAAQ,GAGnCA,EAAW6G,GAAWZ,EAAOjG,EAAUtb,CAAI,EAC3CA,EAAOqY,EAAK,WAAWiD,CAAQ,GAG7Btb,IAAS,IAAUuf,GAAYvf,CAAI,EACrC,MAAMke,EACJqD,EAAM,OACNjG,EACA,2CAA2CgG,GACzCC,EACAjG,CACD,CAAA,GACP,EAGE,OAAOmG,EACLF,EACAW,EAAUtB,EAAU,MAAQA,EAAU,IACtCnC,EACAnD,EACAjD,EAAK,MAAMoG,EAAOnD,CAAQ,CAC9B,CACA,CAKA,SAAS6G,GAAWZ,EAAO9C,EAAOwD,EAAW,CAC3C,GAAI,CAAC5C,GAAQ4C,CAAS,EACpB,MAAM/D,EACJqD,EAAM,OACN9C,EACA,2CAA2C6C,GACzCC,EACA9C,CACD,CAAA,GACP,EAGE,MAAMpG,EAAOkJ,EAAM,OAAO,KAC1B,IAAIjG,EAAWmD,EAAQ,EAEvB,KAAOY,GAAQhH,EAAK,WAAWiD,CAAQ,CAAC,GACtC,EAAEA,EAGJ,OAAOA,CACT,CAsBA,SAASwG,GAAWP,EAAO9C,EAAO,CAChC,MAAMpG,EAAOkJ,EAAM,OAAO,KACpBI,EAAatJ,EAAK,OACxB,IAAIiD,EAAWmD,EAAQ,EACnB2D,EAAa9G,EACbhX,EAAQ,GAEZ,KAAOgX,EAAWqG,GAAY,CAC5B,MAAM3hB,EAAOqY,EAAK,WAAWiD,CAAQ,EAErC,GAAItb,IAAS,GACX,OAAAsE,GAAS+T,EAAK,MAAM+J,EAAY9G,CAAQ,EACjCmG,EAAYF,EAAOX,EAAU,OAAQnC,EAAOnD,EAAW,EAAGhX,CAAK,EAGxE,GAAItE,IAAS,GAAQ,CACnBsE,GAAS+T,EAAK,MAAM+J,EAAY9G,CAAQ,EACxC,MAAM+G,EACJhK,EAAK,WAAWiD,EAAW,CAAC,IAAM,IAC9BjD,EAAK,WAAWiD,EAAW,CAAC,IAAM,IAChCgH,GAAgCf,EAAOjG,CAAQ,EAC/CiH,GAA6BhB,EAAOjG,CAAQ,EAC9CkH,GAAqBjB,EAAOjG,CAAQ,EAC1ChX,GAAS+d,EAAO,MAChB/G,GAAY+G,EAAO,KACnBD,EAAa9G,EACb,QACD,CAED,GAAItb,IAAS,IAAUA,IAAS,GAC9B,MAGF,GAAIkhB,GAAqBlhB,CAAI,EAC3B,EAAEsb,UACO6F,GAAyB9I,EAAMiD,CAAQ,EAChDA,GAAY,MAEZ,OAAM4C,EACJqD,EAAM,OACNjG,EACA,oCAAoCgG,GAClCC,EACAjG,CACD,CAAA,GACT,CAEG,CAED,MAAM4C,EAAYqD,EAAM,OAAQjG,EAAU,sBAAsB,CAClE,CAEA,SAASgH,GAAgCf,EAAOjG,EAAU,CACxD,MAAMjD,EAAOkJ,EAAM,OAAO,KAC1B,IAAIkB,EAAQ,EACRjO,EAAO,EAEX,KAAOA,EAAO,IAAI,CAChB,MAAMxU,EAAOqY,EAAK,WAAWiD,EAAW9G,GAAM,EAE9C,GAAIxU,IAAS,IAAQ,CAEnB,GAAIwU,EAAO,GAAK,CAAC0M,GAAqBuB,CAAK,EACzC,MAGF,MAAO,CACL,MAAO,OAAO,cAAcA,CAAK,EACjC,KAAAjO,CACR,CACK,CAID,GAFAiO,EAASA,GAAS,EAAKC,GAAa1iB,CAAI,EAEpCyiB,EAAQ,EACV,KAEH,CAED,MAAMvE,EACJqD,EAAM,OACNjG,EACA,qCAAqCjD,EAAK,MACxCiD,EACAA,EAAW9G,CACZ,CAAA,IACL,CACA,CAEA,SAAS+N,GAA6BhB,EAAOjG,EAAU,CACrD,MAAMjD,EAAOkJ,EAAM,OAAO,KACpBvhB,EAAO2iB,GAAiBtK,EAAMiD,EAAW,CAAC,EAEhD,GAAI4F,GAAqBlhB,CAAI,EAC3B,MAAO,CACL,MAAO,OAAO,cAAcA,CAAI,EAChC,KAAM,CACZ,EAIE,GAAIohB,GAAmBphB,CAAI,GAGvBqY,EAAK,WAAWiD,EAAW,CAAC,IAAM,IAClCjD,EAAK,WAAWiD,EAAW,CAAC,IAAM,IAClC,CACA,MAAMsH,EAAeD,GAAiBtK,EAAMiD,EAAW,CAAC,EAExD,GAAI+F,GAAoBuB,CAAY,EAOlC,MAAO,CACL,MAAO,OAAO,cAAc5iB,EAAM4iB,CAAY,EAC9C,KAAM,EAChB,CAEK,CAGH,MAAM1E,EACJqD,EAAM,OACNjG,EACA,qCAAqCjD,EAAK,MAAMiD,EAAUA,EAAW,CAAC,CAAC,IAC3E,CACA,CASA,SAASqH,GAAiBtK,EAAMiD,EAAU,CAGxC,OACGoH,GAAarK,EAAK,WAAWiD,CAAQ,CAAC,GAAK,GAC3CoH,GAAarK,EAAK,WAAWiD,EAAW,CAAC,CAAC,GAAK,EAC/CoH,GAAarK,EAAK,WAAWiD,EAAW,CAAC,CAAC,GAAK,EAChDoH,GAAarK,EAAK,WAAWiD,EAAW,CAAC,CAAC,CAE9C,CAgBA,SAASoH,GAAa1iB,EAAM,CAC1B,OAAOA,GAAQ,IAAUA,GAAQ,GAC7BA,EAAO,GACPA,GAAQ,IAAUA,GAAQ,GAC1BA,EAAO,GACPA,GAAQ,IAAUA,GAAQ,IAC1BA,EAAO,GACP,EACN,CAcA,SAASwiB,GAAqBjB,EAAOjG,EAAU,CAC7C,MAAMjD,EAAOkJ,EAAM,OAAO,KAG1B,OAFalJ,EAAK,WAAWiD,EAAW,CAAC,EAE7B,CACV,IAAK,IAEH,MAAO,CACL,MAAO,IACP,KAAM,CACd,EAEI,IAAK,IAEH,MAAO,CACL,MAAO,KACP,KAAM,CACd,EAEI,IAAK,IAEH,MAAO,CACL,MAAO,IACP,KAAM,CACd,EAEI,IAAK,IAEH,MAAO,CACL,MAAO,KACP,KAAM,CACd,EAEI,IAAK,KAEH,MAAO,CACL,MAAO,KACP,KAAM,CACd,EAEI,IAAK,KAEH,MAAO,CACL,MAAO;AAAA,EACP,KAAM,CACd,EAEI,IAAK,KAEH,MAAO,CACL,MAAO,KACP,KAAM,CACd,EAEI,IAAK,KAEH,MAAO,CACL,MAAO,IACP,KAAM,CACd,CACG,CAED,MAAM4C,EACJqD,EAAM,OACNjG,EACA,uCAAuCjD,EAAK,MAC1CiD,EACAA,EAAW,CACZ,CAAA,IACL,CACA,CAcA,SAASuG,GAAgBN,EAAO9C,EAAO,CACrC,MAAMpG,EAAOkJ,EAAM,OAAO,KACpBI,EAAatJ,EAAK,OACxB,IAAIwK,EAAYtB,EAAM,UAClBjG,EAAWmD,EAAQ,EACnB2D,EAAa9G,EACbwH,EAAc,GAClB,MAAMC,EAAa,CAAA,EAEnB,KAAOzH,EAAWqG,GAAY,CAC5B,MAAM3hB,EAAOqY,EAAK,WAAWiD,CAAQ,EAErC,GACEtb,IAAS,IACTqY,EAAK,WAAWiD,EAAW,CAAC,IAAM,IAClCjD,EAAK,WAAWiD,EAAW,CAAC,IAAM,GAClC,CACAwH,GAAezK,EAAK,MAAM+J,EAAY9G,CAAQ,EAC9CyH,EAAW,KAAKD,CAAW,EAC3B,MAAMjN,EAAQ4L,EACZF,EACAX,EAAU,aACVnC,EACAnD,EAAW,EACXmE,GAAuBsD,CAAU,EAAE,KAAK;AAAA,CAAI,CACpD,EACM,OAAAxB,EAAM,MAAQwB,EAAW,OAAS,EAClCxB,EAAM,UAAYsB,EACXhN,CACR,CAED,GACE7V,IAAS,IACTqY,EAAK,WAAWiD,EAAW,CAAC,IAAM,IAClCjD,EAAK,WAAWiD,EAAW,CAAC,IAAM,IAClCjD,EAAK,WAAWiD,EAAW,CAAC,IAAM,GAClC,CACAwH,GAAezK,EAAK,MAAM+J,EAAY9G,CAAQ,EAC9C8G,EAAa9G,EAAW,EAExBA,GAAY,EACZ,QACD,CAED,GAAItb,IAAS,IAAUA,IAAS,GAAQ,CACtC8iB,GAAezK,EAAK,MAAM+J,EAAY9G,CAAQ,EAC9CyH,EAAW,KAAKD,CAAW,EAEvB9iB,IAAS,IAAUqY,EAAK,WAAWiD,EAAW,CAAC,IAAM,GACvDA,GAAY,EAEZ,EAAEA,EAGJwH,EAAc,GACdV,EAAa9G,EACbuH,EAAYvH,EACZ,QACD,CAED,GAAI4F,GAAqBlhB,CAAI,EAC3B,EAAEsb,UACO6F,GAAyB9I,EAAMiD,CAAQ,EAChDA,GAAY,MAEZ,OAAM4C,EACJqD,EAAM,OACNjG,EACA,oCAAoCgG,GAClCC,EACAjG,CACD,CAAA,GACT,CAEG,CAED,MAAM4C,EAAYqD,EAAM,OAAQjG,EAAU,sBAAsB,CAClE,CAUA,SAAS0G,GAAST,EAAO9C,EAAO,CAC9B,MAAMpG,EAAOkJ,EAAM,OAAO,KACpBI,EAAatJ,EAAK,OACxB,IAAIiD,EAAWmD,EAAQ,EAEvB,KAAOnD,EAAWqG,GAAY,CAC5B,MAAM3hB,EAAOqY,EAAK,WAAWiD,CAAQ,EAErC,GAAIkE,GAAexf,CAAI,EACrB,EAAEsb,MAEF,MAEH,CAED,OAAOmG,EACLF,EACAX,EAAU,KACVnC,EACAnD,EACAjD,EAAK,MAAMoG,EAAOnD,CAAQ,CAC9B,CACA,CCr4BA,MAAM0H,GAAmB,GACnBC,GAAsB,EAKrB,SAASC,GAAQ5e,EAAO,CAC7B,OAAO6e,GAAY7e,EAAO,CAAA,CAAE,CAC9B,CAEA,SAAS6e,GAAY7e,EAAO8e,EAAY,CACtC,OAAQ,OAAO9e,EAAK,CAClB,IAAK,SACH,OAAO,KAAK,UAAUA,CAAK,EAE7B,IAAK,WACH,OAAOA,EAAM,KAAO,aAAaA,EAAM,IAAI,IAAM,aAEnD,IAAK,SACH,OAAO+e,GAAkB/e,EAAO8e,CAAU,EAE5C,QACE,OAAO,OAAO9e,CAAK,CACtB,CACH,CAEA,SAAS+e,GAAkB/e,EAAOgf,EAAsB,CACtD,GAAIhf,IAAU,KACZ,MAAO,OAGT,GAAIgf,EAAqB,SAAShf,CAAK,EACrC,MAAO,aAGT,MAAM8e,EAAa,CAAC,GAAGE,EAAsBhf,CAAK,EAElD,GAAIif,GAAWjf,CAAK,EAAG,CACrB,MAAMkf,EAAYlf,EAAM,SAExB,GAAIkf,IAAclf,EAChB,OAAO,OAAOkf,GAAc,SACxBA,EACAL,GAAYK,EAAWJ,CAAU,CAExC,SAAU,MAAM,QAAQ9e,CAAK,EAC5B,OAAOmf,GAAYnf,EAAO8e,CAAU,EAGtC,OAAOM,GAAapf,EAAO8e,CAAU,CACvC,CAEA,SAASG,GAAWjf,EAAO,CACzB,OAAO,OAAOA,EAAM,QAAW,UACjC,CAEA,SAASof,GAAaC,EAAQP,EAAY,CACxC,MAAMQ,EAAU,OAAO,QAAQD,CAAM,EAErC,OAAIC,EAAQ,SAAW,EACd,KAGLR,EAAW,OAASH,GACf,IAAMY,GAAaF,CAAM,EAAI,IAM/B,KAHYC,EAAQ,IACzB,CAAC,CAACviB,EAAKiD,CAAK,IAAMjD,EAAM,KAAO8hB,GAAY7e,EAAO8e,CAAU,CAChE,EAC2B,KAAK,IAAI,EAAI,IACxC,CAEA,SAASK,GAAYxF,EAAOmF,EAAY,CACtC,GAAInF,EAAM,SAAW,EACnB,MAAO,KAGT,GAAImF,EAAW,OAASH,GACtB,MAAO,UAGT,MAAMa,EAAM,KAAK,IAAId,GAAkB/E,EAAM,MAAM,EAC7C8F,EAAY9F,EAAM,OAAS6F,EAC3BnY,EAAQ,CAAA,EAEd,QAASnJ,EAAI,EAAGA,EAAIshB,EAAK,EAAEthB,EACzBmJ,EAAM,KAAKwX,GAAYlF,EAAMzb,CAAC,EAAG4gB,CAAU,CAAC,EAG9C,OAAIW,IAAc,EAChBpY,EAAM,KAAK,iBAAiB,EACnBoY,EAAY,GACrBpY,EAAM,KAAK,OAAOoY,CAAS,aAAa,EAGnC,IAAMpY,EAAM,KAAK,IAAI,EAAI,GAClC,CAEA,SAASkY,GAAaF,EAAQ,CAC5B,MAAMK,EAAM,OAAO,UAAU,SAC1B,KAAKL,CAAM,EACX,QAAQ,aAAc,EAAE,EACxB,QAAQ,KAAM,EAAE,EAEnB,GAAIK,IAAQ,UAAY,OAAOL,EAAO,aAAgB,WAAY,CAChE,MAAMhT,EAAOgT,EAAO,YAAY,KAEhC,GAAI,OAAOhT,GAAS,UAAYA,IAAS,GACvC,OAAOA,CAEV,CAED,OAAOqT,CACT,CC/GA,MAAMC,GACJ,WAAW,SACX,GAQWC,GAGXD,GACI,SAAoB3f,EAAO6f,EAAa,CACtC,OAAO7f,aAAiB6f,CAAA,EAE1B,SAAoB7f,EAAO6f,EAAa,CACtC,GAAI7f,aAAiB6f,EACZ,MAAA,GAGT,GAAI,OAAO7f,GAAU,UAAYA,IAAU,KAAM,CAC3C,IAAA8f,EAGJ,MAAMxP,EAAYuP,EAAY,UAAU,OAAO,WAAW,EACpDE,EACJ,OAAO,eAAe/f,EAClBA,EAAM,OAAO,WAAW,GACvB8f,EAAqB9f,EAAM,eAAiB,MAC7C8f,IAAuB,OACvB,OACAA,EAAmB,KAEzB,GAAIxP,IAAcyP,EAAgB,CAC1B,MAAAC,EAAmBpB,GAAQ5e,CAAK,EACtC,MAAM,IAAI,MAAM,cAAcsQ,CAAS,KAAK0P,CAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAWtD,CACR,CACF,CAEO,MAAA,EACT,EC7CC,MAAMC,EAAO,CAClB,YACElM,EACA1H,EAAO,kBACP6T,EAAiB,CACf,KAAM,EACN,OAAQ,CACT,EACD,CACA,OAAOnM,GAAS,UACd6C,GAAU,GAAO,oCAAoCgI,GAAQ7K,CAAI,CAAC,GAAG,EACvE,KAAK,KAAOA,EACZ,KAAK,KAAO1H,EACZ,KAAK,eAAiB6T,EACtB,KAAK,eAAe,KAAO,GACzBtJ,GACE,GACA,2DACR,EACI,KAAK,eAAe,OAAS,GAC3BA,GACE,GACA,6DACR,CACG,CAED,IAAK,OAAO,WAAW,GAAI,CACzB,MAAO,QACR,CACH,CAOO,SAASuJ,GAASvb,EAAQ,CAC/B,OAAOgb,GAAWhb,EAAQqb,EAAM,CAClC,CClCO,SAASG,GAAMxb,EAAQoD,EAAS,CAErC,OADe,IAAIqY,GAAOzb,EAAQoD,CAAO,EAC3B,eAChB,CA6DO,MAAMqY,EAAO,CAClB,YAAYzb,EAAQoD,EAAU,GAAI,CAChC,MAAMsY,EAAYH,GAASvb,CAAM,EAAIA,EAAS,IAAIqb,GAAOrb,CAAM,EAC/D,KAAK,OAAS,IAAI2X,GAAM+D,CAAS,EACjC,KAAK,SAAWtY,EAChB,KAAK,cAAgB,CACtB,CAKD,WAAY,CACV,MAAMuJ,EAAQ,KAAK,YAAY+K,EAAU,IAAI,EAC7C,OAAO,KAAK,KAAK/K,EAAO,CACtB,KAAMsJ,EAAK,KACX,MAAOtJ,EAAM,KACnB,CAAK,CACF,CAMD,eAAgB,CACd,OAAO,KAAK,KAAK,KAAK,OAAO,MAAO,CAClC,KAAMsJ,EAAK,SACX,YAAa,KAAK,KAChByB,EAAU,IACV,KAAK,gBACLA,EAAU,GACX,CACP,CAAK,CACF,CAyBD,iBAAkB,CAChB,GAAI,KAAK,KAAKA,EAAU,OAAO,EAC7B,OAAO,KAAK,2BAGd,MAAMiE,EAAiB,KAAK,kBACtBC,EAAeD,EACjB,KAAK,OAAO,UAAW,EACvB,KAAK,OAAO,MAEhB,GAAIC,EAAa,OAASlE,EAAU,KAAM,CACxC,OAAQkE,EAAa,MAAK,CACxB,IAAK,SACH,OAAO,KAAK,wBAEd,IAAK,SACH,OAAO,KAAK,4BAEd,IAAK,OACH,OAAO,KAAK,4BAEd,IAAK,YACH,OAAO,KAAK,+BAEd,IAAK,QACH,OAAO,KAAK,2BAEd,IAAK,OACH,OAAO,KAAK,0BAEd,IAAK,QACH,OAAO,KAAK,iCAEd,IAAK,YACH,OAAO,KAAK,0BACf,CAED,GAAID,EACF,MAAM3G,EACJ,KAAK,OAAO,OACZ,KAAK,OAAO,MAAM,MAClB,8EACV,EAGM,OAAQ4G,EAAa,MAAK,CACxB,IAAK,QACL,IAAK,WACL,IAAK,eACH,OAAO,KAAK,2BAEd,IAAK,WACH,OAAO,KAAK,0BAEd,IAAK,SACH,OAAO,KAAK,0BACf,CACF,CAED,MAAM,KAAK,WAAWA,CAAY,CACnC,CAQD,0BAA2B,CACzB,MAAMrG,EAAQ,KAAK,OAAO,MAE1B,GAAI,KAAK,KAAKmC,EAAU,OAAO,EAC7B,OAAO,KAAK,KAAKnC,EAAO,CACtB,KAAMU,EAAK,qBACX,UAAWF,GAAkB,MAC7B,KAAM,OACN,oBAAqB,CAAE,EACvB,WAAY,CAAE,EACd,aAAc,KAAK,kBAAmB,CAC9C,CAAO,EAGH,MAAM8F,EAAY,KAAK,qBACvB,IAAIpU,EAEJ,OAAI,KAAK,KAAKiQ,EAAU,IAAI,IAC1BjQ,EAAO,KAAK,aAGP,KAAK,KAAK8N,EAAO,CACtB,KAAMU,EAAK,qBACX,UAAA4F,EACA,KAAApU,EACA,oBAAqB,KAAK,yBAA0B,EACpD,WAAY,KAAK,gBAAgB,EAAK,EACtC,aAAc,KAAK,kBAAmB,CAC5C,CAAK,CACF,CAKD,oBAAqB,CACnB,MAAMqU,EAAiB,KAAK,YAAYpE,EAAU,IAAI,EAEtD,OAAQoE,EAAe,MAAK,CAC1B,IAAK,QACH,OAAO/F,GAAkB,MAE3B,IAAK,WACH,OAAOA,GAAkB,SAE3B,IAAK,eACH,OAAOA,GAAkB,YAC5B,CAED,MAAM,KAAK,WAAW+F,CAAc,CACrC,CAKD,0BAA2B,CACzB,OAAO,KAAK,aACVpE,EAAU,QACV,KAAK,wBACLA,EAAU,OAChB,CACG,CAKD,yBAA0B,CACxB,OAAO,KAAK,KAAK,KAAK,OAAO,MAAO,CAClC,KAAMzB,EAAK,oBACX,SAAU,KAAK,cAAe,EAC9B,MAAO,KAAK,YAAYyB,EAAU,KAAK,EAAG,KAAK,sBAC/C,aAAc,KAAK,oBAAoBA,EAAU,MAAM,EACnD,KAAK,uBAAwB,EAC7B,OACJ,WAAY,KAAK,qBAAsB,CAC7C,CAAK,CACF,CAKD,eAAgB,CACd,MAAMnC,EAAQ,KAAK,OAAO,MAC1B,YAAK,YAAYmC,EAAU,MAAM,EAC1B,KAAK,KAAKnC,EAAO,CACtB,KAAMU,EAAK,SACX,KAAM,KAAK,UAAW,CAC5B,CAAK,CACF,CAOD,mBAAoB,CAClB,OAAO,KAAK,KAAK,KAAK,OAAO,MAAO,CAClC,KAAMA,EAAK,cACX,WAAY,KAAK,KACfyB,EAAU,QACV,KAAK,eACLA,EAAU,OACX,CACP,CAAK,CACF,CAQD,gBAAiB,CACf,OAAO,KAAK,KAAKA,EAAU,MAAM,EAC7B,KAAK,cAAe,EACpB,KAAK,WAAU,CACpB,CAOD,YAAa,CACX,MAAMnC,EAAQ,KAAK,OAAO,MACpBwG,EAAc,KAAK,YACzB,IAAIC,EACAvU,EAEJ,OAAI,KAAK,oBAAoBiQ,EAAU,KAAK,GAC1CsE,EAAQD,EACRtU,EAAO,KAAK,aAEZA,EAAOsU,EAGF,KAAK,KAAKxG,EAAO,CACtB,KAAMU,EAAK,MACX,MAAA+F,EACA,KAAAvU,EACA,UAAW,KAAK,eAAe,EAAK,EACpC,WAAY,KAAK,gBAAgB,EAAK,EACtC,aAAc,KAAK,KAAKiQ,EAAU,OAAO,EACrC,KAAK,kBAAmB,EACxB,MACV,CAAK,CACF,CAKD,eAAeuE,EAAS,CACtB,MAAMC,EAAOD,EAAU,KAAK,mBAAqB,KAAK,cACtD,OAAO,KAAK,aAAavE,EAAU,QAASwE,EAAMxE,EAAU,OAAO,CACpE,CAKD,cAAcuE,EAAU,GAAO,CAC7B,MAAM1G,EAAQ,KAAK,OAAO,MACpB9N,EAAO,KAAK,YAClB,YAAK,YAAYiQ,EAAU,KAAK,EACzB,KAAK,KAAKnC,EAAO,CACtB,KAAMU,EAAK,SACX,KAAAxO,EACA,MAAO,KAAK,kBAAkBwU,CAAO,CAC3C,CAAK,CACF,CAED,oBAAqB,CACnB,OAAO,KAAK,cAAc,EAAI,CAC/B,CAUD,eAAgB,CACd,MAAM1G,EAAQ,KAAK,OAAO,MAC1B,KAAK,YAAYmC,EAAU,MAAM,EACjC,MAAMyE,EAAmB,KAAK,sBAAsB,IAAI,EAExD,MAAI,CAACA,GAAoB,KAAK,KAAKzE,EAAU,IAAI,EACxC,KAAK,KAAKnC,EAAO,CACtB,KAAMU,EAAK,gBACX,KAAM,KAAK,kBAAmB,EAC9B,WAAY,KAAK,gBAAgB,EAAK,CAC9C,CAAO,EAGI,KAAK,KAAKV,EAAO,CACtB,KAAMU,EAAK,gBACX,cAAekG,EAAmB,KAAK,eAAgB,EAAG,OAC1D,WAAY,KAAK,gBAAgB,EAAK,EACtC,aAAc,KAAK,kBAAmB,CAC5C,CAAK,CACF,CAQD,yBAA0B,CACxB,MAAM5G,EAAQ,KAAK,OAAO,MAK1B,OAJA,KAAK,cAAc,UAAU,EAIzB,KAAK,SAAS,+BAAiC,GAC1C,KAAK,KAAKA,EAAO,CACtB,KAAMU,EAAK,oBACX,KAAM,KAAK,kBAAmB,EAC9B,oBAAqB,KAAK,yBAA0B,EACpD,eAAgB,KAAK,cAAc,IAAI,EAAG,KAAK,kBAC/C,WAAY,KAAK,gBAAgB,EAAK,EACtC,aAAc,KAAK,kBAAmB,CAC9C,CAAO,EAGI,KAAK,KAAKV,EAAO,CACtB,KAAMU,EAAK,oBACX,KAAM,KAAK,kBAAmB,EAC9B,eAAgB,KAAK,cAAc,IAAI,EAAG,KAAK,kBAC/C,WAAY,KAAK,gBAAgB,EAAK,EACtC,aAAc,KAAK,kBAAmB,CAC5C,CAAK,CACF,CAKD,mBAAoB,CAClB,GAAI,KAAK,OAAO,MAAM,QAAU,KAC9B,MAAM,KAAK,aAGb,OAAO,KAAK,WACb,CAqBD,kBAAkBgG,EAAS,CACzB,MAAMtP,EAAQ,KAAK,OAAO,MAE1B,OAAQA,EAAM,KAAI,CAChB,KAAK+K,EAAU,UACb,OAAO,KAAK,UAAUuE,CAAO,EAE/B,KAAKvE,EAAU,QACb,OAAO,KAAK,YAAYuE,CAAO,EAEjC,KAAKvE,EAAU,IACb,YAAK,aAAY,EACV,KAAK,KAAK/K,EAAO,CACtB,KAAMsJ,EAAK,IACX,MAAOtJ,EAAM,KACvB,CAAS,EAEH,KAAK+K,EAAU,MACb,YAAK,aAAY,EACV,KAAK,KAAK/K,EAAO,CACtB,KAAMsJ,EAAK,MACX,MAAOtJ,EAAM,KACvB,CAAS,EAEH,KAAK+K,EAAU,OACf,KAAKA,EAAU,aACb,OAAO,KAAK,qBAEd,KAAKA,EAAU,KAGb,OAFA,KAAK,aAAY,EAET/K,EAAM,MAAK,CACjB,IAAK,OACH,OAAO,KAAK,KAAKA,EAAO,CACtB,KAAMsJ,EAAK,QACX,MAAO,EACrB,CAAa,EAEH,IAAK,QACH,OAAO,KAAK,KAAKtJ,EAAO,CACtB,KAAMsJ,EAAK,QACX,MAAO,EACrB,CAAa,EAEH,IAAK,OACH,OAAO,KAAK,KAAKtJ,EAAO,CACtB,KAAMsJ,EAAK,IACzB,CAAa,EAEH,QACE,OAAO,KAAK,KAAKtJ,EAAO,CACtB,KAAMsJ,EAAK,KACX,MAAOtJ,EAAM,KAC3B,CAAa,CACJ,CAEH,KAAK+K,EAAU,OACb,GAAIuE,EAGF,GAFA,KAAK,YAAYvE,EAAU,MAAM,EAE7B,KAAK,OAAO,MAAM,OAASA,EAAU,KAAM,CAC7C,MAAM0E,EAAU,KAAK,OAAO,MAAM,MAClC,MAAMpH,EACJ,KAAK,OAAO,OACZrI,EAAM,MACN,yBAAyByP,CAAO,sBAC9C,CACA,KACY,OAAM,KAAK,WAAWzP,CAAK,EAI/B,OAAO,KAAK,gBAEd,QACE,MAAM,KAAK,YACd,CACF,CAED,wBAAyB,CACvB,OAAO,KAAK,kBAAkB,EAAI,CACnC,CAED,oBAAqB,CACnB,MAAMA,EAAQ,KAAK,OAAO,MAC1B,YAAK,aAAY,EACV,KAAK,KAAKA,EAAO,CACtB,KAAMsJ,EAAK,OACX,MAAOtJ,EAAM,MACb,MAAOA,EAAM,OAAS+K,EAAU,YACtC,CAAK,CACF,CAOD,UAAUuE,EAAS,CACjB,MAAMC,EAAO,IAAM,KAAK,kBAAkBD,CAAO,EAEjD,OAAO,KAAK,KAAK,KAAK,OAAO,MAAO,CAClC,KAAMhG,EAAK,KACX,OAAQ,KAAK,IAAIyB,EAAU,UAAWwE,EAAMxE,EAAU,SAAS,CACrE,CAAK,CACF,CASD,YAAYuE,EAAS,CACnB,MAAMC,EAAO,IAAM,KAAK,iBAAiBD,CAAO,EAEhD,OAAO,KAAK,KAAK,KAAK,OAAO,MAAO,CAClC,KAAMhG,EAAK,OACX,OAAQ,KAAK,IAAIyB,EAAU,QAASwE,EAAMxE,EAAU,OAAO,CACjE,CAAK,CACF,CAKD,iBAAiBuE,EAAS,CACxB,MAAM1G,EAAQ,KAAK,OAAO,MACpB9N,EAAO,KAAK,YAClB,YAAK,YAAYiQ,EAAU,KAAK,EACzB,KAAK,KAAKnC,EAAO,CACtB,KAAMU,EAAK,aACX,KAAAxO,EACA,MAAO,KAAK,kBAAkBwU,CAAO,CAC3C,CAAK,CACF,CAMD,gBAAgBA,EAAS,CACvB,MAAMI,EAAa,CAAA,EAEnB,KAAO,KAAK,KAAK3E,EAAU,EAAE,GAC3B2E,EAAW,KAAK,KAAK,eAAeJ,CAAO,CAAC,EAG9C,OAAOI,CACR,CAED,sBAAuB,CACrB,OAAO,KAAK,gBAAgB,EAAI,CACjC,CAOD,eAAeJ,EAAS,CACtB,MAAM1G,EAAQ,KAAK,OAAO,MAC1B,YAAK,YAAYmC,EAAU,EAAE,EACtB,KAAK,KAAKnC,EAAO,CACtB,KAAMU,EAAK,UACX,KAAM,KAAK,UAAW,EACtB,UAAW,KAAK,eAAegG,CAAO,CAC5C,CAAK,CACF,CASD,oBAAqB,CACnB,MAAM1G,EAAQ,KAAK,OAAO,MAC1B,IAAIpT,EAEJ,GAAI,KAAK,oBAAoBuV,EAAU,SAAS,EAAG,CACjD,MAAM4E,EAAY,KAAK,qBACvB,KAAK,YAAY5E,EAAU,SAAS,EACpCvV,EAAO,KAAK,KAAKoT,EAAO,CACtB,KAAMU,EAAK,UACX,KAAMqG,CACd,CAAO,CACP,MACMna,EAAO,KAAK,iBAGd,OAAI,KAAK,oBAAoBuV,EAAU,IAAI,EAClC,KAAK,KAAKnC,EAAO,CACtB,KAAMU,EAAK,cACX,KAAA9T,CACR,CAAO,EAGIA,CACR,CAKD,gBAAiB,CACf,OAAO,KAAK,KAAK,KAAK,OAAO,MAAO,CAClC,KAAM8T,EAAK,WACX,KAAM,KAAK,UAAW,CAC5B,CAAK,CACF,CAED,iBAAkB,CAChB,OAAO,KAAK,KAAKyB,EAAU,MAAM,GAAK,KAAK,KAAKA,EAAU,YAAY,CACvE,CAKD,kBAAmB,CACjB,GAAI,KAAK,kBACP,OAAO,KAAK,oBAEf,CAOD,uBAAwB,CACtB,MAAMnC,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,mBACzB,KAAK,cAAc,QAAQ,EAC3B,MAAMoH,EAAa,KAAK,uBAClBE,EAAiB,KAAK,KAC1B7E,EAAU,QACV,KAAK,6BACLA,EAAU,OAChB,EACI,OAAO,KAAK,KAAKnC,EAAO,CACtB,KAAMU,EAAK,kBACX,YAAAhB,EACA,WAAAoH,EACA,eAAAE,CACN,CAAK,CACF,CAKD,8BAA+B,CAC7B,MAAMhH,EAAQ,KAAK,OAAO,MACpBsG,EAAY,KAAK,qBACvB,KAAK,YAAYnE,EAAU,KAAK,EAChC,MAAMvV,EAAO,KAAK,iBAClB,OAAO,KAAK,KAAKoT,EAAO,CACtB,KAAMU,EAAK,0BACX,UAAA4F,EACA,KAAA1Z,CACN,CAAK,CACF,CAKD,2BAA4B,CAC1B,MAAMoT,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,mBACzB,KAAK,cAAc,QAAQ,EAC3B,MAAMxN,EAAO,KAAK,YACZ4U,EAAa,KAAK,uBACxB,OAAO,KAAK,KAAK9G,EAAO,CACtB,KAAMU,EAAK,uBACX,YAAAhB,EACA,KAAAxN,EACA,WAAA4U,CACN,CAAK,CACF,CAOD,2BAA4B,CAC1B,MAAM9G,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,mBACzB,KAAK,cAAc,MAAM,EACzB,MAAMxN,EAAO,KAAK,YACZ+U,EAAa,KAAK,4BAClBH,EAAa,KAAK,uBAClBI,EAAS,KAAK,wBACpB,OAAO,KAAK,KAAKlH,EAAO,CACtB,KAAMU,EAAK,uBACX,YAAAhB,EACA,KAAAxN,EACA,WAAA+U,EACA,WAAAH,EACA,OAAAI,CACN,CAAK,CACF,CAOD,2BAA4B,CAC1B,OAAO,KAAK,sBAAsB,YAAY,EAC1C,KAAK,cAAc/E,EAAU,IAAK,KAAK,cAAc,EACrD,EACL,CAOD,uBAAwB,CACtB,OAAO,KAAK,aACVA,EAAU,QACV,KAAK,qBACLA,EAAU,OAChB,CACG,CAMD,sBAAuB,CACrB,MAAMnC,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,mBACnBxN,EAAO,KAAK,YACZrN,EAAO,KAAK,oBAClB,KAAK,YAAYsd,EAAU,KAAK,EAChC,MAAMvV,EAAO,KAAK,qBACZka,EAAa,KAAK,uBACxB,OAAO,KAAK,KAAK9G,EAAO,CACtB,KAAMU,EAAK,iBACX,YAAAhB,EACA,KAAAxN,EACA,UAAWrN,EACX,KAAA+H,EACA,WAAAka,CACN,CAAK,CACF,CAKD,mBAAoB,CAClB,OAAO,KAAK,aACV3E,EAAU,QACV,KAAK,mBACLA,EAAU,OAChB,CACG,CAMD,oBAAqB,CACnB,MAAMnC,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,mBACnBxN,EAAO,KAAK,YAClB,KAAK,YAAYiQ,EAAU,KAAK,EAChC,MAAMvV,EAAO,KAAK,qBAClB,IAAIua,EAEA,KAAK,oBAAoBhF,EAAU,MAAM,IAC3CgF,EAAe,KAAK,0BAGtB,MAAML,EAAa,KAAK,uBACxB,OAAO,KAAK,KAAK9G,EAAO,CACtB,KAAMU,EAAK,uBACX,YAAAhB,EACA,KAAAxN,EACA,KAAAtF,EACA,aAAAua,EACA,WAAAL,CACN,CAAK,CACF,CAMD,8BAA+B,CAC7B,MAAM9G,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,mBACzB,KAAK,cAAc,WAAW,EAC9B,MAAMxN,EAAO,KAAK,YACZ+U,EAAa,KAAK,4BAClBH,EAAa,KAAK,uBAClBI,EAAS,KAAK,wBACpB,OAAO,KAAK,KAAKlH,EAAO,CACtB,KAAMU,EAAK,0BACX,YAAAhB,EACA,KAAAxN,EACA,WAAA+U,EACA,WAAAH,EACA,OAAAI,CACN,CAAK,CACF,CAMD,0BAA2B,CACzB,MAAMlH,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,mBACzB,KAAK,cAAc,OAAO,EAC1B,MAAMxN,EAAO,KAAK,YACZ4U,EAAa,KAAK,uBAClBM,EAAQ,KAAK,wBACnB,OAAO,KAAK,KAAKpH,EAAO,CACtB,KAAMU,EAAK,sBACX,YAAAhB,EACA,KAAAxN,EACA,WAAA4U,EACA,MAAAM,CACN,CAAK,CACF,CAOD,uBAAwB,CACtB,OAAO,KAAK,oBAAoBjF,EAAU,MAAM,EAC5C,KAAK,cAAcA,EAAU,KAAM,KAAK,cAAc,EACtD,EACL,CAMD,yBAA0B,CACxB,MAAMnC,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,mBACzB,KAAK,cAAc,MAAM,EACzB,MAAMxN,EAAO,KAAK,YACZ4U,EAAa,KAAK,uBAClBO,EAAS,KAAK,4BACpB,OAAO,KAAK,KAAKrH,EAAO,CACtB,KAAMU,EAAK,qBACX,YAAAhB,EACA,KAAAxN,EACA,WAAA4U,EACA,OAAAO,CACN,CAAK,CACF,CAOD,2BAA4B,CAC1B,OAAO,KAAK,aACVlF,EAAU,QACV,KAAK,yBACLA,EAAU,OAChB,CACG,CAKD,0BAA2B,CACzB,MAAMnC,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,mBACnBxN,EAAO,KAAK,qBACZ4U,EAAa,KAAK,uBACxB,OAAO,KAAK,KAAK9G,EAAO,CACtB,KAAMU,EAAK,sBACX,YAAAhB,EACA,KAAAxN,EACA,WAAA4U,CACN,CAAK,CACF,CAKD,oBAAqB,CACnB,GACE,KAAK,OAAO,MAAM,QAAU,QAC5B,KAAK,OAAO,MAAM,QAAU,SAC5B,KAAK,OAAO,MAAM,QAAU,OAE5B,MAAMrH,EACJ,KAAK,OAAO,OACZ,KAAK,OAAO,MAAM,MAClB,GAAG6H,GACD,KAAK,OAAO,KACb,CAAA,oDACT,EAGI,OAAO,KAAK,WACb,CAMD,gCAAiC,CAC/B,MAAMtH,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,mBACzB,KAAK,cAAc,OAAO,EAC1B,MAAMxN,EAAO,KAAK,YACZ4U,EAAa,KAAK,uBAClBI,EAAS,KAAK,6BACpB,OAAO,KAAK,KAAKlH,EAAO,CACtB,KAAMU,EAAK,6BACX,YAAAhB,EACA,KAAAxN,EACA,WAAA4U,EACA,OAAAI,CACN,CAAK,CACF,CAOD,4BAA6B,CAC3B,OAAO,KAAK,aACV/E,EAAU,QACV,KAAK,mBACLA,EAAU,OAChB,CACG,CAeD,0BAA2B,CACzB,MAAMkE,EAAe,KAAK,OAAO,UAAS,EAE1C,GAAIA,EAAa,OAASlE,EAAU,KAClC,OAAQkE,EAAa,MAAK,CACxB,IAAK,SACH,OAAO,KAAK,uBAEd,IAAK,SACH,OAAO,KAAK,2BAEd,IAAK,OACH,OAAO,KAAK,2BAEd,IAAK,YACH,OAAO,KAAK,8BAEd,IAAK,QACH,OAAO,KAAK,0BAEd,IAAK,OACH,OAAO,KAAK,yBAEd,IAAK,QACH,OAAO,KAAK,+BACf,CAGH,MAAM,KAAK,WAAWA,CAAY,CACnC,CASD,sBAAuB,CACrB,MAAMrG,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,QAAQ,EAC3B,MAAM8G,EAAa,KAAK,uBAClBE,EAAiB,KAAK,aAC1B7E,EAAU,QACV,KAAK,6BACLA,EAAU,OAChB,EAEI,GAAI2E,EAAW,SAAW,GAAKE,EAAe,SAAW,EACvD,MAAM,KAAK,aAGb,OAAO,KAAK,KAAKhH,EAAO,CACtB,KAAMU,EAAK,iBACX,WAAAoG,EACA,eAAAE,CACN,CAAK,CACF,CAMD,0BAA2B,CACzB,MAAMhH,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,QAAQ,EAC3B,MAAM9N,EAAO,KAAK,YACZ4U,EAAa,KAAK,uBAExB,GAAIA,EAAW,SAAW,EACxB,MAAM,KAAK,aAGb,OAAO,KAAK,KAAK9G,EAAO,CACtB,KAAMU,EAAK,sBACX,KAAAxO,EACA,WAAA4U,CACN,CAAK,CACF,CAQD,0BAA2B,CACzB,MAAM9G,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,MAAM,EACzB,MAAM9N,EAAO,KAAK,YACZ+U,EAAa,KAAK,4BAClBH,EAAa,KAAK,uBAClBI,EAAS,KAAK,wBAEpB,GACED,EAAW,SAAW,GACtBH,EAAW,SAAW,GACtBI,EAAO,SAAW,EAElB,MAAM,KAAK,aAGb,OAAO,KAAK,KAAKlH,EAAO,CACtB,KAAMU,EAAK,sBACX,KAAAxO,EACA,WAAA+U,EACA,WAAAH,EACA,OAAAI,CACN,CAAK,CACF,CAQD,6BAA8B,CAC5B,MAAMlH,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,WAAW,EAC9B,MAAM9N,EAAO,KAAK,YACZ+U,EAAa,KAAK,4BAClBH,EAAa,KAAK,uBAClBI,EAAS,KAAK,wBAEpB,GACED,EAAW,SAAW,GACtBH,EAAW,SAAW,GACtBI,EAAO,SAAW,EAElB,MAAM,KAAK,aAGb,OAAO,KAAK,KAAKlH,EAAO,CACtB,KAAMU,EAAK,yBACX,KAAAxO,EACA,WAAA+U,EACA,WAAAH,EACA,OAAAI,CACN,CAAK,CACF,CAOD,yBAA0B,CACxB,MAAMlH,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,OAAO,EAC1B,MAAM9N,EAAO,KAAK,YACZ4U,EAAa,KAAK,uBAClBM,EAAQ,KAAK,wBAEnB,GAAIN,EAAW,SAAW,GAAKM,EAAM,SAAW,EAC9C,MAAM,KAAK,aAGb,OAAO,KAAK,KAAKpH,EAAO,CACtB,KAAMU,EAAK,qBACX,KAAAxO,EACA,WAAA4U,EACA,MAAAM,CACN,CAAK,CACF,CAOD,wBAAyB,CACvB,MAAMpH,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,MAAM,EACzB,MAAM9N,EAAO,KAAK,YACZ4U,EAAa,KAAK,uBAClBO,EAAS,KAAK,4BAEpB,GAAIP,EAAW,SAAW,GAAKO,EAAO,SAAW,EAC/C,MAAM,KAAK,aAGb,OAAO,KAAK,KAAKrH,EAAO,CACtB,KAAMU,EAAK,oBACX,KAAAxO,EACA,WAAA4U,EACA,OAAAO,CACN,CAAK,CACF,CAOD,+BAAgC,CAC9B,MAAMrH,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,OAAO,EAC1B,MAAM9N,EAAO,KAAK,YACZ4U,EAAa,KAAK,uBAClBI,EAAS,KAAK,6BAEpB,GAAIJ,EAAW,SAAW,GAAKI,EAAO,SAAW,EAC/C,MAAM,KAAK,aAGb,OAAO,KAAK,KAAKlH,EAAO,CACtB,KAAMU,EAAK,4BACX,KAAAxO,EACA,WAAA4U,EACA,OAAAI,CACN,CAAK,CACF,CAQD,0BAA2B,CACzB,MAAMlH,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,mBACzB,KAAK,cAAc,WAAW,EAC9B,KAAK,YAAYyC,EAAU,EAAE,EAC7B,MAAMjQ,EAAO,KAAK,YACZrN,EAAO,KAAK,oBACZ0iB,EAAa,KAAK,sBAAsB,YAAY,EAC1D,KAAK,cAAc,IAAI,EACvB,MAAMC,EAAY,KAAK,0BACvB,OAAO,KAAK,KAAKxH,EAAO,CACtB,KAAMU,EAAK,qBACX,YAAAhB,EACA,KAAAxN,EACA,UAAWrN,EACX,WAAA0iB,EACA,UAAAC,CACN,CAAK,CACF,CAOD,yBAA0B,CACxB,OAAO,KAAK,cAAcrF,EAAU,KAAM,KAAK,sBAAsB,CACtE,CA6BD,wBAAyB,CACvB,MAAMnC,EAAQ,KAAK,OAAO,MACpB9N,EAAO,KAAK,YAElB,GAAI,OAAO,UAAU,eAAe,KAAKuO,GAAmBvO,EAAK,KAAK,EACpE,OAAOA,EAGT,MAAM,KAAK,WAAW8N,CAAK,CAC5B,CAQD,KAAKJ,EAAYV,EAAM,CACrB,OAAI,KAAK,SAAS,aAAe,KAC/BA,EAAK,IAAM,IAAIS,GACbC,EACA,KAAK,OAAO,UACZ,KAAK,OAAO,MACpB,GAGWV,CACR,CAKD,KAAKa,EAAM,CACT,OAAO,KAAK,OAAO,MAAM,OAASA,CACnC,CAMD,YAAYA,EAAM,CAChB,MAAM3I,EAAQ,KAAK,OAAO,MAE1B,GAAIA,EAAM,OAAS2I,EACjB,YAAK,aAAY,EACV3I,EAGT,MAAMqI,EACJ,KAAK,OAAO,OACZrI,EAAM,MACN,YAAYqQ,GAAiB1H,CAAI,CAAC,WAAWuH,GAAalQ,CAAK,CAAC,GACtE,CACG,CAMD,oBAAoB2I,EAAM,CAGxB,OAFc,KAAK,OAAO,MAEhB,OAASA,GACjB,KAAK,aAAY,EACV,IAGF,EACR,CAMD,cAAcla,EAAO,CACnB,MAAMuR,EAAQ,KAAK,OAAO,MAE1B,GAAIA,EAAM,OAAS+K,EAAU,MAAQ/K,EAAM,QAAUvR,EACnD,KAAK,aAAY,MAEjB,OAAM4Z,EACJ,KAAK,OAAO,OACZrI,EAAM,MACN,aAAavR,CAAK,YAAYyhB,GAAalQ,CAAK,CAAC,GACzD,CAEG,CAMD,sBAAsBvR,EAAO,CAC3B,MAAMuR,EAAQ,KAAK,OAAO,MAE1B,OAAIA,EAAM,OAAS+K,EAAU,MAAQ/K,EAAM,QAAUvR,GACnD,KAAK,aAAY,EACV,IAGF,EACR,CAKD,WAAW6hB,EAAS,CAClB,MAAMtQ,EACJsQ,GAAmD,KAAK,OAAO,MACjE,OAAOjI,EACL,KAAK,OAAO,OACZrI,EAAM,MACN,cAAckQ,GAAalQ,CAAK,CAAC,GACvC,CACG,CAOD,IAAIuQ,EAAUC,EAASC,EAAW,CAChC,KAAK,YAAYF,CAAQ,EACzB,MAAM/I,EAAQ,CAAA,EAEd,KAAO,CAAC,KAAK,oBAAoBiJ,CAAS,GACxCjJ,EAAM,KAAKgJ,EAAQ,KAAK,IAAI,CAAC,EAG/B,OAAOhJ,CACR,CAQD,aAAa+I,EAAUC,EAASC,EAAW,CACzC,GAAI,KAAK,oBAAoBF,CAAQ,EAAG,CACtC,MAAM/I,EAAQ,CAAA,EAEd,GACEA,EAAM,KAAKgJ,EAAQ,KAAK,IAAI,CAAC,QACtB,CAAC,KAAK,oBAAoBC,CAAS,GAE5C,OAAOjJ,CACR,CAED,MAAO,EACR,CAOD,KAAK+I,EAAUC,EAASC,EAAW,CACjC,KAAK,YAAYF,CAAQ,EACzB,MAAM/I,EAAQ,CAAA,EAEd,GACEA,EAAM,KAAKgJ,EAAQ,KAAK,IAAI,CAAC,QACtB,CAAC,KAAK,oBAAoBC,CAAS,GAE5C,OAAOjJ,CACR,CAOD,cAAckJ,EAAeF,EAAS,CACpC,KAAK,oBAAoBE,CAAa,EACtC,MAAMlJ,EAAQ,CAAA,EAEd,GACEA,EAAM,KAAKgJ,EAAQ,KAAK,IAAI,CAAC,QACtB,KAAK,oBAAoBE,CAAa,GAE/C,OAAOlJ,CACR,CAED,cAAe,CACb,KAAM,CAAE,UAAAmJ,CAAS,EAAK,KAAK,SAErB3Q,EAAQ,KAAK,OAAO,QAAO,EAEjC,GAAI2Q,IAAc,QAAa3Q,EAAM,OAAS+K,EAAU,MACtD,EAAE,KAAK,cAEH,KAAK,cAAgB4F,GACvB,MAAMtI,EACJ,KAAK,OAAO,OACZrI,EAAM,MACN,+BAA+B2Q,CAAS,2BAClD,CAGG,CACH,CAKA,SAAST,GAAalQ,EAAO,CAC3B,MAAMvR,EAAQuR,EAAM,MACpB,OAAOqQ,GAAiBrQ,EAAM,IAAI,GAAKvR,GAAS,KAAO,KAAKA,CAAK,IAAM,GACzE,CAKA,SAAS4hB,GAAiB1H,EAAM,CAC9B,OAAOyC,GAAsBzC,CAAI,EAAI,IAAIA,CAAI,IAAMA,CACrD,CC/+CO,SAASiI,GAAYxG,EAAK,CAC/B,MAAO,IAAIA,EAAI,QAAQyG,GAAeC,EAAe,CAAC,GACxD,CAEA,MAAMD,GAAgB,gCAEtB,SAASC,GAAgB1G,EAAK,CAC5B,OAAO2G,GAAgB3G,EAAI,WAAW,CAAC,CAAC,CAC1C,CAEA,MAAM2G,GAAkB,CACtB,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,MACA,MACA,MACA,UACA,MACA,MACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,GACA,GACA,MACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,OACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,SACF,ECtKaC,GAAQ,OAAO,OAAO,EAAE,EAgF9B,SAASC,GAAMC,EAAMC,EAASC,EAAcrI,GAAmB,CACpE,MAAMsI,EAAgB,IAAI,IAE1B,UAAW1I,KAAQ,OAAO,OAAOW,CAAI,EACnC+H,EAAc,IAAI1I,EAAM2I,GAAqBH,EAASxI,CAAI,CAAC,EAI7D,IAAI4I,EACAC,EAAU,MAAM,QAAQN,CAAI,EAC5B7gB,EAAO,CAAC6gB,CAAI,EACZ9hB,EAAQ,GACRqiB,EAAQ,CAAA,EACR3J,EAAOoJ,EACP1lB,EACAsH,EACJ,MAAMX,EAAO,CAAA,EACPuf,EAAY,CAAA,EAGlB,EAAG,CACDtiB,IACA,MAAMuiB,EAAYviB,IAAUiB,EAAK,OAC3BuhB,EAAWD,GAAaF,EAAM,SAAW,EAE/C,GAAIE,EAAW,CAKb,GAJAnmB,EAAMkmB,EAAU,SAAW,EAAI,OAAYvf,EAAKA,EAAK,OAAS,CAAC,EAC/D2V,EAAOhV,EACPA,EAAS4e,EAAU,MAEfE,EACF,GAAIJ,EAAS,CACX1J,EAAOA,EAAK,QACZ,IAAI+J,EAAa,EAEjB,SAAW,CAACC,EAASC,CAAS,IAAKN,EAAO,CACxC,MAAMO,EAAWF,EAAUD,EAEvBE,IAAc,MAChBjK,EAAK,OAAOkK,EAAU,CAAC,EACvBH,KAEA/J,EAAKkK,CAAQ,EAAID,CAEpB,CACX,KAAe,CACLjK,EAAO,OAAO,iBACZ,CAAE,EACF,OAAO,0BAA0BA,CAAI,CACjD,EAEU,SAAW,CAACgK,EAASC,CAAS,IAAKN,EACjC3J,EAAKgK,CAAO,EAAIC,CAEnB,CAGH3iB,EAAQmiB,EAAM,MACdlhB,EAAOkhB,EAAM,KACbE,EAAQF,EAAM,MACdC,EAAUD,EAAM,QAChBA,EAAQA,EAAM,IACf,SAAUze,EAAQ,CAIjB,GAHAtH,EAAMgmB,EAAUpiB,EAAQiB,EAAKjB,CAAK,EAClC0Y,EAAOhV,EAAOtH,CAAG,EAEbsc,GAAS,KACX,SAGF3V,EAAK,KAAK3G,CAAG,CACd,CAED,IAAIsG,EAEJ,GAAI,CAAC,MAAM,QAAQgW,CAAI,EAAG,CACxB,IAAImK,EAAoBC,EAExBjJ,GAAOnB,CAAI,GAAKzC,GAAU,GAAO,qBAAqBgI,GAAQvF,CAAI,CAAC,GAAG,EACtE,MAAMqK,EAAUR,GACXM,EAAqBZ,EAAc,IAAIvJ,EAAK,IAAI,KAAO,MACxDmK,IAAuB,OACrB,OACAA,EAAmB,OACpBC,EAAsBb,EAAc,IAAIvJ,EAAK,IAAI,KAAO,MACzDoK,IAAwB,OACxB,OACAA,EAAoB,MAMxB,GALApgB,EACEqgB,GAAY,KACR,OACAA,EAAQ,KAAKhB,EAASrJ,EAAMtc,EAAKsH,EAAQX,EAAMuf,CAAS,EAE1D5f,IAAWkf,GACb,MAGF,GAAIlf,IAAW,IACb,GAAI,CAAC6f,EAAW,CACdxf,EAAK,IAAG,EACR,QACD,UACQL,IAAW,SACpB2f,EAAM,KAAK,CAACjmB,EAAKsG,CAAM,CAAC,EAEpB,CAAC6f,GACH,GAAI1I,GAAOnX,CAAM,EACfgW,EAAOhW,MACF,CACLK,EAAK,IAAG,EACR,QACD,CAGN,CAMD,GAJIL,IAAW,QAAa8f,GAC1BH,EAAM,KAAK,CAACjmB,EAAKsc,CAAI,CAAC,EAGpB6J,EACFxf,EAAK,IAAG,MACH,CACL,IAAIigB,EAEJb,EAAQ,CACN,QAAAC,EACA,MAAApiB,EACA,KAAAiB,EACA,MAAAohB,EACA,KAAMF,CACd,EACMC,EAAU,MAAM,QAAQ1J,CAAI,EAC5BzX,EAAOmhB,EACH1J,GACCsK,EAAahB,EAAYtJ,EAAK,IAAI,KAAO,MAC1CsK,IAAe,OACfA,EACA,GACJhjB,EAAQ,GACRqiB,EAAQ,CAAA,EAEJ3e,GACF4e,EAAU,KAAK5e,CAAM,EAGvBA,EAASgV,CACV,CACL,OAAWyJ,IAAU,QAEnB,OAAIE,EAAM,SAAW,EAEZA,EAAMA,EAAM,OAAS,CAAC,EAAE,CAAC,EAG3BP,CACT,CAoFO,SAASI,GAAqBH,EAASxI,EAAM,CAClD,MAAM0J,EAAclB,EAAQxI,CAAI,EAEhC,OAAI,OAAO0J,GAAgB,SAElBA,EACE,OAAOA,GAAgB,WAEzB,CACL,MAAOA,EACP,MAAO,MACb,EAGS,CACL,MAAOlB,EAAQ,MACf,MAAOA,EAAQ,KACnB,CACA,CCnVO,SAASmB,GAAMC,EAAK,CACzB,OAAOtB,GAAMsB,EAAKC,EAAkB,CACtC,CACA,MAAMC,GAAkB,GAClBD,GAAqB,CACzB,KAAM,CACJ,MAAQ1K,GAASA,EAAK,KACvB,EACD,SAAU,CACR,MAAQA,GAAS,IAAMA,EAAK,IAC7B,EAED,SAAU,CACR,MAAQA,GAAS4K,EAAK5K,EAAK,YAAa;AAAA;AAAA,CAAM,CAC/C,EACD,oBAAqB,CACnB,MAAMA,EAAM,CACV,MAAM6K,EAAUlO,EAAK,IAAKiO,EAAK5K,EAAK,oBAAqB,IAAI,EAAG,GAAG,EAC7D1D,EAASsO,EACb,CACE5K,EAAK,UACL4K,EAAK,CAAC5K,EAAK,KAAM6K,CAAO,CAAC,EACzBD,EAAK5K,EAAK,WAAY,GAAG,CAC1B,EACD,GACR,EAGM,OAAQ1D,IAAW,QAAU,GAAKA,EAAS,KAAO0D,EAAK,YACxD,CACF,EACD,mBAAoB,CAClB,MAAO,CAAC,CAAE,SAAA8K,EAAU,KAAApd,EAAM,aAAAua,EAAc,WAAAL,CAAY,IAClDkD,EACA,KACApd,EACAiP,EAAK,MAAOsL,CAAY,EACxBtL,EAAK,IAAKiO,EAAKhD,EAAY,GAAG,CAAC,CAClC,EACD,aAAc,CACZ,MAAO,CAAC,CAAE,WAAAmD,KAAiBC,GAAMD,CAAU,CAC5C,EACD,MAAO,CACL,MAAM,CAAE,MAAAxD,EAAO,KAAAvU,EAAM,UAAWrN,EAAM,WAAAiiB,EAAY,aAAAqD,GAAgB,CAChE,MAAM3O,EAASK,EAAK,GAAI4K,EAAO,IAAI,EAAIvU,EACvC,IAAIkY,EAAW5O,EAASK,EAAK,IAAKiO,EAAKjlB,EAAM,IAAI,EAAG,GAAG,EAEvD,OAAIulB,EAAS,OAASP,KACpBO,EAAW5O,EAASK,EAAK;AAAA,EAAOyF,GAAOwI,EAAKjlB,EAAM;AAAA,CAAI,CAAC,EAAG;AAAA,EAAK,GAG1DilB,EAAK,CAACM,EAAUN,EAAKhD,EAAY,GAAG,EAAGqD,CAAY,EAAG,GAAG,CACjE,CACF,EACD,SAAU,CACR,MAAO,CAAC,CAAE,KAAAjY,EAAM,MAAArM,CAAK,IAAOqM,EAAO,KAAOrM,CAC3C,EAED,eAAgB,CACd,MAAO,CAAC,CAAE,KAAAqM,EAAM,WAAA4U,CAAY,IAC1B,MAAQ5U,EAAO2J,EAAK,IAAKiO,EAAKhD,EAAY,GAAG,CAAC,CACjD,EACD,eAAgB,CACd,MAAO,CAAC,CAAE,cAAAuD,EAAe,WAAAvD,EAAY,aAAAqD,CAAc,IACjDL,EACE,CACE,MACAjO,EAAK,MAAOwO,CAAa,EACzBP,EAAKhD,EAAY,GAAG,EACpBqD,CACD,EACD,GACD,CACJ,EACD,mBAAoB,CAClB,MAAO,CACL,CAAE,KAAAjY,EAAM,cAAAmY,EAAe,oBAAAC,EAAqB,WAAAxD,EAAY,aAAAqD,CAAc,IAGtE,YAAYjY,CAAI,GAAG2J,EAAK,IAAKiO,EAAKQ,EAAqB,IAAI,EAAG,GAAG,CAAC,OAC5DD,CAAa,IAAIxO,EAAK,GAAIiO,EAAKhD,EAAY,GAAG,EAAG,GAAG,CAAC,GAC3DqD,CACH,EAED,SAAU,CACR,MAAO,CAAC,CAAE,MAAAtkB,CAAK,IAAOA,CACvB,EACD,WAAY,CACV,MAAO,CAAC,CAAE,MAAAA,CAAK,IAAOA,CACvB,EACD,YAAa,CACX,MAAO,CAAC,CAAE,MAAAA,EAAO,MAAO0kB,CAAe,IACrCA,EAAgB9I,GAAiB5b,CAAK,EAAImiB,GAAYniB,CAAK,CAC9D,EACD,aAAc,CACZ,MAAO,CAAC,CAAE,MAAAA,CAAK,IAAQA,EAAQ,OAAS,OACzC,EACD,UAAW,CACT,MAAO,IAAM,MACd,EACD,UAAW,CACT,MAAO,CAAC,CAAE,MAAAA,CAAK,IAAOA,CACvB,EACD,UAAW,CACT,MAAO,CAAC,CAAE,OAAAwhB,KAAa,IAAMyC,EAAKzC,EAAQ,IAAI,EAAI,GACnD,EACD,YAAa,CACX,MAAO,CAAC,CAAE,OAAAH,KAAa,IAAM4C,EAAK5C,EAAQ,IAAI,EAAI,GACnD,EACD,YAAa,CACX,MAAO,CAAC,CAAE,KAAAhV,EAAM,MAAArM,CAAK,IAAOqM,EAAO,KAAOrM,CAC3C,EAED,UAAW,CACT,MAAO,CAAC,CAAE,KAAAqM,EAAM,UAAWrN,CAAM,IAC/B,IAAMqN,EAAO2J,EAAK,IAAKiO,EAAKjlB,EAAM,IAAI,EAAG,GAAG,CAC/C,EAED,UAAW,CACT,MAAO,CAAC,CAAE,KAAAqN,CAAI,IAAOA,CACtB,EACD,SAAU,CACR,MAAO,CAAC,CAAE,KAAAtF,CAAM,IAAK,IAAMA,EAAO,GACnC,EACD,YAAa,CACX,MAAO,CAAC,CAAE,KAAAA,CAAM,IAAKA,EAAO,GAC7B,EAED,iBAAkB,CAChB,MAAO,CAAC,CAAE,YAAA8S,EAAa,WAAAoH,EAAY,eAAAE,CAAgB,IACjDnL,EAAK,GAAI6D,EAAa;AAAA,CAAI,EAC1BoK,EAAK,CAAC,SAAUA,EAAKhD,EAAY,GAAG,EAAGoD,GAAMlD,CAAc,CAAC,EAAG,GAAG,CACrE,EACD,wBAAyB,CACvB,MAAO,CAAC,CAAE,UAAAV,EAAW,KAAA1Z,CAAI,IAAO0Z,EAAY,KAAO1Z,CACpD,EACD,qBAAsB,CACpB,MAAO,CAAC,CAAE,YAAA8S,EAAa,KAAAxN,EAAM,WAAA4U,CAAY,IACvCjL,EAAK,GAAI6D,EAAa;AAAA,CAAI,EAC1BoK,EAAK,CAAC,SAAU5X,EAAM4X,EAAKhD,EAAY,GAAG,CAAC,EAAG,GAAG,CACpD,EACD,qBAAsB,CACpB,MAAO,CAAC,CAAE,YAAApH,EAAa,KAAAxN,EAAM,WAAA+U,EAAY,WAAAH,EAAY,OAAAI,CAAQ,IAC3DrL,EAAK,GAAI6D,EAAa;AAAA,CAAI,EAC1BoK,EACE,CACE,OACA5X,EACA2J,EAAK,cAAeiO,EAAK7C,EAAY,KAAK,CAAC,EAC3C6C,EAAKhD,EAAY,GAAG,EACpBoD,GAAMhD,CAAM,CACb,EACD,GACD,CACJ,EACD,gBAAiB,CACf,MAAO,CAAC,CAAE,YAAAxH,EAAa,KAAAxN,EAAM,UAAWrN,EAAM,KAAA+H,EAAM,WAAAka,CAAY,IAC9DjL,EAAK,GAAI6D,EAAa;AAAA,CAAI,EAC1BxN,GACCsY,GAAkB3lB,CAAI,EACnBgX,EAAK;AAAA,EAAOyF,GAAOwI,EAAKjlB,EAAM;AAAA,CAAI,CAAC,EAAG;AAAA,EAAK,EAC3CgX,EAAK,IAAKiO,EAAKjlB,EAAM,IAAI,EAAG,GAAG,GACnC,KACA+H,EACAiP,EAAK,IAAKiO,EAAKhD,EAAY,GAAG,CAAC,CAClC,EACD,qBAAsB,CACpB,MAAO,CAAC,CAAE,YAAApH,EAAa,KAAAxN,EAAM,KAAAtF,EAAM,aAAAua,EAAc,WAAAL,CAAY,IAC3DjL,EAAK,GAAI6D,EAAa;AAAA,CAAI,EAC1BoK,EACE,CAAC5X,EAAO,KAAOtF,EAAMiP,EAAK,KAAMsL,CAAY,EAAG2C,EAAKhD,EAAY,GAAG,CAAC,EACpE,GACD,CACJ,EACD,wBAAyB,CACvB,MAAO,CAAC,CAAE,YAAApH,EAAa,KAAAxN,EAAM,WAAA+U,EAAY,WAAAH,EAAY,OAAAI,CAAQ,IAC3DrL,EAAK,GAAI6D,EAAa;AAAA,CAAI,EAC1BoK,EACE,CACE,YACA5X,EACA2J,EAAK,cAAeiO,EAAK7C,EAAY,KAAK,CAAC,EAC3C6C,EAAKhD,EAAY,GAAG,EACpBoD,GAAMhD,CAAM,CACb,EACD,GACD,CACJ,EACD,oBAAqB,CACnB,MAAO,CAAC,CAAE,YAAAxH,EAAa,KAAAxN,EAAM,WAAA4U,EAAY,MAAAM,CAAO,IAC9CvL,EAAK,GAAI6D,EAAa;AAAA,CAAI,EAC1BoK,EACE,CAAC,QAAS5X,EAAM4X,EAAKhD,EAAY,GAAG,EAAGjL,EAAK,KAAMiO,EAAK1C,EAAO,KAAK,CAAC,CAAC,EACrE,GACD,CACJ,EACD,mBAAoB,CAClB,MAAO,CAAC,CAAE,YAAA1H,EAAa,KAAAxN,EAAM,WAAA4U,EAAY,OAAAO,CAAQ,IAC/CxL,EAAK,GAAI6D,EAAa;AAAA,CAAI,EAC1BoK,EAAK,CAAC,OAAQ5X,EAAM4X,EAAKhD,EAAY,GAAG,EAAGoD,GAAM7C,CAAM,CAAC,EAAG,GAAG,CACjE,EACD,oBAAqB,CACnB,MAAO,CAAC,CAAE,YAAA3H,EAAa,KAAAxN,EAAM,WAAA4U,CAAY,IACvCjL,EAAK,GAAI6D,EAAa;AAAA,CAAI,EAAIoK,EAAK,CAAC5X,EAAM4X,EAAKhD,EAAY,GAAG,CAAC,EAAG,GAAG,CACxE,EACD,0BAA2B,CACzB,MAAO,CAAC,CAAE,YAAApH,EAAa,KAAAxN,EAAM,WAAA4U,EAAY,OAAAI,CAAQ,IAC/CrL,EAAK,GAAI6D,EAAa;AAAA,CAAI,EAC1BoK,EAAK,CAAC,QAAS5X,EAAM4X,EAAKhD,EAAY,GAAG,EAAGoD,GAAMhD,CAAM,CAAC,EAAG,GAAG,CAClE,EACD,oBAAqB,CACnB,MAAO,CAAC,CAAE,YAAAxH,EAAa,KAAAxN,EAAM,UAAWrN,EAAM,WAAA0iB,EAAY,UAAAC,CAAW,IACnE3L,EAAK,GAAI6D,EAAa;AAAA,CAAI,EAC1B,cACAxN,GACCsY,GAAkB3lB,CAAI,EACnBgX,EAAK;AAAA,EAAOyF,GAAOwI,EAAKjlB,EAAM;AAAA,CAAI,CAAC,EAAG;AAAA,EAAK,EAC3CgX,EAAK,IAAKiO,EAAKjlB,EAAM,IAAI,EAAG,GAAG,IAClC0iB,EAAa,cAAgB,IAC9B,OACAuC,EAAKtC,EAAW,KAAK,CACxB,EACD,gBAAiB,CACf,MAAO,CAAC,CAAE,WAAAV,EAAY,eAAAE,CAAgB,IACpC8C,EACE,CAAC,gBAAiBA,EAAKhD,EAAY,GAAG,EAAGoD,GAAMlD,CAAc,CAAC,EAC9D,GACD,CACJ,EACD,oBAAqB,CACnB,MAAO,CAAC,CAAE,KAAA9U,EAAM,WAAA4U,CAAY,IAC1BgD,EAAK,CAAC,gBAAiB5X,EAAM4X,EAAKhD,EAAY,GAAG,CAAC,EAAG,GAAG,CAC3D,EACD,oBAAqB,CACnB,MAAO,CAAC,CAAE,KAAA5U,EAAM,WAAA+U,EAAY,WAAAH,EAAY,OAAAI,CAAQ,IAC9C4C,EACE,CACE,cACA5X,EACA2J,EAAK,cAAeiO,EAAK7C,EAAY,KAAK,CAAC,EAC3C6C,EAAKhD,EAAY,GAAG,EACpBoD,GAAMhD,CAAM,CACb,EACD,GACD,CACJ,EACD,uBAAwB,CACtB,MAAO,CAAC,CAAE,KAAAhV,EAAM,WAAA+U,EAAY,WAAAH,EAAY,OAAAI,CAAQ,IAC9C4C,EACE,CACE,mBACA5X,EACA2J,EAAK,cAAeiO,EAAK7C,EAAY,KAAK,CAAC,EAC3C6C,EAAKhD,EAAY,GAAG,EACpBoD,GAAMhD,CAAM,CACb,EACD,GACD,CACJ,EACD,mBAAoB,CAClB,MAAO,CAAC,CAAE,KAAAhV,EAAM,WAAA4U,EAAY,MAAAM,CAAO,IACjC0C,EACE,CACE,eACA5X,EACA4X,EAAKhD,EAAY,GAAG,EACpBjL,EAAK,KAAMiO,EAAK1C,EAAO,KAAK,CAAC,CAC9B,EACD,GACD,CACJ,EACD,kBAAmB,CACjB,MAAO,CAAC,CAAE,KAAAlV,EAAM,WAAA4U,EAAY,OAAAO,CAAQ,IAClCyC,EAAK,CAAC,cAAe5X,EAAM4X,EAAKhD,EAAY,GAAG,EAAGoD,GAAM7C,CAAM,CAAC,EAAG,GAAG,CACxE,EACD,yBAA0B,CACxB,MAAO,CAAC,CAAE,KAAAnV,EAAM,WAAA4U,EAAY,OAAAI,CAAQ,IAClC4C,EAAK,CAAC,eAAgB5X,EAAM4X,EAAKhD,EAAY,GAAG,EAAGoD,GAAMhD,CAAM,CAAC,EAAG,GAAG,CACzE,CACH,EAMA,SAAS4C,EAAKW,EAAYC,EAAY,GAAI,CACxC,IAAIC,EAEJ,OAAQA,EACNF,GAAe,KACX,OACAA,EAAW,OAAQzjB,GAAMA,CAAC,EAAE,KAAK0jB,CAAS,KAAO,MACrDC,IAA0B,OACxBA,EACA,EACN,CAKA,SAAST,GAAM1K,EAAO,CACpB,OAAO3D,EAAK;AAAA,EAAOyF,GAAOwI,EAAKtK,EAAO;AAAA,CAAI,CAAC,EAAG;AAAA,EAAK,CACrD,CAKA,SAAS3D,EAAKmE,EAAO4K,EAAa3K,EAAM,GAAI,CAC1C,OAAO2K,GAAe,MAAQA,IAAgB,GAC1C5K,EAAQ4K,EAAc3K,EACtB,EACN,CAEA,SAASqB,GAAOE,EAAK,CACnB,OAAO3F,EAAK,KAAM2F,EAAI,QAAQ,MAAO;AAAA,GAAM,CAAC,CAC9C,CAEA,SAASgJ,GAAkBC,EAAY,CACrC,IAAII,EAKJ,OAAQA,EACNJ,GAAe,KACX,OACAA,EAAW,KAAMjJ,GAAQA,EAAI,SAAS;AAAA,CAAI,CAAC,KAAO,MACtDqJ,IAAqB,OACnBA,EACA,EACN,CChVO,SAASC,GAAc/kB,EAAIglB,EAAW,CACzC,IAAIjE,EAAa/gB,EAAG,WACpB,MAAI,CAAC+gB,GAAc,CAACA,EAAW,OACpB,GAEJkE,GAAuBlE,CAAU,EAAE,MAAM,SAAU/gB,EAAI,CAC1D,IAAIklB,EAAYllB,EAAG,UAAWmlB,EAAanlB,EAAG,WAC1ColB,EAAc,GAClB,OAAID,EAAW,MAAM,OAAS,YAC1BC,EACIJ,GAAaA,EAAUG,EAAW,MAAM,KAAK,KAAK,EACtDrQ,EAAUsQ,IAAgB,OAAQ,GAAIF,EAAU,KAAK,KAAK,GAG1DE,EAAcD,EAAW,MAAM,MAE5BD,EAAU,KAAK,QAAU,OAAS,CAACE,EAAcA,CAChE,CAAK,CACL,CAgBO,SAASC,GAAcC,EAAO/C,EAAMgD,EAAK,CAC5C,IAAIC,EAAU,IAAI,IAAIF,CAAK,EACvBG,EAAcD,EAAQ,KAC1B,OAAAlD,GAAMC,EAAM,CACR,UAAW,SAAUpJ,EAAM,CACvB,GAAIqM,EAAQ,OAAOrM,EAAK,KAAK,KAAK,IAAM,CAACoM,GAAO,CAACC,EAAQ,MACrD,OAAOnD,EAEd,CACT,CAAK,EAGMkD,EAAM,CAACC,EAAQ,KAAOA,EAAQ,KAAOC,CAChD,CACO,SAASC,GAAiBC,EAAU,CACvC,OAAOA,GAAYN,GAAc,CAAC,SAAU,QAAQ,EAAGM,EAAU,EAAI,CACzE,CACA,SAASC,GAAqB5lB,EAAI,CAC9B,IAAIF,EAAQE,EAAG,KAAK,MACpB,OAAOF,IAAU,QAAUA,IAAU,SACzC,CACO,SAASmlB,GAAuBlE,EAAY,CAC/C,IAAI5d,EAAS,CAAA,EACb,OAAI4d,GAAcA,EAAW,QACzBA,EAAW,QAAQ,SAAUmE,EAAW,CACpC,GAAKU,GAAqBV,CAAS,EAEnC,KAAIW,EAAqBX,EAAU,UAC/BY,EAAgBZ,EAAU,KAAK,MACnCpQ,EAAU+Q,GAAsBA,EAAmB,SAAW,EAAG,GAAIC,CAAa,EAClF,IAAIX,EAAaU,EAAmB,CAAC,EACrC/Q,EAAUqQ,EAAW,MAAQA,EAAW,KAAK,QAAU,KAAM,GAAIW,CAAa,EAC9E,IAAIC,EAAUZ,EAAW,MAEzBrQ,EAAUiR,IACLA,EAAQ,OAAS,YAAcA,EAAQ,OAAS,gBAAiB,GAAID,CAAa,EACvF3iB,EAAO,KAAK,CAAE,UAAW+hB,EAAW,WAAYC,CAAU,CAAE,EACxE,CAAS,EAEEhiB,CACX,CCvEA,MAAM6iB,GAAkB,IAAM,OAAO,OAAO,IAAI,EAE1C,CAAA,QAAEC,GAASna,MAAAA,IAAU,MAAM,UAC3B,gBAAEoa,EAAc,EAAK,OAAO,UAC3B,IAAAC,GAAA,MAAMC,EAAK,CACd,YAAYC,EAAW,GAAMC,EAAWN,GAAiB,CACrD,KAAK,SAAWK,EAChB,KAAK,SAAWC,CACnB,CACD,QAAS,CACL,OAAO,KAAK,YAAY,SAAS,CACpC,CACD,YAAY7M,EAAO,CACf,IAAIN,EAAO,KACX8M,OAAAA,GAAQ,KAAKxM,EAAO5c,GAAOsc,EAAOA,EAAK,aAAatc,CAAG,CAAC,EACjDqpB,GAAe,KAAK/M,EAAM,MAAM,EACjCA,EAAK,KACLA,EAAK,KAAO,KAAK,SAASrN,GAAM,KAAK2N,CAAK,CAAC,CACpD,CACD,MAAO,CACH,OAAO,KAAK,UAAU,SAAS,CAClC,CACD,UAAUA,EAAO,CACb,IAAIN,EAAO,KACX,QAASnb,EAAI,EAAGshB,EAAM7F,EAAM,OAAQN,GAAQnb,EAAIshB,EAAK,EAAEthB,EAAG,CACtD,MAAMyJ,EAAM0R,EAAK,OAAOM,EAAMzb,CAAC,EAAG,EAAK,EACvCmb,EAAO1R,GAAOA,EAAI,IAAIgS,EAAMzb,CAAC,CAAC,CACjC,CACD,OAAOmb,GAAQA,EAAK,IACvB,CACD,QAAS,CACL,OAAO,KAAK,YAAY,SAAS,CACpC,CACD,YAAYM,EAAO,CACf,IAAI8M,EACJ,GAAI9M,EAAM,OAAQ,CACd,MAAM+M,EAAO/M,EAAM,CAAC,EACdhS,EAAM,KAAK,OAAO+e,EAAM,EAAK,EAC7BC,EAAQhf,GAAOA,EAAI,IAAI+e,CAAI,EAC7BC,IACAF,EAAOE,EAAM,YAAY3a,GAAM,KAAK2N,EAAO,CAAC,CAAC,EACzC,CAACgN,EAAM,MAAQ,CAACA,EAAM,MAAQ,EAAEA,EAAM,QAAUA,EAAM,OAAO,OAC7Dhf,EAAI,OAAO+e,CAAI,EAG1B,MAEGD,EAAO,KAAK,KACZ,OAAO,KAAK,KAEhB,OAAOA,CACV,CACD,aAAa1pB,EAAK,CACd,MAAM4K,EAAM,KAAK,OAAO5K,EAAK,EAAI,EACjC,IAAI4pB,EAAQhf,EAAI,IAAI5K,CAAG,EACvB,OAAK4pB,GACDhf,EAAI,IAAI5K,EAAK4pB,EAAQ,IAAIL,GAAK,KAAK,SAAU,KAAK,QAAQ,CAAC,EACxDK,CACV,CACD,OAAO5pB,EAAK6pB,EAAQ,CAChB,OAAO,KAAK,UAAYC,GAAS9pB,CAAG,EAC9B,KAAK,OAAS6pB,EAAS,KAAK,KAAO,IAAI,QAAU,QACjD,KAAK,SAAWA,EAAS,KAAK,OAAS,IAAI,IAAM,OAC1D,CACL,EACA,SAASC,GAAS7mB,EAAO,CACrB,OAAQ,OAAOA,EAAK,CAChB,IAAK,SACD,GAAIA,IAAU,KACV,MAER,IAAK,WACD,MAAO,EACd,CACD,MAAO,EACX,CC/EA,IAAI8mB,GAAgBvR,GAAM,UAAY,CAAE,OAAO,UAAU,OAAQ,CAAE,GAAK,cAC7DwR,GAAgB,OAAO,SAAY,YAC1C,EAAED,IAAiB,CAAC,OAAO,gBACpBE,GAAgB,OAAO,SAAY,WACnCC,GAAe,OAAO,QAAW,YAAc,OAAO,OAAO,KAAQ,WACrEC,GAA4BD,IAAgB,OAAO,cACnDE,GAAY,OAAO5R,GAAM,UAAY,CAAE,OAAO,OAAO,SAAS,aAAgB,CAAA,GAAM,WAC3F6R,GASJ7R,GAAM,UAAY,CAAE,OAAO,UAAU,UAAU,QAAQ,OAAO,GAAK,EAAI,GAAK,GAOjE8R,IAAsBF,IAAaL,KAAkB,CAACM,GCxB1D,SAASE,EAAgBrrB,EAAK,CACjC,OAAOA,IAAQ,MAAQ,OAAOA,GAAQ,QAC1C,CCsBO,SAASsrB,GAAyB1B,EAAU2B,EAAc,CAC7D,IAAIC,EAAqBD,EAIrBE,EAAY,CAAA,EAChB7B,EAAS,YAAY,QAAQ,SAAU8B,EAAY,CAG/C,GAAIA,EAAW,OAAS,sBACpB,MAAMrR,GACF,GACAqR,EAAW,UACXA,EAAW,KAAO,WAAW,OAAOA,EAAW,KAAK,MAAO,GAAG,EAAI,EAClF,EAIYA,EAAW,OAAS,sBACpBD,EAAU,KAAKC,CAAU,CAErC,CAAK,EAGG,OAAOF,EAAuB,MAC9BzS,EAAU0S,EAAU,SAAW,EAAG,GAAIA,EAAU,MAAM,EACtDD,EAAqBC,EAAU,CAAC,EAAE,KAAK,OAI3C,IAAIE,EAAQ3U,EAASA,EAAS,CAAA,EAAI4S,CAAQ,EAAG,CAAE,YAAaxR,EAAc,CAClE,CACI,KAAM,sBAEN,UAAW,QACX,aAAc,CACV,KAAM,eACN,WAAY,CACR,CACI,KAAM,iBACN,KAAM,CACF,KAAM,OACN,MAAOoT,CACV,CACJ,CACJ,CACJ,CACJ,CACJ,EAAE5B,EAAS,YAAa,EAAI,CAAG,CAAA,EACpC,OAAO+B,CACX,CAGO,SAASC,GAAkBH,EAAW,CACrCA,IAAc,SAAUA,EAAY,CAAE,GAC1C,IAAII,EAAW,CAAA,EACf,OAAAJ,EAAU,QAAQ,SAAUK,EAAU,CAClCD,EAASC,EAAS,KAAK,KAAK,EAAIA,CACxC,CAAK,EACMD,CACX,CACO,SAASE,GAAyBC,EAAWC,EAAa,CAC7D,OAAQD,EAAU,KAAI,CAClB,IAAK,iBACD,OAAOA,EACX,IAAK,iBAAkB,CACnB,IAAIT,EAAeS,EAAU,KAAK,MAClC,GAAI,OAAOC,GAAgB,WACvB,OAAOA,EAAYV,CAAY,EAEnC,IAAIO,EAAWG,GAAeA,EAAYV,CAAY,EACtDxS,OAAAA,EAAU+S,EAAU,GAAIP,CAAY,EAC7BO,GAAY,IACtB,CACD,QACI,OAAO,IACd,CACL,CCrGA,SAASI,IAAiB,CAAG,CACtB,MAAMC,EAAY,CACrB,YAAYC,EAAM,IAAUC,EAAUH,GAAgB,CAClD,KAAK,IAAME,EACX,KAAK,QAAUC,EACf,KAAK,IAAM,IAAI,IACf,KAAK,OAAS,KACd,KAAK,OAAS,IACjB,CACD,IAAIvrB,EAAK,CACL,OAAO,KAAK,IAAI,IAAIA,CAAG,CAC1B,CACD,IAAIA,EAAK,CACL,MAAMsc,EAAO,KAAK,QAAQtc,CAAG,EAC7B,OAAOsc,GAAQA,EAAK,KACvB,CACD,IAAI,MAAO,CACP,OAAO,KAAK,IAAI,IACnB,CACD,QAAQtc,EAAK,CACT,MAAMsc,EAAO,KAAK,IAAI,IAAItc,CAAG,EAC7B,GAAIsc,GAAQA,IAAS,KAAK,OAAQ,CAC9B,KAAM,CAAE,MAAAkP,EAAO,MAAAC,CAAO,EAAGnP,EACrBmP,IACAA,EAAM,MAAQD,GAEdA,IACAA,EAAM,MAAQC,GAElBnP,EAAK,MAAQ,KAAK,OAClBA,EAAK,MAAM,MAAQA,EACnBA,EAAK,MAAQ,KACb,KAAK,OAASA,EACVA,IAAS,KAAK,SACd,KAAK,OAASmP,EAErB,CACD,OAAOnP,CACV,CACD,IAAItc,EAAKiD,EAAO,CACZ,IAAIqZ,EAAO,KAAK,QAAQtc,CAAG,EAC3B,OAAIsc,EACOA,EAAK,MAAQrZ,GAExBqZ,EAAO,CACH,IAAAtc,EACA,MAAAiD,EACA,MAAO,KACP,MAAO,KAAK,MACxB,EACY,KAAK,SACL,KAAK,OAAO,MAAQqZ,GAExB,KAAK,OAASA,EACd,KAAK,OAAS,KAAK,QAAUA,EAC7B,KAAK,IAAI,IAAItc,EAAKsc,CAAI,EACfA,EAAK,MACf,CACD,OAAQ,CACJ,KAAO,KAAK,QAAU,KAAK,IAAI,KAAO,KAAK,KACvC,KAAK,OAAO,KAAK,OAAO,GAAG,CAElC,CACD,OAAOtc,EAAK,CACR,MAAMsc,EAAO,KAAK,IAAI,IAAItc,CAAG,EAC7B,OAAIsc,GACIA,IAAS,KAAK,SACd,KAAK,OAASA,EAAK,OAEnBA,IAAS,KAAK,SACd,KAAK,OAASA,EAAK,OAEnBA,EAAK,QACLA,EAAK,MAAM,MAAQA,EAAK,OAExBA,EAAK,QACLA,EAAK,MAAM,MAAQA,EAAK,OAE5B,KAAK,IAAI,OAAOtc,CAAG,EACnB,KAAK,QAAQsc,EAAK,MAAOtc,CAAG,EACrB,IAEJ,EACV,CACL,CCpFA,SAASsS,IAAO,CAAG,CACnB,MAAM8Y,GAAiB9Y,GACjBoZ,GAAW,OAAO,QAAY,IAC9B,QACA,SAAUzoB,EAAO,CACf,MAAO,CAAE,MAAO,IAAMA,EAC9B,EACM0oB,GAAW,OAAO,QAAY,IAAc,QAAU,IACtDC,GAAwB,OAAO,qBAAyB,IACxD,qBACA,UAAY,CACV,MAAO,CACH,SAAUtZ,GACV,WAAYA,EACxB,CACA,EACMuZ,GAAwB,MACvB,MAAMC,EAAU,CACnB,YAAYR,EAAM,IAAUC,EAAUH,GAAgB,CAClD,KAAK,IAAME,EACX,KAAK,QAAUC,EACf,KAAK,IAAM,IAAII,GACf,KAAK,OAAS,KACd,KAAK,OAAS,KACd,KAAK,iBAAmB,IAAI,IAC5B,KAAK,sBAAwB,GAC7B,KAAK,KAAO,EACZ,KAAK,SAAW,IAAM,CAClB,MAAMI,EAAW,KAAK,iBAAiB,OAAM,EAC7C,QAAS,EAAI,EAAG,EAAIF,GAAuB,IAAK,CAC5C,MAAMvP,EAAOyP,EAAS,KAAI,EAAG,MAC7B,GAAI,CAACzP,EACD,MACJ,KAAK,iBAAiB,OAAOA,CAAI,EACjC,MAAMtc,EAAMsc,EAAK,IACjB,OAAOA,EAAK,IACZA,EAAK,OAAS,IAAIoP,GAAS1rB,CAAG,EAC9B,KAAK,SAAS,SAASA,EAAKsc,EAAMA,CAAI,CACzC,CACG,KAAK,iBAAiB,KAAO,EAC7B,eAAe,KAAK,QAAQ,EAG5B,KAAK,sBAAwB,EAE7C,EACQ,KAAK,SAAW,IAAIsP,GAAsB,KAAK,WAAW,KAAK,IAAI,CAAC,CACvE,CACD,IAAI5rB,EAAK,CACL,OAAO,KAAK,IAAI,IAAIA,CAAG,CAC1B,CACD,IAAIA,EAAK,CACL,MAAMsc,EAAO,KAAK,QAAQtc,CAAG,EAC7B,OAAOsc,GAAQA,EAAK,KACvB,CACD,QAAQtc,EAAK,CACT,MAAMsc,EAAO,KAAK,IAAI,IAAItc,CAAG,EAC7B,GAAIsc,GAAQA,IAAS,KAAK,OAAQ,CAC9B,KAAM,CAAE,MAAAkP,EAAO,MAAAC,CAAO,EAAGnP,EACrBmP,IACAA,EAAM,MAAQD,GAEdA,IACAA,EAAM,MAAQC,GAElBnP,EAAK,MAAQ,KAAK,OAClBA,EAAK,MAAM,MAAQA,EACnBA,EAAK,MAAQ,KACb,KAAK,OAASA,EACVA,IAAS,KAAK,SACd,KAAK,OAASmP,EAErB,CACD,OAAOnP,CACV,CACD,IAAItc,EAAKiD,EAAO,CACZ,IAAIqZ,EAAO,KAAK,QAAQtc,CAAG,EAC3B,OAAIsc,EACQA,EAAK,MAAQrZ,GAEzBqZ,EAAO,CACH,IAAAtc,EACA,MAAAiD,EACA,MAAO,KACP,MAAO,KAAK,MACxB,EACY,KAAK,SACL,KAAK,OAAO,MAAQqZ,GAExB,KAAK,OAASA,EACd,KAAK,OAAS,KAAK,QAAUA,EAC7B,KAAK,qBAAqBA,CAAI,EAC9B,KAAK,IAAI,IAAItc,EAAKsc,CAAI,EACtB,KAAK,OACEA,EAAK,MACf,CACD,OAAQ,CACJ,KAAO,KAAK,QAAU,KAAK,KAAO,KAAK,KACnC,KAAK,WAAW,KAAK,MAAM,CAElC,CACD,WAAWA,EAAM,CACTA,IAAS,KAAK,SACd,KAAK,OAASA,EAAK,OAEnBA,IAAS,KAAK,SACd,KAAK,OAASA,EAAK,OAEnBA,EAAK,QACLA,EAAK,MAAM,MAAQA,EAAK,OAExBA,EAAK,QACLA,EAAK,MAAM,MAAQA,EAAK,OAE5B,KAAK,OACL,MAAMtc,EAAMsc,EAAK,KAAQA,EAAK,QAAUA,EAAK,OAAO,MAAK,EACzD,KAAK,QAAQA,EAAK,MAAOtc,CAAG,EACvBsc,EAAK,OAIN,KAAK,SAAS,WAAWA,CAAI,EAH7B,KAAK,iBAAiB,OAAOA,CAAI,EAKjCtc,GACA,KAAK,IAAI,OAAOA,CAAG,CAC1B,CACD,OAAOA,EAAK,CACR,MAAMsc,EAAO,KAAK,IAAI,IAAItc,CAAG,EAC7B,OAAIsc,GACA,KAAK,WAAWA,CAAI,EACb,IAEJ,EACV,CACD,qBAAqBA,EAAM,CACvB,KAAK,iBAAiB,IAAIA,CAAI,EACzB,KAAK,wBACN,KAAK,sBAAwB,GAC7B,eAAe,KAAK,QAAQ,EAEnC,CACL,CC5IA,IAAI0P,GAAmB,IAAI,QAC3B,SAASC,GAASC,EAAO,CACjBA,EAAM,OAASA,EAAM,KAAO,KAG3BF,GAAiB,IAAIE,CAAK,IAC3BF,GAAiB,IAAIE,CAAK,EAC1B,WAAW,UAAY,CACnBA,EAAM,MAAK,EACXF,GAAiB,OAAOE,CAAK,CAChC,EAAE,GAAG,EAEd,CAYU,IAACC,GAAuB,SAAUb,EAAKC,EAAS,CAQtD,IAAIW,EAAQ,IAAIJ,GAAUR,EAAKC,CAAO,EACtC,OAAAW,EAAM,IAAM,SAAUlsB,EAAKiD,EAAO,CAC9B,IAAImpB,EAAMN,GAAU,UAAU,IAAI,KAAK,KAAM9rB,EAAKiD,CAAK,EACvD,OAAAgpB,GAAS,IAAI,EACNG,CACf,EACWF,CACX,EAYWG,GAAyB,SAAUf,EAAKC,EAAS,CAQxD,IAAIW,EAAQ,IAAIb,GAAYC,EAAKC,CAAO,EACxC,OAAAW,EAAM,IAAM,SAAUlsB,EAAKiD,EAAO,CAC9B,IAAImpB,EAAMf,GAAY,UAAU,IAAI,KAAK,KAAMrrB,EAAKiD,CAAK,EACzD,OAAAgpB,GAAS,IAAI,EACNG,CACf,EACWF,CACX,ECjEII,GAAkB,OAAO,IAAI,kBAAkB,EAuBxCC,GAAarW,EAAS,GAAI0D,GAAO0S,EAAe,CAAC,ECvBxDE,GAAe,CAAA,EACZ,SAASC,GAAoBnd,EAAMod,EAAS,CAC/CF,GAAald,CAAI,EAAIod,CACzB,CAKU,IAACC,GAAiC,WAAW,UAAY,GAC/DC,GACE,OAKKC,GAAkC,WAAW,UAAY,GAChEC,GACE,OAKKC,GAAgC,WAAW,UAAY,GAC9DC,GACE,OACN,SAASC,IAAuB,CAE5B,IAAIC,EAAW,CACX,OAAQ,IACR,mBAAoB,IACpB,MAAO,IACP,0BAA2B,IAC3B,+BAAgC,IAChC,0CAA2C,IAC3C,6BAA8B,IAC9B,0BAA2B,IAC3B,uCAAwC,IACxC,+BAAgC,IAChC,qDAAsD,IACtD,oCAAqC,IACrC,oCAAqC,IACrC,wCAAyC,GACjD,EACI,OAAO,OAAO,YAAY,OAAO,QAAQA,CAAQ,EAAE,IAAI,SAAU/pB,EAAI,CACjE,IAAIgqB,EAAIhqB,EAAG,CAAC,EAAGiU,EAAIjU,EAAG,CAAC,EACvB,MAAO,CACHgqB,EACAZ,GAAWY,CAAC,GAAK/V,CAC7B,CACK,CAAA,CAAC,CACN,CACA,SAASwV,IAAkC,CACvC,IAAIzpB,EAAIiqB,EAAIC,EAAIC,EAAIC,EACpB,GAAM,WAAW,UAAY,GACzB,MAAM,IAAI,MAAM,oCAAoC,EACxD,MAAO,CACH,OAAQN,GAAsB,EAC9B,MAAO/W,EAAS,CAAE,OAAQ/S,EAAKqpB,GAAa,SAAW,MAAQrpB,IAAO,OAAS,OAASA,EAAG,KAAKqpB,EAAY,EAAG,QAASY,EAAKZ,GAAa,UAAY,MAAQY,IAAO,OAAS,OAASA,EAAG,KAAKZ,EAAY,EAAG,oBAAqBa,EAAKb,GAAa,sBAAwB,MAAQa,IAAO,OAAS,OAASA,EAAG,KAAKb,EAAY,EAAG,MAAOgB,GAAS,KAAK,IAAI,EAAG,aAAc,CACvW,gBAAiB,KAAK,aAAgB,eAAkB,KACxD,mBAAoBC,GAAc,KAAK,aAAgB,iBAAiB,CACxF,CAAe,GAAGF,GAAMD,EAAK,KAAK,OAAO,sBAAwB,MAAQC,IAAO,OAAS,OAASA,EAAG,KAAKD,CAAE,CAAC,CAC7G,CACA,CACA,SAASN,IAAiC,CACtC,MAAO,CACH,MAAO,CACH,uBAAwBU,GAAsB,KAAK,cAAiB,CACvE,CACT,CACA,CACA,SAASZ,IAAmC,CACxC,IAAInC,EAAY,KAAK,OAAO,UAC5B,OAAOzU,EAASA,EAAS,CAAE,EAAE8W,GAA+B,MAAM,IAAI,CAAC,EAAG,CAAE,6BAA8BS,GAAc,KAAK,oBAAuB,EAAG,cAAe,CAC9J,oBAAqBC,GAAsB,KAAK,YAAe,mBAAsB,EACrF,wBAAyBA,GAAsB,KAAK,YAAe,uBAA0B,EAC7F,oBAAqBA,GAAsB,KAAK,mBAAsB,CACzE,EAAE,iBAAkB,CACjB,oBAAqBA,GAAsB/C,GAAc,KAA+B,OAASA,EAAU,mBAAmB,EAC9H,OAAQ+C,GAAsB/C,GAAc,KAA+B,OAASA,EAAU,MAAM,EACpG,UAAW+C,GAAsB/C,GAAc,KAA+B,OAASA,EAAU,SAAS,CAC7G,CAAA,CAAE,CACX,CACA,SAASgD,GAAUhb,EAAG,CAClB,MAAO,CAAC,CAACA,GAAK,aAAcA,CAChC,CACA,SAAS+a,GAAsB/a,EAAG,CAC9B,OAAOgb,GAAUhb,CAAC,EAAIA,EAAE,KAAO,MACnC,CACA,SAASib,GAAU3qB,EAAO,CACtB,OAAOA,GAAS,IACpB,CACA,SAASwqB,GAAcI,EAAW,CAC9B,OAAOC,GAAqBD,CAAS,EAAE,IAAI,SAAU3B,EAAO,CAAE,MAAQ,CAAE,MAAOA,CAAO,CAAI,CAAA,CAC9F,CACA,SAAS4B,GAAqBD,EAAW,CACrC,OAAOA,EACHvW,EAAcA,EAAc,CACxBoW,GAAsBG,GAAc,KAA+B,OAASA,EAAU,WAAc,CACvG,EAAEC,GAAqBD,GAAc,KAA+B,OAASA,EAAU,IAAO,EAAG,EAAI,EAAGC,GAAqBD,GAAc,KAA+B,OAASA,EAAU,KAAQ,EAAG,EAAI,EAAE,OAAOD,EAAS,EAC7N,EACV,CACA,SAASJ,GAASO,EAAM,CACpB,IAAI5qB,EACJ,OAAO4qB,EACHzW,EAAcA,EAAc,EACvBnU,EAAK4qB,GAAS,KAA0B,OAASA,EAAK,sBAAwB,MAAQ5qB,IAAO,OAAS,OAASA,EAAG,KAAK4qB,CAAI,CAC/H,EAAEP,GAASO,GAAS,KAA0B,OAASA,EAAK,IAAI,EAAG,EAAI,EAAGP,GAASO,GAAS,KAA0B,OAASA,EAAK,KAAK,EAAG,EAAI,EAAE,OAAOH,EAAS,EACjK,EACV,CC3FU,IAACI,GAAqB,OAAO,OAAO,SAA4B/qB,EAAO,CAC7E,OAAO,KAAK,UAAUA,EAAOgrB,EAAoB,CACrD,EAAG,CACC,MAAO,UAAY,CAIfC,GAAa,IAAI7B,GAAuBE,GAAW,oBAAsB,GAAI,CAChF,CACL,CAAC,EACG,WAAW,UAAY,IACvBE,GAAoB,qBAAsB,UAAY,CAAE,OAAOyB,GAAW,IAAK,CAAE,EAIrF,IAAIA,GACJF,GAAmB,MAAK,EAOxB,SAASC,GAAqBjuB,EAAKiD,EAAO,CACtC,GAAIA,GAAS,OAAOA,GAAU,SAAU,CACpC,IAAI9D,EAAQ,OAAO,eAAe8D,CAAK,EAIvC,GAAI9D,IAAU,OAAO,WAAaA,IAAU,KAAM,CAC9C,IAAI0F,EAAO,OAAO,KAAK5B,CAAK,EAG5B,GAAI4B,EAAK,MAAMspB,EAAe,EAC1B,OAAOlrB,EACX,IAAImrB,EAAc,KAAK,UAAUvpB,CAAI,EACjCwpB,EAAaH,GAAW,IAAIE,CAAW,EAC3C,GAAI,CAACC,EAAY,CACbxpB,EAAK,KAAI,EACT,IAAIypB,EAAY,KAAK,UAAUzpB,CAAI,EAGnCwpB,EAAaH,GAAW,IAAII,CAAS,GAAKzpB,EAC1CqpB,GAAW,IAAIE,EAAaC,CAAU,EACtCH,GAAW,IAAII,EAAWD,CAAU,CACvC,CACD,IAAIE,EAAiB,OAAO,OAAOpvB,CAAK,EAGxC,OAAAkvB,EAAW,QAAQ,SAAUruB,EAAK,CAC9BuuB,EAAevuB,CAAG,EAAIiD,EAAMjD,CAAG,CAC/C,CAAa,EACMuuB,CACV,CACJ,CACD,OAAOtrB,CACX,CAKA,SAASkrB,GAAgBnuB,EAAKmB,EAAG0D,EAAM,CACnC,OAAO1D,IAAM,GAAK0D,EAAK1D,EAAI,CAAC,GAAKnB,CACrC,CC9EO,SAASwuB,GAAcvZ,EAAI,CAC9B,MAAO,CAAE,MAAO,OAAOA,CAAE,CAAC,CAC9B,CACO,SAASwZ,EAAYvvB,EAAK,CAC7B,MAAO,GAAQA,GAAO,OAAOA,GAAQ,UAAY,OAAOA,EAAI,OAAU,SAC1E,CACO,SAASwvB,GAAezrB,EAAO,CAClC,OAAQsnB,EAAgBtnB,CAAK,GACzBA,EAAM,OAAS,YACf,MAAM,QAAQA,EAAM,WAAW,CACvC,CACA,SAAS0rB,GAAc1rB,EAAO,CAC1B,OAAOA,EAAM,OAAS,aAC1B,CACA,SAAS2rB,GAAe3rB,EAAO,CAC3B,OAAOA,EAAM,OAAS,cAC1B,CACA,SAAS4rB,GAAW5rB,EAAO,CACvB,OAAOA,EAAM,OAAS,UAC1B,CACA,SAAS6rB,GAAa7rB,EAAO,CACzB,OAAOA,EAAM,OAAS,YAC1B,CACA,SAAS8rB,GAAW9rB,EAAO,CACvB,OAAOA,EAAM,OAAS,UAC1B,CACA,SAAS+rB,GAAc/rB,EAAO,CAC1B,OAAOA,EAAM,OAAS,aAC1B,CACA,SAASgsB,GAAYhsB,EAAO,CACxB,OAAOA,EAAM,OAAS,WAC1B,CACA,SAASisB,GAAYjsB,EAAO,CACxB,OAAOA,EAAM,OAAS,WAC1B,CACA,SAASksB,GAAYlsB,EAAO,CACxB,OAAOA,EAAM,OAAS,WAC1B,CACO,SAASmsB,GAA4BC,EAAQ/f,EAAMrM,EAAOklB,EAAW,CACxE,GAAI0G,GAAW5rB,CAAK,GAAK6rB,GAAa7rB,CAAK,EACvCosB,EAAO/f,EAAK,KAAK,EAAI,OAAOrM,EAAM,KAAK,UAElC2rB,GAAe3rB,CAAK,GAAK0rB,GAAc1rB,CAAK,EACjDosB,EAAO/f,EAAK,KAAK,EAAIrM,EAAM,cAEtB+rB,GAAc/rB,CAAK,EAAG,CAC3B,IAAIqsB,EAAiB,CAAA,EACrBrsB,EAAM,OAAO,IAAI,SAAU/D,EAAK,CAC5B,OAAOkwB,GAA4BE,EAAgBpwB,EAAI,KAAMA,EAAI,MAAOipB,CAAS,CAC7F,CAAS,EACDkH,EAAO/f,EAAK,KAAK,EAAIggB,CACxB,SACQP,GAAW9rB,CAAK,EAAG,CACxB,IAAIssB,GAAiBpH,GAAa,CAAA,GAAIllB,EAAM,KAAK,KAAK,EACtDosB,EAAO/f,EAAK,KAAK,EAAIigB,CACxB,SACQN,GAAYhsB,CAAK,EACtBosB,EAAO/f,EAAK,KAAK,EAAIrM,EAAM,OAAO,IAAI,SAAUusB,EAAW,CACvD,IAAIC,EAAoB,CAAA,EACxB,OAAAL,GAA4BK,EAAmBngB,EAAMkgB,EAAWrH,CAAS,EAClEsH,EAAkBngB,EAAK,KAAK,CAC/C,CAAS,UAEI4f,GAAYjsB,CAAK,EACtBosB,EAAO/f,EAAK,KAAK,EAAIrM,EAAM,cAEtBksB,GAAYlsB,CAAK,EACtBosB,EAAO/f,EAAK,KAAK,EAAI,SAGrB,OAAMiK,GAAkB,GAAIjK,EAAK,MAAOrM,EAAM,IAAI,CAE1D,CACO,SAASysB,GAAsBC,EAAOxH,EAAW,CACpD,IAAIyH,EAAgB,KAChBD,EAAM,aACNC,EAAgB,CAAA,EAChBD,EAAM,WAAW,QAAQ,SAAUtH,EAAW,CAC1CuH,EAAcvH,EAAU,KAAK,KAAK,EAAI,CAAA,EAClCA,EAAU,WACVA,EAAU,UAAU,QAAQ,SAAUllB,EAAI,CACtC,IAAImM,EAAOnM,EAAG,KAAMF,EAAQE,EAAG,MAC/B,OAAOisB,GAA4BQ,EAAcvH,EAAU,KAAK,KAAK,EAAG/Y,EAAMrM,EAAOklB,CAAS,CAClH,CAAiB,CAEjB,CAAS,GAEL,IAAIkH,EAAS,KACb,OAAIM,EAAM,WAAaA,EAAM,UAAU,SACnCN,EAAS,CAAA,EACTM,EAAM,UAAU,QAAQ,SAAUxsB,EAAI,CAClC,IAAImM,EAAOnM,EAAG,KAAMF,EAAQE,EAAG,MAC/B,OAAOisB,GAA4BC,EAAQ/f,EAAMrM,EAAOklB,CAAS,CAC7E,CAAS,GAEE0H,GAAgBF,EAAM,KAAK,MAAON,EAAQO,CAAa,CAClE,CACA,IAAIE,GAAmB,CACnB,aACA,UACA,OACA,SACA,OACA,SACA,aACJ,EAIIC,GAAwB/B,GACjB6B,GAAkB,OAAO,OAAO,SAAUG,EAAW/tB,EAAMiiB,EAAY,CAC9E,GAAIjiB,GACAiiB,GACAA,EAAW,YACXA,EAAW,WAAc,IACzB,GAAIA,EAAW,WAAc,QACzBA,EAAW,WAAc,OAAU,OAAS,EAAG,CAC/C,IAAI+L,EAAa/L,EAAW,WAAc,OACtCA,EAAW,WAAc,OACvB,GACN+L,EAAW,KAAI,EACf,IAAIC,EAAiB,CAAA,EACrB,OAAAD,EAAW,QAAQ,SAAUjwB,EAAK,CAC9BkwB,EAAelwB,CAAG,EAAIiC,EAAKjC,CAAG,CAC9C,CAAa,EACM,GAAG,OAAOkkB,EAAW,WAAc,IAAQ,GAAG,EAAE,OAAO6L,GAAsBG,CAAc,EAAG,GAAG,CAC3G,KAEG,QAAOhM,EAAW,WAAc,IAGxC,IAAIiM,EAAoBH,EACxB,GAAI/tB,EAAM,CAIN,IAAImuB,EAAkBL,GAAsB9tB,CAAI,EAChDkuB,GAAqB,IAAI,OAAOC,EAAiB,GAAG,CACvD,CACD,OAAIlM,GACA,OAAO,KAAKA,CAAU,EAAE,QAAQ,SAAUlkB,EAAK,CACvC8vB,GAAiB,QAAQ9vB,CAAG,IAAM,KAElCkkB,EAAWlkB,CAAG,GAAK,OAAO,KAAKkkB,EAAWlkB,CAAG,CAAC,EAAE,OAChDmwB,GAAqB,IAAI,OAAOnwB,EAAK,GAAG,EAAE,OAAO+vB,GAAsB7L,EAAWlkB,CAAG,CAAC,EAAG,GAAG,EAG5FmwB,GAAqB,IAAI,OAAOnwB,CAAG,EAEnD,CAAS,EAEEmwB,CACX,EAAG,CACC,aAAc,SAAUha,EAAG,CACvB,IAAIka,EAAWN,GACf,OAAAA,GAAwB5Z,EACjBka,CACV,CACL,CAAC,EACM,SAASC,GAAyBX,EAAOxH,EAAW,CACvD,GAAIwH,EAAM,WAAaA,EAAM,UAAU,OAAQ,CAC3C,IAAIY,EAAW,CAAA,EACf,OAAAZ,EAAM,UAAU,QAAQ,SAAUxsB,EAAI,CAClC,IAAImM,EAAOnM,EAAG,KAAMF,EAAQE,EAAG,MAC/B,OAAOisB,GAA4BmB,EAAUjhB,EAAMrM,EAAOklB,CAAS,CAC/E,CAAS,EACMoI,CACV,CACD,OAAO,IACX,CACO,SAASC,GAAuBb,EAAO,CAC1C,OAAOA,EAAM,MAAQA,EAAM,MAAM,MAAQA,EAAM,KAAK,KACxD,CACO,SAASc,GAAsBnqB,EAAQihB,EAAc4D,EAAa,CAErE,QADIR,EACKzR,EAAK,EAAG/V,EAAKokB,EAAa,WAAYrO,EAAK/V,EAAG,OAAQ+V,IAAM,CACjE,IAAIgS,EAAY/nB,EAAG+V,CAAE,EACrB,GAAIwX,GAAQxF,CAAS,GACjB,GAAIA,EAAU,KAAK,QAAU,aACzB,OAAO5kB,EAAOkqB,GAAuBtF,CAAS,CAAC,OAG9CP,EACLA,EAAU,KAAKO,CAAS,EAGxBP,EAAY,CAACO,CAAS,CAE7B,CACD,GAAI,OAAO5kB,EAAO,YAAe,SAC7B,OAAOA,EAAO,WAElB,GAAIqkB,EACA,QAASyC,EAAK,EAAGuD,EAAchG,EAAWyC,EAAKuD,EAAY,OAAQvD,IAAM,CACrE,IAAIlC,EAAYyF,EAAYvD,CAAE,EAC1BwD,EAAWH,GAAsBnqB,EAAQ2kB,GAAyBC,EAAWC,CAAW,EAAE,aAAcA,CAAW,EACvH,GAAI,OAAOyF,GAAa,SACpB,OAAOA,CAEd,CAET,CACO,SAASF,GAAQxF,EAAW,CAC/B,OAAOA,EAAU,OAAS,OAC9B,CACO,SAAS2F,GAAiB3F,EAAW,CACxC,OAAOA,EAAU,OAAS,gBAC9B,CChNO,SAAS4F,GAAcC,EAAK,CAC/B9Y,EAAU8Y,GAAOA,EAAI,OAAS,WAAY,EAAE,EAC5C,IAAIC,EAAaD,EAAI,YAChB,OAAO,SAAUhb,EAAG,CAAE,OAAOA,EAAE,OAAS,qBAAuB,EAC/D,IAAI,SAAU6U,EAAY,CAC3B,GAAIA,EAAW,OAAS,sBACpB,MAAMrR,GAAkB,GAAIqR,EAAW,IAAI,EAE/C,OAAOA,CACf,CAAK,EACD3S,OAAAA,EAAU+Y,EAAW,QAAU,EAAG,GAAIA,EAAW,MAAM,EAChDD,CACX,CACO,SAASE,GAAuBF,EAAK,CACxC,OAAAD,GAAcC,CAAG,EACVA,EAAI,YAAY,OAAO,SAAUnG,EAAY,CAChD,OAAOA,EAAW,OAAS,qBACnC,CAAK,EAAE,CAAC,CACR,CACO,SAASsG,GAAiBH,EAAK,CAClC,OAAQA,EAAI,YACP,OAAO,SAAUnG,EAAY,CAC9B,OAAOA,EAAW,OAAS,uBAAyB,CAAC,CAACA,EAAW,IACzE,CAAK,EACI,IAAI,SAAUxmB,EAAG,CAAE,OAAOA,EAAE,KAAK,MAAQ,EAAE,CAAC,GAAK,IAC1D,CAEO,SAAS+sB,GAAuBJ,EAAK,CACxC,OAAOA,EAAI,YAAY,OAAO,SAAUnG,EAAY,CAChD,OAAOA,EAAW,OAAS,oBACnC,CAAK,CACL,CACO,SAASwG,GAAmBL,EAAK,CACpC,IAAIM,EAAWJ,GAAuBF,CAAG,EACzC9Y,OAAAA,EAAUoZ,GAAYA,EAAS,YAAc,QAAS,EAAE,EACjDA,CACX,CACO,SAASC,GAAsBP,EAAK,CACvC9Y,EAAU8Y,EAAI,OAAS,WAAY,EAAE,EACrC9Y,EAAU8Y,EAAI,YAAY,QAAU,EAAG,EAAE,EACzC,IAAIQ,EAAcR,EAAI,YAAY,CAAC,EACnC9Y,OAAAA,EAAUsZ,EAAY,OAAS,qBAAsB,EAAE,EAChDA,CACX,CAMO,SAASC,GAAkBC,EAAU,CACxCX,GAAcW,CAAQ,EAEtB,QADIC,EACKxY,EAAK,EAAG/V,EAAKsuB,EAAS,YAAavY,EAAK/V,EAAG,OAAQ+V,IAAM,CAC9D,IAAI0R,EAAaznB,EAAG+V,CAAE,EACtB,GAAI0R,EAAW,OAAS,sBAAuB,CAC3C,IAAIlH,EAAYkH,EAAW,UAC3B,GAAIlH,IAAc,SACdA,IAAc,YACdA,IAAc,eACd,OAAOkH,CAEd,CACGA,EAAW,OAAS,sBAAwB,CAAC8G,IAG7CA,EAAqB9G,EAE5B,CACD,GAAI8G,EACA,OAAOA,EAEX,MAAMnY,GAAkB,EAAE,CAC9B,CACO,SAASoY,GAAiB/G,EAAY,CACzC,IAAIgH,EAAgB,OAAO,OAAO,IAAI,EAClCC,EAAOjH,GAAcA,EAAW,oBACpC,OAAIiH,GAAQA,EAAK,QACbA,EAAK,QAAQ,SAAUC,EAAK,CACpBA,EAAI,cACJ1C,GAA4BwC,EAAeE,EAAI,SAAS,KAAMA,EAAI,YAAY,CAE9F,CAAS,EAEEF,CACX,CClFA,MAAMzI,GAAkB,IAAM,OAAO,OAAO,IAAI,EAE1C,CAAE,QAAAC,GAAS,MAAAna,IAAU,MAAM,UAC3B,gBAAEoa,EAAc,EAAK,OAAO,UAC3B,MAAME,EAAK,CACd,YAAYC,EAAW,GAAMC,EAAWN,GAAiB,CACrD,KAAK,SAAWK,EAChB,KAAK,SAAWC,CACnB,CACD,UAAU7M,EAAO,CACb,OAAO,KAAK,YAAYA,CAAK,CAChC,CACD,YAAYA,EAAO,CACf,IAAIN,EAAO,KACX,OAAA8M,GAAQ,KAAKxM,EAAO5c,GAAOsc,EAAOA,EAAK,aAAatc,CAAG,CAAC,EACjDqpB,GAAe,KAAK/M,EAAM,MAAM,EACjCA,EAAK,KACLA,EAAK,KAAO,KAAK,SAASrN,GAAM,KAAK2N,CAAK,CAAC,CACpD,CACD,QAAQA,EAAO,CACX,OAAO,KAAK,UAAUA,CAAK,CAC9B,CACD,UAAUA,EAAO,CACb,IAAIN,EAAO,KACX,QAASnb,EAAI,EAAGshB,EAAM7F,EAAM,OAAQN,GAAQnb,EAAIshB,EAAK,EAAEthB,EAAG,CACtD,MAAMyJ,EAAM,KAAK,UAAYkf,GAASlN,EAAMzb,CAAC,CAAC,EAAImb,EAAK,KAAOA,EAAK,OACnEA,EAAO1R,GAAOA,EAAI,IAAIgS,EAAMzb,CAAC,CAAC,CACjC,CACD,OAAOmb,GAAQA,EAAK,IACvB,CACD,aAAatc,EAAK,CACd,MAAM4K,EAAM,KAAK,UAAYkf,GAAS9pB,CAAG,EACnC,KAAK,OAAS,KAAK,KAAO,IAAI,SAC9B,KAAK,SAAW,KAAK,OAAS,IAAI,KACxC,IAAI4pB,EAAQhf,EAAI,IAAI5K,CAAG,EACvB,OAAK4pB,GACDhf,EAAI,IAAI5K,EAAK4pB,EAAQ,IAAIL,GAAK,KAAK,SAAU,KAAK,QAAQ,CAAC,EACxDK,CACV,CACL,CACA,SAASE,GAAS7mB,EAAO,CACrB,OAAQ,OAAOA,EAAK,CAChB,IAAK,SACD,GAAIA,IAAU,KACV,MAER,IAAK,WACD,MAAO,EACd,CACD,MAAO,EACX,CCpDA,IAAI8uB,EAAiB,KAGrB,MAAMC,GAAgB,CAAA,EACtB,IAAIC,GAAY,EAIhB,MAAMC,GAAgB,IAAM,KAAW,CACnC,aAAc,CAIV,KAAK,GAAK,CACN,OACAD,KACA,KAAK,IAAK,EACV,KAAK,OAAM,EAAG,SAAS,EAAE,EAAE,MAAM,CAAC,CAC9C,EAAU,KAAK,GAAG,CACb,CACD,UAAW,CACP,QAASviB,EAAUqiB,EAAgBriB,EAASA,EAAUA,EAAQ,OAG1D,GAAI,KAAK,MAAMA,EAAQ,MAAO,CAC1B,MAAMzM,EAAQyM,EAAQ,MAAM,KAAK,EAAE,EACnC,GAAIzM,IAAU+uB,GACV,MACJ,OAAItiB,IAAYqiB,IAIZA,EAAe,MAAM,KAAK,EAAE,EAAI9uB,GAE7B,EACV,CAEL,OAAI8uB,IAIAA,EAAe,MAAM,KAAK,EAAE,EAAIC,IAE7B,EACV,CACD,UAAW,CACP,GAAI,KAAK,WACL,OAAOD,EAAe,MAAM,KAAK,EAAE,CAE1C,CACD,UAAU9uB,EAAOkvB,EAGjBlwB,EAAMsU,EAAS,CACX,MAAM6b,EAAQ,CACV,UAAW,KACX,CAAC,KAAK,EAAE,EAAGnvB,CACvB,EACcqE,EAASyqB,EACfA,EAAiB,CAAE,OAAAzqB,EAAQ,MAAA8qB,GAC3B,GAAI,CAGA,OAAOD,EAAS,MAAM5b,EAAStU,CAAI,CACtC,QACO,CACJ8vB,EAAiBzqB,CACpB,CACJ,CAGD,OAAO,KAAK6qB,EAAU,CAClB,MAAMziB,EAAUqiB,EAChB,OAAO,UAAY,CACf,MAAMM,EAAQN,EACd,GAAI,CACA,OAAAA,EAAiBriB,EACVyiB,EAAS,MAAM,KAAM,SAAS,CACxC,QACO,CACJJ,EAAiBM,CACpB,CACb,CACK,CAED,OAAO,UAAUF,EAGjBlwB,EAAMsU,EAAS,CACX,GAAIwb,EAAgB,CAChB,MAAMM,EAAQN,EACd,GAAI,CACA,OAAAA,EAAiB,KAGVI,EAAS,MAAM5b,EAAStU,CAAI,CACtC,QACO,CACJ8vB,EAAiBM,CACpB,CACJ,KAEG,QAAOF,EAAS,MAAM5b,EAAStU,CAAI,CAE1C,CACL,EACA,SAASuW,GAAMlQ,EAAI,CACf,GAAI,CACA,OAAOA,EAAE,CACZ,MACe,CAAG,CACvB,CASA,MAAMgqB,GAAY,oBACZC,GAGN/Z,GAAM,IAAM,UAAU,GAIlBA,GAAM,IAAM,MAAM,GAIlB,OAAO,OAAO,IAAI,EAGhBga,GAAaD,GACNE,GAAOD,GAAWF,EAAS,GAGpC,MAAMA,EAAS,GACd,SAAUG,EAAM,CACb,GAAI,CACA,OAAO,eAAeD,GAAYF,GAAW,CACzC,MAAOG,EACP,WAAY,GACZ,SAAU,GAOV,aAAc,EAC9B,CAAa,CACJ,QACO,CACJ,OAAOA,CACV,CACJ,EAAEP,GAAa,CAAE,EChKTQ,GAAkB,IAAID,GCDtB,gBAAEpJ,EAAc,EAAM,OAAO,UAC7BsJ,GAAe,MAAM,MAC9B,SAAU3uB,EAAK,CACX,MAAM4Y,EAAQ,CAAA,EACd,OAAA5Y,EAAI,QAAQ+f,GAAQnH,EAAM,KAAKmH,CAAI,CAAC,EAC7BnH,CACf,EACO,SAASgW,GAAiBC,EAAY,CACzC,KAAM,CAAE,YAAAvmB,CAAa,EAAGumB,EACpB,OAAOvmB,GAAgB,aACvBumB,EAAW,YAAc,OACzBvmB,IAER,CCXA,MAAMwmB,GAAe,CAAA,EACfC,GAAmB,IAGzB,SAASC,GAAO9a,EAAW+a,EAAiB,CACxC,GAAI,CAAC/a,EACD,MAAM,IAAI,MAAM+a,GAAmB,mBAAmB,CAE9D,CACA,SAASC,GAAQnxB,EAAGC,EAAG,CACnB,MAAMygB,EAAM1gB,EAAE,OACd,OAEA0gB,EAAM,GAEFA,IAAQzgB,EAAE,QAEVD,EAAE0gB,EAAM,CAAC,IAAMzgB,EAAEygB,EAAM,CAAC,CAChC,CACA,SAAS0Q,GAASlwB,EAAO,CACrB,OAAQA,EAAM,OAAM,CAChB,IAAK,GAAG,MAAM,IAAI,MAAM,eAAe,EACvC,IAAK,GAAG,OAAOA,EAAM,CAAC,EACtB,IAAK,GAAG,MAAMA,EAAM,CAAC,CACxB,CACL,CACA,SAASmwB,GAAUnwB,EAAO,CACtB,OAAOA,EAAM,MAAM,CAAC,CACxB,CACO,MAAMowB,EAAM,CACf,YAAY/qB,EAAI,CACZ,KAAK,GAAKA,EACV,KAAK,QAAU,IAAI,IACnB,KAAK,YAAc,IAAI,IAIvB,KAAK,cAAgB,KACrB,KAAK,MAAQ,GACb,KAAK,YAAc,GACnB,KAAK,MAAQ,GACb,KAAK,KAAO,KACZ,EAAE+qB,GAAM,KACX,CACD,MAAO,CACH,GAAI,KAAK,MAAM,SAAW,GAAK,CAACC,GAAa,IAAI,EAC7C,OAAAC,GAAe,IAAI,EACZ,KAAK,MAAM,CAAC,CAE1B,CAOD,UAAUtxB,EAAM,CACZ,OAAA+wB,GAAO,CAAC,KAAK,YAAa,qBAAqB,EAC/CO,GAAe,IAAI,EACZD,GAAa,IAAI,EAClBE,GAAgB,KAAMvxB,CAAI,EAC1BkxB,GAAS,KAAK,KAAK,CAC5B,CACD,UAAW,CACH,KAAK,QAET,KAAK,MAAQ,GACbM,GAAY,IAAI,EAIhBb,GAAiB,IAAI,EACxB,CACD,SAAU,CACN,KAAK,SAAQ,EAIbc,GAAe,IAAI,EAYnBC,GAAW,KAAM,CAACrsB,EAAQsiB,IAAU,CAChCtiB,EAAO,SAAQ,EACfssB,GAAYtsB,EAAQ,IAAI,CACpC,CAAS,CACJ,CACD,QAAS,CAIL,KAAK,QAAO,CACf,CACD,SAASusB,EAAK,CACVA,EAAI,IAAI,IAAI,EACP,KAAK,OACN,KAAK,KAAOf,GAAa,IAAG,GAAM,IAAI,KAE1C,KAAK,KAAK,IAAIe,CAAG,CACpB,CACD,YAAa,CACL,KAAK,OACLlB,GAAa,KAAK,IAAI,EAAE,QAAQkB,GAAOA,EAAI,OAAO,IAAI,CAAC,EACvD,KAAK,KAAK,QACVf,GAAa,KAAK,KAAK,IAAI,EAC3B,KAAK,KAAO,KAEnB,CACL,CACAO,GAAM,MAAQ,EACd,SAASE,GAAe3J,EAAO,CAC3B,MAAMtiB,EAASorB,GAAgB,WAC/B,GAAIprB,EACA,OAAAsiB,EAAM,QAAQ,IAAItiB,CAAM,EACnBA,EAAO,YAAY,IAAIsiB,CAAK,GAC7BtiB,EAAO,YAAY,IAAIsiB,EAAO,CAAE,CAAA,EAEhC0J,GAAa1J,CAAK,EAClBkK,GAAiBxsB,EAAQsiB,CAAK,EAG9BmK,GAAiBzsB,EAAQsiB,CAAK,EAE3BtiB,CAEf,CACA,SAASksB,GAAgB7vB,EAAO1B,EAAM,CAClC,OAAAyxB,GAAe/vB,CAAK,EAEpB+uB,GAAgB,UAAU/uB,EAAOqwB,GAAmB,CAACrwB,EAAO1B,CAAI,CAAC,EAC7DgyB,GAAetwB,EAAO1B,CAAI,GAG1BiyB,GAASvwB,CAAK,EAEXwvB,GAASxvB,EAAM,KAAK,CAC/B,CACA,SAASqwB,GAAkBrwB,EAAO1B,EAAM,CACpC0B,EAAM,YAAc,GACpB,KAAM,CAAE,gBAAAwwB,CAAiB,EAAGxwB,EAC5B,IAAIywB,EACAD,GAAmBxwB,EAAM,MAAM,SAAW,IAC1CywB,EAAehB,GAAUzvB,EAAM,KAAK,GAGxCA,EAAM,MAAM,OAAS,EACrB,GAAI,CAOA,GALAA,EAAM,MAAM,CAAC,EAAIA,EAAM,GAAG,MAAM,KAAM1B,CAAI,EAKtCkyB,GAAmBC,GAAgB,CAAClB,GAAQkB,EAAczwB,EAAM,KAAK,EACrE,GAAI,CACAA,EAAM,MAAM,CAAC,EAAIwwB,EAAgBxwB,EAAM,MAAM,CAAC,EAAGywB,EAAa,CAAC,CAAC,CACnE,MACU,CAGV,CAER,OACM9yB,EAAG,CAENqC,EAAM,MAAM,CAAC,EAAIrC,CACpB,CAEDqC,EAAM,YAAc,EACxB,CACA,SAAS2vB,GAAa3vB,EAAO,CACzB,OAAOA,EAAM,OAAS,CAAC,EAAEA,EAAM,eAAiBA,EAAM,cAAc,KACxE,CACA,SAASuwB,GAASvwB,EAAO,CACrBA,EAAM,MAAQ,GACV,CAAA2vB,GAAa3vB,CAAK,GAKtB0wB,GAAY1wB,CAAK,CACrB,CACA,SAAS8vB,GAAY7J,EAAO,CACxB+J,GAAW/J,EAAOkK,EAAgB,CACtC,CACA,SAASO,GAAYzK,EAAO,CACxB+J,GAAW/J,EAAOmK,EAAgB,CACtC,CACA,SAASJ,GAAW/J,EAAOuI,EAAU,CACjC,MAAMmC,EAAc1K,EAAM,QAAQ,KAClC,GAAI0K,EAAa,CACb,MAAMC,EAAU5B,GAAa/I,EAAM,OAAO,EAC1C,QAAS,EAAI,EAAG,EAAI0K,EAAa,EAAE,EAC/BnC,EAASoC,EAAQ,CAAC,EAAG3K,CAAK,CAEjC,CACL,CAEA,SAASkK,GAAiBxsB,EAAQsiB,EAAO,CAGrCoJ,GAAO1rB,EAAO,YAAY,IAAIsiB,CAAK,CAAC,EACpCoJ,GAAOM,GAAa1J,CAAK,CAAC,EAC1B,MAAM4K,EAAiB,CAAClB,GAAahsB,CAAM,EAC3C,GAAI,CAACA,EAAO,cACRA,EAAO,cAAgBwrB,GAAa,IAAK,GAAI,IAAI,YAE5CxrB,EAAO,cAAc,IAAIsiB,CAAK,EAInC,OAEJtiB,EAAO,cAAc,IAAIsiB,CAAK,EAG1B4K,GACAf,GAAYnsB,CAAM,CAE1B,CAEA,SAASysB,GAAiBzsB,EAAQsiB,EAAO,CAGrCoJ,GAAO1rB,EAAO,YAAY,IAAIsiB,CAAK,CAAC,EACpCoJ,GAAO,CAACM,GAAa1J,CAAK,CAAC,EAC3B,MAAMhjB,EAAaU,EAAO,YAAY,IAAIsiB,CAAK,EAC3ChjB,EAAW,SAAW,EACtBU,EAAO,YAAY,IAAIsiB,EAAOwJ,GAAUxJ,EAAM,KAAK,CAAC,EAE9CsJ,GAAQtsB,EAAYgjB,EAAM,KAAK,GACrCtiB,EAAO,SAAQ,EAEnBmtB,GAAiBntB,EAAQsiB,CAAK,EAC1B,CAAA0J,GAAahsB,CAAM,GAGvB+sB,GAAY/sB,CAAM,CACtB,CACA,SAASmtB,GAAiBntB,EAAQsiB,EAAO,CACrC,MAAM8K,EAAKptB,EAAO,cACdotB,IACAA,EAAG,OAAO9K,CAAK,EACX8K,EAAG,OAAS,IACR5B,GAAa,OAASC,IACtBD,GAAa,KAAK4B,CAAE,EAExBptB,EAAO,cAAgB,MAGnC,CAGA,SAASosB,GAAepsB,EAAQ,CACxBA,EAAO,YAAY,KAAO,GAC1BA,EAAO,YAAY,QAAQ,CAACqtB,EAAQ/K,IAAU,CAC1CgK,GAAYtsB,EAAQsiB,CAAK,CACrC,CAAS,EAILtiB,EAAO,WAAU,EAGjB0rB,GAAO1rB,EAAO,gBAAkB,IAAI,CACxC,CACA,SAASssB,GAAYtsB,EAAQsiB,EAAO,CAChCA,EAAM,QAAQ,OAAOtiB,CAAM,EAC3BA,EAAO,YAAY,OAAOsiB,CAAK,EAC/B6K,GAAiBntB,EAAQsiB,CAAK,CAClC,CACA,SAASqK,GAAetwB,EAAO1B,EAAM,CACjC,GAAI,OAAO0B,EAAM,WAAc,WAC3B,GAAI,CACAivB,GAAiBjvB,CAAK,EACtBA,EAAM,YAAcA,EAAM,UAAU,MAAM,KAAM1B,CAAI,CACvD,MACS,CAKN,OAAA0B,EAAM,SAAQ,EACP,EACV,CAIL,MAAO,EACX,CCzSA,MAAMixB,GAAe,CACjB,SAAU,GACV,QAAS,GACT,OAAQ,EACZ,EACO,SAASf,GAAI5oB,EAAS,CACzB,MAAM4pB,EAAY,IAAI,IAEtB,SAASC,EAAO90B,EAAK,CACjB,MAAMsH,EAASorB,GAAgB,WAC/B,GAAIprB,EAAQ,CACR,IAAIusB,EAAMgB,EAAU,IAAI70B,CAAG,EACtB6zB,GACDgB,EAAU,IAAI70B,EAAK6zB,EAAM,IAAI,GAAG,EAEpCvsB,EAAO,SAASusB,CAAG,CAKtB,CACJ,CACD,OAAAiB,EAAO,MAAQ,SAAe90B,EAAK+0B,EAAiB,CAChD,MAAMlB,EAAMgB,EAAU,IAAI70B,CAAG,EAC7B,GAAI6zB,EAAK,CACL,MAAMtjB,EAAKwkB,GACP1L,GAAe,KAAKuL,GAAcG,CAAe,EAAKA,EAAkB,WAI5EpC,GAAakB,CAAG,EAAE,QAAQlwB,GAASA,EAAM4M,CAAC,EAAC,CAAE,EAC7CskB,EAAU,OAAO70B,CAAG,EACpB4yB,GAAiBiB,CAAG,CACvB,CACT,EACWiB,CACX,CCfA,IAAIE,GACG,SAASC,MAAuBhzB,EAAM,CAEzC,OADa+yB,KAAmBA,GAAiB,IAAIzL,GAAK,OAAO,SAAY,UAAU,IAC3E,YAAYtnB,CAAI,CAChC,CAMA,MAAMizB,GAAS,IAAI,IACZ,SAASjc,GAAKkc,EAAkB,CAAE,IAAA7J,EAAM,KAAK,IAAI,EAAG,EAAE,EAAG,QAAA8J,EAAS,aAAAC,EAAeJ,GAAqB,gBAAAd,EAAiB,UAAAj0B,EAAW,MAAOo1B,EAAcjK,EAAW,EAAM,OAAO,OAAO,IAAI,EAAG,CAChM,MAAMa,EAAQ,OAAOoJ,GAAgB,WAC/B,IAAIA,EAAYhK,EAAK3nB,GAASA,EAAM,QAAO,CAAE,EAC7C2xB,EACAC,EAAa,UAAY,CAC3B,MAAMv1B,EAAMq1B,EAAa,MAAM,KAAMD,EAAUA,EAAQ,MAAM,KAAM,SAAS,EAAI,SAAS,EACzF,GAAIp1B,IAAQ,OACR,OAAOm1B,EAAiB,MAAM,KAAM,SAAS,EAEjD,IAAIxxB,EAAQuoB,EAAM,IAAIlsB,CAAG,EACpB2D,IACDuoB,EAAM,IAAIlsB,EAAK2D,EAAQ,IAAI0vB,GAAM8B,CAAgB,CAAC,EAClDxxB,EAAM,gBAAkBwwB,EACxBxwB,EAAM,UAAYzD,EAGlByD,EAAM,OAAS,IAAMuoB,EAAM,OAAOlsB,CAAG,GAEzC,MAAMiD,EAAQU,EAAM,UAAU,MAAM,UAAU,MAAM,KAAK,SAAS,CAAC,EAGnE,OAAAuoB,EAAM,IAAIlsB,EAAK2D,CAAK,EACpBuxB,GAAO,IAAIhJ,CAAK,EAIXwG,GAAgB,aACjBwC,GAAO,QAAQhJ,GAASA,EAAM,MAAO,CAAA,EACrCgJ,GAAO,MAAK,GAETjyB,CACf,EACI,OAAO,eAAesyB,EAAY,OAAQ,CACtC,IAAK,IAAMrJ,EAAM,KACjB,aAAc,GACd,WAAY,EACpB,CAAK,EACD,OAAO,OAAOqJ,EAAW,QAAU,CAC/B,IAAAjK,EACA,QAAA8J,EACA,aAAAC,EACA,gBAAAlB,EACA,UAAAj0B,EACA,MAAAgsB,CACR,CAAK,EACD,SAASsJ,EAASx1B,EAAK,CACnB,MAAM2D,EAAQ3D,GAAOksB,EAAM,IAAIlsB,CAAG,EAC9B2D,GACAA,EAAM,SAAQ,CAErB,CACD4xB,EAAW,SAAWC,EACtBD,EAAW,MAAQ,UAAiB,CAChCC,EAASH,EAAa,MAAM,KAAM,SAAS,CAAC,CACpD,EACI,SAASI,EAAQz1B,EAAK,CAClB,MAAM2D,EAAQ3D,GAAOksB,EAAM,IAAIlsB,CAAG,EAClC,GAAI2D,EACA,OAAOA,EAAM,MAEpB,CACD4xB,EAAW,QAAUE,EACrBF,EAAW,KAAO,UAAgB,CAC9B,OAAOE,EAAQJ,EAAa,MAAM,KAAM,SAAS,CAAC,CAC1D,EACI,SAASK,EAAU11B,EAAK,CACpB,OAAOA,EAAMksB,EAAM,OAAOlsB,CAAG,EAAI,EACpC,CACD,OAAAu1B,EAAW,UAAYG,EACvBH,EAAW,OAAS,UAAkB,CAClC,OAAOG,EAAUL,EAAa,MAAM,KAAM,SAAS,CAAC,CAC5D,EACIE,EAAW,aAAeF,EAC1BE,EAAW,OAASH,EAAU,UAAkB,CAC5C,OAAOC,EAAa,MAAM,KAAMD,EAAQ,MAAM,KAAM,SAAS,CAAC,CACjE,EAAGC,EACG,OAAO,OAAOE,CAAU,CACnC,CCxGA,SAASI,GAAS7M,EAAU,CACxB,OAAOA,CACX,CACG,IAAC8M,GAAmC,UAAY,CAC/C,SAASA,EAAkB/H,EAAW5iB,EAAS,CACvCA,IAAY,SAAUA,EAAU,OAAO,OAAO,IAAI,GACtD,KAAK,YAAcgf,GAAgB,IAAI,QAAY,IAAI,IACvD,KAAK,UAAY4D,EACb5iB,EAAQ,cAER,KAAK,YAAcA,EAAQ,aAE/B,KAAK,OAASA,EAAQ,QAAU,GAChC,KAAK,WAAU,CAClB,CAMD,OAAA2qB,EAAkB,UAAU,YAAc,SAAU9M,EAAU,CAC1D,MAAO,CAACA,CAAQ,CACxB,EACI8M,EAAkB,SAAW,UAAY,CAIrC,OAAO,IAAIA,EAAkBD,GAAU,CAAE,MAAO,EAAO,CAAA,CAC/D,EACIC,EAAkB,MAAQ,SAAUC,EAAWC,EAAMC,EAAO,CACxD,OAAIA,IAAU,SAAUA,EAAQH,EAAkB,SAAQ,GACnD,OAAO,OAAO,IAAIA,EAAkB,SAAU9M,EAAU,CAC3D,IAAIkN,EAAoBH,EAAU/M,CAAQ,EAAIgN,EAAOC,EACrD,OAAOC,EAAkB,kBAAkBlN,CAAQ,CACtD,EAED,CAAE,MAAO,EAAK,CAAE,EAAG,CAAE,KAAMgN,EAAM,MAAOC,CAAK,CAAE,CACvD,EAIIH,EAAkB,UAAU,WAAa,UAAY,CACjD,IAAI5d,EAAQ,KACZ,GAAI,KAAK,OAAQ,CACb,IAAIie,EAAoB,IAAI1M,GAAKS,EAAa,EAC9C,KAAK,YAAc/Q,GAAK2c,EAAkB,UAAU,YAAY,KAAK,IAAI,EAAG,CACxE,aAAc,SAAU9M,EAAU,CAC9B,IAAIoN,EAAYle,EAAM,YAAY8Q,CAAQ,EAC1C,GAAIoN,EACAje,OAAAA,EAAU,MAAM,QAAQie,CAAS,EAAG,EAAE,EAC/BD,EAAkB,YAAYC,CAAS,CAErD,EACD,IAAK3J,GAAW,yBAAyB,EACzC,MAAQT,EACxB,CAAa,CACJ,CACT,EACI8J,EAAkB,UAAU,YAAc,SAAU9M,EAAU,CAC1D,OAAAgI,GAAchI,CAAQ,EACf,KAAK,UAAUA,CAAQ,CACtC,EACI8M,EAAkB,UAAU,kBAAoB,SAAU9M,EAAU,CAGhE,GAAI,KAAK,YAAY,IAAIA,CAAQ,EAC7B,OAAOA,EAEX,IAAIqN,EAAsB,KAAK,YAAYrN,CAAQ,EACnD,YAAK,YAAY,IAAIqN,CAAmB,EACjCA,CACf,EACIP,EAAkB,UAAU,OAAS,SAAUQ,EAAgB,CAC3D,IAAIpe,EAAQ,KACZ,OAAO,OAAO,OAAO,IAAI4d,EAAkB,SAAU9M,EAAU,CAC3D,OAAOsN,EAAe,kBAAkBpe,EAAM,kBAAkB8Q,CAAQ,CAAC,CAC5E,EAED,CAAE,MAAO,EAAK,CAAE,EAAG,CACf,KAAM,KACN,MAAOsN,CACnB,CAAS,CACT,EACWR,CACX,EAAG,ECxFCS,GACOvP,GAAQ,OAAO,OAAO,SAAUC,EAAK,CAC5C,IAAIzgB,EAAS+vB,GAAW,IAAItP,CAAG,EAC/B,OAAKzgB,IACDA,EAASgwB,GAAUvP,CAAG,EACtBsP,GAAW,IAAItP,EAAKzgB,CAAM,GAEvBA,CACX,EAAG,CACC,MAAO,UAAY,CACf+vB,GAAa,IAAIlK,GAAqBI,GAAW,OAAS,GAAI,CACjE,CACL,CAAC,EACDzF,GAAM,MAAK,EACP,WAAW,UAAY,IACvB2F,GAAoB,QAAS,UAAY,CAAE,OAAQ4J,GAAaA,GAAW,KAAO,CAAG,CAAE,ECjBpF,IAAI9uB,EAAU,MAAM,QACpB,SAASgvB,GAAgBtzB,EAAO,CACnC,OAAO,MAAM,QAAQA,CAAK,GAAKA,EAAM,OAAS,CAClD,CCGA,IAAIuzB,GAAiB,CACjB,KAAM1Y,EAAK,MACX,KAAM,CACF,KAAMA,EAAK,KACX,MAAO,YACV,CACL,EACA,SAAS2Y,GAAQpf,EAAI8T,EAAa,CAC9B,MAAQ,CAAC9T,GACLA,EAAG,aAAa,WAAW,MAAM,SAAU6T,EAAW,CAClD,OAAOA,EAAU,OAASpN,EAAK,iBAC3B2Y,GAAQtL,EAAYD,EAAU,KAAK,KAAK,EAAGC,CAAW,CACtE,CAAS,CACT,CACA,SAASuL,GAAiB3F,EAAK,CAC3B,OAAQ0F,GAAQxF,GAAuBF,CAAG,GAAKO,GAAsBP,CAAG,EAAGjG,GAAkBqG,GAAuBJ,CAAG,CAAC,CAAC,EACrH,KACEA,CACV,CACA,SAAS4F,GAAoBC,EAAS,CAClC,IAAInO,EAAQ,IAAI,IACZoO,EAAQ,IAAI,IAChB,OAAAD,EAAQ,QAAQ,SAAUvO,EAAW,CAC7BA,IACIA,EAAU,KACVI,EAAM,IAAIJ,EAAU,KAAMA,CAAS,EAE9BA,EAAU,MACfwO,EAAM,IAAIxO,EAAU,KAAMA,CAAS,EAGnD,CAAK,EACM,SAAUA,EAAW,CACxB,IAAI7f,EAASigB,EAAM,IAAIJ,EAAU,KAAK,KAAK,EAC3C,MAAI,CAAC7f,GAAUquB,EAAM,MACjBA,EAAM,QAAQ,SAAUC,EAAYC,EAAM,CAClCA,EAAK1O,CAAS,IACd7f,EAASsuB,EAE7B,CAAa,EAEEtuB,CACf,CACA,CACA,SAASwuB,GAAwBC,EAAY,CACzC,IAAIrsB,EAAM,IAAI,IACd,OAAO,SAA6B5K,EAAK,CACjCA,IAAQ,SAAUA,EAAMi3B,GAC5B,IAAIC,EAAQtsB,EAAI,IAAI5K,CAAG,EACvB,OAAKk3B,GACDtsB,EAAI,IAAI5K,EAAMk3B,EAAQ,CAKlB,UAAW,IAAI,IACf,gBAAiB,IAAI,GACrC,GAEeA,CACf,CACA,CACO,SAASC,GAA6BjT,EAAY6M,EAAK,CAC1DD,GAAcC,CAAG,EAuBjB,QAlBIqG,EAA0BJ,GAAwB,EAAE,EACpDK,EAAyBL,GAAwB,EAAE,EACnDM,EAAW,SAAUpR,EAAW,CAChC,QAASpd,EAAI,EAAGyuB,EAAW,OAAQzuB,EAAIod,EAAU,SAAWqR,EAAWrR,EAAUpd,CAAC,GAAI,EAAEA,EACpF,GAAI,CAAAvB,EAAQgwB,CAAQ,EAEpB,IAAIA,EAAS,OAASzZ,EAAK,qBAEvB,OAAOsZ,EAAwBG,EAAS,MAAQA,EAAS,KAAK,KAAK,EAEvE,GAAIA,EAAS,OAASzZ,EAAK,oBACvB,OAAOuZ,EAAuBE,EAAS,KAAK,KAAK,EAGzD,kBAAW,UAAY,IAAStf,EAAU,MAAM,EAAE,EAC3C,IACf,EACQuf,EAAiB,EACZr2B,EAAI4vB,EAAI,YAAY,OAAS,EAAG5vB,GAAK,EAAG,EAAEA,EAC3C4vB,EAAI,YAAY5vB,CAAC,EAAE,OAAS2c,EAAK,sBACjC,EAAE0Z,EAGV,IAAIC,EAAmBd,GAAoBzS,CAAU,EACjDwT,EAAoB,SAAUC,EAAgB,CAC9C,OAAOpB,GAAgBoB,CAAc,GACjCA,EACK,IAAIF,CAAgB,EACpB,KAAK,SAAUjvB,EAAQ,CAAE,OAAOA,GAAUA,EAAO,MAAO,CAAE,CAC3E,EACQovB,EAA6B,IAAI,IAMjCC,EAAwB,GACxBC,EAA+B,CAC/B,MAAO,SAAUxb,EAAM,CACnB,GAAIob,EAAkBpb,EAAK,UAAU,EACjC,OAAAub,EAAwB,GACjB,IAEd,CACT,EACQE,EAA8BtS,GAAMsL,EAAK,CAEzC,MAAO+G,EACP,eAAgBA,EAChB,mBAAoB,CAChB,MAAO,UAAY,CAKf,MAAO,EACV,CACJ,EACD,SAAU,CACN,MAAO,SAAUxb,EAAM0b,EAAMC,EAASC,EAAOhS,EAAW,CACpD,IAAIgR,EAAQI,EAASpR,CAAS,EAC1BgR,GACAA,EAAM,UAAU,IAAI5a,EAAK,KAAK,KAAK,CAE1C,CACJ,EACD,eAAgB,CACZ,MAAO,SAAUA,EAAM0b,EAAMC,EAASC,EAAOhS,EAAW,CACpD,GAAIwR,EAAkBpb,EAAK,UAAU,EACjC,OAAAub,EAAwB,GACjB,KAEX,IAAIX,EAAQI,EAASpR,CAAS,EAC1BgR,GACAA,EAAM,gBAAgB,IAAI5a,EAAK,KAAK,KAAK,CAOhD,CACJ,EACD,mBAAoB,CAChB,MAAO,SAAUA,EAAM0b,EAAMC,EAAStxB,EAAM,CACxCixB,EAA2B,IAAI,KAAK,UAAUjxB,CAAI,EAAG2V,CAAI,CAC5D,EACD,MAAO,SAAUA,EAAM0b,EAAMC,EAAStxB,EAAM,CACxC,IAAIwxB,EAAeP,EAA2B,IAAI,KAAK,UAAUjxB,CAAI,CAAC,EACtE,GAAI2V,IAAS6b,EAOT,OAAO7b,EAEX,GAIAkb,EAAiB,GACblb,EAAK,aAAa,WAAW,MAAM,SAAU4O,EAAW,CACpD,OAAOA,EAAU,OAASpN,EAAK,OAC3BoN,EAAU,KAAK,QAAU,YACrD,CAAqB,EAID,OAAAmM,EAAuB/a,EAAK,KAAK,KAAK,EAAE,QAAU,GAClDub,EAAwB,GACjB,IAEd,CACJ,EACD,UAAW,CACP,MAAO,SAAUvb,EAAM,CAInB,GAAImb,EAAiBnb,CAAI,EACrB,OAAAub,EAAwB,GACjB,IAEd,CACJ,CACT,CAAK,EACD,GAAI,CAACA,EAGD,OAAO9G,EAOX,IAAIqH,EAAyB,SAAUlB,EAAO,CAC1C,OAAKA,EAAM,iBACPA,EAAM,eAAiB,IAAI,IAAIA,EAAM,SAAS,EACzCA,EAAM,SACPA,EAAM,gBAAgB,QAAQ,SAAUmB,EAAmB,CACvDD,EAAuBf,EAAuBgB,CAAiB,CAAC,EAAE,eAAe,QAAQ,SAAUpU,EAAS,CACxGiT,EAAM,eAAe,IAAIjT,CAAO,CACxD,CAAqB,CACrB,CAAiB,GAGFiT,CACf,EAIQoB,EAAuB,IAAI,IAC/BP,EAA4B,YAAY,QAAQ,SAAUjG,EAAK,CACvDA,EAAI,OAAShU,EAAK,qBAClBsa,EAAuBhB,EAAwBtF,EAAI,MAAQA,EAAI,KAAK,KAAK,CAAC,EAAE,gBAAgB,QAAQ,SAAUuG,EAAmB,CAC7HC,EAAqB,IAAID,CAAiB,CAC1D,CAAa,EAEIvG,EAAI,OAAShU,EAAK,qBAKvB0Z,IAAmB,GACnB,CAACH,EAAuBvF,EAAI,KAAK,KAAK,EAAE,SACxCwG,EAAqB,IAAIxG,EAAI,KAAK,KAAK,CAEnD,CAAK,EAIDwG,EAAqB,QAAQ,SAAU7N,EAAc,CAGjD2N,EAAuBf,EAAuB5M,CAAY,CAAC,EAAE,gBAAgB,QAAQ,SAAU4N,EAAmB,CAC9GC,EAAqB,IAAID,CAAiB,CACtD,CAAS,CACT,CAAK,EACD,IAAIE,EAAwB,SAAU9N,EAAc,CAChD,MAAO,CAAC,EAIP,CAAC6N,EAAqB,IAAI7N,CAAY,GACnC4M,EAAuB5M,CAAY,EAAE,QACjD,EACQ+N,EAAe,CACf,MAAO,SAAUlc,EAAM,CACnB,GAAIic,EAAsBjc,EAAK,KAAK,KAAK,EACrC,OAAO,IAEd,CACT,EACI,OAAOoa,GAAiBjR,GAAMsS,EAA6B,CAGvD,eAAgBS,EAEhB,mBAAoBA,EACpB,oBAAqB,CACjB,MAAO,SAAUlc,EAAM,CAGnB,GAAIA,EAAK,oBAAqB,CAC1B,IAAImc,EAAsBL,EAE1BhB,EAAwB9a,EAAK,MAAQA,EAAK,KAAK,KAAK,CAAC,EAAE,eAYvD,GAAImc,EAAoB,KAAOnc,EAAK,oBAAoB,OACpD,OAAOpG,EAASA,EAAS,CAAE,EAAEoG,CAAI,EAAG,CAAE,oBAAqBA,EAAK,oBAAoB,OAAO,SAAUoc,EAAQ,CACrG,OAAOD,EAAoB,IAAIC,EAAO,SAAS,KAAK,KAAK,CAC5D,CAAA,CAAG,CAAA,CAEf,CACJ,CACJ,CACJ,CAAA,CAAC,CACN,CACO,IAAIC,GAAwB,OAAO,OAAO,SAAU5H,EAAK,CAC5D,OAAOtL,GAAMsL,EAAK,CACd,aAAc,CACV,MAAO,SAAUzU,EAAM0b,EAAM1wB,EAAQ,CAEjC,GAAI,EAAAA,GACAA,EAAO,OACHwW,EAAK,sBAIb,KAAIuJ,EAAa/K,EAAK,WACtB,GAAK+K,EAKL,KAAIuR,EAAOvR,EAAW,KAAK,SAAU6D,EAAW,CAC5C,OAAQwF,GAAQxF,CAAS,IACpBA,EAAU,KAAK,QAAU,cACtBA,EAAU,KAAK,MAAM,YAAY,KAAM,CAAC,IAAM,EAC1E,CAAiB,EACD,GAAI,CAAA0N,EAKJ,KAAIjJ,EAAQroB,EACZ,GAAI,EAAAopB,GAAQf,CAAK,GACbA,EAAM,YACNA,EAAM,WAAW,KAAK,SAAU5Z,EAAG,CAAE,OAAOA,EAAE,KAAK,QAAU,QAAW,CAAA,GAI5E,OAAOG,EAASA,EAAS,CAAE,EAAEoG,CAAI,EAAG,CAAE,WAAYhF,EAAcA,EAAc,CAAA,EAAI+P,EAAY,EAAI,EAAG,CAACmP,EAAc,EAAG,EAAK,CAAC,CAAE,IAClI,CACJ,CACT,CAAK,CACL,EAAG,CACC,MAAO,SAAU7G,EAAO,CACpB,OAAOA,IAAU6G,EACpB,CACL,CAAC,EAyGM,SAASqC,GAA2B/P,EAAU,CACjD,IAAI8B,EAAa4G,GAAkB1I,CAAQ,EACvCgQ,EAAsBlO,EAAW,UACrC,GAAIkO,IAAwB,QAExB,OAAOhQ,EAGX,IAAIiQ,EAActT,GAAMqD,EAAU,CAC9B,oBAAqB,CACjB,MAAO,SAAUxM,EAAM,CACnB,OAAOpG,EAASA,EAAS,GAAIoG,CAAI,EAAG,CAAE,UAAW,OAAO,CAAE,CAC7D,CACJ,CACT,CAAK,EACD,OAAOyc,CACX,CAEO,SAASC,GAA6BlQ,EAAU,CACnDgI,GAAchI,CAAQ,EACtB,IAAIiQ,EAAc5B,GAA6B,CAC3C,CACI,KAAM,SAAU9O,EAAW,CAAE,OAAOA,EAAU,KAAK,QAAU,QAAW,EACxE,OAAQ,EACX,CACJ,EAAES,CAAQ,EACX,OAAOiQ,CACX,CC9dA,IAAI1P,GAAiB,OAAO,UAAU,eAC/B,SAAS4P,IAAY,CAExB,QADIC,EAAU,CAAA,EACLhgB,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCggB,EAAQhgB,CAAE,EAAI,UAAUA,CAAE,EAE9B,OAAOigB,GAAeD,CAAO,CACjC,CAOO,SAASC,GAAeD,EAAS,CACpC,IAAI50B,EAAS40B,EAAQ,CAAC,GAAK,CAAA,EACvBrgB,EAAQqgB,EAAQ,OACpB,GAAIrgB,EAAQ,EAER,QADIugB,EAAS,IAAIC,GACR,EAAI,EAAG,EAAIxgB,EAAO,EAAE,EACzBvU,EAAS80B,EAAO,MAAM90B,EAAQ40B,EAAQ,CAAC,CAAC,EAGhD,OAAO50B,CACX,CACA,IAAIg1B,GAAoB,SAAUh1B,EAAQuD,EAAQ0xB,EAAU,CACxD,OAAO,KAAK,MAAMj1B,EAAOi1B,CAAQ,EAAG1xB,EAAO0xB,CAAQ,CAAC,CACxD,EACIF,GAA4B,UAAY,CACxC,SAASA,EAAWG,EAAY,CACxBA,IAAe,SAAUA,EAAaF,IAC1C,KAAK,WAAaE,EAClB,KAAK,SAAWjP,EAChB,KAAK,WAAa,IAAI,GACzB,CACD,OAAA8O,EAAW,UAAU,MAAQ,SAAU/0B,EAAQuD,EAAQ,CAGnD,QAFImQ,EAAQ,KACRtI,EAAU,CAAA,EACLwJ,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCxJ,EAAQwJ,EAAK,CAAC,EAAI,UAAUA,CAAE,EAElC,OAAIqR,EAAgB1iB,CAAM,GAAK0iB,EAAgBjmB,CAAM,GACjD,OAAO,KAAKuD,CAAM,EAAE,QAAQ,SAAU4xB,EAAW,CAC7C,GAAIpQ,GAAe,KAAK/kB,EAAQm1B,CAAS,EAAG,CACxC,IAAIC,EAAcp1B,EAAOm1B,CAAS,EAClC,GAAI5xB,EAAO4xB,CAAS,IAAMC,EAAa,CACnC,IAAIpzB,EAAS0R,EAAM,WAAW,MAAMA,EAAOV,EAAc,CAAChT,EACtDuD,EACA4xB,CAAS,EAAG/pB,EAAS,EAAK,CAAC,EAG3BpJ,IAAWozB,IACXp1B,EAAS0T,EAAM,oBAAoB1T,CAAM,EACzCA,EAAOm1B,CAAS,EAAInzB,EAE3B,CACJ,MAIGhC,EAAS0T,EAAM,oBAAoB1T,CAAM,EACzCA,EAAOm1B,CAAS,EAAI5xB,EAAO4xB,CAAS,CAExD,CAAa,EACMn1B,GAGJuD,CACf,EACIwxB,EAAW,UAAU,oBAAsB,SAAUp2B,EAAO,CACxD,OAAIsnB,EAAgBtnB,CAAK,IAChB,KAAK,WAAW,IAAIA,CAAK,IACtB,MAAM,QAAQA,CAAK,EACnBA,EAAQA,EAAM,MAAM,CAAC,EAGrBA,EAAQiT,EAAS,CAAE,UAAW,OAAO,eAAejT,CAAK,GAAKA,CAAK,EAEvE,KAAK,WAAW,IAAIA,CAAK,IAG1BA,CACf,EACWo2B,CACX,EAAG,ECtFH,SAASM,GAAgCC,EAAGC,EAAgB,CAAE,IAAIC,EAAK,OAAO,OAAW,KAAeF,EAAE,OAAO,QAAQ,GAAKA,EAAE,YAAY,EAAG,GAAIE,EAAI,OAAQA,EAAKA,EAAG,KAAKF,CAAC,GAAG,KAAK,KAAKE,CAAE,EAAG,GAAI,MAAM,QAAQF,CAAC,IAAME,EAAKC,GAA4BH,CAAC,IAAMC,EAAqD,CAAMC,IAAIF,EAAIE,GAAI,IAAI34B,EAAI,EAAG,OAAO,UAAY,CAAE,OAAIA,GAAKy4B,EAAE,OAAe,CAAE,KAAM,EAAM,EAAS,CAAE,KAAM,GAAO,MAAOA,EAAEz4B,GAAG,CAAG,CAAG,CAAG,CAAC,MAAM,IAAI,UAAU;AAAA,mFAAuI,CAAI,CAE5lB,SAAS44B,GAA4BH,EAAGI,EAAQ,CAAE,GAAKJ,EAAW,IAAI,OAAOA,GAAM,SAAU,OAAOK,GAAkBL,EAAGI,CAAM,EAAG,IAAI5jB,EAAI,OAAO,UAAU,SAAS,KAAKwjB,CAAC,EAAE,MAAM,EAAG,EAAE,EAAgE,GAAzDxjB,IAAM,UAAYwjB,EAAE,cAAaxjB,EAAIwjB,EAAE,YAAY,MAAUxjB,IAAM,OAASA,IAAM,MAAO,OAAO,MAAM,KAAKwjB,CAAC,EAAG,GAAIxjB,IAAM,aAAe,2CAA2C,KAAKA,CAAC,EAAG,OAAO6jB,GAAkBL,EAAGI,CAAM,EAAI,CAEha,SAASC,GAAkB1vB,EAAKkY,EAAK,EAAMA,GAAO,MAAQA,EAAMlY,EAAI,UAAQkY,EAAMlY,EAAI,QAAQ,QAASpJ,EAAI,EAAG+4B,EAAO,IAAI,MAAMzX,CAAG,EAAGthB,EAAIshB,EAAKthB,IAAO+4B,EAAK/4B,CAAC,EAAIoJ,EAAIpJ,CAAC,EAAK,OAAO+4B,CAAO,CAEvL,SAASC,GAAkB71B,EAAQyO,EAAO,CAAE,QAAS5R,EAAI,EAAGA,EAAI4R,EAAM,OAAQ5R,IAAK,CAAE,IAAIi5B,EAAarnB,EAAM5R,CAAC,EAAGi5B,EAAW,WAAaA,EAAW,YAAc,GAAOA,EAAW,aAAe,GAAU,UAAWA,IAAYA,EAAW,SAAW,IAAM,OAAO,eAAe91B,EAAQ81B,EAAW,IAAKA,CAAU,EAAM,CAE7T,SAASC,GAAaC,EAAaC,EAAYC,EAAa,CAAE,OAAID,GAAYJ,GAAkBG,EAAY,UAAWC,CAAU,EAAOC,GAAaL,GAAkBG,EAAaE,CAAW,EAAG,OAAO,eAAeF,EAAa,YAAa,CAAE,SAAU,EAAO,CAAA,EAAUA,CAAc,CAG7R,IAAIG,GAAa,UAAY,CAC3B,OAAO,OAAO,QAAW,UAC3B,EAEIC,GAAY,SAAUprB,EAAM,CAC9B,OAAOmrB,GAAU,GAAM,EAAQ,OAAOnrB,CAAI,CAC5C,EAEIqrB,GAAY,SAAUrrB,EAAM,CAC9B,OAAOorB,GAAUprB,CAAI,EAAI,OAAOA,CAAI,EAAI,KAAOA,CACjD,EAEImrB,MAAgB,CAACC,GAAU,YAAY,IACzC,OAAO,WAAa,OAAO,YAAY,GAGzC,IAAIE,GAAiBD,GAAU,UAAU,EACrCE,GAAmBF,GAAU,YAAY,EACzCG,GAAgBH,GAAU,SAAS,EAEvC,SAASI,GAAU77B,EAAKc,EAAK,CAC3B,IAAIiD,EAAQ/D,EAAIc,CAAG,EACnB,GAAIiD,GAAS,KACb,IAAI,OAAOA,GAAU,WAAY,MAAM,IAAI,UAAUA,EAAQ,oBAAoB,EACjF,OAAOA,EACT,CAEA,SAAS+3B,GAAW97B,EAAK,CACvB,IAAI+7B,EAAO/7B,EAAI,YAEf,OAAI+7B,IAAS,SACXA,EAAOA,EAAKH,EAAa,EAErBG,IAAS,OACXA,EAAO,SAIJA,IAAS,OAAYA,EAAOC,EACrC,CAEA,SAASC,GAAa/2B,EAAG,CACvB,OAAOA,aAAa82B,EACtB,CAEA,SAASE,GAAgB,EAAG,CACtBA,GAAgB,IAClBA,GAAgB,IAAI,CAAC,EAErB,WAAW,UAAY,CACrB,MAAM,CACZ,CAAK,CAEL,CAEA,SAASC,GAAQ/yB,EAAI,CACnB,QAAQ,UAAU,KAAK,UAAY,CACjC,GAAI,CACFA,GACD,OAAQhH,EAAG,CACV85B,GAAgB95B,CAAC,CAClB,CACL,CAAG,CACH,CAEA,SAASg6B,GAAoBC,EAAc,CACzC,IAAIC,EAAUD,EAAa,SAC3B,GAAIC,IAAY,SAChBD,EAAa,SAAW,OAEpB,EAACC,GAIL,GAAI,CACF,GAAI,OAAOA,GAAY,WACrBA,QACK,CACL,IAAIlvB,EAAcyuB,GAAUS,EAAS,aAAa,EAE9ClvB,GACFA,EAAY,KAAKkvB,CAAO,CAE3B,CACF,OAAQl6B,EAAG,CACV85B,GAAgB95B,CAAC,CAClB,CACH,CAEA,SAASm6B,GAAkBF,EAAc,CACvCA,EAAa,UAAY,OACzBA,EAAa,OAAS,OACtBA,EAAa,OAAS,QACxB,CAEA,SAASG,GAAkBH,EAAc,CACvC,IAAII,EAAQJ,EAAa,OAEzB,GAAKI,EAIL,CAAAJ,EAAa,OAAS,OACtBA,EAAa,OAAS,QAEtB,QAASp6B,EAAI,EAAGA,EAAIw6B,EAAM,SACxBC,GAAmBL,EAAcI,EAAMx6B,CAAC,EAAE,KAAMw6B,EAAMx6B,CAAC,EAAE,KAAK,EAC1Do6B,EAAa,SAAW,UAFI,EAAEp6B,EAElC,EAEJ,CAEA,SAASy6B,GAAmBL,EAAcvxB,EAAM/G,EAAO,CACrDs4B,EAAa,OAAS,UACtB,IAAI56B,EAAW46B,EAAa,UAE5B,GAAI,CACF,IAAIhrB,EAAIwqB,GAAUp6B,EAAUqJ,CAAI,EAEhC,OAAQA,EAAI,CACV,IAAK,OACCuG,GAAGA,EAAE,KAAK5P,EAAUsC,CAAK,EAC7B,MAEF,IAAK,QAEH,GADAw4B,GAAkBF,CAAY,EAC1BhrB,EAAGA,EAAE,KAAK5P,EAAUsC,CAAK,MAAO,OAAMA,EAC1C,MAEF,IAAK,WACHw4B,GAAkBF,CAAY,EAC1BhrB,GAAGA,EAAE,KAAK5P,CAAQ,EACtB,KACH,CACF,OAAQW,EAAG,CACV85B,GAAgB95B,CAAC,CAClB,CAEGi6B,EAAa,SAAW,SAAUD,GAAoBC,CAAY,EAAWA,EAAa,SAAW,YAAWA,EAAa,OAAS,QAC5I,CAEA,SAASM,GAASN,EAAcvxB,EAAM/G,EAAO,CAC3C,GAAIs4B,EAAa,SAAW,SAE5B,IAAIA,EAAa,SAAW,YAAa,CACvCA,EAAa,OAAO,KAAK,CACvB,KAAMvxB,EACN,MAAO/G,CACb,CAAK,EAED,MACD,CAED,GAAIs4B,EAAa,SAAW,QAAS,CACnCA,EAAa,OAAS,YACtBA,EAAa,OAAS,CAAC,CACrB,KAAMvxB,EACN,MAAO/G,CACb,CAAK,EACDo4B,GAAQ,UAAY,CAClB,OAAOK,GAAkBH,CAAY,CAC3C,CAAK,EACD,MACD,CAEDK,GAAmBL,EAAcvxB,EAAM/G,CAAK,EAC9C,CAEA,IAAI64B,GAA4B,UAAY,CAC1C,SAASA,EAAan7B,EAAUo7B,EAAY,CAG1C,KAAK,SAAW,OAChB,KAAK,UAAYp7B,EACjB,KAAK,OAAS,OACd,KAAK,OAAS,eACd,IAAIq7B,EAAuB,IAAIC,GAAqB,IAAI,EAExD,GAAI,CACF,KAAK,SAAWF,EAAW,KAAK,OAAWC,CAAoB,CAChE,OAAQ16B,EAAG,CACV06B,EAAqB,MAAM16B,CAAC,CAC7B,CAEG,KAAK,SAAW,iBAAgB,KAAK,OAAS,QACnD,CAED,IAAI46B,EAASJ,EAAa,UAE1B,OAAAI,EAAO,YAAc,UAAuB,CACtC,KAAK,SAAW,WAClBT,GAAkB,IAAI,EACtBH,GAAoB,IAAI,EAE9B,EAEEjB,GAAayB,EAAc,CAAC,CAC1B,IAAK,SACL,IAAK,UAAY,CACf,OAAO,KAAK,SAAW,QACxB,CACF,CAAA,CAAC,EAEKA,CACT,IAEIG,GAAoC,UAAY,CAClD,SAASA,EAAqBV,EAAc,CAC1C,KAAK,cAAgBA,CACtB,CAED,IAAIY,EAAUF,EAAqB,UAEnC,OAAAE,EAAQ,KAAO,SAAcl5B,EAAO,CAClC44B,GAAS,KAAK,cAAe,OAAQ54B,CAAK,CAC9C,EAEEk5B,EAAQ,MAAQ,SAAel5B,EAAO,CACpC44B,GAAS,KAAK,cAAe,QAAS54B,CAAK,CAC/C,EAEEk5B,EAAQ,SAAW,UAAoB,CACrCN,GAAS,KAAK,cAAe,UAAU,CAC3C,EAEExB,GAAa4B,EAAsB,CAAC,CAClC,IAAK,SACL,IAAK,UAAY,CACf,OAAO,KAAK,cAAc,SAAW,QACtC,CACF,CAAA,CAAC,EAEKA,CACT,IAEIf,GAA0B,UAAY,CACxC,SAASA,EAAWa,EAAY,CAC9B,GAAI,EAAE,gBAAgBb,GAAa,MAAM,IAAI,UAAU,2CAA2C,EAClG,GAAI,OAAOa,GAAe,WAAY,MAAM,IAAI,UAAU,2CAA2C,EACrG,KAAK,YAAcA,CACpB,CAED,IAAIK,EAAUlB,EAAW,UAEzB,OAAAkB,EAAQ,UAAY,SAAmBz7B,EAAU,CAC/C,OAAI,OAAOA,GAAa,UAAYA,IAAa,QAC/CA,EAAW,CACT,KAAMA,EACN,MAAO,UAAU,CAAC,EAClB,SAAU,UAAU,CAAC,CAC7B,GAGW,IAAIm7B,GAAan7B,EAAU,KAAK,WAAW,CACtD,EAEEy7B,EAAQ,QAAU,SAAiB9zB,EAAI,CACrC,IAAI0P,EAAQ,KAEZ,OAAO,IAAI,QAAQ,SAAUpB,EAASC,EAAQ,CAC5C,GAAI,OAAOvO,GAAO,WAAY,CAC5BuO,EAAO,IAAI,UAAUvO,EAAK,oBAAoB,CAAC,EAC/C,MACD,CAED,SAAS+zB,GAAO,CACdd,EAAa,YAAW,EACxB3kB,GACD,CAED,IAAI2kB,EAAevjB,EAAM,UAAU,CACjC,KAAM,SAAU/U,EAAO,CACrB,GAAI,CACFqF,EAAGrF,EAAOo5B,CAAI,CACf,OAAQ/6B,EAAG,CACVuV,EAAOvV,CAAC,EACRi6B,EAAa,YAAW,CACzB,CACF,EACD,MAAO1kB,EACP,SAAUD,CAClB,CAAO,CACP,CAAK,CACL,EAEEwlB,EAAQ,IAAM,SAAa9zB,EAAI,CAC7B,IAAIg0B,EAAS,KAEb,GAAI,OAAOh0B,GAAO,WAAY,MAAM,IAAI,UAAUA,EAAK,oBAAoB,EAC3E,IAAIi0B,EAAIvB,GAAW,IAAI,EACvB,OAAO,IAAIuB,EAAE,SAAU57B,EAAU,CAC/B,OAAO27B,EAAO,UAAU,CACtB,KAAM,SAAUr5B,EAAO,CACrB,GAAI,CACFA,EAAQqF,EAAGrF,CAAK,CACjB,OAAQ3B,EAAG,CACV,OAAOX,EAAS,MAAMW,CAAC,CACxB,CAEDX,EAAS,KAAKsC,CAAK,CACpB,EACD,MAAO,SAAU3B,EAAG,CAClBX,EAAS,MAAMW,CAAC,CACjB,EACD,SAAU,UAAY,CACpBX,EAAS,SAAQ,CAClB,CACT,CAAO,CACP,CAAK,CACL,EAEEy7B,EAAQ,OAAS,SAAgB9zB,EAAI,CACnC,IAAIk0B,EAAS,KAEb,GAAI,OAAOl0B,GAAO,WAAY,MAAM,IAAI,UAAUA,EAAK,oBAAoB,EAC3E,IAAIi0B,EAAIvB,GAAW,IAAI,EACvB,OAAO,IAAIuB,EAAE,SAAU57B,EAAU,CAC/B,OAAO67B,EAAO,UAAU,CACtB,KAAM,SAAUv5B,EAAO,CACrB,GAAI,CACF,GAAI,CAACqF,EAAGrF,CAAK,EAAG,MACjB,OAAQ3B,EAAG,CACV,OAAOX,EAAS,MAAMW,CAAC,CACxB,CAEDX,EAAS,KAAKsC,CAAK,CACpB,EACD,MAAO,SAAU3B,EAAG,CAClBX,EAAS,MAAMW,CAAC,CACjB,EACD,SAAU,UAAY,CACpBX,EAAS,SAAQ,CAClB,CACT,CAAO,CACP,CAAK,CACL,EAEEy7B,EAAQ,OAAS,SAAgB9zB,EAAI,CACnC,IAAIm0B,EAAS,KAEb,GAAI,OAAOn0B,GAAO,WAAY,MAAM,IAAI,UAAUA,EAAK,oBAAoB,EAC3E,IAAIi0B,EAAIvB,GAAW,IAAI,EACnB0B,EAAU,UAAU,OAAS,EAC7BC,EAAW,GACXC,EAAO,UAAU,CAAC,EAClBC,EAAMD,EACV,OAAO,IAAIL,EAAE,SAAU57B,EAAU,CAC/B,OAAO87B,EAAO,UAAU,CACtB,KAAM,SAAUx5B,EAAO,CACrB,IAAI65B,EAAQ,CAACH,EAGb,GAFAA,EAAW,GAEP,CAACG,GAASJ,EACZ,GAAI,CACFG,EAAMv0B,EAAGu0B,EAAK55B,CAAK,CACpB,OAAQ3B,EAAG,CACV,OAAOX,EAAS,MAAMW,CAAC,CACxB,MAEDu7B,EAAM55B,CAET,EACD,MAAO,SAAU3B,EAAG,CAClBX,EAAS,MAAMW,CAAC,CACjB,EACD,SAAU,UAAY,CACpB,GAAI,CAACq7B,GAAY,CAACD,EAAS,OAAO/7B,EAAS,MAAM,IAAI,UAAU,iCAAiC,CAAC,EACjGA,EAAS,KAAKk8B,CAAG,EACjBl8B,EAAS,SAAQ,CAClB,CACT,CAAO,CACP,CAAK,CACL,EAEEy7B,EAAQ,OAAS,UAAkB,CAGjC,QAFIW,EAAS,KAEJC,EAAO,UAAU,OAAQ9D,EAAU,IAAI,MAAM8D,CAAI,EAAGhF,EAAO,EAAGA,EAAOgF,EAAMhF,IAClFkB,EAAQlB,CAAI,EAAI,UAAUA,CAAI,EAGhC,IAAIuE,EAAIvB,GAAW,IAAI,EACvB,OAAO,IAAIuB,EAAE,SAAU57B,EAAU,CAC/B,IAAI46B,EACA33B,EAAQ,EAEZ,SAASq5B,EAAUtzB,EAAM,CACvB4xB,EAAe5xB,EAAK,UAAU,CAC5B,KAAM,SAAUyN,EAAG,CACjBzW,EAAS,KAAKyW,CAAC,CAChB,EACD,MAAO,SAAU9V,EAAG,CAClBX,EAAS,MAAMW,CAAC,CACjB,EACD,SAAU,UAAY,CAChBsC,IAAUs1B,EAAQ,QACpBqC,EAAe,OACf56B,EAAS,SAAQ,GAEjBs8B,EAAUV,EAAE,KAAKrD,EAAQt1B,GAAO,CAAC,CAAC,CAErC,CACX,CAAS,CACF,CAED,OAAAq5B,EAAUF,CAAM,EACT,UAAY,CACbxB,IACFA,EAAa,YAAW,EACxBA,EAAe,OAEzB,CACA,CAAK,CACL,EAEEa,EAAQ,QAAU,SAAiB9zB,EAAI,CACrC,IAAI40B,EAAS,KAEb,GAAI,OAAO50B,GAAO,WAAY,MAAM,IAAI,UAAUA,EAAK,oBAAoB,EAC3E,IAAIi0B,EAAIvB,GAAW,IAAI,EACvB,OAAO,IAAIuB,EAAE,SAAU57B,EAAU,CAC/B,IAAIw8B,EAAgB,CAAA,EAEhBC,EAAQF,EAAO,UAAU,CAC3B,KAAM,SAAUj6B,EAAO,CACrB,GAAIqF,EACF,GAAI,CACFrF,EAAQqF,EAAGrF,CAAK,CACjB,OAAQ3B,EAAG,CACV,OAAOX,EAAS,MAAMW,CAAC,CACxB,CAGH,IAAI+7B,EAAQd,EAAE,KAAKt5B,CAAK,EAAE,UAAU,CAClC,KAAM,SAAUA,EAAO,CACrBtC,EAAS,KAAKsC,CAAK,CACpB,EACD,MAAO,SAAU3B,EAAG,CAClBX,EAAS,MAAMW,CAAC,CACjB,EACD,SAAU,UAAY,CACpB,IAAIH,EAAIg8B,EAAc,QAAQE,CAAK,EAC/Bl8B,GAAK,GAAGg8B,EAAc,OAAOh8B,EAAG,CAAC,EACrCm8B,GACD,CACb,CAAW,EACDH,EAAc,KAAKE,CAAK,CACzB,EACD,MAAO,SAAU/7B,EAAG,CAClBX,EAAS,MAAMW,CAAC,CACjB,EACD,SAAU,UAAY,CACpBg8B,GACD,CACT,CAAO,EAED,SAASA,GAAiB,CACpBF,EAAM,QAAUD,EAAc,SAAW,GAAGx8B,EAAS,UAC1D,CAED,OAAO,UAAY,CACjBw8B,EAAc,QAAQ,SAAUhnB,EAAG,CACjC,OAAOA,EAAE,aACnB,CAAS,EACDinB,EAAM,YAAW,CACzB,CACA,CAAK,CACL,EAEEhB,EAAQvB,EAAgB,EAAI,UAAY,CACtC,OAAO,IACX,EAEEK,EAAW,KAAO,SAAc92B,EAAG,CACjC,IAAIm4B,EAAI,OAAO,MAAS,WAAa,KAAOrB,EAC5C,GAAI92B,GAAK,KAAM,MAAM,IAAI,UAAUA,EAAI,mBAAmB,EAC1D,IAAIkU,EAASyiB,GAAU32B,EAAGy2B,EAAgB,EAE1C,GAAIviB,EAAQ,CACV,IAAI7X,EAAa6X,EAAO,KAAKlU,CAAC,EAC9B,GAAI,OAAO3D,CAAU,IAAMA,EAAY,MAAM,IAAI,UAAUA,EAAa,mBAAmB,EAC3F,OAAI06B,GAAa16B,CAAU,GAAKA,EAAW,cAAgB87B,EAAU97B,EAC9D,IAAI87B,EAAE,SAAU57B,EAAU,CAC/B,OAAOF,EAAW,UAAUE,CAAQ,CAC5C,CAAO,CACF,CAED,GAAI+5B,GAAU,UAAU,IACtBpiB,EAASyiB,GAAU32B,EAAGw2B,EAAc,EAEhCtiB,GACF,OAAO,IAAIikB,EAAE,SAAU57B,EAAU,CAC/B06B,GAAQ,UAAY,CAClB,GAAI,CAAA16B,EAAS,OAEb,SAAS48B,EAAY5D,GAAgCrhB,EAAO,KAAKlU,CAAC,CAAC,EAAGo5B,EAAO,EAAEA,EAAQD,EAAS,GAAI,MAAO,CACzG,IAAIxZ,EAAOyZ,EAAM,MAEjB,GADA78B,EAAS,KAAKojB,CAAI,EACdpjB,EAAS,OAAQ,MACtB,CAEDA,EAAS,SAAQ,EAC7B,CAAW,CACX,CAAS,EAIL,GAAI,MAAM,QAAQyD,CAAC,EACjB,OAAO,IAAIm4B,EAAE,SAAU57B,EAAU,CAC/B06B,GAAQ,UAAY,CAClB,GAAI,CAAA16B,EAAS,OAEb,SAASQ,EAAI,EAAGA,EAAIiD,EAAE,OAAQ,EAAEjD,EAE9B,GADAR,EAAS,KAAKyD,EAAEjD,CAAC,CAAC,EACdR,EAAS,OAAQ,OAGvBA,EAAS,SAAQ,EAC3B,CAAS,CACT,CAAO,EAGH,MAAM,IAAI,UAAUyD,EAAI,oBAAoB,CAChD,EAEE82B,EAAW,GAAK,UAAc,CAC5B,QAASuC,EAAQ,UAAU,OAAQnzB,EAAQ,IAAI,MAAMmzB,CAAK,EAAGC,EAAQ,EAAGA,EAAQD,EAAOC,IACrFpzB,EAAMozB,CAAK,EAAI,UAAUA,CAAK,EAGhC,IAAInB,EAAI,OAAO,MAAS,WAAa,KAAOrB,EAC5C,OAAO,IAAIqB,EAAE,SAAU57B,EAAU,CAC/B06B,GAAQ,UAAY,CAClB,GAAI,CAAA16B,EAAS,OAEb,SAASQ,EAAI,EAAGA,EAAImJ,EAAM,OAAQ,EAAEnJ,EAElC,GADAR,EAAS,KAAK2J,EAAMnJ,CAAC,CAAC,EAClBR,EAAS,OAAQ,OAGvBA,EAAS,SAAQ,EACzB,CAAO,CACP,CAAK,CACL,EAEE05B,GAAaa,EAAY,KAAM,CAAC,CAC9B,IAAKJ,GACL,IAAK,UAAY,CACf,OAAO,IACR,CACF,CAAA,CAAC,EAEKI,CACT,EAAI,EAEAT,MACF,OAAO,eAAeS,GAAY,OAAO,YAAY,EAAG,CACtD,MAAO,CACL,OAAQL,GACR,gBAAiBO,EAClB,EACD,aAAc,EAClB,CAAG,ECrjBH,IAAIuC,GAAYzC,GAAW,UACvB0C,GAAgB,eACfD,GAAUC,EAAa,IAExBD,GAAUC,EAAa,EAAI,UAAY,CACnC,OAAO,IACf,GCbA,IAAIC,GAAW,OAAO,UAAU,SAIzB,SAASC,GAAU76B,EAAO,CAC7B,OAAO86B,GAAgB96B,CAAK,CAChC,CACA,SAAS86B,GAAgBtzB,EAAKuzB,EAAM,CAChC,OAAQH,GAAS,KAAKpzB,CAAG,EAAC,CACtB,IAAK,iBAAkB,CAEnB,GADAuzB,EAAOA,GAAQ,IAAI,IACfA,EAAK,IAAIvzB,CAAG,EACZ,OAAOuzB,EAAK,IAAIvzB,CAAG,EACvB,IAAIwzB,EAASxzB,EAAI,MAAM,CAAC,EACxB,OAAAuzB,EAAK,IAAIvzB,EAAKwzB,CAAM,EACpBA,EAAO,QAAQ,SAAUrU,EAAOzoB,EAAG,CAC/B88B,EAAO98B,CAAC,EAAI48B,GAAgBnU,EAAOoU,CAAI,CACvD,CAAa,EACMC,CACV,CACD,IAAK,kBAAmB,CAEpB,GADAD,EAAOA,GAAQ,IAAI,IACfA,EAAK,IAAIvzB,CAAG,EACZ,OAAOuzB,EAAK,IAAIvzB,CAAG,EAGvB,IAAIyzB,EAAS,OAAO,OAAO,OAAO,eAAezzB,CAAG,CAAC,EACrD,OAAAuzB,EAAK,IAAIvzB,EAAKyzB,CAAM,EACpB,OAAO,KAAKzzB,CAAG,EAAE,QAAQ,SAAUzK,EAAK,CACpCk+B,EAAOl+B,CAAG,EAAI+9B,GAAgBtzB,EAAIzK,CAAG,EAAGg+B,CAAI,CAC5D,CAAa,EACME,CACV,CACD,QACI,OAAOzzB,CACd,CACL,CCnCA,SAAS0zB,GAAWl7B,EAAO,CACvB,IAAIm7B,EAAU,IAAI,IAAI,CAACn7B,CAAK,CAAC,EAC7B,OAAAm7B,EAAQ,QAAQ,SAAUl/B,EAAK,CACvBqrB,EAAgBrrB,CAAG,GAAKm/B,GAAcn/B,CAAG,IAAMA,GAC/C,OAAO,oBAAoBA,CAAG,EAAE,QAAQ,SAAUoQ,EAAM,CAChDib,EAAgBrrB,EAAIoQ,CAAI,CAAC,GACzB8uB,EAAQ,IAAIl/B,EAAIoQ,CAAI,CAAC,CACzC,CAAa,CAEb,CAAK,EACMrM,CACX,CACA,SAASo7B,GAAcn/B,EAAK,CACxB,GAAI,WAAW,UAAY,IAAS,CAAC,OAAO,SAASA,CAAG,EACpD,GAAI,CACA,OAAO,OAAOA,CAAG,CACpB,OACMoC,EAAG,CAIN,GAAIA,aAAa,UACb,OAAO,KACX,MAAMA,CACT,CAEL,OAAOpC,CACX,CACO,SAASo/B,GAAgBp/B,EAAK,CACjC,OAAI,WAAW,UAAY,IACvBi/B,GAAWj/B,CAAG,EAEXA,CACX,CC9BO,SAASq/B,IAAU,CAEtB,QADIC,EAAU,CAAA,EACLtlB,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCslB,EAAQtlB,CAAE,EAAI,UAAUA,CAAE,EAE9B,IAAI5S,EAAS,OAAO,OAAO,IAAI,EAC/B,OAAAk4B,EAAQ,QAAQ,SAAUt/B,EAAK,CACtBA,GAEL,OAAO,KAAKA,CAAG,EAAE,QAAQ,SAAUc,EAAK,CACpC,IAAIiD,EAAQ/D,EAAIc,CAAG,EACfiD,IAAU,SACVqD,EAAOtG,CAAG,EAAIiD,EAE9B,CAAS,CACT,CAAK,EACMqD,CACX,CCnBO,SAASm4B,GAAavR,EAAUjiB,EAAS,CAC5C,OAAOszB,GAAQrR,EAAUjiB,EAASA,EAAQ,WAAa,CACnD,UAAWszB,GAAQroB,EAASA,EAAS,CAAE,EAAGgX,GAAYA,EAAS,SAAS,EAAIjiB,EAAQ,SAAS,CAAC,CACtG,CAAK,CACL,CCAU,IAACyzB,GAAyB,OAAS,EACtC,SAASC,GAA+Br4B,EAAQ,CACnD,OAAIA,EAAO,WACA,MAAM,QAAQA,EAAO,WAAWo4B,EAAsB,CAAC,EAE3D,EACX,CACO,SAASE,GAAcC,EAAK,CAC/B,OAAOA,EAAI,eAAe,eAAe,CAC7C,CAKA,IAAIC,GAAuB,SAAUD,EAAK,CACtC,IAAIE,EAASznB,EAAcA,EAAcA,EAAc,CAAA,EAAIunB,EAAI,cAAe,EAAI,EAAGA,EAAI,aAAc,EAAI,EAAGA,EAAI,eAAgB,EAAI,EACtI,OAAIA,EAAI,cACJE,EAAO,KAAKF,EAAI,YAAY,EACxBE,EAEH,IAAI,SAAUF,EAAK,CACpB,OAAQtU,EAAgBsU,CAAG,GAAKA,EAAI,SAAY,0BACxD,CAAK,EACI,KAAK;AAAA,CAAI,CAClB,EACIG,GAA6B,SAAUlnB,EAAQ,CAC/C9B,GAAUgpB,EAAalnB,CAAM,EAK7B,SAASknB,EAAY77B,EAAI,CACrB,IAAI87B,EAAgB97B,EAAG,cAAe+7B,EAAiB/7B,EAAG,eAAgBg8B,EAAeh8B,EAAG,aAAci8B,EAAej8B,EAAG,aAAck8B,EAAel8B,EAAG,aAAcm8B,EAAYn8B,EAAG,UACrL6U,EAAQF,EAAO,KAAK,KAAMunB,CAAY,GAAK,KAC/C,OAAArnB,EAAM,KAAO,cACbA,EAAM,cAAgBinB,GAAiB,GACvCjnB,EAAM,eAAiBknB,GAAkB,GACzClnB,EAAM,aAAemnB,GAAgB,GACrCnnB,EAAM,aAAeonB,GAAgB,KACrCpnB,EAAM,QAAUqnB,GAAgBP,GAAqB9mB,CAAK,EAC1DA,EAAM,UAAYsnB,EAClBtnB,EAAM,MACFV,EAAcA,EAAcA,EAAc,CACtC8nB,CAChB,EAAgBH,GAAiB,CAAE,EAAG,EAAI,EAAIC,GAAkB,GAAK,EAAI,EAAIC,GAAgB,CAAA,EAAK,EAAI,EAAE,KAAK,SAAU79B,EAAG,CAAE,MAAO,CAAC,CAACA,EAAI,GAAK,KAGtI0W,EAAM,UAAYgnB,EAAY,UACvBhnB,CACV,CACD,OAAOgnB,CACX,EAAE,KAAK,ECzDP,KAAM,CAAE,SAAAnB,GAAU,eAAAxU,IAAmB,OAAO,UACtCkW,GAAU,SAAS,UAAU,SAC7BC,GAAsB,IAAI,IAIzB,SAASC,GAAM19B,EAAGC,EAAG,CACxB,GAAI,CACA,OAAO09B,GAAM39B,EAAGC,CAAC,CACpB,QACO,CACJw9B,GAAoB,MAAK,CAC5B,CACL,CAGA,SAASE,GAAM39B,EAAGC,EAAG,CAEjB,GAAID,IAAMC,EACN,MAAO,GAIX,MAAM29B,EAAO9B,GAAS,KAAK97B,CAAC,EACtB69B,EAAO/B,GAAS,KAAK77B,CAAC,EAI5B,GAAI29B,IAASC,EACT,MAAO,GAEX,OAAQD,EAAI,CACR,IAAK,iBAGD,GAAI59B,EAAE,SAAWC,EAAE,OACf,MAAO,GAEf,IAAK,kBAAmB,CACpB,GAAI69B,GAAmB99B,EAAGC,CAAC,EACvB,MAAO,GACX,MAAM89B,EAAQC,GAAYh+B,CAAC,EACrBi+B,EAAQD,GAAY/9B,CAAC,EAGrBi+B,EAAWH,EAAM,OACvB,GAAIG,IAAaD,EAAM,OACnB,MAAO,GAEX,QAAS7S,EAAI,EAAGA,EAAI8S,EAAU,EAAE9S,EAC5B,GAAI,CAAC9D,GAAe,KAAKrnB,EAAG89B,EAAM3S,CAAC,CAAC,EAChC,MAAO,GAIf,QAASA,EAAI,EAAGA,EAAI8S,EAAU,EAAE9S,EAAG,CAC/B,MAAMntB,EAAM8/B,EAAM3S,CAAC,EACnB,GAAI,CAACuS,GAAM39B,EAAE/B,CAAG,EAAGgC,EAAEhC,CAAG,CAAC,EACrB,MAAO,EAEd,CACD,MAAO,EACV,CACD,IAAK,iBACD,OAAO+B,EAAE,OAASC,EAAE,MAAQD,EAAE,UAAYC,EAAE,QAChD,IAAK,kBAED,GAAID,IAAMA,EACN,OAAOC,IAAMA,EAErB,IAAK,mBACL,IAAK,gBACD,MAAO,CAACD,GAAM,CAACC,EACnB,IAAK,kBACL,IAAK,kBACD,OAAOD,GAAK,GAAGC,CAAC,GACpB,IAAK,eACL,IAAK,eAAgB,CACjB,GAAID,EAAE,OAASC,EAAE,KACb,MAAO,GACX,GAAI69B,GAAmB99B,EAAGC,CAAC,EACvB,MAAO,GACX,MAAMk+B,EAAYn+B,EAAE,UACdqB,EAAQu8B,IAAS,eACvB,OAAa,CACT,MAAMQ,EAAOD,EAAU,OACvB,GAAIC,EAAK,KACL,MAEJ,KAAM,CAACC,EAAMC,CAAM,EAAIF,EAAK,MAO5B,GALI,CAACn+B,EAAE,IAAIo+B,CAAI,GAKXh9B,GAAS,CAACs8B,GAAMW,EAAQr+B,EAAE,IAAIo+B,CAAI,CAAC,EACnC,MAAO,EAEd,CACD,MAAO,EACV,CACD,IAAK,uBACL,IAAK,sBACL,IAAK,uBACL,IAAK,sBACL,IAAK,qBACL,IAAK,sBACL,IAAK,uBAGDr+B,EAAI,IAAI,WAAWA,CAAC,EACpBC,EAAI,IAAI,WAAWA,CAAC,EAExB,IAAK,oBAAqB,CACtB,IAAIygB,EAAM1gB,EAAE,WACZ,GAAI0gB,IAAQzgB,EAAE,WACV,KAAOygB,KAAS1gB,EAAE0gB,CAAG,IAAMzgB,EAAEygB,CAAG,GAAG,CAIvC,OAAOA,IAAQ,EAClB,CACD,IAAK,yBACL,IAAK,6BACL,IAAK,kCACL,IAAK,oBAAqB,CACtB,MAAM6d,EAAQf,GAAQ,KAAKx9B,CAAC,EAC5B,OAAIu+B,IAAUf,GAAQ,KAAKv9B,CAAC,EACjB,GAyBJ,CAACu+B,GAASD,EAAOE,EAAgB,CAC3C,CACJ,CAED,MAAO,EACX,CACA,SAAST,GAAY7gC,EAAK,CAGtB,OAAO,OAAO,KAAKA,CAAG,EAAE,OAAOuhC,GAAcvhC,CAAG,CACpD,CACA,SAASuhC,GAAazgC,EAAK,CACvB,OAAO,KAAKA,CAAG,IAAM,MACzB,CACA,MAAMwgC,GAAmB,oBACzB,SAASD,GAASG,EAAMC,EAAQ,CAC5B,MAAMC,EAAYF,EAAK,OAASC,EAAO,OACvC,OAAOC,GAAa,GAChBF,EAAK,QAAQC,EAAQC,CAAS,IAAMA,CAC5C,CACA,SAASf,GAAmB99B,EAAGC,EAAG,CAS9B,IAAI6+B,EAAOrB,GAAoB,IAAIz9B,CAAC,EACpC,GAAI8+B,GAGA,GAAIA,EAAK,IAAI7+B,CAAC,EACV,MAAO,QAGXw9B,GAAoB,IAAIz9B,EAAG8+B,EAAO,IAAI,GAAG,EAE7C,OAAAA,EAAK,IAAI7+B,CAAC,EACH,EACX,CC9LO,SAAS8+B,GAAajW,EAAO1nB,EAAIiqB,EAAIjF,EAAW,CACnD,IAAI4Y,EAAQ59B,EAAG,KAAM69B,EAAQ3qB,GAAOlT,EAAI,CAAC,MAAM,CAAC,EAC5C89B,EAAQ7T,EAAG,KAAM8T,EAAQ7qB,GAAO+W,EAAI,CAAC,MAAM,CAAC,EAChD,OAAQqS,GAAMuB,EAAOE,CAAK,GACtBC,GAAoB3P,GAAkB3G,CAAK,EAAE,aAAckW,EAAOE,EAAO,CACrE,YAAanW,GAAkBqG,GAAuBtG,CAAK,CAAC,EAC5D,UAAW1C,CACvB,CAAS,CACT,CACA,SAASgZ,GAAoB5Z,EAAc6Z,EAASC,EAAS3xB,EAAS,CAClE,GAAI0xB,IAAYC,EACZ,MAAO,GAEX,IAAIC,EAAiB,IAAI,IAIzB,OAAO/Z,EAAa,WAAW,MAAM,SAAU2D,EAAW,CAWtD,GARIoW,EAAe,IAAIpW,CAAS,IAEhCoW,EAAe,IAAIpW,CAAS,EAExB,CAAChD,GAAcgD,EAAWxb,EAAQ,SAAS,IAI3C6xB,GAAiCrW,CAAS,EAC1C,MAAO,GACX,GAAIwF,GAAQxF,CAAS,EAAG,CACpB,IAAIsW,EAAYhR,GAAuBtF,CAAS,EAC5CuW,EAAeL,GAAWA,EAAQI,CAAS,EAC3CE,EAAeL,GAAWA,EAAQG,CAAS,EAC3CG,EAAoBzW,EAAU,aAClC,GAAI,CAACyW,EAGD,OAAOlC,GAAMgC,EAAcC,CAAY,EAE3C,IAAIE,EAAgB,MAAM,QAAQH,CAAY,EAC1CI,EAAgB,MAAM,QAAQH,CAAY,EAC9C,GAAIE,IAAkBC,EAClB,MAAO,GACX,GAAID,GAAiBC,EAAe,CAChC,IAAIC,EAAWL,EAAa,OAC5B,GAAIC,EAAa,SAAWI,EACxB,MAAO,GAEX,QAAS3gC,EAAI,EAAGA,EAAI2gC,EAAU,EAAE3gC,EAC5B,GAAI,CAACggC,GAAoBQ,EAAmBF,EAAatgC,CAAC,EAAGugC,EAAavgC,CAAC,EAAGuO,CAAO,EACjF,MAAO,GAGf,MAAO,EACV,CACD,OAAOyxB,GAAoBQ,EAAmBF,EAAcC,EAAchyB,CAAO,CACpF,KACI,CACD,IAAIsb,EAAWC,GAAyBC,EAAWxb,EAAQ,WAAW,EACtE,GAAIsb,EAGA,OAAIuW,GAAiCvW,CAAQ,EAClC,GACJmW,GAAoBnW,EAAS,aAKpCoW,EAASC,EAAS3xB,CAAO,CAEhC,CACT,CAAK,CACL,CACA,SAAS6xB,GAAiCrW,EAAW,CACjD,MAAQ,CAAC,CAACA,EAAU,YAAcA,EAAU,WAAW,KAAK6W,EAAsB,CACtF,CACA,SAASA,GAAuBC,EAAK,CACjC,OAAOA,EAAI,KAAK,QAAU,aAC9B,CC/EA,IAAIC,GAA6B,UAAY,CACzC,SAASA,GAAc,CACnB,KAAK,uBAAyB,GAG9B,KAAK,eAAiBhpB,GAAKuR,GAA0B,CACjD,IAAK+B,GAAW,8BAA8B,GAC1C,IACJ,MAAOT,EACnB,CAAS,CACJ,CAOD,OAAAmW,EAAY,UAAU,MAAQ,SAAUh3B,EAAS,CAC7C,IAAI+M,EAAQ,KACRkqB,EAAe,OAAOj3B,EAAQ,YAAe,SAAWA,EAAQ,WAC9DA,EAAQ,aAAe,GAAQ,KAC3B,OACNk3B,EACJ,YAAK,mBAAmB,UAAY,CAAE,OAAQA,EAAel3B,EAAQ,OAAO+M,CAAK,GAAOkqB,CAAY,EAC7FC,CACf,EACIF,EAAY,UAAU,4BAA8B,SAAUG,EAAaF,EAAc,CACrF,KAAK,mBAAmBE,EAAaF,CAAY,CACzD,EAIID,EAAY,UAAU,kBAAoB,SAAUnZ,EAAU,CAC1D,OAAOA,CACf,EAGImZ,EAAY,UAAU,iBAAmB,SAAUnZ,EAAU,CACzD,OAAOA,CACf,EACImZ,EAAY,UAAU,SAAW,SAAU3f,EAAQ,CAEvD,EACI2f,EAAY,UAAU,GAAK,UAAY,CACnC,MAAO,EACf,EACIA,EAAY,UAAU,OAAS,SAAUh3B,EAAS,CAC9C,MAAO,EACf,EAEIg3B,EAAY,UAAU,UAAY,SAAUh3B,EAASsqB,EAAY,CAC7D,OAAIA,IAAe,SAAUA,EAAa,CAAC,CAACtqB,EAAQ,YAC7C,KAAK,KAAKiL,EAASA,EAAS,CAAA,EAAIjL,CAAO,EAAG,CAAE,OAAQA,EAAQ,IAAM,aAAc,WAAYsqB,CAAY,CAAA,CAAC,CACxH,EAEI0M,EAAY,UAAU,cAAgB,SAAUh3B,EAAS,CACrD,IAAI+M,EAAQ,KACRgT,EAAW/f,EAAQ,SAAUwf,EAAexf,EAAQ,aAAcuM,EAAOvM,EAAQ,KAAM9H,EAAK8H,EAAQ,WAAYsqB,EAAapyB,IAAO,OAAS,GAAOA,EAAIk/B,EAAehsB,GAAOpL,EAAS,CAAC,WAAY,eAAgB,OAAQ,YAAY,CAAC,EACzO4f,EAAQ,KAAK,eAAeG,EAAUP,CAAY,EAClD6X,EAAcpsB,EAASA,EAAS,CAAA,EAAImsB,CAAY,EAAG,CAAE,kBAAmB,GAAM,GAO9E,OAAO7qB,EAAS,KAAe,OAAOA,GAAS,SAC3CA,EACE,KAAK,SAASA,CAAI,EAAG,MAAOqT,EAAO,WAAY0K,CAAU,CAAE,EACjEgN,EACJ,OAAO,IAAIrH,GAAW,SAAUv6B,EAAU,CACtC,OAAOqX,EAAM,MAAM9B,EAASA,EAAS,CAAE,EAAEosB,CAAW,EAAG,CAAE,UAAW,GAAM,SAAU,SAAUE,EAAM,CAC5F,GAEA,EAAAD,GACIzB,GAAajW,EAAO,CAAE,KAAM0X,GAAe,KAAgC,OAASA,EAAW,QAAU,CAAE,KAAMC,EAAK,MAAM,CAAE,GAGlI,KAAIl8B,EAAS,CACT,KAAMk8B,EAAK,OACX,SAAU,CAAC,CAACA,EAAK,QACzC,EACwBA,EAAK,UACLl8B,EAAO,QAAU6yB,GAAeqJ,EAAK,QAAQ,IAAI,SAAU1/B,EAAO,CAAE,OAAOA,EAAM,OAAQ,CAAE,CAAC,GAEhGy/B,EAAaC,EACb7hC,EAAS,KAAK2F,CAAM,EACvB,CAAA,CAAE,CAAC,CACpB,CAAS,CACT,EACI27B,EAAY,UAAU,aAAe,SAAUh3B,EAASsqB,EAAY,CAChE,OAAIA,IAAe,SAAUA,EAAa,CAAC,CAACtqB,EAAQ,YAC7C,KAAK,KAAKiL,EAASA,EAAS,GAAIjL,CAAO,EAAG,CAAE,MAAO,KAAK,eAAeA,EAAQ,SAAUA,EAAQ,YAAY,EAAG,OAAQA,EAAQ,GAAI,WAAYsqB,CAAY,CAAA,CAAC,CAC5K,EACI0M,EAAY,UAAU,WAAa,SAAU9+B,EAAI,CAC7C,IAAI8R,EAAK9R,EAAG,GAAIumB,EAAOvmB,EAAG,KAAM8H,EAAUoL,GAAOlT,EAAI,CAAC,KAAM,MAAM,CAAC,EACnE,OAAO,KAAK,MAAM,OAAO,OAAO8H,EAAS,CACrC,OAAQgK,GAAM,aACd,OAAQyU,CACX,CAAA,CAAC,CACV,EACIuY,EAAY,UAAU,cAAgB,SAAU9+B,EAAI,CAChD,IAAI8R,EAAK9R,EAAG,GAAIumB,EAAOvmB,EAAG,KAAM6nB,EAAW7nB,EAAG,SAAUsnB,EAAetnB,EAAG,aAAc8H,EAAUoL,GAAOlT,EAAI,CAAC,KAAM,OAAQ,WAAY,cAAc,CAAC,EACvJ,OAAO,KAAK,MAAM,OAAO,OAAO8H,EAAS,CACrC,MAAO,KAAK,eAAe+f,EAAUP,CAAY,EACjD,OAAQxV,EACR,OAAQyU,CACX,CAAA,CAAC,CACV,EACIuY,EAAY,UAAU,YAAc,SAAUh3B,EAASw3B,EAAQ,CAC3D,OAAO,KAAK,MAAM,CACd,OAAQ,SAAUvW,EAAO,CACrB,IAAIjpB,EAAQipB,EAAM,UAAUjhB,CAAO,EAC/Bye,EAAO+Y,EAAOx/B,CAAK,EACvB,OAAuBymB,GAAS,KACrBzmB,GACXipB,EAAM,WAAWhW,EAASA,EAAS,CAAE,EAAEjL,CAAO,EAAG,CAAE,KAAMye,CAAM,CAAA,CAAC,EACzDA,EACV,CACb,CAAS,CACT,EACIuY,EAAY,UAAU,eAAiB,SAAUh3B,EAASw3B,EAAQ,CAC9D,OAAO,KAAK,MAAM,CACd,OAAQ,SAAUvW,EAAO,CACrB,IAAIjpB,EAAQipB,EAAM,aAAajhB,CAAO,EAClCye,EAAO+Y,EAAOx/B,CAAK,EACvB,OAAuBymB,GAAS,KACrBzmB,GACXipB,EAAM,cAAchW,EAASA,EAAS,CAAE,EAAEjL,CAAO,EAAG,CAAE,KAAMye,CAAM,CAAA,CAAC,EAC5DA,EACV,CACb,CAAS,CACT,EACWuY,CACX,EAAC,EAEG,WAAW,UAAY,KACvBA,GAAY,UAAU,mBAAqBlV,IC9I/C,IAAI2V,GAAmC,SAAU5qB,EAAQ,CACrD9B,GAAU0sB,EAAmB5qB,CAAM,EACnC,SAAS4qB,EAAkB3qB,EAASpR,EAAMkkB,EAAO1C,EAAW,CACxD,IAAIhlB,EAEA6U,EAAQF,EAAO,KAAK,KAAMC,CAAO,GAAK,KAK1C,GAJAC,EAAM,QAAUD,EAChBC,EAAM,KAAOrR,EACbqR,EAAM,MAAQ6S,EACd7S,EAAM,UAAYmQ,EACd,MAAM,QAAQnQ,EAAM,IAAI,EAAG,CAC3BA,EAAM,QAAUA,EAAM,QACtB,QAAS7W,EAAI6W,EAAM,KAAK,OAAS,EAAG7W,GAAK,EAAG,EAAEA,EAC1C6W,EAAM,SAAW7U,EAAK,CAAE,EAAEA,EAAG6U,EAAM,KAAK7W,CAAC,CAAC,EAAI6W,EAAM,QAAS7U,EAEpE,MAEG6U,EAAM,QAAUA,EAAM,KAI1B,OAAAA,EAAM,UAAY0qB,EAAkB,UAC7B1qB,CACV,CACD,OAAO0qB,CACX,EAAE,KAAK,ECzBIC,EAAS,OAAO,UAAU,eAC9B,SAASC,GAAU3/B,EAAO,CAC7B,OAAOA,GAAU,IACrB,CAEO,SAAS4/B,GAAwB1/B,EAAIuM,EAAS,CACjD,IAAIozB,EAAa3/B,EAAG,WAAY8R,EAAK9R,EAAG,GAAI4/B,EAAM5/B,EAAG,IACrD,GAAI,OAAO2/B,GAAe,WAClBpzB,IACAA,EAAQ,UACHkzB,GAAU3tB,CAAE,EACN2tB,GAAUG,CAAG,EACV,OADc,CAAE,IAAKA,CAAK,EADnB,CAAE,GAAI9tB,CAAI,GAK/B2tB,GAAU3tB,CAAE,GAAK,CAAC2tB,GAAUG,CAAG,IAC/B9tB,EAAK8tB,GAEL,CAACH,GAAU3tB,CAAE,GACb,MAAO,GAAG,OAAO6tB,EAAY,GAAG,EAAE,OAAO,OAAO7tB,GAAO,UAAY,OAAOA,GAAO,SAC7EA,EACE,KAAK,UAAUA,CAAE,CAAC,CAGpC,CACA,IAAI+tB,GAAgB,CAChB,iBAAkBH,GAClB,YAAa,GACb,cAAe,GAGf,gBAAiB,EACrB,EACO,SAASI,GAAgBz6B,EAAQ,CACpC,OAAO+1B,GAAQyE,GAAex6B,CAAM,CACxC,CACO,SAAS06B,GAAsB16B,EAAQ,CAC1C,IAAIvF,EAAQuF,EAAO,gBACnB,OAAOvF,IAAU,OAAS+/B,GAAc,gBAAkB//B,CAC9D,CACO,SAASkgC,GAA2B9gC,EAAO+gC,EAAmB,CACjE,OAAO3U,EAAY2U,CAAiB,EAChC/gC,EAAM,IAAI+gC,EAAkB,MAAO,YAAY,EAC7CA,GAAqBA,EAAkB,UACjD,CACO,IAAIC,GAAwB,qBAC5B,SAASC,GAAuBC,EAAgB,CACnD,IAAInpB,EAAQmpB,EAAe,MAAMF,EAAqB,EACtD,OAAOjpB,EAAQA,EAAM,CAAC,EAAImpB,CAC9B,CACO,SAASC,GAA0Bjc,EAAcjhB,EAAQ6hB,EAAW,CACvE,OAAIoC,EAAgBjkB,CAAM,EACfiB,EAAQjB,CAAM,EACjBA,EAAO,MAAM,SAAUyd,EAAM,CACzB,OAAOyf,GAA0Bjc,EAAcxD,EAAMoE,CAAS,CAC9E,CAAa,EACCZ,EAAa,WAAW,MAAM,SAAUoI,EAAO,CAC7C,GAAIe,GAAQf,CAAK,GAAKzH,GAAcyH,EAAOxH,CAAS,EAAG,CACnD,IAAInoB,EAAMwwB,GAAuBb,CAAK,EACtC,OAAQgT,EAAO,KAAKr8B,EAAQtG,CAAG,IAC1B,CAAC2vB,EAAM,cACJ6T,GAA0B7T,EAAM,aAAcrpB,EAAOtG,CAAG,EAAGmoB,CAAS,EAC/E,CAMD,MAAO,EACvB,CAAa,EAEF,EACX,CACO,SAASsb,GAAwBxgC,EAAO,CAC3C,OAAOsnB,EAAgBtnB,CAAK,GAAK,CAACwrB,EAAYxrB,CAAK,GAAK,CAACsE,EAAQtE,CAAK,CAC1E,CACO,SAASygC,IAA4B,CACxC,OAAO,IAAIrK,EACf,CACO,SAASsK,GAAuB7a,EAAU6B,EAAW,CAGxD,IAAIQ,EAAcL,GAAkBqG,GAAuBrI,CAAQ,CAAC,EACpE,MAAO,CACH,YAAaqC,EACb,eAAgB,SAAU7b,EAAM,CAC5B,IAAIwiB,EAAM3G,EAAY7b,CAAI,EAC1B,MAAI,CAACwiB,GAAOnH,IACRmH,EAAMnH,EAAU,OAAOrb,CAAI,GAExBwiB,GAAO,IACjB,CACT,CACA,CCvFA,IAAI8R,GAAS,OAAO,OAAO,IAAI,EAC3BC,GAAc,UAAY,CAAE,OAAOD,IACnCE,GAAa,OAAO,OAAO,IAAI,EAC/BC,GAA6B,UAAY,CACzC,SAASA,EAAYC,EAAUC,EAAO,CAClC,IAAIjsB,EAAQ,KACZ,KAAK,SAAWgsB,EAChB,KAAK,MAAQC,EACb,KAAK,KAAO,OAAO,OAAO,IAAI,EAI9B,KAAK,QAAU,OAAO,OAAO,IAAI,EAEjC,KAAK,KAAO,OAAO,OAAO,IAAI,EAG9B,KAAK,cAAgB,SAAUb,EAAmBG,EAAgB,CAC9D,OAAOjF,GAAgB7P,EAAY2U,CAAiB,EAChDprB,EAAM,IAAIorB,EAAkB,MAAOG,CAAc,EAC/CH,GAAqBA,EAAkBG,CAAc,CAAC,CACxE,EAIQ,KAAK,QAAU,SAAUW,EAAU,CAC/B,OAAOzV,EAAYyV,CAAQ,EACvBlsB,EAAM,IAAIksB,EAAS,KAAK,EACtB,OAAOA,GAAa,QACtC,EAKQ,KAAK,YAAc,SAAUC,EAAcC,EAAgB,CACvD,GAAI,OAAOD,GAAiB,SACxB,OAAO3V,GAAc2V,CAAY,EAErC,GAAI1V,EAAY0V,CAAY,EACxB,OAAOA,EAEX,IAAIlvB,EAAK+C,EAAM,SAAS,SAASmsB,CAAY,EAAE,CAAC,EAChD,GAAIlvB,EAAI,CACJ,IAAIxB,EAAM+a,GAAcvZ,CAAE,EAC1B,OAAImvB,GACApsB,EAAM,MAAM/C,EAAIkvB,CAAY,EAEzB1wB,CACV,CACb,CACK,CAID,OAAAswB,EAAY,UAAU,SAAW,UAAY,CACzC,OAAO7tB,EAAS,CAAA,EAAI,KAAK,IAAI,CACrC,EACI6tB,EAAY,UAAU,IAAM,SAAUM,EAAQ,CAC1C,OAAO,KAAK,OAAOA,EAAQ,EAAI,IAAM,MAC7C,EACIN,EAAY,UAAU,IAAM,SAAUM,EAAQrU,EAAW,CAErD,GADA,KAAK,MAAM,OAAOqU,EAAQrU,CAAS,EAC/B2S,EAAO,KAAK,KAAK,KAAM0B,CAAM,EAAG,CAChC,IAAIC,EAAc,KAAK,KAAKD,CAAM,EAClC,GAAIC,GAAe3B,EAAO,KAAK2B,EAAatU,CAAS,EACjD,OAAOsU,EAAYtU,CAAS,CAEnC,CACD,GAAIA,IAAc,cACd2S,EAAO,KAAK,KAAK,SAAS,kBAAmB0B,CAAM,EACnD,OAAO,KAAK,SAAS,kBAAkBA,CAAM,EAEjD,GAAI,gBAAgBE,GAChB,OAAO,KAAK,OAAO,IAAIF,EAAQrU,CAAS,CAEpD,EACI+T,EAAY,UAAU,OAAS,SAAUM,EAAQG,EAAmB,CAQhE,GAFIA,GACA,KAAK,MAAM,OAAOH,EAAQ,UAAU,EACpC1B,EAAO,KAAK,KAAK,KAAM0B,CAAM,EAC7B,OAAO,KAAK,KAAKA,CAAM,EAE3B,GAAI,gBAAgBE,GAChB,OAAO,KAAK,OAAO,OAAOF,EAAQG,CAAiB,EAEvD,GAAI,KAAK,SAAS,kBAAkBH,CAAM,EACtC,OAAO,OAAO,OAAO,IAAI,CAErC,EACIN,EAAY,UAAU,MAAQ,SAAUvY,EAAOC,EAAO,CAClD,IAAIzT,EAAQ,KACRqsB,EAEA5V,EAAYjD,CAAK,IACjBA,EAAQA,EAAM,OACdiD,EAAYhD,CAAK,IACjBA,EAAQA,EAAM,OAClB,IAAIgZ,EAAW,OAAOjZ,GAAU,SAAW,KAAK,OAAQ6Y,EAAS7Y,CAAO,EAAGA,EACvEkZ,EAAW,OAAOjZ,GAAU,SAAW,KAAK,OAAQ4Y,EAAS5Y,CAAO,EAAGA,EAG3E,GAAKiZ,EAELzsB,CAAAA,EAAU,OAAOosB,GAAW,SAAU,CAAC,EACvC,IAAIM,EAAS,IAAItL,GAAWuL,EAAqB,EAAE,MAAMH,EAAUC,CAAQ,EAI3E,GADA,KAAK,KAAKL,CAAM,EAAIM,EAChBA,IAAWF,IACX,OAAO,KAAK,KAAKJ,CAAM,EACnB,KAAK,MAAM,SAAS,CACpB,IAAIQ,EAAkB,OAAO,OAAO,IAAI,EAInCJ,IACDI,EAAgB,SAAW,GAG/B,OAAO,KAAKH,CAAQ,EAAE,QAAQ,SAAUnB,EAAgB,CACpD,GAAI,CAACkB,GACDA,EAASlB,CAAc,IAAMoB,EAAOpB,CAAc,EAAG,CAGrDsB,EAAgBtB,CAAc,EAAI,EAQlC,IAAIvT,EAAYsT,GAAuBC,CAAc,EACjDvT,IAAcuT,GACd,CAACvrB,EAAM,SAAS,WAAW2sB,EAAO,WAAY3U,CAAS,IACvD6U,EAAgB7U,CAAS,EAAI,GAK7B2U,EAAOpB,CAAc,IAAM,QAAU,EAAEvrB,aAAiBusB,KACxD,OAAOI,EAAOpB,CAAc,CAEnC,CACrB,CAAiB,EACGsB,EAAgB,YAChB,EAAEJ,GAAYA,EAAS,aAKvB,KAAK,SAAS,kBAAkBJ,CAAM,IAAMM,EAAO,YACnD,OAAOE,EAAgB,WAE3B,OAAO,KAAKA,CAAe,EAAE,QAAQ,SAAU7U,EAAW,CACtD,OAAOhY,EAAM,MAAM,MAAMqsB,EAAQrU,CAAS,CAC9D,CAAiB,CACJ,EAEb,EACI+T,EAAY,UAAU,OAAS,SAAUM,EAAQ/f,EAAQ,CACrD,IAAItM,EAAQ,KACRssB,EAAc,KAAK,OAAOD,CAAM,EACpC,GAAIC,EAAa,CACb,IAAIQ,EAAkB,OAAO,OAAO,IAAI,EACpCC,EAAgB,GAChBC,EAAe,GACfC,EAAkB,CAClB,OAAQrB,GACR,WAAYE,GACZ,YAAarV,EACb,YAAa,KAAK,YAClB,QAAS,KAAK,QACd,UAAW,SAAUyW,EAAoB1tB,EAAM,CAC3C,OAAOQ,EAAM,SAAS,UAAU,OAAOktB,GAAuB,SAC1D,CACI,UAAWA,EACX,KAAM1tB,GAAQgX,GAAc6V,CAAM,CACrC,EACCa,EAAoB,CAAE,MAAOltB,CAAK,CAAE,CAC7C,CACjB,EAiEY,GAhEA,OAAO,KAAKssB,CAAW,EAAE,QAAQ,SAAUf,EAAgB,CACvD,IAAIvT,EAAYsT,GAAuBC,CAAc,EACjD4B,EAAab,EAAYf,CAAc,EAC3C,GAAI4B,IAAe,OAEnB,KAAIC,EAAS,OAAO9gB,GAAW,WAAaA,EAAUA,EAAOif,CAAc,GAAKjf,EAAO0L,CAAS,EAChG,GAAIoV,EAAQ,CACR,IAAIC,EAAWD,IAAWvB,GAAcD,GAAUwB,EAAO9G,GAAgB6G,CAAU,EAAGjvB,EAASA,EAAS,CAAE,EAAE+uB,CAAe,EAAG,CAAE,UAAWjV,EAAW,eAAgBuT,EAAgB,QAASvrB,EAAM,WAAWqsB,EAAQd,CAAc,CAAG,CAAA,CAAC,EAC1O,GAAI8B,IAAavB,GACb9rB,EAAM,MAAM,MAAMqsB,EAAQd,CAAc,UAGpC8B,IAAazB,KACbyB,EAAW,QACXA,IAAaF,IACbL,EAAgBvB,CAAc,EAAI8B,EAClCN,EAAgB,GAChBI,EAAaE,EACT,WAAW,UAAY,IAAO,CAC9B,IAAIC,EAAiB,SAAU7xB,EAAK,CAChC,GAAIuE,EAAM,OAAOvE,EAAI,KAAK,IAAM,OAC5B,kBAAW,UAAY,IAASwE,EAAU,KAAK,EAAGxE,CAAG,EAC9C,EAE/C,EACgC,GAAIgb,EAAY4W,CAAQ,EACpBC,EAAeD,CAAQ,UAElB,MAAM,QAAQA,CAAQ,EAI3B,QAFIE,EAAgB,GAChBC,EAAmB,OACdtsB,EAAK,EAAGusB,EAAaJ,EAAUnsB,EAAKusB,EAAW,OAAQvsB,IAAM,CAClE,IAAIjW,EAAQwiC,EAAWvsB,CAAE,EACzB,GAAIuV,EAAYxrB,CAAK,GAEjB,GADAsiC,EAAgB,GACZD,EAAeriC,CAAK,EACpB,cAKA,OAAOA,GAAU,UAAcA,EAAO,CACtC,IAAIgS,EAAK+C,EAAM,SAAS,SAAS/U,CAAK,EAAE,CAAC,EAErCgS,IACAuwB,EAAmBviC,EAE1B,CAEL,GAAIsiC,GAAiBC,IAAqB,OAAW,CACjD,WAAW,UAAY,IAASvtB,EAAU,KAAK,EAAGutB,CAAgB,EAClE,KACH,CACJ,CAER,CAGZ,CACGL,IAAe,SACfH,EAAe,IAEnC,CAAa,EACGD,EACA,YAAK,MAAMV,EAAQS,CAAe,EAC9BE,IACI,gBAAgBT,GAChB,KAAK,KAAKF,CAAM,EAAI,OAGpB,OAAO,KAAK,KAAKA,CAAM,EAE3B,KAAK,MAAM,MAAMA,EAAQ,UAAU,GAEhC,EAEd,CACD,MAAO,EACf,EAOIN,EAAY,UAAU,OAAS,SAAUM,EAAQrU,EAAW/tB,EAAM,CAC9D,IAAIkB,EACAmhC,EAAc,KAAK,OAAOD,CAAM,EACpC,GAAIC,EAAa,CACb,IAAI1T,EAAW,KAAK,cAAc0T,EAAa,YAAY,EACvDf,EAAiBvT,GAAa/tB,EAC9B,KAAK,SAAS,kBAAkB,CAAE,SAAU2uB,EAAU,UAAWZ,EAAW,KAAM/tB,EAAM,EACtF+tB,EACN,OAAO,KAAK,OAAOqU,EAAQd,GAAkBpgC,EAAK,CAAE,EAChDA,EAAGogC,CAAc,EAAIM,GACrB1gC,GAAM0gC,EAAW,CACxB,CACD,MAAO,EACf,EACIE,EAAY,UAAU,MAAQ,SAAU94B,EAASy6B,EAAO,CACpD,IAAIC,EAAU,GACd,OAAI16B,EAAQ,KACJ03B,EAAO,KAAK,KAAK,KAAM13B,EAAQ,EAAE,IACjC06B,EAAU,KAAK,OAAO16B,EAAQ,GAAIA,EAAQ,UAAWA,EAAQ,IAAI,GAEjE,gBAAgBs5B,IAAS,OAASmB,IAClCC,EAAU,KAAK,OAAO,MAAM16B,EAASy6B,CAAK,GAAKC,IAM/C16B,EAAQ,WAAa06B,IACrB,KAAK,MAAM,MAAM16B,EAAQ,GAAIA,EAAQ,WAAa,UAAU,GAG7D06B,CACf,EACI5B,EAAY,UAAU,MAAQ,UAAY,CACtC,KAAK,QAAQ,IAAI,CACzB,EACIA,EAAY,UAAU,QAAU,UAAY,CACxC,IAAI/rB,EAAQ,KACR9Y,EAAM,KAAK,WACX0mC,EAAe,CAAA,EACnB,YAAK,aAAY,EAAG,QAAQ,SAAU3wB,EAAI,CACjC0tB,EAAO,KAAK3qB,EAAM,SAAS,kBAAmB/C,CAAE,GACjD2wB,EAAa,KAAK3wB,CAAE,CAEpC,CAAS,EACG2wB,EAAa,SACb1mC,EAAI,OAAS,CAAE,aAAc0mC,EAAa,KAAM,CAAA,GAE7C1mC,CACf,EACI6kC,EAAY,UAAU,QAAU,SAAU8B,EAAS,CAC/C,IAAI7tB,EAAQ,KAMZ,GALA,OAAO,KAAK,KAAK,IAAI,EAAE,QAAQ,SAAUqsB,EAAQ,CACvCwB,GAAWlD,EAAO,KAAKkD,EAASxB,CAAM,GACxCrsB,EAAM,OAAOqsB,CAAM,CAEnC,CAAS,EACGwB,EAAS,CACT,IAAIC,EAASD,EAAQ,OAAQE,EAAS1vB,GAAOwvB,EAAS,CAAC,QAAQ,CAAC,EAChE,OAAO,KAAKE,CAAM,EAAE,QAAQ,SAAU1B,EAAQ,CAC1CrsB,EAAM,MAAMqsB,EAAQ0B,EAAO1B,CAAM,CAAC,CAClD,CAAa,EACGyB,GACAA,EAAO,aAAa,QAAQ,KAAK,OAAQ,IAAI,CAEpD,CACT,EACI/B,EAAY,UAAU,OAAS,SAAUiC,EAAQ,CAC7C,OAAQ,KAAK,QAAQA,CAAM,GAAK,KAAK,QAAQA,CAAM,GAAK,GAAK,CACrE,EACIjC,EAAY,UAAU,QAAU,SAAUiC,EAAQ,CAC9C,GAAI,KAAK,QAAQA,CAAM,EAAI,EAAG,CAC1B,IAAIntB,EAAQ,EAAE,KAAK,QAAQmtB,CAAM,EACjC,OAAKntB,GACD,OAAO,KAAK,QAAQmtB,CAAM,EACvBntB,CACV,CACD,MAAO,EACf,EAGIkrB,EAAY,UAAU,aAAe,SAAUkC,EAAK,CAChD,OAAIA,IAAQ,SAAUA,EAAM,IAAI,KAChC,OAAO,KAAK,KAAK,OAAO,EAAE,QAAQA,EAAI,IAAKA,CAAG,EAC1C,gBAAgB1B,GAChB,KAAK,OAAO,aAAa0B,CAAG,EAM5B,OAAO,KAAK,KAAK,SAAS,iBAAiB,EAAE,QAAQA,EAAI,IAAKA,CAAG,EAE9DA,CACf,EAKIlC,EAAY,UAAU,GAAK,UAAY,CACnC,IAAI/rB,EAAQ,KACRiuB,EAAM,KAAK,eACXC,EAAW,KAAK,WACpBD,EAAI,QAAQ,SAAUhxB,EAAI,CAClB0tB,EAAO,KAAKuD,EAAUjxB,CAAE,IAIxB,OAAO,KAAK+C,EAAM,gBAAgB/C,CAAE,CAAC,EAAE,QAAQgxB,EAAI,IAAKA,CAAG,EAG3D,OAAOC,EAASjxB,CAAE,EAElC,CAAS,EACD,IAAIkxB,EAAc,OAAO,KAAKD,CAAQ,EACtC,GAAIC,EAAY,OAAQ,CAEpB,QADIC,EAAS,KACNA,aAAkB7B,IACrB6B,EAASA,EAAO,OACpBD,EAAY,QAAQ,SAAUlxB,EAAI,CAAE,OAAOmxB,EAAO,OAAOnxB,CAAE,CAAE,CAAE,CAClE,CACD,OAAOkxB,CACf,EACIpC,EAAY,UAAU,gBAAkB,SAAUM,EAAQ,CACtD,GAAI,CAAC1B,EAAO,KAAK,KAAK,KAAM0B,CAAM,EAAG,CACjC,IAAIgC,EAAW,KAAK,KAAKhC,CAAM,EAAI,OAAO,OAAO,IAAI,EACjD3e,EAAO,KAAK,KAAK2e,CAAM,EAC3B,GAAI,CAAC3e,EACD,OAAO2gB,EACX,IAAIC,EAAY,IAAI,IAAI,CAAC5gB,CAAI,CAAC,EAG9B4gB,EAAU,QAAQ,SAAUpnC,EAAK,CACzBuvB,EAAYvvB,CAAG,IACfmnC,EAAQnnC,EAAI,KAAK,EAAI,IASrBqrB,EAAgBrrB,CAAG,GACnB,OAAO,KAAKA,CAAG,EAAE,QAAQ,SAAUc,EAAK,CACpC,IAAI4pB,EAAQ1qB,EAAIc,CAAG,EAGfuqB,EAAgBX,CAAK,GACrB0c,EAAU,IAAI1c,CAAK,CAE/C,CAAqB,CAErB,CAAa,CACJ,CACD,OAAO,KAAK,KAAKya,CAAM,CAC/B,EACIN,EAAY,UAAU,aAAe,UAAY,CAC7C,OAAO,KAAK,MAAM,SAAS,YAAY,SAAS,CACxD,EACWA,CACX,EAAC,EAeGwC,GAA4B,UAAY,CACxC,SAASA,EAAWC,EAASl/B,EAAQ,CAC7BA,IAAW,SAAUA,EAAS,MAClC,KAAK,QAAUk/B,EACf,KAAK,OAASl/B,EACd,KAAK,EAAI,KACT,KAAK,aAAY,CACpB,CACD,OAAAi/B,EAAW,UAAU,aAAe,UAAY,CAC5C,KAAK,EAAI,KAAK,QAAU1S,GAAG,EAAK,KAChC,KAAK,SAAW,IAAItK,GAAKS,EAAa,CAC9C,EACIuc,EAAW,UAAU,OAAS,SAAUlC,EAAQd,EAAgB,CAC5D,GAAI,KAAK,EAAG,CACR,KAAK,EAAEkD,GAAWpC,EAAQd,CAAc,CAAC,EACzC,IAAIvT,EAAYsT,GAAuBC,CAAc,EACjDvT,IAAcuT,GAMd,KAAK,EAAEkD,GAAWpC,EAAQrU,CAAS,CAAC,EAEpC,KAAK,QACL,KAAK,OAAO,OAAOqU,EAAQd,CAAc,CAEhD,CACT,EACIgD,EAAW,UAAU,MAAQ,SAAUlC,EAAQd,EAAgB,CACvD,KAAK,GACL,KAAK,EAAE,MAAMkD,GAAWpC,EAAQd,CAAc,EAQ9CA,IAAmB,WAAa,SAAW,UAAU,CAEjE,EACWgD,CACX,EAAC,EACD,SAASE,GAAWpC,EAAQd,EAAgB,CAIxC,OAAOA,EAAiB,IAAMc,CAClC,CACO,SAASqC,GAA+BrkC,EAAOskC,EAAU,CACxDC,GAAsBvkC,CAAK,GAS3BA,EAAM,MAAM,OAAOskC,EAAU,UAAU,CAE/C,EACC,SAAU5C,EAAa,CAEpB,IAAI8C,EAAsB,SAAU/uB,EAAQ,CACxC9B,GAAU6wB,EAAM/uB,CAAM,EACtB,SAAS+uB,EAAK1jC,EAAI,CACd,IAAI6gC,EAAW7gC,EAAG,SAAUiqB,EAAKjqB,EAAG,cAAe2jC,EAAgB1Z,IAAO,OAAS,GAAOA,EAAIwP,EAAOz5B,EAAG,KACpG6U,EAAQF,EAAO,KAAK,KAAMksB,EAAU,IAAIuC,GAAWO,CAAa,CAAC,GAAK,KAC1E,OAAA9uB,EAAM,MAAQ,IAAI+uB,GAAM/uB,CAAK,EAC7BA,EAAM,YAAc,IAAIuR,GAAKS,EAAa,EACtC4S,GACA5kB,EAAM,QAAQ4kB,CAAI,EACf5kB,CACV,CACD,OAAA6uB,EAAK,UAAU,SAAW,SAAUG,EAASC,EAAQ,CAIjD,OAAO,KAAK,MAAM,SAASD,EAASC,CAAM,CACtD,EACQJ,EAAK,UAAU,YAAc,UAAY,CAErC,OAAO,IACnB,EACQA,EAAK,UAAU,WAAa,UAAY,CACpC,OAAO,KAAK,YAAY,YAAY,SAAS,CACzD,EACeA,CACf,EAAM9C,CAAW,EACbA,EAAY,KAAO8C,CACvB,GAAG9C,KAAgBA,GAAc,CAAE,EAAC,EAGpC,IAAIQ,GAAuB,SAAUzsB,EAAQ,CACzC9B,GAAUuuB,EAAOzsB,CAAM,EACvB,SAASysB,EAAMtvB,EAAI3N,EAAQ2/B,EAAQhD,EAAO,CACtC,IAAIjsB,EAAQF,EAAO,KAAK,KAAMxQ,EAAO,SAAU28B,CAAK,GAAK,KACzD,OAAAjsB,EAAM,GAAK/C,EACX+C,EAAM,OAAS1Q,EACf0Q,EAAM,OAASivB,EACfjvB,EAAM,MAAQisB,EACdgD,EAAOjvB,CAAK,EACLA,CACV,CACD,OAAAusB,EAAM,UAAU,SAAW,SAAUyC,EAASC,EAAQ,CAClD,OAAO,IAAI1C,EAAMyC,EAAS,KAAMC,EAAQ,KAAK,KAAK,CAC1D,EACI1C,EAAM,UAAU,YAAc,SAAUyC,EAAS,CAC7C,IAAIhvB,EAAQ,KAER1Q,EAAS,KAAK,OAAO,YAAY0/B,CAAO,EAC5C,OAAIA,IAAY,KAAK,IACb,KAAK,MAAM,SAKX,OAAO,KAAK,KAAK,IAAI,EAAE,QAAQ,SAAU3C,EAAQ,CAC7C,IAAI6C,EAAiBlvB,EAAM,KAAKqsB,CAAM,EAClC8C,EAAoB7/B,EAAO,OAAU+8B,CAAM,EAC1C8C,EAQKD,EAUDA,IAAmBC,GAIxB,OAAO,KAAKD,CAAc,EAAE,QAAQ,SAAU3D,EAAgB,CACrD9D,GAAMyH,EAAe3D,CAAc,EAAG4D,EAAkB5D,CAAc,CAAC,GACxEvrB,EAAM,MAAM,MAAMqsB,EAAQd,CAAc,CAExE,CAAyB,GAbDvrB,EAAM,MAAM,MAAMqsB,EAAQ,UAAU,EACpC,OAAO,KAAK8C,CAAiB,EAAE,QAAQ,SAAU5D,EAAgB,CAC7DvrB,EAAM,MAAM,MAAMqsB,EAAQd,CAAc,CACpE,CAAyB,GAVDvrB,EAAM,OAAOqsB,CAAM,CAsB3C,CAAiB,EAEE/8B,GAGPA,IAAW,KAAK,OACT,KAEJA,EAAO,SAAS,KAAK,GAAI,KAAK,MAAM,CACnD,EACIi9B,EAAM,UAAU,SAAW,UAAY,CACnC,OAAOruB,EAASA,EAAS,CAAA,EAAI,KAAK,OAAO,UAAU,EAAG,KAAK,IAAI,CACvE,EACIquB,EAAM,UAAU,gBAAkB,SAAUF,EAAQ,CAChD,IAAI+C,EAAa,KAAK,OAAO,gBAAgB/C,CAAM,EACnD,OAAO1B,EAAO,KAAK,KAAK,KAAM0B,CAAM,EAAInuB,EAASA,EAAS,CAAE,EAAEkxB,CAAU,EAAGtvB,EAAO,UAAU,gBAAgB,KAAK,KAAMusB,CAAM,CAAC,EAAI+C,CAC1I,EACI7C,EAAM,UAAU,WAAa,UAAY,CAErC,QADIz7B,EAAI,KAAK,OACNA,EAAE,QACLA,EAAIA,EAAE,OACV,OAAOA,EAAE,WAAW,MAAMA,EAE1B,SAAS,CACjB,EACWy7B,CACX,EAAER,EAAW,EAKTgD,GAAuB,SAAUjvB,EAAQ,CACzC9B,GAAU+wB,EAAOjvB,CAAM,EACvB,SAASivB,EAAMrhB,EAAM,CACjB,OAAO5N,EAAO,KAAK,KAAM,oBAAqB4N,EAAM,UAAY,GAAK,IAAI6gB,GAAW7gB,EAAK,MAAM,QAASA,EAAK,KAAK,CAAC,GAAK,IAC3H,CACD,OAAAqhB,EAAM,UAAU,YAAc,UAAY,CAEtC,OAAO,IACf,EACIA,EAAM,UAAU,MAAQ,SAAUvb,EAAOC,EAAO,CAM5C,OAAO,KAAK,OAAO,MAAMD,EAAOC,CAAK,CAC7C,EACWsb,CACX,EAAExC,EAAK,EACP,SAASK,GAAsByC,EAAgBC,EAAgB/N,EAAU,CACrE,IAAIgO,EAAgBF,EAAe9N,CAAQ,EACvCiO,EAAgBF,EAAe/N,CAAQ,EAM3C,OAAOkG,GAAM8H,EAAeC,CAAa,EAAID,EAAgBC,CACjE,CACO,SAASZ,GAAsBvkC,EAAO,CAEzC,MAAO,CAAC,EAAEA,aAAiB0hC,IAAe1hC,EAAM,MAAM,QAC1D,CCzpBA,SAASmC,GAAYvB,EAAO,CACxB,OAAIwkC,EAAgBxkC,CAAK,EACdsE,EAAQtE,CAAK,EAChBA,EAAM,MAAM,CAAC,EACXiT,EAAS,CAAE,UAAW,OAAO,eAAejT,CAAK,CAAC,EAAIA,CAAK,EAE9DA,CACX,CAwDA,IAAIykC,GAA6B,UAAY,CACzC,SAASA,GAAc,CAGnB,KAAK,MAAQ,IAAKzd,GAAgB,QAAU,KAE5C,KAAK,KAAO,IAAIV,GAAKS,EAAa,EAGlC,KAAK,OAAS,IAAI,QAGlB,KAAK,WAAa,IAAI,IAEtB,KAAK,MAAQ,KAAK,MAAM,CAAE,CAAA,CAC7B,CACD,OAAA0d,EAAY,UAAU,QAAU,SAAUzkC,EAAO,CAC7C,OAAOwkC,EAAgBxkC,CAAK,GAAK,KAAK,MAAM,IAAIA,CAAK,CAC7D,EACIykC,EAAY,UAAU,KAAO,SAAUzkC,EAAO,CAC1C,GAAIwkC,EAAgBxkC,CAAK,EAAG,CACxB,IAAIqG,EAAO9E,GAAYvB,CAAK,EAC5B,YAAK,OAAO,IAAIqG,EAAMrG,CAAK,EACpBqG,CACV,CACD,OAAOrG,CACf,EACIykC,EAAY,UAAU,MAAQ,SAAUzkC,EAAO,CAC3C,IAAI+U,EAAQ,KACZ,GAAIyvB,EAAgBxkC,CAAK,EAAG,CACxB,IAAI0kC,EAAW,KAAK,OAAO,IAAI1kC,CAAK,EACpC,GAAI0kC,EACA,OAAOA,EACX,IAAIxoC,EAAQ,OAAO,eAAe8D,CAAK,EACvC,OAAQ9D,EAAK,CACT,KAAK,MAAM,UAAW,CAClB,GAAI,KAAK,MAAM,IAAI8D,CAAK,EACpB,OAAOA,EACX,IAAI2Z,EAAQ3Z,EAAM,IAAI,KAAK,MAAO,IAAI,EAIlCqZ,EAAO,KAAK,KAAK,YAAYM,CAAK,EACtC,OAAKN,EAAK,QACN,KAAK,MAAM,IAAKA,EAAK,MAAQM,CAAK,EAI9B,WAAW,UAAY,IACvB,OAAO,OAAOA,CAAK,GAGpBN,EAAK,KACf,CACD,KAAK,KACL,KAAK,OAAO,UAAW,CACnB,GAAI,KAAK,MAAM,IAAIrZ,CAAK,EACpB,OAAOA,EACX,IAAI2kC,EAAU,OAAO,eAAe3kC,CAAK,EACrC4kC,EAAU,CAACD,CAAO,EAClB/iC,EAAO,KAAK,WAAW5B,CAAK,EAChC4kC,EAAQ,KAAKhjC,EAAK,IAAI,EACtB,IAAIijC,EAAoBD,EAAQ,OAChChjC,EAAK,OAAO,QAAQ,SAAU7E,EAAK,CAC/B6nC,EAAQ,KAAK7vB,EAAM,MAAM/U,EAAMjD,CAAG,CAAC,CAAC,CAC5D,CAAqB,EASD,IAAIsc,EAAO,KAAK,KAAK,YAAYurB,CAAO,EACxC,GAAI,CAACvrB,EAAK,OAAQ,CACd,IAAIyrB,EAASzrB,EAAK,OAAS,OAAO,OAAOsrB,CAAO,EAChD,KAAK,MAAM,IAAIG,CAAK,EACpBljC,EAAK,OAAO,QAAQ,SAAU7E,EAAKmB,EAAG,CAClC4mC,EAAM/nC,CAAG,EAAI6nC,EAAQC,EAAoB3mC,CAAC,CACtE,CAAyB,EAIG,WAAW,UAAY,IACvB,OAAO,OAAO4mC,CAAK,CAE1B,CACD,OAAOzrB,EAAK,MACf,CACJ,CACJ,CACD,OAAOrZ,CACf,EAKIykC,EAAY,UAAU,WAAa,SAAUxoC,EAAK,CAC9C,IAAI2F,EAAO,OAAO,KAAK3F,CAAG,EACtBod,EAAO,KAAK,KAAK,YAAYzX,CAAI,EACrC,GAAI,CAACyX,EAAK,KAAM,CACZzX,EAAK,KAAI,EACT,IAAImjC,EAAO,KAAK,UAAUnjC,CAAI,GACxByX,EAAK,KAAO,KAAK,WAAW,IAAI0rB,CAAI,IACtC,KAAK,WAAW,IAAIA,EAAO1rB,EAAK,KAAO,CAAE,OAAQzX,EAAM,KAAMmjC,CAAM,CAAA,CAE1E,CACD,OAAO1rB,EAAK,IACpB,EACWorB,CACX,ICzKA,SAASO,GAAwBh9B,EAAS,CACtC,MAAO,CACHA,EAAQ,aACRA,EAAQ,kBACRA,EAAQ,QAGRA,EAAQ,QAAQ,eACxB,CACA,CACA,IAAIi9B,GAA6B,UAAY,CACzC,SAASA,EAAY1/B,EAAQ,CACzB,IAAIwP,EAAQ,KACZ,KAAK,aAAe,IAAKgS,GAAgB,QAAU,KACnD,KAAK,OAASuU,GAAQ/1B,EAAQ,CAC1B,YAAaA,EAAO,cAAgB,GACpC,gBAAiB06B,GAAsB16B,CAAM,CACzD,CAAS,EACD,KAAK,MAAQA,EAAO,OAAS,IAAIk/B,GAKjC,KAAK,oBAAsBzuB,GAAK,SAAUhO,EAAS,CAC/C,IAAI9H,EACAglC,EAAkBl9B,EAAQ,QAAQ,gBAClCm9B,EAAWH,GAAwBh9B,CAAO,EAG9Cm9B,EAAS,CAAC,EAAI,CAACD,EACf,IAAIE,GAASllC,EAAK6U,EAAM,qBAAqB,KAAK,MAAM7U,EAAIilC,CAAQ,EACpE,OAAIC,EACIF,EACOjyB,EAASA,EAAS,CAAE,EAAEmyB,CAAK,EAAG,CAGjC,OAAQrwB,EAAM,MAAM,MAAMqwB,EAAM,MAAM,CAAC,CAAE,EAI1CA,GAEX3B,GAA+Bz7B,EAAQ,QAAQ,MAAOA,EAAQ,aAAa,KAAK,EAGzE+M,EAAM,qBAAqB/M,CAAO,EACrD,EAAW,CACC,IAAK,KAAK,OAAO,oBACbshB,GAAW,mCAAmC,GAC9C,IACJ,QAAS0b,GAGT,aAAc,SAAU1gB,EAAcjgB,EAAQoI,EAASy4B,EAAiB,CACpE,GAAIvB,GAAsBl3B,EAAQ,KAAK,EACnC,OAAOA,EAAQ,MAAM,aAAa6X,EAAckH,EAAYnnB,CAAM,EAAIA,EAAO,MAAQA,EAAQoI,EAAQ,UAAWy4B,CAAe,CAEtI,CACb,CAAS,EACD,KAAK,wBAA0BlvB,GAAK,SAAUhO,EAAS,CACnD,OAAAy7B,GAA+Bz7B,EAAQ,QAAQ,MAAOA,EAAQ,aAAa,KAAK,EACzE+M,EAAM,yBAAyB/M,CAAO,CACzD,EAAW,CACC,IAAK,KAAK,OAAO,oBACbshB,GAAW,uCAAuC,GAClD,IACJ,aAAc,SAAUppB,EAAI,CACxB,IAAIwsB,EAAQxsB,EAAG,MAAOyZ,EAAQzZ,EAAG,MAAOuM,EAAUvM,EAAG,QACrD,GAAIyjC,GAAsBl3B,EAAQ,KAAK,EACnC,OAAOA,EAAQ,MAAM,aAAaigB,EAAO/S,EAAOlN,EAAQ,SAAS,CAExE,CACb,CAAS,CACJ,CACD,OAAAw4B,EAAY,UAAU,WAAa,UAAY,CAC3C,KAAK,MAAQ,IAAIR,EACzB,EAKIQ,EAAY,UAAU,sBAAwB,SAAU/kC,EAAI,CACxD,IAAId,EAAQc,EAAG,MAAO0nB,EAAQ1nB,EAAG,MAAOiqB,EAAKjqB,EAAG,OAAQ6iC,EAAS5Y,IAAO,OAAS,aAAeA,EAAIjF,EAAYhlB,EAAG,UAAWkqB,EAAKlqB,EAAG,kBAAmBmlC,EAAoBjb,IAAO,OAAS,GAAOA,EAAIC,EAAKnqB,EAAG,gBAAiBglC,EAAkB7a,IAAO,OAAS,KAAK,OAAO,gBAAkBA,EAC7R0W,EAAW,KAAK,OAAO,MAAM,SACjC7b,EAAYjS,EAASA,EAAS,GAAIyb,GAAiBP,GAAmBvG,CAAK,CAAC,CAAC,EAAG1C,CAAS,EACzF,IAAIogB,EAAU/Z,GAAcwX,CAAM,EAC9BwC,EAAa,KAAK,oBAAoB,CACtC,aAAchX,GAAkB3G,CAAK,EAAE,aACvC,kBAAmB0d,EACnB,aAAcA,EACd,QAASryB,EAAS,CAAE,MAAO7T,EAAO,MAAOwoB,EAAO,SAAUmZ,EAAU,UAAW7b,EAAW,UAAW6F,GAAmB7F,CAAS,EAAG,gBAAiBggB,CAAiB,EAAExE,GAAuB9Y,EAAO,KAAK,OAAO,SAAS,CAAC,CACxO,CAAS,EACG4d,EACJ,GAAID,EAAW,UAKXC,EAAU,CACN,IAAI/F,GAAkBgG,GAAaF,EAAW,OAAO,EAAGA,EAAW,QAAS3d,EAAO1C,CAAS,CAC5G,EACgB,CAACmgB,GACD,MAAMG,EAAQ,CAAC,EAGvB,MAAO,CACH,OAAQD,EAAW,OACnB,SAAU,CAACC,EACX,QAASA,CACrB,CACA,EACIP,EAAY,UAAU,QAAU,SAAU5hC,EAAQgB,EAAQigB,EAAc7X,EAAS,CAC7E,GAAIk3B,GAAsBl3B,EAAQ,KAAK,GACnC,KAAK,aAAa,IAAIpJ,CAAM,IAAMihB,EAAc,CAChD,IAAIhjB,EAAS,KAAK,oBAAoB,KAAKgjB,EAAcjgB,EAAQoI,EAIjE,KAAK,MAAM,QAAQpJ,CAAM,CAAC,EAC1B,GAAI/B,GAAU+B,IAAW/B,EAAO,OAC5B,MAAO,EAEd,CACD,MAAO,EACf,EAEI2jC,EAAY,UAAU,qBAAuB,SAAU/kC,EAAI,CACvD,IAAI6U,EAAQ,KACRuP,EAAepkB,EAAG,aAAcigC,EAAoBjgC,EAAG,kBAAmBwlC,EAAexlC,EAAG,aAAcuM,EAAUvM,EAAG,QAC3H,GAAIsrB,EAAY2U,CAAiB,GAC7B,CAAC1zB,EAAQ,SAAS,kBAAkB0zB,EAAkB,KAAK,GAC3D,CAAC1zB,EAAQ,MAAM,IAAI0zB,EAAkB,KAAK,EAC1C,MAAO,CACH,OAAQ,KAAK,MAAM,MACnB,QAAS,iCAAiC,OAAOA,EAAkB,MAAO,SAAS,CACnG,EAEQ,IAAIjb,EAAYzY,EAAQ,UAAWs0B,EAAWt0B,EAAQ,SAAUrN,EAAQqN,EAAQ,MAC5EkhB,EAAWvuB,EAAM,cAAc+gC,EAAmB,YAAY,EAC9DwF,EAAiB,CAAA,EACjBH,EACAI,EAAgB,IAAIxP,GACpB,KAAK,OAAO,aACZ,OAAOzI,GAAa,UACpB,CAACoT,EAAS,kBAAkBpT,CAAQ,GAIpCgY,EAAe,KAAK,CAAE,WAAYhY,CAAU,CAAA,EAEhD,SAASkY,EAAcxiC,EAAQyiC,EAAY,CACvC,IAAI5lC,EACJ,OAAImD,EAAO,UACPmiC,EAAUI,EAAc,MAAMJ,GAAUtlC,EAAK,CAAE,EAC3CA,EAAG4lC,CAAU,EAAIziC,EAAO,QACxBnD,KAEDmD,EAAO,MACjB,CACD,IAAI83B,EAAU,IAAI,IAAI7W,EAAa,UAAU,EAC7C6W,EAAQ,QAAQ,SAAUlT,EAAW,CACjC,IAAI/nB,EAAIiqB,EAGR,GAAKlF,GAAcgD,EAAW/C,CAAS,EAEvC,GAAIuI,GAAQxF,CAAS,EAAG,CACpB,IAAIia,EAAanB,EAAS,UAAU,CAChC,UAAW9Y,EAAU,KAAK,MAC1B,MAAOA,EACP,UAAWxb,EAAQ,UACnB,KAAM0zB,CACT,EAAE1zB,CAAO,EACNq5B,EAAavY,GAAuBtF,CAAS,EAC7Cia,IAAe,OACVxM,GAAsB,MAAMzN,CAAS,IACtCud,EAAUI,EAAc,MAAMJ,GAAUtlC,EAAK,CAAE,EAC3CA,EAAG4lC,CAAU,EAAI,qBAAqB,OAAO7d,EAAU,KAAK,MAAO,OAAO,EAAE,OAAOuD,EAAY2U,CAAiB,EAC5GA,EAAkB,MAAQ,UACxB,UAAY,KAAK,UAAUA,EAAmB,KAAM,CAAC,CAAC,EAC5DjgC,KAGHoE,EAAQ49B,CAAU,EACnBA,EAAW,OAAS,IACpBA,EAAa2D,EAAc9wB,EAAM,wBAAwB,CACrD,MAAOkT,EACP,MAAOia,EACP,aAAcwD,EACd,QAASj5B,CACrC,CAAyB,EAAGq5B,CAAU,GAGZ7d,EAAU,aASXia,GAAc,OAInBA,EAAa2D,EAAc9wB,EAAM,oBAAoB,CACjD,aAAckT,EAAU,aACxB,kBAAmBia,EACnB,aAAc1W,EAAY0W,CAAU,EAAIA,EAAawD,EACrD,QAASj5B,CACjC,CAAqB,EAAGq5B,CAAU,GAbVr5B,EAAQ,kBACRy1B,EAAantB,EAAM,MAAM,KAAKmtB,CAAU,GAc5CA,IAAe,QACfyD,EAAe,MAAMxb,EAAK,CAAE,EAAEA,EAAG2b,CAAU,EAAI5D,EAAY/X,GAElE,KACI,CACD,IAAIpC,EAAWC,GAAyBC,EAAWxb,EAAQ,cAAc,EACzE,GAAI,CAACsb,GAAYE,EAAU,OAASpN,EAAK,gBACrC,MAAMvE,GAAkB,EAAG2R,EAAU,KAAK,KAAK,EAE/CF,GAAYgZ,EAAS,gBAAgBhZ,EAAU4F,CAAQ,GACvD5F,EAAS,aAAa,WAAW,QAAQoT,EAAQ,IAAKA,CAAO,CAEpE,CACb,CAAS,EACD,IAAI93B,EAAS6yB,GAAeyP,CAAc,EACtCI,EAAc,CAAE,OAAQ1iC,EAAQ,QAASmiC,CAAO,EAChDQ,EAASv5B,EAAQ,gBACjB,KAAK,MAAM,MAAMs5B,CAAW,EAG1B1K,GAAgB0K,CAAW,EAGjC,OAAIC,EAAO,QACP,KAAK,aAAa,IAAIA,EAAO,OAAQ1hB,CAAY,EAE9C0hB,CACf,EAEIf,EAAY,UAAU,yBAA2B,SAAU/kC,EAAI,CAC3D,IAAI6U,EAAQ,KACR2X,EAAQxsB,EAAG,MAAOyZ,EAAQzZ,EAAG,MAAOwlC,EAAexlC,EAAG,aAAcuM,EAAUvM,EAAG,QACjFslC,EACAI,EAAgB,IAAIxP,GACxB,SAASyP,EAAcI,EAAa/nC,EAAG,CACnC,IAAIgC,EACJ,OAAI+lC,EAAY,UACZT,EAAUI,EAAc,MAAMJ,GAAUtlC,EAAK,CAAA,EAAIA,EAAGhC,CAAC,EAAI+nC,EAAY,QAAS/lC,EAAE,GAE7E+lC,EAAY,MACtB,CACD,OAAIvZ,EAAM,eACN/S,EAAQA,EAAM,OAAOlN,EAAQ,MAAM,OAAO,GAE9CkN,EAAQA,EAAM,IAAI,SAAUmH,EAAM5iB,EAAG,CAEjC,OAAI4iB,IAAS,KACF,KAGPxc,EAAQwc,CAAI,EACL+kB,EAAc9wB,EAAM,wBAAwB,CAC/C,MAAO2X,EACP,MAAO5L,EACP,aAAc4kB,EACd,QAASj5B,CAC7B,CAAiB,EAAGvO,CAAC,EAGLwuB,EAAM,aACCmZ,EAAc9wB,EAAM,oBAAoB,CAC3C,aAAc2X,EAAM,aACpB,kBAAmB5L,EACnB,aAAc0K,EAAY1K,CAAI,EAAIA,EAAO4kB,EACzC,QAASj5B,CAC7B,CAAiB,EAAGvO,CAAC,GAEL,WAAW,UAAY,IACvBgoC,GAA6Bz5B,EAAQ,MAAOigB,EAAO5L,CAAI,EAEpDA,EACnB,CAAS,EACM,CACH,OAAQrU,EAAQ,gBAAkB,KAAK,MAAM,MAAMkN,CAAK,EAAIA,EAC5D,QAAS6rB,CACrB,CACA,EACWP,CACX,EAAC,EAED,SAASQ,GAAaU,EAAM,CACxB,GAAI,CACA,KAAK,UAAUA,EAAM,SAAUnyB,EAAGhU,EAAO,CACrC,GAAI,OAAOA,GAAU,SACjB,MAAMA,EACV,OAAOA,CACnB,CAAS,CACJ,OACMqD,EAAQ,CACX,OAAOA,CACV,CACL,CACA,SAAS6iC,GAA6B9mC,EAAOstB,EAAOwV,EAAY,CAC5D,GAAI,CAACxV,EAAM,aAAc,CACrB,IAAI2W,EAAY,IAAI,IAAI,CAACnB,CAAU,CAAC,EACpCmB,EAAU,QAAQ,SAAUrjC,EAAO,CAC3BsnB,EAAgBtnB,CAAK,IACrBgV,EACI,CAACwW,EAAYxrB,CAAK,EAClB,GACAkgC,GAA2B9gC,EAAOY,CAAK,EACvC0sB,EAAM,KAAK,KAC/B,EACgB,OAAO,OAAO1sB,CAAK,EAAE,QAAQqjC,EAAU,IAAKA,CAAS,EAErE,CAAS,CACJ,CACL,CCtUU,IAAC+C,GAAY,IAAI5W,GACvB6W,GAAe,IAAI,QACvB,SAASC,GAAard,EAAO,CACzB,IAAIiU,EAAOmJ,GAAa,IAAIpd,CAAK,EACjC,OAAKiU,GACDmJ,GAAa,IAAIpd,EAAQiU,EAAO,CAC5B,KAAM,IAAI,IACV,IAAKtM,GAAK,CACtB,GAEWsM,CACX,CACO,SAASqJ,GAAYtd,EAAO,CAC/Bqd,GAAard,CAAK,EAAE,KAAK,QAAQ,SAAUud,EAAI,CAAE,OAAOA,EAAG,YAAYvd,CAAK,CAAI,CAAA,CACpF,CASO,SAASwd,GAAYxd,EAAO,CAC/Bqd,GAAard,CAAK,EAAE,KAAK,QAAQ,SAAUud,EAAI,CAAE,OAAOA,EAAG,YAAYvd,CAAK,CAAI,CAAA,CACpF,CACO,SAASyd,GAAQ1mC,EAAO,CAC3B,IAAIiyB,EAAS,IAAI,IACblpB,EAAY,IAAI,IAChBy9B,EAAK,SAAUpE,EAAU,CACzB,GAAI,UAAU,OAAS,GACnB,GAAIpiC,IAAUoiC,EAAU,CACpBpiC,EAAQoiC,EACRnQ,EAAO,QAAQ,SAAUhJ,EAAO,CAI5Bqd,GAAard,CAAK,EAAE,IAAI,MAAMud,CAAE,EAGhCG,GAAU1d,CAAK,CACnC,CAAiB,EAED,IAAI2d,EAAe,MAAM,KAAK79B,CAAS,EACvCA,EAAU,MAAK,EACf69B,EAAa,QAAQ,SAAU9pC,EAAU,CAAE,OAAOA,EAASkD,CAAK,CAAE,CAAE,CACvE,MAEA,CAID,IAAIipB,EAAQmd,GAAU,WAClBnd,IACA4d,EAAO5d,CAAK,EACZqd,GAAard,CAAK,EAAE,IAAIud,CAAE,EAEjC,CACD,OAAOxmC,CACf,EACIwmC,EAAG,aAAe,SAAU1pC,EAAU,CAClC,OAAAiM,EAAU,IAAIjM,CAAQ,EACf,UAAY,CACfiM,EAAU,OAAOjM,CAAQ,CACrC,CACA,EACI,IAAI+pC,EAAUL,EAAG,YAAc,SAAUvd,EAAO,CAC5C,OAAAgJ,EAAO,IAAIhJ,CAAK,EAChBqd,GAAard,CAAK,EAAE,KAAK,IAAIud,CAAE,EACxBA,CACf,EACI,OAAAA,EAAG,YAAc,SAAUvd,EAAO,CAAE,OAAOgJ,EAAO,OAAOhJ,CAAK,GACvDud,CACX,CACA,SAASG,GAAU1d,EAAO,CAClBA,EAAM,kBACNA,EAAM,iBAAgB,CAE9B,CC7EA,IAAI6d,GAAqB,OAAO,OAAO,IAAI,EAC3C,SAASC,GAAoBC,EAAM,CAI/B,IAAIC,EAAW,KAAK,UAAUD,CAAI,EAClC,OAAQF,GAAmBG,CAAQ,IAC9BH,GAAmBG,CAAQ,EAAI,OAAO,OAAO,IAAI,EAC1D,CACO,SAASC,GAAyBC,EAAW,CAChD,IAAIjK,EAAO6J,GAAoBI,CAAS,EACxC,OAAQjK,EAAK,cAAgBA,EAAK,YAAc,SAAU7d,EAAQ5S,EAAS,CACnE,IAAI26B,EAAU,SAAU7yB,EAAMxX,EAAK,CAC/B,OAAO0P,EAAQ,UAAU1P,EAAKwX,CAAI,CAClD,EACgB8yB,EAAa56B,EAAQ,UAAY66B,GAAsBH,EAAW,SAAUI,EAAe,CAC3F,IAAIC,EAAYC,GAAeh7B,EAAQ,YAAa86B,EAIpDH,CAAO,EACP,OAAII,IAAc,QACdnoB,IAAW5S,EAAQ,aACnBizB,EAAO,KAAKrgB,EAAQkoB,EAAc,CAAC,CAAC,IAUpCC,EAAYC,GAAepoB,EAAQkoB,EAAeG,EAAU,GAEhE1yB,EAAUwyB,IAAc,OAAQ,EAAGD,EAAc,KAAK,GAAG,EAAGloB,CAAM,EAC3DmoB,CACV,CAAA,EACD,MAAO,GAAG,OAAO/6B,EAAQ,SAAU,GAAG,EAAE,OAAO,KAAK,UAAU46B,CAAS,CAAC,CACpF,EACA,CAQO,SAASM,GAAuBR,EAAW,CAC9C,IAAIjK,EAAO6J,GAAoBI,CAAS,EACxC,OAAQjK,EAAK,YACRA,EAAK,UAAY,SAAUl+B,EAAMkB,EAAI,CAClC,IAAIwsB,EAAQxsB,EAAG,MAAOglB,EAAYhlB,EAAG,UAAW6sB,EAAY7sB,EAAG,UAC3D0nC,EAAYN,GAAsBH,EAAW,SAAUU,EAAS,CAChE,IAAIC,EAAWD,EAAQ,CAAC,EACpBE,EAAYD,EAAS,OAAO,CAAC,EACjC,GAAIC,IAAc,IAAK,CACnB,GAAIrb,GAAS4G,GAAgB5G,EAAM,UAAU,EAAG,CAC5C,IAAIsb,EAAkBF,EAAS,MAAM,CAAC,EAIlCh1B,EAAI4Z,EAAM,WAAW,KAAK,SAAU5Z,EAAG,CAAE,OAAOA,EAAE,KAAK,QAAUk1B,CAAkB,CAAA,EAEnFC,EAAgBn1B,GAAKua,GAAyBva,EAAGoS,CAAS,EAQ9D,OAAQ+iB,GACJR,GAAeQ,EAIfJ,EAAQ,MAAM,CAAC,CAAC,CACvB,CAID,MACH,CACD,GAAIE,IAAc,IAAK,CACnB,IAAIG,EAAeJ,EAAS,MAAM,CAAC,EACnC,GAAI5iB,GAAawa,EAAO,KAAKxa,EAAWgjB,CAAY,EAAG,CACnD,IAAIC,EAAaN,EAAQ,MAAM,CAAC,EAChC,OAAAM,EAAW,CAAC,EAAID,EACTT,GAAeviB,EAAWijB,CAAU,CAC9C,CAID,MACH,CACD,GAAInpC,EACA,OAAOyoC,GAAezoC,EAAM6oC,CAAO,CAEvD,CAAa,EACGnK,EAAS,KAAK,UAAUkK,CAAS,EAMrC,OAAI5oC,GAAQ0+B,IAAW,QACnB3Q,GAAa,IAAM2Q,GAEhB3Q,CACnB,EACA,CACO,SAASua,GAAsBH,EAAWiB,EAAW,CAGxD,IAAIjS,EAAS,IAAIC,GACjB,OAAOiS,GAAkBlB,CAAS,EAAE,OAAO,SAAUS,EAAWlkC,EAAM,CAClE,IAAIxD,EACAooC,EAAUF,EAAU1kC,CAAI,EAC5B,GAAI4kC,IAAY,OAAQ,CAGpB,QAASpqC,EAAIwF,EAAK,OAAS,EAAGxF,GAAK,EAAG,EAAEA,EACpCoqC,GAAWpoC,EAAK,CAAE,EAAEA,EAAGwD,EAAKxF,CAAC,CAAC,EAAIoqC,EAASpoC,GAE/C0nC,EAAYzR,EAAO,MAAMyR,EAAWU,CAAO,CAC9C,CACD,OAAOV,CACV,EAAE,OAAO,OAAO,IAAI,CAAC,CAC1B,CACO,SAASS,GAAkBrB,EAAM,CACpC,IAAI9J,EAAO6J,GAAoBC,CAAI,EACnC,GAAI,CAAC9J,EAAK,MAAO,CACb,IAAIqL,EAAWrL,EAAK,MAAQ,CAAE,EAC1BsL,EAAgB,CAAA,EACpBxB,EAAK,QAAQ,SAAU9zB,EAAGhV,EAAG,CACrBoG,EAAQ4O,CAAC,GACTm1B,GAAkBn1B,CAAC,EAAE,QAAQ,SAAUrN,EAAG,CAAE,OAAO0iC,EAAQ,KAAKC,EAAc,OAAO3iC,CAAC,CAAC,CAAI,CAAA,EAC3F2iC,EAAc,OAAS,IAGvBA,EAAc,KAAKt1B,CAAC,EACf5O,EAAQ0iC,EAAK9oC,EAAI,CAAC,CAAC,IACpBqqC,EAAQ,KAAKC,EAAc,MAAM,CAAC,CAAC,EACnCA,EAAc,OAAS,GAG3C,CAAS,CACJ,CACD,OAAOtL,EAAK,KAChB,CACA,SAASwK,GAAWroB,EAAQtiB,EAAK,CAC7B,OAAOsiB,EAAOtiB,CAAG,CACrB,CACO,SAAS0qC,GAAepoB,EAAQ3b,EAAM0jC,EAAS,CAYlD,OAAAA,EAAUA,GAAWM,GACde,GAAU/kC,EAAK,OAAO,SAAStH,EAAQH,EAAKc,EAAK,CACpD,OAAOuH,EAAQrI,CAAG,EACdA,EAAI,IAAI,SAAU0qB,EAAO,CAAE,OAAOvqB,EAAQuqB,EAAO5pB,CAAG,EAAI,EACtDd,GAAOmrC,EAAQnrC,EAAKc,CAAG,CACrC,EAAOsiB,CAAM,CAAC,CACd,CACA,SAASopB,GAAUzoC,EAAO,CAItB,OAAIsnB,EAAgBtnB,CAAK,EACjBsE,EAAQtE,CAAK,EACNA,EAAM,IAAIyoC,EAAS,EAEvBnB,GAAsB,OAAO,KAAKtnC,CAAK,EAAE,KAAI,EAAI,SAAU0D,EAAM,CACpE,OAAO+jC,GAAeznC,EAAO0D,CAAI,CAC7C,CAAS,EAEE1D,CACX,CCxLA,SAAS0oC,GAAuB1B,EAAM,CAClC,OAAQA,EAAK,OAAS,OAASA,EAAK,KAC9BA,EAAK,MAAQ3Z,GAAyB2Z,EAAK,MAAOA,EAAK,SAAS,EAC5D,IACd,CACA,IAAI2B,GAAkB,UAAY,CAAgB,EAC9CC,GAAkB,SAAUC,EAAOp8B,EAAS,CAAE,OAAOA,EAAQ,WAG7Dq8B,GAAc,SAAUtH,EAAUC,EAAUvhC,EAAI,CAChD,IAAI6oC,EAAe7oC,EAAG,aACtB,OAAO6oC,EAAavH,EAAUC,CAAQ,CAC1C,EACIuH,GAAe,SAAUh1B,EAAGytB,EAAU,CAAE,OAAOA,CAAS,EACxDwH,GAA0B,UAAY,CACtC,SAASA,EAAS1jC,EAAQ,CACtB,KAAK,OAASA,EACd,KAAK,aAAe,OAAO,OAAO,IAAI,EACtC,KAAK,UAAY,OAAO,OAAO,IAAI,EAKnC,KAAK,aAAe,IAAI,IAKxB,KAAK,cAAgB,IAAI,IACzB,KAAK,kBAAoB,OAAO,OAAO,IAAI,EAC3C,KAAK,kBAAoB,OAAO,OAAO,IAAI,EAC3C,KAAK,mBAAqB,GAC1B,KAAK,OAAS0N,EAAS,CAAE,iBAAkB2sB,EAAuB,EAAIr6B,CAAM,EAC5E,KAAK,MAAQ,KAAK,OAAO,MACzB,KAAK,gBAAgB,OAAO,EAC5B,KAAK,gBAAgB,UAAU,EAC/B,KAAK,gBAAgB,cAAc,EAC/BA,EAAO,eACP,KAAK,iBAAiBA,EAAO,aAAa,EAE1CA,EAAO,cACP,KAAK,gBAAgBA,EAAO,YAAY,CAE/C,CACD,OAAA0jC,EAAS,UAAU,SAAW,SAAU5pB,EAAQ6pB,EAAgB,CAC5D,IAAIhpC,EACA6gC,EAAW,KACXpT,EAAYub,IACXA,EAAe,YAAchpC,EAAKgpC,EAAe,eAAiB,MAAQhpC,IAAO,OAAS,OAASA,EAAG,cACvGmf,EAAO,WAMX,GAAIsO,IAAa,KAAK,kBAAkB,WACpC,MAAO,CAAC,YAAY,EAexB,QAZI0T,EAAe6H,GAAkBA,EAAe,aAAgB7pB,EAChE5S,EAAUwG,EAASA,EAAS,CAAA,EAAIi2B,CAAc,EAAG,CAAE,SAAUvb,EAAU,YAAa0T,EAAa,UAAY6H,GAAkBA,EAAe,WAC1I,UAAY,CACR,IAAIlhC,EAAUmhC,GAA0B,UAAW9H,CAAW,EAC9D,OAAON,EAAS,UAAU/4B,EAAS,CAC/B,MAAO+4B,EAAS,MAAM,KACtB,UAAW/4B,EAAQ,SAC3C,CAAqB,CACJ,CAAA,CAAE,EACPgK,EACAo3B,EAASzb,GAAY,KAAK,cAAcA,CAAQ,EAChD0b,EAASD,GAAUA,EAAO,OAAU,KAAK,OAAO,iBAC7CC,GAAO,CACV,IAAIC,EAAgBD,EAAMp2B,EAASA,EAAS,GAAIoM,CAAM,EAAGgiB,CAAW,EAAG50B,CAAO,EAC9E,GAAInI,EAAQglC,CAAa,EACrBD,EAAQnC,GAAyBoC,CAAa,MAE7C,CACDt3B,EAAKs3B,EACL,KACH,CACJ,CACD,OAAAt3B,EAAKA,EAAK,OAAOA,CAAE,EAAI,OAChBvF,EAAQ,UAAY,CAACuF,EAAIvF,EAAQ,SAAS,EAAI,CAACuF,CAAE,CAChE,EACIi3B,EAAS,UAAU,gBAAkB,SAAUM,EAAc,CACzD,IAAIx0B,EAAQ,KACZ,OAAO,KAAKw0B,CAAY,EAAE,QAAQ,SAAU5b,EAAU,CAClD,IAAIztB,EAAKqpC,EAAa5b,CAAQ,EAAG6b,EAAYtpC,EAAG,UAAWupC,EAAevpC,EAAG,aAAcwpC,EAAmBxpC,EAAG,iBAAkBuhC,EAAWruB,GAAOlT,EAAI,CAAC,YAAa,eAAgB,kBAAkB,CAAC,EAetMspC,GACAz0B,EAAM,gBAAgB,QAAS4Y,CAAQ,EACvC8b,GACA10B,EAAM,gBAAgB,WAAY4Y,CAAQ,EAC1C+b,GACA30B,EAAM,gBAAgB,eAAgB4Y,CAAQ,EAC9C+R,EAAO,KAAK3qB,EAAM,UAAW4Y,CAAQ,EACrC5Y,EAAM,UAAU4Y,CAAQ,EAAE,KAAK8T,CAAQ,EAGvC1sB,EAAM,UAAU4Y,CAAQ,EAAI,CAAC8T,CAAQ,CAErD,CAAS,CACT,EACIwH,EAAS,UAAU,iBAAmB,SAAUtb,EAAU8T,EAAU,CAChE,IAAI1sB,EAAQ,KACRysB,EAAW,KAAK,cAAc7T,CAAQ,EACtCgc,EAAYlI,EAAS,UAAWpgB,EAASogB,EAAS,OACtD,SAASmI,EAASpI,EAAUqI,EAAO,CAC/BrI,EAAS,MACL,OAAOqI,GAAU,WAAaA,EAGxBA,IAAU,GAAOf,GAGbe,IAAU,GAAQb,GACdxH,EAAS,KAC9B,CAGDoI,EAASpI,EAAUC,EAAS,KAAK,EACjCD,EAAS,MAELmI,IAAc,GAAQhB,GAGhBrkC,EAAQqlC,CAAS,EAAIzC,GAAyByC,CAAS,EAEnD,OAAOA,GAAc,WAAaA,EAE9BnI,EAAS,MACvBngB,GACA,OAAO,KAAKA,CAAM,EAAE,QAAQ,SAAU0L,EAAW,CAC7C,IAAIyU,EAAWzsB,EAAM,eAAe4Y,EAAUZ,EAAW,EAAI,EACzD0U,EAAWpgB,EAAO0L,CAAS,EAC/B,GAAI,OAAO0U,GAAa,WACpBD,EAAS,KAAOC,MAEf,CACD,IAAItP,EAAUsP,EAAS,QAASqI,EAAOrI,EAAS,KAAMoI,EAAQpI,EAAS,MACvED,EAAS,MAGLrP,IAAY,GAAQyW,GAGdtkC,EAAQ6tB,CAAO,EAAIwV,GAAuBxV,CAAO,EAE7C,OAAOA,GAAY,WAAaA,EAE5BqP,EAAS,MACvB,OAAOsI,GAAS,aAChBtI,EAAS,KAAOsI,GAEpBF,EAASpI,EAAUqI,CAAK,CAC3B,CACGrI,EAAS,MAAQA,EAAS,QAM1BA,EAAS,MAAQA,EAAS,OAASoH,GAEvD,CAAa,CAEb,EACIK,EAAS,UAAU,gBAAkB,SAAUc,EAAOpc,EAAU,CACxDA,IAAa,SAAUA,EAAWoc,GACtC,IAAIhH,EAAS,QAAUgH,EAAM,YAAW,EACpCC,EAAM,KAAK,kBAAkBjH,CAAM,EACnCpV,IAAaqc,IACbh1B,EAAU,CAACg1B,GAAOA,IAAQD,EAAO,EAAGA,CAAK,EAGrCC,GACA,OAAO,KAAK,kBAAkBA,CAAG,EAErC,KAAK,kBAAkBrc,CAAQ,EAAIoV,EAEnC,KAAK,kBAAkBA,CAAM,EAAIpV,EAE7C,EACIsb,EAAS,UAAU,iBAAmB,SAAUgB,EAAe,CAC3D,IAAIl1B,EAAQ,KACZ,KAAK,mBAAqB,GAC1B,OAAO,KAAKk1B,CAAa,EAAE,QAAQ,SAAUC,EAAW,CAIpDn1B,EAAM,gBAAgBm1B,EAAW,EAAI,EACrCD,EAAcC,CAAS,EAAE,QAAQ,SAAUC,EAAS,CAChDp1B,EAAM,gBAAgBo1B,EAAS,EAAI,EAAE,IAAID,CAAS,EAClD,IAAI/yB,EAAQgzB,EAAQ,MAAM/J,EAAqB,GAC3C,CAACjpB,GAASA,EAAM,CAAC,IAAMgzB,IAEvBp1B,EAAM,cAAc,IAAIo1B,EAAS,IAAI,OAAOA,CAAO,CAAC,CAExE,CAAa,CACb,CAAS,CACT,EACIlB,EAAS,UAAU,cAAgB,SAAUtb,EAAU,CACnD,IAAI5Y,EAAQ,KACZ,GAAI,CAAC2qB,EAAO,KAAK,KAAK,aAAc/R,CAAQ,EAAG,CAC3C,IAAIyc,EAAY,KAAK,aAAazc,CAAQ,EAAI,OAAO,OAAO,IAAI,EAChEyc,EAAS,OAAS,OAAO,OAAO,IAAI,EAsBpC,IAAIC,EAAe,KAAK,aAAa,IAAI1c,CAAQ,EAC7C,CAAC0c,GAAgB,KAAK,cAAc,OAIpCA,EAAe,KAAK,gBAAgB1c,EAAU,EAAI,EAMlD,KAAK,cAAc,QAAQ,SAAU2c,EAAQC,EAAO,CAChD,GAAID,EAAO,KAAK3c,CAAQ,EAAG,CAIvB,IAAI6c,EAAkBz1B,EAAM,aAAa,IAAIw1B,CAAK,EAC9CC,GACAA,EAAgB,QAAQ,SAAUN,EAAW,CACzC,OAAOG,EAAa,IAAIH,CAAS,CACjE,CAA6B,CAER,CACrB,CAAiB,GAEDG,GAAgBA,EAAa,MAC7BA,EAAa,QAAQ,SAAUH,EAAW,CACtC,IAAIhqC,EAAK6U,EAAM,cAAcm1B,CAAS,EAAG7oB,EAASnhB,EAAG,OAAQqQ,EAAO6C,GAAOlT,EAAI,CAAC,QAAQ,CAAC,EACzF,OAAO,OAAOkqC,EAAU75B,CAAI,EAC5B,OAAO,OAAO65B,EAAS,OAAQ/oB,CAAM,CACzD,CAAiB,CAER,CACD,IAAIopB,EAAQ,KAAK,UAAU9c,CAAQ,EACnC,OAAI8c,GAASA,EAAM,QAGfA,EAAM,OAAO,CAAC,EAAE,QAAQ,SAAUrB,EAAQ,CACtCr0B,EAAM,iBAAiB4Y,EAAUyb,CAAM,CACvD,CAAa,EAEE,KAAK,aAAazb,CAAQ,CACzC,EACIsb,EAAS,UAAU,eAAiB,SAAUtb,EAAUZ,EAAW2d,EAAiB,CAChF,GAAI/c,EAAU,CACV,IAAIgd,EAAgB,KAAK,cAAchd,CAAQ,EAAE,OACjD,OAAQgd,EAAc5d,CAAS,GAC1B2d,IAAoBC,EAAc5d,CAAS,EAAI,OAAO,OAAO,IAAI,EACzE,CACT,EACIkc,EAAS,UAAU,gBAAkB,SAAUkB,EAASO,EAAiB,CACrE,IAAIE,EAAe,KAAK,aAAa,IAAIT,CAAO,EAChD,MAAI,CAACS,GAAgBF,GACjB,KAAK,aAAa,IAAIP,EAAUS,EAAe,IAAI,KAEhDA,CACf,EACI3B,EAAS,UAAU,gBAAkB,SAAUlhB,EAAU4F,EAAUtqB,EAAQ6hB,EAAW,CAClF,IAAInQ,EAAQ,KACZ,GAAI,CAACgT,EAAS,cACV,MAAO,GAGX,GAAI,CAAC4F,EACD,MAAO,GACX,IAAIuc,EAAYniB,EAAS,cAAc,KAAK,MAE5C,GAAI4F,IAAauc,EACb,MAAO,GACX,GAAI,KAAK,oBAAsB,KAAK,aAAa,IAAIA,CAAS,EAqB1D,QApBIW,EAAuB,KAAK,gBAAgBld,EAAU,EAAI,EAC1Dmd,EAAc,CAACD,CAAoB,EACnCE,EAAiB,SAAUZ,EAAS,CACpC,IAAIS,EAAe71B,EAAM,gBAAgBo1B,EAAS,EAAK,EACnDS,GACAA,EAAa,MACbE,EAAY,QAAQF,CAAY,EAAI,GACpCE,EAAY,KAAKF,CAAY,CAEjD,EAOgBI,EAA2B,CAAC,EAAE3nC,GAAU,KAAK,cAAc,MAC3D4nC,EAAwB,GAGnB/sC,EAAI,EAAGA,EAAI4sC,EAAY,OAAQ,EAAE5sC,EAAG,CACzC,IAAI0sC,EAAeE,EAAY5sC,CAAC,EAChC,GAAI0sC,EAAa,IAAIV,CAAS,EAC1B,OAAKW,EAAqB,IAAIX,CAAS,IAC/Be,GACA,WAAW,UAAY,IAASj2B,EAAU,KAAK,EAAG2Y,EAAUuc,CAAS,EAMzEW,EAAqB,IAAIX,CAAS,GAE/B,GAEXU,EAAa,QAAQG,CAAc,EAC/BC,GAGA9sC,IAAM4sC,EAAY,OAAS,GAK3BvK,GAA0BxY,EAAS,aAAc1kB,EAAQ6hB,CAAS,IAIlE8lB,EAA2B,GAC3BC,EAAwB,GAKxB,KAAK,cAAc,QAAQ,SAAUX,EAAQY,EAAa,CACtD,IAAI/zB,EAAQwW,EAAS,MAAM2c,CAAM,EAC7BnzB,GAASA,EAAM,CAAC,IAAMwW,GACtBod,EAAeG,CAAW,CAEtD,CAAqB,EAER,CAEL,MAAO,EACf,EACIjC,EAAS,UAAU,WAAa,SAAUtb,EAAUZ,EAAW,CAC3D,IAAIqc,EAAS,KAAK,eAAezb,EAAUZ,EAAW,EAAK,EAC3D,MAAO,CAAC,EAAEqc,GAAUA,EAAO,MACnC,EACIH,EAAS,UAAU,kBAAoB,SAAUkC,EAAW,CACxD,IAAIxd,EAAWwd,EAAU,SAAUpe,EAAYoe,EAAU,UACrD/B,EAAS,KAAK,eAAezb,EAAUZ,EAAW,EAAK,EACvDuT,EACA+I,EAAQD,GAAUA,EAAO,MAC7B,GAAIC,GAAS1b,EAQT,QAPIlhB,EAAU,CACV,SAAUkhB,EACV,UAAWZ,EACX,MAAOoe,EAAU,OAAS,KAC1B,UAAWA,EAAU,SACrC,EACgBnsC,EAAO0pC,GAAuByC,CAAS,EACpC9B,GAAO,CACV,IAAI+B,EAAoB/B,EAAMrqC,EAAMyN,CAAO,EAC3C,GAAInI,EAAQ8mC,CAAiB,EACzB/B,EAAQ1B,GAAuByD,CAAiB,MAE/C,CAGD9K,EAAiB8K,GAAqBre,EACtC,KACH,CACJ,CAUL,OARIuT,IAAmB,SACnBA,EACI6K,EAAU,MACN1e,GAAsB0e,EAAU,MAAOA,EAAU,SAAS,EACxDve,GAAgBG,EAAW2b,GAAuByC,CAAS,CAAC,GAItE7K,IAAmB,GACZvT,EAKJA,IAAcsT,GAAuBC,CAAc,EAAIA,EACxDvT,EAAY,IAAMuT,CAChC,EACI2I,EAAS,UAAU,UAAY,SAAUjhC,EAASyE,EAAS,CACvD,IAAI0zB,EAAoBn4B,EAAQ,KAChC,GAAKm4B,EAEL,KAAIkL,EAAcrjC,EAAQ,OAASA,EAAQ,UAC3C,GAAKqjC,EAEL,IAAIrjC,EAAQ,WAAa,OAAQ,CAC7B,IAAI2lB,EAAWlhB,EAAQ,MAAM,cAAc0zB,EAAmB,YAAY,EACtExS,IACA3lB,EAAQ,SAAW2lB,EAC1B,CACD,IAAI2S,EAAiB,KAAK,kBAAkBt4B,CAAO,EAC/C+kB,EAAYsT,GAAuBC,CAAc,EACjDkB,EAAW/0B,EAAQ,MAAM,cAAc0zB,EAAmBG,CAAc,EACxE8I,EAAS,KAAK,eAAephC,EAAQ,SAAU+kB,EAAW,EAAK,EAC/D+c,EAAOV,GAAUA,EAAO,KAC5B,GAAIU,EAAM,CACN,IAAIwB,EAAcC,GAAyB,KAAMpL,EAAmBn4B,EAASyE,EAASA,EAAQ,MAAM,WAAW+e,EAAY2U,CAAiB,EACxIA,EAAkB,MAChBA,EAAmBG,CAAc,CAAC,EAExC,OAAO8F,GAAU,UAAU,KAAK,MAAO0D,EAAM,CACzCtI,EACA8J,CAChB,CAAa,CACJ,CACD,OAAO9J,GACf,EACIyH,EAAS,UAAU,gBAAkB,SAAUtb,EAAUZ,EAAW,CAChE,IAAIqc,EAAS,KAAK,eAAezb,EAAUZ,EAAW,EAAK,EAC3D,OAAOqc,GAAUA,EAAO,IAChC,EACIH,EAAS,UAAU,iBAAmB,SAAUuC,EAAgBze,EAAW0e,EAAe,CACtF,IAAIrC,EAAS,KAAK,eAAeoC,EAAgBze,EAAW,EAAK,EAC7D8c,EAAQT,GAAUA,EAAO,MAC7B,MAAI,CAACS,GAAS4B,IACVrC,EAAS,KAAK,cAAcqC,CAAa,EACzC5B,EAAQT,GAAUA,EAAO,OAEtBS,CACf,EACIZ,EAAS,UAAU,iBAAmB,SAAUzH,EAAUC,EAAUvhC,EAAIuM,EAASi/B,EAAS,CACtF,IAAIhf,EAAQxsB,EAAG,MAAOytB,EAAWztB,EAAG,SAAU2pC,EAAQ3pC,EAAG,MACzD,OAAI2pC,IAAUf,GAIH6C,GAAyBl/B,EAAQ,KAAK,EAAE+0B,EAAUC,CAAQ,EAEjEoI,IAAUb,GAEHvH,GAMPh1B,EAAQ,YACR+0B,EAAW,QAERqI,EAAMrI,EAAUC,EAAU8J,GAAyB,KAY1D,OAAQ,CACJ,SAAU5d,EACV,UAAWjB,EAAM,KAAK,MACtB,MAAOA,EACP,UAAWjgB,EAAQ,SAC/B,EAAWA,EAASi/B,GAAW,OAAO,OAAO,IAAI,CAAC,CAAC,EACnD,EACWzC,CACX,EAAC,EAED,SAASsC,GAAyBxK,EAAUZ,EAAmBgL,EAAW1+B,EAASi/B,EAAS,CACxF,IAAIpL,EAAiBS,EAAS,kBAAkBoK,CAAS,EACrDpe,EAAYsT,GAAuBC,CAAc,EACjDpb,EAAYimB,EAAU,WAAa1+B,EAAQ,UAC3CvM,EAAKuM,EAAQ,MAAOm/B,EAAc1rC,EAAG,YAAa2rC,EAAU3rC,EAAG,QACnE,MAAO,CACH,KAAMwoC,GAAuByC,CAAS,EACtC,MAAOA,EAAU,OAAS,KAC1B,UAAWpe,EACX,eAAgBuT,EAChB,UAAWpb,EACX,YAAasG,EACb,YAAaogB,EACb,QAASF,EACT,MAAO3K,EAAS,MAChB,QAAS8K,EACT,UAAW,UAAY,CACnB,OAAO9K,EAAS,UAAUoI,GAA0B,UAAWhJ,EAAmBjb,CAAS,EAAGzY,CAAO,CACxG,EACD,aAAck/B,GAAyBl/B,EAAQ,KAAK,CAC5D,CACA,CACO,SAAS08B,GAA0B2C,EAAe3L,EAAmBjb,EAAW,CACnF,IAAI+c,EAAqB6J,EAAc,CAAC,EAAGv3B,EAAOu3B,EAAc,CAAC,EAAGC,EAAOD,EAAc,OACrF9jC,EACJ,OAAI,OAAOi6B,GAAuB,SAC9Bj6B,EAAU,CACN,UAAWi6B,EAIX,KAAM8J,EAAO,EAAIx3B,EAAO4rB,CACpC,GAGQn4B,EAAUiL,EAAS,GAAIgvB,CAAkB,EAGpCvC,EAAO,KAAK13B,EAAS,MAAM,IAC5BA,EAAQ,KAAOm4B,IAGnB,WAAW,UAAY,IAASn4B,EAAQ,OAAS,QACjD,WAAW,UAAY,IAASgN,EAAU,KAAK,EAAGa,GAAoB,MAAM,KAAKi2B,CAAa,CAAC,CAAC,EAErF9jC,EAAQ,YAAnB,SACAA,EAAQ,UAAYkd,GAEjBld,CACX,CACA,SAAS2jC,GAAyBvsC,EAAO,CACrC,OAAO,SAAsBoiC,EAAUC,EAAU,CAC7C,GAAIn9B,EAAQk9B,CAAQ,GAAKl9B,EAAQm9B,CAAQ,EACrC,MAAMnrB,GAAkB,CAAC,EAM7B,GAAIgR,EAAgBka,CAAQ,GAAKla,EAAgBma,CAAQ,EAAG,CACxD,IAAIuK,EAAQ5sC,EAAM,cAAcoiC,EAAU,YAAY,EAClDyK,EAAQ7sC,EAAM,cAAcqiC,EAAU,YAAY,EAClDyK,EAAcF,GAASC,GAASD,IAAUC,EAC9C,GAAIC,EACA,OAAOzK,EAEX,GAAIjW,EAAYgW,CAAQ,GAAKhB,GAAwBiB,CAAQ,EAIzD,OAAAriC,EAAM,MAAMoiC,EAAS,MAAOC,CAAQ,EAC7BD,EAEX,GAAIhB,GAAwBgB,CAAQ,GAAKhW,EAAYiW,CAAQ,EAKzD,OAAAriC,EAAM,MAAMoiC,EAAUC,EAAS,KAAK,EAC7BA,EAEX,GAAIjB,GAAwBgB,CAAQ,GAChChB,GAAwBiB,CAAQ,EAChC,OAAOxuB,EAASA,EAAS,CAAA,EAAIuuB,CAAQ,EAAGC,CAAQ,CAEvD,CACD,OAAOA,CACf,CACA,CC1kBA,SAAS0K,GAAiB1/B,EAAS2/B,EAAYC,EAAU,CACrD,IAAItvC,EAAM,GAAG,OAAOqvC,CAAU,EAAE,OAAOC,CAAQ,EAC3CC,EAAW7/B,EAAQ,QAAQ,IAAI1P,CAAG,EACtC,OAAKuvC,GACD7/B,EAAQ,QAAQ,IAAI1P,EAAMuvC,EACtB7/B,EAAQ,aAAe2/B,GAAc3/B,EAAQ,WAAa4/B,EACtD5/B,EACEwG,EAASA,EAAS,GAAIxG,CAAO,EAAG,CAAE,WAAY2/B,EAAY,SAAUC,CAAU,CAAA,GAErFC,CACX,CACA,IAAIC,GAA6B,UAAY,CACzC,SAASA,EAAYtjB,EAAOujB,EAAQ9kB,EAAW,CAC3C,KAAK,MAAQuB,EACb,KAAK,OAASujB,EACd,KAAK,UAAY9kB,CACpB,CACD,OAAA6kB,EAAY,UAAU,aAAe,SAAUntC,EAAOc,EAAI,CACtD,IAAI6U,EAAQ,KACR6S,EAAQ1nB,EAAG,MAAOmD,EAASnD,EAAG,OAAQkhC,EAASlhC,EAAG,OAAQglB,EAAYhlB,EAAG,UAAWusC,EAAYvsC,EAAG,UACnGwsC,EAAsB1e,GAAuBpG,CAAK,EAClDuO,EAASsK,KACbvb,EAAYjS,EAASA,EAAS,CAAE,EAAEyb,GAAiBge,CAAmB,CAAC,EAAGxnB,CAAS,EACnF,IAAIzY,EAAUwG,EAASA,EAAS,CAAE,MAAO7T,EAAO,QAAS,OAAO,OAAO,IAAI,EAAG,MAAO,SAAUoiC,EAAUC,EAAU,CAC3G,OAAOtL,EAAO,MAAMqL,EAAUC,CAAQ,CACzC,EAAE,UAAWvc,EAAW,UAAW6F,GAAmB7F,CAAS,GAAKwb,GAAuB9Y,EAAO,KAAK,SAAS,CAAC,EAAG,CAAE,UAAW,CAAC,CAAC6kB,EAAW,aAAc,IAAI,IAAO,WAAY,GAAO,SAAU,GAAO,QAAS,IAAI,GAAO,CAAA,EAChOj8B,EAAM,KAAK,oBAAoB,CAC/B,OAAQnN,GAAU,OAAO,OAAO,IAAI,EACpC,OAAQ+9B,EACR,aAAcsL,EAAoB,aAClC,UAAW,CAAE,IAAK,IAAI,GAAO,EAC7B,QAASjgC,CACrB,CAAS,EACD,GAAI,CAAC+e,EAAYhb,CAAG,EAChB,MAAM8F,GAAkB,GAAIjT,CAAM,EAItC,OAAAoJ,EAAQ,aAAa,QAAQ,SAAUvM,EAAIkhC,EAAQ,CAC/C,IAAIC,EAAcnhC,EAAG,YAAaysC,EAAYzsC,EAAG,UAAW0sC,EAAe1sC,EAAG,aAC1E2sC,EAAYthB,GAAc6V,CAAM,EACpC,GAAIuL,GAAaA,EAAU,IAAI,KAAM,CACjC,IAAIG,EAAU/3B,EAAM,YAAY43B,EAAWE,EAAWxL,EAAa50B,CAAO,EAC1E,GAAI+e,EAAYshB,CAAO,EAInB,OAIJzL,EAAcyL,CACjB,CACD,GAAI,WAAW,UAAY,IAAS,CAACrgC,EAAQ,UAAW,CACpD,IAAIsgC,EAA4B,OAAO,OAAO,IAAI,EAClDH,EAAa,QAAQ,SAAUlgB,EAAO,CAC9BA,EAAM,eACNqgB,EAA0BrgB,EAAM,KAAK,KAAK,EAAI,GAEtE,CAAiB,EACD,IAAIsgB,EAAoB,SAAU1M,EAAgB,CAC9C,OAAOyM,EAA0B1M,GAAuBC,CAAc,CAAC,IACnE,EACxB,EACoB2M,EAAqB,SAAU3M,EAAgB,CAC/C,IAAI4M,EAAYP,GAAaA,EAAU,IAAI,IAAIrM,CAAc,EAC7D,MAAO,GAAQ4M,GAAaA,EAAU,MAAQA,EAAU,KAAK,MACjF,EACgB,OAAO,KAAK7L,CAAW,EAAE,QAAQ,SAAUf,EAAgB,CAKnD0M,EAAkB1M,CAAc,GAChC,CAAC2M,EAAmB3M,CAAc,GAClC6M,GAAkBN,EAAWxL,EAAaf,EAAgB7zB,EAAQ,KAAK,CAE/F,CAAiB,CACJ,CACDrN,EAAM,MAAMgiC,EAAQC,CAAW,CAC3C,CAAS,EAMDjiC,EAAM,OAAOoR,EAAI,KAAK,EACfA,CACf,EACI+7B,EAAY,UAAU,oBAAsB,SAAUrsC,EAAI,CACtD,IAAI6U,EAAQ,KACRqsB,EAASlhC,EAAG,OAAQmD,EAASnD,EAAG,OAAQokB,EAAepkB,EAAG,aAAcuM,EAAUvM,EAAG,QAGzFysC,EAAYzsC,EAAG,UACX6gC,EAAW,KAAK,MAAM,SAGtBU,EAAW,OAAO,OAAO,IAAI,EAI7B9T,EAAYyT,GAAUL,EAAS,kBAAkBK,CAAM,GACvD5T,GAAsBnqB,EAAQihB,EAAc7X,EAAQ,WAAW,GAC9D20B,GAAU30B,EAAQ,MAAM,IAAI20B,EAAQ,YAAY,EACpC,OAAOzT,GAApB,WACA8T,EAAS,WAAa9T,GAU1B,IAAIyf,EAAY,UAAY,CACxB,IAAIplC,EAAUmhC,GAA0B,UAAW1H,EAAUh1B,EAAQ,SAAS,EAC9E,GAAI+e,EAAYxjB,EAAQ,IAAI,EAAG,CAC3B,IAAIk1B,EAAOzwB,EAAQ,aAAa,IAAIzE,EAAQ,KAAK,KAAK,EACtD,GAAIk1B,EAAM,CACN,IAAImQ,EAAWtM,EAAS,UAAU9tB,EAASA,EAAS,CAAE,EAAEjL,CAAO,EAAG,CAAE,KAAMk1B,EAAK,WAAW,CAAE,EAAGzwB,CAAO,EACtG,GAAI4gC,IAAa,OACb,OAAOA,CAEd,CACJ,CACD,OAAOtM,EAAS,UAAU/4B,EAASyE,CAAO,CACtD,EACYmgC,EAAe,IAAI,IACvB,KAAK,cAActoB,EAAcjhB,EAIjCoJ,EAASkhB,CAAQ,EAAE,QAAQ,SAAUlhB,EAASigB,EAAO,CACjD,IAAIxsB,EACAotC,EAAiB/f,GAAuBb,CAAK,EAC7C1sB,EAAQqD,EAAOiqC,CAAc,EAEjC,GADAV,EAAa,IAAIlgB,CAAK,EAClB1sB,IAAU,OAAQ,CAClB,IAAIsgC,EAAiBS,EAAS,kBAAkB,CAC5C,SAAUpT,EACV,UAAWjB,EAAM,KAAK,MACtB,MAAOA,EACP,UAAWjgB,EAAQ,SACvC,CAAiB,EACGygC,GAAYK,GAAkBZ,EAAWrM,CAAc,EACvDiE,GAAgBxvB,EAAM,kBAAkB/U,EAAO0sB,EAGnDA,EAAM,aACFyf,GAAiB1/B,EAAS,GAAO,EAAK,EACpCA,EAASygC,EAAS,EAIpBzB,EAAgB,OAGhB/e,EAAM,eACLlB,EAAY+Y,EAAa,GAAK/D,GAAwB+D,EAAa,KACpEkH,EAAgB2B,EAAU,aAAc7I,EAAa,GAEzD,IAAIsF,GAAQ9I,EAAS,iBAAiBpT,EAAUjB,EAAM,KAAK,MAAO+e,CAAa,EAC3E5B,GACAqD,GAAU,KAAO,CAEb,MAAOxgB,EACP,SAAUiB,EACV,MAAOkc,EAC/B,EAGoB2D,GAA2Bb,EAAWrM,CAAc,EAExDmB,EAAWh1B,EAAQ,MAAMg1B,GAAWvhC,EAAK,CAAE,EACvCA,EAAGogC,CAAc,EAAIiE,GACrBrkC,GACP,MACQ,WAAW,UAAY,IAC5B,CAACuM,EAAQ,YACT,CAACA,EAAQ,UACT,CAACipB,GAAsB,MAAMhJ,CAAK,GAIlC,CAACqU,EAAS,gBAAgBpT,EAAUjB,EAAM,KAAK,KAAK,GACpD,WAAW,UAAY,IAAS1X,EAAU,MAAM,GAAIuY,GAAuBb,CAAK,EAAGrpB,CAAM,CAEzG,CAAS,EAGD,GAAI,CACA,IAAI8mB,EAAK4W,EAAS,SAAS19B,EAAQ,CAC/B,SAAUsqB,EACV,aAAcrJ,EACd,YAAa7X,EAAQ,YACrB,YAAag1B,EACb,UAAW2L,CAC3B,CAAa,EAAGp7B,EAAKmY,EAAG,CAAC,EAAGkd,EAAYld,EAAG,CAAC,EAGhCiX,EAASA,GAAUpvB,EAGfq1B,IAEA5F,EAAWh1B,EAAQ,MAAMg1B,EAAU4F,CAAS,EAEnD,OACMhpC,EAAG,CAEN,GAAI,CAAC+iC,EACD,MAAM/iC,CACb,CACD,GAAiB,OAAO+iC,GAApB,SAA4B,CAC5B,IAAIqM,EAAUliB,GAAc6V,CAAM,EAM9BsM,EAAOjhC,EAAQ,QAAQ20B,CAAM,IAAM30B,EAAQ,QAAQ20B,CAAM,EAAI,CAAA,GASjE,GARIsM,EAAK,QAAQppB,CAAY,GAAK,IAElCopB,EAAK,KAAKppB,CAAY,EAMlB,KAAK,QACL,KAAK,OAAO,QAAQjhB,EAAQoqC,EAASnpB,EAAc7X,CAAO,GAC1D,OAAOghC,EAEX,IAAIE,EAAalhC,EAAQ,aAAa,IAAI20B,CAAM,EAChD,OAAIuM,GACAA,EAAW,YAAclhC,EAAQ,MAAMkhC,EAAW,YAAalM,CAAQ,EACvEkM,EAAW,UAAYC,GAAgBD,EAAW,UAAWhB,CAAS,EACtEC,EAAa,QAAQ,SAAUlgB,EAAO,CAAE,OAAOihB,EAAW,aAAa,IAAIjhB,CAAK,CAAE,CAAE,GAGpFjgB,EAAQ,aAAa,IAAI20B,EAAQ,CAC7B,YAAaK,EAIb,UAAWoM,GAAiBlB,CAAS,EAAI,OAASA,EAClD,aAAcC,CAClC,CAAiB,EAEEa,CACV,CACD,OAAOhM,CACf,EACI8K,EAAY,UAAU,kBAAoB,SAAUvsC,EAAO0sB,EAAOjgB,EAASkgC,EAAW,CAClF,IAAI53B,EAAQ,KACZ,MAAI,CAAC2X,EAAM,cAAgB1sB,IAAU,KAI1B,WAAW,UAAY,GAAQ66B,GAAU76B,CAAK,EAAIA,EAEzDsE,EAAQtE,CAAK,EACNA,EAAM,IAAI,SAAU8gB,EAAM5iB,EAAG,CAChC,IAAI8B,EAAQ+U,EAAM,kBAAkB+L,EAAM4L,EAAOjgB,EAAS8gC,GAAkBZ,EAAWzuC,CAAC,CAAC,EACzF,OAAAsvC,GAA2Bb,EAAWzuC,CAAC,EAChC8B,CACvB,CAAa,EAEE,KAAK,oBAAoB,CAC5B,OAAQA,EACR,aAAc0sB,EAAM,aACpB,QAASjgB,EACT,UAAWkgC,CACvB,CAAS,CACT,EAGIJ,EAAY,UAAU,cAAgB,SAAUjoB,EAAcjhB,EAAQoJ,EAASkhB,EAAU,CACjFA,IAAa,SAAUA,EAAWH,GAAsBnqB,EAAQihB,EAAc7X,EAAQ,WAAW,GACrG,IAAIqhC,EAAW,IAAI,IACf/M,EAAW,KAAK,MAAM,SACtBgN,EAAe,IAAIznB,GAAK,EAAK,EACjC,OAAC,SAAS0nB,EAAQ1pB,EAAc2pB,EAAkB,CAC9C,IAAIC,EAAcH,EAAa,OAAOzpB,EAKtC2pB,EAAiB,WAAYA,EAAiB,QAAQ,EAClDC,EAAY,UAEhBA,EAAY,QAAU,GACtB5pB,EAAa,WAAW,QAAQ,SAAU2D,EAAW,CACjD,GAAKhD,GAAcgD,EAAWxb,EAAQ,SAAS,EAE/C,KAAI2/B,EAAa6B,EAAiB,WAAY5B,EAAW4B,EAAiB,SAyB1E,GApBA,EAAE7B,GAAcC,IACZ/Y,GAAgBrL,EAAU,UAAU,GACpCA,EAAU,WAAW,QAAQ,SAAU8W,EAAK,CACxC,IAAI1yB,EAAO0yB,EAAI,KAAK,MAGpB,GAFI1yB,IAAS,WACT+/B,EAAa,IACb//B,IAAS,QAAS,CAClB,IAAIrN,EAAOquB,GAAyB0R,EAAKtyB,EAAQ,SAAS,GAKtD,CAACzN,GAAQA,EAAK,KAAO,MACrBqtC,EAAW,GAIlB,CACzB,CAAqB,EAED5e,GAAQxF,CAAS,EAAG,CACpB,IAAIuZ,EAAWsM,EAAS,IAAI7lB,CAAS,EACjCuZ,IAIA4K,EAAaA,GAAc5K,EAAS,WACpC6K,EAAWA,GAAY7K,EAAS,UAEpCsM,EAAS,IAAI7lB,EAAWkkB,GAAiB1/B,EAAS2/B,EAAYC,CAAQ,CAAC,CAC1E,KACI,CACD,IAAItkB,EAAWC,GAAyBC,EAAWxb,EAAQ,cAAc,EACzE,GAAI,CAACsb,GAAYE,EAAU,OAASpN,EAAK,gBACrC,MAAMvE,GAAkB,GAAI2R,EAAU,KAAK,KAAK,EAEhDF,GACAgZ,EAAS,gBAAgBhZ,EAAU4F,EAAUtqB,EAAQoJ,EAAQ,SAAS,GACtEuhC,EAAQjmB,EAAS,aAAcokB,GAAiB1/B,EAAS2/B,EAAYC,CAAQ,CAAC,CAErF,EACjB,CAAa,EACb,EAAW/nB,EAAc7X,CAAO,EACjBqhC,CACf,EACIvB,EAAY,UAAU,YAAc,SAAUI,EAAWnL,EAAUC,EAAUh1B,EAAS0hC,EAAgB,CAClG,IAAIjuC,EACA6U,EAAQ,KACZ,GAAI43B,EAAU,IAAI,MAAQ,CAACnhB,EAAYiW,CAAQ,EAAG,CAC9C,IAAI2M,EAIH,CAAC9pC,EAAQm9B,CAAQ,IAIbjW,EAAYgW,CAAQ,GAAKhB,GAAwBgB,CAAQ,GAC1DA,EACE,OAIF6M,EAAM5M,EAKN2M,GAAO,CAACD,IACRA,EAAiB,CAAC3iB,EAAY4iB,CAAG,EAAIA,EAAI,MAAQA,CAAG,GAOxD,IAAIvM,EACAyM,EAAa,SAAU/5B,EAAMlI,EAAM,CACnC,OAAQ/H,EAAQiQ,CAAI,EAChB,OAAOlI,GAAS,SACZkI,EAAKlI,CAAI,EACP,OACJI,EAAQ,MAAM,cAAc8H,EAAM,OAAOlI,CAAI,CAAC,CACpE,EACYsgC,EAAU,IAAI,QAAQ,SAAUO,EAAW5M,EAAgB,CACvD,IAAIiO,EAAOD,EAAWF,EAAK9N,CAAc,EACrCkO,EAAOF,EAAWD,EAAK/N,CAAc,EAEzC,GAAekO,IAAX,OAEJ,CAAIL,GACAA,EAAe,KAAK7N,CAAc,EAEtC,IAAImO,EAAO15B,EAAM,YAAYm4B,EAAWqB,EAAMC,EAAM/hC,EAAS0hC,CAAc,EACvEM,IAASD,IACT3M,EAAkBA,GAAmB,IAAI,IACzCA,EAAgB,IAAIvB,EAAgBmO,CAAI,GAExCN,GACAn5B,EAAUm5B,EAAe,IAAK,IAAK7N,CAAc,EAErE,CAAa,EACGuB,IAEAJ,EAAYn9B,EAAQ+pC,CAAG,EAAIA,EAAI,MAAM,CAAC,EAAIp7B,EAAS,GAAIo7B,CAAG,EAC1DxM,EAAgB,QAAQ,SAAU7hC,EAAOqM,EAAM,CAC3Co1B,EAASp1B,CAAI,EAAIrM,CACrC,CAAiB,EAER,CACD,OAAI2sC,EAAU,KACH,KAAK,MAAM,SAAS,iBAAiBnL,EAAUC,EAAUkL,EAAU,KAAMlgC,EAAS0hC,IAAmBjuC,EAAKuM,EAAQ,OAAO,WAAW,MAAMvM,EAAIiuC,CAAc,CAAC,EAEjK1M,CACf,EACW8K,CACX,EAAC,EAEGmC,GAAqB,CAAA,EACzB,SAASnB,GAAkBrtC,EAAImM,EAAM,CACjC,IAAI1E,EAAMzH,EAAG,IACb,OAAKyH,EAAI,IAAI0E,CAAI,GACb1E,EAAI,IAAI0E,EAAMqiC,GAAmB,OAAS,CAAE,IAAK,IAAI,GAAK,CAAE,EAEzD/mC,EAAI,IAAI0E,CAAI,CACvB,CACA,SAASuhC,GAAgB/a,EAAMC,EAAO,CAClC,GAAID,IAASC,GAAS,CAACA,GAAS+a,GAAiB/a,CAAK,EAClD,OAAOD,EACX,GAAI,CAACA,GAAQgb,GAAiBhb,CAAI,EAC9B,OAAOC,EACX,IAAIoK,EAAOrK,EAAK,MAAQC,EAAM,KAAO7f,EAASA,EAAS,CAAE,EAAE4f,EAAK,IAAI,EAAGC,EAAM,IAAI,EAAID,EAAK,MAAQC,EAAM,KACpG6b,EAAkB9b,EAAK,IAAI,MAAQC,EAAM,IAAI,KAC7CnrB,EAAMgnC,EAAkB,IAAI,IAC1B9b,EAAK,IAAI,KAAOA,EAAK,IACjBC,EAAM,IACZ4O,EAAS,CAAE,KAAMxE,EAAM,IAAKv1B,CAAG,EACnC,GAAIgnC,EAAiB,CACjB,IAAIC,EAAuB,IAAI,IAAI9b,EAAM,IAAI,KAAI,CAAE,EACnDD,EAAK,IAAI,QAAQ,SAAUgc,EAAU9xC,EAAK,CACtC2kC,EAAO,IAAI,IAAI3kC,EAAK6wC,GAAgBiB,EAAU/b,EAAM,IAAI,IAAI/1B,CAAG,CAAC,CAAC,EACjE6xC,EAAqB,OAAO7xC,CAAG,CAC3C,CAAS,EACD6xC,EAAqB,QAAQ,SAAU7xC,EAAK,CACxC2kC,EAAO,IAAI,IAAI3kC,EAAK6wC,GAAgB9a,EAAM,IAAI,IAAI/1B,CAAG,EAAG81B,EAAK,IAAI,IAAI91B,CAAG,CAAC,CAAC,CACtF,CAAS,CACJ,CACD,OAAO2kC,CACX,CACA,SAASmM,GAAiB1H,EAAM,CAC5B,MAAO,CAACA,GAAQ,EAAEA,EAAK,MAAQA,EAAK,IAAI,KAC5C,CACA,SAASqH,GAA2BttC,EAAImM,EAAM,CAC1C,IAAI1E,EAAMzH,EAAG,IACTgtC,EAAYvlC,EAAI,IAAI0E,CAAI,EACxB6gC,GAAaW,GAAiBX,CAAS,IACvCwB,GAAmB,KAAKxB,CAAS,EACjCvlC,EAAI,OAAO0E,CAAI,EAEvB,CACA,IAAIyiC,GAAW,IAAI,IAGnB,SAAS3B,GAAkB4B,EAAaC,EAAa1O,EAAgBlhC,EAAO,CACxE,IAAI6vC,EAAW,SAAUhO,EAAU,CAC/B,IAAIta,EAAQvnB,EAAM,cAAc6hC,EAAUX,CAAc,EACxD,OAAO,OAAO3Z,GAAU,UAAYA,CAC5C,EACQ6a,EAAWyN,EAASF,CAAW,EACnC,GAAKvN,EAEL,KAAIC,EAAWwN,EAASD,CAAW,EACnC,GAAKvN,GAID,CAAAjW,EAAYgW,CAAQ,GAIpB,CAAAhF,GAAMgF,EAAUC,CAAQ,GAKxB,QAAO,KAAKD,CAAQ,EAAE,MAAM,SAAUzkC,EAAK,CAAE,OAAOqC,EAAM,cAAcqiC,EAAU1kC,CAAG,IAAM,MAAO,CAAE,EAGxG,KAAImyC,EAAa9vC,EAAM,cAAc2vC,EAAa,YAAY,GAC1D3vC,EAAM,cAAc4vC,EAAa,YAAY,EAC7CjiB,EAAYsT,GAAuBC,CAAc,EACjD6O,EAAc,GAAG,OAAOD,EAAY,GAAG,EAAE,OAAOniB,CAAS,EAE7D,GAAI,CAAA+hB,GAAS,IAAIK,CAAW,EAE5B,CAAAL,GAAS,IAAIK,CAAW,EACxB,IAAIC,EAAiB,CAAA,EAGjB,CAAC9qC,EAAQk9B,CAAQ,GAAK,CAACl9B,EAAQm9B,CAAQ,GACvC,CAACD,EAAUC,CAAQ,EAAE,QAAQ,SAAU9a,EAAO,CAC1C,IAAIgH,EAAWvuB,EAAM,cAAcunB,EAAO,YAAY,EAClD,OAAOgH,GAAa,UAAY,CAACyhB,EAAe,SAASzhB,CAAQ,GACjEyhB,EAAe,KAAKzhB,CAAQ,CAE5C,CAAS,EAEL,WAAW,UAAY,IAAS3Y,EAAU,KAAK,GAAI+X,EAAWmiB,EAAYE,EAAe,OACrF,qCACIA,EAAe,KAAK,OAAO,EAC3B,8CACF,GAAID,EAAal8B,EAAS,GAAIuuB,CAAQ,EAAGvuB,EAAS,CAAA,EAAIwuB,CAAQ,CAAC,IACzE,CC/fA,IAAI4N,GAA+B,SAAUx6B,EAAQ,CACjD9B,GAAUs8B,EAAex6B,CAAM,EAC/B,SAASw6B,EAAc9pC,EAAQ,CACvBA,IAAW,SAAUA,EAAS,CAAE,GACpC,IAAIwP,EAAQF,EAAO,KAAK,IAAI,GAAK,KACjC,OAAAE,EAAM,QAAU,IAAI,IACpBA,EAAM,qBAAuB,IAAI4d,GAAkB+C,EAAqB,EAGxE3gB,EAAM,uBAAyB,GAC/BA,EAAM,QAAU2xB,GAChB3xB,EAAM,QAAU,EAChBA,EAAM,OAASirB,GAAgBz6B,CAAM,EACrCwP,EAAM,YAAc,CAAC,CAACA,EAAM,OAAO,YACnCA,EAAM,SAAW,IAAIk0B,GAAS,CAC1B,MAAOl0B,EACP,iBAAkBA,EAAM,OAAO,iBAC/B,cAAeA,EAAM,OAAO,cAC5B,aAAcA,EAAM,OAAO,YACvC,CAAS,EACDA,EAAM,KAAI,EACHA,CACV,CACD,OAAAs6B,EAAc,UAAU,KAAO,UAAY,CAIvC,IAAIC,EAAa,KAAK,KAAO,IAAIxO,GAAY,KAAK,CAC9C,SAAU,KAAK,SACf,cAAe,KAAK,OAAO,aAC9B,CAAA,EAMD,KAAK,eAAiBwO,EAAU,MAChC,KAAK,iBAAgB,CAC7B,EACID,EAAc,UAAU,iBAAmB,SAAUE,EAAuB,CACxE,IAAIx6B,EAAQ,KACRy6B,EAAiB,KAAK,YACtB9nB,EAAY,KAAK,OAAO,UAI5B,KAAK,YAAc,IAAI6kB,GAAY,KAAO,KAAK,YAAc,IAAItH,GAAY,CACzE,MAAO,KACP,YAAa,KAAK,YAClB,mBAAoB,KAAK,OAAO,mBAChC,gBAAiBhF,GAAsB,KAAK,MAAM,EAClD,MAAOsP,EAAwB,OAAUC,GAAkBA,EAAe,MAC1E,UAAW9nB,CACvB,CAAS,EAAIA,CAAS,EACd,KAAK,oBAAsB1R,GAAK,SAAUy5B,EAAGznC,EAAS,CAClD,OAAO+M,EAAM,eAAe06B,EAAGznC,CAAO,CAClD,EAAW,CACC,IAAK,KAAK,OAAO,oBACbshB,GAAW,mCAAmC,GAC9C,IACJ,aAAc,SAAUmmB,EAAG,CAGvB,IAAIrwC,EAAQqwC,EAAE,WAAa16B,EAAM,eAAiBA,EAAM,KACxD,GAAI4uB,GAAsBvkC,CAAK,EAAG,CAC9B,IAAIkzB,EAAamd,EAAE,WAAYz9B,EAAKy9B,EAAE,GAAIvqB,EAAYuqB,EAAE,UACxD,OAAOrwC,EAAM,aAAaqwC,EAAE,MAO5BA,EAAE,SAAU1kB,GAAmB,CAAE,WAAYuH,EAAY,GAAItgB,EAAI,UAAWkT,CAAS,CAAE,CAAC,CAC3F,CACJ,CACb,CAAS,EAID,IAAI,IAAI,CAAC,KAAK,KAAK,MAAO,KAAK,eAAe,KAAK,CAAC,EAAE,QAAQ,SAAU8b,EAAO,CAC3E,OAAOA,EAAM,cACzB,CAAS,CACT,EACIqO,EAAc,UAAU,QAAU,SAAU5oB,EAAM,CAC9C,YAAK,KAAI,EAILA,GACA,KAAK,KAAK,QAAQA,CAAI,EACnB,IACf,EACI4oB,EAAc,UAAU,QAAU,SAAU/c,EAAY,CACpD,OAAIA,IAAe,SAAUA,EAAa,KAClCA,EAAa,KAAK,eAAiB,KAAK,MAAM,SAC9D,EACI+c,EAAc,UAAU,KAAO,SAAUrnC,EAAS,CAC9C,IAQA9H,EAAK8H,EAAQ,kBAQbq9B,EAAoBnlC,IAAO,OAAS,GAAQA,EAC5C,GAAI,CACA,OAAQ,KAAK,YAAY,sBAAsB+S,EAASA,EAAS,CAAE,EAAEjL,CAAO,EAAG,CAAE,MAAOA,EAAQ,WAAa,KAAK,eAAiB,KAAK,KAAM,OAAQ,KAAK,OAAQ,kBAAmBq9B,CAAmB,CAAA,CAAC,EAAE,QAAU,IACzN,OACMhnC,EAAG,CACN,GAAIA,aAAaohC,GAMb,OAAO,KAEX,MAAMphC,CACT,CACT,EACIgxC,EAAc,UAAU,MAAQ,SAAUrnC,EAAS,CAC/C,GAAI,CACA,QAAE,KAAK,QACA,KAAK,YAAY,aAAa,KAAK,KAAMA,CAAO,CAC1D,QACO,CACA,CAAC,EAAE,KAAK,SAAWA,EAAQ,YAAc,IACzC,KAAK,iBAAgB,CAE5B,CACT,EACIqnC,EAAc,UAAU,OAAS,SAAUrnC,EAAS,CAChD,GAAI03B,EAAO,KAAK13B,EAAS,IAAI,GAAK,CAACA,EAAQ,GAUvC,MAAO,GAEX,IAAI5I,EAAU4I,EAAQ,WAElB,KAAK,eACH,KAAK,KACX,GAAI,CACA,QAAE,KAAK,QACA5I,EAAM,OAAO4I,EAAQ,IAAM,aAAcA,EAAQ,MAAM,CACjE,QACO,CACA,CAAC,EAAE,KAAK,SAAWA,EAAQ,YAAc,IACzC,KAAK,iBAAgB,CAE5B,CACT,EACIqnC,EAAc,UAAU,KAAO,SAAUrnC,EAAS,CAC9C,OAAO,KAAK,YAAY,sBAAsBiL,EAASA,EAAS,CAAE,EAAEjL,CAAO,EAAG,CAAE,MAAOA,EAAQ,WAAa,KAAK,eAAiB,KAAK,KAAM,OAAQA,EAAQ,IAAM,aAAc,OAAQ,KAAK,MAAM,CAAE,CAAC,CAC/M,EACIqnC,EAAc,UAAU,MAAQ,SAAUK,EAAO,CAC7C,IAAI36B,EAAQ,KACZ,OAAK,KAAK,QAAQ,MAWd0xB,GAAY,IAAI,EAEpB,KAAK,QAAQ,IAAIiJ,CAAK,EAClBA,EAAM,WACN,KAAK,oBAAoBA,CAAK,EAE3B,UAAY,CAIX36B,EAAM,QAAQ,OAAO26B,CAAK,GAAK,CAAC36B,EAAM,QAAQ,MAC9CwxB,GAAYxxB,CAAK,EAKrBA,EAAM,oBAAoB,OAAO26B,CAAK,CAClD,CACA,EACIL,EAAc,UAAU,GAAK,SAAUrnC,EAAS,CAC5C,IAAI9H,EACJ6qB,GAAmB,MAAK,EACxBlH,GAAM,MAAK,EACX,KAAK,qBAAqB,cACzB3jB,EAAK,KAAK,OAAO,aAAe,MAAQA,IAAO,QAAkBA,EAAG,YAAW,EAChF,IAAI8iC,EAAM,KAAK,eAAe,GAAE,EAChC,OAAIh7B,GAAW,CAAC,KAAK,UACbA,EAAQ,iBACR,KAAK,iBAAiBA,EAAQ,qBAAqB,EAE9CA,EAAQ,uBACb,KAAK,YAAY,cAGlBg7B,CACf,EAQIqM,EAAc,UAAU,OAAS,SAAUtM,EAAQzQ,EAAY,CAC3D,OAAQA,EAAa,KAAK,eAAiB,KAAK,MAAM,OAAOyQ,CAAM,CAC3E,EAMIsM,EAAc,UAAU,QAAU,SAAUtM,EAAQzQ,EAAY,CAC5D,OAAQA,EAAa,KAAK,eAAiB,KAAK,MAAM,QAAQyQ,CAAM,CAC5E,EAOIsM,EAAc,UAAU,SAAW,SAAUhwB,EAAQ,CACjD,GAAImM,EAAYnM,CAAM,EAClB,OAAOA,EAAO,MAClB,GAAI,CACA,OAAO,KAAK,SAAS,SAASA,CAAM,EAAE,CAAC,CAC1C,OACMhhB,EAAG,CACN,WAAW,UAAY,IAAS2W,EAAU,KAAK3W,CAAC,CACnD,CACT,EACIgxC,EAAc,UAAU,MAAQ,SAAUrnC,EAAS,CAC/C,GAAI,CAACA,EAAQ,GAAI,CACb,GAAI03B,EAAO,KAAK13B,EAAS,IAAI,EAGzB,MAAO,GAEXA,EAAUiL,EAASA,EAAS,CAAE,EAAEjL,CAAO,EAAG,CAAE,GAAI,YAAY,CAAE,CACjE,CACD,GAAI,CAKA,QAAE,KAAK,QAIA,KAAK,eAAe,MAAMA,EAAS,KAAK,IAAI,CACtD,QACO,CACA,CAAC,EAAE,KAAK,SAAWA,EAAQ,YAAc,IACzC,KAAK,iBAAgB,CAE5B,CACT,EACIqnC,EAAc,UAAU,MAAQ,SAAUrnC,EAAS,CAC/C,IAAI+M,EAAQ,KACZ,YAAK,KAAI,EACTgW,GAAmB,MAAK,EACpB/iB,GAAWA,EAAQ,gBAGnB,KAAK,QAAQ,QAAQ,SAAU0nC,EAAO,CAAE,OAAO36B,EAAM,oBAAoB,OAAO26B,CAAK,CAAI,CAAA,EACzF,KAAK,QAAQ,QACbnJ,GAAY,IAAI,GAShB,KAAK,iBAAgB,EAElB,QAAQ,SACvB,EACI8I,EAAc,UAAU,iBAAmB,SAAUM,EAAY,CAC7D,IAAIC,EAAoB,KAAK,eAAe,YAAYD,CAAU,EAC9DC,IAAsB,KAAK,iBAC3B,KAAK,eAAiBA,EACtB,KAAK,iBAAgB,EAEjC,EACIP,EAAc,UAAU,MAAQ,SAAUrnC,EAAS,CAC/C,IAAI+M,EAAQ,KACRyqB,EAASx3B,EAAQ,OAAQ9H,EAAK8H,EAAQ,WAAYsqB,EAAapyB,IAAO,OAAS,GAAOA,EAAI2vC,EAAmB7nC,EAAQ,iBAAkB8nC,EAAiB9nC,EAAQ,eAChKk3B,EACA6Q,EAAU,SAAUC,EAAO,CAC3B,IAAI9vC,EAAK6U,EAAO0R,EAAOvmB,EAAG,KAAM+vC,EAAiB/vC,EAAG,eACpD,EAAE6U,EAAM,QACJi7B,IACAj7B,EAAM,KAAOA,EAAM,eAAiBi7B,GAExC,GAAI,CACA,OAAQ9Q,EAAeM,EAAOzqB,CAAK,CACtC,QACO,CACJ,EAAEA,EAAM,QACRA,EAAM,KAAO0R,EACb1R,EAAM,eAAiBk7B,CAC1B,CACb,EACYC,EAAe,IAAI,IACvB,OAAIJ,GAAkB,CAAC,KAAK,SAUxB,KAAK,iBAAiB78B,EAASA,EAAS,CAAA,EAAIjL,CAAO,EAAG,CAAE,eAAgB,SAAU0nC,EAAO,CACjF,OAAAQ,EAAa,IAAIR,CAAK,EACf,EACV,CAAA,CAAE,CAAC,EAER,OAAOpd,GAAe,SAItB,KAAK,eAAiB,KAAK,eAAe,SAASA,EAAYyd,CAAO,EAEjEzd,IAAe,GAMpByd,EAAQ,KAAK,IAAI,EAKjBA,IAEA,OAAOF,GAAqB,WAC5B,KAAK,eAAiB,KAAK,eAAe,YAAYA,CAAgB,GAKtEC,GAAkBI,EAAa,MAC/B,KAAK,iBAAiBj9B,EAASA,EAAS,CAAE,EAAEjL,CAAO,EAAG,CAAE,eAAgB,SAAU0nC,EAAOnQ,EAAM,CACvF,IAAIl8B,EAASysC,EAAe,KAAK,KAAMJ,EAAOnQ,CAAI,EAClD,OAAIl8B,IAAW,IAIX6sC,EAAa,OAAOR,CAAK,EAEtBrsC,CACV,CAAA,CAAE,CAAC,EAGJ6sC,EAAa,MACbA,EAAa,QAAQ,SAAUR,EAAO,CAAE,OAAO36B,EAAM,oBAAoB,MAAM26B,CAAK,CAAE,CAAE,GAO5F,KAAK,iBAAiB1nC,CAAO,EAE1Bk3B,CACf,EACImQ,EAAc,UAAU,mBAAqB,SAAU7P,EAAQP,EAAc,CACzE,OAAO,KAAK,MAAM,CACd,OAAQO,EACR,WAAYP,GAAgBA,IAAiB,IACzD,CAAS,CACT,EACIoQ,EAAc,UAAU,kBAAoB,SAAUxpB,EAAU,CAC5D,OAAO,KAAK,sBAAsB,KAAK,uBAAuBA,CAAQ,CAAC,CAC/E,EACIwpB,EAAc,UAAU,iBAAmB,SAAUrnC,EAAS,CAC1D,IAAI+M,EAAQ,KACP,KAAK,SACN,KAAK,QAAQ,QAAQ,SAAU06B,EAAG,CAAE,OAAO16B,EAAM,oBAAoB06B,EAAGznC,CAAO,CAAI,CAAA,CAE/F,EACIqnC,EAAc,UAAU,uBAAyB,SAAUxpB,EAAU,CACjE,IAAI6B,EAAY,KAAK,OAAO,UAC5B,OAAOA,EAAYA,EAAU,UAAU7B,CAAQ,EAAIA,CAC3D,EACIwpB,EAAc,UAAU,sBAAwB,SAAUxpB,EAAU,CAChE,OAAI,KAAK,YACE,KAAK,qBAAqB,kBAAkBA,CAAQ,EAExDA,CACf,EAOIwpB,EAAc,UAAU,eAAiB,SAAUI,EAAGznC,EAAS,CAC3D,IAAImoC,EAAWV,EAAE,SAOblQ,EAAO,KAAK,KAAKkQ,CAAC,EAClBznC,IACIynC,EAAE,YAAc,OAAOznC,EAAQ,YAAe,WAC9Cu3B,EAAK,0BAA4B,IAEjCv3B,EAAQ,gBACRA,EAAQ,eAAe,KAAK,KAAMynC,EAAGlQ,EAAM4Q,CAAQ,IAAM,MAM7D,CAACA,GAAY,CAAC3T,GAAM2T,EAAS,OAAQ5Q,EAAK,MAAM,IAChDkQ,EAAE,SAAUA,EAAE,SAAWlQ,EAAO4Q,CAAQ,CAEpD,EACWd,CACX,EAAErQ,EAAW,EAET,WAAW,UAAY,KACvBqQ,GAAc,UAAU,mBAAqBzlB,IC1c1C,SAASwmB,IAAyB,CAErC,QADI1oB,EAAY,CAAA,EACPzR,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCyR,EAAUzR,CAAE,EAAI,UAAUA,CAAE,EAEhC,OAAO,IAAKo6B,GAAiB,KAAK,MAAMA,GAAkBh8B,EAAc,CAAC,MAAM,EAAGqT,EAAW,EAAK,CAAC,EACvG,CACA,IAAI2oB,GAAkC,UAAY,CAI9C,SAASA,GAAmB,CAExB,QADI3oB,EAAY,CAAA,EACPzR,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCyR,EAAUzR,CAAE,EAAI,UAAUA,CAAE,EAEhC,KAAK,SAAW,OAAO,OAAO,IAAI,EAClC,KAAK,YAAW,EACZyR,EAAU,QACV,KAAK,SAAS,MAAM,KAAMA,CAAS,CAE1C,CACD,OAAA2oB,EAAiB,UAAU,SAAW,UAAY,CAG9C,QAFIt7B,EAAQ,KACR2S,EAAY,CAAA,EACPzR,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCyR,EAAUzR,CAAE,EAAI,UAAUA,CAAE,EAEhC,IAAIq6B,EAAc,IAAI,IACtB,OAAA5oB,EAAU,QAAQ,SAAUoG,EAAK,CAC7BI,GAAuBJ,CAAG,EAAE,QAAQ,SAAUzU,EAAM,CAChDi3B,EAAY,IAAIj3B,EAAK,KAAK,MAAOA,CAAI,CACrD,CAAa,CACb,CAAS,EACDi3B,EAAY,QAAQ,SAAUj3B,EAAMhN,EAAM,CAClCgN,IAAStE,EAAM,SAAS1I,CAAI,IAC5B0I,EAAM,SAAS1I,CAAI,EAAIgN,EACvBtE,EAAM,WAAW1I,CAAI,EAErC,CAAS,EACM,IACf,EAEIgkC,EAAiB,UAAU,WAAa,SAAUhkC,EAAM,CAAA,EACxDgkC,EAAiB,UAAU,YAAc,UAAY,CACjD,IAAIn0C,EAAQm0C,EAAiB,UAC7B,KAAK,YAAc,KAAK,OAASr6B,GAAK9Z,EAAM,OAAO,KAAK,IAAI,EAAG,CAC3D,aAAc,SAAU2C,EAAK,CAAE,OAAOA,CAAM,EAC5C,IAAKyqB,GAAW,yBAAyB,GACrC,GACP,CAAA,GAAG,MACJ,KAAK,UAAYtT,GAAK9Z,EAAM,UAAU,KAAK,IAAI,EAAG,CAC9C,MAAO2sB,GACP,IAAKS,GAAW,4BAA4B,GACxC,GAChB,CAAS,EACD,KAAK,oBAAsBtT,GAAK9Z,EAAM,oBAAoB,KAAK,IAAI,EAAG,CAClE,MAAO2sB,GACP,IAAKS,GAAW,sCAAsC,GAClD,GAChB,CAAS,CACT,EAMI+mB,EAAiB,UAAU,OAAS,SAAU7oB,EAAc,CACxD,OAAO,KAAK,SAASA,CAAY,GAAK,IAC9C,EACI6oB,EAAiB,UAAU,UAAY,SAAUxqB,EAAU,CACvD,IAAI9Q,EAAQ,KACRw7B,EAAU,IAAI,IAClBriB,GAAuBrI,CAAQ,EAAE,QAAQ,SAAUgJ,EAAK,CACpD0hB,EAAQ,IAAI1hB,EAAI,KAAK,MAAOA,CAAG,CAC3C,CAAS,EACD,IAAI2hB,EAAU,IAAI,IACdpY,EAAU,SAAUqY,EAAY,CAC3BF,EAAQ,IAAIE,CAAU,GACvBD,EAAQ,IAAIC,CAAU,CAEtC,EACYC,EAAsB,SAAUr3B,EAAM,CACtC,OAAO,OAAO,KAAKtE,EAAM,oBAAoBsE,CAAI,CAAC,EAAE,QAAQ+e,CAAO,CAC/E,EACQsY,EAAoB7qB,CAAQ,EAC5B,IAAI2f,EAAU,CAAA,EACV79B,EAAM,OAAO,OAAO,IAAI,EAgB5B,GAbA6oC,EAAQ,QAAQ,SAAUhpB,EAAc,CACpC,IAAImpB,EAAmBJ,EAAQ,IAAI/oB,CAAY,EAC/C,GAAImpB,EACAD,EAAqB/oC,EAAI6f,CAAY,EAAImpB,CAAgB,MAExD,CACDnL,EAAQ,KAAKhe,CAAY,EACzB,IAAIqH,EAAM9Z,EAAM,OAAOyS,CAAY,EAC/BqH,GACA6hB,EAAqB/oC,EAAI6f,CAAY,EAAIqH,CAAG,CAEnD,CACb,CAAS,EACG2W,EAAQ,OAAQ,CAChB,IAAIoL,EAAiB,CAAA,EACrBpL,EAAQ,QAAQ,SAAUn5B,EAAM,CAC5B,IAAIwiB,EAAMlnB,EAAI0E,CAAI,EACdwiB,GACA+hB,EAAe,KAAK/hB,CAAG,CAE3C,CAAa,EACG+hB,EAAe,SACf/qB,EAAW5S,EAASA,EAAS,CAAE,EAAE4S,CAAQ,EAAG,CAAE,YAAaA,EAAS,YAAY,OAAO+qB,CAAc,CAAG,CAAA,EAE/G,CACD,OAAO/qB,CACf,EACIwqB,EAAiB,UAAU,oBAAsB,SAAU5tB,EAAM,CAC7D,IAAIouB,EAAU,OAAO,OAAO,IAAI,EAChC,OAAAruB,GAAMC,EAAM,CACR,eAAgB,SAAUpJ,EAAM,CAC5Bw3B,EAAQx3B,EAAK,KAAK,KAAK,EAAIA,CAC9B,CACb,CAAS,EACMw3B,CACf,EACWR,CACX,ICvIWS,IACV,SAAUA,EAAe,CAMtBA,EAAcA,EAAc,QAAa,CAAC,EAAI,UAK9CA,EAAcA,EAAc,aAAkB,CAAC,EAAI,eAKnDA,EAAcA,EAAc,UAAe,CAAC,EAAI,YAKhDA,EAAcA,EAAc,QAAa,CAAC,EAAI,UAM9CA,EAAcA,EAAc,KAAU,CAAC,EAAI,OAI3CA,EAAcA,EAAc,MAAW,CAAC,EAAI,QAI5CA,EAAcA,EAAc,MAAW,CAAC,EAAI,OAChD,GAAGA,KAAkBA,GAAgB,CAAE,EAAC,EAKjC,SAASC,GAAyBC,EAAe,CACpD,OAAOA,EAAgBA,EAAgB,EAAI,EAC/C,CC7CA,IAAIC,GAAW,IAAI,IACfC,GAAoB,IAAI,IACxBC,GAAwB,GACxBC,GAAgC,GACpC,SAAS3I,GAAU4I,EAAQ,CACvB,OAAOA,EAAO,QAAQ,UAAW,GAAG,EAAE,KAAI,CAC9C,CACA,SAASC,GAAgBh4B,EAAK,CAC1B,OAAOmvB,GAAUnvB,EAAI,OAAO,KAAK,UAAUA,EAAI,MAAOA,EAAI,GAAG,CAAC,CAClE,CACA,SAASi4B,GAAiBztB,EAAK,CAC3B,IAAI0tB,EAAW,IAAI,IACflB,EAAc,CAAA,EAClB,OAAAxsB,EAAI,YAAY,QAAQ,SAAU2K,EAAoB,CAClD,GAAIA,EAAmB,OAAS,qBAAsB,CAClD,IAAIjH,EAAeiH,EAAmB,KAAK,MACvC+H,EAAY8a,GAAgB7iB,EAAmB,GAAG,EAClDgjB,EAAeP,GAAkB,IAAI1pB,CAAY,EACjDiqB,GAAgB,CAACA,EAAa,IAAIjb,CAAS,EACvC2a,IACA,QAAQ,KAAK,+BAAiC3pB,EAAe;AAAA;AAAA,6EAEuB,EAGlFiqB,GACNP,GAAkB,IAAI1pB,EAAciqB,EAAe,IAAI,GAAG,EAE9DA,EAAa,IAAIjb,CAAS,EACrBgb,EAAS,IAAIhb,CAAS,IACvBgb,EAAS,IAAIhb,CAAS,EACtB8Z,EAAY,KAAK7hB,CAAkB,EAE1C,MAEG6hB,EAAY,KAAK7hB,CAAkB,CAE/C,CAAK,EACMxb,EAASA,EAAS,GAAI6Q,CAAG,EAAG,CAAE,YAAawsB,CAAW,CAAE,CACnE,CACA,SAASoB,GAAS5jB,EAAK,CACnB,IAAIqN,EAAU,IAAI,IAAIrN,EAAI,WAAW,EACrCqN,EAAQ,QAAQ,SAAU9hB,EAAM,CACxBA,EAAK,KACL,OAAOA,EAAK,IAChB,OAAO,KAAKA,CAAI,EAAE,QAAQ,SAAUtc,EAAK,CACrC,IAAIiD,EAAQqZ,EAAKtc,CAAG,EAChBiD,GAAS,OAAOA,GAAU,UAC1Bm7B,EAAQ,IAAIn7B,CAAK,CAEjC,CAAS,CACT,CAAK,EACD,IAAIsZ,EAAMwU,EAAI,IACd,OAAIxU,IACA,OAAOA,EAAI,WACX,OAAOA,EAAI,UAERwU,CACX,CACA,SAAS6jB,GAAc/sC,EAAQ,CAC3B,IAAIqiC,EAAWwB,GAAU7jC,CAAM,EAC/B,GAAI,CAACqsC,GAAS,IAAIhK,CAAQ,EAAG,CACzB,IAAI2K,EAASxxB,GAAMxb,EAAQ,CACvB,8BAA+BwsC,GAC/B,6BAA8BA,EAC1C,CAAS,EACD,GAAI,CAACQ,GAAUA,EAAO,OAAS,WAC3B,MAAM,IAAI,MAAM,+BAA+B,EAEnDX,GAAS,IAAIhK,EAAUyK,GAASH,GAAiBK,CAAM,CAAC,CAAC,CAC5D,CACD,OAAOX,GAAS,IAAIhK,CAAQ,CAChC,CACO,SAAS4K,GAAIC,EAAU,CAE1B,QADI9yC,EAAO,CAAA,EACFiX,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCjX,EAAKiX,EAAK,CAAC,EAAI,UAAUA,CAAE,EAE3B,OAAO67B,GAAa,WACpBA,EAAW,CAACA,CAAQ,GAExB,IAAIzuC,EAASyuC,EAAS,CAAC,EACvB,OAAA9yC,EAAK,QAAQ,SAAUH,EAAKX,EAAG,CACvBW,GAAOA,EAAI,OAAS,WACpBwE,GAAUxE,EAAI,IAAI,OAAO,KAGzBwE,GAAUxE,EAEdwE,GAAUyuC,EAAS5zC,EAAI,CAAC,CAChC,CAAK,EACMyzC,GAActuC,CAAM,CAC/B,CACO,SAAS0uC,IAAc,CAC1Bd,GAAS,MAAK,EACdC,GAAkB,MAAK,CAC3B,CACO,SAASc,IAA0B,CACtCb,GAAwB,EAC5B,CACO,SAASc,IAAsC,CAClDb,GAAgC,EACpC,CACO,SAASc,IAAuC,CACnDd,GAAgC,EACpC,CACA,IAAIe,GAAS,CACT,IAAKN,GACL,YAAaE,GACb,wBAAyBC,GACzB,oCAAqCC,GACrC,qCAAsCC,EAC1C,GACC,SAAUE,EAAO,CACdA,EAAM,IAAMD,GAAO,IAAKC,EAAM,YAAcD,GAAO,YAAaC,EAAM,wBAA0BD,GAAO,wBAAyBC,EAAM,oCAAsCD,GAAO,oCAAqCC,EAAM,qCAAuCD,GAAO,oCAChR,GAAGN,KAAQA,GAAM,CAAE,EAAC,EACpBA,GAAI,QAAaA,GCtHjB,MAAAQ,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECAfC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,ECiDfxtB,GAAemqB;AAAA,IACXkC,EAAgB;AAAA,IAChBR,EAAoB;AAAA,IACpBP,EAAc;AAAA,IACdK,EAAkB;AAAA,IAClBuB,EAAgB;AAAA,IAChBN,EAAqB;AAAA,IACrBzB,EAAY;AAAA,IACZ6B,EAAmB;AAAA,IACnB5B,EAAkB;AAAA,IAClByB,EAAiB;AAAA,IACjBM,EAAwB;AAAA,IACxBnB,EAA8B;AAAA,IAC9BoB,EAAe;AAAA,IACfH,EAAmB;AAAA,IACnBhC,EAAe;AAAA,IACfN,EAAoB;AAAA,IACpBC,EAAsB;AAAA,IACtBC,EAAoB;AAAA,IACpByB,EAAY;AAAA,IACZS,EAAa;AAAA,IACbM,EAAgB;AAAA,IAChB3B,EAAY;AAAA,IACZF,EAAY;AAAA,IACZC,EAAgB;AAAA,IAChBqB,EAAkB;AAAA,IAClBb,EAAuB;AAAA,IACvBO,EAA4B;AAAA,IAC5BD,EAAoB;AAAA,IACpBe,EAAwB;AAAA,IACxBvC,EAAa;AAAA,IACbe,EAAoB;AAAA,IACpBF,EAAc;AAAA,IACdV,EAAiB;AAAA,IACjBiB,EAAsB;AAAA,IACtBD,EAA6B;AAAA,IAC7Bb,EAAc;AAAA,IACdsB,EAAW;AAAA,IACXD,EAAe;AAAA,IACfD,EAAiB;AAAA,IACjBL,EAAgB;AAAA,IAChBmB,EAAoB;AAAA,IACpBvC,EAAoB;AAAA,IACpBF,EAAsB;AAAA,IACtBS,EAAkB;AAAA,IAClBQ,EAAgB;AAAA,IAChByB,EAAyB;AAAA,EC5FvBjsB,GAAQ,IAAIomB,GAAc,CAC9B,UAAWe,GAAuB1oB,EAAS,EAC3C,aAAc,CACZ,eAAgB,CACd,UAAW,CAAC,SAAU,QAAQ,CAChC,EACA,iBAAkB,CAChB,UAAW,CAAC,SAAU,UAAU,CAClC,EACA,eAAgB,CACd,UAAW,CAAC,SAAU,gBAAgB,CACxC,EACA,MAAO,CACL,UAAW,CAAC,aAAc,eAAgB,QAAQ,CACpD,EACA,WAAY,CACV,UAAW,CAAC,SAAU,QAAQ,CAChC,EACA,eAAgB,CACd,UAAW,CAAC,WAAY,SAAU,QAAQ,CAC5C,EACA,qBAAsB,CACpB,UAAW,CAAC,WAAY,QAAQ,CAClC,EACA,gBAAiB,CACf,UAAW,CAAC,cAAe,YAAa,WAAY,SAAU,SAAS,CACzE,EACA,WAAY,CACV,UAAW,CAAC,SAAU,QAAQ,CAChC,CACF,CACF,CAAC,mCCrBDytB,EAAA,QAAA,mDAAoE,OAEpEA,EAAA,QAAA,gEAAiF,OAEjFA,EAAA,QAAA,gEAAiF,OAMjF,OAAO,OAAOA,EAAO,QAASC,EAAgB,kFChB9C,IAAIC,GAAapuB,GAAe,OAAO,IAAI,oBAAoB,EAAI,qBAC5D,SAASquB,IAAmB,CAC/BtgC,EAAU,kBAAmBugC,GAAO,EAAE,EACtC,IAAI9oC,EAAU+oC,iBAAoBH,EAAU,EAC5C,OAAK5oC,IACD,OAAO,eAAe+oC,GAAmB,cAAEH,GAAY,CACnD,MAAQ5oC,EAAU+oC,iBAAoB,CAAA,CAAE,EACxC,WAAY,GACZ,SAAU,GACV,aAAc,EAC1B,CAAS,EACD/oC,EAAQ,YAAc,iBAEnBA,CACX,CCHO,SAASgpC,GAAgBC,EAAU,CACtC,IAAIjpC,EAAUkpC,GAAAA,WAAiBL,GAAgB,CAAE,EAC7CM,EAASF,GAAYjpC,EAAQ,OACjCuI,OAAAA,EAAU,CAAC,CAAC4gC,EAAQ,EAAE,EACfA,CACX,CChBO,MAAMC,GAAc,CACzB,QAAS,CACP,OAAQ,+BACR,SAAU,yCACZ,EACA,KAAM,CACJ,GAAI,eACJ,GAAI,eACJ,GAAI,eACJ,GAAI,eACJ,GAAI,uBACJ,MAAO,uBACP,KAAM,EACR,EACA,WAAY,CACV,GAAI,GACJ,GAAI,GACJ,GAAI,GACJ,GAAI,GACJ,GAAI,GACJ,MAAO,IACP,KAAM,GACR,CACF,ECFA,SAASC,GAAmBC,EAAsCC,EAAa,CAC7E,OAAIA,IAGGD,IAAY,OAASE,GAAaC,GAC3C,CAEA,SAASC,GACPJ,EACAC,EACAI,EACA,CAEM,MAAAC,EAAY,KAAK,MAAMD,CAAS,EAChCE,EAAY,KAAK,MAAMF,EAAY,GAAG,EAEtCG,EAAYC,GAAkBV,GAAmBC,EAASC,CAAG,CAAC,EAE9DS,EAAQC,GAAW,CACvB,IAAKH,EACL,MAAOD,EACP,OAAQ,KAAK,MAAMF,EAAY,GAAG,CAAA,CACnC,EAOM,MAAA,CACL,MAPYM,GAAW,CACvB,IAAKH,EACL,MAAOF,EACP,OAAQ,KAAK,MAAMD,CAAS,CAAA,CAC7B,EAIC,UAAAC,EACA,MAAAI,EACA,UAAAH,CAAA,CAEJ,CAEA,MAAMK,GAAS1mC,GAAA,WACb,CACE,CACE,MAAA2mC,EACA,QAAAb,EAAU,OACV,QAAA3lC,EAAU,WACV,KAAAF,EAAO,KACP,KAAA2mC,EAAO,GACP,OAAAC,EAAS,GACT,IAAAC,EAAM,GACN,UAAAzmC,EACA,GAAGC,GAELC,IACG,OACH,MAAMC,EAAiBC,GACrBmlC,GAAY,QAAQzlC,CAAO,GAC3BlQ,EAAA21C,GAAY,OAAZ,YAAA31C,EAAmBgQ,GACnB4mC,EAAS,eAAiB,GAC1BxmC,CAAA,EAGI8lC,EAAYP,GAAY,WAAW3lC,CAAI,EACvC,CAAE,MAAA8mC,EAAO,UAAAX,EAAW,MAAAI,EAAO,UAAAH,CAAc,EAAAH,GAC7CJ,GACAa,GAAA,YAAAA,EAAO,MAAOX,GACdG,CAAA,EAEIa,EAAYF,EAAMA,EAAI,KAAA,EAAS,GAC/BG,EAAWD,EAAU,SAAW,EAAI,cAAgBA,EAEpDnnC,EAAQ,CACZ,IAAAU,EACA,UAAWC,EACX,MAAO,CAAE,MAAO,GAAG2lC,CAAS,KAAM,OAAQ,GAAGA,CAAS,IAAK,EAC3D,GAAG7lC,CAAA,EAIH,OAAAK,GAAA,IAAC,MAAK,CAAA,GAAGd,EACP,SAAAc,GAAA,IAAC,MAAA,CACC,IAAKomC,EACL,OAAQ,GAAGA,CAAK,IAAIX,CAAS,MAAMI,CAAK,IAAIH,CAAS,IACrD,IAAKY,EACL,MAAOd,EACP,OAAQA,EACR,QAASS,EAAO,OAAS,QACzB,UAAU,mHAAA,CAEd,CAAA,CAAA,CAEJ,CACF,ECrHiF,IAAIM,GAAGjkC,GAAG,CAAC,OAAOA,EAAG,CAAA,IAAI,UAAU,OAAOkkC,GAAG,IAAI,OAAO,OAAOC,GAAG,IAAI,UAAU,OAAOC,GAAG,IAAI,QAAQ,OAAOC,GAAG,QAAQ,OAAO,IAAI,CAAC,EAAEC,GAAG,MAAM,EAAE,EAAE,KAAK,CAAC,EAAEC,GAAG,CAAC,CAAC,QAAQvkC,CAAC,IAAIwkC,EAAE,cAAc,MAAM,CAAC,UAAU,yBAAyB,eAAexkC,CAAC,EAAEwkC,EAAE,cAAc,MAAM,CAAC,UAAU,gBAAgB,EAAEF,GAAG,IAAI,CAAC7gB,EAAE11B,IAAIy2C,EAAE,cAAc,MAAM,CAAC,UAAU,qBAAqB,IAAI,eAAez2C,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAEm2C,GAAGM,EAAE,cAAc,MAAM,CAAC,MAAM,6BAA6B,QAAQ,YAAY,KAAK,eAAe,OAAO,KAAK,MAAM,IAAI,EAAEA,EAAE,cAAc,OAAO,CAAC,SAAS,UAAU,EAAE,yJAAyJ,SAAS,SAAS,CAAC,CAAC,EAAEJ,GAAGI,EAAE,cAAc,MAAM,CAAC,MAAM,6BAA6B,QAAQ,YAAY,KAAK,eAAe,OAAO,KAAK,MAAM,IAAI,EAAEA,EAAE,cAAc,OAAO,CAAC,SAAS,UAAU,EAAE,4OAA4O,SAAS,SAAS,CAAC,CAAC,EAAEL,GAAGK,EAAE,cAAc,MAAM,CAAC,MAAM,6BAA6B,QAAQ,YAAY,KAAK,eAAe,OAAO,KAAK,MAAM,IAAI,EAAEA,EAAE,cAAc,OAAO,CAAC,SAAS,UAAU,EAAE,0OAA0O,SAAS,SAAS,CAAC,CAAC,EAAEH,GAAGG,EAAE,cAAc,MAAM,CAAC,MAAM,6BAA6B,QAAQ,YAAY,KAAK,eAAe,OAAO,KAAK,MAAM,IAAI,EAAEA,EAAE,cAAc,OAAO,CAAC,SAAS,UAAU,EAAE,sIAAsI,SAAS,SAAS,CAAC,CAAC,EAA4BC,GAAG,IAAI,CAAC,GAAG,CAACzkC,EAAEyjB,CAAC,EAAEihB,EAAG,SAAS,SAAS,MAAM,EAAE,OAAOA,EAAG,UAAU,IAAI,CAAC,IAAI32C,EAAE,IAAI,CAAC01B,EAAE,SAAS,MAAM,CAAC,EAAE,OAAO,SAAS,iBAAiB,mBAAmB11B,CAAC,EAAE,IAAI,OAAO,oBAAoB,mBAAmBA,CAAC,CAAC,EAAE,EAAE,EAAEiS,CAAC,EAAM2kC,GAAG,EAAEC,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,UAAUnhB,IAAI,KAAK,YAAY,KAAKA,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,YAAY,QAAQA,CAAC,EAAE,KAAK,YAAY,OAAO,EAAE,CAAC,CAAC,GAAG,KAAK,QAAQA,GAAG,CAAC,KAAK,YAAY,QAAQ,GAAG,EAAEA,CAAC,CAAC,CAAC,EAAE,KAAK,SAASA,GAAG,CAAC,KAAK,QAAQA,CAAC,EAAE,KAAK,OAAO,CAAC,GAAG,KAAK,OAAOA,CAAC,CAAC,EAAE,KAAK,OAAOA,GAAG,CAAC,IAAI53B,EAAE,GAAG,CAAC,QAAQkC,EAAE,GAAG,CAAC,EAAE01B,EAAEohB,EAAE,OAAOphB,GAAG,KAAK,OAAOA,EAAE,KAAK,YAAY53B,EAAE43B,EAAE,KAAK,KAAK,OAAO53B,EAAE,QAAQ,EAAE43B,EAAE,GAAGkhB,KAAKG,EAAE,KAAK,OAAO,KAAKllC,GAAGA,EAAE,KAAKilC,CAAC,EAAE9jC,EAAE0iB,EAAE,cAAc,OAAO,GAAGA,EAAE,YAAY,OAAOqhB,EAAE,KAAK,OAAO,KAAK,OAAO,IAAIllC,GAAGA,EAAE,KAAKilC,GAAG,KAAK,QAAQ,CAAC,GAAGjlC,EAAE,GAAG6jB,EAAE,GAAGohB,EAAE,MAAM92C,CAAC,CAAC,EAAE,CAAC,GAAG6R,EAAE,GAAG6jB,EAAE,GAAGohB,EAAE,YAAY9jC,EAAE,MAAMhT,CAAC,GAAG6R,CAAC,EAAE,KAAK,SAAS,CAAC,MAAM7R,EAAE,GAAG,EAAE,YAAYgT,EAAE,GAAG8jC,CAAC,CAAC,EAAEA,CAAC,EAAE,KAAK,QAAQphB,IAAIA,GAAG,KAAK,OAAO,QAAQ,GAAG,CAAC,KAAK,YAAY,QAAQxjB,GAAGA,EAAE,CAAC,GAAG,EAAE,GAAG,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,YAAY,QAAQ,GAAG,EAAE,CAAC,GAAGwjB,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAEA,GAAG,KAAK,QAAQ,CAACA,EAAE,IAAI,KAAK,OAAO,CAAC,GAAG,EAAE,QAAQA,CAAC,CAAC,EAAE,KAAK,MAAM,CAACA,EAAE,IAAI,KAAK,OAAO,CAAC,GAAG,EAAE,QAAQA,EAAE,KAAK,OAAO,CAAC,EAAE,KAAK,QAAQ,CAACA,EAAE,IAAI,KAAK,OAAO,CAAC,GAAG,EAAE,KAAK,UAAU,QAAQA,CAAC,CAAC,EAAE,KAAK,KAAK,CAACA,EAAE,IAAI,KAAK,OAAO,CAAC,GAAG,EAAE,KAAK,OAAO,QAAQA,CAAC,CAAC,EAAE,KAAK,QAAQ,CAACA,EAAE,IAAI,KAAK,OAAO,CAAC,GAAG,EAAE,KAAK,UAAU,QAAQA,CAAC,CAAC,EAAE,KAAK,QAAQ,CAACA,EAAE,IAAI,KAAK,OAAO,CAAC,GAAG,EAAE,KAAK,UAAU,QAAQA,CAAC,CAAC,EAAE,KAAK,QAAQ,CAACA,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,OAAO,IAAIxjB,EAAE,EAAE,UAAU,SAASA,EAAE,KAAK,OAAO,CAAC,GAAG,EAAE,QAAQwjB,EAAE,KAAK,UAAU,QAAQ,EAAE,QAAQ,YAAY,OAAO,EAAE,aAAa,WAAW,EAAE,YAAY,MAAM,CAAC,GAAG,IAAIohB,EAAEphB,aAAa,QAAQA,EAAEA,EAAG,EAACqhB,EAAE7kC,IAAI,OAAO,OAAO4kC,EAAE,KAAK,MAAM9jC,GAAG,CAAC,GAAGgkC,GAAGhkC,CAAC,GAAG,CAACA,EAAE,GAAG,CAAC+jC,EAAE,GAAG,IAAIj5C,EAAE,OAAO,EAAE,OAAO,WAAW,MAAM,EAAE,MAAM,uBAAuBkV,EAAE,MAAM,EAAE,EAAE,EAAE,MAAMnB,EAAE,OAAO,EAAE,aAAa,WAAW,MAAM,EAAE,YAAY,uBAAuBmB,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,KAAK,OAAO,CAAC,GAAGd,EAAE,KAAK,QAAQ,QAAQpU,EAAE,YAAY+T,CAAC,CAAC,CAAC,SAAS,EAAE,UAAU,OAAO,CAACklC,EAAE,GAAG,IAAIj5C,EAAE,OAAO,EAAE,SAAS,WAAW,MAAM,EAAE,QAAQkV,CAAC,EAAE,EAAE,QAAQnB,EAAE,OAAO,EAAE,aAAa,WAAW,MAAM,EAAE,YAAYmB,CAAC,EAAE,EAAE,YAAY,KAAK,OAAO,CAAC,GAAGd,EAAE,KAAK,UAAU,QAAQpU,EAAE,YAAY+T,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,MAAMmB,GAAG,CAAC,GAAG,EAAE,QAAQ,OAAO,CAAC+jC,EAAE,GAAG,IAAIj5C,EAAE,OAAO,EAAE,OAAO,WAAW,MAAM,EAAE,MAAMkV,CAAC,EAAE,EAAE,MAAMnB,EAAE,OAAO,EAAE,aAAa,WAAW,MAAM,EAAE,YAAYmB,CAAC,EAAE,EAAE,YAAY,KAAK,OAAO,CAAC,GAAGd,EAAE,KAAK,QAAQ,QAAQpU,EAAE,YAAY+T,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,IAAI,CAAC,IAAImB,EAAE+jC,IAAI,KAAK,QAAQ7kC,CAAC,EAAEA,EAAE,SAASc,EAAE,EAAE,UAAU,MAAMA,EAAE,KAAK,CAAC,CAAC,CAAC,EAAEd,CAAC,EAAE,KAAK,OAAO,CAACwjB,EAAE,IAAI,CAAC,IAAIxjB,GAAG,GAAG,KAAK,OAAO,EAAE,KAAK0kC,KAAK,OAAO,KAAK,OAAO,CAAC,IAAIlhB,EAAExjB,CAAC,EAAE,GAAGA,EAAE,GAAG,CAAC,CAAC,EAAEA,CAAC,EAAE,KAAK,YAAY,CAAE,EAAC,KAAK,OAAO,CAAA,CAAE,CAAC,EAAEgB,EAAE,IAAI2jC,GAAGI,GAAG,CAAChlC,EAAEyjB,IAAI,CAAC,IAAI11B,GAAG01B,GAAG,KAAK,OAAOA,EAAE,KAAKkhB,KAAK,OAAO1jC,EAAE,SAAS,CAAC,MAAMjB,EAAE,GAAGyjB,EAAE,GAAG11B,CAAC,CAAC,EAAEA,CAAC,EAAEg3C,GAAG/kC,GAAGA,GAAG,OAAOA,GAAG,UAAU,OAAOA,GAAG,OAAOA,EAAE,IAAI,WAAW,WAAWA,GAAG,OAAOA,EAAE,QAAQ,SAASilC,GAAGD,GAAGE,GAAG,IAAIjkC,EAAE,OAAOkkC,GAAG,OAAO,OAAOF,GAAG,CAAC,QAAQhkC,EAAE,QAAQ,KAAKA,EAAE,KAAK,QAAQA,EAAE,QAAQ,MAAMA,EAAE,MAAM,OAAOA,EAAE,OAAO,QAAQA,EAAE,QAAQ,QAAQA,EAAE,QAAQ,QAAQA,EAAE,QAAQ,QAAQA,EAAE,OAAO,EAAE,CAAC,WAAWikC,EAAE,CAAC,EAAE,SAASE,GAAGplC,EAAE,CAAC,SAASyjB,CAAC,EAAE,CAAE,EAAC,CAAC,GAAO,OAAO,SAAU,IAAY,OAAO,IAAI11B,EAAE,SAAS,MAAM,SAAS,qBAAqB,MAAM,EAAE,CAAC,EAAE,EAAE,SAAS,cAAc,OAAO,EAAE,EAAE,KAAK,WAAW01B,IAAI,OAAO11B,EAAE,WAAWA,EAAE,aAAa,EAAEA,EAAE,UAAU,EAAEA,EAAE,YAAY,CAAC,EAAE,EAAE,WAAW,EAAE,WAAW,QAAQiS,EAAE,EAAE,YAAY,SAAS,eAAeA,CAAC,CAAC,CAAC,CAAColC,GAAG;AAAA,CACxwK,EAAE,SAASC,GAAErlC,EAAE,CAAC,OAAOA,EAAE,QAAQ,MAAM,CAAC,IAAIslC,GAAG,EAAEC,GAAG,OAAOC,GAAG,IAAIC,GAAG,IAAIC,GAAG,GAAGC,GAAG,GAAGC,GAAG,IAAI,SAASC,MAAM7lC,EAAE,CAAC,OAAOA,EAAE,OAAO,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,IAAI8lC,GAAG9lC,GAAG,CAAC,IAAI+lC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG,GAAG,CAAC,OAAO/iB,EAAE,MAAM11B,EAAE,SAASkS,EAAE,YAAY4kC,EAAE,WAAWC,EAAE,cAAc/jC,EAAE,QAAQlV,EAAE,MAAM+T,EAAE,OAAO6mC,EAAE,SAASC,EAAE,YAAYC,EAAE,kBAAkBC,EAAE,YAAY57C,EAAE,MAAM67C,EAAE,kBAAkBC,GAAE,kBAAkBC,GAAE,UAAUC,EAAG,GAAG,qBAAqBC,GAAG,GAAG,SAASC,GAAE,SAASC,GAAG,IAAIC,GAAE,YAAYC,GAAE,gBAAgBC,GAAE,WAAWC,EAAE,MAAMC,GAAE,qBAAqBC,GAAG,cAAc,sBAAsBzwB,EAAE,GAAG0wB,CAAC,EAAE1nC,EAAE,CAAC2nC,EAAEC,EAAE,EAAEz8C,EAAE,SAAS,EAAE,EAAE,CAAC08C,GAAEC,CAAC,EAAE38C,EAAE,SAAS,EAAE,EAAE,CAAC48C,GAAGC,EAAC,EAAE78C,EAAE,SAAS,EAAE,EAAE,CAAC88C,GAAEC,EAAE,EAAE/8C,EAAE,SAAS,EAAE,EAAE,CAACoxC,GAAEniC,EAAC,EAAEjP,EAAE,SAAS,CAAC,EAAE,CAAC+C,GAAEi6C,EAAC,EAAEh9C,EAAE,SAAS,CAAC,EAAEi9C,GAAEj9C,EAAE,OAAO,IAAI,EAAE6K,GAAE7K,EAAE,OAAO,IAAI,EAAE2V,GAAElB,IAAI,EAAEyoC,GAAEzoC,EAAE,GAAGmB,EAAE9S,EAAEF,EAAE,KAAKuS,GAAEvS,EAAE,cAAc,GAAGu6C,GAAGv6C,EAAE,WAAW,GAAGw6C,GAAGx6C,EAAE,sBAAsB,GAAGy6C,GAAEr9C,EAAE,QAAQ,IAAIU,EAAE,UAAUD,GAAGA,EAAE,UAAUmC,EAAE,EAAE,GAAG,EAAE,CAAClC,EAAEkC,EAAE,EAAE,CAAC,EAAE06C,GAAGt9C,EAAE,QAAQ,IAAI,CAAC,IAAIS,EAAE,OAAOA,EAAEmC,EAAE,cAAc,KAAKnC,EAAEZ,CAAC,EAAE,CAAC+C,EAAE,YAAY/C,CAAC,CAAC,EAAE09C,GAAGv9C,EAAE,QAAQ,IAAI4C,EAAE,UAAUm5C,IAAG1B,GAAG,CAACz3C,EAAE,SAASm5C,EAAC,CAAC,EAAEvjB,GAAGx4B,EAAE,OAAO,CAAC,EAAEw9C,GAAEx9C,EAAE,OAAO,CAAC,EAAEy9C,GAAGz9C,EAAE,OAAO,CAAC,EAAE09C,GAAE19C,EAAE,OAAO,IAAI,EAAE,CAAC29C,GAAGC,EAAE,EAAE5B,GAAG,MAAM,GAAG,EAAE6B,GAAG79C,EAAE,QAAQ,IAAIU,EAAE,OAAO,CAACD,EAAE4Q,EAAE7J,IAAIA,GAAG61C,GAAE58C,EAAEA,EAAE4Q,EAAE,OAAO,CAAC,EAAE,CAAC3Q,EAAE28C,EAAC,CAAC,EAAES,GAAGxE,GAAI,EAACyE,GAAGn7C,EAAE,QAAQ01B,EAAE0lB,GAAGl7C,IAAI,UAAU06C,GAAE,QAAQx9C,EAAE,QAAQ,IAAIq9C,GAAEpB,GAAE4B,GAAG,CAACR,GAAEQ,EAAE,CAAC,EAAE79C,EAAE,UAAU,IAAI,CAACy8C,GAAG,EAAE,CAAC,EAAE,CAAE,CAAA,EAAEz8C,EAAE,gBAAgB,IAAI,CAAC,GAAG,CAACw8C,EAAE,OAAO,IAAI/7C,EAAEoK,GAAE,QAAQwG,EAAE5Q,EAAE,MAAM,OAAOA,EAAE,MAAM,OAAO,OAAO,IAAI+G,EAAE/G,EAAE,sBAAqB,EAAG,OAAOA,EAAE,MAAM,OAAO4Q,EAAE2rC,GAAEx1C,CAAC,EAAEmyC,EAAEsE,IAAGA,GAAE,KAAKC,IAAGA,GAAE,UAAUt7C,EAAE,EAAE,EAAEq7C,GAAE,IAAIC,IAAGA,GAAE,UAAUt7C,EAAE,GAAG,CAAC,GAAGs7C,GAAE,OAAO12C,CAAC,EAAE02C,EAAC,EAAE,CAAC,CAAC,QAAQt7C,EAAE,GAAG,OAAO4E,EAAE,SAAS5E,EAAE,QAAQ,EAAE,GAAGq7C,EAAC,CAAC,CAAC,EAAE,CAACzB,EAAE55C,EAAE,MAAMA,EAAE,YAAY+2C,EAAE/2C,EAAE,EAAE,CAAC,EAAE,IAAIu7C,GAAEn+C,EAAE,YAAY,IAAI,CAAC28C,EAAE,EAAE,EAAE1tC,GAAEuuC,GAAE,OAAO,EAAE7D,EAAEl5C,GAAGA,EAAE,OAAO4Q,GAAGA,EAAE,UAAUzO,EAAE,EAAE,CAAC,EAAE,WAAW,IAAI,CAAC44C,EAAE54C,CAAC,CAAC,EAAE63C,EAAE,CAAC,EAAE,CAAC73C,EAAE44C,EAAE7B,EAAE6D,EAAC,CAAC,EAAEx9C,EAAE,UAAU,IAAI,CAAC,GAAG4C,EAAE,SAASE,IAAI,WAAWF,EAAE,WAAW,KAAKA,EAAE,OAAO,UAAU,OAAO,IAAInC,EAAE4Q,EAAEksC,GAAG,OAAOhC,GAAG7B,GAAG7tB,GAAGiyB,IAAI,IAAI,CAAC,GAAGL,GAAG,QAAQjlB,GAAG,QAAQ,CAAC,IAAIyC,EAAE,IAAI,KAAM,EAAC,QAAO,EAAGzC,GAAG,QAAQnnB,EAAEA,EAAE4pB,CAAC,CAACwiB,GAAG,QAAQ,IAAI,KAAI,EAAG,QAAS,CAAA,GAAI,EAAOpsC,IAAI,MAAMmnB,GAAG,QAAQ,IAAI,KAAM,EAAC,QAAO,EAAG/3B,EAAE,WAAW,IAAI,CAAC,IAAIw6B,GAAGA,EAAEr4B,EAAE,cAAc,MAAMq4B,EAAE,KAAKr4B,EAAEA,CAAC,EAAEu7C,GAAC,CAAE,EAAE9sC,CAAC,GAAO,IAAI,aAAa5Q,CAAC,CAAC,EAAE,CAAC86C,EAAE7B,EAAEyC,GAAEv5C,EAAE26C,GAAGY,GAAEv7C,EAAE,QAAQE,EAAE+oB,EAAEiyB,EAAE,CAAC,EAAE99C,EAAE,UAAU,IAAI,CAAC,IAAIS,EAAEoK,GAAE,QAAQ,GAAGpK,EAAE,CAAC,IAAI4Q,EAAE5Q,EAAE,sBAAuB,EAAC,OAAO,OAAOu8C,GAAE3rC,CAAC,EAAEsoC,EAAEnyC,GAAG,CAAC,CAAC,QAAQ5E,EAAE,GAAG,OAAOyO,EAAE,SAASzO,EAAE,QAAQ,EAAE,GAAG4E,CAAC,CAAC,EAAE,IAAImyC,EAAEnyC,GAAGA,EAAE,OAAOy2C,IAAGA,GAAE,UAAUr7C,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC+2C,EAAE/2C,EAAE,EAAE,CAAC,EAAE5C,EAAE,UAAU,IAAI,CAAC4C,EAAE,QAAQu7C,GAAG,CAAA,EAAE,CAACA,GAAEv7C,EAAE,MAAM,CAAC,EAAE,SAASw7C,IAAI,CAAC,OAAO/B,IAAG,MAAMA,GAAE,QAAQr8C,EAAE,cAAc,MAAM,CAAC,UAAU,gBAAgB,eAAe8C,IAAI,SAAS,EAAEu5C,GAAE,OAAO,EAAEH,GAAEl8C,EAAE,cAAc,MAAM,CAAC,UAAU,gBAAgB,eAAe8C,IAAI,SAAS,EAAEo5C,EAAC,EAAEl8C,EAAE,cAAco5C,GAAG,CAAC,QAAQt2C,IAAI,SAAS,CAAC,CAAC,CAAC,OAAO9C,EAAE,cAAc,KAAK,CAAC,YAAY4C,EAAE,UAAU,YAAY,SAAS,cAAc,OAAO,KAAK,SAAS,SAAS,EAAE,IAAIiI,GAAE,UAAU0xC,EAAEV,EAAGsB,GAAGf,GAAG,KAAK,OAAOA,EAAE,OAAOxB,EAAGh4C,GAAG,KAAK,OAAOA,EAAE,aAAa,KAAK,OAAOg4C,EAAG,MAAMwB,GAAG,KAAK,OAAOA,EAAE,QAAQA,GAAG,KAAK,OAAOA,EAAEt5C,CAAC,GAAG+3C,EAAGj4C,GAAG,KAAK,OAAOA,EAAE,aAAa,KAAK,OAAOi4C,EAAG/3C,CAAC,CAAC,EAAE,oBAAoB,GAAG,oBAAoBg4C,EAAGl4C,EAAE,aAAa,KAAKk4C,EAAGW,EAAE,cAAc,EAAE74C,EAAE,KAAKA,EAAE,UAAUkS,GAAG,eAAe0nC,EAAE,eAAe,CAAC,CAAC55C,EAAE,QAAQ,eAAe85C,GAAE,eAAeQ,GAAE,kBAAkBS,GAAG,kBAAkBC,GAAG,aAAanpC,EAAE,aAAakB,GAAE,eAAeinC,GAAG,mBAAmBznC,GAAE,YAAYrS,EAAE,cAAci7C,GAAG,iBAAiBjB,GAAE,gBAAgB,CAAC,EAAEvB,GAAGY,IAAGK,GAAG,MAAM,CAAC,UAAU/nC,EAAE,kBAAkBA,EAAE,YAAY6mC,EAAE,OAAO7mC,EAAE,WAAW,GAAGioC,GAAEtL,GAAEoM,GAAE,OAAO,KAAK,mBAAmBrB,GAAE,OAAO,GAAGp5C,EAAC,KAAK,GAAG24C,EAAE,GAAG94C,EAAE,KAAK,EAAE,cAAcnC,GAAG,CAACu9C,IAAI,CAAC7oC,KAAI8nC,GAAE,QAAQ,IAAI,KAAKhuC,GAAEuuC,GAAE,OAAO,EAAE/8C,EAAE,OAAO,kBAAkBA,EAAE,SAAS,EAAEA,EAAE,OAAO,UAAU,WAAWo8C,GAAE,EAAE,EAAEa,GAAE,QAAQ,CAAC,EAAEj9C,EAAE,QAAQ,EAAEA,EAAE,OAAO,GAAG,EAAE,YAAY,IAAI,CAAC,IAAIw9C,EAAEhjB,EAAEijB,EAAEG,GAAG,GAAGvB,IAAG,CAAC3nC,GAAE,OAAOuoC,GAAE,QAAQ,KAAK,IAAIj9C,GAAE,SAASw9C,EAAEpzC,GAAE,UAAU,KAAK,OAAOozC,EAAE,MAAM,iBAAiB,gBAAgB,EAAE,QAAQ,KAAK,EAAE,IAAI,CAAC,EAAE5sC,GAAE,IAAI,KAAI,EAAG,QAAS,IAAG4pB,EAAEgiB,GAAE,UAAU,KAAK,OAAOhiB,EAAE,QAAO,GAAIzzB,GAAE,KAAK,IAAI/G,EAAC,EAAE4Q,GAAE,GAAG,KAAK,IAAI5Q,EAAC,GAAG+5C,IAAIhzC,GAAE,IAAI,CAACyH,GAAEuuC,GAAE,OAAO,GAAGU,EAAEt7C,EAAE,YAAY,MAAMs7C,EAAE,KAAKt7C,EAAEA,CAAC,EAAEu7C,GAAC,EAAGpB,GAAG,EAAE,EAAE,MAAM,EAAEsB,GAAGxzC,GAAE,UAAU,MAAMwzC,GAAG,MAAM,YAAY,iBAAiB,KAAK,EAAExB,GAAE,EAAE,CAAC,EAAE,cAAcp8C,GAAG,CAAC,IAAI69C,EAAG,GAAG,CAACZ,GAAE,SAAS,CAACvoC,GAAE,OAAO,IAAI9D,EAAE5Q,EAAE,QAAQi9C,GAAE,QAAQ,EAAEl2C,GAAE/G,EAAE,QAAQi9C,GAAE,QAAQ,EAAEziB,IAAG0iB,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,EAAEtsC,CAAC,EAAE6sC,GAAEz9C,EAAE,cAAc,QAAQ,GAAG,EAAE,KAAK,IAAIw6B,EAAC,EAAEijB,IAAGI,EAAGzzC,GAAE,UAAU,MAAMyzC,EAAG,MAAM,YAAY,iBAAiB,GAAGjtC,CAAC,IAAI,EAAE,KAAK,IAAI7J,EAAC,EAAE02C,KAAIR,GAAE,QAAQ,KAAK,CAAC,EAAEJ,IAAI,CAAC16C,EAAE,IAAI5C,EAAE,cAAc,SAAS,CAAC,aAAas8C,GAAG,gBAAgB0B,GAAG,oBAAoB,GAAG,QAAQA,IAAI,CAAC7oC,GAAE,IAAI,CAAA,EAAG,IAAI,CAAC,IAAI1U,EAAE09C,GAAG,GAAE19C,EAAEmC,EAAE,YAAY,MAAMnC,EAAE,KAAKmC,EAAEA,CAAC,CAAC,EAAE,UAAU25C,EAAEH,GAAG,KAAK,OAAOA,EAAE,aAAarB,EAAGn4C,GAAG,KAAK,OAAOA,EAAE,aAAa,KAAK,OAAOm4C,EAAG,WAAW,CAAC,EAAE/6C,EAAE,cAAc,MAAM,CAAC,MAAM,6BAA6B,MAAM,KAAK,OAAO,KAAK,QAAQ,YAAY,KAAK,OAAO,OAAO,eAAe,YAAY,MAAM,cAAc,QAAQ,eAAe,OAAO,EAAEA,EAAE,cAAc,OAAO,CAAC,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,EAAEA,EAAE,cAAc,OAAO,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK4C,EAAE,KAAK5C,EAAE,eAAe4C,EAAE,KAAK,EAAEA,EAAE,KAAKA,EAAE,MAAM5C,EAAE,cAAcA,EAAE,SAAS,KAAK8C,GAAGF,EAAE,MAAMA,EAAE,QAAQ5C,EAAE,cAAc,MAAM,CAAC,YAAY,GAAG,UAAUu8C,EAAEH,GAAG,KAAK,OAAOA,EAAE,MAAMpB,EAAGp4C,GAAG,KAAK,OAAOA,EAAE,aAAa,KAAK,OAAOo4C,EAAG,IAAI,CAAC,EAAEp4C,EAAE,SAASA,EAAE,OAAO,WAAW,CAACA,EAAE,KAAKA,EAAE,MAAMw7C,GAAE,EAAG,KAAKx7C,EAAE,OAAO,UAAUA,EAAE,OAAOy5C,IAAG,KAAK,OAAOA,GAAEv5C,CAAC,IAAIg2C,GAAGh2C,CAAC,EAAE,IAAI,EAAE,KAAK9C,EAAE,cAAc,MAAM,CAAC,eAAe,GAAG,UAAUu8C,EAAEH,GAAG,KAAK,OAAOA,EAAE,SAASnB,EAAGr4C,GAAG,KAAK,OAAOA,EAAE,aAAa,KAAK,OAAOq4C,EAAG,OAAO,CAAC,EAAEj7C,EAAE,cAAc,MAAM,CAAC,aAAa,GAAG,UAAUu8C,EAAEH,GAAG,KAAK,OAAOA,EAAE,OAAOlB,EAAGt4C,GAAG,KAAK,OAAOA,EAAE,aAAa,KAAK,OAAOs4C,EAAG,KAAK,CAAC,EAAEt4C,EAAE,KAAK,EAAEA,EAAE,YAAY5C,EAAE,cAAc,MAAM,CAAC,mBAAmB,GAAG,UAAUu8C,EAAET,GAAGsB,GAAGhB,GAAG,KAAK,OAAOA,EAAE,aAAajB,EAAGv4C,GAAG,KAAK,OAAOA,EAAE,aAAa,KAAK,OAAOu4C,EAAG,WAAW,CAAC,EAAEv4C,EAAE,WAAW,EAAE,IAAI,EAAE5C,EAAE,eAAe4C,EAAE,MAAM,EAAEA,EAAE,OAAOA,EAAE,QAAQs3C,GAAEt3C,EAAE,MAAM,EAAE5C,EAAE,cAAc,SAAS,CAAC,cAAc,GAAG,cAAc,GAAG,MAAM4C,EAAE,mBAAmB+4C,GAAE,QAAQl7C,GAAG,CAAC,IAAI4Q,EAAE7J,EAAE0yC,GAAEt3C,EAAE,MAAM,GAAGuS,MAAK3N,GAAG6J,EAAEzO,EAAE,QAAQ,UAAU,MAAM4E,EAAE,KAAK6J,EAAE5Q,CAAC,EAAE09C,GAAG,EAAC,EAAE,UAAU5B,EAAEH,GAAG,KAAK,OAAOA,EAAE,cAAchB,EAAGx4C,GAAG,KAAK,OAAOA,EAAE,aAAa,KAAK,OAAOw4C,EAAG,YAAY,CAAC,EAAEx4C,EAAE,OAAO,KAAK,EAAE,KAAK5C,EAAE,eAAe4C,EAAE,MAAM,EAAEA,EAAE,OAAOA,EAAE,QAAQs3C,GAAEt3C,EAAE,MAAM,EAAE5C,EAAE,cAAc,SAAS,CAAC,cAAc,GAAG,cAAc,GAAG,MAAM4C,EAAE,mBAAmBg5C,GAAE,QAAQn7C,GAAG,CAAC,IAAI4Q,EAAE7J,EAAE0yC,GAAEt3C,EAAE,MAAM,IAAInC,EAAE,oBAAoB+G,GAAG6J,EAAEzO,EAAE,QAAQ,UAAU,MAAM4E,EAAE,KAAK6J,EAAE5Q,CAAC,EAAE09C,GAAG,GAAE,EAAE,UAAU5B,EAAEH,GAAG,KAAK,OAAOA,EAAE,cAAcf,EAAGz4C,GAAG,KAAK,OAAOA,EAAE,aAAa,KAAK,OAAOy4C,EAAG,YAAY,CAAC,EAAEz4C,EAAE,OAAO,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,SAAS27C,IAAI,CAAC,GAAG,OAAO,OAAQ,KAAa,OAAO,SAAU,IAAY,MAAM,MAAM,IAAI1pC,EAAE,SAAS,gBAAgB,aAAa,KAAK,EAAE,OAAOA,IAAI,QAAQ,CAACA,EAAE,OAAO,iBAAiB,SAAS,eAAe,EAAE,UAAUA,CAAC,CAAiR,IAAC2pC,GAAG3pC,GAAG,CAAC,GAAG,CAAC,OAAOyjB,EAAE,SAAS11B,EAAE,eAAe,OAAO,EAAE,CAAC,SAAS,MAAM,EAAE,OAAO82C,EAAE,YAAYC,EAAE,UAAU/jC,EAAE,OAAOlV,EAAE,MAAM+T,EAAE,QAAQ,WAAW6mC,EAAE,SAASC,EAAE,MAAMC,EAAE,cAAcC,EAAEtB,GAAG,aAAat6C,EAAE,IAAI67C,EAAE6C,GAAE,EAAG,IAAI5C,EAAEpB,GAAG,YAAYqB,EAAE,MAAMC,EAAG,mBAAmBC,EAAG,gBAAgB,sBAAsBC,EAAE,GAAGC,EAAGtB,EAAE,EAAE7lC,EAAE,CAAConC,EAAEC,CAAC,EAAEl8C,EAAE,SAAS,CAAA,CAAE,EAAEm8C,EAAEn8C,EAAE,QAAQ,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC4C,CAAC,EAAE,OAAOq5C,EAAE,OAAO7K,GAAGA,EAAE,QAAQ,EAAE,IAAIA,GAAGA,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC6K,EAAEr5C,CAAC,CAAC,EAAE,CAACw5C,EAAEC,EAAC,EAAEr8C,EAAE,SAAS,CAAA,CAAE,EAAE,CAACs8C,GAAGzwB,CAAC,EAAE7rB,EAAE,SAAS,EAAE,EAAE,CAACu8C,GAAEC,EAAC,EAAEx8C,EAAE,SAAS,EAAE,EAAE,CAACy8C,GAAGC,EAAC,EAAE18C,EAAE,SAASyU,IAAI,SAASA,EAAE,OAAO,OAAQ,KAAa,OAAO,YAAY,OAAO,WAAW,8BAA8B,EAAE,QAAQ,OAAO,OAAO,EAAEkoC,GAAE38C,EAAE,OAAO,IAAI,EAAE48C,GAAG,EAAE,KAAK,GAAG,EAAE,QAAQ,OAAO,EAAE,EAAE,QAAQ,SAAS,EAAE,EAAEC,EAAE78C,EAAE,OAAO,IAAI,EAAE88C,GAAE98C,EAAE,OAAO,EAAE,EAAE+8C,GAAG/8C,EAAE,YAAYoxC,GAAG,CAAC,IAAIniC,GAAGA,EAAEgtC,EAAE,KAAKl5C,GAAGA,EAAE,KAAKquC,EAAE,EAAE,IAAI,MAAMniC,EAAE,QAAQ6G,EAAE,QAAQs7B,EAAE,EAAE,EAAE8K,EAAEn5C,GAAGA,EAAE,OAAO,CAAC,CAAC,GAAGi6C,EAAC,IAAIA,KAAI5L,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC6K,CAAC,CAAC,EAAE,OAAOj8C,EAAE,UAAU,IAAI8V,EAAE,UAAUs7B,GAAG,CAAC,GAAGA,EAAE,QAAQ,CAAC8K,EAAEjtC,GAAGA,EAAE,IAAIlM,GAAGA,EAAE,KAAKquC,EAAE,GAAG,CAAC,GAAGruC,EAAE,OAAO,EAAE,EAAEA,CAAC,CAAC,EAAE,MAAM,CAAC,WAAW,IAAI,CAAC07C,GAAG,UAAU,IAAI,CAACvC,EAAEjtC,GAAG,CAAC,IAAIlM,EAAEkM,EAAE,UAAU+tC,IAAGA,GAAE,KAAK5L,EAAE,EAAE,EAAE,OAAOruC,IAAI,GAAG,CAAC,GAAGkM,EAAE,MAAM,EAAElM,CAAC,EAAE,CAAC,GAAGkM,EAAElM,CAAC,EAAE,GAAGquC,CAAC,EAAE,GAAGniC,EAAE,MAAMlM,EAAE,CAAC,CAAC,EAAE,CAACquC,EAAE,GAAGniC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA,CAAE,EAAEjP,EAAE,UAAU,IAAI,CAAC,GAAGyU,IAAI,SAAS,CAACioC,GAAEjoC,CAAC,EAAE,MAAM,CAACA,IAAI,WAAW,OAAO,YAAY,OAAO,WAAW,8BAA8B,EAAE,QAAQioC,GAAE,MAAM,EAAEA,GAAE,OAAO,GAAG,OAAO,OAAQ,KAAa,OAAO,WAAW,8BAA8B,EAAE,iBAAiB,SAAS,CAAC,CAAC,QAAQtL,CAAC,IAAI,CAACsL,GAAEtL,EAAE,OAAO,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC38B,CAAC,CAAC,EAAEzU,EAAE,UAAU,IAAI,CAACi8C,EAAE,QAAQ,GAAGpwB,EAAE,EAAE,CAAC,EAAE,CAACowB,CAAC,CAAC,EAAEj8C,EAAE,UAAU,IAAI,CAAC,IAAIoxC,EAAEniC,GAAG,CAAC,IAAI+tC,EAAEC,GAAE,EAAE,MAAMpyC,IAAGoE,EAAEpE,EAAC,GAAGoE,EAAE,OAAOpE,EAAC,IAAIghB,EAAE,EAAE,GAAGmxB,EAAEL,GAAE,UAAU,MAAMK,EAAE,MAAO,GAAE/tC,EAAE,OAAO,WAAW,SAAS,gBAAgB0tC,GAAE,UAAUM,GAAEN,GAAE,UAAU,MAAMM,GAAE,SAAS,SAAS,aAAa,IAAIpxB,EAAE,EAAE,CAAC,EAAE,OAAO,SAAS,iBAAiB,UAAUulB,CAAC,EAAE,IAAI,SAAS,oBAAoB,UAAUA,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAEpxC,EAAE,UAAU,IAAI,CAAC,GAAG28C,GAAE,QAAQ,MAAM,IAAI,CAACE,EAAE,UAAUA,EAAE,QAAQ,MAAM,CAAC,cAAc,EAAE,CAAC,EAAEA,EAAE,QAAQ,KAAKC,GAAE,QAAQ,GAAG,CAAC,EAAE,CAACH,GAAE,OAAO,CAAC,EAAEV,EAAE,OAAOj8C,EAAE,cAAc,UAAU,CAAC,aAAa,GAAG87C,CAAE,IAAIc,EAAE,GAAG,SAAS,EAAE,EAAET,EAAE,IAAI,CAAC/K,EAAEniC,IAAI,CAAC,IAAIguC,EAAE,GAAG,CAACl6C,GAAEi6C,EAAC,EAAE5L,EAAE,MAAM,GAAG,EAAE,OAAOpxC,EAAE,cAAc,KAAK,CAAC,IAAIoxC,EAAE,IAAIsK,IAAI,OAAO6C,GAAI,EAAC7C,EAAE,SAAS,GAAG,IAAIiB,GAAE,UAAU/mC,EAAE,sBAAsB,GAAG,aAAa6mC,GAAG,kBAAkB15C,GAAE,kBAAkBi6C,GAAE,MAAM,CAAC,uBAAuB,KAAKC,EAAEb,EAAE,CAAC,IAAI,KAAK,OAAOa,EAAE,SAAS,CAAC,KAAK,WAAW,OAAOv8C,GAAG,SAAS,GAAGA,CAAC,KAAKA,GAAG05C,GAAG,UAAU,GAAGE,EAAE,KAAK,QAAQ,GAAGqB,CAAC,KAAK,GAAGH,CAAC,EAAE,OAAO3wC,GAAG,CAACiyC,GAAE,SAAS,CAACjyC,EAAE,cAAc,SAASA,EAAE,aAAa,IAAIiyC,GAAE,QAAQ,GAAGD,EAAE,UAAUA,EAAE,QAAQ,MAAM,CAAC,cAAc,EAAE,CAAC,EAAEA,EAAE,QAAQ,MAAM,EAAE,QAAQhyC,GAAG,CAACA,EAAE,kBAAkB,aAAaA,EAAE,OAAO,QAAQ,cAAc,SAASiyC,GAAE,UAAUA,GAAE,QAAQ,GAAGD,EAAE,QAAQhyC,EAAE,cAAc,EAAE,aAAa,IAAIghB,EAAE,EAAE,EAAE,YAAY,IAAIA,EAAE,EAAE,EAAE,aAAa,IAAI,CAAC0wB,IAAG1wB,EAAE,EAAE,CAAC,EAAE,cAAchhB,GAAG,CAACA,EAAE,kBAAkB,aAAaA,EAAE,OAAO,QAAQ,cAAc,SAAS2xC,GAAE,EAAE,CAAC,EAAE,YAAY,IAAIA,GAAE,EAAE,CAAC,EAAEP,EAAE,OAAOpxC,GAAG,CAACA,EAAE,UAAUoE,IAAI,GAAGpE,EAAE,WAAWumC,CAAC,EAAE,IAAI,CAACvmC,EAAE8K,KAAI,CAAC,IAAIunC,GAAEp6C,GAAE,OAAO9C,EAAE,cAAc26C,GAAG,CAAC,IAAI9vC,EAAE,GAAG,MAAMgxC,EAAG,MAAMlmC,GAAE,MAAM9K,EAAE,kBAAkBywC,EAAE,UAAU4B,GAAEr9C,GAAG,KAAK,OAAOA,EAAE,WAAW,KAAKq9C,GAAE3B,EAAE,UAAU17C,GAAG,KAAK,OAAOA,EAAE,UAAU,qBAAqBA,GAAG,KAAK,OAAOA,EAAE,qBAAqB,OAAOy4B,EAAE,cAAcmjB,EAAE,aAAa34C,GAAEjD,GAAG,KAAK,OAAOA,EAAE,cAAc,KAAKiD,GAAE62C,EAAE,YAAY4C,GAAE,SAASnL,EAAE,MAAMvxC,GAAG,KAAK,OAAOA,EAAE,MAAM,SAASA,GAAG,KAAK,OAAOA,EAAE,SAAS,WAAWA,GAAG,KAAK,OAAOA,EAAE,WAAW,kBAAkBA,GAAG,KAAK,OAAOA,EAAE,kBAAkB,kBAAkBA,GAAG,KAAK,OAAOA,EAAE,kBAAkB,YAAYk9C,GAAG,OAAOd,EAAE,OAAO9mC,IAAGA,GAAE,UAAUtK,EAAE,QAAQ,EAAE,QAAQuxC,EAAE,OAAOjnC,IAAGA,GAAE,UAAUtK,EAAE,QAAQ,EAAE,WAAWwxC,GAAE,gBAAgB3C,EAAE,IAAIiC,EAAE,YAAYC,EAAE,SAASU,GAAG,sBAAsBP,EAAE,GAAGC,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,ECgBr9U,MAAM0C,GAAW9sC,GAAA,WACf,CACE,CACE,KAAAC,EAAO,KACP,SAAA8sC,EAAW,GACX,QAAA5sC,EAAU,SACV,SAAAC,EACA,UAAA4sC,EAAY,GACZ,UAAA3sC,EACA,GAAGC,GAELC,IACG,CACH,MAAMC,EAAiBC,GACrBwsC,GAAc,QAAQ9sC,CAAO,EAC7B8sC,GAAc,KAAKhtC,CAAI,EACvB+sC,EACI,+BACA,+BACJ3sC,CAAA,EAGIR,EAAQ,CACZ,IAAAU,EACA,UAAWC,EACX,GAAGF,CAAA,EAGL,OAAIysC,EACMpsC,GAAAA,IAAA,IAAA,CAAG,GAAGd,EAAQ,SAAAO,CAAS,CAAA,EAI/BO,OAACusC,IAAK,IAAA3sC,EAAU,KAAMV,EAAM,KAAM,UAAWW,EAC1C,SAAAJ,CACH,CAAA,CAEJ,CACF,EC5Ca+sC,GAAuC,CAClD,KAAM,GACN,OAAQ,KACR,eAAgB,KAChB,SAAU,GACV,kBAAmB,MACrB,EAEMC,GAAkB5uC,GAAY,CAClC,KAAM,kBACN,aAAc2uC,GACd,SAAU,CACR,eACE9+C,EACA,CACE,QAAS,CAAE,OAAA8S,EAAQ,eAAAksC,CAAe,CAAA,EAOpC,CACAh/C,EAAM,KAAO,GACbA,EAAM,OAAS8S,EACf9S,EAAM,eAAiBg/C,CACzB,EACA,SAASh/C,EAAO,CACdA,EAAM,SAAW,EACnB,EACA,eAAeA,EAAO,CACpBA,EAAM,KAAO,GACbA,EAAM,OAAS,KACfA,EAAM,eAAiB,IACzB,EACA,MAAMA,EAAO,CACXA,EAAM,OAAS,KACfA,EAAM,eAAiB,IACzB,EACA,qBAAqBA,EAAO,CAAE,QAAAyS,GAA4D,CACxFzS,EAAM,kBAAoByS,CAC5B,EACA,YACEzS,EACA,CAAE,QAAS,CAAE,SAAAi/C,IACb,CACAj/C,EAAM,kBAAkBi/C,EAAS,MAAM,EAAIA,EAAS,QACtD,EACA,eAAej/C,EAAO,CAAE,QAAS,CAAE,OAAA8S,IAA6C,CACvE,OAAA9S,EAAM,kBAAkB8S,CAAM,CACvC,CACF,CACF,CAAC,EAEYosC,GAAoBH,GAAgB,QAElCI,GAAAJ,GAAgB,QC3DlBK,GAA6B,CACxC,MAAO,CAAC,CACV,EAEMC,GAAalvC,GAAY,CAC7B,KAAM,aACN,aAAcivC,GACd,SAAU,CACR,QAAQp/C,EAAO,CAAE,QAAS,CAAE,KAAAs/C,IAAgD,CAC1Et/C,EAAM,MAAMs/C,EAAK,KAAK,EAAE,EAAIA,CAC9B,EACA,YACEt/C,EACA,CAAE,QAAS,CAAE,SAAAi/C,IACb,CACMj/C,EAAA,MAAMi/C,EAAS,MAAM,EAAIj/C,EAAM,MAAMi/C,EAAS,MAAM,GAAK,GAC/Dj/C,EAAM,MAAMi/C,EAAS,MAAM,EAAE,SAAWA,CAC1C,EACA,eAAej/C,EAAO,CAAE,QAAS,CAAE,OAAA8S,IAA6C,QAC3ElR,EAAA5B,EAAM,MAAM,OAAO8S,CAAM,CAAC,IAA1B,MAAAlR,EAA6B,UAC9B,OAAO5B,EAAM,MAAM,OAAO8S,CAAM,CAAC,EAAE,QAEvC,EACA,gBACE9S,EACA,CAAE,QAAS,CAAE,OAAA8S,EAAQ,aAAAysC,CAAA,GACrB,CAEA,IAAIC,EAAQ,GACZx/C,EAAM,MAAM8S,CAAM,EAAI9S,EAAM,MAAM8S,CAAM,GAAK,GACvC9S,EAAA,MAAM8S,CAAM,EAAE,SAAS,UAAU,QAAQ,CAAC2sC,EAAUp9C,IAAU,CAC9Do9C,EAAS,KAAOF,EAAa,KAC/Bv/C,EAAM,MAAM8S,CAAM,EAAE,SAAS,UAAUzQ,CAAK,EAAIk9C,EACxCC,EAAA,GACV,CACD,EAEGA,GACFx/C,EAAM,MAAM8S,CAAM,EAAE,SAAS,UAAU,KAAKysC,CAAY,CAE5D,EACA,mBAAmBv/C,EAAO,CAAE,QAAS,CAAE,OAAA8S,EAAQ,eAAA4sC,CAAA,GAA6E,CAC1H1/C,EAAM,MAAM8S,CAAM,EAAE,SAAS,UAAY9S,EAAM,MAAM8S,CAAM,EAAE,SAAS,UAAU,OAAQ6sC,GAAQA,EAAI,KAAOD,CAAc,CAC3H,EACA,YACE1/C,EACA,CAAE,QAAS,CAAE,OAAA8S,EAAQ,SAAAQ,CAAA,GACrB,CAEA,IAAIksC,EAAQ,GACZx/C,EAAM,MAAM8S,CAAM,EAAE,UAAU,QAAQ,CAAC8sC,EAAIv9C,IAAU,CAC/Cu9C,EAAG,KAAOtsC,EAAS,KACrBtT,EAAM,MAAM8S,CAAM,EAAE,UAAUzQ,CAAK,EAAIiR,EAC/BksC,EAAA,GACV,CACD,EAEGA,GACFx/C,EAAM,MAAM8S,CAAM,EAAE,UAAU,KAAKQ,CAAQ,CAE/C,EACA,aACEtT,EACA,CAAE,QAAS,CAAE,OAAA8S,EAAQ,UAAA+sC,CAAA,GACrB,CACM7/C,EAAA,MAAM8S,CAAM,EAAE,UAAY+sC,CAClC,EACA,eAAe7/C,EAAO,CAAE,QAAS,CAAE,OAAA8S,EAAQ,WAAAgtC,CAAA,GAAqE,CAC9G9/C,EAAM,MAAM8S,CAAM,EAAE,UAAY9S,EAAM,MAAM8S,CAAM,EAAE,UAAU,OAAQQ,GAAaA,EAAS,KAAOwsC,CAAU,CAC/G,EACA,QACE9/C,EACA,CAAE,QAAS,CAAE,OAAA8S,EAAQ,KAAAitC,CAAA,GACrB,CACM//C,EAAA,MAAM8S,CAAM,EAAE,KAAOitC,CAC7B,EACA,cAAc//C,EAAO,CAAE,QAAS,CAAE,OAAA8S,EAAQ,UAAAktC,CAAA,GAAmE,CAC3GhgD,EAAM,MAAM8S,CAAM,EAAE,SAAW9S,EAAM,MAAM8S,CAAM,EAAE,SAAS,OAAQmtC,GAAYA,EAAQ,KAAOD,CAAS,CAC1G,EACA,YACEhgD,EACA,CAAE,QAAS,CAAE,OAAA8S,EAAQ,SAAAotC,CAAA,GACrB,CACMlgD,EAAA,MAAM8S,CAAM,EAAE,SAAWotC,CACjC,CACF,CACF,CAAC,EAE0Bb,GAAW,QAEtC,MAAec,GAAAd,GAAW,QAEb,CAAE,QAAAe,GAAS,YAAAC,GAAa,eAAAC,GAAgB,gBAAAC,GAAiB,mBAAAC,GAAoB,YAAAC,GAAa,eAAAC,GAAgB,aAAAC,GAAc,QAAAC,GAAS,cAAAC,GAAe,YAAAC,EAAA,EAAgBzB,GAAW","x_google_ignoreList":[0,1,2,3,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,134,135,136,139]}