@sunrise-upc/sales-static-components 3.7.12 → 3.8.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (70) hide show
  1. package/dist/cjs/_virtual/_commonjsHelpers.js +1 -1
  2. package/dist/cjs/components/linecheck/AutoComplete.js +1 -1
  3. package/dist/cjs/components/linecheck/AutoComplete.js.map +1 -1
  4. package/dist/cjs/node_modules/@algolia/client-common/dist/common.js +1 -1
  5. package/dist/cjs/node_modules/@algolia/client-common/dist/common.js.map +1 -1
  6. package/dist/cjs/node_modules/@reduxjs/toolkit/dist/redux-toolkit.modern.js +1 -1
  7. package/dist/cjs/node_modules/@reduxjs/toolkit/dist/redux-toolkit.modern.js.map +1 -1
  8. package/dist/cjs/node_modules/algoliasearch/dist/lite/builds/browser.js +1 -1
  9. package/dist/cjs/node_modules/algoliasearch/dist/lite/builds/browser.js.map +1 -1
  10. package/dist/cjs/node_modules/immer/dist/immer.js +1 -1
  11. package/dist/cjs/node_modules/immer/dist/immer.js.map +1 -1
  12. package/dist/cjs/node_modules/instantsearch.js/es/lib/chat/openChat.js +2 -0
  13. package/dist/cjs/node_modules/instantsearch.js/es/lib/chat/openChat.js.map +1 -0
  14. package/dist/cjs/node_modules/instantsearch.js/es/lib/utils/getHighlightFromSiblings.js +1 -1
  15. package/dist/cjs/node_modules/instantsearch.js/es/lib/utils/getHighlightFromSiblings.js.map +1 -1
  16. package/dist/cjs/node_modules/instantsearch.js/es/lib/version.js +1 -1
  17. package/dist/cjs/node_modules/instantsearch.js/es/lib/version.js.map +1 -1
  18. package/dist/cjs/node_modules/qs/lib/parse.js +1 -1
  19. package/dist/cjs/node_modules/qs/lib/parse.js.map +1 -1
  20. package/dist/cjs/node_modules/qs/lib/stringify.js +1 -1
  21. package/dist/cjs/node_modules/qs/lib/stringify.js.map +1 -1
  22. package/dist/cjs/node_modules/qs/lib/utils.js +1 -1
  23. package/dist/cjs/node_modules/qs/lib/utils.js.map +1 -1
  24. package/dist/cjs/node_modules/react-instantsearch/dist/es/ui/SearchBox.js +1 -1
  25. package/dist/cjs/node_modules/react-instantsearch/dist/es/ui/SearchBox.js.map +1 -1
  26. package/dist/cjs/node_modules/react-instantsearch/dist/es/widgets/SearchBox.js +1 -1
  27. package/dist/cjs/node_modules/react-instantsearch/dist/es/widgets/SearchBox.js.map +1 -1
  28. package/dist/cjs/node_modules/react-instantsearch-core/dist/es/version.js +1 -1
  29. package/dist/cjs/node_modules/react-instantsearch-core/dist/es/version.js.map +1 -1
  30. package/dist/cjs/node_modules/react-redux/dist/react-redux.js.map +1 -1
  31. package/dist/cjs/node_modules/side-channel/index.js +1 -1
  32. package/dist/cjs/node_modules/side-channel/index.js.map +1 -1
  33. package/dist/esm/_virtual/_commonjsHelpers.js +1 -1
  34. package/dist/esm/components/linecheck/AutoComplete.js +1 -1
  35. package/dist/esm/components/linecheck/AutoComplete.js.map +1 -1
  36. package/dist/esm/node_modules/@algolia/client-common/dist/common.js +1 -1
  37. package/dist/esm/node_modules/@algolia/client-common/dist/common.js.map +1 -1
  38. package/dist/esm/node_modules/@reduxjs/toolkit/dist/redux-toolkit.modern.js +1 -1
  39. package/dist/esm/node_modules/@reduxjs/toolkit/dist/redux-toolkit.modern.js.map +1 -1
  40. package/dist/esm/node_modules/algoliasearch/dist/lite/builds/browser.js +1 -1
  41. package/dist/esm/node_modules/algoliasearch/dist/lite/builds/browser.js.map +1 -1
  42. package/dist/esm/node_modules/immer/dist/immer.js +1 -1
  43. package/dist/esm/node_modules/immer/dist/immer.js.map +1 -1
  44. package/dist/esm/node_modules/instantsearch.js/es/lib/chat/openChat.js +2 -0
  45. package/dist/esm/node_modules/instantsearch.js/es/lib/chat/openChat.js.map +1 -0
  46. package/dist/esm/node_modules/instantsearch.js/es/lib/utils/getHighlightFromSiblings.js +1 -1
  47. package/dist/esm/node_modules/instantsearch.js/es/lib/utils/getHighlightFromSiblings.js.map +1 -1
  48. package/dist/esm/node_modules/instantsearch.js/es/lib/version.js +1 -1
  49. package/dist/esm/node_modules/instantsearch.js/es/lib/version.js.map +1 -1
  50. package/dist/esm/node_modules/qs/lib/parse.js +1 -1
  51. package/dist/esm/node_modules/qs/lib/parse.js.map +1 -1
  52. package/dist/esm/node_modules/qs/lib/stringify.js +1 -1
  53. package/dist/esm/node_modules/qs/lib/stringify.js.map +1 -1
  54. package/dist/esm/node_modules/qs/lib/utils.js +1 -1
  55. package/dist/esm/node_modules/qs/lib/utils.js.map +1 -1
  56. package/dist/esm/node_modules/react-instantsearch/dist/es/ui/SearchBox.js +1 -1
  57. package/dist/esm/node_modules/react-instantsearch/dist/es/ui/SearchBox.js.map +1 -1
  58. package/dist/esm/node_modules/react-instantsearch/dist/es/widgets/SearchBox.js +1 -1
  59. package/dist/esm/node_modules/react-instantsearch/dist/es/widgets/SearchBox.js.map +1 -1
  60. package/dist/esm/node_modules/react-instantsearch-core/dist/es/version.js +1 -1
  61. package/dist/esm/node_modules/react-instantsearch-core/dist/es/version.js.map +1 -1
  62. package/dist/esm/node_modules/react-redux/dist/react-redux.js.map +1 -1
  63. package/dist/esm/node_modules/side-channel/index.js +1 -1
  64. package/dist/esm/node_modules/side-channel/index.js.map +1 -1
  65. package/dist/navigation.css +382 -382
  66. package/package.json +1 -1
  67. package/dist/cjs/node_modules/reselect/dist/reselect.js +0 -2
  68. package/dist/cjs/node_modules/reselect/dist/reselect.js.map +0 -1
  69. package/dist/esm/node_modules/reselect/dist/reselect.js +0 -2
  70. package/dist/esm/node_modules/reselect/dist/reselect.js.map +0 -1
@@ -1 +1 @@
1
- {"version":3,"file":"browser.js","sources":["../../../../../../../node_modules/algoliasearch/dist/lite/builds/browser.js"],"sourcesContent":["// lite/builds/browser.ts\nimport {\n createBrowserLocalStorageCache,\n createFallbackableCache,\n createMemoryCache,\n createNullLogger\n} from \"@algolia/client-common\";\nimport { createXhrRequester } from \"@algolia/requester-browser-xhr\";\n\n// lite/src/liteClient.ts\nimport { createAuth, createTransporter, getAlgoliaAgent, shuffle } from \"@algolia/client-common\";\nvar apiClientVersion = \"5.52.1\";\nfunction getDefaultHosts(appId) {\n return [\n {\n url: `${appId}-dsn.algolia.net`,\n accept: \"read\",\n protocol: \"https\"\n },\n {\n url: `${appId}.algolia.net`,\n accept: \"write\",\n protocol: \"https\"\n }\n ].concat(\n shuffle([\n {\n url: `${appId}-1.algolianet.com`,\n accept: \"readWrite\",\n protocol: \"https\"\n },\n {\n url: `${appId}-2.algolianet.com`,\n accept: \"readWrite\",\n protocol: \"https\"\n },\n {\n url: `${appId}-3.algolianet.com`,\n accept: \"readWrite\",\n protocol: \"https\"\n }\n ])\n );\n}\nfunction createLiteClient({\n appId: appIdOption,\n apiKey: apiKeyOption,\n authMode,\n algoliaAgents,\n ...options\n}) {\n const auth = createAuth(appIdOption, apiKeyOption, authMode);\n const transporter = createTransporter({\n hosts: getDefaultHosts(appIdOption),\n ...options,\n algoliaAgent: getAlgoliaAgent({\n algoliaAgents,\n client: \"Lite\",\n version: apiClientVersion\n }),\n baseHeaders: {\n \"content-type\": \"text/plain\",\n ...auth.headers(),\n ...options.baseHeaders\n },\n baseQueryParameters: {\n ...auth.queryParameters(),\n ...options.baseQueryParameters\n }\n });\n return {\n transporter,\n /**\n * The `appId` currently in use.\n */\n appId: appIdOption,\n /**\n * The `apiKey` currently in use.\n */\n apiKey: apiKeyOption,\n /**\n * Clears the cache of the transporter for the `requestsCache` and `responsesCache` properties.\n */\n clearCache() {\n return Promise.all([transporter.requestsCache.clear(), transporter.responsesCache.clear()]).then(() => void 0);\n },\n /**\n * Get the value of the `algoliaAgent`, used by our libraries internally and telemetry system.\n */\n get _ua() {\n return transporter.algoliaAgent.value;\n },\n /**\n * Adds a `segment` to the `x-algolia-agent` sent with every requests.\n *\n * @param segment - The algolia agent (user-agent) segment to add.\n * @param version - The version of the agent.\n */\n addAlgoliaAgent(segment, version) {\n transporter.algoliaAgent.add({ segment, version });\n },\n /**\n * Helper method to switch the API key used to authenticate the requests.\n *\n * @param params - Method params.\n * @param params.apiKey - The new API Key to use.\n */\n setClientApiKey({ apiKey }) {\n if (!authMode || authMode === \"WithinHeaders\") {\n transporter.baseHeaders[\"x-algolia-api-key\"] = apiKey;\n } else {\n transporter.baseQueryParameters[\"x-algolia-api-key\"] = apiKey;\n }\n },\n /**\n * Helper: calls the `search` method but with certainty that we will only request Algolia records (hits) and not facets.\n * Disclaimer: We don't assert that the parameters you pass to this method only contains `hits` requests to prevent impacting search performances, this helper is purely for typing purposes.\n *\n * @summary Search multiple indices for `hits`.\n * @param searchMethodParams - Query requests and strategies. Results will be received in the same order as the queries.\n * @param requestOptions - The requestOptions to send along with the query, they will be merged with the transporter requestOptions.\n */\n searchForHits(searchMethodParams, requestOptions) {\n return this.search(searchMethodParams, requestOptions);\n },\n /**\n * Helper: calls the `search` method but with certainty that we will only request Algolia facets and not records (hits).\n * Disclaimer: We don't assert that the parameters you pass to this method only contains `facets` requests to prevent impacting search performances, this helper is purely for typing purposes.\n *\n * @summary Search multiple indices for `facets`.\n * @param searchMethodParams - Query requests and strategies. Results will be received in the same order as the queries.\n * @param requestOptions - The requestOptions to send along with the query, they will be merged with the transporter requestOptions.\n */\n searchForFacets(searchMethodParams, requestOptions) {\n return this.search(searchMethodParams, requestOptions);\n },\n /**\n * This method lets you send requests to the Algolia REST API.\n * @param customPost - The customPost object.\n * @param customPost.path - Path of the endpoint, for example `1/newFeature`.\n * @param customPost.parameters - Query parameters to apply to the current query.\n * @param customPost.body - Parameters to send with the custom request.\n * @param requestOptions - The requestOptions to send along with the query, they will be merged with the transporter requestOptions.\n */\n customPost({ path, parameters, body }, requestOptions) {\n if (!path) {\n throw new Error(\"Parameter `path` is required when calling `customPost`.\");\n }\n const requestPath = \"/{path}\".replace(\"{path}\", path);\n const headers = {};\n const queryParameters = parameters ? parameters : {};\n const request = {\n method: \"POST\",\n path: requestPath,\n queryParameters,\n headers,\n data: body ? body : {}\n };\n return transporter.request(request, requestOptions);\n },\n /**\n * Retrieves recommendations from selected AI models.\n *\n * Required API Key ACLs:\n * - search\n * @param getRecommendationsParams - The getRecommendationsParams object.\n * @param requestOptions - The requestOptions to send along with the query, they will be merged with the transporter requestOptions.\n */\n getRecommendations(getRecommendationsParams, requestOptions) {\n if (getRecommendationsParams && Array.isArray(getRecommendationsParams)) {\n const newSignatureRequest = {\n requests: getRecommendationsParams\n };\n getRecommendationsParams = newSignatureRequest;\n }\n if (!getRecommendationsParams) {\n throw new Error(\"Parameter `getRecommendationsParams` is required when calling `getRecommendations`.\");\n }\n if (!getRecommendationsParams.requests) {\n throw new Error(\"Parameter `getRecommendationsParams.requests` is required when calling `getRecommendations`.\");\n }\n const requestPath = \"/1/indexes/*/recommendations\";\n const headers = {};\n const queryParameters = {};\n const request = {\n method: \"POST\",\n path: requestPath,\n queryParameters,\n headers,\n data: getRecommendationsParams,\n useReadTransporter: true,\n cacheable: true\n };\n return transporter.request(request, requestOptions);\n },\n /**\n * Runs multiple search queries against one or more indices in a single API request. Use cases include: - Searching different indices, such as products and marketing content. - Run multiple queries on the same index with different parameters or filters. If you know the expected result type, use the `searchForHits` or `searchForFacets` helper to simplify the response format.\n *\n * Required API Key ACLs:\n * - search\n * @param searchMethodParams - Multi-query search request body. Results are returned in the same order as the requests.\n * @param requestOptions - The requestOptions to send along with the query, they will be merged with the transporter requestOptions.\n */\n search(searchMethodParams, requestOptions) {\n if (searchMethodParams && Array.isArray(searchMethodParams)) {\n const newSignatureRequest = {\n requests: searchMethodParams.map(({ params, ...legacyRequest }) => {\n if (legacyRequest.type === \"facet\") {\n return {\n ...legacyRequest,\n ...params,\n type: \"facet\"\n };\n }\n return {\n ...legacyRequest,\n ...params,\n facet: void 0,\n maxFacetHits: void 0,\n facetQuery: void 0\n };\n })\n };\n searchMethodParams = newSignatureRequest;\n }\n if (!searchMethodParams) {\n throw new Error(\"Parameter `searchMethodParams` is required when calling `search`.\");\n }\n if (!searchMethodParams.requests) {\n throw new Error(\"Parameter `searchMethodParams.requests` is required when calling `search`.\");\n }\n const requestPath = \"/1/indexes/*/queries\";\n const headers = {};\n const queryParameters = {};\n const request = {\n method: \"POST\",\n path: requestPath,\n queryParameters,\n headers,\n data: searchMethodParams,\n useReadTransporter: true,\n cacheable: true\n };\n return transporter.request(request, requestOptions);\n }\n };\n}\n\n// lite/builds/browser.ts\nfunction liteClient(appId, apiKey, options) {\n if (!appId || typeof appId !== \"string\") {\n throw new Error(\"`appId` is missing.\");\n }\n if (!apiKey || typeof apiKey !== \"string\") {\n throw new Error(\"`apiKey` is missing.\");\n }\n const { compression: _compression, ...browserOptions } = options || {};\n return createLiteClient({\n appId,\n apiKey,\n timeouts: {\n connect: 1e3,\n read: 2e3,\n write: 3e4\n },\n logger: createNullLogger(),\n requester: createXhrRequester(),\n algoliaAgents: [{ segment: \"Browser\" }],\n authMode: \"WithinQueryParameters\",\n responsesCache: createMemoryCache(),\n requestsCache: createMemoryCache({ serializable: false }),\n hostsCache: createFallbackableCache({\n caches: [createBrowserLocalStorageCache({ key: `${apiClientVersion}-${appId}` }), createMemoryCache()]\n }),\n ...browserOptions\n });\n}\nexport {\n apiClientVersion,\n liteClient\n};\n//# sourceMappingURL=browser.js.map"],"names":["apiClientVersion","liteClient","appId","apiKey","options","Error","compression","_compression","browserOptions","appIdOption","apiKeyOption","authMode","algoliaAgents","auth","createAuth","transporter","createTransporter","hosts","url","accept","protocol","concat","shuffle","algoliaAgent","getAlgoliaAgent","client","version","baseHeaders","headers","baseQueryParameters","queryParameters","clearCache","Promise","all","requestsCache","clear","responsesCache","then","_ua","value","addAlgoliaAgent","segment","add","setClientApiKey","searchForHits","searchMethodParams","requestOptions","this","search","searchForFacets","customPost","path","parameters","body","request","method","replace","data","getRecommendations","getRecommendationsParams","Array","isArray","requests","useReadTransporter","cacheable","newSignatureRequest","map","params","legacyRequest","type","facet","maxFacetHits","facetQuery","createLiteClient","timeouts","connect","read","write","logger","createNullLogger","requester","createXhrRequester","createMemoryCache","serializable","hostsCache","createFallbackableCache","caches","createBrowserLocalStorageCache","key"],"mappings":"4VAWG,IAACA,EAAmB,SA8OvB,SAASC,EAAWC,EAAOC,EAAQC,GACjC,GAA+B,iBAAVF,EACnB,MAAM,IAAIG,MAAM,uBAElB,GAAiC,iBAAXF,EACpB,MAAM,IAAIE,MAAM,wBAElB,MAAQC,YAAaC,KAAiBC,GAA8B,CAAA,EACpE,OArNF,UACEN,MAAOO,EACPN,OAAQO,EAAYC,SACpBA,EAAQC,cACRA,KACGR,IAEH,MAAMS,EAAOC,EAAWL,EAAaC,EAAcC,GAC7CI,EAAcC,EAAkB,CACpCC,OAzCqBf,EAyCEO,EAxClB,CACL,CACES,IAAK,GAAGhB,oBACRiB,OAAQ,OACRC,SAAU,SAEZ,CACEF,IAAK,GAAGhB,gBACRiB,OAAQ,QACRC,SAAU,UAEZC,OACAC,EAAQ,CACN,CACEJ,IAAK,GAAGhB,qBACRiB,OAAQ,YACRC,SAAU,SAEZ,CACEF,IAAK,GAAGhB,qBACRiB,OAAQ,YACRC,SAAU,SAEZ,CACEF,IAAK,GAAGhB,qBACRiB,OAAQ,YACRC,SAAU,gBAeXhB,EACHmB,aAAcC,EAAgB,CAC5BZ,gBACAa,OAAQ,OACRC,QAAS1B,IAEX2B,YAAa,CACX,eAAgB,gBACbd,EAAKe,aACLxB,EAAQuB,aAEbE,oBAAqB,IAChBhB,EAAKiB,qBACL1B,EAAQyB,uBAvDjB,IAAyB3B,EA0DvB,MAAO,CACLa,cAIAb,MAAOO,EAIPN,OAAQO,EAIRqB,WAAU,IACDC,QAAQC,IAAI,CAAClB,EAAYmB,cAAcC,QAASpB,EAAYqB,eAAeD,UAAUE,KAAK,QAKnG,OAAIC,GACF,OAAOvB,EAAYQ,aAAagB,KAClC,EAOA,eAAAC,CAAgBC,EAASf,GACvBX,EAAYQ,aAAamB,IAAI,CAAED,UAASf,WAC1C,EAOA,eAAAiB,EAAgBxC,OAAEA,IACXQ,GAAyB,kBAAbA,EAGfI,EAAYc,oBAAoB,qBAAuB1B,EAFvDY,EAAYY,YAAY,qBAAuBxB,CAInD,EASA,aAAAyC,CAAcC,EAAoBC,GAChC,OAAOC,KAAKC,OAAOH,EAAoBC,EACzC,EASA,eAAAG,CAAgBJ,EAAoBC,GAClC,OAAOC,KAAKC,OAAOH,EAAoBC,EACzC,EASA,UAAAI,EAAWC,KAAEA,EAAIC,WAAEA,EAAUC,KAAEA,GAAQP,GACrC,IAAKK,EACH,MAAM,IAAI9C,MAAM,2DAElB,MAGMiD,EAAU,CACdC,OAAQ,OACRJ,KALkB,UAAUK,QAAQ,SAAUL,GAM9CrB,gBAJsBsB,GAA0B,CAAA,EAKhDxB,QANc,CAAA,EAOd6B,KAAMJ,GAAc,CAAA,GAEtB,OAAOtC,EAAYuC,QAAQA,EAASR,EACtC,EASA,kBAAAY,CAAmBC,EAA0Bb,GAO3C,GANIa,GAA4BC,MAAMC,QAAQF,KAI5CA,EAH4B,CAC1BG,SAAUH,KAITA,EACH,MAAM,IAAItD,MAAM,uFAElB,IAAKsD,EAAyBG,SAC5B,MAAM,IAAIzD,MAAM,gGAElB,MAGMiD,EAAU,CACdC,OAAQ,OACRJ,KALkB,+BAMlBrB,gBAJsB,CAAA,EAKtBF,QANc,CAAA,EAOd6B,KAAME,EACNI,oBAAoB,EACpBC,WAAW,GAEb,OAAOjD,EAAYuC,QAAQA,EAASR,EACtC,EASA,MAAAE,CAAOH,EAAoBC,GACzB,GAAID,GAAsBe,MAAMC,QAAQhB,GAAqB,CAC3D,MAAMoB,EAAsB,CAC1BH,SAAUjB,EAAmBqB,IAAI,EAAGC,YAAWC,KAClB,UAAvBA,EAAcC,KACT,IACFD,KACAD,EACHE,KAAM,SAGH,IACFD,KACAD,EACHG,WAAO,EACPC,kBAAc,EACdC,gBAAY,KAIlB3B,EAAqBoB,CACvB,CACA,IAAKpB,EACH,MAAM,IAAIxC,MAAM,qEAElB,IAAKwC,EAAmBiB,SACtB,MAAM,IAAIzD,MAAM,8EAElB,MAGMiD,EAAU,CACdC,OAAQ,OACRJ,KALkB,uBAMlBrB,gBAJsB,CAAA,EAKtBF,QANc,CAAA,EAOd6B,KAAMZ,EACNkB,oBAAoB,EACpBC,WAAW,GAEb,OAAOjD,EAAYuC,QAAQA,EAASR,EACtC,EAEJ,CAWS2B,CAAiB,CACtBvE,QACAC,SACAuE,SAAU,CACRC,QAAS,IACTC,KAAM,IACNC,MAAO,KAETC,OAAQC,IACRC,UAAWC,IACXrE,cAAe,CAAC,CAAE6B,QAAS,YAC3B9B,SAAU,wBACVyB,eAAgB8C,IAChBhD,cAAegD,EAAkB,CAAEC,cAAc,IACjDC,WAAYC,EAAwB,CAClCC,OAAQ,CAACC,EAA+B,CAAEC,IAAK,GAAGxF,KAAoBE,MAAYgF,UAEjF1E,GAEP","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"browser.js","sources":["../../../../../../../node_modules/algoliasearch/dist/lite/builds/browser.js"],"sourcesContent":["// lite/builds/browser.ts\nimport {\n createBrowserLocalStorageCache,\n createFallbackableCache,\n createMemoryCache,\n createNullLogger\n} from \"@algolia/client-common\";\nimport { createXhrRequester } from \"@algolia/requester-browser-xhr\";\n\n// lite/src/liteClient.ts\nimport { createAuth, createTransporter, getAlgoliaAgent, shuffle, validateRequired } from \"@algolia/client-common\";\nvar apiClientVersion = \"5.55.1\";\nfunction getDefaultHosts(appId) {\n return [\n {\n url: `${appId}-dsn.algolia.net`,\n accept: \"read\",\n protocol: \"https\"\n },\n {\n url: `${appId}.algolia.net`,\n accept: \"write\",\n protocol: \"https\"\n }\n ].concat(\n shuffle([\n {\n url: `${appId}-1.algolianet.com`,\n accept: \"readWrite\",\n protocol: \"https\"\n },\n {\n url: `${appId}-2.algolianet.com`,\n accept: \"readWrite\",\n protocol: \"https\"\n },\n {\n url: `${appId}-3.algolianet.com`,\n accept: \"readWrite\",\n protocol: \"https\"\n }\n ])\n );\n}\nfunction createLiteClient({\n appId: appIdOption,\n apiKey: apiKeyOption,\n authMode,\n algoliaAgents,\n ...options\n}) {\n const auth = createAuth(appIdOption, apiKeyOption, authMode);\n const transporter = createTransporter({\n hosts: getDefaultHosts(appIdOption),\n ...options,\n algoliaAgent: getAlgoliaAgent({\n algoliaAgents,\n client: \"Lite\",\n version: apiClientVersion\n }),\n baseHeaders: {\n \"content-type\": \"text/plain\",\n ...auth.headers(),\n ...options.baseHeaders\n },\n baseQueryParameters: {\n ...auth.queryParameters(),\n ...options.baseQueryParameters\n }\n });\n return {\n transporter,\n /**\n * The `appId` currently in use.\n */\n appId: appIdOption,\n /**\n * The `apiKey` currently in use.\n */\n apiKey: apiKeyOption,\n /**\n * Clears the cache of the transporter for the `requestsCache` and `responsesCache` properties.\n */\n clearCache() {\n return Promise.all([transporter.requestsCache.clear(), transporter.responsesCache.clear()]).then(() => void 0);\n },\n /**\n * Get the value of the `algoliaAgent`, used by our libraries internally and telemetry system.\n */\n get _ua() {\n return transporter.algoliaAgent.value;\n },\n /**\n * Adds a `segment` to the `x-algolia-agent` sent with every requests.\n *\n * @param segment - The algolia agent (user-agent) segment to add.\n * @param version - The version of the agent.\n */\n addAlgoliaAgent(segment, version) {\n transporter.algoliaAgent.add({ segment, version });\n },\n /**\n * Helper method to switch the API key used to authenticate the requests.\n *\n * @param params - Method params.\n * @param params.apiKey - The new API Key to use.\n */\n setClientApiKey({ apiKey }) {\n if (!authMode || authMode === \"WithinHeaders\") {\n transporter.baseHeaders[\"x-algolia-api-key\"] = apiKey;\n } else {\n transporter.baseQueryParameters[\"x-algolia-api-key\"] = apiKey;\n }\n },\n /**\n * Helper: calls the `search` method but with certainty that we will only request Algolia records (hits) and not facets.\n * Disclaimer: We don't assert that the parameters you pass to this method only contains `hits` requests to prevent impacting search performances, this helper is purely for typing purposes.\n *\n * @summary Search multiple indices for `hits`.\n * @param searchMethodParams - Query requests and strategies. Results will be received in the same order as the queries.\n * @param requestOptions - The requestOptions to send along with the query, they will be merged with the transporter requestOptions.\n */\n searchForHits(searchMethodParams, requestOptions) {\n return this.search(searchMethodParams, requestOptions);\n },\n /**\n * Helper: calls the `search` method but with certainty that we will only request Algolia facets and not records (hits).\n * Disclaimer: We don't assert that the parameters you pass to this method only contains `facets` requests to prevent impacting search performances, this helper is purely for typing purposes.\n *\n * @summary Search multiple indices for `facets`.\n * @param searchMethodParams - Query requests and strategies. Results will be received in the same order as the queries.\n * @param requestOptions - The requestOptions to send along with the query, they will be merged with the transporter requestOptions.\n */\n searchForFacets(searchMethodParams, requestOptions) {\n return this.search(searchMethodParams, requestOptions);\n },\n /**\n * This method lets you send requests to the Algolia REST API.\n * @param customPost - The customPost object.\n * @param customPost.path - Path of the endpoint, for example `1/newFeature`.\n * @param customPost.parameters - Query parameters to apply to the current query.\n * @param customPost.body - Parameters to send with the custom request.\n * @param requestOptions - The requestOptions to send along with the query, they will be merged with the transporter requestOptions.\n */\n customPost({ path, parameters, body }, requestOptions) {\n validateRequired(\"path\", \"customPost\", path);\n const requestPath = \"/{path}\".replace(\"{path}\", path);\n const headers = {};\n const queryParameters = parameters ? parameters : {};\n const request = {\n method: \"POST\",\n path: requestPath,\n queryParameters,\n headers,\n data: body ? body : {}\n };\n return transporter.request(request, requestOptions);\n },\n /**\n * Retrieves recommendations from selected AI models.\n *\n * Required API Key ACLs:\n * - search\n * @param getRecommendationsParams - The getRecommendationsParams object.\n * @param requestOptions - The requestOptions to send along with the query, they will be merged with the transporter requestOptions.\n */\n getRecommendations(getRecommendationsParams, requestOptions) {\n if (getRecommendationsParams && Array.isArray(getRecommendationsParams)) {\n const newSignatureRequest = {\n requests: getRecommendationsParams\n };\n getRecommendationsParams = newSignatureRequest;\n }\n validateRequired(\"getRecommendationsParams\", \"getRecommendations\", getRecommendationsParams);\n validateRequired(\"getRecommendationsParams.requests\", \"getRecommendations\", getRecommendationsParams.requests);\n const requestPath = \"/1/indexes/*/recommendations\";\n const headers = {};\n const queryParameters = {};\n const request = {\n method: \"POST\",\n path: requestPath,\n queryParameters,\n headers,\n data: getRecommendationsParams,\n useReadTransporter: true,\n cacheable: true\n };\n return transporter.request(request, requestOptions);\n },\n /**\n * Runs multiple search queries against one or more indices in a single API request. Use cases include: - Searching different indices, such as products and marketing content. - Run multiple queries on the same index with different parameters or filters. If you know the expected result type, use the `searchForHits` or `searchForFacets` helper to simplify the response format.\n *\n * Required API Key ACLs:\n * - search\n * @param searchMethodParams - Multi-query search request body. Results are returned in the same order as the requests.\n * @param requestOptions - The requestOptions to send along with the query, they will be merged with the transporter requestOptions.\n */\n search(searchMethodParams, requestOptions) {\n if (searchMethodParams && Array.isArray(searchMethodParams)) {\n const newSignatureRequest = {\n requests: searchMethodParams.map(({ params, ...legacyRequest }) => {\n if (legacyRequest.type === \"facet\") {\n return {\n ...legacyRequest,\n ...params,\n type: \"facet\"\n };\n }\n return {\n ...legacyRequest,\n ...params,\n facet: void 0,\n maxFacetHits: void 0,\n facetQuery: void 0\n };\n })\n };\n searchMethodParams = newSignatureRequest;\n }\n validateRequired(\"searchMethodParams\", \"search\", searchMethodParams);\n validateRequired(\"searchMethodParams.requests\", \"search\", searchMethodParams.requests);\n const requestPath = \"/1/indexes/*/queries\";\n const headers = {};\n const queryParameters = {};\n const request = {\n method: \"POST\",\n path: requestPath,\n queryParameters,\n headers,\n data: searchMethodParams,\n useReadTransporter: true,\n cacheable: true\n };\n return transporter.request(request, requestOptions);\n }\n };\n}\n\n// lite/builds/browser.ts\nfunction liteClient(appId, apiKey, options) {\n if (!appId || typeof appId !== \"string\") {\n throw new Error(\"`appId` is missing.\");\n }\n if (!apiKey || typeof apiKey !== \"string\") {\n throw new Error(\"`apiKey` is missing.\");\n }\n const { compression: _compression, ...browserOptions } = options || {};\n return createLiteClient({\n appId,\n apiKey,\n timeouts: {\n connect: 1e3,\n read: 2e3,\n write: 3e4\n },\n logger: createNullLogger(),\n requester: createXhrRequester(),\n algoliaAgents: [{ segment: \"Browser\" }],\n authMode: \"WithinQueryParameters\",\n responsesCache: createMemoryCache(),\n requestsCache: createMemoryCache({ serializable: false }),\n hostsCache: createFallbackableCache({\n caches: [createBrowserLocalStorageCache({ key: `${apiClientVersion}-${appId}` }), createMemoryCache()]\n }),\n ...browserOptions\n });\n}\nexport {\n apiClientVersion,\n liteClient\n};\n//# sourceMappingURL=browser.js.map"],"names":["apiClientVersion","liteClient","appId","apiKey","options","Error","compression","_compression","browserOptions","appIdOption","apiKeyOption","authMode","algoliaAgents","auth","createAuth","transporter","createTransporter","hosts","url","accept","protocol","concat","shuffle","algoliaAgent","getAlgoliaAgent","client","version","baseHeaders","headers","baseQueryParameters","queryParameters","clearCache","Promise","all","requestsCache","clear","responsesCache","then","_ua","value","addAlgoliaAgent","segment","add","setClientApiKey","searchForHits","searchMethodParams","requestOptions","this","search","searchForFacets","customPost","path","parameters","body","validateRequired","request","method","replace","data","getRecommendations","getRecommendationsParams","Array","isArray","requests","useReadTransporter","cacheable","newSignatureRequest","map","params","legacyRequest","type","facet","maxFacetHits","facetQuery","createLiteClient","timeouts","connect","read","write","logger","createNullLogger","requester","createXhrRequester","createMemoryCache","serializable","hostsCache","createFallbackableCache","caches","createBrowserLocalStorageCache","key"],"mappings":"kXAWG,IAACA,EAAmB,SAoOvB,SAASC,EAAWC,EAAOC,EAAQC,GACjC,GAA+B,iBAAVF,EACnB,MAAM,IAAIG,MAAM,uBAElB,GAAiC,iBAAXF,EACpB,MAAM,IAAIE,MAAM,wBAElB,MAAQC,YAAaC,KAAiBC,GAA8B,CAAA,EACpE,OA3MF,UACEN,MAAOO,EACPN,OAAQO,EAAYC,SACpBA,EAAQC,cACRA,KACGR,IAEH,MAAMS,EAAOC,EAAWL,EAAaC,EAAcC,GAC7CI,EAAcC,EAAkB,CACpCC,OAzCqBf,EAyCEO,EAxClB,CACL,CACES,IAAK,GAAGhB,oBACRiB,OAAQ,OACRC,SAAU,SAEZ,CACEF,IAAK,GAAGhB,gBACRiB,OAAQ,QACRC,SAAU,UAEZC,OACAC,EAAQ,CACN,CACEJ,IAAK,GAAGhB,qBACRiB,OAAQ,YACRC,SAAU,SAEZ,CACEF,IAAK,GAAGhB,qBACRiB,OAAQ,YACRC,SAAU,SAEZ,CACEF,IAAK,GAAGhB,qBACRiB,OAAQ,YACRC,SAAU,gBAeXhB,EACHmB,aAAcC,EAAgB,CAC5BZ,gBACAa,OAAQ,OACRC,QAAS1B,IAEX2B,YAAa,CACX,eAAgB,gBACbd,EAAKe,aACLxB,EAAQuB,aAEbE,oBAAqB,IAChBhB,EAAKiB,qBACL1B,EAAQyB,uBAvDjB,IAAyB3B,EA0DvB,MAAO,CACLa,cAIAb,MAAOO,EAIPN,OAAQO,EAIRqB,WAAU,IACDC,QAAQC,IAAI,CAAClB,EAAYmB,cAAcC,QAASpB,EAAYqB,eAAeD,UAAUE,KAAK,QAKnG,OAAIC,GACF,OAAOvB,EAAYQ,aAAagB,KAClC,EAOA,eAAAC,CAAgBC,EAASf,GACvBX,EAAYQ,aAAamB,IAAI,CAAED,UAASf,WAC1C,EAOA,eAAAiB,EAAgBxC,OAAEA,IACXQ,GAAyB,kBAAbA,EAGfI,EAAYc,oBAAoB,qBAAuB1B,EAFvDY,EAAYY,YAAY,qBAAuBxB,CAInD,EASA,aAAAyC,CAAcC,EAAoBC,GAChC,OAAOC,KAAKC,OAAOH,EAAoBC,EACzC,EASA,eAAAG,CAAgBJ,EAAoBC,GAClC,OAAOC,KAAKC,OAAOH,EAAoBC,EACzC,EASA,UAAAI,EAAWC,KAAEA,EAAIC,WAAEA,EAAUC,KAAEA,GAAQP,GACrCQ,EAAiB,OAAQ,aAAcH,GACvC,MAGMI,EAAU,CACdC,OAAQ,OACRL,KALkB,UAAUM,QAAQ,SAAUN,GAM9CrB,gBAJsBsB,GAA0B,CAAA,EAKhDxB,QANc,CAAA,EAOd8B,KAAML,GAAc,CAAA,GAEtB,OAAOtC,EAAYwC,QAAQA,EAAST,EACtC,EASA,kBAAAa,CAAmBC,EAA0Bd,GACvCc,GAA4BC,MAAMC,QAAQF,KAI5CA,EAH4B,CAC1BG,SAAUH,IAIdN,EAAiB,2BAA4B,qBAAsBM,GACnEN,EAAiB,oCAAqC,qBAAsBM,EAAyBG,UACrG,MAGMR,EAAU,CACdC,OAAQ,OACRL,KALkB,+BAMlBrB,gBAJsB,CAAA,EAKtBF,QANc,CAAA,EAOd8B,KAAME,EACNI,oBAAoB,EACpBC,WAAW,GAEb,OAAOlD,EAAYwC,QAAQA,EAAST,EACtC,EASA,MAAAE,CAAOH,EAAoBC,GACzB,GAAID,GAAsBgB,MAAMC,QAAQjB,GAAqB,CAC3D,MAAMqB,EAAsB,CAC1BH,SAAUlB,EAAmBsB,IAAI,EAAGC,YAAWC,KAClB,UAAvBA,EAAcC,KACT,IACFD,KACAD,EACHE,KAAM,SAGH,IACFD,KACAD,EACHG,WAAO,EACPC,kBAAc,EACdC,gBAAY,KAIlB5B,EAAqBqB,CACvB,CACAZ,EAAiB,qBAAsB,SAAUT,GACjDS,EAAiB,8BAA+B,SAAUT,EAAmBkB,UAC7E,MAGMR,EAAU,CACdC,OAAQ,OACRL,KALkB,uBAMlBrB,gBAJsB,CAAA,EAKtBF,QANc,CAAA,EAOd8B,KAAMb,EACNmB,oBAAoB,EACpBC,WAAW,GAEb,OAAOlD,EAAYwC,QAAQA,EAAST,EACtC,EAEJ,CAWS4B,CAAiB,CACtBxE,QACAC,SACAwE,SAAU,CACRC,QAAS,IACTC,KAAM,IACNC,MAAO,KAETC,OAAQC,IACRC,UAAWC,IACXtE,cAAe,CAAC,CAAE6B,QAAS,YAC3B9B,SAAU,wBACVyB,eAAgB+C,IAChBjD,cAAeiD,EAAkB,CAAEC,cAAc,IACjDC,WAAYC,EAAwB,CAClCC,OAAQ,CAACC,EAA+B,CAAEC,IAAK,GAAGzF,KAAoBE,MAAYiF,UAEjF3E,GAEP","x_google_ignoreList":[0]}
@@ -1,2 +1,2 @@
1
- var e=Symbol.for("immer-nothing"),t=Symbol.for("immer-draftable"),r=Symbol.for("immer-state"),n="production"!==process.env.NODE_ENV?[function(e){return`The plugin for '${e}' has not been loaded into Immer. To enable the plugin, import and call \`enable${e}()\` when initializing your application.`},function(e){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 '${e}'`},"This object has been frozen and should not be mutated",function(e){return"Cannot use a proxy that has been revoked. Did you pass an object from inside an immer function to an async process? "+e},"An immer producer returned a new value *and* modified its draft. Either return a new value *or* modify the draft.","Immer forbids circular references","The first or second argument to `produce` must be a function","The third argument to `produce` must be a function or undefined","First argument to `createDraft` must be a plain object, an array, or an immerable object","First argument to `finishDraft` must be a draft returned by `createDraft`",function(e){return`'current' expects a draft, got: ${e}`},"Object.defineProperty() cannot be used on an Immer draft","Object.setPrototypeOf() cannot be used on an Immer draft","Immer only supports deleting array indices","Immer only supports setting array indices and the 'length' property",function(e){return`'original' expects a draft, got: ${e}`}]:[];function o(e,...t){if("production"!==process.env.NODE_ENV){const r=n[e],o=O(r)?r.apply(null,t):r;throw new Error(`[Immer] ${o}`)}throw new Error(`[Immer] minified error nr: ${e}. Full error at: https://bit.ly/3cXEKWf`)}var i=Object,a=i.getPrototypeOf,s="constructor",c="prototype",u="configurable",f="enumerable",l="writable",_="value",p=e=>!!e&&!!e[r];function d(e){return!!e&&(m(e)||w(e)||!!e[t]||!!e[s]?.[t]||z(e)||I(e))}var h=i[c][s].toString(),y=new WeakMap;function m(e){if(!e||!M(e))return!1;const t=a(e);if(null===t||t===i[c])return!0;const r=i.hasOwnProperty.call(t,s)&&t[s];if(r===Object)return!0;if(!O(r))return!1;let n=y.get(r);return void 0===n&&(n=Function.toString.call(r),y.set(r,n)),n===h}function g(e,t,r=!0){if(0===b(e)){(r?Reflect.ownKeys(e):i.keys(e)).forEach(r=>{t(r,e[r],e)})}else e.forEach((r,n)=>t(n,r,e))}function b(e){const t=e[r];return t?t.type_:w(e)?1:z(e)?2:I(e)?3:0}var v=(e,t,r=b(e))=>2===r?e.has(t):i[c].hasOwnProperty.call(e,t),S=(e,t,r=b(e))=>2===r?e.get(t):e[t],P=(e,t,r,n=b(e))=>{2===n?e.set(t,r):3===n?e.add(r):e[t]=r};var w=Array.isArray,z=e=>e instanceof Map,I=e=>e instanceof Set,M=e=>"object"==typeof e,O=e=>"function"==typeof e,k=e=>"boolean"==typeof e;var N=e=>e.copy_||e.base_,D=e=>e.modified_?e.copy_:e.base_;function F(e,t){if(z(e))return new Map(e);if(I(e))return new Set(e);if(w(e))return Array[c].slice.call(e);const n=m(e);if(!0===t||"class_only"===t&&!n){const t=i.getOwnPropertyDescriptors(e);delete t[r];let n=Reflect.ownKeys(t);for(let r=0;r<n.length;r++){const o=n[r],i=t[o];!1===i[l]&&(i[l]=!0,i[u]=!0),(i.get||i.set)&&(t[o]={[u]:!0,[l]:!0,[f]:i[f],[_]:e[o]})}return i.create(a(e),t)}{const t=a(e);if(null!==t&&n)return{...e};const r=i.create(t);return i.assign(r,e)}}function E(e,t=!1){return A(e)||p(e)||!d(e)||(b(e)>1&&i.defineProperties(e,{set:j,add:j,clear:j,delete:j}),i.freeze(e),t&&g(e,(e,t)=>{E(t,!0)},!1)),e}var j={[_]:function(){o(2)}};function A(e){return null===e||!M(e)||i.isFrozen(e)}var C="MapSet",x="Patches",R="ArrayMethods",$={};function U(e){const t=$[e];return t||o(0,e),t}var K,L=e=>!!$[e],T=()=>K;function V(e,t){t&&(e.patchPlugin_=U(x),e.patches_=[],e.inversePatches_=[],e.patchListener_=t)}function W(e){G(e),e.drafts_.forEach(q),e.drafts_=null}function G(e){e===K&&(K=e.parent_)}var X=e=>K={drafts_:[],parent_:K,immer_:e,canAutoFreeze_:!0,unfinalizedDrafts_:0,handledSet_:new Set,processedForPatches_:new Set,mapSetPlugin_:L(C)?U(C):void 0,arrayMethodsPlugin_:L(R)?U(R):void 0};function q(e){const t=e[r];0===t.type_||1===t.type_?t.revoke_():t.revoked_=!0}function B(t,n){n.unfinalizedDrafts_=n.drafts_.length;const i=n.drafts_[0];if(void 0!==t&&t!==i){i[r].modified_&&(W(n),o(4)),d(t)&&(t=H(n,t));const{patchPlugin_:e}=n;e&&e.generateReplacementPatches_(i[r].base_,t,n)}else t=H(n,i);return function(e,t,r=!1){!e.parent_&&e.immer_.autoFreeze_&&e.canAutoFreeze_&&E(t,r)}(n,t,!0),W(n),n.patches_&&n.patchListener_(n.patches_,n.inversePatches_),t!==e?t:void 0}function H(e,t){if(A(t))return t;const n=t[r];if(!n){return te(t,e.handledSet_,e)}if(!Q(n,e))return t;if(!n.modified_)return n.base_;if(!n.finalized_){const{callbacks_:t}=n;if(t)for(;t.length>0;){t.pop()(e)}ee(n,e)}return n.copy_}function J(e){e.finalized_=!0,e.scope_.unfinalizedDrafts_--}var Q=(e,t)=>e.scope_===t,Y=[];function Z(e,t,r,n){const o=N(e),i=e.type_;if(void 0!==n){if(S(o,n,i)===t)return void P(o,n,r,i)}if(!e.draftLocations_){const t=e.draftLocations_=new Map;g(o,(e,r)=>{if(p(r)){const n=t.get(r)||[];n.push(e),t.set(r,n)}})}const a=e.draftLocations_.get(t)??Y;for(const e of a)P(o,e,r,i)}function ee(e,t){if(e.modified_&&!e.finalized_&&(3===e.type_||1===e.type_&&e.allIndicesReassigned_||(e.assigned_?.size??0)>0)){const{patchPlugin_:r}=t;if(r){const n=r.getPath(e);n&&r.generatePatches_(e,n,t)}J(e)}}function te(e,t,n){return!n.immer_.autoFreeze_&&n.unfinalizedDrafts_<1||p(e)||t.has(e)||!d(e)||A(e)||(t.add(e),g(e,(o,i)=>{if(p(i)){const t=i[r];if(Q(t,n)){const r=D(t);P(e,o,r,e.type_),J(t)}}else d(i)&&te(i,t,n)})),e}var re={get(e,t){if(t===r)return e;let n=e.scope_.arrayMethodsPlugin_;const o=1===e.type_&&"string"==typeof t;if(o&&n?.isArrayOperationMethod(t))return n.createMethodInterceptor(e,t);const i=N(e);if(!v(i,t,e.type_))return function(e,t,r){const n=ie(t,r);return n?_ in n?n[_]:n.get?.call(e.draft_):void 0}(e,i,t);const a=i[t];if(e.finalized_||!d(a))return a;if(o&&e.operationMethod&&n?.isMutatingArrayMethod(e.operationMethod)&&function(e){const t=+e;return Number.isInteger(t)&&String(t)===e}(t))return a;if(a===oe(e.base_,t)){se(e);const r=1===e.type_?+t:t,n=ue(e.scope_,a,e,r);return e.copy_[r]=n}return a},has:(e,t)=>t in N(e),ownKeys:e=>Reflect.ownKeys(N(e)),set(e,t,n){const o=ie(N(e),t);if(o?.set)return o.set.call(e.draft_,n),!0;if(!e.modified_){const o=oe(N(e),t),s=o?.[r];if(s&&s.base_===n)return e.copy_[t]=n,e.assigned_.set(t,!1),!0;if(((i=n)===(a=o)?0!==i||1/i==1/a:i!=i&&a!=a)&&(void 0!==n||v(e.base_,t,e.type_)))return!0;se(e),ae(e)}var i,a;return e.copy_[t]===n&&(void 0!==n||t in e.copy_)||Number.isNaN(n)&&Number.isNaN(e.copy_[t])||(e.copy_[t]=n,e.assigned_.set(t,!0),function(e,t,n){const{scope_:o}=e;if(p(n)){const i=n[r];Q(i,o)&&i.callbacks_.push(function(){se(e);const r=D(i);Z(e,n,r,t)})}else d(n)&&e.callbacks_.push(function(){const r=N(e);3===e.type_?r.has(n)&&te(n,o.handledSet_,o):S(r,t,e.type_)===n&&o.drafts_.length>1&&!0===(e.assigned_.get(t)??!1)&&e.copy_&&te(S(e.copy_,t,e.type_),o.handledSet_,o)})}(e,t,n)),!0},deleteProperty:(e,t)=>(se(e),void 0!==oe(e.base_,t)||t in e.base_?(e.assigned_.set(t,!1),ae(e)):e.assigned_.delete(t),e.copy_&&delete e.copy_[t],!0),getOwnPropertyDescriptor(e,t){const r=N(e),n=Reflect.getOwnPropertyDescriptor(r,t);return n?{[l]:!0,[u]:1!==e.type_||"length"!==t,[f]:n[f],[_]:r[t]}:n},defineProperty(){o(11)},getPrototypeOf:e=>a(e.base_),setPrototypeOf(){o(12)}},ne={};for(let e in re){let t=re[e];ne[e]=function(){const e=arguments;return e[0]=e[0][0],t.apply(this,e)}}function oe(e,t){const n=e[r];return(n?N(n):e)[t]}function ie(e,t){if(!(t in e))return;let r=a(e);for(;r;){const e=Object.getOwnPropertyDescriptor(r,t);if(e)return e;r=a(r)}}function ae(e){e.modified_||(e.modified_=!0,e.parent_&&ae(e.parent_))}function se(e){e.copy_||(e.assigned_=new Map,e.copy_=F(e.base_,e.scope_.immer_.useStrictShallowCopy_))}ne.deleteProperty=function(e,t){return"production"!==process.env.NODE_ENV&&isNaN(parseInt(t))&&o(13),ne.set.call(this,e,t,void 0)},ne.set=function(e,t,r){return"production"!==process.env.NODE_ENV&&"length"!==t&&isNaN(parseInt(t))&&o(14),re.set.call(this,e[0],t,r,e[0])};var ce=class{constructor(t){this.autoFreeze_=!0,this.useStrictShallowCopy_=!1,this.useStrictIteration_=!1,this.produce=(t,r,n)=>{if(O(t)&&!O(r)){const e=r;r=t;const n=this;return function(t=e,...o){return n.produce(t,e=>r.call(this,e,...o))}}let i;if(O(r)||o(6),void 0===n||O(n)||o(7),d(t)){const e=X(this),o=ue(e,t,void 0);let a=!0;try{i=r(o),a=!1}finally{a?W(e):G(e)}return V(e,n),B(i,e)}if(!t||!M(t)){if(i=r(t),void 0===i&&(i=t),i===e&&(i=void 0),this.autoFreeze_&&E(i,!0),n){const e=[],r=[];U(x).generateReplacementPatches_(t,i,{patches_:e,inversePatches_:r}),n(e,r)}return i}o(1,t)},this.produceWithPatches=(e,t)=>{if(O(e))return(t,...r)=>this.produceWithPatches(t,t=>e(t,...r));let r,n;return[this.produce(e,t,(e,t)=>{r=e,n=t}),r,n]},k(t?.autoFreeze)&&this.setAutoFreeze(t.autoFreeze),k(t?.useStrictShallowCopy)&&this.setUseStrictShallowCopy(t.useStrictShallowCopy),k(t?.useStrictIteration)&&this.setUseStrictIteration(t.useStrictIteration)}createDraft(e){d(e)||o(8),p(e)&&(e=fe(e));const t=X(this),n=ue(t,e,void 0);return n[r].isManual_=!0,G(t),n}finishDraft(e,t){const n=e&&e[r];n&&n.isManual_||o(9);const{scope_:i}=n;return V(i,t),B(void 0,i)}setAutoFreeze(e){this.autoFreeze_=e}setUseStrictShallowCopy(e){this.useStrictShallowCopy_=e}setUseStrictIteration(e){this.useStrictIteration_=e}shouldUseStrictIteration(){return this.useStrictIteration_}applyPatches(e,t){let r;for(r=t.length-1;r>=0;r--){const n=t[r];if(0===n.path.length&&"replace"===n.op){e=n.value;break}}r>-1&&(t=t.slice(r+1));const n=U(x).applyPatches_;return p(e)?n(e,t):this.produce(e,e=>n(e,t))}};function ue(e,t,r,n){const[o,i]=z(t)?U(C).proxyMap_(t,r):I(t)?U(C).proxySet_(t,r):function(e,t){const r=w(e),n={type_:r?1:0,scope_:t?t.scope_:T(),modified_:!1,finalized_:!1,assigned_:void 0,parent_:t,base_:e,draft_:null,copy_:null,revoke_:null,isManual_:!1,callbacks_:void 0};let o=n,i=re;r&&(o=[n],i=ne);const{revoke:a,proxy:s}=Proxy.revocable(o,i);return n.draft_=s,n.revoke_=a,[s,n]}(t,r);return(r?.scope_??T()).drafts_.push(o),i.callbacks_=r?.callbacks_??[],i.key_=n,r&&void 0!==n?function(e,t,r){e.callbacks_.push(function(n){const o=t;if(!o||!Q(o,n))return;n.mapSetPlugin_?.fixSetContents(o);const i=D(o);Z(e,o.draft_??o,i,r),ee(o,n)})}(r,i,n):i.callbacks_.push(function(e){e.mapSetPlugin_?.fixSetContents(i);const{patchPlugin_:t}=e;i.modified_&&t&&t.generatePatches_(i,[],e)}),o}function fe(e){return p(e)||o(10,e),le(e)}function le(e){if(!d(e)||A(e))return e;const t=e[r];let n,o=!0;if(t){if(!t.modified_)return t.base_;t.finalized_=!0,n=F(e,t.scope_.immer_.useStrictShallowCopy_),o=t.scope_.immer_.shouldUseStrictIteration()}else n=F(e,!0);return g(n,(e,t)=>{P(n,e,le(t))},o),t&&(t.finalized_=!1),n}var _e=(new ce).produce;export{ce as Immer,fe as current,E as freeze,t as immerable,p as isDraft,d as isDraftable,e as nothing,_e as produce};
1
+ var e=Symbol.for("immer-nothing"),t=Symbol.for("immer-draftable"),r=Symbol.for("immer-state"),n="production"!==process.env.NODE_ENV?[function(e){return`The plugin for '${e}' has not been loaded into Immer. To enable the plugin, import and call \`enable${e}()\` when initializing your application.`},function(e){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 '${e}'`},"This object has been frozen and should not be mutated",function(e){return"Cannot use a proxy that has been revoked. Did you pass an object from inside an immer function to an async process? "+e},"An immer producer returned a new value *and* modified its draft. Either return a new value *or* modify the draft.","Immer forbids circular references","The first or second argument to `produce` must be a function","The third argument to `produce` must be a function or undefined","First argument to `createDraft` must be a plain object, an array, or an immerable object","First argument to `finishDraft` must be a draft returned by `createDraft`",function(e){return`'current' expects a draft, got: ${e}`},"Object.defineProperty() cannot be used on an Immer draft","Object.setPrototypeOf() cannot be used on an Immer draft","Immer only supports deleting array indices","Immer only supports setting array indices and the 'length' property",function(e){return`'original' expects a draft, got: ${e}`}]:[];function o(e,...t){if("production"!==process.env.NODE_ENV){const r=n[e],o=M(r)?r.apply(null,t):r;throw new Error(`[Immer] ${o}`)}throw new Error(`[Immer] minified error nr: ${e}. Full error at: https://bit.ly/3cXEKWf`)}var i=Object,s=i.getPrototypeOf,a="constructor",c="prototype",u="configurable",f="enumerable",l="writable",_="value",p=e=>!!e&&!!e[r];function d(e){return!!e&&(m(e)||w(e)||!!e[t]||!!e[a]?.[t]||z(e)||I(e))}var h=i[c][a].toString(),y=new WeakMap;function m(e){if(!e||!O(e))return!1;const t=s(e);if(null===t||t===i[c])return!0;const r=i.hasOwnProperty.call(t,a)&&t[a];if(r===Object)return!0;if(!M(r))return!1;let n=y.get(r);return void 0===n&&(n=Function.toString.call(r),y.set(r,n)),n===h}function g(e,t,r=!0){if(0===b(e)){(r?Reflect.ownKeys(e):i.keys(e)).forEach(r=>{t(r,e[r],e)})}else e.forEach((r,n)=>t(n,r,e))}function b(e){const t=e[r];return t?t.type_:w(e)?1:z(e)?2:I(e)?3:0}var v=(e,t,r=b(e))=>2===r?e.has(t):i[c].hasOwnProperty.call(e,t),S=(e,t,r=b(e))=>2===r?e.get(t):e[t],P=(e,t,r,n=b(e))=>{2===n?e.set(t,r):3===n?e.add(r):e[t]=r};var w=Array.isArray,z=e=>e instanceof Map,I=e=>e instanceof Set,O=e=>"object"==typeof e,M=e=>"function"==typeof e,k=e=>"boolean"==typeof e;var N=e=>e.copy_||e.base_,D=e=>e.modified_?e.copy_:e.base_;function F(e,t){if(z(e))return new Map(e);if(I(e))return new Set(e);if(w(e))return Array[c].slice.call(e);const n=m(e);if(!0===t||"class_only"===t&&!n){const t=i.getOwnPropertyDescriptors(e);delete t[r];let n=Reflect.ownKeys(t);for(let r=0;r<n.length;r++){const o=n[r],i=t[o];!1===i[l]&&(i[l]=!0,i[u]=!0),(i.get||i.set)&&(t[o]={[u]:!0,[l]:!0,[f]:i[f],[_]:e[o]})}return i.create(s(e),t)}{const t=s(e);if(null!==t&&n)return{...e};const r=i.create(t);return i.assign(r,e)}}function E(e,t=!1){return x(e)||p(e)||!d(e)||(b(e)>1&&i.defineProperties(e,{set:j,add:j,clear:j,delete:j}),i.freeze(e),t&&g(e,(e,t)=>{E(t,!0)},!1)),e}var j={[_]:function(){o(2)}};function x(e){return null===e||!O(e)||i.isFrozen(e)}var A="MapSet",C="Patches",R="ArrayMethods",$={};function U(e){const t=$[e];return t||o(0,e),t}var K,L=e=>!!$[e],T=()=>K;function V(e,t){t&&(e.patchPlugin_=U(C),e.patches_=[],e.inversePatches_=[],e.patchListener_=t)}function W(e){G(e),e.drafts_.forEach(q),e.drafts_=null}function G(e){e===K&&(K=e.parent_)}var X=e=>K={drafts_:[],parent_:K,immer_:e,canAutoFreeze_:!0,unfinalizedDrafts_:0,handledSet_:new Set,processedForPatches_:new Set,mapSetPlugin_:L(A)?U(A):void 0,arrayMethodsPlugin_:L(R)?U(R):void 0};function q(e){const t=e[r];0===t.type_||1===t.type_?t.revoke_():t.revoked_=!0}function B(t,n){n.unfinalizedDrafts_=n.drafts_.length;const i=n.drafts_[0];if(void 0!==t&&t!==i){i[r].modified_&&(W(n),o(4)),d(t)&&(t=H(n,t));const{patchPlugin_:e}=n;e&&e.generateReplacementPatches_(i[r].base_,t,n)}else t=H(n,i);return function(e,t,r=!1){!e.parent_&&e.immer_.autoFreeze_&&e.canAutoFreeze_&&E(t,r)}(n,t,!0),W(n),n.patches_&&n.patchListener_(n.patches_,n.inversePatches_),t!==e?t:void 0}function H(e,t){if(x(t))return t;const n=t[r];if(!n){return te(t,e.handledSet_,e)}if(!Q(n,e))return t;if(!n.modified_)return n.base_;if(!n.finalized_){const{callbacks_:t}=n;if(t)for(;t.length>0;){t.pop()(e)}ee(n,e)}return n.copy_}function J(e){e.finalized_=!0,e.scope_.unfinalizedDrafts_--}var Q=(e,t)=>e.scope_===t,Y=[];function Z(e,t,r,n){const o=N(e),i=e.type_;if(void 0!==n){if(S(o,n,i)===t)return void P(o,n,r,i)}if(!e.draftLocations_){const t=e.draftLocations_=new Map;g(o,(e,r)=>{if(p(r)){const n=t.get(r)||[];n.push(e),t.set(r,n)}})}const s=e.draftLocations_.get(t)??Y;for(const e of s)P(o,e,r,i)}function ee(e,t){if(e.modified_&&!e.finalized_&&(3===e.type_||1===e.type_&&e.allIndicesReassigned_||(e.assigned_?.size??0)>0)){const{patchPlugin_:r}=t;if(r){const n=r.getPath(e);n&&r.generatePatches_(e,n,t)}J(e)}}function te(e,t,n){return!n.immer_.autoFreeze_&&n.unfinalizedDrafts_<1||p(e)||t.has(e)||!d(e)||x(e)||(t.add(e),g(e,(o,i)=>{if(p(i)){const t=i[r];if(Q(t,n)){const r=D(t);P(e,o,r,e.type_),J(t)}}else d(i)&&te(i,t,n)})),e}var re={get(e,t){if(t===r)return e;if("constructor"===t||"__proto__"===t){const r=N(e)[t];return new Proxy(r||{},{get:(e,t)=>"__proto__"===t||"prototype"===t?Object.freeze(Object.create(null)):Reflect.get(e,t),set:()=>!0,apply:(e,t,r)=>Reflect.apply(e,t,r)})}let n=e.scope_.arrayMethodsPlugin_;const o=1===e.type_&&"string"==typeof t;if(o&&n?.isArrayOperationMethod(t))return n.createMethodInterceptor(e,t);const i=N(e);if(!v(i,t,e.type_))return function(e,t,r){const n=ie(t,r);return n?_ in n?n[_]:n.get?.call(e.draft_):void 0}(e,i,t);const s=i[t];if(e.finalized_||!d(s))return s;if(o&&e.operationMethod&&n?.isMutatingArrayMethod(e.operationMethod)&&function(e){const t=+e;return Number.isInteger(t)&&String(t)===e}(t))return s;if(s===oe(e.base_,t)){ae(e);const r=1===e.type_?+t:t,n=ue(e.scope_,s,e,r);return e.copy_[r]=n}return s},has:(e,t)=>"constructor"!==t&&"__proto__"!==t&&"prototype"!==t&&t in N(e),ownKeys:e=>Reflect.ownKeys(N(e)),set(e,t,n){if("constructor"===t||"__proto__"===t||"prototype"===t)return!0;const o=ie(N(e),t);if(o?.set)return o.set.call(e.draft_,n),!0;if(!e.modified_){const o=oe(N(e),t),a=o?.[r];if(a&&a.base_===n)return e.copy_[t]=n,e.assigned_.set(t,!1),!0;if(((i=n)===(s=o)?0!==i||1/i==1/s:i!=i&&s!=s)&&(void 0!==n||v(e.base_,t,e.type_)))return!0;ae(e),se(e)}var i,s;return e.copy_[t]===n&&(void 0!==n||t in e.copy_)||Number.isNaN(n)&&Number.isNaN(e.copy_[t])||(e.copy_[t]=n,e.assigned_.set(t,!0),function(e,t,n){const{scope_:o}=e;if(p(n)){const i=n[r];Q(i,o)&&i.callbacks_.push(function(){ae(e);const r=D(i);Z(e,n,r,t)})}else d(n)&&e.callbacks_.push(function(){const r=N(e);3===e.type_?r.has(n)&&te(n,o.handledSet_,o):S(r,t,e.type_)===n&&o.drafts_.length>1&&!0===(e.assigned_.get(t)??!1)&&e.copy_&&te(S(e.copy_,t,e.type_),o.handledSet_,o)})}(e,t,n)),!0},deleteProperty:(e,t)=>(ae(e),void 0!==oe(e.base_,t)||t in e.base_?(e.assigned_.set(t,!1),se(e)):e.assigned_.delete(t),e.copy_&&delete e.copy_[t],!0),getOwnPropertyDescriptor(e,t){const r=N(e),n=Reflect.getOwnPropertyDescriptor(r,t);return n?{[l]:!0,[u]:1!==e.type_||"length"!==t,[f]:n[f],[_]:r[t]}:n},defineProperty(){o(11)},getPrototypeOf:e=>s(e.base_),setPrototypeOf(){o(12)}},ne={};for(let e in re){let t=re[e];ne[e]=function(){const e=arguments;return e[0]=e[0][0],t.apply(this,e)}}function oe(e,t){const n=e[r];return(n?N(n):e)[t]}function ie(e,t){if(!(t in e))return;let r=s(e);for(;r;){const e=Object.getOwnPropertyDescriptor(r,t);if(e)return e;r=s(r)}}function se(e){e.modified_||(e.modified_=!0,e.parent_&&se(e.parent_))}function ae(e){e.copy_||(e.assigned_=new Map,e.copy_=F(e.base_,e.scope_.immer_.useStrictShallowCopy_))}ne.deleteProperty=function(e,t){return"production"!==process.env.NODE_ENV&&isNaN(parseInt(t))&&o(13),ne.set.call(this,e,t,void 0)},ne.set=function(e,t,r){return"production"!==process.env.NODE_ENV&&"length"!==t&&isNaN(parseInt(t))&&o(14),re.set.call(this,e[0],t,r,e[0])};var ce=class{constructor(t){this.autoFreeze_=!0,this.useStrictShallowCopy_=!1,this.useStrictIteration_=!1,this.produce=(t,r,n)=>{if(M(t)&&!M(r)){const e=r;r=t;const n=this;return function(t=e,...o){return n.produce(t,e=>r.call(this,e,...o))}}let i;if(M(r)||o(6),void 0===n||M(n)||o(7),d(t)){const e=X(this),o=ue(e,t,void 0);let s=!0;try{i=r(o),s=!1}finally{s?W(e):G(e)}return V(e,n),B(i,e)}if(!t||!O(t)){if(i=r(t),void 0===i&&(i=t),i===e&&(i=void 0),this.autoFreeze_&&E(i,!0),n){const e=[],r=[];U(C).generateReplacementPatches_(t,i,{patches_:e,inversePatches_:r}),n(e,r)}return i}o(1,t)},this.produceWithPatches=(e,t)=>{if(M(e))return(t,...r)=>this.produceWithPatches(t,t=>e(t,...r));let r,n;return[this.produce(e,t,(e,t)=>{r=e,n=t}),r,n]},k(t?.autoFreeze)&&this.setAutoFreeze(t.autoFreeze),k(t?.useStrictShallowCopy)&&this.setUseStrictShallowCopy(t.useStrictShallowCopy),k(t?.useStrictIteration)&&this.setUseStrictIteration(t.useStrictIteration)}createDraft(e){d(e)||o(8),p(e)&&(e=fe(e));const t=X(this),n=ue(t,e,void 0);return n[r].isManual_=!0,G(t),n}finishDraft(e,t){const n=e&&e[r];n&&n.isManual_||o(9);const{scope_:i}=n;return V(i,t),B(void 0,i)}setAutoFreeze(e){this.autoFreeze_=e}setUseStrictShallowCopy(e){this.useStrictShallowCopy_=e}setUseStrictIteration(e){this.useStrictIteration_=e}shouldUseStrictIteration(){return this.useStrictIteration_}applyPatches(e,t){let r;for(r=t.length-1;r>=0;r--){const n=t[r];if(0===n.path.length&&"replace"===n.op){e=n.value;break}}r>-1&&(t=t.slice(r+1));const n=U(C).applyPatches_;return p(e)?n(e,t):this.produce(e,e=>n(e,t))}};function ue(e,t,r,n){const[o,i]=z(t)?U(A).proxyMap_(t,r):I(t)?U(A).proxySet_(t,r):function(e,t){const r=w(e),n={type_:r?1:0,scope_:t?t.scope_:T(),modified_:!1,finalized_:!1,assigned_:void 0,parent_:t,base_:e,draft_:null,copy_:null,revoke_:null,isManual_:!1,callbacks_:void 0};let o=n,i=re;r&&(o=[n],i=ne);const{revoke:s,proxy:a}=Proxy.revocable(o,i);return n.draft_=a,n.revoke_=s,[a,n]}(t,r);return(r?.scope_??T()).drafts_.push(o),i.callbacks_=r?.callbacks_??[],i.key_=n,r&&void 0!==n?function(e,t,r){e.callbacks_.push(function(n){const o=t;if(!o||!Q(o,n))return;n.mapSetPlugin_?.fixSetContents(o);const i=D(o);Z(e,o.draft_??o,i,r),ee(o,n)})}(r,i,n):i.callbacks_.push(function(e){e.mapSetPlugin_?.fixSetContents(i);const{patchPlugin_:t}=e;i.modified_&&t&&t.generatePatches_(i,[],e)}),o}function fe(e){return p(e)||o(10,e),le(e)}function le(e){if(!d(e)||x(e))return e;const t=e[r];let n,o=!0;if(t){if(!t.modified_)return t.base_;t.finalized_=!0,n=F(e,t.scope_.immer_.useStrictShallowCopy_),o=t.scope_.immer_.shouldUseStrictIteration()}else n=F(e,!0);return g(n,(e,t)=>{P(n,e,le(t))},o),t&&(t.finalized_=!1),n}var _e=(new ce).produce;export{ce as Immer,fe as current,E as freeze,t as immerable,p as isDraft,d as isDraftable,e as nothing,_e as produce};
2
2
  //# sourceMappingURL=immer.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"immer.js","sources":["../../../../../node_modules/immer/dist/immer.mjs"],"sourcesContent":["// 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 = isFunction(e) ? 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 O = Object;\nvar getPrototypeOf = O.getPrototypeOf;\nvar CONSTRUCTOR = \"constructor\";\nvar PROTOTYPE = \"prototype\";\nvar CONFIGURABLE = \"configurable\";\nvar ENUMERABLE = \"enumerable\";\nvar WRITABLE = \"writable\";\nvar VALUE = \"value\";\nvar isDraft = (value) => !!value && !!value[DRAFT_STATE];\nfunction isDraftable(value) {\n if (!value)\n return false;\n return isPlainObject(value) || isArray(value) || !!value[DRAFTABLE] || !!value[CONSTRUCTOR]?.[DRAFTABLE] || isMap(value) || isSet(value);\n}\nvar objectCtorString = O[PROTOTYPE][CONSTRUCTOR].toString();\nvar cachedCtorStrings = /* @__PURE__ */ new WeakMap();\nfunction isPlainObject(value) {\n if (!value || !isObjectish(value))\n return false;\n const proto = getPrototypeOf(value);\n if (proto === null || proto === O[PROTOTYPE])\n return true;\n const Ctor = O.hasOwnProperty.call(proto, CONSTRUCTOR) && proto[CONSTRUCTOR];\n if (Ctor === Object)\n return true;\n if (!isFunction(Ctor))\n return false;\n let ctorString = cachedCtorStrings.get(Ctor);\n if (ctorString === void 0) {\n ctorString = Function.toString.call(Ctor);\n cachedCtorStrings.set(Ctor, ctorString);\n }\n return ctorString === objectCtorString;\n}\nfunction original(value) {\n if (!isDraft(value))\n die(15, value);\n return value[DRAFT_STATE].base_;\n}\nfunction each(obj, iter, strict = true) {\n if (getArchtype(obj) === 0 /* Object */) {\n const keys = strict ? Reflect.ownKeys(obj) : O.keys(obj);\n keys.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_ : isArray(thing) ? 1 /* Array */ : isMap(thing) ? 2 /* Map */ : isSet(thing) ? 3 /* Set */ : 0 /* Object */;\n}\nvar has = (thing, prop, type = getArchtype(thing)) => type === 2 /* Map */ ? thing.has(prop) : O[PROTOTYPE].hasOwnProperty.call(thing, prop);\nvar get = (thing, prop, type = getArchtype(thing)) => (\n // @ts-ignore\n type === 2 /* Map */ ? thing.get(prop) : thing[prop]\n);\nvar set = (thing, propOrOldValue, value, type = getArchtype(thing)) => {\n if (type === 2 /* Map */)\n thing.set(propOrOldValue, value);\n else if (type === 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}\nvar isArray = Array.isArray;\nvar isMap = (target) => target instanceof Map;\nvar isSet = (target) => target instanceof Set;\nvar isObjectish = (target) => typeof target === \"object\";\nvar isFunction = (target) => typeof target === \"function\";\nvar isBoolean = (target) => typeof target === \"boolean\";\nfunction isArrayIndex(value) {\n const n = +value;\n return Number.isInteger(n) && String(n) === value;\n}\nvar getProxyDraft = (value) => {\n if (!isObjectish(value))\n return null;\n return value?.[DRAFT_STATE];\n};\nvar latest = (state) => state.copy_ || state.base_;\nvar getValue = (value) => {\n const proxyDraft = getProxyDraft(value);\n return proxyDraft ? proxyDraft.copy_ ?? proxyDraft.base_ : value;\n};\nvar getFinalValue = (state) => state.modified_ ? state.copy_ : state.base_;\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 (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 = O.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 O.create(getPrototypeOf(base), descriptors);\n } else {\n const proto = getPrototypeOf(base);\n if (proto !== null && isPlain) {\n return { ...base };\n }\n const obj = O.create(proto);\n return O.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 O.defineProperties(obj, {\n set: dontMutateMethodOverride,\n add: dontMutateMethodOverride,\n clear: dontMutateMethodOverride,\n delete: dontMutateMethodOverride\n });\n }\n O.freeze(obj);\n if (deep)\n each(\n obj,\n (_key, value) => {\n freeze(value, true);\n },\n false\n );\n return obj;\n}\nfunction dontMutateFrozenCollections() {\n die(2);\n}\nvar dontMutateMethodOverride = {\n [VALUE]: dontMutateFrozenCollections\n};\nfunction isFrozen(obj) {\n if (obj === null || !isObjectish(obj))\n return true;\n return O.isFrozen(obj);\n}\n\n// src/utils/plugins.ts\nvar PluginMapSet = \"MapSet\";\nvar PluginPatches = \"Patches\";\nvar PluginArrayMethods = \"ArrayMethods\";\nvar plugins = {};\nfunction getPlugin(pluginKey) {\n const plugin = plugins[pluginKey];\n if (!plugin) {\n die(0, pluginKey);\n }\n return plugin;\n}\nvar isPluginLoaded = (pluginKey) => !!plugins[pluginKey];\nfunction loadPlugin(pluginKey, implementation) {\n if (!plugins[pluginKey])\n plugins[pluginKey] = implementation;\n}\n\n// src/core/scope.ts\nvar currentScope;\nvar getCurrentScope = () => currentScope;\nvar createScope = (parent_, immer_) => ({\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 handledSet_: /* @__PURE__ */ new Set(),\n processedForPatches_: /* @__PURE__ */ new Set(),\n mapSetPlugin_: isPluginLoaded(PluginMapSet) ? getPlugin(PluginMapSet) : void 0,\n arrayMethodsPlugin_: isPluginLoaded(PluginArrayMethods) ? getPlugin(PluginArrayMethods) : void 0\n});\nfunction usePatchesInScope(scope, patchListener) {\n if (patchListener) {\n scope.patchPlugin_ = getPlugin(PluginPatches);\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}\nvar enterScope = (immer2) => currentScope = createScope(currentScope, immer2);\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 }\n const { patchPlugin_ } = scope;\n if (patchPlugin_) {\n patchPlugin_.generateReplacementPatches_(\n baseDraft[DRAFT_STATE].base_,\n result,\n scope\n );\n }\n } else {\n result = finalize(scope, baseDraft);\n }\n maybeFreeze(scope, result, true);\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) {\n if (isFrozen(value))\n return value;\n const state = value[DRAFT_STATE];\n if (!state) {\n const finalValue = handleValue(value, rootScope.handledSet_, rootScope);\n return finalValue;\n }\n if (!isSameScope(state, rootScope)) {\n return value;\n }\n if (!state.modified_) {\n return state.base_;\n }\n if (!state.finalized_) {\n const { callbacks_ } = state;\n if (callbacks_) {\n while (callbacks_.length > 0) {\n const callback = callbacks_.pop();\n callback(rootScope);\n }\n }\n generatePatchesAndFinalize(state, rootScope);\n }\n return state.copy_;\n}\nfunction maybeFreeze(scope, value, deep = false) {\n if (!scope.parent_ && scope.immer_.autoFreeze_ && scope.canAutoFreeze_) {\n freeze(value, deep);\n }\n}\nfunction markStateFinalized(state) {\n state.finalized_ = true;\n state.scope_.unfinalizedDrafts_--;\n}\nvar isSameScope = (state, rootScope) => state.scope_ === rootScope;\nvar EMPTY_LOCATIONS_RESULT = [];\nfunction updateDraftInParent(parent, draftValue, finalizedValue, originalKey) {\n const parentCopy = latest(parent);\n const parentType = parent.type_;\n if (originalKey !== void 0) {\n const currentValue = get(parentCopy, originalKey, parentType);\n if (currentValue === draftValue) {\n set(parentCopy, originalKey, finalizedValue, parentType);\n return;\n }\n }\n if (!parent.draftLocations_) {\n const draftLocations = parent.draftLocations_ = /* @__PURE__ */ new Map();\n each(parentCopy, (key, value) => {\n if (isDraft(value)) {\n const keys = draftLocations.get(value) || [];\n keys.push(key);\n draftLocations.set(value, keys);\n }\n });\n }\n const locations = parent.draftLocations_.get(draftValue) ?? EMPTY_LOCATIONS_RESULT;\n for (const location of locations) {\n set(parentCopy, location, finalizedValue, parentType);\n }\n}\nfunction registerChildFinalizationCallback(parent, child, key) {\n parent.callbacks_.push(function childCleanup(rootScope) {\n const state = child;\n if (!state || !isSameScope(state, rootScope)) {\n return;\n }\n rootScope.mapSetPlugin_?.fixSetContents(state);\n const finalizedValue = getFinalValue(state);\n updateDraftInParent(parent, state.draft_ ?? state, finalizedValue, key);\n generatePatchesAndFinalize(state, rootScope);\n });\n}\nfunction generatePatchesAndFinalize(state, rootScope) {\n const shouldFinalize = state.modified_ && !state.finalized_ && (state.type_ === 3 /* Set */ || state.type_ === 1 /* Array */ && state.allIndicesReassigned_ || (state.assigned_?.size ?? 0) > 0);\n if (shouldFinalize) {\n const { patchPlugin_ } = rootScope;\n if (patchPlugin_) {\n const basePath = patchPlugin_.getPath(state);\n if (basePath) {\n patchPlugin_.generatePatches_(state, basePath, rootScope);\n }\n }\n markStateFinalized(state);\n }\n}\nfunction handleCrossReference(target, key, value) {\n const { scope_ } = target;\n if (isDraft(value)) {\n const state = value[DRAFT_STATE];\n if (isSameScope(state, scope_)) {\n state.callbacks_.push(function crossReferenceCleanup() {\n prepareCopy(target);\n const finalizedValue = getFinalValue(state);\n updateDraftInParent(target, value, finalizedValue, key);\n });\n }\n } else if (isDraftable(value)) {\n target.callbacks_.push(function nestedDraftCleanup() {\n const targetCopy = latest(target);\n if (target.type_ === 3 /* Set */) {\n if (targetCopy.has(value)) {\n handleValue(value, scope_.handledSet_, scope_);\n }\n } else {\n if (get(targetCopy, key, target.type_) === value) {\n if (scope_.drafts_.length > 1 && (target.assigned_.get(key) ?? false) === true && target.copy_) {\n handleValue(\n get(target.copy_, key, target.type_),\n scope_.handledSet_,\n scope_\n );\n }\n }\n }\n });\n }\n}\nfunction handleValue(target, handledSet, rootScope) {\n if (!rootScope.immer_.autoFreeze_ && rootScope.unfinalizedDrafts_ < 1) {\n return target;\n }\n if (isDraft(target) || handledSet.has(target) || !isDraftable(target) || isFrozen(target)) {\n return target;\n }\n handledSet.add(target);\n each(target, (key, value) => {\n if (isDraft(value)) {\n const state = value[DRAFT_STATE];\n if (isSameScope(state, rootScope)) {\n const updatedValue = getFinalValue(state);\n set(target, key, updatedValue, target.type_);\n markStateFinalized(state);\n }\n } else if (isDraftable(value)) {\n handleValue(value, handledSet, rootScope);\n }\n });\n return target;\n}\n\n// src/core/proxy.ts\nfunction createProxyProxy(base, parent) {\n const baseIsArray = isArray(base);\n const state = {\n type_: baseIsArray ? 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 // actually instantiated in `prepareCopy()`\n assigned_: void 0,\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 // `callbacks` actually gets assigned in `createProxy`\n callbacks_: void 0\n };\n let target = state;\n let traps = objectTraps;\n if (baseIsArray) {\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, state];\n}\nvar objectTraps = {\n get(state, prop) {\n if (prop === DRAFT_STATE)\n return state;\n let arrayPlugin = state.scope_.arrayMethodsPlugin_;\n const isArrayWithStringProp = state.type_ === 1 /* Array */ && typeof prop === \"string\";\n if (isArrayWithStringProp) {\n if (arrayPlugin?.isArrayOperationMethod(prop)) {\n return arrayPlugin.createMethodInterceptor(state, prop);\n }\n }\n const source = latest(state);\n if (!has(source, prop, state.type_)) {\n return readPropFromProto(state, source, prop);\n }\n const value = source[prop];\n if (state.finalized_ || !isDraftable(value)) {\n return value;\n }\n if (isArrayWithStringProp && state.operationMethod && arrayPlugin?.isMutatingArrayMethod(\n state.operationMethod\n ) && isArrayIndex(prop)) {\n return value;\n }\n if (value === peek(state.base_, prop)) {\n prepareCopy(state);\n const childKey = state.type_ === 1 /* Array */ ? +prop : prop;\n const childDraft = createProxy(state.scope_, value, state, childKey);\n return state.copy_[childKey] = childDraft;\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_.set(prop, false);\n return true;\n }\n if (is(value, current2) && (value !== void 0 || has(state.base_, prop, state.type_)))\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_.set(prop, true);\n handleCrossReference(state, prop, value);\n return true;\n },\n deleteProperty(state, prop) {\n prepareCopy(state);\n if (peek(state.base_, prop) !== void 0 || prop in state.base_) {\n state.assigned_.set(prop, false);\n markChanged(state);\n } else {\n state.assigned_.delete(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 = {};\nfor (let key in objectTraps) {\n let fn = objectTraps[key];\n arrayTraps[key] = function() {\n const args = arguments;\n args[0] = args[0][0];\n return fn.apply(this, args);\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.assigned_ = /* @__PURE__ */ new Map();\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 this.useStrictIteration_ = 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 (isFunction(base) && !isFunction(recipe)) {\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 (!isFunction(recipe))\n die(6);\n if (patchListener !== void 0 && !isFunction(patchListener))\n die(7);\n let result;\n if (isDraftable(base)) {\n const scope = enterScope(this);\n const proxy = createProxy(scope, 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 || !isObjectish(base)) {\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(PluginPatches).generateReplacementPatches_(base, result, {\n patches_: p,\n inversePatches_: ip\n });\n patchListener(p, ip);\n }\n return result;\n } else\n die(1, base);\n };\n this.produceWithPatches = (base, recipe) => {\n if (isFunction(base)) {\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 (isBoolean(config?.autoFreeze))\n this.setAutoFreeze(config.autoFreeze);\n if (isBoolean(config?.useStrictShallowCopy))\n this.setUseStrictShallowCopy(config.useStrictShallowCopy);\n if (isBoolean(config?.useStrictIteration))\n this.setUseStrictIteration(config.useStrictIteration);\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(scope, 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 /**\n * Pass false to use faster iteration that skips non-enumerable properties\n * but still handles symbols for compatibility.\n *\n * By default, strict iteration is enabled (includes all own properties).\n */\n setUseStrictIteration(value) {\n this.useStrictIteration_ = value;\n }\n shouldUseStrictIteration() {\n return this.useStrictIteration_;\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(PluginPatches).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(rootScope, value, parent, key) {\n const [draft, state] = isMap(value) ? getPlugin(PluginMapSet).proxyMap_(value, parent) : isSet(value) ? getPlugin(PluginMapSet).proxySet_(value, parent) : createProxyProxy(value, parent);\n const scope = parent?.scope_ ?? getCurrentScope();\n scope.drafts_.push(draft);\n state.callbacks_ = parent?.callbacks_ ?? [];\n state.key_ = key;\n if (parent && key !== void 0) {\n registerChildFinalizationCallback(parent, state, key);\n } else {\n state.callbacks_.push(function rootDraftCleanup(rootScope2) {\n rootScope2.mapSetPlugin_?.fixSetContents(state);\n const { patchPlugin_ } = rootScope2;\n if (state.modified_ && patchPlugin_) {\n patchPlugin_.generatePatches_(state, [], rootScope2);\n }\n });\n }\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 let strict = true;\n if (state) {\n if (!state.modified_)\n return state.base_;\n state.finalized_ = true;\n copy = shallowCopy(value, state.scope_.immer_.useStrictShallowCopy_);\n strict = state.scope_.immer_.shouldUseStrictIteration();\n } else {\n copy = shallowCopy(value, true);\n }\n each(\n copy,\n (key, childValue) => {\n set(copy, key, currentImpl(childValue));\n },\n strict\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 function getPath(state, path = []) {\n if (state.key_ !== void 0) {\n const parentCopy = state.parent_.copy_ ?? state.parent_.base_;\n const proxyDraft = getProxyDraft(get(parentCopy, state.key_));\n const valueAtKey = get(parentCopy, state.key_);\n if (valueAtKey === void 0) {\n return null;\n }\n if (valueAtKey !== state.draft_ && valueAtKey !== state.base_ && valueAtKey !== state.copy_) {\n return null;\n }\n if (proxyDraft != null && proxyDraft.base_ !== state.base_) {\n return null;\n }\n const isSet2 = state.parent_.type_ === 3 /* Set */;\n let key;\n if (isSet2) {\n const setParent = state.parent_;\n key = Array.from(setParent.drafts_.keys()).indexOf(state.key_);\n } else {\n key = state.key_;\n }\n if (!(isSet2 && parentCopy.size > key || has(parentCopy, key))) {\n return null;\n }\n path.push(key);\n }\n if (state.parent_) {\n return getPath(state.parent_, path);\n }\n path.reverse();\n try {\n resolvePath(state.copy_, path);\n } catch (e) {\n return null;\n }\n return path;\n }\n function resolvePath(base, path) {\n let current2 = base;\n for (let i = 0; i < path.length - 1; i++) {\n const key = path[i];\n current2 = get(current2, key);\n if (!isObjectish(current2) || current2 === null) {\n throw new Error(`Cannot resolve path at '${path.join(\"/\")}'`);\n }\n }\n return current2;\n }\n const REPLACE = \"replace\";\n const ADD = \"add\";\n const REMOVE = \"remove\";\n function generatePatches_(state, basePath, scope) {\n if (state.scope_.processedForPatches_.has(state)) {\n return;\n }\n state.scope_.processedForPatches_.add(state);\n const { patches_, inversePatches_ } = scope;\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(\n state,\n basePath,\n patches_,\n inversePatches_\n );\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 const allReassigned = state.allIndicesReassigned_ === true;\n for (let i = 0; i < base_.length; i++) {\n const copiedItem = copy_[i];\n const baseItem = base_[i];\n const isAssigned = allReassigned || assigned_?.get(i.toString());\n if (isAssigned && copiedItem !== baseItem) {\n const childState = copiedItem?.[DRAFT_STATE];\n if (childState && childState.modified_) {\n continue;\n }\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(copiedItem)\n });\n inversePatches.push({\n op: REPLACE,\n path,\n value: clonePatchValueIfNeeded(baseItem)\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_, type_ } = state;\n each(state.assigned_, (key, assignedValue) => {\n const origValue = get(base_, key, type_);\n const value = get(copy_, key, type_);\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(\n op === REMOVE ? { op, path } : { op, path, value: clonePatchValueIfNeeded(value) }\n );\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, scope) {\n const { patches_, inversePatches_ } = scope;\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 (isFunction(base) && p === PROTOTYPE)\n die(errorOffset + 3);\n base = get(base, p);\n if (!isObjectish(base))\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 (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(PluginPatches, {\n applyPatches_,\n generatePatches_,\n generateReplacementPatches_,\n getPath\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 callbacks_: []\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 handleCrossReference(state, key, value);\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(state.scope_, value, state, key);\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 const map = new DraftMap(target, parent);\n return [map, map[DRAFT_STATE]];\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 assigned_: void 0,\n callbacks_: []\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 handleCrossReference(state, value, 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 const set2 = new DraftSet(target, parent);\n return [set2, set2[DRAFT_STATE]];\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(state.scope_, value, state, value);\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 function fixSetContents(target) {\n if (target.type_ === 3 /* Set */ && target.copy_) {\n const copy = new Set(target.copy_);\n target.copy_.clear();\n copy.forEach((value) => {\n target.copy_.add(getValue(value));\n });\n }\n }\n loadPlugin(PluginMapSet, { proxyMap_, proxySet_, fixSetContents });\n}\n\n// src/plugins/arrayMethods.ts\nfunction enableArrayMethods() {\n const SHIFTING_METHODS = /* @__PURE__ */ new Set([\"shift\", \"unshift\"]);\n const QUEUE_METHODS = /* @__PURE__ */ new Set([\"push\", \"pop\"]);\n const RESULT_RETURNING_METHODS = /* @__PURE__ */ new Set([\n ...QUEUE_METHODS,\n ...SHIFTING_METHODS\n ]);\n const REORDERING_METHODS = /* @__PURE__ */ new Set([\"reverse\", \"sort\"]);\n const MUTATING_METHODS = /* @__PURE__ */ new Set([\n ...RESULT_RETURNING_METHODS,\n ...REORDERING_METHODS,\n \"splice\"\n ]);\n const FIND_METHODS = /* @__PURE__ */ new Set([\"find\", \"findLast\"]);\n const NON_MUTATING_METHODS = /* @__PURE__ */ new Set([\n \"filter\",\n \"slice\",\n \"concat\",\n \"flat\",\n ...FIND_METHODS,\n \"findIndex\",\n \"findLastIndex\",\n \"some\",\n \"every\",\n \"indexOf\",\n \"lastIndexOf\",\n \"includes\",\n \"join\",\n \"toString\",\n \"toLocaleString\"\n ]);\n function isMutatingArrayMethod(method) {\n return MUTATING_METHODS.has(method);\n }\n function isNonMutatingArrayMethod(method) {\n return NON_MUTATING_METHODS.has(method);\n }\n function isArrayOperationMethod(method) {\n return isMutatingArrayMethod(method) || isNonMutatingArrayMethod(method);\n }\n function enterOperation(state, method) {\n state.operationMethod = method;\n }\n function exitOperation(state) {\n state.operationMethod = void 0;\n }\n function executeArrayMethod(state, operation, markLength = true) {\n prepareCopy(state);\n const result = operation();\n markChanged(state);\n if (markLength)\n state.assigned_.set(\"length\", true);\n return result;\n }\n function markAllIndicesReassigned(state) {\n state.allIndicesReassigned_ = true;\n }\n function normalizeSliceIndex(index, length) {\n if (index < 0) {\n return Math.max(length + index, 0);\n }\n return Math.min(index, length);\n }\n function handleInsertedValues(state, startIndex, values) {\n for (let i = 0; i < values.length; i++) {\n const index = startIndex + i;\n state.assigned_.set(index, true);\n handleCrossReference(state, index, values[i]);\n }\n }\n function handleSimpleOperation(state, method, args) {\n return executeArrayMethod(state, () => {\n const lengthBefore = state.copy_.length;\n const result = state.copy_[method](...args);\n if (SHIFTING_METHODS.has(method)) {\n markAllIndicesReassigned(state);\n }\n if (method === \"push\" && args.length > 0) {\n handleInsertedValues(state, lengthBefore, args);\n } else if (method === \"unshift\" && args.length > 0) {\n handleInsertedValues(state, 0, args);\n }\n return RESULT_RETURNING_METHODS.has(method) ? result : state.draft_;\n });\n }\n function handleReorderingOperation(state, method, args) {\n return executeArrayMethod(\n state,\n () => {\n ;\n state.copy_[method](...args);\n markAllIndicesReassigned(state);\n return state.draft_;\n },\n false\n );\n }\n function createMethodInterceptor(state, originalMethod) {\n return function interceptedMethod(...args) {\n const method = originalMethod;\n enterOperation(state, method);\n try {\n if (isMutatingArrayMethod(method)) {\n if (RESULT_RETURNING_METHODS.has(method)) {\n return handleSimpleOperation(state, method, args);\n }\n if (REORDERING_METHODS.has(method)) {\n return handleReorderingOperation(state, method, args);\n }\n if (method === \"splice\") {\n const res = executeArrayMethod(\n state,\n () => state.copy_.splice(...args)\n );\n markAllIndicesReassigned(state);\n if (args.length > 2) {\n const startIndex = normalizeSliceIndex(\n args[0] ?? 0,\n state.copy_.length\n );\n handleInsertedValues(state, startIndex, args.slice(2));\n }\n return res;\n }\n } else {\n return handleNonMutatingOperation(state, method, args);\n }\n } finally {\n exitOperation(state);\n }\n };\n }\n function handleNonMutatingOperation(state, method, args) {\n const source = latest(state);\n if (method === \"filter\") {\n const predicate = args[0];\n const result = [];\n for (let i = 0; i < source.length; i++) {\n if (predicate(source[i], i, source)) {\n result.push(state.draft_[i]);\n }\n }\n return result;\n }\n if (FIND_METHODS.has(method)) {\n const predicate = args[0];\n const isForward = method === \"find\";\n const step = isForward ? 1 : -1;\n const start = isForward ? 0 : source.length - 1;\n for (let i = start; i >= 0 && i < source.length; i += step) {\n if (predicate(source[i], i, source)) {\n return state.draft_[i];\n }\n }\n return void 0;\n }\n if (method === \"slice\") {\n const rawStart = args[0] ?? 0;\n const rawEnd = args[1] ?? source.length;\n const start = normalizeSliceIndex(rawStart, source.length);\n const end = normalizeSliceIndex(rawEnd, source.length);\n const result = [];\n for (let i = start; i < end; i++) {\n result.push(state.draft_[i]);\n }\n return result;\n }\n return source[method](...args);\n }\n loadPlugin(PluginArrayMethods, {\n createMethodInterceptor,\n isArrayOperationMethod,\n isMutatingArrayMethod\n });\n}\n\n// src/immer.ts\nvar immer = new Immer2();\nvar produce = immer.produce;\nvar produceWithPatches = /* @__PURE__ */ immer.produceWithPatches.bind(immer);\nvar setAutoFreeze = /* @__PURE__ */ immer.setAutoFreeze.bind(immer);\nvar setUseStrictShallowCopy = /* @__PURE__ */ immer.setUseStrictShallowCopy.bind(immer);\nvar setUseStrictIteration = /* @__PURE__ */ immer.setUseStrictIteration.bind(immer);\nvar applyPatches = /* @__PURE__ */ immer.applyPatches.bind(immer);\nvar createDraft = /* @__PURE__ */ immer.createDraft.bind(immer);\nvar finishDraft = /* @__PURE__ */ immer.finishDraft.bind(immer);\nvar castDraft = (value) => value;\nvar castImmutable = (value) => value;\nexport {\n Immer2 as Immer,\n applyPatches,\n castDraft,\n castImmutable,\n createDraft,\n current,\n enableArrayMethods,\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 setUseStrictIteration,\n setUseStrictShallowCopy\n};\n//# sourceMappingURL=immer.mjs.map"],"names":["NOTHING","Symbol","for","DRAFTABLE","DRAFT_STATE","errors","process","env","NODE_ENV","plugin","thing","data","die","error","args","e","msg","isFunction","apply","Error","O","Object","getPrototypeOf","CONSTRUCTOR","PROTOTYPE","CONFIGURABLE","ENUMERABLE","WRITABLE","VALUE","isDraft","value","isDraftable","isPlainObject","isArray","isMap","isSet","objectCtorString","toString","cachedCtorStrings","WeakMap","isObjectish","proto","Ctor","hasOwnProperty","call","ctorString","get","Function","set","each","obj","iter","strict","getArchtype","Reflect","ownKeys","keys","forEach","key","entry","index","state","type_","has","prop","type","propOrOldValue","add","Array","target","Map","Set","isBoolean","latest","copy_","base_","getFinalValue","modified_","shallowCopy","base","slice","isPlain","descriptors","getOwnPropertyDescriptors","i","length","desc","create","assign","freeze","deep","isFrozen","defineProperties","dontMutateMethodOverride","clear","delete","_key","PluginMapSet","PluginPatches","PluginArrayMethods","plugins","getPlugin","pluginKey","currentScope","isPluginLoaded","getCurrentScope","usePatchesInScope","scope","patchListener","patchPlugin_","patches_","inversePatches_","patchListener_","revokeScope","leaveScope","drafts_","revokeDraft","parent_","enterScope","immer2","immer_","canAutoFreeze_","unfinalizedDrafts_","handledSet_","processedForPatches_","mapSetPlugin_","arrayMethodsPlugin_","draft","revoke_","revoked_","processResult","result","baseDraft","finalize","generateReplacementPatches_","autoFreeze_","maybeFreeze","rootScope","handleValue","isSameScope","finalized_","callbacks_","pop","callback","generatePatchesAndFinalize","markStateFinalized","scope_","EMPTY_LOCATIONS_RESULT","updateDraftInParent","parent","draftValue","finalizedValue","originalKey","parentCopy","parentType","draftLocations_","draftLocations","push","locations","location","allIndicesReassigned_","assigned_","size","basePath","getPath","generatePatches_","handledSet","updatedValue","objectTraps","arrayPlugin","isArrayWithStringProp","isArrayOperationMethod","createMethodInterceptor","source","getDescriptorFromProto","draft_","readPropFromProto","operationMethod","isMutatingArrayMethod","n","Number","isInteger","String","isArrayIndex","peek","prepareCopy","childKey","childDraft","createProxy","current2","currentState","x","y","markChanged","isNaN","targetCopy","handleCrossReference","deleteProperty","getOwnPropertyDescriptor","owner","defineProperty","setPrototypeOf","arrayTraps","fn","arguments","this","useStrictShallowCopy_","parseInt","Immer2","constructor","config","useStrictIteration_","produce","recipe","defaultBase","self","base2","proxy","hasError","p","ip","produceWithPatches","patches","inversePatches","autoFreeze","setAutoFreeze","useStrictShallowCopy","setUseStrictShallowCopy","useStrictIteration","setUseStrictIteration","createDraft","current","isManual_","finishDraft","shouldUseStrictIteration","applyPatches","patch","path","op","applyPatchesImpl","applyPatches_","proxyMap_","proxySet_","baseIsArray","traps","revoke","Proxy","revocable","createProxyProxy","key_","child","fixSetContents","registerChildFinalizationCallback","rootScope2","currentImpl","copy","childValue"],"mappings":"AACG,IAACA,EAAUC,OAAOC,IAAI,iBACrBC,EAAYF,OAAOC,IAAI,mBACvBE,EAAcH,OAAOC,IAAI,eAGzBG,EAAkC,eAAzBC,QAAQC,IAAIC,SAA4B,CAEnD,SAASC,GACP,MAAO,mBAAmBA,oFAAyFA,2CACrH,EACA,SAASC,GACP,MAAO,sJAAsJA,IAC/J,EACA,wDACA,SAASC,GACP,MAAO,uHAAyHA,CAClI,EACA,oHACA,oCACA,+DACA,kEACA,2FACA,4EACA,SAASD,GACP,MAAO,mCAAmCA,GAC5C,EACA,2DACA,2DACA,6CACA,sEACA,SAASA,GACP,MAAO,oCAAoCA,GAC7C,GAGE,GACJ,SAASE,EAAIC,KAAUC,GACrB,GAA6B,eAAzBR,QAAQC,IAAIC,SAA2B,CACzC,MAAMO,EAAIV,EAAOQ,GACXG,EAAMC,EAAWF,GAAKA,EAAEG,MAAM,KAAMJ,GAAQC,EAClD,MAAM,IAAII,MAAM,WAAWH,IAC7B,CACA,MAAM,IAAIG,MACR,8BAA8BN,2CAElC,CAGA,IAAIO,EAAIC,OACJC,EAAiBF,EAAEE,eACnBC,EAAc,cACdC,EAAY,YACZC,EAAe,eACfC,EAAa,aACbC,EAAW,WACXC,EAAQ,QACRC,EAAWC,KAAYA,KAAWA,EAAM1B,GAC5C,SAAS2B,EAAYD,GACnB,QAAKA,IAEEE,EAAcF,IAAUG,EAAQH,MAAYA,EAAM3B,MAAgB2B,EAAMP,KAAepB,IAAc+B,EAAMJ,IAAUK,EAAML,GACpI,CACA,IAAIM,EAAmBhB,EAAEI,GAAWD,GAAac,WAC7CC,EAAoC,IAAIC,QAC5C,SAASP,EAAcF,GACrB,IAAKA,IAAUU,EAAYV,GACzB,OAAO,EACT,MAAMW,EAAQnB,EAAeQ,GAC7B,GAAc,OAAVW,GAAkBA,IAAUrB,EAAEI,GAChC,OAAO,EACT,MAAMkB,EAAOtB,EAAEuB,eAAeC,KAAKH,EAAOlB,IAAgBkB,EAAMlB,GAChE,GAAImB,IAASrB,OACX,OAAO,EACT,IAAKJ,EAAWyB,GACd,OAAO,EACT,IAAIG,EAAaP,EAAkBQ,IAAIJ,GAKvC,YAJmB,IAAfG,IACFA,EAAaE,SAASV,SAASO,KAAKF,GACpCJ,EAAkBU,IAAIN,EAAMG,IAEvBA,IAAeT,CACxB,CAMA,SAASa,EAAKC,EAAKC,EAAMC,GAAS,GAChC,GAAyB,IAArBC,EAAYH,GAAyB,EAC1BE,EAASE,QAAQC,QAAQL,GAAO9B,EAAEoC,KAAKN,IAC/CO,QAASC,IACZP,EAAKO,EAAKR,EAAIQ,GAAMR,IAExB,MACEA,EAAIO,QAAQ,CAACE,EAAOC,IAAUT,EAAKS,EAAOD,EAAOT,GAErD,CACA,SAASG,EAAY3C,GACnB,MAAMmD,EAAQnD,EAAMN,GACpB,OAAOyD,EAAQA,EAAMC,MAAQ7B,EAAQvB,GAAS,EAAgBwB,EAAMxB,GAAS,EAAcyB,EAAMzB,GAAS,EAAc,CAC1H,CACA,IAAIqD,EAAM,CAACrD,EAAOsD,EAAMC,EAAOZ,EAAY3C,KAAoB,IAATuD,EAAuBvD,EAAMqD,IAAIC,GAAQ5C,EAAEI,GAAWmB,eAAeC,KAAKlC,EAAOsD,GACnIlB,EAAM,CAACpC,EAAOsD,EAAMC,EAAOZ,EAAY3C,KAEhC,IAATuD,EAAuBvD,EAAMoC,IAAIkB,GAAQtD,EAAMsD,GAE7ChB,EAAM,CAACtC,EAAOwD,EAAgBpC,EAAOmC,EAAOZ,EAAY3C,MAC7C,IAATuD,EACFvD,EAAMsC,IAAIkB,EAAgBpC,GACV,IAATmC,EACPvD,EAAMyD,IAAIrC,GAEVpB,EAAMwD,GAAkBpC,GAS5B,IAAIG,EAAUmC,MAAMnC,QAChBC,EAASmC,GAAWA,aAAkBC,IACtCnC,EAASkC,GAAWA,aAAkBE,IACtC/B,EAAe6B,GAA6B,iBAAXA,EACjCpD,EAAcoD,GAA6B,mBAAXA,EAChCG,EAAaH,GAA6B,kBAAXA,EAUnC,IAAII,EAAUZ,GAAUA,EAAMa,OAASb,EAAMc,MAKzCC,EAAiBf,GAAUA,EAAMgB,UAAYhB,EAAMa,MAAQb,EAAMc,MACrE,SAASG,EAAYC,EAAM3B,GACzB,GAAIlB,EAAM6C,GACR,OAAO,IAAIT,IAAIS,GAEjB,GAAI5C,EAAM4C,GACR,OAAO,IAAIR,IAAIQ,GAEjB,GAAI9C,EAAQ8C,GACV,OAAOX,MAAM5C,GAAWwD,MAAMpC,KAAKmC,GACrC,MAAME,EAAUjD,EAAc+C,GAC9B,IAAe,IAAX3B,GAA8B,eAAXA,IAA4B6B,EAAS,CAC1D,MAAMC,EAAc9D,EAAE+D,0BAA0BJ,UACzCG,EAAY9E,GACnB,IAAIoD,EAAOF,QAAQC,QAAQ2B,GAC3B,IAAK,IAAIE,EAAI,EAAGA,EAAI5B,EAAK6B,OAAQD,IAAK,CACpC,MAAM1B,EAAMF,EAAK4B,GACXE,EAAOJ,EAAYxB,IACF,IAAnB4B,EAAK3D,KACP2D,EAAK3D,IAAY,EACjB2D,EAAK7D,IAAgB,IAEnB6D,EAAKxC,KAAOwC,EAAKtC,OACnBkC,EAAYxB,GAAO,CACjBjC,CAACA,IAAe,EAChBE,CAACA,IAAW,EAEZD,CAACA,GAAa4D,EAAK5D,GACnBE,CAACA,GAAQmD,EAAKrB,IAEpB,CACA,OAAOtC,EAAEmE,OAAOjE,EAAeyD,GAAOG,EACxC,CAAO,CACL,MAAMzC,EAAQnB,EAAeyD,GAC7B,GAAc,OAAVtC,GAAkBwC,EACpB,MAAO,IAAKF,GAEd,MAAM7B,EAAM9B,EAAEmE,OAAO9C,GACrB,OAAOrB,EAAEoE,OAAOtC,EAAK6B,EACvB,CACF,CACA,SAASU,EAAOvC,EAAKwC,GAAO,GAC1B,OAAIC,EAASzC,IAAQrB,EAAQqB,KAASnB,EAAYmB,KAE9CG,EAAYH,GAAO,GACrB9B,EAAEwE,iBAAiB1C,EAAK,CACtBF,IAAK6C,EACL1B,IAAK0B,EACLC,MAAOD,EACPE,OAAQF,IAGZzE,EAAEqE,OAAOvC,GACLwC,GACFzC,EACEC,EACA,CAAC8C,EAAMlE,KACL2D,EAAO3D,GAAO,KAEhB,IAhBKoB,CAmBX,CAIA,IAAI2C,EAA2B,CAC7BjE,CAACA,GAJH,WACEhB,EAAI,EACN,GAIA,SAAS+E,EAASzC,GAChB,OAAY,OAARA,IAAiBV,EAAYU,IAE1B9B,EAAEuE,SAASzC,EACpB,CAGA,IAAI+C,EAAe,SACfC,EAAgB,UAChBC,EAAqB,eACrBC,EAAU,CAAA,EACd,SAASC,EAAUC,GACjB,MAAM7F,EAAS2F,EAAQE,GAIvB,OAHK7F,GACHG,EAAI,EAAG0F,GAEF7F,CACT,CACA,IAOI8F,EAPAC,EAAkBF,KAAgBF,EAAQE,GAQ1CG,EAAkB,IAAMF,EAc5B,SAASG,EAAkBC,EAAOC,GAC5BA,IACFD,EAAME,aAAeR,EAAUH,GAC/BS,EAAMG,SAAW,GACjBH,EAAMI,gBAAkB,GACxBJ,EAAMK,eAAiBJ,EAE3B,CACA,SAASK,EAAYN,GACnBO,EAAWP,GACXA,EAAMQ,QAAQ1D,QAAQ2D,GACtBT,EAAMQ,QAAU,IAClB,CACA,SAASD,EAAWP,GACdA,IAAUJ,IACZA,EAAeI,EAAMU,QAEzB,CACA,IAAIC,EAAcC,GAAWhB,EA/BK,CAChCY,QAAS,GACTE,QA6BsDd,EA5BtDiB,OA4BoED,EAzBpEE,gBAAgB,EAChBC,mBAAoB,EACpBC,YAA6B,IAAIpD,IACjCqD,qBAAsC,IAAIrD,IAC1CsD,cAAerB,EAAeP,GAAgBI,EAAUJ,QAAgB,EACxE6B,oBAAqBtB,EAAeL,GAAsBE,EAAUF,QAAsB,GAqB5F,SAASiB,EAAYW,GACnB,MAAMlE,EAAQkE,EAAM3H,GACA,IAAhByD,EAAMC,OAA4C,IAAhBD,EAAMC,MAC1CD,EAAMmE,UAENnE,EAAMoE,UAAW,CACrB,CAGA,SAASC,EAAcC,EAAQxB,GAC7BA,EAAMe,mBAAqBf,EAAMQ,QAAQ9B,OACzC,MAAM+C,EAAYzB,EAAMQ,QAAQ,GAEhC,QAD8B,IAAXgB,GAAqBA,IAAWC,EACnC,CACVA,EAAUhI,GAAayE,YACzBoC,EAAYN,GACZ/F,EAAI,IAEFmB,EAAYoG,KACdA,EAASE,EAAS1B,EAAOwB,IAE3B,MAAMtB,aAAEA,GAAiBF,EACrBE,GACFA,EAAayB,4BACXF,EAAUhI,GAAauE,MACvBwD,EACAxB,EAGN,MACEwB,EAASE,EAAS1B,EAAOyB,GAO3B,OA4BF,SAAqBzB,EAAO7E,EAAO4D,GAAO,IACnCiB,EAAMU,SAAWV,EAAMa,OAAOe,aAAe5B,EAAMc,gBACtDhC,EAAO3D,EAAO4D,EAElB,CArCE8C,CAAY7B,EAAOwB,GAAQ,GAC3BlB,EAAYN,GACRA,EAAMG,UACRH,EAAMK,eAAeL,EAAMG,SAAUH,EAAMI,iBAEtCoB,IAAWnI,EAAUmI,OAAS,CACvC,CACA,SAASE,EAASI,EAAW3G,GAC3B,GAAI6D,EAAS7D,GACX,OAAOA,EACT,MAAM+B,EAAQ/B,EAAM1B,GACpB,IAAKyD,EAAO,CAEV,OADmB6E,GAAY5G,EAAO2G,EAAUd,YAAac,EAE/D,CACA,IAAKE,EAAY9E,EAAO4E,GACtB,OAAO3G,EAET,IAAK+B,EAAMgB,UACT,OAAOhB,EAAMc,MAEf,IAAKd,EAAM+E,WAAY,CACrB,MAAMC,WAAEA,GAAehF,EACvB,GAAIgF,EACF,KAAOA,EAAWxD,OAAS,GAAG,CACXwD,EAAWC,KAC5BC,CAASN,EACX,CAEFO,GAA2BnF,EAAO4E,EACpC,CACA,OAAO5E,EAAMa,KACf,CAMA,SAASuE,EAAmBpF,GAC1BA,EAAM+E,YAAa,EACnB/E,EAAMqF,OAAOxB,oBACf,CACA,IAAIiB,EAAc,CAAC9E,EAAO4E,IAAc5E,EAAMqF,SAAWT,EACrDU,EAAyB,GAC7B,SAASC,EAAoBC,EAAQC,EAAYC,EAAgBC,GAC/D,MAAMC,EAAahF,EAAO4E,GACpBK,EAAaL,EAAOvF,MAC1B,QAAoB,IAAhB0F,EAAwB,CAE1B,GADqB1G,EAAI2G,EAAYD,EAAaE,KAC7BJ,EAEnB,YADAtG,EAAIyG,EAAYD,EAAaD,EAAgBG,EAGjD,CACA,IAAKL,EAAOM,gBAAiB,CAC3B,MAAMC,EAAiBP,EAAOM,gBAAkC,IAAIrF,IACpErB,EAAKwG,EAAY,CAAC/F,EAAK5B,KACrB,GAAID,EAAQC,GAAQ,CAClB,MAAM0B,EAAOoG,EAAe9G,IAAIhB,IAAU,GAC1C0B,EAAKqG,KAAKnG,GACVkG,EAAe5G,IAAIlB,EAAO0B,EAC5B,GAEJ,CACA,MAAMsG,EAAYT,EAAOM,gBAAgB7G,IAAIwG,IAAeH,EAC5D,IAAK,MAAMY,KAAYD,EACrB9G,EAAIyG,EAAYM,EAAUR,EAAgBG,EAE9C,CAaA,SAASV,GAA2BnF,EAAO4E,GAEzC,GADuB5E,EAAMgB,YAAchB,EAAM+E,aAA+B,IAAhB/E,EAAMC,OAAyC,IAAhBD,EAAMC,OAA2BD,EAAMmG,wBAA0BnG,EAAMoG,WAAWC,MAAQ,GAAK,GAC1K,CAClB,MAAMrD,aAAEA,GAAiB4B,EACzB,GAAI5B,EAAc,CAChB,MAAMsD,EAAWtD,EAAauD,QAAQvG,GAClCsG,GACFtD,EAAawD,iBAAiBxG,EAAOsG,EAAU1B,EAEnD,CACAQ,EAAmBpF,EACrB,CACF,CAiCA,SAAS6E,GAAYrE,EAAQiG,EAAY7B,GACvC,OAAKA,EAAUjB,OAAOe,aAAeE,EAAUf,mBAAqB,GAGhE7F,EAAQwC,IAAWiG,EAAWvG,IAAIM,KAAYtC,EAAYsC,IAAWsB,EAAStB,KAGlFiG,EAAWnG,IAAIE,GACfpB,EAAKoB,EAAQ,CAACX,EAAK5B,KACjB,GAAID,EAAQC,GAAQ,CAClB,MAAM+B,EAAQ/B,EAAM1B,GACpB,GAAIuI,EAAY9E,EAAO4E,GAAY,CACjC,MAAM8B,EAAe3F,EAAcf,GACnCb,EAAIqB,EAAQX,EAAK6G,EAAclG,EAAOP,OACtCmF,EAAmBpF,EACrB,CACF,MAAW9B,EAAYD,IACrB4G,GAAY5G,EAAOwI,EAAY7B,MAf1BpE,CAmBX,CA0CA,IAAImG,GAAc,CAChB,GAAA1H,CAAIe,EAAOG,GACT,GAAIA,IAAS5D,EACX,OAAOyD,EACT,IAAI4G,EAAc5G,EAAMqF,OAAOpB,oBAC/B,MAAM4C,EAAwC,IAAhB7G,EAAMC,OAA2C,iBAATE,EACtE,GAAI0G,GACED,GAAaE,uBAAuB3G,GACtC,OAAOyG,EAAYG,wBAAwB/G,EAAOG,GAGtD,MAAM6G,EAASpG,EAAOZ,GACtB,IAAKE,EAAI8G,EAAQ7G,EAAMH,EAAMC,OAC3B,OAkHN,SAA2BD,EAAOgH,EAAQ7G,GACxC,MAAMsB,EAAOwF,GAAuBD,EAAQ7G,GAC5C,OAAOsB,EAAO1D,KAAS0D,EAAOA,EAAK1D,GAGjC0D,EAAKxC,KAAKF,KAAKiB,EAAMkH,aACnB,CACN,CAzHaC,CAAkBnH,EAAOgH,EAAQ7G,GAE1C,MAAMlC,EAAQ+I,EAAO7G,GACrB,GAAIH,EAAM+E,aAAe7G,EAAYD,GACnC,OAAOA,EAET,GAAI4I,GAAyB7G,EAAMoH,iBAAmBR,GAAaS,sBACjErH,EAAMoH,kBA/XZ,SAAsBnJ,GACpB,MAAMqJ,GAAKrJ,EACX,OAAOsJ,OAAOC,UAAUF,IAAMG,OAAOH,KAAOrJ,CAC9C,CA6XSyJ,CAAavH,GAChB,OAAOlC,EAET,GAAIA,IAAU0J,GAAK3H,EAAMc,MAAOX,GAAO,CACrCyH,GAAY5H,GACZ,MAAM6H,EAA2B,IAAhB7H,EAAMC,OAA2BE,EAAOA,EACnD2H,EAAaC,GAAY/H,EAAMqF,OAAQpH,EAAO+B,EAAO6H,GAC3D,OAAO7H,EAAMa,MAAMgH,GAAYC,CACjC,CACA,OAAO7J,CACT,EACAiC,IAAG,CAACF,EAAOG,IACFA,KAAQS,EAAOZ,GAExBN,QAAQM,GACCP,QAAQC,QAAQkB,EAAOZ,IAEhC,GAAAb,CAAIa,EAAOG,EAAMlC,GACf,MAAMwD,EAAOwF,GAAuBrG,EAAOZ,GAAQG,GACnD,GAAIsB,GAAMtC,IAER,OADAsC,EAAKtC,IAAIJ,KAAKiB,EAAMkH,OAAQjJ,IACrB,EAET,IAAK+B,EAAMgB,UAAW,CACpB,MAAMgH,EAAWL,GAAK/G,EAAOZ,GAAQG,GAC/B8H,EAAeD,IAAWzL,GAChC,GAAI0L,GAAgBA,EAAanH,QAAU7C,EAGzC,OAFA+B,EAAMa,MAAMV,GAAQlC,EACpB+B,EAAMoG,UAAUjH,IAAIgB,GAAM,IACnB,EAET,KA5aM+H,EA4aCjK,MA5aEkK,EA4aKH,GA1aH,IAANE,GAAW,EAAIA,GAAM,EAAIC,EAEzBD,GAAMA,GAAKC,GAAMA,UAwagB,IAAVlK,GAAoBiC,EAAIF,EAAMc,MAAOX,EAAMH,EAAMC,QAC3E,OAAO,EACT2H,GAAY5H,GACZoI,GAAYpI,EACd,CAhbJ,IAAYkI,EAAGC,EAibX,OAAInI,EAAMa,MAAMV,KAAUlC,SACf,IAAVA,GAAoBkC,KAAQH,EAAMa,QACnC0G,OAAOc,MAAMpK,IAAUsJ,OAAOc,MAAMrI,EAAMa,MAAMV,MAEhDH,EAAMa,MAAMV,GAAQlC,EACpB+B,EAAMoG,UAAUjH,IAAIgB,GAAM,GA7J9B,SAA8BK,EAAQX,EAAK5B,GACzC,MAAMoH,OAAEA,GAAW7E,EACnB,GAAIxC,EAAQC,GAAQ,CAClB,MAAM+B,EAAQ/B,EAAM1B,GAChBuI,EAAY9E,EAAOqF,IACrBrF,EAAMgF,WAAWgB,KAAK,WACpB4B,GAAYpH,GACZ,MAAMkF,EAAiB3E,EAAcf,GACrCuF,EAAoB/E,EAAQvC,EAAOyH,EAAgB7F,EACrD,EAEJ,MAAW3B,EAAYD,IACrBuC,EAAOwE,WAAWgB,KAAK,WACrB,MAAMsC,EAAa1H,EAAOJ,GACL,IAAjBA,EAAOP,MACLqI,EAAWpI,IAAIjC,IACjB4G,GAAY5G,EAAOoH,EAAOvB,YAAauB,GAGrCpG,EAAIqJ,EAAYzI,EAAKW,EAAOP,SAAWhC,GACrCoH,EAAO/B,QAAQ9B,OAAS,IAA8C,KAAxChB,EAAO4F,UAAUnH,IAAIY,KAAQ,IAAmBW,EAAOK,OACvFgE,GACE5F,EAAIuB,EAAOK,MAAOhB,EAAKW,EAAOP,OAC9BoF,EAAOvB,YACPuB,EAKV,EAEJ,CA+HIkD,CAAqBvI,EAAOG,EAAMlC,KAHzB,CAKX,EACAuK,eAAc,CAACxI,EAAOG,KACpByH,GAAY5H,QACoB,IAA5B2H,GAAK3H,EAAMc,MAAOX,IAAoBA,KAAQH,EAAMc,OACtDd,EAAMoG,UAAUjH,IAAIgB,GAAM,GAC1BiI,GAAYpI,IAEZA,EAAMoG,UAAUlE,OAAO/B,GAErBH,EAAMa,cACDb,EAAMa,MAAMV,IAEd,GAIT,wBAAAsI,CAAyBzI,EAAOG,GAC9B,MAAMuI,EAAQ9H,EAAOZ,GACfyB,EAAOhC,QAAQgJ,yBAAyBC,EAAOvI,GACrD,OAAKsB,EAEE,CACL3D,CAACA,IAAW,EACZF,CAACA,GAA+B,IAAhBoC,EAAMC,OAAoC,WAATE,EACjDtC,CAACA,GAAa4D,EAAK5D,GACnBE,CAACA,GAAQ2K,EAAMvI,IALRsB,CAOX,EACA,cAAAkH,GACE5L,EAAI,GACN,EACAU,eAAeuC,GACNvC,EAAeuC,EAAMc,OAE9B,cAAA8H,GACE7L,EAAI,GACN,GAEE8L,GAAa,CAAA,EACjB,IAAK,IAAIhJ,KAAO8G,GAAa,CAC3B,IAAImC,EAAKnC,GAAY9G,GACrBgJ,GAAWhJ,GAAO,WAChB,MAAM5C,EAAO8L,UAEb,OADA9L,EAAK,GAAKA,EAAK,GAAG,GACX6L,EAAGzL,MAAM2L,KAAM/L,EACxB,CACF,CAWA,SAAS0K,GAAKzD,EAAO/D,GACnB,MAAMH,EAAQkE,EAAM3H,GAEpB,OADeyD,EAAQY,EAAOZ,GAASkE,GACzB/D,EAChB,CASA,SAAS8G,GAAuBD,EAAQ7G,GACtC,KAAMA,KAAQ6G,GACZ,OACF,IAAIpI,EAAQnB,EAAeuJ,GAC3B,KAAOpI,GAAO,CACZ,MAAM6C,EAAOjE,OAAOiL,yBAAyB7J,EAAOuB,GACpD,GAAIsB,EACF,OAAOA,EACT7C,EAAQnB,EAAemB,EACzB,CAEF,CACA,SAASwJ,GAAYpI,GACdA,EAAMgB,YACThB,EAAMgB,WAAY,EACdhB,EAAMwD,SACR4E,GAAYpI,EAAMwD,SAGxB,CACA,SAASoE,GAAY5H,GACdA,EAAMa,QACTb,EAAMoG,UAA4B,IAAI3F,IACtCT,EAAMa,MAAQI,EACZjB,EAAMc,MACNd,EAAMqF,OAAO1B,OAAOsF,uBAG1B,CAnDAJ,GAAWL,eAAiB,SAASxI,EAAOG,GAG1C,MAF6B,eAAzB1D,QAAQC,IAAIC,UAA6B0L,MAAMa,SAAS/I,KAC1DpD,EAAI,IACC8L,GAAW1J,IAAIJ,KAAKiK,KAAMhJ,EAAOG,OAAM,EAChD,EACA0I,GAAW1J,IAAM,SAASa,EAAOG,EAAMlC,GAGrC,MAF6B,eAAzBxB,QAAQC,IAAIC,UAAsC,WAATwD,GAAqBkI,MAAMa,SAAS/I,KAC/EpD,EAAI,IACC4J,GAAYxH,IAAIJ,KAAKiK,KAAMhJ,EAAM,GAAIG,EAAMlC,EAAO+B,EAAM,GACjE,EA6CG,IAACmJ,GAAS,MACX,WAAAC,CAAYC,GACVL,KAAKtE,aAAc,EACnBsE,KAAKC,uBAAwB,EAC7BD,KAAKM,qBAAsB,EAoB3BN,KAAKO,QAAU,CAACrI,EAAMsI,EAAQzG,KAC5B,GAAI3F,EAAW8D,KAAU9D,EAAWoM,GAAS,CAC3C,MAAMC,EAAcD,EACpBA,EAAStI,EACT,MAAMwI,EAAOV,KACb,OAAO,SAAwBW,EAAQF,KAAgBxM,GACrD,OAAOyM,EAAKH,QAAQI,EAAQzF,GAAUsF,EAAOzK,KAAKiK,KAAM9E,KAAUjH,GACpE,CACF,CAKA,IAAIqH,EACJ,GALKlH,EAAWoM,IACdzM,EAAI,QACgB,IAAlBgG,GAA6B3F,EAAW2F,IAC1ChG,EAAI,GAEFmB,EAAYgD,GAAO,CACrB,MAAM4B,EAAQW,EAAWuF,MACnBY,EAAQ7B,GAAYjF,EAAO5B,OAAM,GACvC,IAAI2I,GAAW,EACf,IACEvF,EAASkF,EAAOI,GAChBC,GAAW,CACb,CAAC,QACKA,EACFzG,EAAYN,GAEZO,EAAWP,EACf,CAEA,OADAD,EAAkBC,EAAOC,GAClBsB,EAAcC,EAAQxB,EAC/B,CAAO,IAAK5B,IAASvC,EAAYuC,GAAO,CAQtC,GAPAoD,EAASkF,EAAOtI,QACD,IAAXoD,IACFA,EAASpD,GACPoD,IAAWnI,IACbmI,OAAS,GACP0E,KAAKtE,aACP9C,EAAO0C,GAAQ,GACbvB,EAAe,CACjB,MAAM+G,EAAI,GACJC,EAAK,GACXvH,EAAUH,GAAeoC,4BAA4BvD,EAAMoD,EAAQ,CACjErB,SAAU6G,EACV5G,gBAAiB6G,IAEnBhH,EAAc+G,EAAGC,EACnB,CACA,OAAOzF,CACT,CACEvH,EAAI,EAAGmE,IAEX8H,KAAKgB,mBAAqB,CAAC9I,EAAMsI,KAC/B,GAAIpM,EAAW8D,GACb,MAAO,CAAClB,KAAU/C,IAAS+L,KAAKgB,mBAAmBhK,EAAQkE,GAAUhD,EAAKgD,KAAUjH,IAEtF,IAAIgN,EAASC,EAKb,MAAO,CAJQlB,KAAKO,QAAQrI,EAAMsI,EAAQ,CAACM,EAAGC,KAC5CE,EAAUH,EACVI,EAAiBH,IAEHE,EAASC,IAEvBvJ,EAAU0I,GAAQc,aACpBnB,KAAKoB,cAAcf,EAAOc,YACxBxJ,EAAU0I,GAAQgB,uBACpBrB,KAAKsB,wBAAwBjB,EAAOgB,sBAClC1J,EAAU0I,GAAQkB,qBACpBvB,KAAKwB,sBAAsBnB,EAAOkB,mBACtC,CACA,WAAAE,CAAYvJ,GACLhD,EAAYgD,IACfnE,EAAI,GACFiB,EAAQkD,KACVA,EAAOwJ,GAAQxJ,IACjB,MAAM4B,EAAQW,EAAWuF,MACnBY,EAAQ7B,GAAYjF,EAAO5B,OAAM,GAGvC,OAFA0I,EAAMrN,GAAaoO,WAAY,EAC/BtH,EAAWP,GACJ8G,CACT,CACA,WAAAgB,CAAY1G,EAAOnB,GACjB,MAAM/C,EAAQkE,GAASA,EAAM3H,GACxByD,GAAUA,EAAM2K,WACnB5N,EAAI,GACN,MAAQsI,OAAQvC,GAAU9C,EAE1B,OADA6C,EAAkBC,EAAOC,GAClBsB,OAAc,EAAQvB,EAC/B,CAMA,aAAAsH,CAAcnM,GACZ+K,KAAKtE,YAAczG,CACrB,CAMA,uBAAAqM,CAAwBrM,GACtB+K,KAAKC,sBAAwBhL,CAC/B,CAOA,qBAAAuM,CAAsBvM,GACpB+K,KAAKM,oBAAsBrL,CAC7B,CACA,wBAAA4M,GACE,OAAO7B,KAAKM,mBACd,CACA,YAAAwB,CAAa5J,EAAM+I,GACjB,IAAI1I,EACJ,IAAKA,EAAI0I,EAAQzI,OAAS,EAAGD,GAAK,EAAGA,IAAK,CACxC,MAAMwJ,EAAQd,EAAQ1I,GACtB,GAA0B,IAAtBwJ,EAAMC,KAAKxJ,QAA6B,YAAbuJ,EAAME,GAAkB,CACrD/J,EAAO6J,EAAM9M,MACb,KACF,CACF,CACIsD,GAAI,IACN0I,EAAUA,EAAQ9I,MAAMI,EAAI,IAE9B,MAAM2J,EAAmB1I,EAAUH,GAAe8I,cAClD,OAAInN,EAAQkD,GACHgK,EAAiBhK,EAAM+I,GAEzBjB,KAAKO,QACVrI,EACCgD,GAAUgH,EAAiBhH,EAAO+F,GAEvC,GAEF,SAASlC,GAAYnD,EAAW3G,EAAOuH,EAAQ3F,GAC7C,MAAOqE,EAAOlE,GAAS3B,EAAMJ,GAASuE,EAAUJ,GAAcgJ,UAAUnN,EAAOuH,GAAUlH,EAAML,GAASuE,EAAUJ,GAAciJ,UAAUpN,EAAOuH,GA/WnJ,SAA0BtE,EAAMsE,GAC9B,MAAM8F,EAAclN,EAAQ8C,GACtBlB,EAAQ,CACZC,MAAOqL,EAAc,EAAgB,EAErCjG,OAAQG,EAASA,EAAOH,OAASzC,IAEjC5B,WAAW,EAEX+D,YAAY,EAGZqB,eAAW,EAEX5C,QAASgC,EAET1E,MAAOI,EAEPgG,OAAQ,KAGRrG,MAAO,KAEPsD,QAAS,KACTwG,WAAW,EAEX3F,gBAAY,GAEd,IAAIxE,EAASR,EACTuL,EAAQ5E,GACR2E,IACF9K,EAAS,CAACR,GACVuL,EAAQ1C,IAEV,MAAM2C,OAAEA,EAAM5B,MAAEA,GAAU6B,MAAMC,UAAUlL,EAAQ+K,GAGlD,OAFAvL,EAAMkH,OAAS0C,EACf5J,EAAMmE,QAAUqH,EACT,CAAC5B,EAAO5J,EACjB,CAyU6J2L,CAAiB1N,EAAOuH,GAgBnL,OAfcA,GAAQH,QAAUzC,KAC1BU,QAAQ0C,KAAK9B,GACnBlE,EAAMgF,WAAaQ,GAAQR,YAAc,GACzChF,EAAM4L,KAAO/L,EACT2F,QAAkB,IAAR3F,EArchB,SAA2C2F,EAAQqG,EAAOhM,GACxD2F,EAAOR,WAAWgB,KAAK,SAAsBpB,GAC3C,MAAM5E,EAAQ6L,EACd,IAAK7L,IAAU8E,EAAY9E,EAAO4E,GAChC,OAEFA,EAAUZ,eAAe8H,eAAe9L,GACxC,MAAM0F,EAAiB3E,EAAcf,GACrCuF,EAAoBC,EAAQxF,EAAMkH,QAAUlH,EAAO0F,EAAgB7F,GACnEsF,GAA2BnF,EAAO4E,EACpC,EACF,CA2bImH,CAAkCvG,EAAQxF,EAAOH,GAEjDG,EAAMgF,WAAWgB,KAAK,SAA0BgG,GAC9CA,EAAWhI,eAAe8H,eAAe9L,GACzC,MAAMgD,aAAEA,GAAiBgJ,EACrBhM,EAAMgB,WAAagC,GACrBA,EAAawD,iBAAiBxG,EAAO,GAAIgM,EAE7C,GAEK9H,CACT,CAGA,SAASwG,GAAQzM,GAGf,OAFKD,EAAQC,IACXlB,EAAI,GAAIkB,GACHgO,GAAYhO,EACrB,CACA,SAASgO,GAAYhO,GACnB,IAAKC,EAAYD,IAAU6D,EAAS7D,GAClC,OAAOA,EACT,MAAM+B,EAAQ/B,EAAM1B,GACpB,IAAI2P,EACA3M,GAAS,EACb,GAAIS,EAAO,CACT,IAAKA,EAAMgB,UACT,OAAOhB,EAAMc,MACfd,EAAM+E,YAAa,EACnBmH,EAAOjL,EAAYhD,EAAO+B,EAAMqF,OAAO1B,OAAOsF,uBAC9C1J,EAASS,EAAMqF,OAAO1B,OAAOkH,0BAC/B,MACEqB,EAAOjL,EAAYhD,GAAO,GAY5B,OAVAmB,EACE8M,EACA,CAACrM,EAAKsM,KACJhN,EAAI+M,EAAMrM,EAAKoM,GAAYE,KAE7B5M,GAEES,IACFA,EAAM+E,YAAa,GAEdmH,CACT,CAivBA,IACI3C,IADQ,IAAIJ,IACII","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"immer.js","sources":["../../../../../node_modules/immer/dist/immer.mjs"],"sourcesContent":["// 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 = isFunction(e) ? 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 O = Object;\nvar getPrototypeOf = O.getPrototypeOf;\nvar CONSTRUCTOR = \"constructor\";\nvar PROTOTYPE = \"prototype\";\nvar CONFIGURABLE = \"configurable\";\nvar ENUMERABLE = \"enumerable\";\nvar WRITABLE = \"writable\";\nvar VALUE = \"value\";\nvar isDraft = (value) => !!value && !!value[DRAFT_STATE];\nfunction isDraftable(value) {\n if (!value)\n return false;\n return isPlainObject(value) || isArray(value) || !!value[DRAFTABLE] || !!value[CONSTRUCTOR]?.[DRAFTABLE] || isMap(value) || isSet(value);\n}\nvar objectCtorString = O[PROTOTYPE][CONSTRUCTOR].toString();\nvar cachedCtorStrings = /* @__PURE__ */ new WeakMap();\nfunction isPlainObject(value) {\n if (!value || !isObjectish(value))\n return false;\n const proto = getPrototypeOf(value);\n if (proto === null || proto === O[PROTOTYPE])\n return true;\n const Ctor = O.hasOwnProperty.call(proto, CONSTRUCTOR) && proto[CONSTRUCTOR];\n if (Ctor === Object)\n return true;\n if (!isFunction(Ctor))\n return false;\n let ctorString = cachedCtorStrings.get(Ctor);\n if (ctorString === void 0) {\n ctorString = Function.toString.call(Ctor);\n cachedCtorStrings.set(Ctor, ctorString);\n }\n return ctorString === objectCtorString;\n}\nfunction original(value) {\n if (!isDraft(value))\n die(15, value);\n return value[DRAFT_STATE].base_;\n}\nfunction each(obj, iter, strict = true) {\n if (getArchtype(obj) === 0 /* Object */) {\n const keys = strict ? Reflect.ownKeys(obj) : O.keys(obj);\n keys.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_ : isArray(thing) ? 1 /* Array */ : isMap(thing) ? 2 /* Map */ : isSet(thing) ? 3 /* Set */ : 0 /* Object */;\n}\nvar has = (thing, prop, type = getArchtype(thing)) => type === 2 /* Map */ ? thing.has(prop) : O[PROTOTYPE].hasOwnProperty.call(thing, prop);\nvar get = (thing, prop, type = getArchtype(thing)) => (\n // @ts-ignore\n type === 2 /* Map */ ? thing.get(prop) : thing[prop]\n);\nvar set = (thing, propOrOldValue, value, type = getArchtype(thing)) => {\n if (type === 2 /* Map */)\n thing.set(propOrOldValue, value);\n else if (type === 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}\nvar isArray = Array.isArray;\nvar isMap = (target) => target instanceof Map;\nvar isSet = (target) => target instanceof Set;\nvar isObjectish = (target) => typeof target === \"object\";\nvar isFunction = (target) => typeof target === \"function\";\nvar isBoolean = (target) => typeof target === \"boolean\";\nfunction isArrayIndex(value) {\n const n = +value;\n return Number.isInteger(n) && String(n) === value;\n}\nvar getProxyDraft = (value) => {\n if (!isObjectish(value))\n return null;\n return value?.[DRAFT_STATE];\n};\nvar latest = (state) => state.copy_ || state.base_;\nvar getValue = (value) => {\n const proxyDraft = getProxyDraft(value);\n return proxyDraft ? proxyDraft.copy_ ?? proxyDraft.base_ : value;\n};\nvar getFinalValue = (state) => state.modified_ ? state.copy_ : state.base_;\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 (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 = O.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 O.create(getPrototypeOf(base), descriptors);\n } else {\n const proto = getPrototypeOf(base);\n if (proto !== null && isPlain) {\n return { ...base };\n }\n const obj = O.create(proto);\n return O.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 O.defineProperties(obj, {\n set: dontMutateMethodOverride,\n add: dontMutateMethodOverride,\n clear: dontMutateMethodOverride,\n delete: dontMutateMethodOverride\n });\n }\n O.freeze(obj);\n if (deep)\n each(\n obj,\n (_key, value) => {\n freeze(value, true);\n },\n false\n );\n return obj;\n}\nfunction dontMutateFrozenCollections() {\n die(2);\n}\nvar dontMutateMethodOverride = {\n [VALUE]: dontMutateFrozenCollections\n};\nfunction isFrozen(obj) {\n if (obj === null || !isObjectish(obj))\n return true;\n return O.isFrozen(obj);\n}\n\n// src/utils/plugins.ts\nvar PluginMapSet = \"MapSet\";\nvar PluginPatches = \"Patches\";\nvar PluginArrayMethods = \"ArrayMethods\";\nvar plugins = {};\nfunction getPlugin(pluginKey) {\n const plugin = plugins[pluginKey];\n if (!plugin) {\n die(0, pluginKey);\n }\n return plugin;\n}\nvar isPluginLoaded = (pluginKey) => !!plugins[pluginKey];\nfunction loadPlugin(pluginKey, implementation) {\n if (!plugins[pluginKey])\n plugins[pluginKey] = implementation;\n}\n\n// src/core/scope.ts\nvar currentScope;\nvar getCurrentScope = () => currentScope;\nvar createScope = (parent_, immer_) => ({\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 handledSet_: /* @__PURE__ */ new Set(),\n processedForPatches_: /* @__PURE__ */ new Set(),\n mapSetPlugin_: isPluginLoaded(PluginMapSet) ? getPlugin(PluginMapSet) : void 0,\n arrayMethodsPlugin_: isPluginLoaded(PluginArrayMethods) ? getPlugin(PluginArrayMethods) : void 0\n});\nfunction usePatchesInScope(scope, patchListener) {\n if (patchListener) {\n scope.patchPlugin_ = getPlugin(PluginPatches);\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}\nvar enterScope = (immer2) => currentScope = createScope(currentScope, immer2);\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 }\n const { patchPlugin_ } = scope;\n if (patchPlugin_) {\n patchPlugin_.generateReplacementPatches_(\n baseDraft[DRAFT_STATE].base_,\n result,\n scope\n );\n }\n } else {\n result = finalize(scope, baseDraft);\n }\n maybeFreeze(scope, result, true);\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) {\n if (isFrozen(value))\n return value;\n const state = value[DRAFT_STATE];\n if (!state) {\n const finalValue = handleValue(value, rootScope.handledSet_, rootScope);\n return finalValue;\n }\n if (!isSameScope(state, rootScope)) {\n return value;\n }\n if (!state.modified_) {\n return state.base_;\n }\n if (!state.finalized_) {\n const { callbacks_ } = state;\n if (callbacks_) {\n while (callbacks_.length > 0) {\n const callback = callbacks_.pop();\n callback(rootScope);\n }\n }\n generatePatchesAndFinalize(state, rootScope);\n }\n return state.copy_;\n}\nfunction maybeFreeze(scope, value, deep = false) {\n if (!scope.parent_ && scope.immer_.autoFreeze_ && scope.canAutoFreeze_) {\n freeze(value, deep);\n }\n}\nfunction markStateFinalized(state) {\n state.finalized_ = true;\n state.scope_.unfinalizedDrafts_--;\n}\nvar isSameScope = (state, rootScope) => state.scope_ === rootScope;\nvar EMPTY_LOCATIONS_RESULT = [];\nfunction updateDraftInParent(parent, draftValue, finalizedValue, originalKey) {\n const parentCopy = latest(parent);\n const parentType = parent.type_;\n if (originalKey !== void 0) {\n const currentValue = get(parentCopy, originalKey, parentType);\n if (currentValue === draftValue) {\n set(parentCopy, originalKey, finalizedValue, parentType);\n return;\n }\n }\n if (!parent.draftLocations_) {\n const draftLocations = parent.draftLocations_ = /* @__PURE__ */ new Map();\n each(parentCopy, (key, value) => {\n if (isDraft(value)) {\n const keys = draftLocations.get(value) || [];\n keys.push(key);\n draftLocations.set(value, keys);\n }\n });\n }\n const locations = parent.draftLocations_.get(draftValue) ?? EMPTY_LOCATIONS_RESULT;\n for (const location of locations) {\n set(parentCopy, location, finalizedValue, parentType);\n }\n}\nfunction registerChildFinalizationCallback(parent, child, key) {\n parent.callbacks_.push(function childCleanup(rootScope) {\n const state = child;\n if (!state || !isSameScope(state, rootScope)) {\n return;\n }\n rootScope.mapSetPlugin_?.fixSetContents(state);\n const finalizedValue = getFinalValue(state);\n updateDraftInParent(parent, state.draft_ ?? state, finalizedValue, key);\n generatePatchesAndFinalize(state, rootScope);\n });\n}\nfunction generatePatchesAndFinalize(state, rootScope) {\n const shouldFinalize = state.modified_ && !state.finalized_ && (state.type_ === 3 /* Set */ || state.type_ === 1 /* Array */ && state.allIndicesReassigned_ || (state.assigned_?.size ?? 0) > 0);\n if (shouldFinalize) {\n const { patchPlugin_ } = rootScope;\n if (patchPlugin_) {\n const basePath = patchPlugin_.getPath(state);\n if (basePath) {\n patchPlugin_.generatePatches_(state, basePath, rootScope);\n }\n }\n markStateFinalized(state);\n }\n}\nfunction handleCrossReference(target, key, value) {\n const { scope_ } = target;\n if (isDraft(value)) {\n const state = value[DRAFT_STATE];\n if (isSameScope(state, scope_)) {\n state.callbacks_.push(function crossReferenceCleanup() {\n prepareCopy(target);\n const finalizedValue = getFinalValue(state);\n updateDraftInParent(target, value, finalizedValue, key);\n });\n }\n } else if (isDraftable(value)) {\n target.callbacks_.push(function nestedDraftCleanup() {\n const targetCopy = latest(target);\n if (target.type_ === 3 /* Set */) {\n if (targetCopy.has(value)) {\n handleValue(value, scope_.handledSet_, scope_);\n }\n } else {\n if (get(targetCopy, key, target.type_) === value) {\n if (scope_.drafts_.length > 1 && (target.assigned_.get(key) ?? false) === true && target.copy_) {\n handleValue(\n get(target.copy_, key, target.type_),\n scope_.handledSet_,\n scope_\n );\n }\n }\n }\n });\n }\n}\nfunction handleValue(target, handledSet, rootScope) {\n if (!rootScope.immer_.autoFreeze_ && rootScope.unfinalizedDrafts_ < 1) {\n return target;\n }\n if (isDraft(target) || handledSet.has(target) || !isDraftable(target) || isFrozen(target)) {\n return target;\n }\n handledSet.add(target);\n each(target, (key, value) => {\n if (isDraft(value)) {\n const state = value[DRAFT_STATE];\n if (isSameScope(state, rootScope)) {\n const updatedValue = getFinalValue(state);\n set(target, key, updatedValue, target.type_);\n markStateFinalized(state);\n }\n } else if (isDraftable(value)) {\n handleValue(value, handledSet, rootScope);\n }\n });\n return target;\n}\n\n// src/core/proxy.ts\nfunction createProxyProxy(base, parent) {\n const baseIsArray = isArray(base);\n const state = {\n type_: baseIsArray ? 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 // actually instantiated in `prepareCopy()`\n assigned_: void 0,\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 // `callbacks` actually gets assigned in `createProxy`\n callbacks_: void 0\n };\n let target = state;\n let traps = objectTraps;\n if (baseIsArray) {\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, state];\n}\nvar objectTraps = {\n get(state, prop) {\n if (prop === DRAFT_STATE)\n return state;\n if (prop === \"constructor\" || prop === \"__proto__\") {\n const source2 = latest(state);\n const value2 = source2[prop];\n return new Proxy(value2 || {}, {\n get: (target, key) => {\n if (key === \"__proto__\" || key === \"prototype\") {\n return Object.freeze(/* @__PURE__ */ Object.create(null));\n }\n return Reflect.get(target, key);\n },\n set: () => {\n return true;\n },\n apply: (target, thisArg, args) => {\n return Reflect.apply(target, thisArg, args);\n }\n });\n }\n let arrayPlugin = state.scope_.arrayMethodsPlugin_;\n const isArrayWithStringProp = state.type_ === 1 /* Array */ && typeof prop === \"string\";\n if (isArrayWithStringProp) {\n if (arrayPlugin?.isArrayOperationMethod(prop)) {\n return arrayPlugin.createMethodInterceptor(state, prop);\n }\n }\n const source = latest(state);\n if (!has(source, prop, state.type_)) {\n return readPropFromProto(state, source, prop);\n }\n const value = source[prop];\n if (state.finalized_ || !isDraftable(value)) {\n return value;\n }\n if (isArrayWithStringProp && state.operationMethod && arrayPlugin?.isMutatingArrayMethod(\n state.operationMethod\n ) && isArrayIndex(prop)) {\n return value;\n }\n if (value === peek(state.base_, prop)) {\n prepareCopy(state);\n const childKey = state.type_ === 1 /* Array */ ? +prop : prop;\n const childDraft = createProxy(state.scope_, value, state, childKey);\n return state.copy_[childKey] = childDraft;\n }\n return value;\n },\n has(state, prop) {\n if (prop === \"constructor\" || prop === \"__proto__\" || prop === \"prototype\") {\n return false;\n }\n return prop in latest(state);\n },\n ownKeys(state) {\n return Reflect.ownKeys(latest(state));\n },\n set(state, prop, value) {\n if (prop === \"constructor\" || prop === \"__proto__\" || prop === \"prototype\") {\n return true;\n }\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_.set(prop, false);\n return true;\n }\n if (is(value, current2) && (value !== void 0 || has(state.base_, prop, state.type_)))\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_.set(prop, true);\n handleCrossReference(state, prop, value);\n return true;\n },\n deleteProperty(state, prop) {\n prepareCopy(state);\n if (peek(state.base_, prop) !== void 0 || prop in state.base_) {\n state.assigned_.set(prop, false);\n markChanged(state);\n } else {\n state.assigned_.delete(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 = {};\nfor (let key in objectTraps) {\n let fn = objectTraps[key];\n arrayTraps[key] = function() {\n const args = arguments;\n args[0] = args[0][0];\n return fn.apply(this, args);\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.assigned_ = /* @__PURE__ */ new Map();\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 this.useStrictIteration_ = 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 (isFunction(base) && !isFunction(recipe)) {\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 (!isFunction(recipe))\n die(6);\n if (patchListener !== void 0 && !isFunction(patchListener))\n die(7);\n let result;\n if (isDraftable(base)) {\n const scope = enterScope(this);\n const proxy = createProxy(scope, 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 || !isObjectish(base)) {\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(PluginPatches).generateReplacementPatches_(base, result, {\n patches_: p,\n inversePatches_: ip\n });\n patchListener(p, ip);\n }\n return result;\n } else\n die(1, base);\n };\n this.produceWithPatches = (base, recipe) => {\n if (isFunction(base)) {\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 (isBoolean(config?.autoFreeze))\n this.setAutoFreeze(config.autoFreeze);\n if (isBoolean(config?.useStrictShallowCopy))\n this.setUseStrictShallowCopy(config.useStrictShallowCopy);\n if (isBoolean(config?.useStrictIteration))\n this.setUseStrictIteration(config.useStrictIteration);\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(scope, 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 /**\n * Pass false to use faster iteration that skips non-enumerable properties\n * but still handles symbols for compatibility.\n *\n * By default, strict iteration is enabled (includes all own properties).\n */\n setUseStrictIteration(value) {\n this.useStrictIteration_ = value;\n }\n shouldUseStrictIteration() {\n return this.useStrictIteration_;\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(PluginPatches).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(rootScope, value, parent, key) {\n const [draft, state] = isMap(value) ? getPlugin(PluginMapSet).proxyMap_(value, parent) : isSet(value) ? getPlugin(PluginMapSet).proxySet_(value, parent) : createProxyProxy(value, parent);\n const scope = parent?.scope_ ?? getCurrentScope();\n scope.drafts_.push(draft);\n state.callbacks_ = parent?.callbacks_ ?? [];\n state.key_ = key;\n if (parent && key !== void 0) {\n registerChildFinalizationCallback(parent, state, key);\n } else {\n state.callbacks_.push(function rootDraftCleanup(rootScope2) {\n rootScope2.mapSetPlugin_?.fixSetContents(state);\n const { patchPlugin_ } = rootScope2;\n if (state.modified_ && patchPlugin_) {\n patchPlugin_.generatePatches_(state, [], rootScope2);\n }\n });\n }\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 let strict = true;\n if (state) {\n if (!state.modified_)\n return state.base_;\n state.finalized_ = true;\n copy = shallowCopy(value, state.scope_.immer_.useStrictShallowCopy_);\n strict = state.scope_.immer_.shouldUseStrictIteration();\n } else {\n copy = shallowCopy(value, true);\n }\n each(\n copy,\n (key, childValue) => {\n set(copy, key, currentImpl(childValue));\n },\n strict\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 function getPath(state, path = []) {\n if (state.key_ !== void 0) {\n const parentCopy = state.parent_.copy_ ?? state.parent_.base_;\n const proxyDraft = getProxyDraft(get(parentCopy, state.key_));\n const valueAtKey = get(parentCopy, state.key_);\n if (valueAtKey === void 0) {\n return null;\n }\n if (valueAtKey !== state.draft_ && valueAtKey !== state.base_ && valueAtKey !== state.copy_) {\n return null;\n }\n if (proxyDraft != null && proxyDraft.base_ !== state.base_) {\n return null;\n }\n const isSet2 = state.parent_.type_ === 3 /* Set */;\n let key;\n if (isSet2) {\n const setParent = state.parent_;\n key = Array.from(setParent.drafts_.keys()).indexOf(state.key_);\n } else {\n key = state.key_;\n }\n if (!(isSet2 && parentCopy.size > key || has(parentCopy, key))) {\n return null;\n }\n path.push(key);\n }\n if (state.parent_) {\n return getPath(state.parent_, path);\n }\n path.reverse();\n try {\n resolvePath(state.copy_, path);\n } catch (e) {\n return null;\n }\n return path;\n }\n function resolvePath(base, path) {\n let current2 = base;\n for (let i = 0; i < path.length - 1; i++) {\n const key = path[i];\n current2 = get(current2, key);\n if (!isObjectish(current2) || current2 === null) {\n throw new Error(`Cannot resolve path at '${path.join(\"/\")}'`);\n }\n }\n return current2;\n }\n const REPLACE = \"replace\";\n const ADD = \"add\";\n const REMOVE = \"remove\";\n function generatePatches_(state, basePath, scope) {\n if (state.scope_.processedForPatches_.has(state)) {\n return;\n }\n state.scope_.processedForPatches_.add(state);\n const { patches_, inversePatches_ } = scope;\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(\n state,\n basePath,\n patches_,\n inversePatches_\n );\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 const allReassigned = state.allIndicesReassigned_ === true;\n for (let i = 0; i < base_.length; i++) {\n const copiedItem = copy_[i];\n const baseItem = base_[i];\n const isAssigned = allReassigned || assigned_?.get(i.toString());\n if (isAssigned && copiedItem !== baseItem) {\n const childState = copiedItem?.[DRAFT_STATE];\n if (childState && childState.modified_) {\n continue;\n }\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(copiedItem)\n });\n inversePatches.push({\n op: REPLACE,\n path,\n value: clonePatchValueIfNeeded(baseItem)\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_, type_ } = state;\n each(state.assigned_, (key, assignedValue) => {\n const origValue = get(base_, key, type_);\n const value = get(copy_, key, type_);\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(\n op === REMOVE ? { op, path } : { op, path, value: clonePatchValueIfNeeded(value) }\n );\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, scope) {\n const { patches_, inversePatches_ } = scope;\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 (isFunction(base) && p === PROTOTYPE)\n die(errorOffset + 3);\n base = get(base, p);\n if (!isObjectish(base))\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 (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(PluginPatches, {\n applyPatches_,\n generatePatches_,\n generateReplacementPatches_,\n getPath\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 callbacks_: []\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 handleCrossReference(state, key, value);\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(state.scope_, value, state, key);\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 const map = new DraftMap(target, parent);\n return [map, map[DRAFT_STATE]];\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 assigned_: void 0,\n callbacks_: []\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 handleCrossReference(state, value, 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 const set2 = new DraftSet(target, parent);\n return [set2, set2[DRAFT_STATE]];\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(state.scope_, value, state, value);\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 function fixSetContents(target) {\n if (target.type_ === 3 /* Set */ && target.copy_) {\n const copy = new Set(target.copy_);\n target.copy_.clear();\n copy.forEach((value) => {\n target.copy_.add(getValue(value));\n });\n }\n }\n loadPlugin(PluginMapSet, { proxyMap_, proxySet_, fixSetContents });\n}\n\n// src/plugins/arrayMethods.ts\nfunction enableArrayMethods() {\n const SHIFTING_METHODS = /* @__PURE__ */ new Set([\"shift\", \"unshift\"]);\n const QUEUE_METHODS = /* @__PURE__ */ new Set([\"push\", \"pop\"]);\n const RESULT_RETURNING_METHODS = /* @__PURE__ */ new Set([\n ...QUEUE_METHODS,\n ...SHIFTING_METHODS\n ]);\n const REORDERING_METHODS = /* @__PURE__ */ new Set([\"reverse\", \"sort\"]);\n const MUTATING_METHODS = /* @__PURE__ */ new Set([\n ...RESULT_RETURNING_METHODS,\n ...REORDERING_METHODS,\n \"splice\"\n ]);\n const FIND_METHODS = /* @__PURE__ */ new Set([\"find\", \"findLast\"]);\n const NON_MUTATING_METHODS = /* @__PURE__ */ new Set([\n \"filter\",\n \"slice\",\n \"concat\",\n \"flat\",\n ...FIND_METHODS,\n \"findIndex\",\n \"findLastIndex\",\n \"some\",\n \"every\",\n \"indexOf\",\n \"lastIndexOf\",\n \"includes\",\n \"join\",\n \"toString\",\n \"toLocaleString\"\n ]);\n function isMutatingArrayMethod(method) {\n return MUTATING_METHODS.has(method);\n }\n function isNonMutatingArrayMethod(method) {\n return NON_MUTATING_METHODS.has(method);\n }\n function isArrayOperationMethod(method) {\n return isMutatingArrayMethod(method) || isNonMutatingArrayMethod(method);\n }\n function enterOperation(state, method) {\n state.operationMethod = method;\n }\n function exitOperation(state) {\n state.operationMethod = void 0;\n }\n function executeArrayMethod(state, operation, markLength = true) {\n prepareCopy(state);\n const result = operation();\n markChanged(state);\n if (markLength)\n state.assigned_.set(\"length\", true);\n return result;\n }\n function markAllIndicesReassigned(state) {\n state.allIndicesReassigned_ = true;\n }\n function normalizeSliceIndex(index, length) {\n if (index < 0) {\n return Math.max(length + index, 0);\n }\n return Math.min(index, length);\n }\n function handleInsertedValues(state, startIndex, values) {\n for (let i = 0; i < values.length; i++) {\n const index = startIndex + i;\n state.assigned_.set(index, true);\n handleCrossReference(state, index, values[i]);\n }\n }\n function handleSimpleOperation(state, method, args) {\n return executeArrayMethod(state, () => {\n const lengthBefore = state.copy_.length;\n const result = state.copy_[method](...args);\n if (SHIFTING_METHODS.has(method)) {\n markAllIndicesReassigned(state);\n }\n if (method === \"push\" && args.length > 0) {\n handleInsertedValues(state, lengthBefore, args);\n } else if (method === \"unshift\" && args.length > 0) {\n handleInsertedValues(state, 0, args);\n }\n return RESULT_RETURNING_METHODS.has(method) ? result : state.draft_;\n });\n }\n function handleReorderingOperation(state, method, args) {\n return executeArrayMethod(\n state,\n () => {\n ;\n state.copy_[method](...args);\n markAllIndicesReassigned(state);\n return state.draft_;\n },\n false\n );\n }\n function createMethodInterceptor(state, originalMethod) {\n return function interceptedMethod(...args) {\n const method = originalMethod;\n enterOperation(state, method);\n try {\n if (isMutatingArrayMethod(method)) {\n if (RESULT_RETURNING_METHODS.has(method)) {\n return handleSimpleOperation(state, method, args);\n }\n if (REORDERING_METHODS.has(method)) {\n return handleReorderingOperation(state, method, args);\n }\n if (method === \"splice\") {\n const res = executeArrayMethod(\n state,\n () => state.copy_.splice(...args)\n );\n markAllIndicesReassigned(state);\n if (args.length > 2) {\n const startIndex = normalizeSliceIndex(\n args[0] ?? 0,\n state.copy_.length\n );\n handleInsertedValues(state, startIndex, args.slice(2));\n }\n return res;\n }\n } else {\n return handleNonMutatingOperation(state, method, args);\n }\n } finally {\n exitOperation(state);\n }\n };\n }\n function handleNonMutatingOperation(state, method, args) {\n const source = latest(state);\n if (method === \"filter\") {\n const predicate = args[0];\n const result = [];\n for (let i = 0; i < source.length; i++) {\n if (predicate(source[i], i, source)) {\n result.push(state.draft_[i]);\n }\n }\n return result;\n }\n if (FIND_METHODS.has(method)) {\n const predicate = args[0];\n const isForward = method === \"find\";\n const step = isForward ? 1 : -1;\n const start = isForward ? 0 : source.length - 1;\n for (let i = start; i >= 0 && i < source.length; i += step) {\n if (predicate(source[i], i, source)) {\n return state.draft_[i];\n }\n }\n return void 0;\n }\n if (method === \"slice\") {\n const rawStart = args[0] ?? 0;\n const rawEnd = args[1] ?? source.length;\n const start = normalizeSliceIndex(rawStart, source.length);\n const end = normalizeSliceIndex(rawEnd, source.length);\n const result = [];\n for (let i = start; i < end; i++) {\n result.push(state.draft_[i]);\n }\n return result;\n }\n return source[method](...args);\n }\n loadPlugin(PluginArrayMethods, {\n createMethodInterceptor,\n isArrayOperationMethod,\n isMutatingArrayMethod\n });\n}\n\n// src/immer.ts\nvar immer = new Immer2();\nvar produce = immer.produce;\nvar produceWithPatches = /* @__PURE__ */ immer.produceWithPatches.bind(immer);\nvar setAutoFreeze = /* @__PURE__ */ immer.setAutoFreeze.bind(immer);\nvar setUseStrictShallowCopy = /* @__PURE__ */ immer.setUseStrictShallowCopy.bind(immer);\nvar setUseStrictIteration = /* @__PURE__ */ immer.setUseStrictIteration.bind(immer);\nvar applyPatches = /* @__PURE__ */ immer.applyPatches.bind(immer);\nvar createDraft = /* @__PURE__ */ immer.createDraft.bind(immer);\nvar finishDraft = /* @__PURE__ */ immer.finishDraft.bind(immer);\nvar castDraft = (value) => value;\nvar castImmutable = (value) => value;\nexport {\n Immer2 as Immer,\n applyPatches,\n castDraft,\n castImmutable,\n createDraft,\n current,\n enableArrayMethods,\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 setUseStrictIteration,\n setUseStrictShallowCopy\n};\n//# sourceMappingURL=immer.mjs.map"],"names":["NOTHING","Symbol","for","DRAFTABLE","DRAFT_STATE","errors","process","env","NODE_ENV","plugin","thing","data","die","error","args","e","msg","isFunction","apply","Error","O","Object","getPrototypeOf","CONSTRUCTOR","PROTOTYPE","CONFIGURABLE","ENUMERABLE","WRITABLE","VALUE","isDraft","value","isDraftable","isPlainObject","isArray","isMap","isSet","objectCtorString","toString","cachedCtorStrings","WeakMap","isObjectish","proto","Ctor","hasOwnProperty","call","ctorString","get","Function","set","each","obj","iter","strict","getArchtype","Reflect","ownKeys","keys","forEach","key","entry","index","state","type_","has","prop","type","propOrOldValue","add","Array","target","Map","Set","isBoolean","latest","copy_","base_","getFinalValue","modified_","shallowCopy","base","slice","isPlain","descriptors","getOwnPropertyDescriptors","i","length","desc","create","assign","freeze","deep","isFrozen","defineProperties","dontMutateMethodOverride","clear","delete","_key","PluginMapSet","PluginPatches","PluginArrayMethods","plugins","getPlugin","pluginKey","currentScope","isPluginLoaded","getCurrentScope","usePatchesInScope","scope","patchListener","patchPlugin_","patches_","inversePatches_","patchListener_","revokeScope","leaveScope","drafts_","revokeDraft","parent_","enterScope","immer2","immer_","canAutoFreeze_","unfinalizedDrafts_","handledSet_","processedForPatches_","mapSetPlugin_","arrayMethodsPlugin_","draft","revoke_","revoked_","processResult","result","baseDraft","finalize","generateReplacementPatches_","autoFreeze_","maybeFreeze","rootScope","handleValue","isSameScope","finalized_","callbacks_","pop","callback","generatePatchesAndFinalize","markStateFinalized","scope_","EMPTY_LOCATIONS_RESULT","updateDraftInParent","parent","draftValue","finalizedValue","originalKey","parentCopy","parentType","draftLocations_","draftLocations","push","locations","location","allIndicesReassigned_","assigned_","size","basePath","getPath","generatePatches_","handledSet","updatedValue","objectTraps","value2","Proxy","thisArg","arrayPlugin","isArrayWithStringProp","isArrayOperationMethod","createMethodInterceptor","source","getDescriptorFromProto","draft_","readPropFromProto","operationMethod","isMutatingArrayMethod","n","Number","isInteger","String","isArrayIndex","peek","prepareCopy","childKey","childDraft","createProxy","current2","currentState","x","y","markChanged","isNaN","targetCopy","handleCrossReference","deleteProperty","getOwnPropertyDescriptor","owner","defineProperty","setPrototypeOf","arrayTraps","fn","arguments","this","useStrictShallowCopy_","parseInt","Immer2","constructor","config","useStrictIteration_","produce","recipe","defaultBase","self","base2","proxy","hasError","p","ip","produceWithPatches","patches","inversePatches","autoFreeze","setAutoFreeze","useStrictShallowCopy","setUseStrictShallowCopy","useStrictIteration","setUseStrictIteration","createDraft","current","isManual_","finishDraft","shouldUseStrictIteration","applyPatches","patch","path","op","applyPatchesImpl","applyPatches_","proxyMap_","proxySet_","baseIsArray","traps","revoke","revocable","createProxyProxy","key_","child","fixSetContents","registerChildFinalizationCallback","rootScope2","currentImpl","copy","childValue"],"mappings":"AACG,IAACA,EAAUC,OAAOC,IAAI,iBACrBC,EAAYF,OAAOC,IAAI,mBACvBE,EAAcH,OAAOC,IAAI,eAGzBG,EAAkC,eAAzBC,QAAQC,IAAIC,SAA4B,CAEnD,SAASC,GACP,MAAO,mBAAmBA,oFAAyFA,2CACrH,EACA,SAASC,GACP,MAAO,sJAAsJA,IAC/J,EACA,wDACA,SAASC,GACP,MAAO,uHAAyHA,CAClI,EACA,oHACA,oCACA,+DACA,kEACA,2FACA,4EACA,SAASD,GACP,MAAO,mCAAmCA,GAC5C,EACA,2DACA,2DACA,6CACA,sEACA,SAASA,GACP,MAAO,oCAAoCA,GAC7C,GAGE,GACJ,SAASE,EAAIC,KAAUC,GACrB,GAA6B,eAAzBR,QAAQC,IAAIC,SAA2B,CACzC,MAAMO,EAAIV,EAAOQ,GACXG,EAAMC,EAAWF,GAAKA,EAAEG,MAAM,KAAMJ,GAAQC,EAClD,MAAM,IAAII,MAAM,WAAWH,IAC7B,CACA,MAAM,IAAIG,MACR,8BAA8BN,2CAElC,CAGA,IAAIO,EAAIC,OACJC,EAAiBF,EAAEE,eACnBC,EAAc,cACdC,EAAY,YACZC,EAAe,eACfC,EAAa,aACbC,EAAW,WACXC,EAAQ,QACRC,EAAWC,KAAYA,KAAWA,EAAM1B,GAC5C,SAAS2B,EAAYD,GACnB,QAAKA,IAEEE,EAAcF,IAAUG,EAAQH,MAAYA,EAAM3B,MAAgB2B,EAAMP,KAAepB,IAAc+B,EAAMJ,IAAUK,EAAML,GACpI,CACA,IAAIM,EAAmBhB,EAAEI,GAAWD,GAAac,WAC7CC,EAAoC,IAAIC,QAC5C,SAASP,EAAcF,GACrB,IAAKA,IAAUU,EAAYV,GACzB,OAAO,EACT,MAAMW,EAAQnB,EAAeQ,GAC7B,GAAc,OAAVW,GAAkBA,IAAUrB,EAAEI,GAChC,OAAO,EACT,MAAMkB,EAAOtB,EAAEuB,eAAeC,KAAKH,EAAOlB,IAAgBkB,EAAMlB,GAChE,GAAImB,IAASrB,OACX,OAAO,EACT,IAAKJ,EAAWyB,GACd,OAAO,EACT,IAAIG,EAAaP,EAAkBQ,IAAIJ,GAKvC,YAJmB,IAAfG,IACFA,EAAaE,SAASV,SAASO,KAAKF,GACpCJ,EAAkBU,IAAIN,EAAMG,IAEvBA,IAAeT,CACxB,CAMA,SAASa,EAAKC,EAAKC,EAAMC,GAAS,GAChC,GAAyB,IAArBC,EAAYH,GAAyB,EAC1BE,EAASE,QAAQC,QAAQL,GAAO9B,EAAEoC,KAAKN,IAC/CO,QAASC,IACZP,EAAKO,EAAKR,EAAIQ,GAAMR,IAExB,MACEA,EAAIO,QAAQ,CAACE,EAAOC,IAAUT,EAAKS,EAAOD,EAAOT,GAErD,CACA,SAASG,EAAY3C,GACnB,MAAMmD,EAAQnD,EAAMN,GACpB,OAAOyD,EAAQA,EAAMC,MAAQ7B,EAAQvB,GAAS,EAAgBwB,EAAMxB,GAAS,EAAcyB,EAAMzB,GAAS,EAAc,CAC1H,CACA,IAAIqD,EAAM,CAACrD,EAAOsD,EAAMC,EAAOZ,EAAY3C,KAAoB,IAATuD,EAAuBvD,EAAMqD,IAAIC,GAAQ5C,EAAEI,GAAWmB,eAAeC,KAAKlC,EAAOsD,GACnIlB,EAAM,CAACpC,EAAOsD,EAAMC,EAAOZ,EAAY3C,KAEhC,IAATuD,EAAuBvD,EAAMoC,IAAIkB,GAAQtD,EAAMsD,GAE7ChB,EAAM,CAACtC,EAAOwD,EAAgBpC,EAAOmC,EAAOZ,EAAY3C,MAC7C,IAATuD,EACFvD,EAAMsC,IAAIkB,EAAgBpC,GACV,IAATmC,EACPvD,EAAMyD,IAAIrC,GAEVpB,EAAMwD,GAAkBpC,GAS5B,IAAIG,EAAUmC,MAAMnC,QAChBC,EAASmC,GAAWA,aAAkBC,IACtCnC,EAASkC,GAAWA,aAAkBE,IACtC/B,EAAe6B,GAA6B,iBAAXA,EACjCpD,EAAcoD,GAA6B,mBAAXA,EAChCG,EAAaH,GAA6B,kBAAXA,EAUnC,IAAII,EAAUZ,GAAUA,EAAMa,OAASb,EAAMc,MAKzCC,EAAiBf,GAAUA,EAAMgB,UAAYhB,EAAMa,MAAQb,EAAMc,MACrE,SAASG,EAAYC,EAAM3B,GACzB,GAAIlB,EAAM6C,GACR,OAAO,IAAIT,IAAIS,GAEjB,GAAI5C,EAAM4C,GACR,OAAO,IAAIR,IAAIQ,GAEjB,GAAI9C,EAAQ8C,GACV,OAAOX,MAAM5C,GAAWwD,MAAMpC,KAAKmC,GACrC,MAAME,EAAUjD,EAAc+C,GAC9B,IAAe,IAAX3B,GAA8B,eAAXA,IAA4B6B,EAAS,CAC1D,MAAMC,EAAc9D,EAAE+D,0BAA0BJ,UACzCG,EAAY9E,GACnB,IAAIoD,EAAOF,QAAQC,QAAQ2B,GAC3B,IAAK,IAAIE,EAAI,EAAGA,EAAI5B,EAAK6B,OAAQD,IAAK,CACpC,MAAM1B,EAAMF,EAAK4B,GACXE,EAAOJ,EAAYxB,IACF,IAAnB4B,EAAK3D,KACP2D,EAAK3D,IAAY,EACjB2D,EAAK7D,IAAgB,IAEnB6D,EAAKxC,KAAOwC,EAAKtC,OACnBkC,EAAYxB,GAAO,CACjBjC,CAACA,IAAe,EAChBE,CAACA,IAAW,EAEZD,CAACA,GAAa4D,EAAK5D,GACnBE,CAACA,GAAQmD,EAAKrB,IAEpB,CACA,OAAOtC,EAAEmE,OAAOjE,EAAeyD,GAAOG,EACxC,CAAO,CACL,MAAMzC,EAAQnB,EAAeyD,GAC7B,GAAc,OAAVtC,GAAkBwC,EACpB,MAAO,IAAKF,GAEd,MAAM7B,EAAM9B,EAAEmE,OAAO9C,GACrB,OAAOrB,EAAEoE,OAAOtC,EAAK6B,EACvB,CACF,CACA,SAASU,EAAOvC,EAAKwC,GAAO,GAC1B,OAAIC,EAASzC,IAAQrB,EAAQqB,KAASnB,EAAYmB,KAE9CG,EAAYH,GAAO,GACrB9B,EAAEwE,iBAAiB1C,EAAK,CACtBF,IAAK6C,EACL1B,IAAK0B,EACLC,MAAOD,EACPE,OAAQF,IAGZzE,EAAEqE,OAAOvC,GACLwC,GACFzC,EACEC,EACA,CAAC8C,EAAMlE,KACL2D,EAAO3D,GAAO,KAEhB,IAhBKoB,CAmBX,CAIA,IAAI2C,EAA2B,CAC7BjE,CAACA,GAJH,WACEhB,EAAI,EACN,GAIA,SAAS+E,EAASzC,GAChB,OAAY,OAARA,IAAiBV,EAAYU,IAE1B9B,EAAEuE,SAASzC,EACpB,CAGA,IAAI+C,EAAe,SACfC,EAAgB,UAChBC,EAAqB,eACrBC,EAAU,CAAA,EACd,SAASC,EAAUC,GACjB,MAAM7F,EAAS2F,EAAQE,GAIvB,OAHK7F,GACHG,EAAI,EAAG0F,GAEF7F,CACT,CACA,IAOI8F,EAPAC,EAAkBF,KAAgBF,EAAQE,GAQ1CG,EAAkB,IAAMF,EAc5B,SAASG,EAAkBC,EAAOC,GAC5BA,IACFD,EAAME,aAAeR,EAAUH,GAC/BS,EAAMG,SAAW,GACjBH,EAAMI,gBAAkB,GACxBJ,EAAMK,eAAiBJ,EAE3B,CACA,SAASK,EAAYN,GACnBO,EAAWP,GACXA,EAAMQ,QAAQ1D,QAAQ2D,GACtBT,EAAMQ,QAAU,IAClB,CACA,SAASD,EAAWP,GACdA,IAAUJ,IACZA,EAAeI,EAAMU,QAEzB,CACA,IAAIC,EAAcC,GAAWhB,EA/BK,CAChCY,QAAS,GACTE,QA6BsDd,EA5BtDiB,OA4BoED,EAzBpEE,gBAAgB,EAChBC,mBAAoB,EACpBC,YAA6B,IAAIpD,IACjCqD,qBAAsC,IAAIrD,IAC1CsD,cAAerB,EAAeP,GAAgBI,EAAUJ,QAAgB,EACxE6B,oBAAqBtB,EAAeL,GAAsBE,EAAUF,QAAsB,GAqB5F,SAASiB,EAAYW,GACnB,MAAMlE,EAAQkE,EAAM3H,GACA,IAAhByD,EAAMC,OAA4C,IAAhBD,EAAMC,MAC1CD,EAAMmE,UAENnE,EAAMoE,UAAW,CACrB,CAGA,SAASC,EAAcC,EAAQxB,GAC7BA,EAAMe,mBAAqBf,EAAMQ,QAAQ9B,OACzC,MAAM+C,EAAYzB,EAAMQ,QAAQ,GAEhC,QAD8B,IAAXgB,GAAqBA,IAAWC,EACnC,CACVA,EAAUhI,GAAayE,YACzBoC,EAAYN,GACZ/F,EAAI,IAEFmB,EAAYoG,KACdA,EAASE,EAAS1B,EAAOwB,IAE3B,MAAMtB,aAAEA,GAAiBF,EACrBE,GACFA,EAAayB,4BACXF,EAAUhI,GAAauE,MACvBwD,EACAxB,EAGN,MACEwB,EAASE,EAAS1B,EAAOyB,GAO3B,OA4BF,SAAqBzB,EAAO7E,EAAO4D,GAAO,IACnCiB,EAAMU,SAAWV,EAAMa,OAAOe,aAAe5B,EAAMc,gBACtDhC,EAAO3D,EAAO4D,EAElB,CArCE8C,CAAY7B,EAAOwB,GAAQ,GAC3BlB,EAAYN,GACRA,EAAMG,UACRH,EAAMK,eAAeL,EAAMG,SAAUH,EAAMI,iBAEtCoB,IAAWnI,EAAUmI,OAAS,CACvC,CACA,SAASE,EAASI,EAAW3G,GAC3B,GAAI6D,EAAS7D,GACX,OAAOA,EACT,MAAM+B,EAAQ/B,EAAM1B,GACpB,IAAKyD,EAAO,CAEV,OADmB6E,GAAY5G,EAAO2G,EAAUd,YAAac,EAE/D,CACA,IAAKE,EAAY9E,EAAO4E,GACtB,OAAO3G,EAET,IAAK+B,EAAMgB,UACT,OAAOhB,EAAMc,MAEf,IAAKd,EAAM+E,WAAY,CACrB,MAAMC,WAAEA,GAAehF,EACvB,GAAIgF,EACF,KAAOA,EAAWxD,OAAS,GAAG,CACXwD,EAAWC,KAC5BC,CAASN,EACX,CAEFO,GAA2BnF,EAAO4E,EACpC,CACA,OAAO5E,EAAMa,KACf,CAMA,SAASuE,EAAmBpF,GAC1BA,EAAM+E,YAAa,EACnB/E,EAAMqF,OAAOxB,oBACf,CACA,IAAIiB,EAAc,CAAC9E,EAAO4E,IAAc5E,EAAMqF,SAAWT,EACrDU,EAAyB,GAC7B,SAASC,EAAoBC,EAAQC,EAAYC,EAAgBC,GAC/D,MAAMC,EAAahF,EAAO4E,GACpBK,EAAaL,EAAOvF,MAC1B,QAAoB,IAAhB0F,EAAwB,CAE1B,GADqB1G,EAAI2G,EAAYD,EAAaE,KAC7BJ,EAEnB,YADAtG,EAAIyG,EAAYD,EAAaD,EAAgBG,EAGjD,CACA,IAAKL,EAAOM,gBAAiB,CAC3B,MAAMC,EAAiBP,EAAOM,gBAAkC,IAAIrF,IACpErB,EAAKwG,EAAY,CAAC/F,EAAK5B,KACrB,GAAID,EAAQC,GAAQ,CAClB,MAAM0B,EAAOoG,EAAe9G,IAAIhB,IAAU,GAC1C0B,EAAKqG,KAAKnG,GACVkG,EAAe5G,IAAIlB,EAAO0B,EAC5B,GAEJ,CACA,MAAMsG,EAAYT,EAAOM,gBAAgB7G,IAAIwG,IAAeH,EAC5D,IAAK,MAAMY,KAAYD,EACrB9G,EAAIyG,EAAYM,EAAUR,EAAgBG,EAE9C,CAaA,SAASV,GAA2BnF,EAAO4E,GAEzC,GADuB5E,EAAMgB,YAAchB,EAAM+E,aAA+B,IAAhB/E,EAAMC,OAAyC,IAAhBD,EAAMC,OAA2BD,EAAMmG,wBAA0BnG,EAAMoG,WAAWC,MAAQ,GAAK,GAC1K,CAClB,MAAMrD,aAAEA,GAAiB4B,EACzB,GAAI5B,EAAc,CAChB,MAAMsD,EAAWtD,EAAauD,QAAQvG,GAClCsG,GACFtD,EAAawD,iBAAiBxG,EAAOsG,EAAU1B,EAEnD,CACAQ,EAAmBpF,EACrB,CACF,CAiCA,SAAS6E,GAAYrE,EAAQiG,EAAY7B,GACvC,OAAKA,EAAUjB,OAAOe,aAAeE,EAAUf,mBAAqB,GAGhE7F,EAAQwC,IAAWiG,EAAWvG,IAAIM,KAAYtC,EAAYsC,IAAWsB,EAAStB,KAGlFiG,EAAWnG,IAAIE,GACfpB,EAAKoB,EAAQ,CAACX,EAAK5B,KACjB,GAAID,EAAQC,GAAQ,CAClB,MAAM+B,EAAQ/B,EAAM1B,GACpB,GAAIuI,EAAY9E,EAAO4E,GAAY,CACjC,MAAM8B,EAAe3F,EAAcf,GACnCb,EAAIqB,EAAQX,EAAK6G,EAAclG,EAAOP,OACtCmF,EAAmBpF,EACrB,CACF,MAAW9B,EAAYD,IACrB4G,GAAY5G,EAAOwI,EAAY7B,MAf1BpE,CAmBX,CA0CA,IAAImG,GAAc,CAChB,GAAA1H,CAAIe,EAAOG,GACT,GAAIA,IAAS5D,EACX,OAAOyD,EACT,GAAa,gBAATG,GAAmC,cAATA,EAAsB,CAClD,MACMyG,EADUhG,EAAOZ,GACAG,GACvB,OAAO,IAAI0G,MAAMD,GAAU,GAAI,CAC7B3H,IAAK,CAACuB,EAAQX,IACA,cAARA,GAA+B,cAARA,EAClBrC,OAAOoE,OAAuBpE,OAAOkE,OAAO,OAE9CjC,QAAQR,IAAIuB,EAAQX,GAE7BV,IAAK,KACI,EAET9B,MAAO,CAACmD,EAAQsG,EAAS7J,IAChBwC,QAAQpC,MAAMmD,EAAQsG,EAAS7J,IAG5C,CACA,IAAI8J,EAAc/G,EAAMqF,OAAOpB,oBAC/B,MAAM+C,EAAwC,IAAhBhH,EAAMC,OAA2C,iBAATE,EACtE,GAAI6G,GACED,GAAaE,uBAAuB9G,GACtC,OAAO4G,EAAYG,wBAAwBlH,EAAOG,GAGtD,MAAMgH,EAASvG,EAAOZ,GACtB,IAAKE,EAAIiH,EAAQhH,EAAMH,EAAMC,OAC3B,OAwHN,SAA2BD,EAAOmH,EAAQhH,GACxC,MAAMsB,EAAO2F,GAAuBD,EAAQhH,GAC5C,OAAOsB,EAAO1D,KAAS0D,EAAOA,EAAK1D,GAGjC0D,EAAKxC,KAAKF,KAAKiB,EAAMqH,aACnB,CACN,CA/HaC,CAAkBtH,EAAOmH,EAAQhH,GAE1C,MAAMlC,EAAQkJ,EAAOhH,GACrB,GAAIH,EAAM+E,aAAe7G,EAAYD,GACnC,OAAOA,EAET,GAAI+I,GAAyBhH,EAAMuH,iBAAmBR,GAAaS,sBACjExH,EAAMuH,kBAjZZ,SAAsBtJ,GACpB,MAAMwJ,GAAKxJ,EACX,OAAOyJ,OAAOC,UAAUF,IAAMG,OAAOH,KAAOxJ,CAC9C,CA+YS4J,CAAa1H,GAChB,OAAOlC,EAET,GAAIA,IAAU6J,GAAK9H,EAAMc,MAAOX,GAAO,CACrC4H,GAAY/H,GACZ,MAAMgI,EAA2B,IAAhBhI,EAAMC,OAA2BE,EAAOA,EACnD8H,EAAaC,GAAYlI,EAAMqF,OAAQpH,EAAO+B,EAAOgI,GAC3D,OAAOhI,EAAMa,MAAMmH,GAAYC,CACjC,CACA,OAAOhK,CACT,EACAiC,IAAG,CAACF,EAAOG,IACI,gBAATA,GAAmC,cAATA,GAAiC,cAATA,GAG/CA,KAAQS,EAAOZ,GAExBN,QAAQM,GACCP,QAAQC,QAAQkB,EAAOZ,IAEhC,GAAAb,CAAIa,EAAOG,EAAMlC,GACf,GAAa,gBAATkC,GAAmC,cAATA,GAAiC,cAATA,EACpD,OAAO,EAET,MAAMsB,EAAO2F,GAAuBxG,EAAOZ,GAAQG,GACnD,GAAIsB,GAAMtC,IAER,OADAsC,EAAKtC,IAAIJ,KAAKiB,EAAMqH,OAAQpJ,IACrB,EAET,IAAK+B,EAAMgB,UAAW,CACpB,MAAMmH,EAAWL,GAAKlH,EAAOZ,GAAQG,GAC/BiI,EAAeD,IAAW5L,GAChC,GAAI6L,GAAgBA,EAAatH,QAAU7C,EAGzC,OAFA+B,EAAMa,MAAMV,GAAQlC,EACpB+B,EAAMoG,UAAUjH,IAAIgB,GAAM,IACnB,EAET,KApcMkI,EAocCpK,MApcEqK,EAocKH,GAlcH,IAANE,GAAW,EAAIA,GAAM,EAAIC,EAEzBD,GAAMA,GAAKC,GAAMA,UAgcgB,IAAVrK,GAAoBiC,EAAIF,EAAMc,MAAOX,EAAMH,EAAMC,QAC3E,OAAO,EACT8H,GAAY/H,GACZuI,GAAYvI,EACd,CAxcJ,IAAYqI,EAAGC,EAycX,OAAItI,EAAMa,MAAMV,KAAUlC,SACf,IAAVA,GAAoBkC,KAAQH,EAAMa,QACnC6G,OAAOc,MAAMvK,IAAUyJ,OAAOc,MAAMxI,EAAMa,MAAMV,MAEhDH,EAAMa,MAAMV,GAAQlC,EACpB+B,EAAMoG,UAAUjH,IAAIgB,GAAM,GArL9B,SAA8BK,EAAQX,EAAK5B,GACzC,MAAMoH,OAAEA,GAAW7E,EACnB,GAAIxC,EAAQC,GAAQ,CAClB,MAAM+B,EAAQ/B,EAAM1B,GAChBuI,EAAY9E,EAAOqF,IACrBrF,EAAMgF,WAAWgB,KAAK,WACpB+B,GAAYvH,GACZ,MAAMkF,EAAiB3E,EAAcf,GACrCuF,EAAoB/E,EAAQvC,EAAOyH,EAAgB7F,EACrD,EAEJ,MAAW3B,EAAYD,IACrBuC,EAAOwE,WAAWgB,KAAK,WACrB,MAAMyC,EAAa7H,EAAOJ,GACL,IAAjBA,EAAOP,MACLwI,EAAWvI,IAAIjC,IACjB4G,GAAY5G,EAAOoH,EAAOvB,YAAauB,GAGrCpG,EAAIwJ,EAAY5I,EAAKW,EAAOP,SAAWhC,GACrCoH,EAAO/B,QAAQ9B,OAAS,IAA8C,KAAxChB,EAAO4F,UAAUnH,IAAIY,KAAQ,IAAmBW,EAAOK,OACvFgE,GACE5F,EAAIuB,EAAOK,MAAOhB,EAAKW,EAAOP,OAC9BoF,EAAOvB,YACPuB,EAKV,EAEJ,CAuJIqD,CAAqB1I,EAAOG,EAAMlC,KAHzB,CAKX,EACA0K,eAAc,CAAC3I,EAAOG,KACpB4H,GAAY/H,QACoB,IAA5B8H,GAAK9H,EAAMc,MAAOX,IAAoBA,KAAQH,EAAMc,OACtDd,EAAMoG,UAAUjH,IAAIgB,GAAM,GAC1BoI,GAAYvI,IAEZA,EAAMoG,UAAUlE,OAAO/B,GAErBH,EAAMa,cACDb,EAAMa,MAAMV,IAEd,GAIT,wBAAAyI,CAAyB5I,EAAOG,GAC9B,MAAM0I,EAAQjI,EAAOZ,GACfyB,EAAOhC,QAAQmJ,yBAAyBC,EAAO1I,GACrD,OAAKsB,EAEE,CACL3D,CAACA,IAAW,EACZF,CAACA,GAA+B,IAAhBoC,EAAMC,OAAoC,WAATE,EACjDtC,CAACA,GAAa4D,EAAK5D,GACnBE,CAACA,GAAQ8K,EAAM1I,IALRsB,CAOX,EACA,cAAAqH,GACE/L,EAAI,GACN,EACAU,eAAeuC,GACNvC,EAAeuC,EAAMc,OAE9B,cAAAiI,GACEhM,EAAI,GACN,GAEEiM,GAAa,CAAA,EACjB,IAAK,IAAInJ,KAAO8G,GAAa,CAC3B,IAAIsC,EAAKtC,GAAY9G,GACrBmJ,GAAWnJ,GAAO,WAChB,MAAM5C,EAAOiM,UAEb,OADAjM,EAAK,GAAKA,EAAK,GAAG,GACXgM,EAAG5L,MAAM8L,KAAMlM,EACxB,CACF,CAWA,SAAS6K,GAAK5D,EAAO/D,GACnB,MAAMH,EAAQkE,EAAM3H,GAEpB,OADeyD,EAAQY,EAAOZ,GAASkE,GACzB/D,EAChB,CASA,SAASiH,GAAuBD,EAAQhH,GACtC,KAAMA,KAAQgH,GACZ,OACF,IAAIvI,EAAQnB,EAAe0J,GAC3B,KAAOvI,GAAO,CACZ,MAAM6C,EAAOjE,OAAOoL,yBAAyBhK,EAAOuB,GACpD,GAAIsB,EACF,OAAOA,EACT7C,EAAQnB,EAAemB,EACzB,CAEF,CACA,SAAS2J,GAAYvI,GACdA,EAAMgB,YACThB,EAAMgB,WAAY,EACdhB,EAAMwD,SACR+E,GAAYvI,EAAMwD,SAGxB,CACA,SAASuE,GAAY/H,GACdA,EAAMa,QACTb,EAAMoG,UAA4B,IAAI3F,IACtCT,EAAMa,MAAQI,EACZjB,EAAMc,MACNd,EAAMqF,OAAO1B,OAAOyF,uBAG1B,CAnDAJ,GAAWL,eAAiB,SAAS3I,EAAOG,GAG1C,MAF6B,eAAzB1D,QAAQC,IAAIC,UAA6B6L,MAAMa,SAASlJ,KAC1DpD,EAAI,IACCiM,GAAW7J,IAAIJ,KAAKoK,KAAMnJ,EAAOG,OAAM,EAChD,EACA6I,GAAW7J,IAAM,SAASa,EAAOG,EAAMlC,GAGrC,MAF6B,eAAzBxB,QAAQC,IAAIC,UAAsC,WAATwD,GAAqBqI,MAAMa,SAASlJ,KAC/EpD,EAAI,IACC4J,GAAYxH,IAAIJ,KAAKoK,KAAMnJ,EAAM,GAAIG,EAAMlC,EAAO+B,EAAM,GACjE,EA6CG,IAACsJ,GAAS,MACX,WAAAC,CAAYC,GACVL,KAAKzE,aAAc,EACnByE,KAAKC,uBAAwB,EAC7BD,KAAKM,qBAAsB,EAoB3BN,KAAKO,QAAU,CAACxI,EAAMyI,EAAQ5G,KAC5B,GAAI3F,EAAW8D,KAAU9D,EAAWuM,GAAS,CAC3C,MAAMC,EAAcD,EACpBA,EAASzI,EACT,MAAM2I,EAAOV,KACb,OAAO,SAAwBW,EAAQF,KAAgB3M,GACrD,OAAO4M,EAAKH,QAAQI,EAAQ5F,GAAUyF,EAAO5K,KAAKoK,KAAMjF,KAAUjH,GACpE,CACF,CAKA,IAAIqH,EACJ,GALKlH,EAAWuM,IACd5M,EAAI,QACgB,IAAlBgG,GAA6B3F,EAAW2F,IAC1ChG,EAAI,GAEFmB,EAAYgD,GAAO,CACrB,MAAM4B,EAAQW,EAAW0F,MACnBY,EAAQ7B,GAAYpF,EAAO5B,OAAM,GACvC,IAAI8I,GAAW,EACf,IACE1F,EAASqF,EAAOI,GAChBC,GAAW,CACb,CAAC,QACKA,EACF5G,EAAYN,GAEZO,EAAWP,EACf,CAEA,OADAD,EAAkBC,EAAOC,GAClBsB,EAAcC,EAAQxB,EAC/B,CAAO,IAAK5B,IAASvC,EAAYuC,GAAO,CAQtC,GAPAoD,EAASqF,EAAOzI,QACD,IAAXoD,IACFA,EAASpD,GACPoD,IAAWnI,IACbmI,OAAS,GACP6E,KAAKzE,aACP9C,EAAO0C,GAAQ,GACbvB,EAAe,CACjB,MAAMkH,EAAI,GACJC,EAAK,GACX1H,EAAUH,GAAeoC,4BAA4BvD,EAAMoD,EAAQ,CACjErB,SAAUgH,EACV/G,gBAAiBgH,IAEnBnH,EAAckH,EAAGC,EACnB,CACA,OAAO5F,CACT,CACEvH,EAAI,EAAGmE,IAEXiI,KAAKgB,mBAAqB,CAACjJ,EAAMyI,KAC/B,GAAIvM,EAAW8D,GACb,MAAO,CAAClB,KAAU/C,IAASkM,KAAKgB,mBAAmBnK,EAAQkE,GAAUhD,EAAKgD,KAAUjH,IAEtF,IAAImN,EAASC,EAKb,MAAO,CAJQlB,KAAKO,QAAQxI,EAAMyI,EAAQ,CAACM,EAAGC,KAC5CE,EAAUH,EACVI,EAAiBH,IAEHE,EAASC,IAEvB1J,EAAU6I,GAAQc,aACpBnB,KAAKoB,cAAcf,EAAOc,YACxB3J,EAAU6I,GAAQgB,uBACpBrB,KAAKsB,wBAAwBjB,EAAOgB,sBAClC7J,EAAU6I,GAAQkB,qBACpBvB,KAAKwB,sBAAsBnB,EAAOkB,mBACtC,CACA,WAAAE,CAAY1J,GACLhD,EAAYgD,IACfnE,EAAI,GACFiB,EAAQkD,KACVA,EAAO2J,GAAQ3J,IACjB,MAAM4B,EAAQW,EAAW0F,MACnBY,EAAQ7B,GAAYpF,EAAO5B,OAAM,GAGvC,OAFA6I,EAAMxN,GAAauO,WAAY,EAC/BzH,EAAWP,GACJiH,CACT,CACA,WAAAgB,CAAY7G,EAAOnB,GACjB,MAAM/C,EAAQkE,GAASA,EAAM3H,GACxByD,GAAUA,EAAM8K,WACnB/N,EAAI,GACN,MAAQsI,OAAQvC,GAAU9C,EAE1B,OADA6C,EAAkBC,EAAOC,GAClBsB,OAAc,EAAQvB,EAC/B,CAMA,aAAAyH,CAActM,GACZkL,KAAKzE,YAAczG,CACrB,CAMA,uBAAAwM,CAAwBxM,GACtBkL,KAAKC,sBAAwBnL,CAC/B,CAOA,qBAAA0M,CAAsB1M,GACpBkL,KAAKM,oBAAsBxL,CAC7B,CACA,wBAAA+M,GACE,OAAO7B,KAAKM,mBACd,CACA,YAAAwB,CAAa/J,EAAMkJ,GACjB,IAAI7I,EACJ,IAAKA,EAAI6I,EAAQ5I,OAAS,EAAGD,GAAK,EAAGA,IAAK,CACxC,MAAM2J,EAAQd,EAAQ7I,GACtB,GAA0B,IAAtB2J,EAAMC,KAAK3J,QAA6B,YAAb0J,EAAME,GAAkB,CACrDlK,EAAOgK,EAAMjN,MACb,KACF,CACF,CACIsD,GAAI,IACN6I,EAAUA,EAAQjJ,MAAMI,EAAI,IAE9B,MAAM8J,EAAmB7I,EAAUH,GAAeiJ,cAClD,OAAItN,EAAQkD,GACHmK,EAAiBnK,EAAMkJ,GAEzBjB,KAAKO,QACVxI,EACCgD,GAAUmH,EAAiBnH,EAAOkG,GAEvC,GAEF,SAASlC,GAAYtD,EAAW3G,EAAOuH,EAAQ3F,GAC7C,MAAOqE,EAAOlE,GAAS3B,EAAMJ,GAASuE,EAAUJ,GAAcmJ,UAAUtN,EAAOuH,GAAUlH,EAAML,GAASuE,EAAUJ,GAAcoJ,UAAUvN,EAAOuH,GAvYnJ,SAA0BtE,EAAMsE,GAC9B,MAAMiG,EAAcrN,EAAQ8C,GACtBlB,EAAQ,CACZC,MAAOwL,EAAc,EAAgB,EAErCpG,OAAQG,EAASA,EAAOH,OAASzC,IAEjC5B,WAAW,EAEX+D,YAAY,EAGZqB,eAAW,EAEX5C,QAASgC,EAET1E,MAAOI,EAEPmG,OAAQ,KAGRxG,MAAO,KAEPsD,QAAS,KACT2G,WAAW,EAEX9F,gBAAY,GAEd,IAAIxE,EAASR,EACT0L,EAAQ/E,GACR8E,IACFjL,EAAS,CAACR,GACV0L,EAAQ1C,IAEV,MAAM2C,OAAEA,EAAM5B,MAAEA,GAAUlD,MAAM+E,UAAUpL,EAAQkL,GAGlD,OAFA1L,EAAMqH,OAAS0C,EACf/J,EAAMmE,QAAUwH,EACT,CAAC5B,EAAO/J,EACjB,CAiW6J6L,CAAiB5N,EAAOuH,GAgBnL,OAfcA,GAAQH,QAAUzC,KAC1BU,QAAQ0C,KAAK9B,GACnBlE,EAAMgF,WAAaQ,GAAQR,YAAc,GACzChF,EAAM8L,KAAOjM,EACT2F,QAAkB,IAAR3F,EA7dhB,SAA2C2F,EAAQuG,EAAOlM,GACxD2F,EAAOR,WAAWgB,KAAK,SAAsBpB,GAC3C,MAAM5E,EAAQ+L,EACd,IAAK/L,IAAU8E,EAAY9E,EAAO4E,GAChC,OAEFA,EAAUZ,eAAegI,eAAehM,GACxC,MAAM0F,EAAiB3E,EAAcf,GACrCuF,EAAoBC,EAAQxF,EAAMqH,QAAUrH,EAAO0F,EAAgB7F,GACnEsF,GAA2BnF,EAAO4E,EACpC,EACF,CAmdIqH,CAAkCzG,EAAQxF,EAAOH,GAEjDG,EAAMgF,WAAWgB,KAAK,SAA0BkG,GAC9CA,EAAWlI,eAAegI,eAAehM,GACzC,MAAMgD,aAAEA,GAAiBkJ,EACrBlM,EAAMgB,WAAagC,GACrBA,EAAawD,iBAAiBxG,EAAO,GAAIkM,EAE7C,GAEKhI,CACT,CAGA,SAAS2G,GAAQ5M,GAGf,OAFKD,EAAQC,IACXlB,EAAI,GAAIkB,GACHkO,GAAYlO,EACrB,CACA,SAASkO,GAAYlO,GACnB,IAAKC,EAAYD,IAAU6D,EAAS7D,GAClC,OAAOA,EACT,MAAM+B,EAAQ/B,EAAM1B,GACpB,IAAI6P,EACA7M,GAAS,EACb,GAAIS,EAAO,CACT,IAAKA,EAAMgB,UACT,OAAOhB,EAAMc,MACfd,EAAM+E,YAAa,EACnBqH,EAAOnL,EAAYhD,EAAO+B,EAAMqF,OAAO1B,OAAOyF,uBAC9C7J,EAASS,EAAMqF,OAAO1B,OAAOqH,0BAC/B,MACEoB,EAAOnL,EAAYhD,GAAO,GAY5B,OAVAmB,EACEgN,EACA,CAACvM,EAAKwM,KACJlN,EAAIiN,EAAMvM,EAAKsM,GAAYE,KAE7B9M,GAEES,IACFA,EAAM+E,YAAa,GAEdqH,CACT,CAivBA,IACI1C,IADQ,IAAIJ,IACII","x_google_ignoreList":[0]}
@@ -0,0 +1,2 @@
1
+ function e(e){var n,t,r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},s=r.message,u=r.referer;if(!e)return!1;null===(t=e.setOpen)||void 0===t||t.call(e,!0);var i,a=null!==(n=null==s?void 0:s.trim())&&void 0!==n?n:"";return a?!(l(e)||!e.sendMessage)&&(e.sendMessage({text:a},u?{headers:{"x-algolia-referer":u}}:void 0),!0):(null===(i=e.focusInput)||void 0===i||i.call(e),!1)}function l(e){return"submitted"===(null==e?void 0:e.status)||"streaming"===(null==e?void 0:e.status)}export{l as isChatBusy,e as openChat};
2
+ //# sourceMappingURL=openChat.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"openChat.js","sources":["../../../../../../../node_modules/instantsearch.js/es/lib/chat/openChat.js"],"sourcesContent":["// Centralizes the \"open the chat from an entry point\" behavior shared by the\n// SearchBox AI button, the Autocomplete AI button, prompt suggestions, and any\n// future entry point. The chat is always opened; the message is only sent when\n// it is non-empty and the chat is not already processing a message.\n// Returns true when a message was submitted, so callers can clear their input.\nfunction openChat(chatRenderState) {\n var _ref = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, message = _ref.message, referer = _ref.referer;\n var _ref1;\n var _chatRenderState_setOpen;\n if (!chatRenderState) {\n return false;\n }\n (_chatRenderState_setOpen = chatRenderState.setOpen) === null || _chatRenderState_setOpen === void 0 ? void 0 : _chatRenderState_setOpen.call(chatRenderState, true);\n var trimmed = (_ref1 = message === null || message === void 0 ? void 0 : message.trim()) !== null && _ref1 !== void 0 ? _ref1 : '';\n if (!trimmed) {\n var _chatRenderState_focusInput;\n (_chatRenderState_focusInput = chatRenderState.focusInput) === null || _chatRenderState_focusInput === void 0 ? void 0 : _chatRenderState_focusInput.call(chatRenderState);\n return false;\n }\n if (isChatBusy(chatRenderState) || !chatRenderState.sendMessage) {\n return false;\n }\n chatRenderState.sendMessage({\n text: trimmed\n }, referer ? {\n headers: {\n 'x-algolia-referer': referer\n }\n } : undefined);\n return true;\n}\nfunction isChatBusy(chatRenderState) {\n return (chatRenderState === null || chatRenderState === void 0 ? void 0 : chatRenderState.status) === 'submitted' || (chatRenderState === null || chatRenderState === void 0 ? void 0 : chatRenderState.status) === 'streaming';\n}\n\nexport { isChatBusy, openChat };\n"],"names":["openChat","chatRenderState","_ref1","_chatRenderState_setOpen","_ref","arguments","length","message","referer","setOpen","call","_chatRenderState_focusInput","trimmed","trim","isChatBusy","sendMessage","text","headers","undefined","focusInput","status"],"mappings":"AAKA,SAASA,EAASC,GACd,IACIC,EACAC,EAFAC,EAAOC,UAAUC,OAAS,QAAsB,IAAjBD,UAAU,GAAgBA,UAAU,GAAK,CAAA,EAAIE,EAAUH,EAAKG,QAASC,EAAUJ,EAAKI,QAGvH,IAAKP,EACD,OAAO,EAE8C,QAAxDE,EAA2BF,EAAgBQ,eAAkD,IAA7BN,GAA+CA,EAAyBO,KAAKT,GAAiB,GAC/J,IAEQU,EAFJC,EAAyF,QAA9EV,EAAQK,aAAyC,EAASA,EAAQM,cAA8B,IAAVX,EAAmBA,EAAQ,GAChI,OAAKU,IAKDE,EAAWb,KAAqBA,EAAgBc,eAGpDd,EAAgBc,YAAY,CACxBC,KAAMJ,GACPJ,EAAU,CACTS,QAAS,CACL,oBAAqBT,SAEzBU,IACG,IAb4D,QAA9DP,EAA8BV,EAAgBkB,kBAAwD,IAAhCR,GAAkDA,EAA4BD,KAAKT,IACnJ,EAaf,CACA,SAASa,EAAWb,GAChB,MAAsG,eAA9FA,aAAyD,EAASA,EAAgBmB,SAA0H,eAA9FnB,aAAyD,EAASA,EAAgBmB,OAC5M","x_google_ignoreList":[0]}
@@ -1,2 +1,2 @@
1
- import{unescape as i}from"./escape-html.js";var e=new RegExp(/\w/i);function t(t,l){var o,d,g=t[l],h=(null===(o=t[l+1])||void 0===o?void 0:o.isHighlighted)||!0,r=(null===(d=t[l-1])||void 0===d?void 0:d.isHighlighted)||!0;return e.test(i(g.value))||r!==h?g.isHighlighted:r}export{t as getHighlightFromSiblings};
1
+ import{unescape as i}from"./escape-html.js";var l=new RegExp(/\w/i);function e(e,o){var t,d,v,n,g=e[o],h=null===(t=null===(v=e[o+1])||void 0===v?void 0:v.isHighlighted)||void 0===t||t,r=null===(d=null===(n=e[o-1])||void 0===n?void 0:n.isHighlighted)||void 0===d||d;return l.test(i(g.value))||r!==h?g.isHighlighted:r}export{e as getHighlightFromSiblings};
2
2
  //# sourceMappingURL=getHighlightFromSiblings.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"getHighlightFromSiblings.js","sources":["../../../../../../../node_modules/instantsearch.js/es/lib/utils/getHighlightFromSiblings.js"],"sourcesContent":["import { unescape } from './escape-html.js';\n\nvar hasAlphanumeric = new RegExp(/\\w/i);\nfunction getHighlightFromSiblings(parts, i) {\n var _parts_, _parts_1;\n var current = parts[i];\n var isNextHighlighted = ((_parts_ = parts[i + 1]) === null || _parts_ === void 0 ? void 0 : _parts_.isHighlighted) || true;\n var isPreviousHighlighted = ((_parts_1 = parts[i - 1]) === null || _parts_1 === void 0 ? void 0 : _parts_1.isHighlighted) || true;\n if (!hasAlphanumeric.test(unescape(current.value)) && isPreviousHighlighted === isNextHighlighted) {\n return isPreviousHighlighted;\n }\n return current.isHighlighted;\n}\n\nexport { getHighlightFromSiblings };\n"],"names":["hasAlphanumeric","RegExp","getHighlightFromSiblings","parts","i","_parts_","_parts_1","current","isNextHighlighted","isHighlighted","isPreviousHighlighted","test","unescape","value"],"mappings":"4CAEA,IAAIA,EAAkB,IAAIC,OAAO,OACjC,SAASC,EAAyBC,EAAOC,GACrC,IAAIC,EAASC,EACTC,EAAUJ,EAAMC,GAChBI,GAAkD,QAA5BH,EAAUF,EAAMC,EAAI,UAA4B,IAAZC,OAAqB,EAASA,EAAQI,iBAAkB,EAClHC,GAAuD,QAA7BJ,EAAWH,EAAMC,EAAI,UAA6B,IAAbE,OAAsB,EAASA,EAASG,iBAAkB,EAC7H,OAAKT,EAAgBW,KAAKC,EAASL,EAAQM,SAAWH,IAA0BF,EAGzED,EAAQE,cAFJC,CAGf","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"getHighlightFromSiblings.js","sources":["../../../../../../../node_modules/instantsearch.js/es/lib/utils/getHighlightFromSiblings.js"],"sourcesContent":["import { unescape } from './escape-html.js';\n\nvar hasAlphanumeric = new RegExp(/\\w/i);\nfunction getHighlightFromSiblings(parts, i) {\n var _ref, _ref1;\n var _parts_, _parts_1;\n var current = parts[i];\n var isNextHighlighted = (_ref = (_parts_ = parts[i + 1]) === null || _parts_ === void 0 ? void 0 : _parts_.isHighlighted) !== null && _ref !== void 0 ? _ref : true;\n var isPreviousHighlighted = (_ref1 = (_parts_1 = parts[i - 1]) === null || _parts_1 === void 0 ? void 0 : _parts_1.isHighlighted) !== null && _ref1 !== void 0 ? _ref1 : true;\n if (!hasAlphanumeric.test(unescape(current.value)) && isPreviousHighlighted === isNextHighlighted) {\n return isPreviousHighlighted;\n }\n return current.isHighlighted;\n}\n\nexport { getHighlightFromSiblings };\n"],"names":["hasAlphanumeric","RegExp","getHighlightFromSiblings","parts","i","_ref","_ref1","_parts_","_parts_1","current","isNextHighlighted","isHighlighted","isPreviousHighlighted","test","unescape","value"],"mappings":"4CAEA,IAAIA,EAAkB,IAAIC,OAAO,OACjC,SAASC,EAAyBC,EAAOC,GACrC,IAAIC,EAAMC,EACNC,EAASC,EACTC,EAAUN,EAAMC,GAChBM,EAA0H,QAArGL,EAAoC,QAA5BE,EAAUJ,EAAMC,EAAI,UAA4B,IAAZG,OAAqB,EAASA,EAAQI,qBAAoC,IAATN,GAAkBA,EACpJO,EAAkI,QAAzGN,EAAsC,QAA7BE,EAAWL,EAAMC,EAAI,UAA6B,IAAbI,OAAsB,EAASA,EAASG,qBAAqC,IAAVL,GAAmBA,EACjK,OAAKN,EAAgBa,KAAKC,EAASL,EAAQM,SAAWH,IAA0BF,EAGzED,EAAQE,cAFJC,CAGf","x_google_ignoreList":[0]}
@@ -1,2 +1,2 @@
1
- var a="4.97.0";export{a as default};
1
+ var a="4.104.0";export{a as default};
2
2
  //# sourceMappingURL=version.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"version.js","sources":["../../../../../../node_modules/instantsearch.js/es/lib/version.js"],"sourcesContent":["var version = '4.97.0';\n\nexport { version as default };\n"],"names":["version"],"mappings":"AAAG,IAACA,EAAU","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"version.js","sources":["../../../../../../node_modules/instantsearch.js/es/lib/version.js"],"sourcesContent":["var version = '4.104.0';\n\nexport { version as default };\n"],"names":["version"],"mappings":"AAAG,IAACA,EAAU","x_google_ignoreList":[0]}
@@ -1,2 +1,2 @@
1
- import{__require as e}from"./utils.js";var r,t;function i(){if(t)return r;t=1;var i=e(),o=Object.prototype.hasOwnProperty,a=Array.isArray,n={allowDots:!1,allowEmptyArrays:!1,allowPrototypes:!1,allowSparse:!1,arrayLimit:20,charset:"utf-8",charsetSentinel:!1,comma:!1,decodeDotInKeys:!1,decoder:i.decode,delimiter:"&",depth:5,duplicates:"combine",ignoreQueryPrefix:!1,interpretNumericEntities:!1,parameterLimit:1e3,parseArrays:!0,plainObjects:!1,strictDepth:!1,strictMerge:!0,strictNullHandling:!1,throwOnLimitExceeded:!1},l=function(e){return e.replace(/&#(\d+);/g,function(e,r){return String.fromCharCode(parseInt(r,10))})},c=function(e,r,t){if(e&&"string"==typeof e&&r.comma&&e.indexOf(",")>-1)return e.split(",");if(r.throwOnLimitExceeded&&t>=r.arrayLimit)throw new RangeError("Array limit exceeded. Only "+r.arrayLimit+" element"+(1===r.arrayLimit?"":"s")+" allowed in an array.");return e},s=function(e,r,t,a){if(e){var n=function(e,r){var t=r.allowDots?e.replace(/\.([^.[]+)/g,"[$1]"):e;if(r.depth<=0){if(!r.plainObjects&&o.call(Object.prototype,t)&&!r.allowPrototypes)return;return[t]}var i=/(\[[^[\]]*])/g,a=/(\[[^[\]]*])/.exec(t),n=a?t.slice(0,a.index):t,l=[];if(n){if(!r.plainObjects&&o.call(Object.prototype,n)&&!r.allowPrototypes)return;l[l.length]=n}for(var c=0;null!==(a=i.exec(t))&&c<r.depth;){c+=1;var s=a[1].slice(1,-1);if(!r.plainObjects&&o.call(Object.prototype,s)&&!r.allowPrototypes)return;l[l.length]=a[1]}if(a){if(!0===r.strictDepth)throw new RangeError("Input depth exceeded depth option of "+r.depth+" and strictDepth is true");l[l.length]="["+t.slice(a.index)+"]"}return l}(e,t);if(n)return function(e,r,t,o){var a=0;if(e.length>0&&"[]"===e[e.length-1]){var n=e.slice(0,-1).join("");a=Array.isArray(r)&&r[n]?r[n].length:0}for(var l=o?r:c(r,t,a),s=e.length-1;s>=0;--s){var p,d=e[s];if("[]"===d&&t.parseArrays)p=i.isOverflow(l)?l:t.allowEmptyArrays&&(""===l||t.strictNullHandling&&null===l)?[]:i.combine([],l,t.arrayLimit,t.plainObjects);else{p=t.plainObjects?{__proto__:null}:{};var y="["===d.charAt(0)&&"]"===d.charAt(d.length-1)?d.slice(1,-1):d,m=t.decodeDotInKeys?y.replace(/%2E/g,"."):y,f=parseInt(m,10),u=!isNaN(f)&&d!==m&&String(f)===m&&f>=0&&t.parseArrays;if(t.parseArrays||""!==m)if(u&&f<t.arrayLimit)(p=[])[f]=l;else{if(u&&t.throwOnLimitExceeded)throw new RangeError("Array limit exceeded. Only "+t.arrayLimit+" element"+(1===t.arrayLimit?"":"s")+" allowed in an array.");u?(p[f]=l,i.markOverflow(p,f)):"__proto__"!==m&&(p[m]=l)}else p={0:l}}l=p}return l}(n,r,t,a)}};return r=function(e,r){var t=function(e){if(!e)return n;if(void 0!==e.allowEmptyArrays&&"boolean"!=typeof e.allowEmptyArrays)throw new TypeError("`allowEmptyArrays` option can only be `true` or `false`, when provided");if(void 0!==e.decodeDotInKeys&&"boolean"!=typeof e.decodeDotInKeys)throw new TypeError("`decodeDotInKeys` option can only be `true` or `false`, when provided");if(null!==e.decoder&&void 0!==e.decoder&&"function"!=typeof e.decoder)throw new TypeError("Decoder has to be a function.");if(void 0!==e.charset&&"utf-8"!==e.charset&&"iso-8859-1"!==e.charset)throw new TypeError("The charset option must be either utf-8, iso-8859-1, or undefined");if(void 0!==e.throwOnLimitExceeded&&"boolean"!=typeof e.throwOnLimitExceeded)throw new TypeError("`throwOnLimitExceeded` option must be a boolean");var r=void 0===e.charset?n.charset:e.charset,t=void 0===e.duplicates?n.duplicates:e.duplicates;if("combine"!==t&&"first"!==t&&"last"!==t)throw new TypeError("The duplicates option must be either combine, first, or last");return{allowDots:void 0===e.allowDots?!0===e.decodeDotInKeys||n.allowDots:!!e.allowDots,allowEmptyArrays:"boolean"==typeof e.allowEmptyArrays?!!e.allowEmptyArrays:n.allowEmptyArrays,allowPrototypes:"boolean"==typeof e.allowPrototypes?e.allowPrototypes:n.allowPrototypes,allowSparse:"boolean"==typeof e.allowSparse?e.allowSparse:n.allowSparse,arrayLimit:"number"==typeof e.arrayLimit?e.arrayLimit:n.arrayLimit,charset:r,charsetSentinel:"boolean"==typeof e.charsetSentinel?e.charsetSentinel:n.charsetSentinel,comma:"boolean"==typeof e.comma?e.comma:n.comma,decodeDotInKeys:"boolean"==typeof e.decodeDotInKeys?e.decodeDotInKeys:n.decodeDotInKeys,decoder:"function"==typeof e.decoder?e.decoder:n.decoder,delimiter:"string"==typeof e.delimiter||i.isRegExp(e.delimiter)?e.delimiter:n.delimiter,depth:"number"==typeof e.depth||!1===e.depth?+e.depth:n.depth,duplicates:t,ignoreQueryPrefix:!0===e.ignoreQueryPrefix,interpretNumericEntities:"boolean"==typeof e.interpretNumericEntities?e.interpretNumericEntities:n.interpretNumericEntities,parameterLimit:"number"==typeof e.parameterLimit?e.parameterLimit:n.parameterLimit,parseArrays:!1!==e.parseArrays,plainObjects:"boolean"==typeof e.plainObjects?e.plainObjects:n.plainObjects,strictDepth:"boolean"==typeof e.strictDepth?!!e.strictDepth:n.strictDepth,strictMerge:"boolean"==typeof e.strictMerge?!!e.strictMerge:n.strictMerge,strictNullHandling:"boolean"==typeof e.strictNullHandling?e.strictNullHandling:n.strictNullHandling,throwOnLimitExceeded:"boolean"==typeof e.throwOnLimitExceeded&&e.throwOnLimitExceeded}}(r);if(""===e||null==e)return t.plainObjects?{__proto__:null}:{};for(var p="string"==typeof e?function(e,r){var t={__proto__:null},s=r.ignoreQueryPrefix?e.replace(/^\?/,""):e;s=s.replace(/%5B/gi,"[").replace(/%5D/gi,"]");var p=r.parameterLimit===1/0?void 0:r.parameterLimit,d=s.split(r.delimiter,r.throwOnLimitExceeded&&void 0!==p?p+1:p);if(r.throwOnLimitExceeded&&void 0!==p&&d.length>p)throw new RangeError("Parameter limit exceeded. Only "+p+" parameter"+(1===p?"":"s")+" allowed.");var y,m=-1,f=r.charset;if(r.charsetSentinel)for(y=0;y<d.length;++y)0===d[y].indexOf("utf8=")&&("utf8=%E2%9C%93"===d[y]?f="utf-8":"utf8=%26%2310003%3B"===d[y]&&(f="iso-8859-1"),m=y,y=d.length);for(y=0;y<d.length;++y)if(y!==m){var u,h,w=d[y],b=w.indexOf("]="),g=-1===b?w.indexOf("="):b+1;if(-1===g?(u=r.decoder(w,n.decoder,f,"key"),h=r.strictNullHandling?null:""):null!==(u=r.decoder(w.slice(0,g),n.decoder,f,"key"))&&(h=i.maybeMap(c(w.slice(g+1),r,a(t[u])?t[u].length:0),function(e){return r.decoder(e,n.decoder,f,"value")})),h&&r.interpretNumericEntities&&"iso-8859-1"===f&&(h=l(String(h))),w.indexOf("[]=")>-1&&(h=a(h)?[h]:h),r.comma&&a(h)&&h.length>r.arrayLimit){if(r.throwOnLimitExceeded)throw new RangeError("Array limit exceeded. Only "+r.arrayLimit+" element"+(1===r.arrayLimit?"":"s")+" allowed in an array.");h=i.combine([],h,r.arrayLimit,r.plainObjects)}if(null!==u){var O=o.call(t,u);O&&("combine"===r.duplicates||w.indexOf("[]=")>-1)?t[u]=i.combine(t[u],h,r.arrayLimit,r.plainObjects):O&&"last"!==r.duplicates||(t[u]=h)}}return t}(e,t):e,d=t.plainObjects?{__proto__:null}:{},y=Object.keys(p),m=0;m<y.length;++m){var f=y[m],u=s(f,p[f],t,"string"==typeof e);d=i.merge(d,u,t)}return!0===t.allowSparse?d:i.compact(d)}}export{i as __require};
1
+ import{__require as e}from"./utils.js";var r,t;function i(){if(t)return r;t=1;var i=e(),o=Object.prototype.hasOwnProperty,a=Array.isArray,n={allowDots:!1,allowEmptyArrays:!1,allowPrototypes:!1,allowSparse:!1,arrayLimit:20,charset:"utf-8",charsetSentinel:!1,comma:!1,decodeDotInKeys:!1,decoder:i.decode,delimiter:"&",depth:5,duplicates:"combine",ignoreQueryPrefix:!1,interpretNumericEntities:!1,parameterLimit:1e3,parseArrays:!0,plainObjects:!1,strictDepth:!1,strictMerge:!0,strictNullHandling:!1,throwOnLimitExceeded:!1},l=function(e){return e.replace(/&#(\d+);/g,function(e,r){return String.fromCharCode(parseInt(r,10))})},c=function(e,r,t,i){if(e&&"string"==typeof e&&r.comma&&e.indexOf(",")>-1){if(i&&r.throwOnLimitExceeded)for(var o=0,a=e.indexOf(",");a>-1;){if((o+=1)>=r.arrayLimit)throw new RangeError("Array limit exceeded. Only "+r.arrayLimit+" element"+(1===r.arrayLimit?"":"s")+" allowed in an array.");a=e.indexOf(",",a+1)}return e.split(",")}if(r.throwOnLimitExceeded&&t>=r.arrayLimit)throw new RangeError("Array limit exceeded. Only "+r.arrayLimit+" element"+(1===r.arrayLimit?"":"s")+" allowed in an array.");return e},s=function(e,r,t,a){if(e){var n=function(e,r){var t=r.allowDots?e.replace(/\.([^.[]+)/g,"[$1]"):e;if(r.depth<=0){if(!r.plainObjects&&o.call(Object.prototype,t)&&!r.allowPrototypes)return;return[t]}var i=[],a=t.indexOf("["),n=a>=0?t.slice(0,a):t;if(n){if(!r.plainObjects&&o.call(Object.prototype,n)&&!r.allowPrototypes)return;i[i.length]=n}for(var l=t.length,c=a,s=0;c>=0&&s<r.depth;){for(var d=1,p=c+1,y=-1;p<l&&y<0;){var m=t.charCodeAt(p);91===m?d+=1:93===m&&0==(d-=1)&&(y=p),p+=1}if(y<0)return i[i.length]="["+t.slice(c)+"]",i;var f=t.slice(c,y+1),u=f.slice(1,-1);if(!r.plainObjects&&o.call(Object.prototype,u)&&!r.allowPrototypes)return;i[i.length]=f,s+=1,c=t.indexOf("[",y+1)}if(c>=0){if(!0===r.strictDepth)throw new RangeError("Input depth exceeded depth option of "+r.depth+" and strictDepth is true");i[i.length]="["+t.slice(c)+"]"}return i}(e,t);if(n)return function(e,r,t,o){var a=0;if(e.length>0&&"[]"===e[e.length-1]){var n=e.slice(0,-1).join("");a=Array.isArray(r)&&r[n]?r[n].length:0}for(var l=o?r:c(r,t,a),s=e.length-1;s>=0;--s){var d,p=e[s];if("[]"===p&&t.parseArrays)d=i.isOverflow(l)?l:t.allowEmptyArrays&&(""===l||t.strictNullHandling&&null===l)?[]:i.combine([],l,t.arrayLimit,t.plainObjects,t.throwOnLimitExceeded);else{d=t.plainObjects?{__proto__:null}:{};var y="["===p.charAt(0)&&"]"===p.charAt(p.length-1)?p.slice(1,-1):p,m=t.decodeDotInKeys?y.replace(/%2E/g,"."):y,f=parseInt(m,10),u=!isNaN(f)&&p!==m&&String(f)===m&&f>=0&&t.parseArrays;if(t.parseArrays||""!==m)if(u&&f<t.arrayLimit)(d=[])[f]=l;else{if(u&&t.throwOnLimitExceeded)throw new RangeError("Array limit exceeded. Only "+t.arrayLimit+" element"+(1===t.arrayLimit?"":"s")+" allowed in an array.");u?(d[f]=l,i.markOverflow(d,f)):"__proto__"!==m&&(d[m]=l)}else d={0:l}}l=d}return l}(n,r,t,a)}};return r=function(e,r){var t=function(e){if(!e)return n;if(void 0!==e.allowEmptyArrays&&"boolean"!=typeof e.allowEmptyArrays)throw new TypeError("`allowEmptyArrays` option can only be `true` or `false`, when provided");if(void 0!==e.decodeDotInKeys&&"boolean"!=typeof e.decodeDotInKeys)throw new TypeError("`decodeDotInKeys` option can only be `true` or `false`, when provided");if(null!==e.decoder&&void 0!==e.decoder&&"function"!=typeof e.decoder)throw new TypeError("Decoder has to be a function.");if(void 0!==e.charset&&"utf-8"!==e.charset&&"iso-8859-1"!==e.charset)throw new TypeError("The charset option must be either utf-8, iso-8859-1, or undefined");if(void 0!==e.throwOnLimitExceeded&&"boolean"!=typeof e.throwOnLimitExceeded)throw new TypeError("`throwOnLimitExceeded` option must be a boolean");var r=void 0===e.charset?n.charset:e.charset,t=void 0===e.duplicates?n.duplicates:e.duplicates;if("combine"!==t&&"first"!==t&&"last"!==t)throw new TypeError("The duplicates option must be either combine, first, or last");return{allowDots:void 0===e.allowDots?!0===e.decodeDotInKeys||n.allowDots:!!e.allowDots,allowEmptyArrays:"boolean"==typeof e.allowEmptyArrays?!!e.allowEmptyArrays:n.allowEmptyArrays,allowPrototypes:"boolean"==typeof e.allowPrototypes?e.allowPrototypes:n.allowPrototypes,allowSparse:"boolean"==typeof e.allowSparse?e.allowSparse:n.allowSparse,arrayLimit:"number"==typeof e.arrayLimit?e.arrayLimit:n.arrayLimit,charset:r,charsetSentinel:"boolean"==typeof e.charsetSentinel?e.charsetSentinel:n.charsetSentinel,comma:"boolean"==typeof e.comma?e.comma:n.comma,decodeDotInKeys:"boolean"==typeof e.decodeDotInKeys?e.decodeDotInKeys:n.decodeDotInKeys,decoder:"function"==typeof e.decoder?e.decoder:n.decoder,delimiter:"string"==typeof e.delimiter||i.isRegExp(e.delimiter)?e.delimiter:n.delimiter,depth:"number"==typeof e.depth||!1===e.depth?+e.depth:n.depth,duplicates:t,ignoreQueryPrefix:!0===e.ignoreQueryPrefix,interpretNumericEntities:"boolean"==typeof e.interpretNumericEntities?e.interpretNumericEntities:n.interpretNumericEntities,parameterLimit:"number"==typeof e.parameterLimit?e.parameterLimit:n.parameterLimit,parseArrays:!1!==e.parseArrays,plainObjects:"boolean"==typeof e.plainObjects?e.plainObjects:n.plainObjects,strictDepth:"boolean"==typeof e.strictDepth?!!e.strictDepth:n.strictDepth,strictMerge:"boolean"==typeof e.strictMerge?!!e.strictMerge:n.strictMerge,strictNullHandling:"boolean"==typeof e.strictNullHandling?e.strictNullHandling:n.strictNullHandling,throwOnLimitExceeded:"boolean"==typeof e.throwOnLimitExceeded&&e.throwOnLimitExceeded}}(r);if(""===e||null==e)return t.plainObjects?{__proto__:null}:{};for(var d="string"==typeof e?function(e,r){var t={__proto__:null},s=r.ignoreQueryPrefix?e.replace(/^\?/,""):e;s=s.replace(/%5B/gi,"[").replace(/%5D/gi,"]");var d=r.parameterLimit===1/0?void 0:r.parameterLimit,p=s.split(r.delimiter,r.throwOnLimitExceeded&&void 0!==d?d+1:d);if(r.throwOnLimitExceeded&&void 0!==d&&p.length>d)throw new RangeError("Parameter limit exceeded. Only "+d+" parameter"+(1===d?"":"s")+" allowed.");var y,m=-1,f=r.charset;if(r.charsetSentinel)for(y=0;y<p.length;++y)0===p[y].indexOf("utf8=")&&("utf8=%E2%9C%93"===p[y]?f="utf-8":"utf8=%26%2310003%3B"===p[y]&&(f="iso-8859-1"),m=y,y=p.length);for(y=0;y<p.length;++y)if(y!==m){var u,h,w=p[y],b=w.indexOf("]="),g=-1===b?w.indexOf("="):b+1;if(-1===g?(u=r.decoder(w,n.decoder,f,"key"),h=r.strictNullHandling?null:""):null!==(u=r.decoder(w.slice(0,g),n.decoder,f,"key"))&&(h=i.maybeMap(c(w.slice(g+1),r,a(t[u])?t[u].length:0,-1===w.indexOf("[]=")),function(e){return r.decoder(e,n.decoder,f,"value")})),h&&r.interpretNumericEntities&&"iso-8859-1"===f&&(h=l(String(h))),w.indexOf("[]=")>-1&&(h=a(h)?[h]:h),r.comma&&a(h)&&h.length>r.arrayLimit&&(h=i.combine([],h,r.arrayLimit,r.plainObjects,r.throwOnLimitExceeded)),null!==u){var O=o.call(t,u);O&&("combine"===r.duplicates||w.indexOf("[]=")>-1)?t[u]=i.combine(t[u],h,r.arrayLimit,r.plainObjects,r.throwOnLimitExceeded):O&&"last"!==r.duplicates||(t[u]=h)}}return t}(e,t):e,p=t.plainObjects?{__proto__:null}:{},y=Object.keys(d),m=0;m<y.length;++m){var f=y[m],u=s(f,d[f],t,"string"==typeof e);p=i.merge(p,u,t)}return!0===t.allowSparse?p:i.compact(p)}}export{i as __require};
2
2
  //# sourceMappingURL=parse.js.map