@viswa-test/test-citation 0.0.385 → 0.0.387

package/dist/node_modules/.pnpm/react-is@19.2.8/node_modules/react-is/cjs/react-is.development.js

@@ -1,11 +0,0 @@
-import{__exports as e}from"../../../../../../_virtual/react-is.development2.js";
-/**
- * @license React
- * react-is.development.js
- *
- * Copyright (c) Meta Platforms, Inc. and affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */var t;function r(){return t||(t=1,"production"!==process.env.NODE_ENV&&function(){function t(e){if("object"==typeof e&&null!==e){var t=e.$$typeof;switch(t){case r:switch(e=e.type){case n:case s:case c:case a:case l:case p:return e;default:switch(e=e&&e.$$typeof){case i:case u:case m:case y:case f:return e;default:return t}}case o:return t}}}var r=Symbol.for("react.transitional.element"),o=Symbol.for("react.portal"),n=Symbol.for("react.fragment"),c=Symbol.for("react.strict_mode"),s=Symbol.for("react.profiler"),f=Symbol.for("react.consumer"),i=Symbol.for("react.context"),u=Symbol.for("react.forward_ref"),a=Symbol.for("react.suspense"),l=Symbol.for("react.suspense_list"),y=Symbol.for("react.memo"),m=Symbol.for("react.lazy"),p=Symbol.for("react.view_transition"),S=Symbol.for("react.client.reference");e.ContextConsumer=f,e.ContextProvider=i,e.Element=r,e.ForwardRef=u,e.Fragment=n,e.Lazy=m,e.Memo=y,e.Portal=o,e.Profiler=s,e.StrictMode=c,e.Suspense=a,e.SuspenseList=l,e.isContextConsumer=function(e){return t(e)===f},e.isContextProvider=function(e){return t(e)===i},e.isElement=function(e){return"object"==typeof e&&null!==e&&e.$$typeof===r},e.isForwardRef=function(e){return t(e)===u},e.isFragment=function(e){return t(e)===n},e.isLazy=function(e){return t(e)===m},e.isMemo=function(e){return t(e)===y},e.isPortal=function(e){return t(e)===o},e.isProfiler=function(e){return t(e)===s},e.isStrictMode=function(e){return t(e)===c},e.isSuspense=function(e){return t(e)===a},e.isSuspenseList=function(e){return t(e)===l},e.isValidElementType=function(e){return"string"==typeof e||"function"==typeof e||e===n||e===s||e===c||e===a||e===l||"object"==typeof e&&null!==e&&(e.$$typeof===m||e.$$typeof===y||e.$$typeof===i||e.$$typeof===f||e.$$typeof===u||e.$$typeof===S||void 0!==e.getModuleId)},e.typeOf=t}()),e}export{r as __require};
-//# sourceMappingURL=react-is.development.js.map

package/dist/node_modules/.pnpm/react-is@19.2.8/node_modules/react-is/cjs/react-is.development.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react-is.development.js","sources":["../../../../../../../../../../../node_modules/.pnpm/react-is@19.2.8/node_modules/react-is/cjs/react-is.development.js"],"sourcesContent":["/**\n * @license React\n * react-is.development.js\n *\n * Copyright (c) Meta Platforms, Inc. and affiliates.\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\"production\" !== process.env.NODE_ENV &&\n  (function () {\n    function typeOf(object) {\n      if (\"object\" === typeof object && null !== object) {\n        var $$typeof = object.$$typeof;\n        switch ($$typeof) {\n          case REACT_ELEMENT_TYPE:\n            switch (((object = object.type), object)) {\n              case REACT_FRAGMENT_TYPE:\n              case REACT_PROFILER_TYPE:\n              case REACT_STRICT_MODE_TYPE:\n              case REACT_SUSPENSE_TYPE:\n              case REACT_SUSPENSE_LIST_TYPE:\n              case REACT_VIEW_TRANSITION_TYPE:\n                return object;\n              default:\n                switch (((object = object && object.$$typeof), object)) {\n                  case REACT_CONTEXT_TYPE:\n                  case REACT_FORWARD_REF_TYPE:\n                  case REACT_LAZY_TYPE:\n                  case REACT_MEMO_TYPE:\n                    return object;\n                  case REACT_CONSUMER_TYPE:\n                    return object;\n                  default:\n                    return $$typeof;\n                }\n            }\n          case REACT_PORTAL_TYPE:\n            return $$typeof;\n        }\n      }\n    }\n    var REACT_ELEMENT_TYPE = Symbol.for(\"react.transitional.element\"),\n      REACT_PORTAL_TYPE = Symbol.for(\"react.portal\"),\n      REACT_FRAGMENT_TYPE = Symbol.for(\"react.fragment\"),\n      REACT_STRICT_MODE_TYPE = Symbol.for(\"react.strict_mode\"),\n      REACT_PROFILER_TYPE = Symbol.for(\"react.profiler\"),\n      REACT_CONSUMER_TYPE = Symbol.for(\"react.consumer\"),\n      REACT_CONTEXT_TYPE = Symbol.for(\"react.context\"),\n      REACT_FORWARD_REF_TYPE = Symbol.for(\"react.forward_ref\"),\n      REACT_SUSPENSE_TYPE = Symbol.for(\"react.suspense\"),\n      REACT_SUSPENSE_LIST_TYPE = Symbol.for(\"react.suspense_list\"),\n      REACT_MEMO_TYPE = Symbol.for(\"react.memo\"),\n      REACT_LAZY_TYPE = Symbol.for(\"react.lazy\"),\n      REACT_VIEW_TRANSITION_TYPE = Symbol.for(\"react.view_transition\"),\n      REACT_CLIENT_REFERENCE = Symbol.for(\"react.client.reference\");\n    exports.ContextConsumer = REACT_CONSUMER_TYPE;\n    exports.ContextProvider = REACT_CONTEXT_TYPE;\n    exports.Element = REACT_ELEMENT_TYPE;\n    exports.ForwardRef = REACT_FORWARD_REF_TYPE;\n    exports.Fragment = REACT_FRAGMENT_TYPE;\n    exports.Lazy = REACT_LAZY_TYPE;\n    exports.Memo = REACT_MEMO_TYPE;\n    exports.Portal = REACT_PORTAL_TYPE;\n    exports.Profiler = REACT_PROFILER_TYPE;\n    exports.StrictMode = REACT_STRICT_MODE_TYPE;\n    exports.Suspense = REACT_SUSPENSE_TYPE;\n    exports.SuspenseList = REACT_SUSPENSE_LIST_TYPE;\n    exports.isContextConsumer = function (object) {\n      return typeOf(object) === REACT_CONSUMER_TYPE;\n    };\n    exports.isContextProvider = function (object) {\n      return typeOf(object) === REACT_CONTEXT_TYPE;\n    };\n    exports.isElement = function (object) {\n      return (\n        \"object\" === typeof object &&\n        null !== object &&\n        object.$$typeof === REACT_ELEMENT_TYPE\n      );\n    };\n    exports.isForwardRef = function (object) {\n      return typeOf(object) === REACT_FORWARD_REF_TYPE;\n    };\n    exports.isFragment = function (object) {\n      return typeOf(object) === REACT_FRAGMENT_TYPE;\n    };\n    exports.isLazy = function (object) {\n      return typeOf(object) === REACT_LAZY_TYPE;\n    };\n    exports.isMemo = function (object) {\n      return typeOf(object) === REACT_MEMO_TYPE;\n    };\n    exports.isPortal = function (object) {\n      return typeOf(object) === REACT_PORTAL_TYPE;\n    };\n    exports.isProfiler = function (object) {\n      return typeOf(object) === REACT_PROFILER_TYPE;\n    };\n    exports.isStrictMode = function (object) {\n      return typeOf(object) === REACT_STRICT_MODE_TYPE;\n    };\n    exports.isSuspense = function (object) {\n      return typeOf(object) === REACT_SUSPENSE_TYPE;\n    };\n    exports.isSuspenseList = function (object) {\n      return typeOf(object) === REACT_SUSPENSE_LIST_TYPE;\n    };\n    exports.isValidElementType = function (type) {\n      return \"string\" === typeof type ||\n        \"function\" === typeof type ||\n        type === REACT_FRAGMENT_TYPE ||\n        type === REACT_PROFILER_TYPE ||\n        type === REACT_STRICT_MODE_TYPE ||\n        type === REACT_SUSPENSE_TYPE ||\n        type === REACT_SUSPENSE_LIST_TYPE ||\n        (\"object\" === typeof type &&\n          null !== type &&\n          (type.$$typeof === REACT_LAZY_TYPE ||\n            type.$$typeof === REACT_MEMO_TYPE ||\n            type.$$typeof === REACT_CONTEXT_TYPE ||\n            type.$$typeof === REACT_CONSUMER_TYPE ||\n            type.$$typeof === REACT_FORWARD_REF_TYPE ||\n            type.$$typeof === REACT_CLIENT_REFERENCE ||\n            void 0 !== type.getModuleId))\n        ? !0\n        : !1;\n    };\n    exports.typeOf = typeOf;\n  })();\n"],"names":["process","env","NODE_ENV","typeOf","object","$$typeof","REACT_ELEMENT_TYPE","type","REACT_FRAGMENT_TYPE","REACT_PROFILER_TYPE","REACT_STRICT_MODE_TYPE","REACT_SUSPENSE_TYPE","REACT_SUSPENSE_LIST_TYPE","REACT_VIEW_TRANSITION_TYPE","REACT_CONTEXT_TYPE","REACT_FORWARD_REF_TYPE","REACT_LAZY_TYPE","REACT_MEMO_TYPE","REACT_CONSUMER_TYPE","REACT_PORTAL_TYPE","Symbol","for","REACT_CLIENT_REFERENCE","reactIs_development","ContextConsumer","ContextProvider","Element","ForwardRef","Fragment","Lazy","Memo","Portal","Profiler","StrictMode","Suspense","SuspenseList","isContextConsumer","isContextProvider","isElement","isForwardRef","isFragment","isLazy","isMemo","isPortal","isProfiler","isStrictMode","isSuspense","isSuspenseList","isValidElementType","getModuleId"],"mappings":";;;;;;;;;qCAWA,eAAiBA,QAAQC,IAAIC,UAC3B,WACE,SAASC,EAAOC,GACd,GAAI,iBAAoBA,GAAU,OAASA,EAAQ,CACjD,IAAIC,EAAWD,EAAOC,SACtB,OAAQA,GACN,KAAKC,EACH,OAAUF,EAASA,EAAOG,MACxB,KAAKC,EACL,KAAKC,EACL,KAAKC,EACL,KAAKC,EACL,KAAKC,EACL,KAAKC,EACH,OAAOT,EACT,QACE,OAAUA,EAASA,GAAUA,EAAOC,UAClC,KAAKS,EACL,KAAKC,EACL,KAAKC,EACL,KAAKC,EAEL,KAAKC,EACH,OAAOd,EACT,QACE,OAAOC,GAGjB,KAAKc,EACH,OAAOd,EAEnB,CACA,CACI,IAAIC,EAAqBc,OAAOC,IAAI,8BAClCF,EAAoBC,OAAOC,IAAI,gBAC/Bb,EAAsBY,OAAOC,IAAI,kBACjCX,EAAyBU,OAAOC,IAAI,qBACpCZ,EAAsBW,OAAOC,IAAI,kBACjCH,EAAsBE,OAAOC,IAAI,kBACjCP,EAAqBM,OAAOC,IAAI,iBAChCN,EAAyBK,OAAOC,IAAI,qBACpCV,EAAsBS,OAAOC,IAAI,kBACjCT,EAA2BQ,OAAOC,IAAI,uBACtCJ,EAAkBG,OAAOC,IAAI,cAC7BL,EAAkBI,OAAOC,IAAI,cAC7BR,EAA6BO,OAAOC,IAAI,yBACxCC,EAAyBF,OAAOC,IAAI,0BACtCE,EAAAC,gBAA0BN,EAC1BK,EAAAE,gBAA0BX,EAC1BS,EAAAG,QAAkBpB,EAClBiB,EAAAI,WAAqBZ,EACrBQ,EAAAK,SAAmBpB,EACnBe,EAAAM,KAAeb,EACfO,EAAAO,KAAeb,EACfM,EAAAQ,OAAiBZ,EACjBI,EAAAS,SAAmBvB,EACnBc,EAAAU,WAAqBvB,EACrBa,EAAAW,SAAmBvB,EACnBY,EAAAY,aAAuBvB,EACvBW,EAAyBa,kBAAG,SAAUhC,GACpC,OAAOD,EAAOC,KAAYc,GAE5BK,EAAyBc,kBAAG,SAAUjC,GACpC,OAAOD,EAAOC,KAAYU,GAE5BS,EAAiBe,UAAG,SAAUlC,GAC5B,MACE,iBAAoBA,GACpB,OAASA,GACTA,EAAOC,WAAaC,GAGxBiB,EAAoBgB,aAAG,SAAUnC,GAC/B,OAAOD,EAAOC,KAAYW,GAE5BQ,EAAkBiB,WAAG,SAAUpC,GAC7B,OAAOD,EAAOC,KAAYI,GAE5Be,EAAckB,OAAG,SAAUrC,GACzB,OAAOD,EAAOC,KAAYY,GAE5BO,EAAcmB,OAAG,SAAUtC,GACzB,OAAOD,EAAOC,KAAYa,GAE5BM,EAAgBoB,SAAG,SAAUvC,GAC3B,OAAOD,EAAOC,KAAYe,GAE5BI,EAAkBqB,WAAG,SAAUxC,GAC7B,OAAOD,EAAOC,KAAYK,GAE5Bc,EAAoBsB,aAAG,SAAUzC,GAC/B,OAAOD,EAAOC,KAAYM,GAE5Ba,EAAkBuB,WAAG,SAAU1C,GAC7B,OAAOD,EAAOC,KAAYO,GAE5BY,EAAsBwB,eAAG,SAAU3C,GACjC,OAAOD,EAAOC,KAAYQ,GAE5BW,EAA0ByB,mBAAG,SAAUzC,GACrC,MAAO,iBAAoBA,GACzB,mBAAsBA,GACtBA,IAASC,GACTD,IAASE,GACTF,IAASG,GACTH,IAASI,GACTJ,IAASK,GACR,iBAAoBL,GACnB,OAASA,IACRA,EAAKF,WAAaW,GACjBT,EAAKF,WAAaY,GAClBV,EAAKF,WAAaS,GAClBP,EAAKF,WAAaa,GAClBX,EAAKF,WAAaU,GAClBR,EAAKF,WAAaiB,QACb,IAAMf,EAAK0C,cAIxB1B,EAAApB,OAAiBA,CAClB,CAvHD"}

package/dist/node_modules/.pnpm/react-is@19.2.8/node_modules/react-is/cjs/react-is.production.js

@@ -1,11 +0,0 @@
-import{__exports as e}from"../../../../../../_virtual/react-is.production.js";
-/**
- * @license React
- * react-is.production.js
- *
- * Copyright (c) Meta Platforms, Inc. and affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */var t;function r(){if(t)return e;t=1;var r=Symbol.for("react.transitional.element"),o=Symbol.for("react.portal"),n=Symbol.for("react.fragment"),f=Symbol.for("react.strict_mode"),i=Symbol.for("react.profiler"),c=Symbol.for("react.consumer"),s=Symbol.for("react.context"),u=Symbol.for("react.forward_ref"),a=Symbol.for("react.suspense"),l=Symbol.for("react.suspense_list"),y=Symbol.for("react.memo"),m=Symbol.for("react.lazy"),p=Symbol.for("react.view_transition"),S=Symbol.for("react.client.reference");function $(e){if("object"==typeof e&&null!==e){var t=e.$$typeof;switch(t){case r:switch(e=e.type){case n:case i:case f:case a:case l:case p:return e;default:switch(e=e&&e.$$typeof){case s:case u:case m:case y:case c:return e;default:return t}}case o:return t}}}return e.ContextConsumer=c,e.ContextProvider=s,e.Element=r,e.ForwardRef=u,e.Fragment=n,e.Lazy=m,e.Memo=y,e.Portal=o,e.Profiler=i,e.StrictMode=f,e.Suspense=a,e.SuspenseList=l,e.isContextConsumer=function(e){return $(e)===c},e.isContextProvider=function(e){return $(e)===s},e.isElement=function(e){return"object"==typeof e&&null!==e&&e.$$typeof===r},e.isForwardRef=function(e){return $(e)===u},e.isFragment=function(e){return $(e)===n},e.isLazy=function(e){return $(e)===m},e.isMemo=function(e){return $(e)===y},e.isPortal=function(e){return $(e)===o},e.isProfiler=function(e){return $(e)===i},e.isStrictMode=function(e){return $(e)===f},e.isSuspense=function(e){return $(e)===a},e.isSuspenseList=function(e){return $(e)===l},e.isValidElementType=function(e){return"string"==typeof e||"function"==typeof e||e===n||e===i||e===f||e===a||e===l||"object"==typeof e&&null!==e&&(e.$$typeof===m||e.$$typeof===y||e.$$typeof===s||e.$$typeof===c||e.$$typeof===u||e.$$typeof===S||void 0!==e.getModuleId)},e.typeOf=$,e}export{r as __require};
-//# sourceMappingURL=react-is.production.js.map

package/dist/node_modules/.pnpm/react-is@19.2.8/node_modules/react-is/cjs/react-is.production.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react-is.production.js","sources":["../../../../../../../../../../../node_modules/.pnpm/react-is@19.2.8/node_modules/react-is/cjs/react-is.production.js"],"sourcesContent":["/**\n * @license React\n * react-is.production.js\n *\n * Copyright (c) Meta Platforms, Inc. and affiliates.\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\";\nvar REACT_ELEMENT_TYPE = Symbol.for(\"react.transitional.element\"),\n  REACT_PORTAL_TYPE = Symbol.for(\"react.portal\"),\n  REACT_FRAGMENT_TYPE = Symbol.for(\"react.fragment\"),\n  REACT_STRICT_MODE_TYPE = Symbol.for(\"react.strict_mode\"),\n  REACT_PROFILER_TYPE = Symbol.for(\"react.profiler\"),\n  REACT_CONSUMER_TYPE = Symbol.for(\"react.consumer\"),\n  REACT_CONTEXT_TYPE = Symbol.for(\"react.context\"),\n  REACT_FORWARD_REF_TYPE = Symbol.for(\"react.forward_ref\"),\n  REACT_SUSPENSE_TYPE = Symbol.for(\"react.suspense\"),\n  REACT_SUSPENSE_LIST_TYPE = Symbol.for(\"react.suspense_list\"),\n  REACT_MEMO_TYPE = Symbol.for(\"react.memo\"),\n  REACT_LAZY_TYPE = Symbol.for(\"react.lazy\"),\n  REACT_VIEW_TRANSITION_TYPE = Symbol.for(\"react.view_transition\"),\n  REACT_CLIENT_REFERENCE = Symbol.for(\"react.client.reference\");\nfunction typeOf(object) {\n  if (\"object\" === typeof object && null !== object) {\n    var $$typeof = object.$$typeof;\n    switch ($$typeof) {\n      case REACT_ELEMENT_TYPE:\n        switch (((object = object.type), object)) {\n          case REACT_FRAGMENT_TYPE:\n          case REACT_PROFILER_TYPE:\n          case REACT_STRICT_MODE_TYPE:\n          case REACT_SUSPENSE_TYPE:\n          case REACT_SUSPENSE_LIST_TYPE:\n          case REACT_VIEW_TRANSITION_TYPE:\n            return object;\n          default:\n            switch (((object = object && object.$$typeof), object)) {\n              case REACT_CONTEXT_TYPE:\n              case REACT_FORWARD_REF_TYPE:\n              case REACT_LAZY_TYPE:\n              case REACT_MEMO_TYPE:\n                return object;\n              case REACT_CONSUMER_TYPE:\n                return object;\n              default:\n                return $$typeof;\n            }\n        }\n      case REACT_PORTAL_TYPE:\n        return $$typeof;\n    }\n  }\n}\nexports.ContextConsumer = REACT_CONSUMER_TYPE;\nexports.ContextProvider = REACT_CONTEXT_TYPE;\nexports.Element = REACT_ELEMENT_TYPE;\nexports.ForwardRef = REACT_FORWARD_REF_TYPE;\nexports.Fragment = REACT_FRAGMENT_TYPE;\nexports.Lazy = REACT_LAZY_TYPE;\nexports.Memo = REACT_MEMO_TYPE;\nexports.Portal = REACT_PORTAL_TYPE;\nexports.Profiler = REACT_PROFILER_TYPE;\nexports.StrictMode = REACT_STRICT_MODE_TYPE;\nexports.Suspense = REACT_SUSPENSE_TYPE;\nexports.SuspenseList = REACT_SUSPENSE_LIST_TYPE;\nexports.isContextConsumer = function (object) {\n  return typeOf(object) === REACT_CONSUMER_TYPE;\n};\nexports.isContextProvider = function (object) {\n  return typeOf(object) === REACT_CONTEXT_TYPE;\n};\nexports.isElement = function (object) {\n  return (\n    \"object\" === typeof object &&\n    null !== object &&\n    object.$$typeof === REACT_ELEMENT_TYPE\n  );\n};\nexports.isForwardRef = function (object) {\n  return typeOf(object) === REACT_FORWARD_REF_TYPE;\n};\nexports.isFragment = function (object) {\n  return typeOf(object) === REACT_FRAGMENT_TYPE;\n};\nexports.isLazy = function (object) {\n  return typeOf(object) === REACT_LAZY_TYPE;\n};\nexports.isMemo = function (object) {\n  return typeOf(object) === REACT_MEMO_TYPE;\n};\nexports.isPortal = function (object) {\n  return typeOf(object) === REACT_PORTAL_TYPE;\n};\nexports.isProfiler = function (object) {\n  return typeOf(object) === REACT_PROFILER_TYPE;\n};\nexports.isStrictMode = function (object) {\n  return typeOf(object) === REACT_STRICT_MODE_TYPE;\n};\nexports.isSuspense = function (object) {\n  return typeOf(object) === REACT_SUSPENSE_TYPE;\n};\nexports.isSuspenseList = function (object) {\n  return typeOf(object) === REACT_SUSPENSE_LIST_TYPE;\n};\nexports.isValidElementType = function (type) {\n  return \"string\" === typeof type ||\n    \"function\" === typeof type ||\n    type === REACT_FRAGMENT_TYPE ||\n    type === REACT_PROFILER_TYPE ||\n    type === REACT_STRICT_MODE_TYPE ||\n    type === REACT_SUSPENSE_TYPE ||\n    type === REACT_SUSPENSE_LIST_TYPE ||\n    (\"object\" === typeof type &&\n      null !== type &&\n      (type.$$typeof === REACT_LAZY_TYPE ||\n        type.$$typeof === REACT_MEMO_TYPE ||\n        type.$$typeof === REACT_CONTEXT_TYPE ||\n        type.$$typeof === REACT_CONSUMER_TYPE ||\n        type.$$typeof === REACT_FORWARD_REF_TYPE ||\n        type.$$typeof === REACT_CLIENT_REFERENCE ||\n        void 0 !== type.getModuleId))\n    ? !0\n    : !1;\n};\nexports.typeOf = typeOf;\n"],"names":["REACT_ELEMENT_TYPE","Symbol","for","REACT_PORTAL_TYPE","REACT_FRAGMENT_TYPE","REACT_STRICT_MODE_TYPE","REACT_PROFILER_TYPE","REACT_CONSUMER_TYPE","REACT_CONTEXT_TYPE","REACT_FORWARD_REF_TYPE","REACT_SUSPENSE_TYPE","REACT_SUSPENSE_LIST_TYPE","REACT_MEMO_TYPE","REACT_LAZY_TYPE","REACT_VIEW_TRANSITION_TYPE","REACT_CLIENT_REFERENCE","typeOf","object","$$typeof","type","reactIs_production","ContextConsumer","ContextProvider","Element","ForwardRef","Fragment","Lazy","Memo","Portal","Profiler","StrictMode","Suspense","SuspenseList","isContextConsumer","isContextProvider","isElement","isForwardRef","isFragment","isLazy","isMemo","isPortal","isProfiler","isStrictMode","isSuspense","isSuspenseList","isValidElementType","getModuleId"],"mappings":";;;;;;;;;wCAWA,IAAIA,EAAqBC,OAAOC,IAAI,8BAClCC,EAAoBF,OAAOC,IAAI,gBAC/BE,EAAsBH,OAAOC,IAAI,kBACjCG,EAAyBJ,OAAOC,IAAI,qBACpCI,EAAsBL,OAAOC,IAAI,kBACjCK,EAAsBN,OAAOC,IAAI,kBACjCM,EAAqBP,OAAOC,IAAI,iBAChCO,EAAyBR,OAAOC,IAAI,qBACpCQ,EAAsBT,OAAOC,IAAI,kBACjCS,EAA2BV,OAAOC,IAAI,uBACtCU,EAAkBX,OAAOC,IAAI,cAC7BW,EAAkBZ,OAAOC,IAAI,cAC7BY,EAA6Bb,OAAOC,IAAI,yBACxCa,EAAyBd,OAAOC,IAAI,0BACtC,SAASc,EAAOC,GACd,GAAI,iBAAoBA,GAAU,OAASA,EAAQ,CACjD,IAAIC,EAAWD,EAAOC,SACtB,OAAQA,GACN,KAAKlB,EACH,OAAUiB,EAASA,EAAOE,MACxB,KAAKf,EACL,KAAKE,EACL,KAAKD,EACL,KAAKK,EACL,KAAKC,EACL,KAAKG,EACH,OAAOG,EACT,QACE,OAAUA,EAASA,GAAUA,EAAOC,UAClC,KAAKV,EACL,KAAKC,EACL,KAAKI,EACL,KAAKD,EAEL,KAAKL,EACH,OAAOU,EACT,QACE,OAAOC,GAGjB,KAAKf,EACH,OAAOe,EAEf,CACA,QACAE,EAAAC,gBAA0Bd,EAC1Ba,EAAAE,gBAA0Bd,EAC1BY,EAAAG,QAAkBvB,EAClBoB,EAAAI,WAAqBf,EACrBW,EAAAK,SAAmBrB,EACnBgB,EAAAM,KAAeb,EACfO,EAAAO,KAAef,EACfQ,EAAAQ,OAAiBzB,EACjBiB,EAAAS,SAAmBvB,EACnBc,EAAAU,WAAqBzB,EACrBe,EAAAW,SAAmBrB,EACnBU,EAAAY,aAAuBrB,EACES,EAAAa,kBAAG,SAAUhB,GACpC,OAAOD,EAAOC,KAAYV,GAEHa,EAAAc,kBAAG,SAAUjB,GACpC,OAAOD,EAAOC,KAAYT,GAEXY,EAAAe,UAAG,SAAUlB,GAC5B,MACE,iBAAoBA,GACpB,OAASA,GACTA,EAAOC,WAAalB,GAGJoB,EAAAgB,aAAG,SAAUnB,GAC/B,OAAOD,EAAOC,KAAYR,GAEVW,EAAAiB,WAAG,SAAUpB,GAC7B,OAAOD,EAAOC,KAAYb,GAEdgB,EAAAkB,OAAG,SAAUrB,GACzB,OAAOD,EAAOC,KAAYJ,GAEdO,EAAAmB,OAAG,SAAUtB,GACzB,OAAOD,EAAOC,KAAYL,GAEZQ,EAAAoB,SAAG,SAAUvB,GAC3B,OAAOD,EAAOC,KAAYd,GAEViB,EAAAqB,WAAG,SAAUxB,GAC7B,OAAOD,EAAOC,KAAYX,GAERc,EAAAsB,aAAG,SAAUzB,GAC/B,OAAOD,EAAOC,KAAYZ,GAEVe,EAAAuB,WAAG,SAAU1B,GAC7B,OAAOD,EAAOC,KAAYP,GAENU,EAAAwB,eAAG,SAAU3B,GACjC,OAAOD,EAAOC,KAAYN,GAEFS,EAAAyB,mBAAG,SAAU1B,GACrC,MAAO,iBAAoBA,GACzB,mBAAsBA,GACtBA,IAASf,GACTe,IAASb,GACTa,IAASd,GACTc,IAAST,GACTS,IAASR,GACR,iBAAoBQ,GACnB,OAASA,IACRA,EAAKD,WAAaL,GACjBM,EAAKD,WAAaN,GAClBO,EAAKD,WAAaV,GAClBW,EAAKD,WAAaX,GAClBY,EAAKD,WAAaT,GAClBU,EAAKD,WAAaH,QACb,IAAMI,EAAK2B,cAIxB1B,EAAAJ,OAAiBA"}

package/dist/node_modules/.pnpm/react-is@19.2.8/node_modules/react-is/index.js

@@ -1,2 +0,0 @@
-import{__module as r}from"../../../../../_virtual/index5.js";import{__require as e}from"./cjs/react-is.production.js";import{__require as o}from"./cjs/react-is.development.js";var s;function t(){return s||(s=1,"production"===process.env.NODE_ENV?r.exports=e():r.exports=o()),r.exports}export{t as __require};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/react-is@19.2.8/node_modules/react-is/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/react-is@19.2.8/node_modules/react-is/index.js"],"sourcesContent":["'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./cjs/react-is.production.js');\n} else {\n  module.exports = require('./cjs/react-is.development.js');\n}\n"],"names":["process","env","NODE_ENV","reactIsModule","exports","require$$0","require$$1"],"mappings":"kNAE6B,eAAzBA,QAAQC,IAAIC,SACdC,EAAAC,QAAwDC,IAExDF,EAAAC,QAAyDE"}

package/dist/node_modules/.pnpm/style-inject@0.3.0/node_modules/style-inject/dist/style-inject.es.js

@@ -1,2 +0,0 @@
-function e(e,t){void 0===t&&(t={});var d=t.insertAt;if(e&&"undefined"!=typeof document){var n=document.head||document.getElementsByTagName("head")[0],s=document.createElement("style");s.type="text/css","top"===d&&n.firstChild?n.insertBefore(s,n.firstChild):n.appendChild(s),s.styleSheet?s.styleSheet.cssText=e:s.appendChild(document.createTextNode(e))}}export{e as default};
-//# sourceMappingURL=style-inject.es.js.map

package/dist/node_modules/.pnpm/style-inject@0.3.0/node_modules/style-inject/dist/style-inject.es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"style-inject.es.js","sources":["../../../../../../../../../../../node_modules/.pnpm/style-inject@0.3.0/node_modules/style-inject/dist/style-inject.es.js"],"sourcesContent":["function styleInject(css, ref) {\n  if ( ref === void 0 ) ref = {};\n  var insertAt = ref.insertAt;\n\n  if (!css || typeof document === 'undefined') { return; }\n\n  var head = document.head || document.getElementsByTagName('head')[0];\n  var style = document.createElement('style');\n  style.type = 'text/css';\n\n  if (insertAt === 'top') {\n    if (head.firstChild) {\n      head.insertBefore(style, head.firstChild);\n    } else {\n      head.appendChild(style);\n    }\n  } else {\n    head.appendChild(style);\n  }\n\n  if (style.styleSheet) {\n    style.styleSheet.cssText = css;\n  } else {\n    style.appendChild(document.createTextNode(css));\n  }\n}\n\nexport default styleInject;\n"],"names":["styleInject","css","ref","insertAt","document","head","getElementsByTagName","style","createElement","type","firstChild","insertBefore","appendChild","styleSheet","cssText","createTextNode"],"mappings":"AAAA,SAASA,EAAYC,EAAKC,QACN,IAAbA,IAAiBA,EAAM,CAAA,GAC5B,IAAIC,EAAWD,EAAIC,SAEnB,GAAKF,GAA2B,oBAAbG,SAAnB,CAEA,IAAIC,EAAOD,SAASC,MAAQD,SAASE,qBAAqB,QAAQ,GAC9DC,EAAQH,SAASI,cAAc,SACnCD,EAAME,KAAO,WAEI,QAAbN,GACEE,EAAKK,WACPL,EAAKM,aAAaJ,EAAOF,EAAKK,YAKhCL,EAAKO,YAAYL,GAGfA,EAAMM,WACRN,EAAMM,WAAWC,QAAUb,EAE3BM,EAAMK,YAAYR,SAASW,eAAed,GAnBY,CAqB1D"}

package/dist/node_modules/.pnpm/unist-util-is@6.0.1/node_modules/unist-util-is/lib/index.js

@@ -1,2 +0,0 @@
-const n=function(e){if(null==e)return r;if("function"==typeof e)return t(e);if("object"==typeof e)return Array.isArray(e)?function(r){const e=[];let o=-1;for(;++o<r.length;)e[o]=n(r[o]);return t(u);function u(...n){let t=-1;for(;++t<e.length;)if(e[t].apply(this,n))return!0;return!1}}(e):function(n){const r=n;return t(e);function e(t){const e=t;let o;for(o in n)if(e[o]!==r[o])return!1;return!0}}(e);if("string"==typeof e)return function(n){return t(r);function r(t){return t&&t.type===n}}(e);throw new Error("Expected function, string, or object as test")};function t(n){return function(t,r,e){return Boolean(function(n){return null!==n&&"object"==typeof n&&"type"in n}(t)&&n.call(this,t,"number"==typeof r?r:void 0,e||void 0))}}function r(){return!0}export{n as convert};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/unist-util-is@6.0.1/node_modules/unist-util-is/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../../node_modules/.pnpm/unist-util-is@6.0.1/node_modules/unist-util-is/lib/index.js"],"sourcesContent":["/**\n * @import {Node, Parent} from 'unist'\n */\n\n/**\n * @template Fn\n * @template Fallback\n * @typedef {Fn extends (value: any) => value is infer Thing ? Thing : Fallback} Predicate\n */\n\n/**\n * @callback Check\n *   Check that an arbitrary value is a node.\n * @param {unknown} this\n *   The given context.\n * @param {unknown} [node]\n *   Anything (typically a node).\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean}\n *   Whether this is a node and passes a test.\n *\n * @typedef {Record<string, unknown> | Node} Props\n *   Object to check for equivalence.\n *\n *   Note: `Node` is included as it is common but is not indexable.\n *\n * @typedef {Array<Props | TestFunction | string> | ReadonlyArray<Props | TestFunction | string> | Props | TestFunction | string | null | undefined} Test\n *   Check for an arbitrary node.\n *\n * @callback TestFunction\n *   Check if a node passes a test.\n * @param {unknown} this\n *   The given context.\n * @param {Node} node\n *   A node.\n * @param {number | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean | undefined | void}\n *   Whether this node passes the test.\n *\n *   Note: `void` is included until TS sees no return as `undefined`.\n */\n\n/**\n * Check if `node` is a `Node` and whether it passes the given test.\n *\n * @param {unknown} node\n *   Thing to check, typically `Node`.\n * @param {Test} test\n *   A check for a specific node.\n * @param {number | null | undefined} index\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} parent\n *   The node’s parent.\n * @param {unknown} context\n *   Context object (`this`) to pass to `test` functions.\n * @returns {boolean}\n *   Whether `node` is a node and passes a test.\n */\nexport const is =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends ReadonlyArray<string>>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n   *   (<Condition extends Array<string>>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n   *   (<Condition extends string>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((node?: null | undefined) => false) &\n   *   ((node: unknown, test?: null | undefined, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((node: unknown, test?: Test, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => boolean)\n   * )}\n   */\n  (\n    /**\n     * @param {unknown} [node]\n     * @param {Test} [test]\n     * @param {number | null | undefined} [index]\n     * @param {Parent | null | undefined} [parent]\n     * @param {unknown} [context]\n     * @returns {boolean}\n     */\n    // eslint-disable-next-line max-params\n    function (node, test, index, parent, context) {\n      const check = convert(test)\n\n      if (\n        index !== undefined &&\n        index !== null &&\n        (typeof index !== 'number' ||\n          index < 0 ||\n          index === Number.POSITIVE_INFINITY)\n      ) {\n        throw new Error('Expected positive finite index')\n      }\n\n      if (\n        parent !== undefined &&\n        parent !== null &&\n        (!is(parent) || !parent.children)\n      ) {\n        throw new Error('Expected parent node')\n      }\n\n      if (\n        (parent === undefined || parent === null) !==\n        (index === undefined || index === null)\n      ) {\n        throw new Error('Expected both parent and index')\n      }\n\n      return looksLikeANode(node)\n        ? check.call(context, node, index, parent)\n        : false\n    }\n  )\n\n/**\n * Generate an assertion from a test.\n *\n * Useful if you’re going to test many nodes, for example when creating a\n * utility where something else passes a compatible test.\n *\n * The created function is a bit faster because it expects valid input only:\n * a `node`, `index`, and `parent`.\n *\n * @param {Test} test\n *   *   when nullish, checks if `node` is a `Node`.\n *   *   when `string`, works like passing `(node) => node.type === test`.\n *   *   when `function` checks if function passed the node is true.\n *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n *   *   when `array`, checks if any one of the subtests pass.\n * @returns {Check}\n *   An assertion.\n */\nexport const convert =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((test?: null | undefined) => (node?: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((test?: Test) => Check)\n   * )}\n   */\n  (\n    /**\n     * @param {Test} [test]\n     * @returns {Check}\n     */\n    function (test) {\n      if (test === null || test === undefined) {\n        return ok\n      }\n\n      if (typeof test === 'function') {\n        return castFactory(test)\n      }\n\n      if (typeof test === 'object') {\n        return Array.isArray(test)\n          ? anyFactory(test)\n          : // Cast because `ReadonlyArray` goes into the above but `isArray`\n            // narrows to `Array`.\n            propertiesFactory(/** @type {Props} */ (test))\n      }\n\n      if (typeof test === 'string') {\n        return typeFactory(test)\n      }\n\n      throw new Error('Expected function, string, or object as test')\n    }\n  )\n\n/**\n * @param {Array<Props | TestFunction | string>} tests\n * @returns {Check}\n */\nfunction anyFactory(tests) {\n  /** @type {Array<Check>} */\n  const checks = []\n  let index = -1\n\n  while (++index < tests.length) {\n    checks[index] = convert(tests[index])\n  }\n\n  return castFactory(any)\n\n  /**\n   * @this {unknown}\n   * @type {TestFunction}\n   */\n  function any(...parameters) {\n    let index = -1\n\n    while (++index < checks.length) {\n      if (checks[index].apply(this, parameters)) return true\n    }\n\n    return false\n  }\n}\n\n/**\n * Turn an object into a test for a node with a certain fields.\n *\n * @param {Props} check\n * @returns {Check}\n */\nfunction propertiesFactory(check) {\n  const checkAsRecord = /** @type {Record<string, unknown>} */ (check)\n\n  return castFactory(all)\n\n  /**\n   * @param {Node} node\n   * @returns {boolean}\n   */\n  function all(node) {\n    const nodeAsRecord = /** @type {Record<string, unknown>} */ (\n      /** @type {unknown} */ (node)\n    )\n\n    /** @type {string} */\n    let key\n\n    for (key in check) {\n      if (nodeAsRecord[key] !== checkAsRecord[key]) return false\n    }\n\n    return true\n  }\n}\n\n/**\n * Turn a string into a test for a node with a certain type.\n *\n * @param {string} check\n * @returns {Check}\n */\nfunction typeFactory(check) {\n  return castFactory(type)\n\n  /**\n   * @param {Node} node\n   */\n  function type(node) {\n    return node && node.type === check\n  }\n}\n\n/**\n * Turn a custom test into a test for a node that passes that test.\n *\n * @param {TestFunction} testFunction\n * @returns {Check}\n */\nfunction castFactory(testFunction) {\n  return check\n\n  /**\n   * @this {unknown}\n   * @type {Check}\n   */\n  function check(value, index, parent) {\n    return Boolean(\n      looksLikeANode(value) &&\n        testFunction.call(\n          this,\n          value,\n          typeof index === 'number' ? index : undefined,\n          parent || undefined\n        )\n    )\n  }\n}\n\nfunction ok() {\n  return true\n}\n\n/**\n * @param {unknown} value\n * @returns {value is Node}\n */\nfunction looksLikeANode(value) {\n  return value !== null && typeof value === 'object' && 'type' in value\n}\n"],"names":["convert","test","ok","castFactory","Array","isArray","tests","checks","index","length","any","parameters","apply","this","anyFactory","check","checkAsRecord","all","node","nodeAsRecord","key","propertiesFactory","type","typeFactory","Error","testFunction","value","parent","Boolean","looksLikeANode","call","undefined"],"mappings":"AA4IY,MAACA,EAWb,SAKcC,GACR,GAAIA,QACF,OAAOC,EAGT,GAAoB,mBAATD,EACT,OAAOE,EAAYF,GAGrB,GAAoB,iBAATA,EACT,OAAOG,MAAMC,QAAQJ,GAmB7B,SAAoBK,GAElB,MAAMC,EAAS,GACf,IAAIC,GAAS,EAEb,OAASA,EAAQF,EAAMG,QACrBF,EAAOC,GAASR,EAAQM,EAAME,IAGhC,OAAOL,EAAYO,GAMnB,SAASA,KAAOC,GACd,IAAIH,GAAS,EAEb,OAASA,EAAQD,EAAOE,QACtB,GAAIF,EAAOC,GAAOI,MAAMC,KAAMF,GAAa,OAAO,EAGpD,OAAO,CACR,CACH,CA1CYG,CAAWb,GAkDvB,SAA2Bc,GACzB,MAAMC,EAAwD,EAE9D,OAAOb,EAAYc,GAMnB,SAASA,EAAIC,GACX,MAAMC,EAAY,EAKlB,IAAIC,EAEJ,IAAKA,KAAOL,EACV,GAAII,EAAaC,KAASJ,EAAcI,GAAM,OAAO,EAGvD,OAAO,CACR,CACH,CAtEYC,CAAwC,GAG9C,GAAoB,iBAATpB,EACT,OA0ER,SAAqBc,GACnB,OAAOZ,EAAYmB,GAKnB,SAASA,EAAKJ,GACZ,OAAOA,GAAQA,EAAKI,OAASP,CAC9B,CACH,CAnFeQ,CAAYtB,GAGrB,MAAM,IAAIuB,MAAM,+CAEnB,EAsFH,SAASrB,EAAYsB,GACnB,OAMA,SAAeC,EAAOlB,EAAOmB,GAC3B,OAAOC,QAoBX,SAAwBF,GACtB,OAAiB,OAAVA,GAAmC,iBAAVA,GAAsB,SAAUA,CAClE,CArBMG,CAAeH,IACbD,EAAaK,KACXjB,KACAa,EACiB,iBAAVlB,EAAqBA,OAAQuB,EACpCJ,QAAUI,GAGjB,CACH,CAEA,SAAS7B,IACP,OAAO,CACT"}

package/dist/node_modules/.pnpm/unist-util-visit-parents@6.0.2/node_modules/unist-util-visit-parents/lib/color.js

@@ -1,2 +0,0 @@
-function n(n){return n}export{n as color};
-//# sourceMappingURL=color.js.map

package/dist/node_modules/.pnpm/unist-util-visit-parents@6.0.2/node_modules/unist-util-visit-parents/lib/color.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"color.js","sources":["../../../../../../../../../../../node_modules/.pnpm/unist-util-visit-parents@6.0.2/node_modules/unist-util-visit-parents/lib/color.js"],"sourcesContent":["/**\n * @param {string} d\n * @returns {string}\n */\nexport function color(d) {\n  return d\n}\n"],"names":["color","d"],"mappings":"AAIO,SAASA,EAAMC,GACpB,OAAOA,CACT"}

package/dist/node_modules/.pnpm/unist-util-visit-parents@6.0.2/node_modules/unist-util-visit-parents/lib/index.js

@@ -1,2 +0,0 @@
-import{convert as n}from"../../../../unist-util-is@6.0.1/node_modules/unist-util-is/lib/index.js";import{color as t}from"./color.js";const e=[],i=!0,r=!1,o="skip";function f(f,c,u,l){let s;"function"==typeof c&&"function"!=typeof u?(l=u,u=c):s=c;const p=n(s),d=l?-1:1;!function n(f,s,y){const m=f&&"object"==typeof f?f:{};if("string"==typeof m.type){const n="string"==typeof m.tagName?m.tagName:"string"==typeof m.name?m.name:void 0;Object.defineProperty(a,"name",{value:"node ("+t(f.type+(n?"<"+n+">":""))+")"})}return a;function a(){let t,m,a,h=e;if((!c||p(f,s,y[y.length-1]||void 0))&&(h=function(n){if(Array.isArray(n))return n;if("number"==typeof n)return[i,n];return null==n?e:[n]}(u(f,y)),h[0]===r))return h;if("children"in f&&f.children){const e=f;if(e.children&&h[0]!==o)for(m=(l?e.children.length:-1)+d,a=y.concat(e);m>-1&&m<e.children.length;){const i=e.children[m];if(t=n(i,m,a)(),t[0]===r)return t;m="number"==typeof t[1]?t[1]:m+d}}return h}}(f,void 0,[])()}export{i as CONTINUE,r as EXIT,o as SKIP,f as visitParents};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/unist-util-visit-parents@6.0.2/node_modules/unist-util-visit-parents/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../../node_modules/.pnpm/unist-util-visit-parents@6.0.2/node_modules/unist-util-visit-parents/lib/index.js"],"sourcesContent":["/**\n * @import {Node as UnistNode, Parent as UnistParent} from 'unist'\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends ReadonlyArray<infer T>\n *   ? MatchesOne<Value, T>\n *   : Check extends Array<infer T>\n *   ? MatchesOne<Value, T>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {InternalAncestor<InclusiveDescendant<Tree>, Child>} Ancestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {'skip' | boolean} Action\n *   Union of the action types.\n *\n * @typedef {number} Index\n *   Move to the sibling at `index` next (after node itself is completely\n *   traversed).\n *\n *   Useful if mutating the tree, such as removing the node the visitor is\n *   currently on, or any of its previous siblings.\n *   Results less than 0 or greater than or equal to `children.length` stop\n *   traversing the parent.\n *\n * @typedef {[(Action | null | undefined | void)?, (Index | null | undefined)?]} ActionTuple\n *   List with one or two values, the first an action, the second an index.\n *\n * @typedef {Action | ActionTuple | Index | null | undefined | void} VisitorResult\n *   Any value that can be returned from a visitor.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform the parent of node (the last of `ancestors`).\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of an ancestor still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Array<VisitedParents>} ancestors\n *   Ancestors of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [VisitedParents=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Matches<InclusiveDescendant<Tree>, Check>, Ancestor<Tree, Matches<InclusiveDescendant<Tree>, Check>>>} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parents`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Tree type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from 'unist-util-visit-parents/do-not-use-color'\n\n/** @type {Readonly<ActionTuple>} */\nconst empty = []\n\n/**\n * Continue traversing as normal.\n */\nexport const CONTINUE = true\n\n/**\n * Stop traversing immediately.\n */\nexport const EXIT = false\n\n/**\n * Do not traverse this node’s children.\n */\nexport const SKIP = 'skip'\n\n/**\n * Visit nodes, with ancestral information.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} test\n *   `unist-util-is`-compatible test\n * @param {Visitor | boolean | null | undefined} [visitor]\n *   Handle each node.\n * @param {boolean | null | undefined} [reverse]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visitParents(tree, test, visitor, reverse) {\n  /** @type {Test} */\n  let check\n\n  if (typeof test === 'function' && typeof visitor !== 'function') {\n    reverse = visitor\n    // @ts-expect-error no visitor given, so `visitor` is test.\n    visitor = test\n  } else {\n    // @ts-expect-error visitor given, so `test` isn’t a visitor.\n    check = test\n  }\n\n  const is = convert(check)\n  const step = reverse ? -1 : 1\n\n  factory(tree, undefined, [])()\n\n  /**\n   * @param {UnistNode} node\n   * @param {number | undefined} index\n   * @param {Array<UnistParent>} parents\n   */\n  function factory(node, index, parents) {\n    const value = /** @type {Record<string, unknown>} */ (\n      node && typeof node === 'object' ? node : {}\n    )\n\n    if (typeof value.type === 'string') {\n      const name =\n        // `hast`\n        typeof value.tagName === 'string'\n          ? value.tagName\n          : // `xast`\n            typeof value.name === 'string'\n            ? value.name\n            : undefined\n\n      Object.defineProperty(visit, 'name', {\n        value:\n          'node (' + color(node.type + (name ? '<' + name + '>' : '')) + ')'\n      })\n    }\n\n    return visit\n\n    function visit() {\n      /** @type {Readonly<ActionTuple>} */\n      let result = empty\n      /** @type {Readonly<ActionTuple>} */\n      let subresult\n      /** @type {number} */\n      let offset\n      /** @type {Array<UnistParent>} */\n      let grandparents\n\n      if (!test || is(node, index, parents[parents.length - 1] || undefined)) {\n        // @ts-expect-error: `visitor` is now a visitor.\n        result = toResult(visitor(node, parents))\n\n        if (result[0] === EXIT) {\n          return result\n        }\n      }\n\n      if ('children' in node && node.children) {\n        const nodeAsParent = /** @type {UnistParent} */ (node)\n\n        if (nodeAsParent.children && result[0] !== SKIP) {\n          offset = (reverse ? nodeAsParent.children.length : -1) + step\n          grandparents = parents.concat(nodeAsParent)\n\n          while (offset > -1 && offset < nodeAsParent.children.length) {\n            const child = nodeAsParent.children[offset]\n\n            subresult = factory(child, offset, grandparents)()\n\n            if (subresult[0] === EXIT) {\n              return subresult\n            }\n\n            offset =\n              typeof subresult[1] === 'number' ? subresult[1] : offset + step\n          }\n        }\n      }\n\n      return result\n    }\n  }\n}\n\n/**\n * Turn a return value into a clean result.\n *\n * @param {VisitorResult} value\n *   Valid return values from visitors.\n * @returns {Readonly<ActionTuple>}\n *   Clean result.\n */\nfunction toResult(value) {\n  if (Array.isArray(value)) {\n    return value\n  }\n\n  if (typeof value === 'number') {\n    return [CONTINUE, value]\n  }\n\n  return value === null || value === undefined ? empty : [value]\n}\n"],"names":["empty","CONTINUE","EXIT","SKIP","visitParents","tree","test","visitor","reverse","check","is","convert","step","factory","node","index","parents","value","type","name","tagName","undefined","Object","defineProperty","visit","color","subresult","offset","grandparents","result","length","Array","isArray","toResult","children","nodeAsParent","concat","child"],"mappings":"qIAgOA,MAAMA,EAAQ,GAKDC,GAAW,EAKXC,GAAO,EAKPC,EAAO,OAiDb,SAASC,EAAaC,EAAMC,EAAMC,EAASC,GAEhD,IAAIC,EAEgB,mBAATH,GAA0C,mBAAZC,GACvCC,EAAUD,EAEVA,EAAUD,GAGVG,EAAQH,EAGV,MAAMI,EAAKC,EAAQF,GACbG,EAAOJ,GAAW,EAAI,GAS5B,SAASK,EAAQC,EAAMC,EAAOC,GAC5B,MAAMC,EACJH,GAAwB,iBAATA,EAAoBA,EAAO,CAAE,EAG9C,GAA0B,iBAAfG,EAAMC,KAAmB,CAClC,MAAMC,EAEqB,iBAAlBF,EAAMG,QACTH,EAAMG,QAEgB,iBAAfH,EAAME,KACXF,EAAME,UACNE,EAERC,OAAOC,eAAeC,EAAO,OAAQ,CACnCP,MACE,SAAWQ,EAAMX,EAAKI,MAAQC,EAAO,IAAMA,EAAO,IAAM,KAAO,KAEpE,CAED,OAAOK,EAEP,SAASA,IAEP,IAEIE,EAEAC,EAEAC,EANAC,EAAS7B,EAQb,KAAKM,GAAQI,EAAGI,EAAMC,EAAOC,EAAQA,EAAQc,OAAS,SAAMT,MAE1DQ,EA0CR,SAAkBZ,GAChB,GAAIc,MAAMC,QAAQf,GAChB,OAAOA,EAGT,GAAqB,iBAAVA,EACT,MAAO,CAAChB,EAAUgB,GAGpB,OAAOA,QAAwCjB,EAAQ,CAACiB,EAC1D,CApDiBgB,CAAS1B,EAAQO,EAAME,IAE5Ba,EAAO,KAAO3B,GAChB,OAAO2B,EAIX,GAAI,aAAcf,GAAQA,EAAKoB,SAAU,CACvC,MAAMC,EAA2C,EAEjD,GAAIA,EAAaD,UAAYL,EAAO,KAAO1B,EAIzC,IAHAwB,GAAUnB,EAAU2B,EAAaD,SAASJ,QAAU,GAAKlB,EACzDgB,EAAeZ,EAAQoB,OAAOD,GAEvBR,GAAU,GAAKA,EAASQ,EAAaD,SAASJ,QAAQ,CAC3D,MAAMO,EAAQF,EAAaD,SAASP,GAIpC,GAFAD,EAAYb,EAAQwB,EAAOV,EAAQC,EAAvBf,GAERa,EAAU,KAAOxB,EACnB,OAAOwB,EAGTC,EAC0B,iBAAjBD,EAAU,GAAkBA,EAAU,GAAKC,EAASf,CAC9D,CAEJ,CAED,OAAOiB,CACR,CACF,CAzEDhB,CAAQR,OAAMgB,EAAW,GAAzBR,EA0EF"}

package/dist/node_modules/.pnpm/unist-util-visit@5.1.0/node_modules/unist-util-visit/lib/index.js

@@ -1,2 +0,0 @@
-import{visitParents as i}from"../../../../unist-util-visit-parents@6.0.2/node_modules/unist-util-visit-parents/lib/index.js";export{CONTINUE,EXIT,SKIP}from"../../../../unist-util-visit-parents@6.0.2/node_modules/unist-util-visit-parents/lib/index.js";function t(t,n,e,o){let s,u,r;"function"==typeof n&&"function"!=typeof e?(u=void 0,r=n,s=e):(u=n,r=e,s=o),i(t,u,function(i,t){const n=t[t.length-1],e=n?n.children.indexOf(i):void 0;return r(i,e,n)},s)}export{t as visit};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/unist-util-visit@5.1.0/node_modules/unist-util-visit/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../../node_modules/.pnpm/unist-util-visit@5.1.0/node_modules/unist-util-visit/lib/index.js"],"sourcesContent":["/**\n * @import {Node as UnistNode, Parent as UnistParent} from 'unist'\n * @import {VisitorResult} from 'unist-util-visit-parents'\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n// To do: use types from `unist-util-visit-parents` when it’s released.\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends ReadonlyArray<any>\n *   ? MatchesOne<Value, Check[number]>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform `parent`.\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of `parent` still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Visited extends UnistNode ? number | undefined : never} index\n *   Index of `node` in `parent`.\n * @param {Ancestor extends UnistParent ? Ancestor | undefined : never} parent\n *   Parent of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [Ancestor=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Visited, Parent<Ancestor, Visited>>} BuildVisitorFromMatch\n *   Build a typed `Visitor` function from a node and all possible parents.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Visited\n *   Node type.\n * @template {UnistParent} Ancestor\n *   Parent type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromMatch<\n *     Matches<Descendant, Check>,\n *     Extract<Descendant, UnistParent>\n *   >\n * )} BuildVisitorFromDescendants\n *   Build a typed `Visitor` function from a list of descendants and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Descendant\n *   Node type.\n * @template {Test} Check\n *   Test type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromDescendants<\n *     InclusiveDescendant<Tree>,\n *     Check\n *   >\n * )} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Node type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {visitParents} from 'unist-util-visit-parents'\n\nexport {CONTINUE, EXIT, SKIP} from 'unist-util-visit-parents'\n\n/**\n * Visit nodes.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} testOrVisitor\n *   `unist-util-is`-compatible test (optional, omit to pass a visitor).\n * @param {Visitor | boolean | null | undefined} [visitorOrReverse]\n *   Handle each node (when test is omitted, pass `reverse`).\n * @param {boolean | null | undefined} [maybeReverse=false]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visit(tree, testOrVisitor, visitorOrReverse, maybeReverse) {\n  /** @type {boolean | null | undefined} */\n  let reverse\n  /** @type {Test} */\n  let test\n  /** @type {Visitor} */\n  let visitor\n\n  if (\n    typeof testOrVisitor === 'function' &&\n    typeof visitorOrReverse !== 'function'\n  ) {\n    test = undefined\n    visitor = testOrVisitor\n    reverse = visitorOrReverse\n  } else {\n    // @ts-expect-error: assume the overload with test was given.\n    test = testOrVisitor\n    // @ts-expect-error: assume the overload with test was given.\n    visitor = visitorOrReverse\n    reverse = maybeReverse\n  }\n\n  visitParents(tree, test, overload, reverse)\n\n  /**\n   * @param {UnistNode} node\n   * @param {Array<UnistParent>} parents\n   */\n  function overload(node, parents) {\n    const parent = parents[parents.length - 1]\n    const index = parent ? parent.children.indexOf(node) : undefined\n    return visitor(node, index, parent)\n  }\n}\n"],"names":["visit","tree","testOrVisitor","visitorOrReverse","maybeReverse","reverse","test","visitor","undefined","visitParents","node","parents","parent","length","index","children","indexOf"],"mappings":"2PAqRO,SAASA,EAAMC,EAAMC,EAAeC,EAAkBC,GAE3D,IAAIC,EAEAC,EAEAC,EAGuB,mBAAlBL,GACqB,mBAArBC,GAEPG,OAAOE,EACPD,EAAUL,EACVG,EAAUF,IAGVG,EAAOJ,EAEPK,EAAUJ,EACVE,EAAUD,GAGZK,EAAaR,EAAMK,EAMnB,SAAkBI,EAAMC,GACtB,MAAMC,EAASD,EAAQA,EAAQE,OAAS,GAClCC,EAAQF,EAASA,EAAOG,SAASC,QAAQN,QAAQF,EACvD,OAAOD,EAAQG,EAAMI,EAAOF,EAC7B,EAVkCP,EAWrC"}

package/dist/types/AutopilotStyle.d.ts

@@ -1,2 +0,0 @@
-export declare const autopilotStyles = "\n  @keyframes shimmerSweep {\n    0%   { background-position: -200% center; }\n    100% { background-position: 200% center; }\n  }\n\n  @keyframes dotGrow {\n    0%, 100%  { transform: scale(0.3); opacity: 0.2; }\n    50%       { transform: scale(1);   opacity: 1; }\n  }\n\n  .autopilot-glow-text {\n    background: linear-gradient(90deg, #6d28d9 0%, #a78bfa 30%, #c4b5fd 50%, #a78bfa 70%, #6d28d9 100%);\n    background-size: 200% auto;\n    -webkit-background-clip: text;\n    -webkit-text-fill-color: transparent;\n    background-clip: text;\n    animation: shimmerSweep 2s linear infinite;\n  }\n\n  .autopilot-dot {\n    display: inline-block;\n    width: 5px;\n    height: 5px;\n    border-radius: 50%;\n    background-color: #7c3aed;\n    transform: scale(0.3);\n    opacity: 0.2;\n  }\n\n  .autopilot-dot:nth-child(1) { animation: dotGrow 1.2s ease-in-out infinite; animation-delay: 0s; }\n  .autopilot-dot:nth-child(2) { animation: dotGrow 1.2s ease-in-out infinite; animation-delay: 0.4s; }\n  .autopilot-dot:nth-child(3) { animation: dotGrow 1.2s ease-in-out infinite; animation-delay: 0.8s; }\n";
-//# sourceMappingURL=AutopilotStyle.d.ts.map

package/dist/types/AutopilotStyle.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"AutopilotStyle.d.ts","sourceRoot":"","sources":["../../src/AutopilotStyle.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,eAAe,ylCAiC3B,CAAC"}

package/dist/types/BPACitationRenderer.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/BPACitationRenderer/BPACitationRenderer';
-export * from './features/BPACitationRenderer/BPACitationRenderer';
-//# sourceMappingURL=BPACitationRenderer.d.ts.map

package/dist/types/BPACitationRenderer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"BPACitationRenderer.d.ts","sourceRoot":"","sources":["../../src/BPACitationRenderer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,oDAAoD,CAAC;AAC7E,cAAc,oDAAoD,CAAC"}

package/dist/types/BookCitation.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/BookCitation/BookCitation';
-export * from './features/BookCitation/BookCitation';
-//# sourceMappingURL=BookCitation.d.ts.map

package/dist/types/BookCitation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"BookCitation.d.ts","sourceRoot":"","sources":["../../src/BookCitation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,sCAAsC,CAAC;AAC/D,cAAc,sCAAsC,CAAC"}

package/dist/types/Bookemon.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/Bookemon/Bookemon';
-export * from './features/Bookemon/Bookemon';
-//# sourceMappingURL=Bookemon.d.ts.map

package/dist/types/Bookemon.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Bookemon.d.ts","sourceRoot":"","sources":["../../src/Bookemon.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,8BAA8B,CAAC;AACvD,cAAc,8BAA8B,CAAC"}

package/dist/types/ChatCitation.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/ChatCitation/ChatCitationRenderer';
-export * from './features/ChatCitation/ChatCitationRenderer';
-//# sourceMappingURL=ChatCitation.d.ts.map

package/dist/types/ChatCitation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ChatCitation.d.ts","sourceRoot":"","sources":["../../src/ChatCitation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,8CAA8C,CAAC;AACvE,cAAc,8CAA8C,CAAC"}

package/dist/types/ChatDrawer.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/ChatDrawer/ChatDrawer';
-export * from './features/ChatDrawer/ChatDrawer';
-//# sourceMappingURL=ChatDrawer.d.ts.map

package/dist/types/ChatDrawer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ChatDrawer.d.ts","sourceRoot":"","sources":["../../src/ChatDrawer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAC3D,cAAc,kCAAkC,CAAC"}

package/dist/types/CitationRenderer.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/CitationRenderer/CitationRenderer';
-export * from './features/CitationRenderer/CitationRenderer';
-//# sourceMappingURL=CitationRenderer.d.ts.map

package/dist/types/CitationRenderer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"CitationRenderer.d.ts","sourceRoot":"","sources":["../../src/CitationRenderer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,8CAA8C,CAAC;AACvE,cAAc,8CAA8C,CAAC"}

package/dist/types/CodeCitation.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/CodeCitation/CodeCitation';
-export * from './features/CodeCitation/CodeCitation';
-//# sourceMappingURL=CodeCitation.d.ts.map

package/dist/types/CodeCitation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"CodeCitation.d.ts","sourceRoot":"","sources":["../../src/CodeCitation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,sCAAsC,CAAC;AAC/D,cAAc,sCAAsC,CAAC"}

package/dist/types/CognitiveInternalgptCoreComponent.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/CognitiveInternalgptReasoning/CognitiveInternalgptCoreComponent';
-export * from './features/CognitiveInternalgptReasoning/CognitiveInternalgptCoreComponent';
-//# sourceMappingURL=CognitiveInternalgptCoreComponent.d.ts.map

package/dist/types/CognitiveInternalgptCoreComponent.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"CognitiveInternalgptCoreComponent.d.ts","sourceRoot":"","sources":["../../src/CognitiveInternalgptCoreComponent.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,4EAA4E,CAAC;AACrG,cAAc,4EAA4E,CAAC"}

package/dist/types/CognitiveInternalgptReasoning.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/CognitiveInternalgptReasoning/CognitiveInternalgptReasoningComponent';
-export * from './features/CognitiveInternalgptReasoning/CognitiveInternalgptReasoningComponent';
-//# sourceMappingURL=CognitiveInternalgptReasoning.d.ts.map

package/dist/types/CognitiveInternalgptReasoning.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"CognitiveInternalgptReasoning.d.ts","sourceRoot":"","sources":["../../src/CognitiveInternalgptReasoning.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,iFAAiF,CAAC;AAC1G,cAAc,iFAAiF,CAAC"}

package/dist/types/CommonConstants/CommonConstants.d.ts

@@ -1,5 +0,0 @@
-export type ButtonVariant = "big" | "small";
-export declare const BIGTEXT: ButtonVariant;
-export declare const SMALLTEXT: ButtonVariant;
-export declare const RESOURCE_TABLE_SCENARIO_VALUE = "resourcesOfSelectedDataSetCollection";
-//# sourceMappingURL=CommonConstants.d.ts.map

package/dist/types/CommonConstants/CommonConstants.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"CommonConstants.d.ts","sourceRoot":"","sources":["../../../src/CommonConstants/CommonConstants.tsx"],"names":[],"mappings":"AACA,MAAM,MAAM,aAAa,GAAG,KAAK,GAAG,OAAO,CAAC;AAC5C,eAAO,MAAM,OAAO,EAAE,aAAqB,CAAC;AAC5C,eAAO,MAAM,SAAS,EAAE,aAAuB,CAAC;AAChD,eAAO,MAAM,6BAA6B,yCAAyC,CAAA"}

package/dist/types/GptWebCitation.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/GptWebCitation/GptWebCitation';
-export * from './features/GptWebCitation/GptWebCitation';
-//# sourceMappingURL=GptWebCitation.d.ts.map

package/dist/types/GptWebCitation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"GptWebCitation.d.ts","sourceRoot":"","sources":["../../src/GptWebCitation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,0CAA0C,CAAC;AACnE,cAAc,0CAA0C,CAAC"}

package/dist/types/IngestionStatusComponent.d.ts

@@ -1,2 +0,0 @@
-export * from './features/IngestionStatus/IngestionStatusComponent';
-//# sourceMappingURL=IngestionStatusComponent.d.ts.map

package/dist/types/IngestionStatusComponent.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"IngestionStatusComponent.d.ts","sourceRoot":"","sources":["../../src/IngestionStatusComponent.ts"],"names":[],"mappings":"AAAA,cAAc,qDAAqD,CAAC"}

package/dist/types/PdfViewer.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/PdfViewer/PdfViewer';
-export * from './features/PdfViewer/PdfViewer';
-//# sourceMappingURL=PdfViewer.d.ts.map

package/dist/types/PdfViewer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"PdfViewer.d.ts","sourceRoot":"","sources":["../../src/PdfViewer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,gCAAgC,CAAC;AACzD,cAAc,gCAAgC,CAAC"}

package/dist/types/ProjectAccordion.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/ProjectAccordion/ProjectAccordion';
-export * from './features/ProjectAccordion/ProjectAccordion';
-//# sourceMappingURL=ProjectAccordion.d.ts.map

package/dist/types/ProjectAccordion.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ProjectAccordion.d.ts","sourceRoot":"","sources":["../../src/ProjectAccordion.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,8CAA8C,CAAC;AACvE,cAAc,8CAA8C,CAAC"}

package/dist/types/SplitterCitationsComponent.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/SplitterCitations/SplitterCitationsComponent';
-export * from './features/SplitterCitations/SplitterCitationsComponent';
-//# sourceMappingURL=SplitterCitationsComponent.d.ts.map

package/dist/types/SplitterCitationsComponent.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"SplitterCitationsComponent.d.ts","sourceRoot":"","sources":["../../src/SplitterCitationsComponent.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,yDAAyD,CAAC;AAClF,cAAc,yDAAyD,CAAC"}

package/dist/types/TextualGuideLinesComponent.d.ts

@@ -1,3 +0,0 @@
-export { default } from './features/TextualGuidelines/TextualGuideLinesComponent';
-export * from './features/TextualGuidelines/TextualGuideLinesComponent';
-//# sourceMappingURL=TextualGuideLinesComponent.d.ts.map

package/dist/types/TextualGuideLinesComponent.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"TextualGuideLinesComponent.d.ts","sourceRoot":"","sources":["../../src/TextualGuideLinesComponent.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,yDAAyD,CAAC;AAClF,cAAc,yDAAyD,CAAC"}

package/dist/types/assests/icons/CitationsIcon.d.ts

@@ -1,2 +0,0 @@
-export declare const CitationIcon: () => import("react").JSX.Element;
-//# sourceMappingURL=CitationsIcon.d.ts.map

package/dist/types/assests/icons/CitationsIcon.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"CitationsIcon.d.ts","sourceRoot":"","sources":["../../../../src/assests/icons/CitationsIcon.tsx"],"names":[],"mappings":"AAAA,eAAO,MAAM,YAAY,mCAkCtB,CAAC"}

package/dist/types/assests/icons/CitationsSparkleIcon.d.ts

@@ -1,9 +0,0 @@
-type CitationLinkSparkleIconProps = {
-    color?: string;
-    width?: number | string;
-    height?: number | string;
-    style?: React.CSSProperties;
-};
-export declare const CitationLinkSparkleIcon: React.FC<CitationLinkSparkleIconProps>;
-export {};
-//# sourceMappingURL=CitationsSparkleIcon.d.ts.map

package/dist/types/assests/icons/CitationsSparkleIcon.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"CitationsSparkleIcon.d.ts","sourceRoot":"","sources":["../../../../src/assests/icons/CitationsSparkleIcon.tsx"],"names":[],"mappings":"AAAA,KAAK,4BAA4B,GAAG;IAClC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACxB,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACzB,KAAK,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC;CAC7B,CAAC;AAEF,eAAO,MAAM,uBAAuB,EAAE,KAAK,CAAC,EAAE,CAAC,4BAA4B,CA+B1E,CAAC"}

package/dist/types/assests/icons/InfoAlert.d.ts

@@ -1,3 +0,0 @@
-import { type SvgIconProps } from '@mui/material/SvgIcon';
-export default function InfoAlert(props: SvgIconProps): import("react").JSX.Element;
-//# sourceMappingURL=InfoAlert.d.ts.map

package/dist/types/assests/icons/InfoAlert.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"InfoAlert.d.ts","sourceRoot":"","sources":["../../../../src/assests/icons/InfoAlert.tsx"],"names":[],"mappings":"AAAA,OAAgB,EAAE,KAAK,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAEnE,MAAM,CAAC,OAAO,UAAU,SAAS,CAAC,KAAK,EAAE,YAAY,+BAgBpD"}

package/dist/types/assests/svg/ButtonCognitiveIcon.d.ts

@@ -1,2 +0,0 @@
-export declare const ButtonCognitiveIcon: () => import("react").JSX.Element;
-//# sourceMappingURL=ButtonCognitiveIcon.d.ts.map

package/dist/types/assests/svg/ButtonCognitiveIcon.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ButtonCognitiveIcon.d.ts","sourceRoot":"","sources":["../../../../src/assests/svg/ButtonCognitiveIcon.tsx"],"names":[],"mappings":"AAAA,eAAO,MAAM,mBAAmB,mCAe/B,CAAC"}

package/dist/types/assests/svg/NeuralNetworkIcon.d.ts

@@ -1,10 +0,0 @@
-import React from "react";
-type NeuralNetworkIconProps = {
-    className?: string;
-    size?: number;
-    color?: string;
-    "aria-hidden"?: boolean;
-};
-declare const NeuralNetworkIcon: ({ className, size, color, "aria-hidden": ariaHidden, }: NeuralNetworkIconProps) => React.JSX.Element;
-export default NeuralNetworkIcon;
-//# sourceMappingURL=NeuralNetworkIcon.d.ts.map

package/dist/types/assests/svg/NeuralNetworkIcon.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"NeuralNetworkIcon.d.ts","sourceRoot":"","sources":["../../../../src/assests/svg/NeuralNetworkIcon.tsx"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,OAAO,CAAC;AAE1B,KAAK,sBAAsB,GAAG;IAC5B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB,CAAC;AAEF,QAAA,MAAM,iBAAiB,2DAKpB,sBAAsB,sBAsBxB,CAAC;AAEF,eAAe,iBAAiB,CAAC"}

package/dist/types/assests/svg/PdfViewerIcons.d.ts

@@ -1,6 +0,0 @@
-export declare const DefaultPdfIcon: () => import("react").JSX.Element;
-export declare const DefaultFullScreenIcon: () => import("react").JSX.Element;
-export declare const DefaultDownloadIcon: () => import("react").JSX.Element;
-export declare const DefaultCloseIcon: () => import("react").JSX.Element;
-export declare const DefaultFullScreenCloseIcon: () => import("react").JSX.Element;
-//# sourceMappingURL=PdfViewerIcons.d.ts.map

package/dist/types/assests/svg/PdfViewerIcons.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"PdfViewerIcons.d.ts","sourceRoot":"","sources":["../../../../src/assests/svg/PdfViewerIcons.tsx"],"names":[],"mappings":"AAAA,eAAO,MAAM,cAAc,mCAI1B,CAAC;AAEF,eAAO,MAAM,qBAAqB,mCAIjC,CAAC;AAEF,eAAO,MAAM,mBAAmB,mCAM/B,CAAC;AAEF,eAAO,MAAM,gBAAgB,mCAK5B,CAAC;AAEF,eAAO,MAAM,0BAA0B,mCAetC,CAAC"}

package/dist/types/assests/svg/SparkleIcon.d.ts

@@ -1,3 +0,0 @@
-declare const SparkleIcon: () => import("react").JSX.Element;
-export default SparkleIcon;
-//# sourceMappingURL=SparkleIcon.d.ts.map

package/dist/types/assests/svg/SparkleIcon.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"SparkleIcon.d.ts","sourceRoot":"","sources":["../../../../src/assests/svg/SparkleIcon.tsx"],"names":[],"mappings":"AAAA,QAAA,MAAM,WAAW,mCAqBhB,CAAC;AAEF,eAAe,WAAW,CAAC"}

package/dist/types/constants/diagnosticStylesBySeverity.d.ts

@@ -1,3 +0,0 @@
-import { IDiagnosticStylesBySeverity } from "../types/CodeCitationTypes";
-export declare const DEFAULT_DIAGNOSTIC_STYLES_BY_SEVERITY: IDiagnosticStylesBySeverity;
-//# sourceMappingURL=diagnosticStylesBySeverity.d.ts.map

package/dist/types/constants/diagnosticStylesBySeverity.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"diagnosticStylesBySeverity.d.ts","sourceRoot":"","sources":["../../../src/constants/diagnosticStylesBySeverity.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,2BAA2B,EAAE,MAAM,4BAA4B,CAAC;AAEzE,eAAO,MAAM,qCAAqC,EAAE,2BAiBnD,CAAC"}

package/dist/types/context/DataSelectedContext.d.ts

@@ -1,73 +0,0 @@
-import React, { ReactNode } from 'react';
-import { UploadSource } from '../features/UploadData/main';
-import { IModel } from '../features/UploadData/Components/SelectDataFromRLEF/interfaces/models';
-import { IProject } from '../features/UploadData/Components/SelectDataFromRLEF/interfaces/projects';
-import { ICollection } from '../features/UploadData/Components/SelectDataFromRLEF/interfaces/collections';
-import { IData } from '../features/UploadData/Components/SelectDataFromRLEF/interfaces/data';
-export interface IDataCartProjectsState {
-    availableProjects: Array<IProject>;
-    isFetchingProjects: boolean;
-    selectedProject: IProject | null;
-    searchTerm: string;
-}
-export interface IDataCartTasksState {
-    availableTasks: Array<IModel>;
-    isFetchingTasks: boolean;
-    selectedTask: IModel | null;
-    searchTerm: string;
-}
-export interface IDataSetState {
-    availableDataSets: ICollection[];
-    isFetchingDataSets: boolean;
-    selectedDataSet: ICollection | null;
-    datasetCollectionTotalCount?: number;
-}
-interface DataSelectedContextType {
-    selectedModeOfUploadData: UploadSource | null;
-    setSelectedModeOfUploadData: (source: UploadSource) => void;
-    projectsState: IDataCartProjectsState;
-    tasksState: IDataCartTasksState;
-    fetchAllProjects: () => Promise<void>;
-    fetchAllTasks: (projectId: string) => Promise<void>;
-    selectTask: (task: IModel | null) => void;
-    selectProject: (project: IProject | null) => void;
-    setProjectsSearchTerm: (term: string) => void;
-    setTasksSearchTerm: (term: string) => void;
-    selectOrUnselectAnRlefResource: (resource: IData) => void;
-    breadcrumbs: Breadcrumb[];
-    setBreadcrumbs: React.Dispatch<React.SetStateAction<Breadcrumb[]>>;
-    currentScreenState: ScreenState;
-    setCurrentScreenState: React.Dispatch<React.SetStateAction<ScreenState>>;
-    selectedLocalFiles: File[];
-    setSelectedLocalFiles: React.Dispatch<React.SetStateAction<File[]>>;
-    dataSetState: IDataSetState;
-    setDataSetState: React.Dispatch<React.SetStateAction<IDataSetState>>;
-    selectedRlefResources: Array<IData>;
-    setSelectedRlefResources: React.Dispatch<React.SetStateAction<IData[]>>;
-    tempSelectedRlefResources: Array<IData>;
-    setTempSelectedRlefResources: React.Dispatch<React.SetStateAction<IData[]>>;
-    selectedSavedDataSetIds: Set<string>;
-    setSelectedSavedDataSetIds: React.Dispatch<React.SetStateAction<Set<string>>>;
-    activeRlefDataTab: TActiveRlefDataTab;
-    setActiveRlefDataTab: React.Dispatch<React.SetStateAction<TActiveRlefDataTab>>;
-}
-type Breadcrumb = {
-    label: string;
-    path?: string;
-    onClick: () => void;
-};
-export type ScreenState = "" | "dataSelectOptionsScreen" | "selectedDataListScreen" | "projectAndTaskSelectionScreen" | "rlefDataSetCollectionsScreen" | "rlefDataPointsInSelectedDataSetCollectionScreen" | "savedDataSetListScreen" | "viewSavedDataSetScreen" | "rlefHistoricalCopilotDataScreen";
-export type TActiveRlefDataTab = "collections" | "data";
-interface DataSelectedProviderProps {
-    children: ReactNode;
-}
-export declare var currentScreenStateRef: {
-    current?: ScreenState;
-};
-export declare var currentScreenStateSetterRef: {
-    current?: React.Dispatch<React.SetStateAction<ScreenState>>;
-};
-export declare const DataSelectedProvider: React.FC<DataSelectedProviderProps>;
-export declare const useSelectDataContext: () => DataSelectedContextType;
-export {};
-//# sourceMappingURL=DataSelectedContext.d.ts.map

package/dist/types/context/DataSelectedContext.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"DataSelectedContext.d.ts","sourceRoot":"","sources":["../../../src/context/DataSelectedContext.tsx"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,EAAuC,SAAS,EAAmC,MAAM,OAAO,CAAC;AAC/G,OAAO,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAC3D,OAAO,EAAE,MAAM,EAAE,MAAM,wEAAwE,CAAC;AAChG,OAAO,EAAE,QAAQ,EAAE,MAAM,0EAA0E,CAAC;AAGpG,OAAO,EAAE,WAAW,EAAE,MAAM,6EAA6E,CAAC;AAC1G,OAAO,EAAE,KAAK,EAAE,MAAM,sEAAsE,CAAC;AAG7F,MAAM,WAAW,sBAAsB;IACnC,iBAAiB,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IACnC,kBAAkB,EAAE,OAAO,CAAC;IAC5B,eAAe,EAAE,QAAQ,GAAG,IAAI,CAAC;IACjC,UAAU,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,mBAAmB;IAChC,cAAc,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9B,eAAe,EAAE,OAAO,CAAC;IACzB,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,UAAU,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,aAAa;IAC1B,iBAAiB,EAAE,WAAW,EAAE,CAAC;IACjC,kBAAkB,EAAE,OAAO,CAAC;IAC5B,eAAe,EAAE,WAAW,GAAG,IAAI,CAAC;IACpC,2BAA2B,CAAC,EAAC,MAAM,CAAA;CACtC;AAGD,UAAU,uBAAuB;IAC7B,wBAAwB,EAAE,YAAY,GAAG,IAAI,CAAC;IAC9C,2BAA2B,EAAE,CAAC,MAAM,EAAE,YAAY,KAAK,IAAI,CAAC;IAG5D,aAAa,EAAE,sBAAsB,CAAC;IACtC,UAAU,EAAE,mBAAmB,CAAC;IAChC,gBAAgB,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;IACtC,aAAa,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IACpD,UAAU,EAAE,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,KAAK,IAAI,CAAC;IAC1C,aAAa,EAAE,CAAC,OAAO,EAAE,QAAQ,GAAG,IAAI,KAAK,IAAI,CAAC;IAClD,qBAAqB,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,CAAC;IAC9C,kBAAkB,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,CAAC;IAE3C,8BAA8B,EAAE,CAAC,QAAQ,EAAE,KAAK,KAAK,IAAI,CAAC;IAC1D,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,cAAc,EAAE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IACnE,kBAAkB,EAAE,WAAW,CAAC;IAChC,qBAAqB,EAAE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC;IACzE,kBAAkB,EAAC,IAAI,EAAE,CAAC;IAC1B,qBAAqB,EAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;IAClE,YAAY,EAAE,aAAa,CAAC;IAC5B,eAAe,EAAE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,CAAC;IACrE,qBAAqB,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IACpC,wBAAwB,EAAE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACxE,yBAAyB,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IACxC,4BAA4B,EAAE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC5E,uBAAuB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACrC,0BAA0B,EAAE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC9E,iBAAiB,EAAE,kBAAkB,CAAC;IACtC,oBAAoB,EAAE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,kBAAkB,CAAC,CAAC,CAAC;CAClF;AAED,KAAK,UAAU,GAAG;IACd,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,IAAI,CAAC;CACvB,CAAA;AAGD,MAAM,MAAM,WAAW,GAAG,EAAE,GAAG,yBAAyB,GAAG,wBAAwB,GAAG,+BAA+B,GAAG,8BAA8B,GAAG,iDAAiD,GAAG,wBAAwB,GAAG,wBAAwB,GAAG,iCAAiC,CAAA;AACpS,MAAM,MAAM,kBAAkB,GAAG,aAAa,GAAG,MAAM,CAAC;AAMxD,UAAU,yBAAyB;IAC/B,QAAQ,EAAE,SAAS,CAAC;CACvB;AAED,eAAO,IAAI,qBAAqB,EAAE;IAAE,OAAO,CAAC,EAAE,WAAW,CAAA;CAAO,CAAC;AACjE,eAAO,IAAI,2BAA2B,EAAE;IAAE,OAAO,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAAA;CAAM,CAAC;AAE5G,eAAO,MAAM,oBAAoB,EAAE,KAAK,CAAC,EAAE,CAAC,yBAAyB,CA+JpE,CAAC;AAGF,eAAO,MAAM,oBAAoB,+BAMhC,CAAC"}

package/dist/types/features/BPACitationRenderer/BPACitationRenderer.d.ts

@@ -1,5 +0,0 @@
-import { CitationOrchestratorProps } from './BPACitationRenderer.types';
-export * from './BPACitationRenderer.types';
-declare const BPACitationRenderer: ({ href, children, isStreaming, onCitationToggle, chatCitationConfig, scannedDocCitationConfig, ruleBookCitationConfig, ilCitationConfig, gptCitationConfig, scannedDocCitationData, ilCitationData, chatCitationData, gptCitationData, webCitationData, imageCitationData, bqCitationData, title, citationIcon, isDualCitationFlag }: CitationOrchestratorProps) => import("react").JSX.Element | null;
-export default BPACitationRenderer;
-//# sourceMappingURL=BPACitationRenderer.d.ts.map

package/dist/types/features/BPACitationRenderer/BPACitationRenderer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"BPACitationRenderer.d.ts","sourceRoot":"","sources":["../../../../src/features/BPACitationRenderer/BPACitationRenderer.tsx"],"names":[],"mappings":"AAoBA,OAAO,EAAE,yBAAyB,EAAE,MAAM,6BAA6B,CAAC;AAExE,cAAc,6BAA6B,CAAC;AA6D5C,QAAA,MAAM,mBAAmB,yUAoBtB,yBAAyB,uCAuX3B,CAAC;AAEF,eAAe,mBAAmB,CAAC"}