@apipass/design-system 1.17.0 → 1.18.0

package/dist/lib/vendor/@react-stately/tooltip/dist/useTooltipTriggerState.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"useTooltipTriggerState.js","sources":["../../../../../../node_modules/@react-stately/tooltip/dist/useTooltipTriggerState.mjs"],"sourcesContent":["import {useMemo as $50cCT$useMemo, useRef as $50cCT$useRef, useEffect as $50cCT$useEffect} from \"react\";\nimport {useOverlayTriggerState as $50cCT$useOverlayTriggerState} from \"@react-stately/overlays\";\n\n/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ \n\nconst $8796f90736e175cb$var$TOOLTIP_DELAY = 1500; // this seems to be a 1.5 second delay, check with design\nconst $8796f90736e175cb$var$TOOLTIP_COOLDOWN = 500;\nlet $8796f90736e175cb$var$tooltips = {};\nlet $8796f90736e175cb$var$tooltipId = 0;\nlet $8796f90736e175cb$var$globalWarmedUp = false;\nlet $8796f90736e175cb$var$globalWarmUpTimeout = null;\nlet $8796f90736e175cb$var$globalCooldownTimeout = null;\nfunction $8796f90736e175cb$export$4d40659c25ecb50b(props = {}) {\n    let { delay: delay = $8796f90736e175cb$var$TOOLTIP_DELAY, closeDelay: closeDelay = $8796f90736e175cb$var$TOOLTIP_COOLDOWN } = props;\n    let { isOpen: isOpen, open: open, close: close } = (0, $50cCT$useOverlayTriggerState)(props);\n    let id = (0, $50cCT$useMemo)(()=>`${++$8796f90736e175cb$var$tooltipId}`, []);\n    let closeTimeout = (0, $50cCT$useRef)(null);\n    let closeCallback = (0, $50cCT$useRef)(close);\n    let ensureTooltipEntry = ()=>{\n        $8796f90736e175cb$var$tooltips[id] = hideTooltip;\n    };\n    let closeOpenTooltips = ()=>{\n        for(let hideTooltipId in $8796f90736e175cb$var$tooltips)if (hideTooltipId !== id) {\n            $8796f90736e175cb$var$tooltips[hideTooltipId](true);\n            delete $8796f90736e175cb$var$tooltips[hideTooltipId];\n        }\n    };\n    let showTooltip = ()=>{\n        if (closeTimeout.current) clearTimeout(closeTimeout.current);\n        closeTimeout.current = null;\n        closeOpenTooltips();\n        ensureTooltipEntry();\n        $8796f90736e175cb$var$globalWarmedUp = true;\n        open();\n        if ($8796f90736e175cb$var$globalWarmUpTimeout) {\n            clearTimeout($8796f90736e175cb$var$globalWarmUpTimeout);\n            $8796f90736e175cb$var$globalWarmUpTimeout = null;\n        }\n        if ($8796f90736e175cb$var$globalCooldownTimeout) {\n            clearTimeout($8796f90736e175cb$var$globalCooldownTimeout);\n            $8796f90736e175cb$var$globalCooldownTimeout = null;\n        }\n    };\n    let hideTooltip = (immediate)=>{\n        if (immediate || closeDelay <= 0) {\n            if (closeTimeout.current) clearTimeout(closeTimeout.current);\n            closeTimeout.current = null;\n            closeCallback.current();\n        } else if (!closeTimeout.current) closeTimeout.current = setTimeout(()=>{\n            closeTimeout.current = null;\n            closeCallback.current();\n        }, closeDelay);\n        if ($8796f90736e175cb$var$globalWarmUpTimeout) {\n            clearTimeout($8796f90736e175cb$var$globalWarmUpTimeout);\n            $8796f90736e175cb$var$globalWarmUpTimeout = null;\n        }\n        if ($8796f90736e175cb$var$globalWarmedUp) {\n            if ($8796f90736e175cb$var$globalCooldownTimeout) clearTimeout($8796f90736e175cb$var$globalCooldownTimeout);\n            $8796f90736e175cb$var$globalCooldownTimeout = setTimeout(()=>{\n                delete $8796f90736e175cb$var$tooltips[id];\n                $8796f90736e175cb$var$globalCooldownTimeout = null;\n                $8796f90736e175cb$var$globalWarmedUp = false;\n            }, Math.max($8796f90736e175cb$var$TOOLTIP_COOLDOWN, closeDelay));\n        }\n    };\n    let warmupTooltip = ()=>{\n        closeOpenTooltips();\n        ensureTooltipEntry();\n        if (!isOpen && !$8796f90736e175cb$var$globalWarmUpTimeout && !$8796f90736e175cb$var$globalWarmedUp) $8796f90736e175cb$var$globalWarmUpTimeout = setTimeout(()=>{\n            $8796f90736e175cb$var$globalWarmUpTimeout = null;\n            $8796f90736e175cb$var$globalWarmedUp = true;\n            showTooltip();\n        }, delay);\n        else if (!isOpen) showTooltip();\n    };\n    (0, $50cCT$useEffect)(()=>{\n        closeCallback.current = close;\n    }, [\n        close\n    ]);\n    (0, $50cCT$useEffect)(()=>{\n        return ()=>{\n            if (closeTimeout.current) clearTimeout(closeTimeout.current);\n            let tooltip = $8796f90736e175cb$var$tooltips[id];\n            if (tooltip) delete $8796f90736e175cb$var$tooltips[id];\n        };\n    }, [\n        id\n    ]);\n    return {\n        isOpen: isOpen,\n        open: (immediate)=>{\n            if (!immediate && delay > 0 && !closeTimeout.current) warmupTooltip();\n            else showTooltip();\n        },\n        close: hideTooltip\n    };\n}\n\n\nexport {$8796f90736e175cb$export$4d40659c25ecb50b as useTooltipTriggerState};\n//# sourceMappingURL=useTooltipTriggerState.module.js.map\n"],"names":["$8796f90736e175cb$var$TOOLTIP_DELAY","$8796f90736e175cb$var$TOOLTIP_COOLDOWN","$8796f90736e175cb$var$tooltips","$8796f90736e175cb$var$tooltipId","$8796f90736e175cb$var$globalWarmedUp","$8796f90736e175cb$var$globalWarmUpTimeout","$8796f90736e175cb$var$globalCooldownTimeout","$8796f90736e175cb$export$4d40659c25ecb50b","props","delay","closeDelay","isOpen","open","close","$50cCT$useOverlayTriggerState","id","$50cCT$useMemo","closeTimeout","$50cCT$useRef","closeCallback","ensureTooltipEntry","hideTooltip","closeOpenTooltips","hideTooltipId","showTooltip","immediate","warmupTooltip","$50cCT$useEffect"],"mappings":";;AAeA,MAAMA,IAAsC,MACtCC,IAAyC;AAC/C,IAAIC,IAAiC,CAAA,GACjCC,IAAkC,GAClCC,IAAuC,IACvCC,IAA4C,MAC5CC,IAA8C;AAClD,SAASC,EAA0CC,IAAQ,IAAI;AAC3D,MAAI,EAAE,OAAOC,IAAQT,GAAqC,YAAYU,IAAaT,EAAsC,IAAKO,GAC1H,EAAE,QAAQG,GAAQ,MAAMC,GAAM,OAAOC,EAAK,IAASC,EAA+BN,CAAK,GACvFO,IAASC,EAAgB,MAAI,GAAG,EAAEb,CAA+B,IAAI,EAAE,GACvEc,IAAmBC,EAAe,IAAI,GACtCC,IAAoBD,EAAeL,CAAK,GACxCO,IAAqB,MAAI;AACzB,IAAAlB,EAA+Ba,CAAE,IAAIM;AAAA,EACzC,GACIC,IAAoB,MAAI;AACxB,aAAQC,KAAiBrB,EAA+B,CAAIqB,MAAkBR,MAC1Eb,EAA+BqB,CAAa,EAAE,EAAI,GAClD,OAAOrB,EAA+BqB,CAAa;AAAA,EAE3D,GACIC,IAAc,MAAI;AAClB,IAAIP,EAAa,WAAS,aAAaA,EAAa,OAAO,GAC3DA,EAAa,UAAU,MACvBK,EAAiB,GACjBF,EAAkB,GAClBhB,IAAuC,IACvCQ,EAAI,GACAP,MACA,aAAaA,CAAyC,GACtDA,IAA4C,OAE5CC,MACA,aAAaA,CAA2C,GACxDA,IAA8C;AAAA,EAEtD,GACIe,IAAc,CAACI,MAAY;AAC3B,IAAIA,KAAaf,KAAc,KACvBO,EAAa,WAAS,aAAaA,EAAa,OAAO,GAC3DA,EAAa,UAAU,MACvBE,EAAc,QAAO,KACbF,EAAa,YAASA,EAAa,UAAU,WAAW,MAAI;AACpE,MAAAA,EAAa,UAAU,MACvBE,EAAc,QAAO;AAAA,IACzB,GAAGT,CAAU,IACTL,MACA,aAAaA,CAAyC,GACtDA,IAA4C,OAE5CD,MACIE,KAA6C,aAAaA,CAA2C,GACzGA,IAA8C,WAAW,MAAI;AACzD,aAAOJ,EAA+Ba,CAAE,GACxCT,IAA8C,MAC9CF,IAAuC;AAAA,IAC3C,GAAG,KAAK,IAAIH,GAAwCS,CAAU,CAAC;AAAA,EAEvE,GACIgB,IAAgB,MAAI;AACpB,IAAAJ,EAAiB,GACjBF,EAAkB,GACd,CAACT,KAAU,CAACN,KAA6C,CAACD,IAAsCC,IAA4C,WAAW,MAAI;AAC3J,MAAAA,IAA4C,MAC5CD,IAAuC,IACvCoB,EAAW;AAAA,IACf,GAAGf,CAAK,IACEE,KAAQa,EAAW;AAAA,EACjC;AACA,SAAIG,EAAkB,MAAI;AACtB,IAAAR,EAAc,UAAUN;AAAA,EAC5B,GAAG;AAAA,IACCA;AAAA,EACR,CAAK,GACGc,EAAkB,MACX,MAAI;AACP,IAAIV,EAAa,WAAS,aAAaA,EAAa,OAAO,GAC7Cf,EAA+Ba,CAAE,KAClC,OAAOb,EAA+Ba,CAAE;AAAA,EACzD,GACD;AAAA,IACCA;AAAA,EACR,CAAK,GACM;AAAA,IACH,QAAQJ;AAAA,IACR,MAAM,CAACc,MAAY;AACf,MAAI,CAACA,KAAahB,IAAQ,KAAK,CAACQ,EAAa,UAASS,EAAa,IAC9DF,EAAW;AAAA,IACpB;AAAA,IACA,OAAOH;AAAA,EACf;AACA;","x_google_ignoreList":[0]}

package/dist/lib/vendor/@react-stately/utils/dist/useControlledState.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("react");function C(r,b,o){let[p,u]=l.useState(r||b),f=l.useRef(r!==void 0),e=r!==void 0;l.useEffect(()=>{f.current,f.current=e},[e]);let t=e?r:p,S=l.useCallback((i,...s)=>{let a=(n,...c)=>{o&&(Object.is(t,n)||o(n,...c)),e||(t=n)};typeof i=="function"?u((c,...$)=>{let d=i(e?t:c,...$);return a(d,...s),e?c:d}):(e||u(i),a(i,...s))},[e,t,o]);return[t,S]}exports.useControlledState=C;
+//# sourceMappingURL=useControlledState.cjs.map

package/dist/lib/vendor/@react-stately/utils/dist/useControlledState.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"useControlledState.cjs","sources":["../../../../../../node_modules/@react-stately/utils/dist/useControlledState.mjs"],"sourcesContent":["import {useState as $3whtM$useState, useRef as $3whtM$useRef, useEffect as $3whtM$useEffect, useCallback as $3whtM$useCallback} from \"react\";\n\n/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ \nfunction $458b0a5536c1a7cf$export$40bfa8c7b0832715(value, defaultValue, onChange) {\n    let [stateValue, setStateValue] = (0, $3whtM$useState)(value || defaultValue);\n    let isControlledRef = (0, $3whtM$useRef)(value !== undefined);\n    let isControlled = value !== undefined;\n    (0, $3whtM$useEffect)(()=>{\n        let wasControlled = isControlledRef.current;\n        if (wasControlled !== isControlled && process.env.NODE_ENV !== 'production') console.warn(`WARN: A component changed from ${wasControlled ? 'controlled' : 'uncontrolled'} to ${isControlled ? 'controlled' : 'uncontrolled'}.`);\n        isControlledRef.current = isControlled;\n    }, [\n        isControlled\n    ]);\n    let currentValue = isControlled ? value : stateValue;\n    let setValue = (0, $3whtM$useCallback)((value, ...args)=>{\n        let onChangeCaller = (value, ...onChangeArgs)=>{\n            if (onChange) {\n                if (!Object.is(currentValue, value)) onChange(value, ...onChangeArgs);\n            }\n            if (!isControlled) // If uncontrolled, mutate the currentValue local variable so that\n            // calling setState multiple times with the same value only emits onChange once.\n            // We do not use a ref for this because we specifically _do_ want the value to\n            // reset every render, and assigning to a ref in render breaks aborted suspended renders.\n            // eslint-disable-next-line react-hooks/exhaustive-deps\n            currentValue = value;\n        };\n        if (typeof value === 'function') {\n            if (process.env.NODE_ENV !== 'production') console.warn('We can not support a function callback. See Github Issues for details https://github.com/adobe/react-spectrum/issues/2320');\n            // this supports functional updates https://reactjs.org/docs/hooks-reference.html#functional-updates\n            // when someone using useControlledState calls setControlledState(myFunc)\n            // this will call our useState setState with a function as well which invokes myFunc and calls onChange with the value from myFunc\n            // if we're in an uncontrolled state, then we also return the value of myFunc which to setState looks as though it was just called with myFunc from the beginning\n            // otherwise we just return the controlled value, which won't cause a rerender because React knows to bail out when the value is the same\n            let updateFunction = (oldValue, ...functionArgs)=>{\n                let interceptedValue = value(isControlled ? currentValue : oldValue, ...functionArgs);\n                onChangeCaller(interceptedValue, ...args);\n                if (!isControlled) return interceptedValue;\n                return oldValue;\n            };\n            setStateValue(updateFunction);\n        } else {\n            if (!isControlled) setStateValue(value);\n            onChangeCaller(value, ...args);\n        }\n    }, [\n        isControlled,\n        currentValue,\n        onChange\n    ]);\n    return [\n        currentValue,\n        setValue\n    ];\n}\n\n\nexport {$458b0a5536c1a7cf$export$40bfa8c7b0832715 as useControlledState};\n//# sourceMappingURL=useControlledState.module.js.map\n"],"names":["$458b0a5536c1a7cf$export$40bfa8c7b0832715","value","defaultValue","onChange","stateValue","setStateValue","$3whtM$useState","isControlledRef","$3whtM$useRef","isControlled","$3whtM$useEffect","currentValue","setValue","$3whtM$useCallback","args","onChangeCaller","onChangeArgs","oldValue","functionArgs","interceptedValue"],"mappings":"yGAaA,SAASA,EAA0CC,EAAOC,EAAcC,EAAU,CAC9E,GAAI,CAACC,EAAYC,CAAa,EAAQC,EAAAA,SAAiBL,GAASC,CAAY,EACxEK,EAAsBC,SAAeP,IAAU,MAAS,EACxDQ,EAAeR,IAAU,OACzBS,EAAAA,UAAkB,IAAI,CACFH,EAAgB,QAEpCA,EAAgB,QAAUE,CAC9B,EAAG,CACCA,CAAA,CACH,EACD,IAAIE,EAAeF,EAAeR,EAAQG,EACtCQ,EAAeC,EAAAA,YAAoB,CAACZ,KAAUa,IAAO,CACrD,IAAIC,EAAiB,CAACd,KAAUe,IAAe,CACvCb,IACK,OAAO,GAAGQ,EAAcV,CAAK,GAAGE,EAASF,EAAO,GAAGe,CAAY,GAEnEP,IAKLE,EAAeV,EACnB,EACI,OAAOA,GAAU,WAajBI,EANqB,CAACY,KAAaC,IAAe,CAC9C,IAAIC,EAAmBlB,EAAMQ,EAAeE,EAAeM,EAAU,GAAGC,CAAY,EAEpF,OADAH,EAAeI,EAAkB,GAAGL,CAAI,EACnCL,EACEQ,EADmBE,CAE9B,CAC4B,GAEvBV,GAAcJ,EAAcJ,CAAK,EACtCc,EAAed,EAAO,GAAGa,CAAI,EAErC,EAAG,CACCL,EACAE,EACAR,CAAA,CACH,EACD,MAAO,CACHQ,EACAC,CAAA,CAER","x_google_ignoreList":[0]}

package/dist/lib/vendor/@react-stately/utils/dist/useControlledState.js

@@ -0,0 +1,30 @@
+import { useState as V, useRef as S, useEffect as $, useCallback as m } from "react";
+function F(r, d, o) {
+  let [p, c] = V(r || d), l = S(r !== void 0), t = r !== void 0;
+  $(() => {
+    l.current, l.current = t;
+  }, [
+    t
+  ]);
+  let e = t ? r : p, b = m((i, ...u) => {
+    let s = (f, ...n) => {
+      o && (Object.is(e, f) || o(f, ...n)), t || (e = f);
+    };
+    typeof i == "function" ? c((n, ...C) => {
+      let a = i(t ? e : n, ...C);
+      return s(a, ...u), t ? n : a;
+    }) : (t || c(i), s(i, ...u));
+  }, [
+    t,
+    e,
+    o
+  ]);
+  return [
+    e,
+    b
+  ];
+}
+export {
+  F as useControlledState
+};
+//# sourceMappingURL=useControlledState.js.map

package/dist/lib/vendor/@react-stately/utils/dist/useControlledState.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"useControlledState.js","sources":["../../../../../../node_modules/@react-stately/utils/dist/useControlledState.mjs"],"sourcesContent":["import {useState as $3whtM$useState, useRef as $3whtM$useRef, useEffect as $3whtM$useEffect, useCallback as $3whtM$useCallback} from \"react\";\n\n/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */ \nfunction $458b0a5536c1a7cf$export$40bfa8c7b0832715(value, defaultValue, onChange) {\n    let [stateValue, setStateValue] = (0, $3whtM$useState)(value || defaultValue);\n    let isControlledRef = (0, $3whtM$useRef)(value !== undefined);\n    let isControlled = value !== undefined;\n    (0, $3whtM$useEffect)(()=>{\n        let wasControlled = isControlledRef.current;\n        if (wasControlled !== isControlled && process.env.NODE_ENV !== 'production') console.warn(`WARN: A component changed from ${wasControlled ? 'controlled' : 'uncontrolled'} to ${isControlled ? 'controlled' : 'uncontrolled'}.`);\n        isControlledRef.current = isControlled;\n    }, [\n        isControlled\n    ]);\n    let currentValue = isControlled ? value : stateValue;\n    let setValue = (0, $3whtM$useCallback)((value, ...args)=>{\n        let onChangeCaller = (value, ...onChangeArgs)=>{\n            if (onChange) {\n                if (!Object.is(currentValue, value)) onChange(value, ...onChangeArgs);\n            }\n            if (!isControlled) // If uncontrolled, mutate the currentValue local variable so that\n            // calling setState multiple times with the same value only emits onChange once.\n            // We do not use a ref for this because we specifically _do_ want the value to\n            // reset every render, and assigning to a ref in render breaks aborted suspended renders.\n            // eslint-disable-next-line react-hooks/exhaustive-deps\n            currentValue = value;\n        };\n        if (typeof value === 'function') {\n            if (process.env.NODE_ENV !== 'production') console.warn('We can not support a function callback. See Github Issues for details https://github.com/adobe/react-spectrum/issues/2320');\n            // this supports functional updates https://reactjs.org/docs/hooks-reference.html#functional-updates\n            // when someone using useControlledState calls setControlledState(myFunc)\n            // this will call our useState setState with a function as well which invokes myFunc and calls onChange with the value from myFunc\n            // if we're in an uncontrolled state, then we also return the value of myFunc which to setState looks as though it was just called with myFunc from the beginning\n            // otherwise we just return the controlled value, which won't cause a rerender because React knows to bail out when the value is the same\n            let updateFunction = (oldValue, ...functionArgs)=>{\n                let interceptedValue = value(isControlled ? currentValue : oldValue, ...functionArgs);\n                onChangeCaller(interceptedValue, ...args);\n                if (!isControlled) return interceptedValue;\n                return oldValue;\n            };\n            setStateValue(updateFunction);\n        } else {\n            if (!isControlled) setStateValue(value);\n            onChangeCaller(value, ...args);\n        }\n    }, [\n        isControlled,\n        currentValue,\n        onChange\n    ]);\n    return [\n        currentValue,\n        setValue\n    ];\n}\n\n\nexport {$458b0a5536c1a7cf$export$40bfa8c7b0832715 as useControlledState};\n//# sourceMappingURL=useControlledState.module.js.map\n"],"names":["$458b0a5536c1a7cf$export$40bfa8c7b0832715","value","defaultValue","onChange","stateValue","setStateValue","$3whtM$useState","isControlledRef","$3whtM$useRef","isControlled","$3whtM$useEffect","currentValue","setValue","$3whtM$useCallback","args","onChangeCaller","onChangeArgs","oldValue","functionArgs","interceptedValue"],"mappings":";AAaA,SAASA,EAA0CC,GAAOC,GAAcC,GAAU;AAC9E,MAAI,CAACC,GAAYC,CAAa,IAAQC,EAAiBL,KAASC,CAAY,GACxEK,IAAsBC,EAAeP,MAAU,MAAS,GACxDQ,IAAeR,MAAU;AAC7B,EAAIS,EAAkB,MAAI;AACF,IAAAH,EAAgB,SAEpCA,EAAgB,UAAUE;AAAA,EAC9B,GAAG;AAAA,IACCA;AAAA,EAAA,CACH;AACD,MAAIE,IAAeF,IAAeR,IAAQG,GACtCQ,IAAeC,EAAoB,CAACZ,MAAUa,MAAO;AACrD,QAAIC,IAAiB,CAACd,MAAUe,MAAe;AAC3C,MAAIb,MACK,OAAO,GAAGQ,GAAcV,CAAK,KAAGE,EAASF,GAAO,GAAGe,CAAY,IAEnEP,MAKLE,IAAeV;AAAAA,IACnB;AACA,IAAI,OAAOA,KAAU,aAajBI,EANqB,CAACY,MAAaC,MAAe;AAC9C,UAAIC,IAAmBlB,EAAMQ,IAAeE,IAAeM,GAAU,GAAGC,CAAY;AAEpF,aADAH,EAAeI,GAAkB,GAAGL,CAAI,GACnCL,IACEQ,IADmBE;AAAA,IAE9B,CAC4B,KAEvBV,KAAcJ,EAAcJ,CAAK,GACtCc,EAAed,GAAO,GAAGa,CAAI;AAAA,EAErC,GAAG;AAAA,IACCL;AAAA,IACAE;AAAA,IACAR;AAAA,EAAA,CACH;AACD,SAAO;AAAA,IACHQ;AAAA,IACAC;AAAA,EAAA;AAER;","x_google_ignoreList":[0]}

package/dist/lib/vendor/clsx/dist/clsx.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});function n(r){var o,e,t="";if(typeof r=="string"||typeof r=="number")t+=r;else if(typeof r=="object")if(Array.isArray(r)){var u=r.length;for(o=0;o<u;o++)r[o]&&(e=n(r[o]))&&(t&&(t+=" "),t+=e)}else for(e in r)r[e]&&(t&&(t+=" "),t+=e);return t}function f(){for(var r,o,e=0,t="",u=arguments.length;e<u;e++)(r=arguments[e])&&(o=n(r))&&(t&&(t+=" "),t+=o);return t}exports.clsx=f;exports.default=f;
+//# sourceMappingURL=clsx.cjs.map

package/dist/lib/vendor/clsx/dist/clsx.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"clsx.cjs","sources":["../../../../../node_modules/clsx/dist/clsx.mjs"],"sourcesContent":["function r(e){var t,f,n=\"\";if(\"string\"==typeof e||\"number\"==typeof e)n+=e;else if(\"object\"==typeof e)if(Array.isArray(e)){var o=e.length;for(t=0;t<o;t++)e[t]&&(f=r(e[t]))&&(n&&(n+=\" \"),n+=f)}else for(f in e)e[f]&&(n&&(n+=\" \"),n+=f);return n}export function clsx(){for(var e,t,f=0,n=\"\",o=arguments.length;f<o;f++)(e=arguments[f])&&(t=r(e))&&(n&&(n+=\" \"),n+=t);return n}export default clsx;"],"names":["r","e","t","f","n","o","clsx"],"mappings":"4GAAA,SAASA,EAAEC,EAAE,CAAC,IAAIC,EAAEC,EAAEC,EAAE,GAAG,GAAa,OAAOH,GAAjB,UAA8B,OAAOA,GAAjB,SAAmBG,GAAGH,UAAoB,OAAOA,GAAjB,SAAmB,GAAG,MAAM,QAAQA,CAAC,EAAE,CAAC,IAAII,EAAEJ,EAAE,OAAO,IAAIC,EAAE,EAAEA,EAAEG,EAAEH,IAAID,EAAEC,CAAC,IAAIC,EAAEH,EAAEC,EAAEC,CAAC,CAAC,KAAKE,IAAIA,GAAG,KAAKA,GAAGD,EAAE,KAAM,KAAIA,KAAKF,EAAEA,EAAEE,CAAC,IAAIC,IAAIA,GAAG,KAAKA,GAAGD,GAAG,OAAOC,CAAC,CAAQ,SAASE,GAAM,CAAC,QAAQL,EAAEC,EAAEC,EAAE,EAAEC,EAAE,GAAGC,EAAE,UAAU,OAAOF,EAAEE,EAAEF,KAAKF,EAAE,UAAUE,CAAC,KAAKD,EAAEF,EAAEC,CAAC,KAAKG,IAAIA,GAAG,KAAKA,GAAGF,GAAG,OAAOE,CAAC","x_google_ignoreList":[0]}

package/dist/lib/vendor/clsx/dist/clsx.js

@@ -0,0 +1,18 @@
+function a(r) {
+  var n, f, t = "";
+  if (typeof r == "string" || typeof r == "number") t += r;
+  else if (typeof r == "object") if (Array.isArray(r)) {
+    var o = r.length;
+    for (n = 0; n < o; n++) r[n] && (f = a(r[n])) && (t && (t += " "), t += f);
+  } else for (f in r) r[f] && (t && (t += " "), t += f);
+  return t;
+}
+function i() {
+  for (var r, n, f = 0, t = "", o = arguments.length; f < o; f++) (r = arguments[f]) && (n = a(r)) && (t && (t += " "), t += n);
+  return t;
+}
+export {
+  i as clsx,
+  i as default
+};
+//# sourceMappingURL=clsx.js.map

package/dist/lib/vendor/clsx/dist/clsx.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clsx.js","sources":["../../../../../node_modules/clsx/dist/clsx.mjs"],"sourcesContent":["function r(e){var t,f,n=\"\";if(\"string\"==typeof e||\"number\"==typeof e)n+=e;else if(\"object\"==typeof e)if(Array.isArray(e)){var o=e.length;for(t=0;t<o;t++)e[t]&&(f=r(e[t]))&&(n&&(n+=\" \"),n+=f)}else for(f in e)e[f]&&(n&&(n+=\" \"),n+=f);return n}export function clsx(){for(var e,t,f=0,n=\"\",o=arguments.length;f<o;f++)(e=arguments[f])&&(t=r(e))&&(n&&(n+=\" \"),n+=t);return n}export default clsx;"],"names":["r","e","t","n","clsx"],"mappings":"AAAA,SAASA,EAAEC,GAAE;AAAC,MAAIC,GAAE,GAAEC,IAAE;AAAG,MAAa,OAAOF,KAAjB,YAA8B,OAAOA,KAAjB,SAAmB,CAAAE,KAAGF;AAAA,WAAoB,OAAOA,KAAjB,SAAmB,KAAG,MAAM,QAAQA,CAAC,GAAE;AAAC,QAAI,IAAEA,EAAE;AAAO,SAAIC,IAAE,GAAEA,IAAE,GAAEA,IAAI,CAAAD,EAAEC,CAAC,MAAI,IAAEF,EAAEC,EAAEC,CAAC,CAAC,OAAKC,MAAIA,KAAG,MAAKA,KAAG;AAAA,EAAE,MAAM,MAAI,KAAKF,EAAE,CAAAA,EAAE,CAAC,MAAIE,MAAIA,KAAG,MAAKA,KAAG;AAAG,SAAOA;AAAC;AAAQ,SAASC,IAAM;AAAC,WAAQH,GAAEC,GAAE,IAAE,GAAEC,IAAE,IAAG,IAAE,UAAU,QAAO,IAAE,GAAE,IAAI,EAACF,IAAE,UAAU,CAAC,OAAKC,IAAEF,EAAEC,CAAC,OAAKE,MAAIA,KAAG,MAAKA,KAAGD;AAAG,SAAOC;AAAC;","x_google_ignoreList":[0]}

package/dist/lib/vendor/clsx/dist/clsx2.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("../../../_virtual/clsx.cjs");var l;function f(){if(l)return u.__module.exports;l=1;function s(r){var o,t,e="";if(typeof r=="string"||typeof r=="number")e+=r;else if(typeof r=="object")if(Array.isArray(r)){var n=r.length;for(o=0;o<n;o++)r[o]&&(t=s(r[o]))&&(e&&(e+=" "),e+=t)}else for(t in r)r[t]&&(e&&(e+=" "),e+=t);return e}function i(){for(var r,o,t=0,e="",n=arguments.length;t<n;t++)(r=arguments[t])&&(o=s(r))&&(e&&(e+=" "),e+=o);return e}return u.__module.exports=i,u.__module.exports.clsx=i,u.__module.exports}exports.__require=f;
+//# sourceMappingURL=clsx2.cjs.map

package/dist/lib/vendor/clsx/dist/clsx2.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"clsx2.cjs","sources":["../../../../../node_modules/clsx/dist/clsx.js"],"sourcesContent":["function r(e){var o,t,f=\"\";if(\"string\"==typeof e||\"number\"==typeof e)f+=e;else if(\"object\"==typeof e)if(Array.isArray(e)){var n=e.length;for(o=0;o<n;o++)e[o]&&(t=r(e[o]))&&(f&&(f+=\" \"),f+=t)}else for(t in e)e[t]&&(f&&(f+=\" \"),f+=t);return f}function e(){for(var e,o,t=0,f=\"\",n=arguments.length;t<n;t++)(e=arguments[t])&&(o=r(e))&&(f&&(f+=\" \"),f+=o);return f}module.exports=e,module.exports.clsx=e;"],"names":["r","e","f","clsxModule"],"mappings":"oLAAA,SAASA,EAAEC,EAAE,CAAC,IAAI,EAAE,EAAEC,EAAE,GAAG,GAAa,OAAOD,GAAjB,UAA8B,OAAOA,GAAjB,SAAmBC,GAAGD,UAAoB,OAAOA,GAAjB,SAAmB,GAAG,MAAM,QAAQA,CAAC,EAAE,CAAC,IAAI,EAAEA,EAAE,OAAO,IAAI,EAAE,EAAE,EAAE,EAAE,IAAIA,EAAE,CAAC,IAAI,EAAED,EAAEC,EAAE,CAAC,CAAC,KAAKC,IAAIA,GAAG,KAAKA,GAAG,EAAE,KAAM,KAAI,KAAKD,EAAEA,EAAE,CAAC,IAAIC,IAAIA,GAAG,KAAKA,GAAG,GAAG,OAAOA,CAAC,CAAC,SAASD,GAAG,CAAC,QAAQA,EAAE,EAAE,EAAE,EAAEC,EAAE,GAAG,EAAE,UAAU,OAAO,EAAE,EAAE,KAAKD,EAAE,UAAU,CAAC,KAAK,EAAED,EAAEC,CAAC,KAAKC,IAAIA,GAAG,KAAKA,GAAG,GAAG,OAAOA,CAAC,CAACC,OAAAA,EAAAA,SAAA,QAAeF,EAAEE,EAAAA,SAAA,QAAA,KAAoBF","x_google_ignoreList":[0]}

package/dist/lib/vendor/clsx/dist/clsx2.js

@@ -0,0 +1,24 @@
+import { __module as n } from "../../../_virtual/clsx.js";
+var f;
+function l() {
+  if (f) return n.exports;
+  f = 1;
+  function i(r) {
+    var o, e, t = "";
+    if (typeof r == "string" || typeof r == "number") t += r;
+    else if (typeof r == "object") if (Array.isArray(r)) {
+      var s = r.length;
+      for (o = 0; o < s; o++) r[o] && (e = i(r[o])) && (t && (t += " "), t += e);
+    } else for (e in r) r[e] && (t && (t += " "), t += e);
+    return t;
+  }
+  function u() {
+    for (var r, o, e = 0, t = "", s = arguments.length; e < s; e++) (r = arguments[e]) && (o = i(r)) && (t && (t += " "), t += o);
+    return t;
+  }
+  return n.exports = u, n.exports.clsx = u, n.exports;
+}
+export {
+  l as __require
+};
+//# sourceMappingURL=clsx2.js.map

package/dist/lib/vendor/clsx/dist/clsx2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clsx2.js","sources":["../../../../../node_modules/clsx/dist/clsx.js"],"sourcesContent":["function r(e){var o,t,f=\"\";if(\"string\"==typeof e||\"number\"==typeof e)f+=e;else if(\"object\"==typeof e)if(Array.isArray(e)){var n=e.length;for(o=0;o<n;o++)e[o]&&(t=r(e[o]))&&(f&&(f+=\" \"),f+=t)}else for(t in e)e[t]&&(f&&(f+=\" \"),f+=t);return f}function e(){for(var e,o,t=0,f=\"\",n=arguments.length;t<n;t++)(e=arguments[t])&&(o=r(e))&&(f&&(f+=\" \"),f+=o);return f}module.exports=e,module.exports.clsx=e;"],"names":["r","e","t","f","n","clsxModule"],"mappings":";;;;;AAAA,WAASA,EAAEC,GAAE;AAAC,QAAI,GAAEC,GAAEC,IAAE;AAAG,QAAa,OAAOF,KAAjB,YAA8B,OAAOA,KAAjB,SAAmB,CAAAE,KAAGF;AAAA,aAAoB,OAAOA,KAAjB,SAAmB,KAAG,MAAM,QAAQA,CAAC,GAAE;AAAC,UAAIG,IAAEH,EAAE;AAAO,WAAI,IAAE,GAAE,IAAEG,GAAE,IAAI,CAAAH,EAAE,CAAC,MAAIC,IAAEF,EAAEC,EAAE,CAAC,CAAC,OAAKE,MAAIA,KAAG,MAAKA,KAAGD;AAAA,IAAE,MAAM,MAAIA,KAAKD,EAAE,CAAAA,EAAEC,CAAC,MAAIC,MAAIA,KAAG,MAAKA,KAAGD;AAAG,WAAOC;AAAA,EAAC;AAAC,WAASF,IAAG;AAAC,aAAQA,GAAE,GAAEC,IAAE,GAAEC,IAAE,IAAGC,IAAE,UAAU,QAAOF,IAAEE,GAAEF,IAAI,EAACD,IAAE,UAAUC,CAAC,OAAK,IAAEF,EAAEC,CAAC,OAAKE,MAAIA,KAAG,MAAKA,KAAG;AAAG,WAAOA;AAAA,EAAC;AAACE,SAAAA,EAAA,UAAeJ,GAAEI,EAAA,QAAA,OAAoBJ;;","x_google_ignoreList":[0]}

package/dist/lib/vendor/fast-equals/dist/fast-equals.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const A=require("../../../_virtual/fast-equals.cjs");var ir=A.__module.exports,m;function sr(){return m||(m=1,(function(cr,x){(function(v,O){O(x)})(ir,(function(v){function O(r){return function(t,a,u,l,c,o,i){return r(t,a,i)}}function j(r){return function(t,a,u,l){if(!t||!a||typeof t!="object"||typeof a!="object")return r(t,a,u,l);var c=l.get(t),o=l.get(a);if(c&&o)return c===a&&o===t;l.set(t,a),l.set(a,t);var i=r(t,a,u,l);return l.delete(t),l.delete(a),i}}function y(r,e){var t={};for(var a in r)t[a]=r[a];for(var a in e)t[a]=e[a];return t}function h(r){return r.constructor===Object||r.constructor==null}function C(r){return typeof r.then=="function"}function p(r,e){return r===e||r!==r&&e!==e}var k="[object Arguments]",z="[object Boolean]",P="[object Date]",B="[object RegExp]",F="[object Map]",L="[object Number]",U="[object Object]",V="[object Set]",W="[object String]",S=Object.prototype.toString;function d(r){var e=r.areArraysEqual,t=r.areDatesEqual,a=r.areMapsEqual,u=r.areObjectsEqual,l=r.areRegExpsEqual,c=r.areSetsEqual,o=r.createIsNestedEqual,i=o(f);function f(n,s,E){if(n===s)return!0;if(!n||!s||typeof n!="object"||typeof s!="object")return n!==n&&s!==s;if(h(n)&&h(s))return u(n,s,i,E);var G=Array.isArray(n),R=Array.isArray(s);if(G||R)return G===R&&e(n,s,i,E);var q=S.call(n);return q!==S.call(s)?!1:q===P?t(n,s,i,E):q===B?l(n,s,i,E):q===F?a(n,s,i,E):q===V?c(n,s,i,E):q===U||q===k?C(n)||C(s)?!1:u(n,s,i,E):q===z||q===L||q===W?p(n.valueOf(),s.valueOf()):!1}return f}function T(r,e,t,a){var u=r.length;if(e.length!==u)return!1;for(;u-- >0;)if(!t(r[u],e[u],u,u,r,e,a))return!1;return!0}var Z=j(T);function M(r,e){return p(r.valueOf(),e.valueOf())}function I(r,e,t,a){var u=r.size===e.size;if(!u)return!1;if(!r.size)return!0;var l={},c=0;return r.forEach(function(o,i){if(u){var f=!1,n=0;e.forEach(function(s,E){!f&&!l[n]&&(f=t(i,E,c,n,r,e,a)&&t(o,s,i,E,r,e,a))&&(l[n]=!0),n++}),c++,u=f}}),u}var J=j(I),X="_owner",H=Object.prototype.hasOwnProperty;function N(r,e,t,a){var u=Object.keys(r),l=u.length;if(Object.keys(e).length!==l)return!1;for(var c;l-- >0;){if(c=u[l],c===X){var o=!!r.$$typeof,i=!!e.$$typeof;if((o||i)&&o!==i)return!1}if(!H.call(e,c)||!t(r[c],e[c],c,c,r,e,a))return!1}return!0}var K=j(N);function w(r,e){return r.source===e.source&&r.flags===e.flags}function D(r,e,t,a){var u=r.size===e.size;if(!u)return!1;if(!r.size)return!0;var l={};return r.forEach(function(c,o){if(u){var i=!1,f=0;e.forEach(function(n,s){!i&&!l[f]&&(i=t(c,n,o,s,r,e,a))&&(l[f]=!0),f++}),u=i}}),u}var Q=j(D),_=Object.freeze({areArraysEqual:T,areDatesEqual:M,areMapsEqual:I,areObjectsEqual:N,areRegExpsEqual:w,areSetsEqual:D,createIsNestedEqual:O}),g=Object.freeze({areArraysEqual:Z,areDatesEqual:M,areMapsEqual:J,areObjectsEqual:K,areRegExpsEqual:w,areSetsEqual:Q,createIsNestedEqual:O}),Y=d(_);function $(r,e){return Y(r,e,void 0)}var b=d(y(_,{createIsNestedEqual:function(){return p}}));function rr(r,e){return b(r,e,void 0)}var er=d(g);function ar(r,e){return er(r,e,new WeakMap)}var ur=d(y(g,{createIsNestedEqual:function(){return p}}));function tr(r,e){return ur(r,e,new WeakMap)}function nr(r){return d(y(_,r(_)))}function lr(r){var e=d(y(g,r(g)));return(function(t,a,u){return u===void 0&&(u=new WeakMap),e(t,a,u)})}v.circularDeepEqual=ar,v.circularShallowEqual=tr,v.createCustomCircularEqual=lr,v.createCustomEqual=nr,v.deepEqual=$,v.sameValueZeroEqual=p,v.shallowEqual=rr,Object.defineProperty(v,"__esModule",{value:!0})}))})(A.__module,A.__module.exports)),A.__module.exports}exports.__require=sr;
+//# sourceMappingURL=fast-equals.cjs.map

package/dist/lib/vendor/fast-equals/dist/fast-equals.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"fast-equals.cjs","sources":["../../../../../node_modules/fast-equals/dist/fast-equals.js"],"sourcesContent":["(function (global, factory) {\n  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :\n  typeof define === 'function' && define.amd ? define(['exports'], factory) :\n  (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global[\"fast-equals\"] = {}));\n})(this, (function (exports) { 'use strict';\n\n  /**\r\n   * Default equality comparator pass-through, used as the standard `isEqual` creator for\r\n   * use inside the built comparator.\r\n   */\r\n  function createDefaultIsNestedEqual(comparator) {\r\n      return function isEqual(a, b, _indexOrKeyA, _indexOrKeyB, _parentA, _parentB, meta) {\r\n          return comparator(a, b, meta);\r\n      };\r\n  }\r\n  /**\r\n   * Wrap the provided `areItemsEqual` method to manage the circular cache, allowing\r\n   * for circular references to be safely included in the comparison without creating\r\n   * stack overflows.\r\n   */\r\n  function createIsCircular(areItemsEqual) {\r\n      return function isCircular(a, b, isEqual, cache) {\r\n          if (!a || !b || typeof a !== 'object' || typeof b !== 'object') {\r\n              return areItemsEqual(a, b, isEqual, cache);\r\n          }\r\n          var cachedA = cache.get(a);\r\n          var cachedB = cache.get(b);\r\n          if (cachedA && cachedB) {\r\n              return cachedA === b && cachedB === a;\r\n          }\r\n          cache.set(a, b);\r\n          cache.set(b, a);\r\n          var result = areItemsEqual(a, b, isEqual, cache);\r\n          cache.delete(a);\r\n          cache.delete(b);\r\n          return result;\r\n      };\r\n  }\r\n  /**\r\n   * Targeted shallow merge of two objects.\r\n   *\r\n   * @NOTE\r\n   * This exists as a tinier compiled version of the `__assign` helper that\r\n   * `tsc` injects in case of `Object.assign` not being present.\r\n   */\r\n  function merge(a, b) {\r\n      var merged = {};\r\n      for (var key in a) {\r\n          merged[key] = a[key];\r\n      }\r\n      for (var key in b) {\r\n          merged[key] = b[key];\r\n      }\r\n      return merged;\r\n  }\r\n  /**\r\n   * Whether the value is a plain object.\r\n   *\r\n   * @NOTE\r\n   * This is a same-realm compariosn only.\r\n   */\r\n  function isPlainObject(value) {\r\n      return value.constructor === Object || value.constructor == null;\r\n  }\r\n  /**\r\n   * When the value is `Promise`-like, aka \"then-able\".\r\n   */\r\n  function isPromiseLike(value) {\r\n      return typeof value.then === 'function';\r\n  }\r\n  /**\r\n   * Whether the values passed are strictly equal or both NaN.\r\n   */\r\n  function sameValueZeroEqual(a, b) {\r\n      return a === b || (a !== a && b !== b);\r\n  }\n\n  var ARGUMENTS_TAG = '[object Arguments]';\r\n  var BOOLEAN_TAG = '[object Boolean]';\r\n  var DATE_TAG = '[object Date]';\r\n  var REG_EXP_TAG = '[object RegExp]';\r\n  var MAP_TAG = '[object Map]';\r\n  var NUMBER_TAG = '[object Number]';\r\n  var OBJECT_TAG = '[object Object]';\r\n  var SET_TAG = '[object Set]';\r\n  var STRING_TAG = '[object String]';\r\n  var toString = Object.prototype.toString;\r\n  function createComparator(_a) {\r\n      var areArraysEqual = _a.areArraysEqual, areDatesEqual = _a.areDatesEqual, areMapsEqual = _a.areMapsEqual, areObjectsEqual = _a.areObjectsEqual, areRegExpsEqual = _a.areRegExpsEqual, areSetsEqual = _a.areSetsEqual, createIsNestedEqual = _a.createIsNestedEqual;\r\n      var isEqual = createIsNestedEqual(comparator);\r\n      /**\r\n       * compare the value of the two objects and return true if they are equivalent in values\r\n       */\r\n      function comparator(a, b, meta) {\r\n          // If the items are strictly equal, no need to do a value comparison.\r\n          if (a === b) {\r\n              return true;\r\n          }\r\n          // If the items are not non-nullish objects, then the only possibility\r\n          // of them being equal but not strictly is if they are both `NaN`. Since\r\n          // `NaN` is uniquely not equal to itself, we can use self-comparison of\r\n          // both objects, which is faster than `isNaN()`.\r\n          if (!a || !b || typeof a !== 'object' || typeof b !== 'object') {\r\n              return a !== a && b !== b;\r\n          }\r\n          // Checks are listed in order of commonality of use-case:\r\n          //   1. Common complex object types (plain object, array)\r\n          //   2. Common data values (date, regexp)\r\n          //   3. Less-common complex object types (map, set)\r\n          //   4. Less-common data values (promise, primitive wrappers)\r\n          // Inherently this is both subjective and assumptive, however\r\n          // when reviewing comparable libraries in the wild this order\r\n          // appears to be generally consistent.\r\n          // `isPlainObject` only checks against the object's own realm. Cross-realm\r\n          // comparisons are rare, and will be handled in the ultimate fallback, so\r\n          // we can avoid the `toString.call()` cost unless necessary.\r\n          if (isPlainObject(a) && isPlainObject(b)) {\r\n              return areObjectsEqual(a, b, isEqual, meta);\r\n          }\r\n          // `isArray()` works on subclasses and is cross-realm, so we can again avoid\r\n          // the `toString.call()` cost unless necessary by just checking if either\r\n          // and then both are arrays.\r\n          var aArray = Array.isArray(a);\r\n          var bArray = Array.isArray(b);\r\n          if (aArray || bArray) {\r\n              return aArray === bArray && areArraysEqual(a, b, isEqual, meta);\r\n          }\r\n          // Since this is a custom object, use the classic `toString.call()` to get its\r\n          // type. This is reasonably performant in modern environments like v8 and\r\n          // SpiderMonkey, and allows for cross-realm comparison when other checks like\r\n          // `instanceof` do not.\r\n          var aTag = toString.call(a);\r\n          if (aTag !== toString.call(b)) {\r\n              return false;\r\n          }\r\n          if (aTag === DATE_TAG) {\r\n              // `getTime()` showed better results compared to alternatives like `valueOf()`\r\n              // or the unary `+` operator.\r\n              return areDatesEqual(a, b, isEqual, meta);\r\n          }\r\n          if (aTag === REG_EXP_TAG) {\r\n              return areRegExpsEqual(a, b, isEqual, meta);\r\n          }\r\n          if (aTag === MAP_TAG) {\r\n              return areMapsEqual(a, b, isEqual, meta);\r\n          }\r\n          if (aTag === SET_TAG) {\r\n              return areSetsEqual(a, b, isEqual, meta);\r\n          }\r\n          // If a simple object tag, then we can prioritize a simple object comparison because\r\n          // it is likely a custom class. If an arguments tag, it should be treated as a standard\r\n          // object.\r\n          if (aTag === OBJECT_TAG || aTag === ARGUMENTS_TAG) {\r\n              // The exception for value comparison is `Promise`-like contracts. These should be\r\n              // treated the same as standard `Promise` objects, which means strict equality.\r\n              return isPromiseLike(a) || isPromiseLike(b)\r\n                  ? false\r\n                  : areObjectsEqual(a, b, isEqual, meta);\r\n          }\r\n          // As the penultimate fallback, check if the values passed are primitive wrappers. This\r\n          // is very rare in modern JS, which is why it is deprioritized compared to all other object\r\n          // types.\r\n          if (aTag === BOOLEAN_TAG || aTag === NUMBER_TAG || aTag === STRING_TAG) {\r\n              return sameValueZeroEqual(a.valueOf(), b.valueOf());\r\n          }\r\n          // If not matching any tags that require a specific type of comparison, then we hard-code false because\r\n          // the only thing remaining is strict equality, which has already been compared. This is for a few reasons:\r\n          //   - Certain types that cannot be introspected (e.g., `WeakMap`). For these types, this is the only\r\n          //     comparison that can be made.\r\n          //   - For types that can be introspected, but rarely have requirements to be compared\r\n          //     (`ArrayBuffer`, `DataView`, etc.), the cost is avoided to prioritize the common\r\n          //     use-cases (may be included in a future release, if requested enough).\r\n          //   - For types that can be introspected but do not have an objective definition of what\r\n          //     equality is (`Error`, etc.), the subjective decision is to be conservative and strictly compare.\r\n          // In all cases, these decisions should be reevaluated based on changes to the language and\r\n          // common development practices.\r\n          return false;\r\n      }\r\n      return comparator;\r\n  }\n\n  /**\r\n   * Whether the arrays are equal in value.\r\n   */\r\n  function areArraysEqual(a, b, isEqual, meta) {\r\n      var index = a.length;\r\n      if (b.length !== index) {\r\n          return false;\r\n      }\r\n      // Decrementing `while` showed faster results than either incrementing or\r\n      // decrementing `for` loop and than an incrementing `while` loop. Declarative\r\n      // methods like `some` / `every` were not used to avoid incurring the garbage\r\n      // cost of anonymous callbacks.\r\n      while (index-- > 0) {\r\n          if (!isEqual(a[index], b[index], index, index, a, b, meta)) {\r\n              return false;\r\n          }\r\n      }\r\n      return true;\r\n  }\r\n  /**\r\n   * Whether the arrays are equal in value, including circular references.\r\n   */\r\n  var areArraysEqualCircular = createIsCircular(areArraysEqual);\n\n  /**\r\n   * Whether the dates passed are equal in value.\r\n   *\r\n   * @NOTE\r\n   * This is a standalone function instead of done inline in the comparator\r\n   * to allow for overrides.\r\n   */\r\n  function areDatesEqual(a, b) {\r\n      return sameValueZeroEqual(a.valueOf(), b.valueOf());\r\n  }\n\n  /**\r\n   * Whether the `Map`s are equal in value.\r\n   */\r\n  function areMapsEqual(a, b, isEqual, meta) {\r\n      var isValueEqual = a.size === b.size;\r\n      if (!isValueEqual) {\r\n          return false;\r\n      }\r\n      if (!a.size) {\r\n          return true;\r\n      }\r\n      // The use of `forEach()` is to avoid the transpilation cost of `for...of` comparisons, and\r\n      // the inability to control the performance of the resulting code. It also avoids excessive\r\n      // iteration compared to doing comparisons of `keys()` and `values()`. As a result, though,\r\n      // we cannot short-circuit the iterations; bookkeeping must be done to short-circuit the\r\n      // equality checks themselves.\r\n      var matchedIndices = {};\r\n      var indexA = 0;\r\n      a.forEach(function (aValue, aKey) {\r\n          if (!isValueEqual) {\r\n              return;\r\n          }\r\n          var hasMatch = false;\r\n          var matchIndexB = 0;\r\n          b.forEach(function (bValue, bKey) {\r\n              if (!hasMatch &&\r\n                  !matchedIndices[matchIndexB] &&\r\n                  (hasMatch =\r\n                      isEqual(aKey, bKey, indexA, matchIndexB, a, b, meta) &&\r\n                          isEqual(aValue, bValue, aKey, bKey, a, b, meta))) {\r\n                  matchedIndices[matchIndexB] = true;\r\n              }\r\n              matchIndexB++;\r\n          });\r\n          indexA++;\r\n          isValueEqual = hasMatch;\r\n      });\r\n      return isValueEqual;\r\n  }\r\n  /**\r\n   * Whether the `Map`s are equal in value, including circular references.\r\n   */\r\n  var areMapsEqualCircular = createIsCircular(areMapsEqual);\n\n  var OWNER = '_owner';\r\n  var hasOwnProperty = Object.prototype.hasOwnProperty;\r\n  /**\r\n   * Whether the objects are equal in value.\r\n   */\r\n  function areObjectsEqual(a, b, isEqual, meta) {\r\n      var keysA = Object.keys(a);\r\n      var index = keysA.length;\r\n      if (Object.keys(b).length !== index) {\r\n          return false;\r\n      }\r\n      var key;\r\n      // Decrementing `while` showed faster results than either incrementing or\r\n      // decrementing `for` loop and than an incrementing `while` loop. Declarative\r\n      // methods like `some` / `every` were not used to avoid incurring the garbage\r\n      // cost of anonymous callbacks.\r\n      while (index-- > 0) {\r\n          key = keysA[index];\r\n          if (key === OWNER) {\r\n              var reactElementA = !!a.$$typeof;\r\n              var reactElementB = !!b.$$typeof;\r\n              if ((reactElementA || reactElementB) && reactElementA !== reactElementB) {\r\n                  return false;\r\n              }\r\n          }\r\n          if (!hasOwnProperty.call(b, key) ||\r\n              !isEqual(a[key], b[key], key, key, a, b, meta)) {\r\n              return false;\r\n          }\r\n      }\r\n      return true;\r\n  }\r\n  /**\r\n   * Whether the objects are equal in value, including circular references.\r\n   */\r\n  var areObjectsEqualCircular = createIsCircular(areObjectsEqual);\n\n  /**\r\n   * Whether the regexps passed are equal in value.\r\n   *\r\n   * @NOTE\r\n   * This is a standalone function instead of done inline in the comparator\r\n   * to allow for overrides. An example of this would be supporting a\r\n   * pre-ES2015 environment where the `flags` property is not available.\r\n   */\r\n  function areRegExpsEqual(a, b) {\r\n      return a.source === b.source && a.flags === b.flags;\r\n  }\n\n  /**\r\n   * Whether the `Set`s are equal in value.\r\n   */\r\n  function areSetsEqual(a, b, isEqual, meta) {\r\n      var isValueEqual = a.size === b.size;\r\n      if (!isValueEqual) {\r\n          return false;\r\n      }\r\n      if (!a.size) {\r\n          return true;\r\n      }\r\n      // The use of `forEach()` is to avoid the transpilation cost of `for...of` comparisons, and\r\n      // the inability to control the performance of the resulting code. It also avoids excessive\r\n      // iteration compared to doing comparisons of `keys()` and `values()`. As a result, though,\r\n      // we cannot short-circuit the iterations; bookkeeping must be done to short-circuit the\r\n      // equality checks themselves.\r\n      var matchedIndices = {};\r\n      a.forEach(function (aValue, aKey) {\r\n          if (!isValueEqual) {\r\n              return;\r\n          }\r\n          var hasMatch = false;\r\n          var matchIndex = 0;\r\n          b.forEach(function (bValue, bKey) {\r\n              if (!hasMatch &&\r\n                  !matchedIndices[matchIndex] &&\r\n                  (hasMatch = isEqual(aValue, bValue, aKey, bKey, a, b, meta))) {\r\n                  matchedIndices[matchIndex] = true;\r\n              }\r\n              matchIndex++;\r\n          });\r\n          isValueEqual = hasMatch;\r\n      });\r\n      return isValueEqual;\r\n  }\r\n  /**\r\n   * Whether the `Set`s are equal in value, including circular references.\r\n   */\r\n  var areSetsEqualCircular = createIsCircular(areSetsEqual);\n\n  var DEFAULT_CONFIG = Object.freeze({\r\n      areArraysEqual: areArraysEqual,\r\n      areDatesEqual: areDatesEqual,\r\n      areMapsEqual: areMapsEqual,\r\n      areObjectsEqual: areObjectsEqual,\r\n      areRegExpsEqual: areRegExpsEqual,\r\n      areSetsEqual: areSetsEqual,\r\n      createIsNestedEqual: createDefaultIsNestedEqual,\r\n  });\r\n  var DEFAULT_CIRCULAR_CONFIG = Object.freeze({\r\n      areArraysEqual: areArraysEqualCircular,\r\n      areDatesEqual: areDatesEqual,\r\n      areMapsEqual: areMapsEqualCircular,\r\n      areObjectsEqual: areObjectsEqualCircular,\r\n      areRegExpsEqual: areRegExpsEqual,\r\n      areSetsEqual: areSetsEqualCircular,\r\n      createIsNestedEqual: createDefaultIsNestedEqual,\r\n  });\r\n  var isDeepEqual = createComparator(DEFAULT_CONFIG);\r\n  /**\r\n   * Whether the items passed are deeply-equal in value.\r\n   */\r\n  function deepEqual(a, b) {\r\n      return isDeepEqual(a, b, undefined);\r\n  }\r\n  var isShallowEqual = createComparator(merge(DEFAULT_CONFIG, { createIsNestedEqual: function () { return sameValueZeroEqual; } }));\r\n  /**\r\n   * Whether the items passed are shallowly-equal in value.\r\n   */\r\n  function shallowEqual(a, b) {\r\n      return isShallowEqual(a, b, undefined);\r\n  }\r\n  var isCircularDeepEqual = createComparator(DEFAULT_CIRCULAR_CONFIG);\r\n  /**\r\n   * Whether the items passed are deeply-equal in value, including circular references.\r\n   */\r\n  function circularDeepEqual(a, b) {\r\n      return isCircularDeepEqual(a, b, new WeakMap());\r\n  }\r\n  var isCircularShallowEqual = createComparator(merge(DEFAULT_CIRCULAR_CONFIG, {\r\n      createIsNestedEqual: function () { return sameValueZeroEqual; },\r\n  }));\r\n  /**\r\n   * Whether the items passed are shallowly-equal in value, including circular references.\r\n   */\r\n  function circularShallowEqual(a, b) {\r\n      return isCircularShallowEqual(a, b, new WeakMap());\r\n  }\r\n  /**\r\n   * Create a custom equality comparison method.\r\n   *\r\n   * This can be done to create very targeted comparisons in extreme hot-path scenarios\r\n   * where the standard methods are not performant enough, but can also be used to provide\r\n   * support for legacy environments that do not support expected features like\r\n   * `RegExp.prototype.flags` out of the box.\r\n   */\r\n  function createCustomEqual(getComparatorOptions) {\r\n      return createComparator(merge(DEFAULT_CONFIG, getComparatorOptions(DEFAULT_CONFIG)));\r\n  }\r\n  /**\r\n   * Create a custom equality comparison method that handles circular references. This is very\r\n   * similar to `createCustomEqual`, with the only difference being that `meta` expects to be\r\n   * populated with a `WeakMap`-like contract.\r\n   *\r\n   * This can be done to create very targeted comparisons in extreme hot-path scenarios\r\n   * where the standard methods are not performant enough, but can also be used to provide\r\n   * support for legacy environments that do not support expected features like\r\n   * `WeakMap` out of the box.\r\n   */\r\n  function createCustomCircularEqual(getComparatorOptions) {\r\n      var comparator = createComparator(merge(DEFAULT_CIRCULAR_CONFIG, getComparatorOptions(DEFAULT_CIRCULAR_CONFIG)));\r\n      return (function (a, b, meta) {\r\n          if (meta === void 0) { meta = new WeakMap(); }\r\n          return comparator(a, b, meta);\r\n      });\r\n  }\n\n  exports.circularDeepEqual = circularDeepEqual;\n  exports.circularShallowEqual = circularShallowEqual;\n  exports.createCustomCircularEqual = createCustomCircularEqual;\n  exports.createCustomEqual = createCustomEqual;\n  exports.deepEqual = deepEqual;\n  exports.sameValueZeroEqual = sameValueZeroEqual;\n  exports.shallowEqual = shallowEqual;\n\n  Object.defineProperty(exports, '__esModule', { value: true });\n\n}));\n//# sourceMappingURL=fast-equals.js.map\n"],"names":["global","factory","exports","this","createDefaultIsNestedEqual","comparator","a","b","_indexOrKeyA","_indexOrKeyB","_parentA","_parentB","meta","createIsCircular","areItemsEqual","isEqual","cache","cachedA","cachedB","result","merge","merged","key","isPlainObject","value","isPromiseLike","sameValueZeroEqual","ARGUMENTS_TAG","BOOLEAN_TAG","DATE_TAG","REG_EXP_TAG","MAP_TAG","NUMBER_TAG","OBJECT_TAG","SET_TAG","STRING_TAG","toString","createComparator","_a","areArraysEqual","areDatesEqual","areMapsEqual","areObjectsEqual","areRegExpsEqual","areSetsEqual","createIsNestedEqual","aArray","bArray","aTag","index","areArraysEqualCircular","isValueEqual","matchedIndices","indexA","aValue","aKey","hasMatch","matchIndexB","bValue","bKey","areMapsEqualCircular","OWNER","hasOwnProperty","keysA","reactElementA","reactElementB","areObjectsEqualCircular","matchIndex","areSetsEqualCircular","DEFAULT_CONFIG","DEFAULT_CIRCULAR_CONFIG","isDeepEqual","deepEqual","isShallowEqual","shallowEqual","isCircularDeepEqual","circularDeepEqual","isCircularShallowEqual","circularShallowEqual","createCustomEqual","getComparatorOptions","createCustomCircularEqual"],"mappings":"+MAAC,SAAUA,EAAQC,EAAS,CACqCA,EAAQC,CAAO,CAGhF,GAAGC,IAAO,SAAUD,EAAS,CAM3B,SAASE,EAA2BC,EAAY,CAC5C,OAAO,SAAiBC,EAAGC,EAAGC,EAAcC,EAAcC,EAAUC,EAAUC,EAAM,CAChF,OAAOP,EAAWC,EAAGC,EAAGK,CAAI,CACtC,CACA,CAME,SAASC,EAAiBC,EAAe,CACrC,OAAO,SAAoBR,EAAGC,EAAGQ,EAASC,EAAO,CAC7C,GAAI,CAACV,GAAK,CAACC,GAAK,OAAOD,GAAM,UAAY,OAAOC,GAAM,SAClD,OAAOO,EAAcR,EAAGC,EAAGQ,EAASC,CAAK,EAE7C,IAAIC,EAAUD,EAAM,IAAIV,CAAC,EACrBY,EAAUF,EAAM,IAAIT,CAAC,EACzB,GAAIU,GAAWC,EACX,OAAOD,IAAYV,GAAKW,IAAYZ,EAExCU,EAAM,IAAIV,EAAGC,CAAC,EACdS,EAAM,IAAIT,EAAGD,CAAC,EACd,IAAIa,EAASL,EAAcR,EAAGC,EAAGQ,EAASC,CAAK,EAC/C,OAAAA,EAAM,OAAOV,CAAC,EACdU,EAAM,OAAOT,CAAC,EACPY,CACjB,CACA,CAQE,SAASC,EAAMd,EAAGC,EAAG,CACjB,IAAIc,EAAS,CAAA,EACb,QAASC,KAAOhB,EACZe,EAAOC,CAAG,EAAIhB,EAAEgB,CAAG,EAEvB,QAASA,KAAOf,EACZc,EAAOC,CAAG,EAAIf,EAAEe,CAAG,EAEvB,OAAOD,CACb,CAOE,SAASE,EAAcC,EAAO,CAC1B,OAAOA,EAAM,cAAgB,QAAUA,EAAM,aAAe,IAClE,CAIE,SAASC,EAAcD,EAAO,CAC1B,OAAO,OAAOA,EAAM,MAAS,UACnC,CAIE,SAASE,EAAmBpB,EAAGC,EAAG,CAC9B,OAAOD,IAAMC,GAAMD,IAAMA,GAAKC,IAAMA,CAC1C,CAEE,IAAIoB,EAAgB,qBAChBC,EAAc,mBACdC,EAAW,gBACXC,EAAc,kBACdC,EAAU,eACVC,EAAa,kBACbC,EAAa,kBACbC,EAAU,eACVC,EAAa,kBACbC,EAAW,OAAO,UAAU,SAChC,SAASC,EAAiBC,EAAI,CAC1B,IAAIC,EAAiBD,EAAG,eAAgBE,EAAgBF,EAAG,cAAeG,EAAeH,EAAG,aAAcI,EAAkBJ,EAAG,gBAAiBK,EAAkBL,EAAG,gBAAiBM,EAAeN,EAAG,aAAcO,EAAsBP,EAAG,oBAC3OvB,EAAU8B,EAAoBxC,CAAU,EAI5C,SAASA,EAAWC,EAAGC,EAAGK,EAAM,CAE5B,GAAIN,IAAMC,EACN,MAAO,GAMX,GAAI,CAACD,GAAK,CAACC,GAAK,OAAOD,GAAM,UAAY,OAAOC,GAAM,SAClD,OAAOD,IAAMA,GAAKC,IAAMA,EAa5B,GAAIgB,EAAcjB,CAAC,GAAKiB,EAAchB,CAAC,EACnC,OAAOmC,EAAgBpC,EAAGC,EAAGQ,EAASH,CAAI,EAK9C,IAAIkC,EAAS,MAAM,QAAQxC,CAAC,EACxByC,EAAS,MAAM,QAAQxC,CAAC,EAC5B,GAAIuC,GAAUC,EACV,OAAOD,IAAWC,GAAUR,EAAejC,EAAGC,EAAGQ,EAASH,CAAI,EAMlE,IAAIoC,EAAOZ,EAAS,KAAK9B,CAAC,EAC1B,OAAI0C,IAASZ,EAAS,KAAK7B,CAAC,EACjB,GAEPyC,IAASnB,EAGFW,EAAclC,EAAGC,EAAGQ,EAASH,CAAI,EAExCoC,IAASlB,EACFa,EAAgBrC,EAAGC,EAAGQ,EAASH,CAAI,EAE1CoC,IAASjB,EACFU,EAAanC,EAAGC,EAAGQ,EAASH,CAAI,EAEvCoC,IAASd,EACFU,EAAatC,EAAGC,EAAGQ,EAASH,CAAI,EAKvCoC,IAASf,GAAce,IAASrB,EAGzBF,EAAcnB,CAAC,GAAKmB,EAAclB,CAAC,EACpC,GACAmC,EAAgBpC,EAAGC,EAAGQ,EAASH,CAAI,EAKzCoC,IAASpB,GAAeoB,IAAShB,GAAcgB,IAASb,EACjDT,EAAmBpB,EAAE,QAAO,EAAIC,EAAE,QAAO,CAAE,EAa/C,EACjB,CACM,OAAOF,CACb,CAKE,SAASkC,EAAejC,EAAGC,EAAGQ,EAASH,EAAM,CACzC,IAAIqC,EAAQ3C,EAAE,OACd,GAAIC,EAAE,SAAW0C,EACb,MAAO,GAMX,KAAOA,KAAU,GACb,GAAI,CAAClC,EAAQT,EAAE2C,CAAK,EAAG1C,EAAE0C,CAAK,EAAGA,EAAOA,EAAO3C,EAAGC,EAAGK,CAAI,EACrD,MAAO,GAGf,MAAO,EACb,CAIE,IAAIsC,EAAyBrC,EAAiB0B,CAAc,EAS5D,SAASC,EAAclC,EAAGC,EAAG,CACzB,OAAOmB,EAAmBpB,EAAE,QAAO,EAAIC,EAAE,QAAO,CAAE,CACxD,CAKE,SAASkC,EAAanC,EAAGC,EAAGQ,EAASH,EAAM,CACvC,IAAIuC,EAAe7C,EAAE,OAASC,EAAE,KAChC,GAAI,CAAC4C,EACD,MAAO,GAEX,GAAI,CAAC7C,EAAE,KACH,MAAO,GAOX,IAAI8C,EAAiB,CAAA,EACjBC,EAAS,EACb,OAAA/C,EAAE,QAAQ,SAAUgD,EAAQC,EAAM,CAC9B,GAAKJ,EAGL,KAAIK,EAAW,GACXC,EAAc,EAClBlD,EAAE,QAAQ,SAAUmD,EAAQC,EAAM,CAC1B,CAACH,GACD,CAACJ,EAAeK,CAAW,IAC1BD,EACGzC,EAAQwC,EAAMI,EAAMN,EAAQI,EAAanD,EAAGC,EAAGK,CAAI,GAC/CG,EAAQuC,EAAQI,EAAQH,EAAMI,EAAMrD,EAAGC,EAAGK,CAAI,KACtDwC,EAAeK,CAAW,EAAI,IAElCA,GACd,CAAW,EACDJ,IACAF,EAAeK,EACzB,CAAO,EACML,CACb,CAIE,IAAIS,EAAuB/C,EAAiB4B,CAAY,EAEpDoB,EAAQ,SACRC,EAAiB,OAAO,UAAU,eAItC,SAASpB,EAAgBpC,EAAGC,EAAGQ,EAASH,EAAM,CAC1C,IAAImD,EAAQ,OAAO,KAAKzD,CAAC,EACrB2C,EAAQc,EAAM,OAClB,GAAI,OAAO,KAAKxD,CAAC,EAAE,SAAW0C,EAC1B,MAAO,GAOX,QALI3B,EAKG2B,KAAU,GAAG,CAEhB,GADA3B,EAAMyC,EAAMd,CAAK,EACb3B,IAAQuC,EAAO,CACf,IAAIG,EAAgB,CAAC,CAAC1D,EAAE,SACpB2D,EAAgB,CAAC,CAAC1D,EAAE,SACxB,IAAKyD,GAAiBC,IAAkBD,IAAkBC,EACtD,MAAO,EAEzB,CACU,GAAI,CAACH,EAAe,KAAKvD,EAAGe,CAAG,GAC3B,CAACP,EAAQT,EAAEgB,CAAG,EAAGf,EAAEe,CAAG,EAAGA,EAAKA,EAAKhB,EAAGC,EAAGK,CAAI,EAC7C,MAAO,EAErB,CACM,MAAO,EACb,CAIE,IAAIsD,EAA0BrD,EAAiB6B,CAAe,EAU9D,SAASC,EAAgBrC,EAAGC,EAAG,CAC3B,OAAOD,EAAE,SAAWC,EAAE,QAAUD,EAAE,QAAUC,EAAE,KACpD,CAKE,SAASqC,EAAatC,EAAGC,EAAGQ,EAASH,EAAM,CACvC,IAAIuC,EAAe7C,EAAE,OAASC,EAAE,KAChC,GAAI,CAAC4C,EACD,MAAO,GAEX,GAAI,CAAC7C,EAAE,KACH,MAAO,GAOX,IAAI8C,EAAiB,CAAA,EACrB,OAAA9C,EAAE,QAAQ,SAAUgD,EAAQC,EAAM,CAC9B,GAAKJ,EAGL,KAAIK,EAAW,GACXW,EAAa,EACjB5D,EAAE,QAAQ,SAAUmD,EAAQC,EAAM,CAC1B,CAACH,GACD,CAACJ,EAAee,CAAU,IACzBX,EAAWzC,EAAQuC,EAAQI,EAAQH,EAAMI,EAAMrD,EAAGC,EAAGK,CAAI,KAC1DwC,EAAee,CAAU,EAAI,IAEjCA,GACd,CAAW,EACDhB,EAAeK,EACzB,CAAO,EACML,CACb,CAIE,IAAIiB,EAAuBvD,EAAiB+B,CAAY,EAEpDyB,EAAiB,OAAO,OAAO,CAC/B,eAAgB9B,EAChB,cAAeC,EACf,aAAcC,EACd,gBAAiBC,EACjB,gBAAiBC,EACjB,aAAcC,EACd,oBAAqBxC,CAC3B,CAAG,EACGkE,EAA0B,OAAO,OAAO,CACxC,eAAgBpB,EAChB,cAAeV,EACf,aAAcoB,EACd,gBAAiBM,EACjB,gBAAiBvB,EACjB,aAAcyB,EACd,oBAAqBhE,CAC3B,CAAG,EACGmE,EAAclC,EAAiBgC,CAAc,EAIjD,SAASG,EAAUlE,EAAGC,EAAG,CACrB,OAAOgE,EAAYjE,EAAGC,EAAG,MAAS,CACxC,CACE,IAAIkE,EAAiBpC,EAAiBjB,EAAMiD,EAAgB,CAAE,oBAAqB,UAAY,CAAE,OAAO3C,CAAmB,CAAE,CAAE,CAAC,EAIhI,SAASgD,GAAapE,EAAGC,EAAG,CACxB,OAAOkE,EAAenE,EAAGC,EAAG,MAAS,CAC3C,CACE,IAAIoE,GAAsBtC,EAAiBiC,CAAuB,EAIlE,SAASM,GAAkBtE,EAAGC,EAAG,CAC7B,OAAOoE,GAAoBrE,EAAGC,EAAG,IAAI,OAAS,CACpD,CACE,IAAIsE,GAAyBxC,EAAiBjB,EAAMkD,EAAyB,CACzE,oBAAqB,UAAY,CAAE,OAAO5C,CAAmB,EAChE,CAAC,EAIF,SAASoD,GAAqBxE,EAAGC,EAAG,CAChC,OAAOsE,GAAuBvE,EAAGC,EAAG,IAAI,OAAS,CACvD,CASE,SAASwE,GAAkBC,EAAsB,CAC7C,OAAO3C,EAAiBjB,EAAMiD,EAAgBW,EAAqBX,CAAc,CAAC,CAAC,CACzF,CAWE,SAASY,GAA0BD,EAAsB,CACrD,IAAI3E,EAAagC,EAAiBjB,EAAMkD,EAAyBU,EAAqBV,CAAuB,CAAC,CAAC,EAC/G,OAAQ,SAAUhE,EAAGC,EAAGK,EAAM,CAC1B,OAAIA,IAAS,SAAUA,EAAO,IAAI,SAC3BP,EAAWC,EAAGC,EAAGK,CAAI,CACtC,EACA,CAEEV,EAAQ,kBAAoB0E,GAC5B1E,EAAQ,qBAAuB4E,GAC/B5E,EAAQ,0BAA4B+E,GACpC/E,EAAQ,kBAAoB6E,GAC5B7E,EAAQ,UAAYsE,EACpBtE,EAAQ,mBAAqBwB,EAC7BxB,EAAQ,aAAewE,GAEvB,OAAO,eAAexE,EAAS,aAAc,CAAE,MAAO,GAAM,CAE9D,EAAC","x_google_ignoreList":[0]}

package/dist/lib/vendor/fast-equals/dist/fast-equals.js

@@ -0,0 +1,179 @@
+import { __module as A } from "../../../_virtual/fast-equals.js";
+var ir = A.exports, x;
+function fr() {
+  return x ? A.exports : (x = 1, (function(sr, m) {
+    (function(v, O) {
+      O(m);
+    })(ir, (function(v) {
+      function O(r) {
+        return function(t, a, u, l, c, f, i) {
+          return r(t, a, i);
+        };
+      }
+      function j(r) {
+        return function(t, a, u, l) {
+          if (!t || !a || typeof t != "object" || typeof a != "object")
+            return r(t, a, u, l);
+          var c = l.get(t), f = l.get(a);
+          if (c && f)
+            return c === a && f === t;
+          l.set(t, a), l.set(a, t);
+          var i = r(t, a, u, l);
+          return l.delete(t), l.delete(a), i;
+        };
+      }
+      function y(r, e) {
+        var t = {};
+        for (var a in r)
+          t[a] = r[a];
+        for (var a in e)
+          t[a] = e[a];
+        return t;
+      }
+      function C(r) {
+        return r.constructor === Object || r.constructor == null;
+      }
+      function _(r) {
+        return typeof r.then == "function";
+      }
+      function d(r, e) {
+        return r === e || r !== r && e !== e;
+      }
+      var k = "[object Arguments]", z = "[object Boolean]", B = "[object Date]", P = "[object RegExp]", F = "[object Map]", L = "[object Number]", U = "[object Object]", V = "[object Set]", W = "[object String]", S = Object.prototype.toString;
+      function p(r) {
+        var e = r.areArraysEqual, t = r.areDatesEqual, a = r.areMapsEqual, u = r.areObjectsEqual, l = r.areRegExpsEqual, c = r.areSetsEqual, f = r.createIsNestedEqual, i = f(o);
+        function o(n, s, E) {
+          if (n === s)
+            return !0;
+          if (!n || !s || typeof n != "object" || typeof s != "object")
+            return n !== n && s !== s;
+          if (C(n) && C(s))
+            return u(n, s, i, E);
+          var G = Array.isArray(n), R = Array.isArray(s);
+          if (G || R)
+            return G === R && e(n, s, i, E);
+          var q = S.call(n);
+          return q !== S.call(s) ? !1 : q === B ? t(n, s, i, E) : q === P ? l(n, s, i, E) : q === F ? a(n, s, i, E) : q === V ? c(n, s, i, E) : q === U || q === k ? _(n) || _(s) ? !1 : u(n, s, i, E) : q === z || q === L || q === W ? d(n.valueOf(), s.valueOf()) : !1;
+        }
+        return o;
+      }
+      function T(r, e, t, a) {
+        var u = r.length;
+        if (e.length !== u)
+          return !1;
+        for (; u-- > 0; )
+          if (!t(r[u], e[u], u, u, r, e, a))
+            return !1;
+        return !0;
+      }
+      var Z = j(T);
+      function M(r, e) {
+        return d(r.valueOf(), e.valueOf());
+      }
+      function I(r, e, t, a) {
+        var u = r.size === e.size;
+        if (!u)
+          return !1;
+        if (!r.size)
+          return !0;
+        var l = {}, c = 0;
+        return r.forEach(function(f, i) {
+          if (u) {
+            var o = !1, n = 0;
+            e.forEach(function(s, E) {
+              !o && !l[n] && (o = t(i, E, c, n, r, e, a) && t(f, s, i, E, r, e, a)) && (l[n] = !0), n++;
+            }), c++, u = o;
+          }
+        }), u;
+      }
+      var J = j(I), X = "_owner", H = Object.prototype.hasOwnProperty;
+      function N(r, e, t, a) {
+        var u = Object.keys(r), l = u.length;
+        if (Object.keys(e).length !== l)
+          return !1;
+        for (var c; l-- > 0; ) {
+          if (c = u[l], c === X) {
+            var f = !!r.$$typeof, i = !!e.$$typeof;
+            if ((f || i) && f !== i)
+              return !1;
+          }
+          if (!H.call(e, c) || !t(r[c], e[c], c, c, r, e, a))
+            return !1;
+        }
+        return !0;
+      }
+      var K = j(N);
+      function w(r, e) {
+        return r.source === e.source && r.flags === e.flags;
+      }
+      function D(r, e, t, a) {
+        var u = r.size === e.size;
+        if (!u)
+          return !1;
+        if (!r.size)
+          return !0;
+        var l = {};
+        return r.forEach(function(c, f) {
+          if (u) {
+            var i = !1, o = 0;
+            e.forEach(function(n, s) {
+              !i && !l[o] && (i = t(c, n, f, s, r, e, a)) && (l[o] = !0), o++;
+            }), u = i;
+          }
+        }), u;
+      }
+      var Q = j(D), h = Object.freeze({
+        areArraysEqual: T,
+        areDatesEqual: M,
+        areMapsEqual: I,
+        areObjectsEqual: N,
+        areRegExpsEqual: w,
+        areSetsEqual: D,
+        createIsNestedEqual: O
+      }), g = Object.freeze({
+        areArraysEqual: Z,
+        areDatesEqual: M,
+        areMapsEqual: J,
+        areObjectsEqual: K,
+        areRegExpsEqual: w,
+        areSetsEqual: Q,
+        createIsNestedEqual: O
+      }), Y = p(h);
+      function $(r, e) {
+        return Y(r, e, void 0);
+      }
+      var b = p(y(h, { createIsNestedEqual: function() {
+        return d;
+      } }));
+      function rr(r, e) {
+        return b(r, e, void 0);
+      }
+      var er = p(g);
+      function ar(r, e) {
+        return er(r, e, /* @__PURE__ */ new WeakMap());
+      }
+      var ur = p(y(g, {
+        createIsNestedEqual: function() {
+          return d;
+        }
+      }));
+      function tr(r, e) {
+        return ur(r, e, /* @__PURE__ */ new WeakMap());
+      }
+      function nr(r) {
+        return p(y(h, r(h)));
+      }
+      function lr(r) {
+        var e = p(y(g, r(g)));
+        return (function(t, a, u) {
+          return u === void 0 && (u = /* @__PURE__ */ new WeakMap()), e(t, a, u);
+        });
+      }
+      v.circularDeepEqual = ar, v.circularShallowEqual = tr, v.createCustomCircularEqual = lr, v.createCustomEqual = nr, v.deepEqual = $, v.sameValueZeroEqual = d, v.shallowEqual = rr, Object.defineProperty(v, "__esModule", { value: !0 });
+    }));
+  })(A, A.exports), A.exports);
+}
+export {
+  fr as __require
+};
+//# sourceMappingURL=fast-equals.js.map

package/dist/lib/vendor/fast-equals/dist/fast-equals.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fast-equals.js","sources":["../../../../../node_modules/fast-equals/dist/fast-equals.js"],"sourcesContent":["(function (global, factory) {\n  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :\n  typeof define === 'function' && define.amd ? define(['exports'], factory) :\n  (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global[\"fast-equals\"] = {}));\n})(this, (function (exports) { 'use strict';\n\n  /**\r\n   * Default equality comparator pass-through, used as the standard `isEqual` creator for\r\n   * use inside the built comparator.\r\n   */\r\n  function createDefaultIsNestedEqual(comparator) {\r\n      return function isEqual(a, b, _indexOrKeyA, _indexOrKeyB, _parentA, _parentB, meta) {\r\n          return comparator(a, b, meta);\r\n      };\r\n  }\r\n  /**\r\n   * Wrap the provided `areItemsEqual` method to manage the circular cache, allowing\r\n   * for circular references to be safely included in the comparison without creating\r\n   * stack overflows.\r\n   */\r\n  function createIsCircular(areItemsEqual) {\r\n      return function isCircular(a, b, isEqual, cache) {\r\n          if (!a || !b || typeof a !== 'object' || typeof b !== 'object') {\r\n              return areItemsEqual(a, b, isEqual, cache);\r\n          }\r\n          var cachedA = cache.get(a);\r\n          var cachedB = cache.get(b);\r\n          if (cachedA && cachedB) {\r\n              return cachedA === b && cachedB === a;\r\n          }\r\n          cache.set(a, b);\r\n          cache.set(b, a);\r\n          var result = areItemsEqual(a, b, isEqual, cache);\r\n          cache.delete(a);\r\n          cache.delete(b);\r\n          return result;\r\n      };\r\n  }\r\n  /**\r\n   * Targeted shallow merge of two objects.\r\n   *\r\n   * @NOTE\r\n   * This exists as a tinier compiled version of the `__assign` helper that\r\n   * `tsc` injects in case of `Object.assign` not being present.\r\n   */\r\n  function merge(a, b) {\r\n      var merged = {};\r\n      for (var key in a) {\r\n          merged[key] = a[key];\r\n      }\r\n      for (var key in b) {\r\n          merged[key] = b[key];\r\n      }\r\n      return merged;\r\n  }\r\n  /**\r\n   * Whether the value is a plain object.\r\n   *\r\n   * @NOTE\r\n   * This is a same-realm compariosn only.\r\n   */\r\n  function isPlainObject(value) {\r\n      return value.constructor === Object || value.constructor == null;\r\n  }\r\n  /**\r\n   * When the value is `Promise`-like, aka \"then-able\".\r\n   */\r\n  function isPromiseLike(value) {\r\n      return typeof value.then === 'function';\r\n  }\r\n  /**\r\n   * Whether the values passed are strictly equal or both NaN.\r\n   */\r\n  function sameValueZeroEqual(a, b) {\r\n      return a === b || (a !== a && b !== b);\r\n  }\n\n  var ARGUMENTS_TAG = '[object Arguments]';\r\n  var BOOLEAN_TAG = '[object Boolean]';\r\n  var DATE_TAG = '[object Date]';\r\n  var REG_EXP_TAG = '[object RegExp]';\r\n  var MAP_TAG = '[object Map]';\r\n  var NUMBER_TAG = '[object Number]';\r\n  var OBJECT_TAG = '[object Object]';\r\n  var SET_TAG = '[object Set]';\r\n  var STRING_TAG = '[object String]';\r\n  var toString = Object.prototype.toString;\r\n  function createComparator(_a) {\r\n      var areArraysEqual = _a.areArraysEqual, areDatesEqual = _a.areDatesEqual, areMapsEqual = _a.areMapsEqual, areObjectsEqual = _a.areObjectsEqual, areRegExpsEqual = _a.areRegExpsEqual, areSetsEqual = _a.areSetsEqual, createIsNestedEqual = _a.createIsNestedEqual;\r\n      var isEqual = createIsNestedEqual(comparator);\r\n      /**\r\n       * compare the value of the two objects and return true if they are equivalent in values\r\n       */\r\n      function comparator(a, b, meta) {\r\n          // If the items are strictly equal, no need to do a value comparison.\r\n          if (a === b) {\r\n              return true;\r\n          }\r\n          // If the items are not non-nullish objects, then the only possibility\r\n          // of them being equal but not strictly is if they are both `NaN`. Since\r\n          // `NaN` is uniquely not equal to itself, we can use self-comparison of\r\n          // both objects, which is faster than `isNaN()`.\r\n          if (!a || !b || typeof a !== 'object' || typeof b !== 'object') {\r\n              return a !== a && b !== b;\r\n          }\r\n          // Checks are listed in order of commonality of use-case:\r\n          //   1. Common complex object types (plain object, array)\r\n          //   2. Common data values (date, regexp)\r\n          //   3. Less-common complex object types (map, set)\r\n          //   4. Less-common data values (promise, primitive wrappers)\r\n          // Inherently this is both subjective and assumptive, however\r\n          // when reviewing comparable libraries in the wild this order\r\n          // appears to be generally consistent.\r\n          // `isPlainObject` only checks against the object's own realm. Cross-realm\r\n          // comparisons are rare, and will be handled in the ultimate fallback, so\r\n          // we can avoid the `toString.call()` cost unless necessary.\r\n          if (isPlainObject(a) && isPlainObject(b)) {\r\n              return areObjectsEqual(a, b, isEqual, meta);\r\n          }\r\n          // `isArray()` works on subclasses and is cross-realm, so we can again avoid\r\n          // the `toString.call()` cost unless necessary by just checking if either\r\n          // and then both are arrays.\r\n          var aArray = Array.isArray(a);\r\n          var bArray = Array.isArray(b);\r\n          if (aArray || bArray) {\r\n              return aArray === bArray && areArraysEqual(a, b, isEqual, meta);\r\n          }\r\n          // Since this is a custom object, use the classic `toString.call()` to get its\r\n          // type. This is reasonably performant in modern environments like v8 and\r\n          // SpiderMonkey, and allows for cross-realm comparison when other checks like\r\n          // `instanceof` do not.\r\n          var aTag = toString.call(a);\r\n          if (aTag !== toString.call(b)) {\r\n              return false;\r\n          }\r\n          if (aTag === DATE_TAG) {\r\n              // `getTime()` showed better results compared to alternatives like `valueOf()`\r\n              // or the unary `+` operator.\r\n              return areDatesEqual(a, b, isEqual, meta);\r\n          }\r\n          if (aTag === REG_EXP_TAG) {\r\n              return areRegExpsEqual(a, b, isEqual, meta);\r\n          }\r\n          if (aTag === MAP_TAG) {\r\n              return areMapsEqual(a, b, isEqual, meta);\r\n          }\r\n          if (aTag === SET_TAG) {\r\n              return areSetsEqual(a, b, isEqual, meta);\r\n          }\r\n          // If a simple object tag, then we can prioritize a simple object comparison because\r\n          // it is likely a custom class. If an arguments tag, it should be treated as a standard\r\n          // object.\r\n          if (aTag === OBJECT_TAG || aTag === ARGUMENTS_TAG) {\r\n              // The exception for value comparison is `Promise`-like contracts. These should be\r\n              // treated the same as standard `Promise` objects, which means strict equality.\r\n              return isPromiseLike(a) || isPromiseLike(b)\r\n                  ? false\r\n                  : areObjectsEqual(a, b, isEqual, meta);\r\n          }\r\n          // As the penultimate fallback, check if the values passed are primitive wrappers. This\r\n          // is very rare in modern JS, which is why it is deprioritized compared to all other object\r\n          // types.\r\n          if (aTag === BOOLEAN_TAG || aTag === NUMBER_TAG || aTag === STRING_TAG) {\r\n              return sameValueZeroEqual(a.valueOf(), b.valueOf());\r\n          }\r\n          // If not matching any tags that require a specific type of comparison, then we hard-code false because\r\n          // the only thing remaining is strict equality, which has already been compared. This is for a few reasons:\r\n          //   - Certain types that cannot be introspected (e.g., `WeakMap`). For these types, this is the only\r\n          //     comparison that can be made.\r\n          //   - For types that can be introspected, but rarely have requirements to be compared\r\n          //     (`ArrayBuffer`, `DataView`, etc.), the cost is avoided to prioritize the common\r\n          //     use-cases (may be included in a future release, if requested enough).\r\n          //   - For types that can be introspected but do not have an objective definition of what\r\n          //     equality is (`Error`, etc.), the subjective decision is to be conservative and strictly compare.\r\n          // In all cases, these decisions should be reevaluated based on changes to the language and\r\n          // common development practices.\r\n          return false;\r\n      }\r\n      return comparator;\r\n  }\n\n  /**\r\n   * Whether the arrays are equal in value.\r\n   */\r\n  function areArraysEqual(a, b, isEqual, meta) {\r\n      var index = a.length;\r\n      if (b.length !== index) {\r\n          return false;\r\n      }\r\n      // Decrementing `while` showed faster results than either incrementing or\r\n      // decrementing `for` loop and than an incrementing `while` loop. Declarative\r\n      // methods like `some` / `every` were not used to avoid incurring the garbage\r\n      // cost of anonymous callbacks.\r\n      while (index-- > 0) {\r\n          if (!isEqual(a[index], b[index], index, index, a, b, meta)) {\r\n              return false;\r\n          }\r\n      }\r\n      return true;\r\n  }\r\n  /**\r\n   * Whether the arrays are equal in value, including circular references.\r\n   */\r\n  var areArraysEqualCircular = createIsCircular(areArraysEqual);\n\n  /**\r\n   * Whether the dates passed are equal in value.\r\n   *\r\n   * @NOTE\r\n   * This is a standalone function instead of done inline in the comparator\r\n   * to allow for overrides.\r\n   */\r\n  function areDatesEqual(a, b) {\r\n      return sameValueZeroEqual(a.valueOf(), b.valueOf());\r\n  }\n\n  /**\r\n   * Whether the `Map`s are equal in value.\r\n   */\r\n  function areMapsEqual(a, b, isEqual, meta) {\r\n      var isValueEqual = a.size === b.size;\r\n      if (!isValueEqual) {\r\n          return false;\r\n      }\r\n      if (!a.size) {\r\n          return true;\r\n      }\r\n      // The use of `forEach()` is to avoid the transpilation cost of `for...of` comparisons, and\r\n      // the inability to control the performance of the resulting code. It also avoids excessive\r\n      // iteration compared to doing comparisons of `keys()` and `values()`. As a result, though,\r\n      // we cannot short-circuit the iterations; bookkeeping must be done to short-circuit the\r\n      // equality checks themselves.\r\n      var matchedIndices = {};\r\n      var indexA = 0;\r\n      a.forEach(function (aValue, aKey) {\r\n          if (!isValueEqual) {\r\n              return;\r\n          }\r\n          var hasMatch = false;\r\n          var matchIndexB = 0;\r\n          b.forEach(function (bValue, bKey) {\r\n              if (!hasMatch &&\r\n                  !matchedIndices[matchIndexB] &&\r\n                  (hasMatch =\r\n                      isEqual(aKey, bKey, indexA, matchIndexB, a, b, meta) &&\r\n                          isEqual(aValue, bValue, aKey, bKey, a, b, meta))) {\r\n                  matchedIndices[matchIndexB] = true;\r\n              }\r\n              matchIndexB++;\r\n          });\r\n          indexA++;\r\n          isValueEqual = hasMatch;\r\n      });\r\n      return isValueEqual;\r\n  }\r\n  /**\r\n   * Whether the `Map`s are equal in value, including circular references.\r\n   */\r\n  var areMapsEqualCircular = createIsCircular(areMapsEqual);\n\n  var OWNER = '_owner';\r\n  var hasOwnProperty = Object.prototype.hasOwnProperty;\r\n  /**\r\n   * Whether the objects are equal in value.\r\n   */\r\n  function areObjectsEqual(a, b, isEqual, meta) {\r\n      var keysA = Object.keys(a);\r\n      var index = keysA.length;\r\n      if (Object.keys(b).length !== index) {\r\n          return false;\r\n      }\r\n      var key;\r\n      // Decrementing `while` showed faster results than either incrementing or\r\n      // decrementing `for` loop and than an incrementing `while` loop. Declarative\r\n      // methods like `some` / `every` were not used to avoid incurring the garbage\r\n      // cost of anonymous callbacks.\r\n      while (index-- > 0) {\r\n          key = keysA[index];\r\n          if (key === OWNER) {\r\n              var reactElementA = !!a.$$typeof;\r\n              var reactElementB = !!b.$$typeof;\r\n              if ((reactElementA || reactElementB) && reactElementA !== reactElementB) {\r\n                  return false;\r\n              }\r\n          }\r\n          if (!hasOwnProperty.call(b, key) ||\r\n              !isEqual(a[key], b[key], key, key, a, b, meta)) {\r\n              return false;\r\n          }\r\n      }\r\n      return true;\r\n  }\r\n  /**\r\n   * Whether the objects are equal in value, including circular references.\r\n   */\r\n  var areObjectsEqualCircular = createIsCircular(areObjectsEqual);\n\n  /**\r\n   * Whether the regexps passed are equal in value.\r\n   *\r\n   * @NOTE\r\n   * This is a standalone function instead of done inline in the comparator\r\n   * to allow for overrides. An example of this would be supporting a\r\n   * pre-ES2015 environment where the `flags` property is not available.\r\n   */\r\n  function areRegExpsEqual(a, b) {\r\n      return a.source === b.source && a.flags === b.flags;\r\n  }\n\n  /**\r\n   * Whether the `Set`s are equal in value.\r\n   */\r\n  function areSetsEqual(a, b, isEqual, meta) {\r\n      var isValueEqual = a.size === b.size;\r\n      if (!isValueEqual) {\r\n          return false;\r\n      }\r\n      if (!a.size) {\r\n          return true;\r\n      }\r\n      // The use of `forEach()` is to avoid the transpilation cost of `for...of` comparisons, and\r\n      // the inability to control the performance of the resulting code. It also avoids excessive\r\n      // iteration compared to doing comparisons of `keys()` and `values()`. As a result, though,\r\n      // we cannot short-circuit the iterations; bookkeeping must be done to short-circuit the\r\n      // equality checks themselves.\r\n      var matchedIndices = {};\r\n      a.forEach(function (aValue, aKey) {\r\n          if (!isValueEqual) {\r\n              return;\r\n          }\r\n          var hasMatch = false;\r\n          var matchIndex = 0;\r\n          b.forEach(function (bValue, bKey) {\r\n              if (!hasMatch &&\r\n                  !matchedIndices[matchIndex] &&\r\n                  (hasMatch = isEqual(aValue, bValue, aKey, bKey, a, b, meta))) {\r\n                  matchedIndices[matchIndex] = true;\r\n              }\r\n              matchIndex++;\r\n          });\r\n          isValueEqual = hasMatch;\r\n      });\r\n      return isValueEqual;\r\n  }\r\n  /**\r\n   * Whether the `Set`s are equal in value, including circular references.\r\n   */\r\n  var areSetsEqualCircular = createIsCircular(areSetsEqual);\n\n  var DEFAULT_CONFIG = Object.freeze({\r\n      areArraysEqual: areArraysEqual,\r\n      areDatesEqual: areDatesEqual,\r\n      areMapsEqual: areMapsEqual,\r\n      areObjectsEqual: areObjectsEqual,\r\n      areRegExpsEqual: areRegExpsEqual,\r\n      areSetsEqual: areSetsEqual,\r\n      createIsNestedEqual: createDefaultIsNestedEqual,\r\n  });\r\n  var DEFAULT_CIRCULAR_CONFIG = Object.freeze({\r\n      areArraysEqual: areArraysEqualCircular,\r\n      areDatesEqual: areDatesEqual,\r\n      areMapsEqual: areMapsEqualCircular,\r\n      areObjectsEqual: areObjectsEqualCircular,\r\n      areRegExpsEqual: areRegExpsEqual,\r\n      areSetsEqual: areSetsEqualCircular,\r\n      createIsNestedEqual: createDefaultIsNestedEqual,\r\n  });\r\n  var isDeepEqual = createComparator(DEFAULT_CONFIG);\r\n  /**\r\n   * Whether the items passed are deeply-equal in value.\r\n   */\r\n  function deepEqual(a, b) {\r\n      return isDeepEqual(a, b, undefined);\r\n  }\r\n  var isShallowEqual = createComparator(merge(DEFAULT_CONFIG, { createIsNestedEqual: function () { return sameValueZeroEqual; } }));\r\n  /**\r\n   * Whether the items passed are shallowly-equal in value.\r\n   */\r\n  function shallowEqual(a, b) {\r\n      return isShallowEqual(a, b, undefined);\r\n  }\r\n  var isCircularDeepEqual = createComparator(DEFAULT_CIRCULAR_CONFIG);\r\n  /**\r\n   * Whether the items passed are deeply-equal in value, including circular references.\r\n   */\r\n  function circularDeepEqual(a, b) {\r\n      return isCircularDeepEqual(a, b, new WeakMap());\r\n  }\r\n  var isCircularShallowEqual = createComparator(merge(DEFAULT_CIRCULAR_CONFIG, {\r\n      createIsNestedEqual: function () { return sameValueZeroEqual; },\r\n  }));\r\n  /**\r\n   * Whether the items passed are shallowly-equal in value, including circular references.\r\n   */\r\n  function circularShallowEqual(a, b) {\r\n      return isCircularShallowEqual(a, b, new WeakMap());\r\n  }\r\n  /**\r\n   * Create a custom equality comparison method.\r\n   *\r\n   * This can be done to create very targeted comparisons in extreme hot-path scenarios\r\n   * where the standard methods are not performant enough, but can also be used to provide\r\n   * support for legacy environments that do not support expected features like\r\n   * `RegExp.prototype.flags` out of the box.\r\n   */\r\n  function createCustomEqual(getComparatorOptions) {\r\n      return createComparator(merge(DEFAULT_CONFIG, getComparatorOptions(DEFAULT_CONFIG)));\r\n  }\r\n  /**\r\n   * Create a custom equality comparison method that handles circular references. This is very\r\n   * similar to `createCustomEqual`, with the only difference being that `meta` expects to be\r\n   * populated with a `WeakMap`-like contract.\r\n   *\r\n   * This can be done to create very targeted comparisons in extreme hot-path scenarios\r\n   * where the standard methods are not performant enough, but can also be used to provide\r\n   * support for legacy environments that do not support expected features like\r\n   * `WeakMap` out of the box.\r\n   */\r\n  function createCustomCircularEqual(getComparatorOptions) {\r\n      var comparator = createComparator(merge(DEFAULT_CIRCULAR_CONFIG, getComparatorOptions(DEFAULT_CIRCULAR_CONFIG)));\r\n      return (function (a, b, meta) {\r\n          if (meta === void 0) { meta = new WeakMap(); }\r\n          return comparator(a, b, meta);\r\n      });\r\n  }\n\n  exports.circularDeepEqual = circularDeepEqual;\n  exports.circularShallowEqual = circularShallowEqual;\n  exports.createCustomCircularEqual = createCustomCircularEqual;\n  exports.createCustomEqual = createCustomEqual;\n  exports.deepEqual = deepEqual;\n  exports.sameValueZeroEqual = sameValueZeroEqual;\n  exports.shallowEqual = shallowEqual;\n\n  Object.defineProperty(exports, '__esModule', { value: true });\n\n}));\n//# sourceMappingURL=fast-equals.js.map\n"],"names":["global","factory","exports","this","createDefaultIsNestedEqual","comparator","a","b","_indexOrKeyA","_indexOrKeyB","_parentA","_parentB","meta","createIsCircular","areItemsEqual","isEqual","cache","cachedA","cachedB","result","merge","merged","key","isPlainObject","value","isPromiseLike","sameValueZeroEqual","ARGUMENTS_TAG","BOOLEAN_TAG","DATE_TAG","REG_EXP_TAG","MAP_TAG","NUMBER_TAG","OBJECT_TAG","SET_TAG","STRING_TAG","toString","createComparator","_a","areArraysEqual","areDatesEqual","areMapsEqual","areObjectsEqual","areRegExpsEqual","areSetsEqual","createIsNestedEqual","aArray","bArray","aTag","index","areArraysEqualCircular","isValueEqual","matchedIndices","indexA","aValue","aKey","hasMatch","matchIndexB","bValue","bKey","areMapsEqualCircular","OWNER","hasOwnProperty","keysA","reactElementA","reactElementB","areObjectsEqualCircular","matchIndex","areSetsEqualCircular","DEFAULT_CONFIG","DEFAULT_CIRCULAR_CONFIG","isDeepEqual","deepEqual","isShallowEqual","shallowEqual","isCircularDeepEqual","circularDeepEqual","isCircularShallowEqual","circularShallowEqual","createCustomEqual","getComparatorOptions","createCustomCircularEqual"],"mappings":";;;;AAAA,KAAC,SAAUA,GAAQC,GAAS;AACqC,MAAAA,EAAQC,CAAO;AAAA,IAGhF,GAAGC,KAAO,SAAUD,GAAS;AAM3B,eAASE,EAA2BC,GAAY;AAC5C,eAAO,SAAiBC,GAAGC,GAAGC,GAAcC,GAAcC,GAAUC,GAAUC,GAAM;AAChF,iBAAOP,EAAWC,GAAGC,GAAGK,CAAI;AAAA,QACtC;AAAA,MACA;AAME,eAASC,EAAiBC,GAAe;AACrC,eAAO,SAAoBR,GAAGC,GAAGQ,GAASC,GAAO;AAC7C,cAAI,CAACV,KAAK,CAACC,KAAK,OAAOD,KAAM,YAAY,OAAOC,KAAM;AAClD,mBAAOO,EAAcR,GAAGC,GAAGQ,GAASC,CAAK;AAE7C,cAAIC,IAAUD,EAAM,IAAIV,CAAC,GACrBY,IAAUF,EAAM,IAAIT,CAAC;AACzB,cAAIU,KAAWC;AACX,mBAAOD,MAAYV,KAAKW,MAAYZ;AAExC,UAAAU,EAAM,IAAIV,GAAGC,CAAC,GACdS,EAAM,IAAIT,GAAGD,CAAC;AACd,cAAIa,IAASL,EAAcR,GAAGC,GAAGQ,GAASC,CAAK;AAC/C,iBAAAA,EAAM,OAAOV,CAAC,GACdU,EAAM,OAAOT,CAAC,GACPY;AAAA,QACjB;AAAA,MACA;AAQE,eAASC,EAAMd,GAAGC,GAAG;AACjB,YAAIc,IAAS,CAAA;AACb,iBAASC,KAAOhB;AACZ,UAAAe,EAAOC,CAAG,IAAIhB,EAAEgB,CAAG;AAEvB,iBAASA,KAAOf;AACZ,UAAAc,EAAOC,CAAG,IAAIf,EAAEe,CAAG;AAEvB,eAAOD;AAAA,MACb;AAOE,eAASE,EAAcC,GAAO;AAC1B,eAAOA,EAAM,gBAAgB,UAAUA,EAAM,eAAe;AAAA,MAClE;AAIE,eAASC,EAAcD,GAAO;AAC1B,eAAO,OAAOA,EAAM,QAAS;AAAA,MACnC;AAIE,eAASE,EAAmBpB,GAAGC,GAAG;AAC9B,eAAOD,MAAMC,KAAMD,MAAMA,KAAKC,MAAMA;AAAA,MAC1C;AAEE,UAAIoB,IAAgB,sBAChBC,IAAc,oBACdC,IAAW,iBACXC,IAAc,mBACdC,IAAU,gBACVC,IAAa,mBACbC,IAAa,mBACbC,IAAU,gBACVC,IAAa,mBACbC,IAAW,OAAO,UAAU;AAChC,eAASC,EAAiBC,GAAI;AAC1B,YAAIC,IAAiBD,EAAG,gBAAgBE,IAAgBF,EAAG,eAAeG,IAAeH,EAAG,cAAcI,IAAkBJ,EAAG,iBAAiBK,IAAkBL,EAAG,iBAAiBM,IAAeN,EAAG,cAAcO,IAAsBP,EAAG,qBAC3OvB,IAAU8B,EAAoBxC,CAAU;AAI5C,iBAASA,EAAWC,GAAGC,GAAGK,GAAM;AAE5B,cAAIN,MAAMC;AACN,mBAAO;AAMX,cAAI,CAACD,KAAK,CAACC,KAAK,OAAOD,KAAM,YAAY,OAAOC,KAAM;AAClD,mBAAOD,MAAMA,KAAKC,MAAMA;AAa5B,cAAIgB,EAAcjB,CAAC,KAAKiB,EAAchB,CAAC;AACnC,mBAAOmC,EAAgBpC,GAAGC,GAAGQ,GAASH,CAAI;AAK9C,cAAIkC,IAAS,MAAM,QAAQxC,CAAC,GACxByC,IAAS,MAAM,QAAQxC,CAAC;AAC5B,cAAIuC,KAAUC;AACV,mBAAOD,MAAWC,KAAUR,EAAejC,GAAGC,GAAGQ,GAASH,CAAI;AAMlE,cAAIoC,IAAOZ,EAAS,KAAK9B,CAAC;AAC1B,iBAAI0C,MAASZ,EAAS,KAAK7B,CAAC,IACjB,KAEPyC,MAASnB,IAGFW,EAAclC,GAAGC,GAAGQ,GAASH,CAAI,IAExCoC,MAASlB,IACFa,EAAgBrC,GAAGC,GAAGQ,GAASH,CAAI,IAE1CoC,MAASjB,IACFU,EAAanC,GAAGC,GAAGQ,GAASH,CAAI,IAEvCoC,MAASd,IACFU,EAAatC,GAAGC,GAAGQ,GAASH,CAAI,IAKvCoC,MAASf,KAAce,MAASrB,IAGzBF,EAAcnB,CAAC,KAAKmB,EAAclB,CAAC,IACpC,KACAmC,EAAgBpC,GAAGC,GAAGQ,GAASH,CAAI,IAKzCoC,MAASpB,KAAeoB,MAAShB,KAAcgB,MAASb,IACjDT,EAAmBpB,EAAE,QAAO,GAAIC,EAAE,QAAO,CAAE,IAa/C;AAAA,QACjB;AACM,eAAOF;AAAA,MACb;AAKE,eAASkC,EAAejC,GAAGC,GAAGQ,GAASH,GAAM;AACzC,YAAIqC,IAAQ3C,EAAE;AACd,YAAIC,EAAE,WAAW0C;AACb,iBAAO;AAMX,eAAOA,MAAU;AACb,cAAI,CAAClC,EAAQT,EAAE2C,CAAK,GAAG1C,EAAE0C,CAAK,GAAGA,GAAOA,GAAO3C,GAAGC,GAAGK,CAAI;AACrD,mBAAO;AAGf,eAAO;AAAA,MACb;AAIE,UAAIsC,IAAyBrC,EAAiB0B,CAAc;AAS5D,eAASC,EAAclC,GAAGC,GAAG;AACzB,eAAOmB,EAAmBpB,EAAE,QAAO,GAAIC,EAAE,QAAO,CAAE;AAAA,MACxD;AAKE,eAASkC,EAAanC,GAAGC,GAAGQ,GAASH,GAAM;AACvC,YAAIuC,IAAe7C,EAAE,SAASC,EAAE;AAChC,YAAI,CAAC4C;AACD,iBAAO;AAEX,YAAI,CAAC7C,EAAE;AACH,iBAAO;AAOX,YAAI8C,IAAiB,CAAA,GACjBC,IAAS;AACb,eAAA/C,EAAE,QAAQ,SAAUgD,GAAQC,GAAM;AAC9B,cAAKJ,GAGL;AAAA,gBAAIK,IAAW,IACXC,IAAc;AAClB,YAAAlD,EAAE,QAAQ,SAAUmD,GAAQC,GAAM;AAC9B,cAAI,CAACH,KACD,CAACJ,EAAeK,CAAW,MAC1BD,IACGzC,EAAQwC,GAAMI,GAAMN,GAAQI,GAAanD,GAAGC,GAAGK,CAAI,KAC/CG,EAAQuC,GAAQI,GAAQH,GAAMI,GAAMrD,GAAGC,GAAGK,CAAI,OACtDwC,EAAeK,CAAW,IAAI,KAElCA;AAAA,YACd,CAAW,GACDJ,KACAF,IAAeK;AAAA;AAAA,QACzB,CAAO,GACML;AAAA,MACb;AAIE,UAAIS,IAAuB/C,EAAiB4B,CAAY,GAEpDoB,IAAQ,UACRC,IAAiB,OAAO,UAAU;AAItC,eAASpB,EAAgBpC,GAAGC,GAAGQ,GAASH,GAAM;AAC1C,YAAImD,IAAQ,OAAO,KAAKzD,CAAC,GACrB2C,IAAQc,EAAM;AAClB,YAAI,OAAO,KAAKxD,CAAC,EAAE,WAAW0C;AAC1B,iBAAO;AAOX,iBALI3B,GAKG2B,MAAU,KAAG;AAEhB,cADA3B,IAAMyC,EAAMd,CAAK,GACb3B,MAAQuC,GAAO;AACf,gBAAIG,IAAgB,CAAC,CAAC1D,EAAE,UACpB2D,IAAgB,CAAC,CAAC1D,EAAE;AACxB,iBAAKyD,KAAiBC,MAAkBD,MAAkBC;AACtD,qBAAO;AAAA,UAEzB;AACU,cAAI,CAACH,EAAe,KAAKvD,GAAGe,CAAG,KAC3B,CAACP,EAAQT,EAAEgB,CAAG,GAAGf,EAAEe,CAAG,GAAGA,GAAKA,GAAKhB,GAAGC,GAAGK,CAAI;AAC7C,mBAAO;AAAA,QAErB;AACM,eAAO;AAAA,MACb;AAIE,UAAIsD,IAA0BrD,EAAiB6B,CAAe;AAU9D,eAASC,EAAgBrC,GAAGC,GAAG;AAC3B,eAAOD,EAAE,WAAWC,EAAE,UAAUD,EAAE,UAAUC,EAAE;AAAA,MACpD;AAKE,eAASqC,EAAatC,GAAGC,GAAGQ,GAASH,GAAM;AACvC,YAAIuC,IAAe7C,EAAE,SAASC,EAAE;AAChC,YAAI,CAAC4C;AACD,iBAAO;AAEX,YAAI,CAAC7C,EAAE;AACH,iBAAO;AAOX,YAAI8C,IAAiB,CAAA;AACrB,eAAA9C,EAAE,QAAQ,SAAUgD,GAAQC,GAAM;AAC9B,cAAKJ,GAGL;AAAA,gBAAIK,IAAW,IACXW,IAAa;AACjB,YAAA5D,EAAE,QAAQ,SAAUmD,GAAQC,GAAM;AAC9B,cAAI,CAACH,KACD,CAACJ,EAAee,CAAU,MACzBX,IAAWzC,EAAQuC,GAAQI,GAAQH,GAAMI,GAAMrD,GAAGC,GAAGK,CAAI,OAC1DwC,EAAee,CAAU,IAAI,KAEjCA;AAAA,YACd,CAAW,GACDhB,IAAeK;AAAA;AAAA,QACzB,CAAO,GACML;AAAA,MACb;AAIE,UAAIiB,IAAuBvD,EAAiB+B,CAAY,GAEpDyB,IAAiB,OAAO,OAAO;AAAA,QAC/B,gBAAgB9B;AAAA,QAChB,eAAeC;AAAA,QACf,cAAcC;AAAA,QACd,iBAAiBC;AAAA,QACjB,iBAAiBC;AAAA,QACjB,cAAcC;AAAA,QACd,qBAAqBxC;AAAA,MAC3B,CAAG,GACGkE,IAA0B,OAAO,OAAO;AAAA,QACxC,gBAAgBpB;AAAA,QAChB,eAAeV;AAAA,QACf,cAAcoB;AAAA,QACd,iBAAiBM;AAAA,QACjB,iBAAiBvB;AAAA,QACjB,cAAcyB;AAAA,QACd,qBAAqBhE;AAAA,MAC3B,CAAG,GACGmE,IAAclC,EAAiBgC,CAAc;AAIjD,eAASG,EAAUlE,GAAGC,GAAG;AACrB,eAAOgE,EAAYjE,GAAGC,GAAG,MAAS;AAAA,MACxC;AACE,UAAIkE,IAAiBpC,EAAiBjB,EAAMiD,GAAgB,EAAE,qBAAqB,WAAY;AAAE,eAAO3C;AAAA,MAAmB,EAAE,CAAE,CAAC;AAIhI,eAASgD,GAAapE,GAAGC,GAAG;AACxB,eAAOkE,EAAenE,GAAGC,GAAG,MAAS;AAAA,MAC3C;AACE,UAAIoE,KAAsBtC,EAAiBiC,CAAuB;AAIlE,eAASM,GAAkBtE,GAAGC,GAAG;AAC7B,eAAOoE,GAAoBrE,GAAGC,GAAG,oBAAI,QAAO,CAAE;AAAA,MACpD;AACE,UAAIsE,KAAyBxC,EAAiBjB,EAAMkD,GAAyB;AAAA,QACzE,qBAAqB,WAAY;AAAE,iBAAO5C;AAAA,QAAmB;AAAA,OAChE,CAAC;AAIF,eAASoD,GAAqBxE,GAAGC,GAAG;AAChC,eAAOsE,GAAuBvE,GAAGC,GAAG,oBAAI,QAAO,CAAE;AAAA,MACvD;AASE,eAASwE,GAAkBC,GAAsB;AAC7C,eAAO3C,EAAiBjB,EAAMiD,GAAgBW,EAAqBX,CAAc,CAAC,CAAC;AAAA,MACzF;AAWE,eAASY,GAA0BD,GAAsB;AACrD,YAAI3E,IAAagC,EAAiBjB,EAAMkD,GAAyBU,EAAqBV,CAAuB,CAAC,CAAC;AAC/G,gBAAQ,SAAUhE,GAAGC,GAAGK,GAAM;AAC1B,iBAAIA,MAAS,WAAUA,IAAO,oBAAI,QAAO,IAClCP,EAAWC,GAAGC,GAAGK,CAAI;AAAA,QACtC;AAAA,MACA;AAEEV,MAAAA,EAAQ,oBAAoB0E,IAC5B1E,EAAQ,uBAAuB4E,IAC/B5E,EAAQ,4BAA4B+E,IACpC/E,EAAQ,oBAAoB6E,IAC5B7E,EAAQ,YAAYsE,GACpBtE,EAAQ,qBAAqBwB,GAC7BxB,EAAQ,eAAewE,IAEvB,OAAO,eAAexE,GAAS,cAAc,EAAE,OAAO,IAAM;AAAA,IAE9D,EAAC;AAAA;;","x_google_ignoreList":[0]}

package/dist/lib/vendor/prop-types/factoryWithThrowingShims.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./lib/ReactPropTypesSecret.cjs");var n,p;function y(){if(p)return n;p=1;var c=u.__require();function o(){}function i(){}return i.resetWarningCache=o,n=function(){function e(h,m,f,l,T,s){if(s!==c){var a=new Error("Calling PropTypes validators directly is not supported by the `prop-types` package. Use PropTypes.checkPropTypes() to call them. Read more at http://fb.me/use-check-prop-types");throw a.name="Invariant Violation",a}}e.isRequired=e;function r(){return e}var t={array:e,bigint:e,bool:e,func:e,number:e,object:e,string:e,symbol:e,any:e,arrayOf:r,element:e,elementType:e,instanceOf:r,node:e,objectOf:r,oneOf:r,oneOfType:r,shape:r,exact:r,checkPropTypes:i,resetWarningCache:o};return t.PropTypes=t,t},n}exports.__require=y;
+//# sourceMappingURL=factoryWithThrowingShims.cjs.map

package/dist/lib/vendor/prop-types/factoryWithThrowingShims.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"factoryWithThrowingShims.cjs","sources":["../../../../node_modules/prop-types/factoryWithThrowingShims.js"],"sourcesContent":["/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar ReactPropTypesSecret = require('./lib/ReactPropTypesSecret');\n\nfunction emptyFunction() {}\nfunction emptyFunctionWithReset() {}\nemptyFunctionWithReset.resetWarningCache = emptyFunction;\n\nmodule.exports = function() {\n  function shim(props, propName, componentName, location, propFullName, secret) {\n    if (secret === ReactPropTypesSecret) {\n      // It is still safe when called from React.\n      return;\n    }\n    var err = new Error(\n      'Calling PropTypes validators directly is not supported by the `prop-types` package. ' +\n      'Use PropTypes.checkPropTypes() to call them. ' +\n      'Read more at http://fb.me/use-check-prop-types'\n    );\n    err.name = 'Invariant Violation';\n    throw err;\n  };\n  shim.isRequired = shim;\n  function getShim() {\n    return shim;\n  };\n  // Important!\n  // Keep this list in sync with production version in `./factoryWithTypeCheckers.js`.\n  var ReactPropTypes = {\n    array: shim,\n    bigint: shim,\n    bool: shim,\n    func: shim,\n    number: shim,\n    object: shim,\n    string: shim,\n    symbol: shim,\n\n    any: shim,\n    arrayOf: getShim,\n    element: shim,\n    elementType: shim,\n    instanceOf: getShim,\n    node: shim,\n    objectOf: getShim,\n    oneOf: getShim,\n    oneOfType: getShim,\n    shape: getShim,\n    exact: getShim,\n\n    checkPropTypes: emptyFunctionWithReset,\n    resetWarningCache: emptyFunction\n  };\n\n  ReactPropTypes.PropTypes = ReactPropTypes;\n\n  return ReactPropTypes;\n};\n"],"names":["ReactPropTypesSecret","require$$0","emptyFunction","emptyFunctionWithReset","factoryWithThrowingShims","shim","props","propName","componentName","location","propFullName","secret","err","getShim","ReactPropTypes"],"mappings":"yKASA,IAAIA,EAAuBC,EAAAA,UAAA,EAE3B,SAASC,GAAgB,CAAA,CACzB,SAASC,GAAyB,CAAA,CAClC,OAAAA,EAAuB,kBAAoBD,EAE3CE,EAAiB,UAAW,CAC1B,SAASC,EAAKC,EAAOC,EAAUC,EAAeC,EAAUC,EAAcC,EAAQ,CAC5E,GAAIA,IAAWX,EAIf,KAAIY,EAAM,IAAI,MACZ,mLAIF,MAAAA,EAAI,KAAO,sBACLA,EACV,CACEP,EAAK,WAAaA,EAClB,SAASQ,GAAU,CACjB,OAAOR,CACX,CAGE,IAAIS,EAAiB,CACnB,MAAOT,EACP,OAAQA,EACR,KAAMA,EACN,KAAMA,EACN,OAAQA,EACR,OAAQA,EACR,OAAQA,EACR,OAAQA,EAER,IAAKA,EACL,QAASQ,EACT,QAASR,EACT,YAAaA,EACb,WAAYQ,EACZ,KAAMR,EACN,SAAUQ,EACV,MAAOA,EACP,UAAWA,EACX,MAAOA,EACP,MAAOA,EAEP,eAAgBV,EAChB,kBAAmBD,GAGrB,OAAAY,EAAe,UAAYA,EAEpBA,CACT","x_google_ignoreList":[0]}

package/dist/lib/vendor/prop-types/factoryWithThrowingShims.js

@@ -0,0 +1,53 @@
+import { __require as u } from "./lib/ReactPropTypesSecret.js";
+var o, p;
+function g() {
+  if (p) return o;
+  p = 1;
+  var c = /* @__PURE__ */ u();
+  function n() {
+  }
+  function i() {
+  }
+  return i.resetWarningCache = n, o = function() {
+    function e(h, y, m, f, l, s) {
+      if (s !== c) {
+        var a = new Error(
+          "Calling PropTypes validators directly is not supported by the `prop-types` package. Use PropTypes.checkPropTypes() to call them. Read more at http://fb.me/use-check-prop-types"
+        );
+        throw a.name = "Invariant Violation", a;
+      }
+    }
+    e.isRequired = e;
+    function r() {
+      return e;
+    }
+    var t = {
+      array: e,
+      bigint: e,
+      bool: e,
+      func: e,
+      number: e,
+      object: e,
+      string: e,
+      symbol: e,
+      any: e,
+      arrayOf: r,
+      element: e,
+      elementType: e,
+      instanceOf: r,
+      node: e,
+      objectOf: r,
+      oneOf: r,
+      oneOfType: r,
+      shape: r,
+      exact: r,
+      checkPropTypes: i,
+      resetWarningCache: n
+    };
+    return t.PropTypes = t, t;
+  }, o;
+}
+export {
+  g as __require
+};
+//# sourceMappingURL=factoryWithThrowingShims.js.map

package/dist/lib/vendor/prop-types/factoryWithThrowingShims.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"factoryWithThrowingShims.js","sources":["../../../../node_modules/prop-types/factoryWithThrowingShims.js"],"sourcesContent":["/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar ReactPropTypesSecret = require('./lib/ReactPropTypesSecret');\n\nfunction emptyFunction() {}\nfunction emptyFunctionWithReset() {}\nemptyFunctionWithReset.resetWarningCache = emptyFunction;\n\nmodule.exports = function() {\n  function shim(props, propName, componentName, location, propFullName, secret) {\n    if (secret === ReactPropTypesSecret) {\n      // It is still safe when called from React.\n      return;\n    }\n    var err = new Error(\n      'Calling PropTypes validators directly is not supported by the `prop-types` package. ' +\n      'Use PropTypes.checkPropTypes() to call them. ' +\n      'Read more at http://fb.me/use-check-prop-types'\n    );\n    err.name = 'Invariant Violation';\n    throw err;\n  };\n  shim.isRequired = shim;\n  function getShim() {\n    return shim;\n  };\n  // Important!\n  // Keep this list in sync with production version in `./factoryWithTypeCheckers.js`.\n  var ReactPropTypes = {\n    array: shim,\n    bigint: shim,\n    bool: shim,\n    func: shim,\n    number: shim,\n    object: shim,\n    string: shim,\n    symbol: shim,\n\n    any: shim,\n    arrayOf: getShim,\n    element: shim,\n    elementType: shim,\n    instanceOf: getShim,\n    node: shim,\n    objectOf: getShim,\n    oneOf: getShim,\n    oneOfType: getShim,\n    shape: getShim,\n    exact: getShim,\n\n    checkPropTypes: emptyFunctionWithReset,\n    resetWarningCache: emptyFunction\n  };\n\n  ReactPropTypes.PropTypes = ReactPropTypes;\n\n  return ReactPropTypes;\n};\n"],"names":["ReactPropTypesSecret","require$$0","emptyFunction","emptyFunctionWithReset","factoryWithThrowingShims","shim","props","propName","componentName","location","propFullName","secret","err","getShim","ReactPropTypes"],"mappings":";;;;;AASA,MAAIA,IAAuBC,gBAAAA,EAAA;AAE3B,WAASC,IAAgB;AAAA,EAAA;AACzB,WAASC,IAAyB;AAAA,EAAA;AAClC,SAAAA,EAAuB,oBAAoBD,GAE3CE,IAAiB,WAAW;AAC1B,aAASC,EAAKC,GAAOC,GAAUC,GAAeC,GAAUC,GAAcC,GAAQ;AAC5E,UAAIA,MAAWX,GAIf;AAAA,YAAIY,IAAM,IAAI;AAAA,UACZ;AAAA;AAIF,cAAAA,EAAI,OAAO,uBACLA;AAAA;AAAA,IACV;AACE,IAAAP,EAAK,aAAaA;AAClB,aAASQ,IAAU;AACjB,aAAOR;AAAA,IACX;AAGE,QAAIS,IAAiB;AAAA,MACnB,OAAOT;AAAA,MACP,QAAQA;AAAA,MACR,MAAMA;AAAA,MACN,MAAMA;AAAA,MACN,QAAQA;AAAA,MACR,QAAQA;AAAA,MACR,QAAQA;AAAA,MACR,QAAQA;AAAA,MAER,KAAKA;AAAA,MACL,SAASQ;AAAA,MACT,SAASR;AAAA,MACT,aAAaA;AAAA,MACb,YAAYQ;AAAA,MACZ,MAAMR;AAAA,MACN,UAAUQ;AAAA,MACV,OAAOA;AAAA,MACP,WAAWA;AAAA,MACX,OAAOA;AAAA,MACP,OAAOA;AAAA,MAEP,gBAAgBV;AAAA,MAChB,mBAAmBD;AAAA;AAGrB,WAAAY,EAAe,YAAYA,GAEpBA;AAAA,EACT;;","x_google_ignoreList":[0]}

package/dist/lib/vendor/prop-types/index.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("../../_virtual/index3.cjs"),o=require("./factoryWithThrowingShims.cjs");var r;function t(){return r||(r=1,e.__module.exports=o.__require()()),e.__module.exports}exports.__require=t;
+//# sourceMappingURL=index.cjs.map

package/dist/lib/vendor/prop-types/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","sources":["../../../../node_modules/prop-types/index.js"],"sourcesContent":["/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nif (process.env.NODE_ENV !== 'production') {\n  var ReactIs = require('react-is');\n\n  // By explicitly using `prop-types` you are opting into new development behavior.\n  // http://fb.me/prop-types-in-prod\n  var throwOnDirectAccess = true;\n  module.exports = require('./factoryWithTypeCheckers')(ReactIs.isElement, throwOnDirectAccess);\n} else {\n  // By explicitly using `prop-types` you are opting into new production behavior.\n  // http://fb.me/prop-types-in-prod\n  module.exports = require('./factoryWithThrowingShims')();\n}\n"],"names":["propTypesModule","require$$0"],"mappings":"2MAiBEA,WAAA,QAAiBC,EAAAA,YAAoC","x_google_ignoreList":[0]}

package/dist/lib/vendor/prop-types/index.js

@@ -0,0 +1,10 @@
+import { __module as r } from "../../_virtual/index3.js";
+import { __require as o } from "./factoryWithThrowingShims.js";
+var e;
+function s() {
+  return e ? r.exports : (e = 1, r.exports = /* @__PURE__ */ o()(), r.exports);
+}
+export {
+  s as __require
+};
+//# sourceMappingURL=index.js.map

package/dist/lib/vendor/prop-types/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../node_modules/prop-types/index.js"],"sourcesContent":["/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nif (process.env.NODE_ENV !== 'production') {\n  var ReactIs = require('react-is');\n\n  // By explicitly using `prop-types` you are opting into new development behavior.\n  // http://fb.me/prop-types-in-prod\n  var throwOnDirectAccess = true;\n  module.exports = require('./factoryWithTypeCheckers')(ReactIs.isElement, throwOnDirectAccess);\n} else {\n  // By explicitly using `prop-types` you are opting into new production behavior.\n  // http://fb.me/prop-types-in-prod\n  module.exports = require('./factoryWithThrowingShims')();\n}\n"],"names":["propTypesModule","require$$0"],"mappings":";;;;iCAiBEA,EAAA,UAAiBC,gBAAAA,IAAoC;;","x_google_ignoreList":[0]}

package/dist/lib/vendor/prop-types/lib/ReactPropTypesSecret.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var e,r;function _(){if(r)return e;r=1;var t="SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED";return e=t,e}exports.__require=_;
+//# sourceMappingURL=ReactPropTypesSecret.cjs.map

package/dist/lib/vendor/prop-types/lib/ReactPropTypesSecret.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReactPropTypesSecret.cjs","sources":["../../../../../node_modules/prop-types/lib/ReactPropTypesSecret.js"],"sourcesContent":["/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar ReactPropTypesSecret = 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED';\n\nmodule.exports = ReactPropTypesSecret;\n"],"names":["ReactPropTypesSecret","ReactPropTypesSecret_1"],"mappings":"uHASA,IAAIA,EAAuB,+CAE3B,OAAAC,EAAiBD","x_google_ignoreList":[0]}

package/dist/lib/vendor/prop-types/lib/ReactPropTypesSecret.js

@@ -0,0 +1,11 @@
+var e, r;
+function _() {
+  if (r) return e;
+  r = 1;
+  var t = "SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED";
+  return e = t, e;
+}
+export {
+  _ as __require
+};
+//# sourceMappingURL=ReactPropTypesSecret.js.map

package/dist/lib/vendor/prop-types/lib/ReactPropTypesSecret.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReactPropTypesSecret.js","sources":["../../../../../node_modules/prop-types/lib/ReactPropTypesSecret.js"],"sourcesContent":["/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\nvar ReactPropTypesSecret = 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED';\n\nmodule.exports = ReactPropTypesSecret;\n"],"names":["ReactPropTypesSecret","ReactPropTypesSecret_1"],"mappings":";;;;AASA,MAAIA,IAAuB;AAE3B,SAAAC,IAAiBD;;","x_google_ignoreList":[0]}