@payloadcms/richtext-lexical 3.68.0-internal-debug.56c9b68 → 3.68.0-internal-debug.2eb12b9

package/dist/features/experimental_table/client/utils/debounce.js.map

@@ -1 +1 @@
-{"version":3,"file":"debounce.js","names":["FUNC_ERROR_TEXT","nativeMax","Math","max","nativeMin","min","debounce","func","wait","options","lastArgs","lastCallTime","lastInvokeTime","lastThis","leading","maxing","maxWait","result","timerID","trailing","TypeError","invokeFunc","time","args","thisArg","undefined","apply","leadingEdge","setTimeout","timerExpired","remainingWait","timeSinceLastCall","timeSinceLastInvoke","timeWaiting","shouldInvoke","Date","now","trailingEdge","cancel","clearTimeout","flush","debounced","isInvoking","arguments"],"sources":["../../../../../src/features/experimental_table/client/utils/debounce.ts"],"sourcesContent":["// eslint-disable-next-line @typescript-eslint/ban-ts-comment\n// @ts-nocheck - not worth it migrate jsdoc to tsdoc\n'use client'\n// Copied & modified from https://github.com/lodash/lodash/blob/main/src/debounce.ts\n/*\nThe MIT License\n\nCopyright JS Foundation and other contributors <https://js.foundation/>\n\nBased on Underscore.js, copyright Jeremy Ashkenas,\nDocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>\n\nThis software consists of voluntary contributions made by many\nindividuals. For exact contribution history, see the revision history\navailable at https://github.com/lodash/lodash\n\nThe following license applies to all parts of this software except as\ndocumented below:\n\n====\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\nLIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\nOF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\nWITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n====\n\nCopyright and related rights for sample code are waived via CC0. Sample\ncode is defined as all source code displayed within the prose of the\ndocumentation.\n\nCC0: http://creativecommons.org/publicdomain/zero/1.0/\n\n====\n\nFiles located in the node_modules and vendor directories are externally\nmaintained libraries used by this software which have their own\nlicenses; we recommend you read them, as their terms may differ from the\nterms above.\n */\n\n/** Error message constants. */\nconst FUNC_ERROR_TEXT = 'Expected a function'\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nconst nativeMax = Math.max,\n  nativeMin = Math.min\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [sortOnOptions={}] The options object.\n * @param {boolean} [sortOnOptions.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [sortOnOptions.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [sortOnOptions.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  let lastArgs,\n    lastCallTime,\n    lastInvokeTime = 0,\n    lastThis,\n    leading = false,\n    maxing = false,\n    maxWait,\n    result,\n    timerID,\n    trailing = true\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT)\n  }\n  wait = wait || 0\n  if (typeof options === 'object') {\n    leading = !!options.leading\n    maxing = 'maxWait' in options\n    maxWait = maxing ? nativeMax(options.maxWait || 0, wait) : maxWait\n    trailing = 'trailing' in options ? !!options.trailing : trailing\n  }\n\n  function invokeFunc(time) {\n    const args = lastArgs,\n      thisArg = lastThis\n\n    lastArgs = lastThis = undefined\n    lastInvokeTime = time\n    result = func.apply(thisArg, args)\n    return result\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time\n    // Start the timer for the trailing edge.\n    timerID = setTimeout(timerExpired, wait)\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result\n  }\n\n  function remainingWait(time) {\n    const timeSinceLastCall = time - lastCallTime,\n      timeSinceLastInvoke = time - lastInvokeTime,\n      timeWaiting = wait - timeSinceLastCall\n\n    return maxing ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke) : timeWaiting\n  }\n\n  function shouldInvoke(time) {\n    const timeSinceLastCall = time - lastCallTime,\n      timeSinceLastInvoke = time - lastInvokeTime\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (\n      lastCallTime === undefined ||\n      timeSinceLastCall >= wait ||\n      timeSinceLastCall < 0 ||\n      (maxing && timeSinceLastInvoke >= maxWait)\n    )\n  }\n\n  function timerExpired() {\n    const time = Date.now()\n    if (shouldInvoke(time)) {\n      return trailingEdge(time)\n    }\n    // Restart the timer.\n    timerID = setTimeout(timerExpired, remainingWait(time))\n  }\n\n  function trailingEdge(time) {\n    timerID = undefined\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time)\n    }\n    lastArgs = lastThis = undefined\n    return result\n  }\n\n  function cancel() {\n    if (timerID !== undefined) {\n      clearTimeout(timerID)\n    }\n    lastInvokeTime = 0\n    lastArgs = lastCallTime = lastThis = timerID = undefined\n  }\n\n  function flush() {\n    return timerID === undefined ? result : trailingEdge(Date.now())\n  }\n\n  function debounced() {\n    const time = Date.now(),\n      isInvoking = shouldInvoke(time)\n\n    // eslint-disable-next-line prefer-rest-params\n    lastArgs = arguments\n    // eslint-disable-next-line @typescript-eslint/no-this-alias\n    lastThis = this\n    lastCallTime = time\n\n    if (isInvoking) {\n      if (timerID === undefined) {\n        return leadingEdge(lastCallTime)\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        clearTimeout(timerID)\n        timerID = setTimeout(timerExpired, wait)\n        return invokeFunc(lastCallTime)\n      }\n    }\n    if (timerID === undefined) {\n      timerID = setTimeout(timerExpired, wait)\n    }\n    return result\n  }\n  debounced.cancel = cancel\n  debounced.flush = flush\n  return debounced\n}\n\n// eslint-disable-next-line no-restricted-exports\nexport default debounce\n"],"mappings":"AAAA;AACA;AACA;;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAAA,CAoDA;AACA,MAAMA,eAAA,GAAkB;AAExB;AACA,MAAMC,SAAA,GAAYC,IAAA,CAAKC,GAAG;EACxBC,SAAA,GAAYF,IAAA,CAAKG,GAAG;AAEtB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsDA,SAASC,SAASC,IAAI,EAAEC,IAAI,EAAEC,OAAO;EACnC,IAAIC,QAAA;IACFC,YAAA;IACAC,cAAA,GAAiB;IACjBC,QAAA;IACAC,OAAA,GAAU;IACVC,MAAA,GAAS;IACTC,OAAA;IACAC,MAAA;IACAC,OAAA;IACAC,QAAA,GAAW;EAEb,IAAI,OAAOZ,IAAA,IAAQ,YAAY;IAC7B,MAAM,IAAIa,SAAA,CAAUpB,eAAA;EACtB;EACAQ,IAAA,GAAOA,IAAA,IAAQ;EACf,IAAI,OAAOC,OAAA,KAAY,UAAU;IAC/BK,OAAA,GAAU,CAAC,CAACL,OAAA,CAAQK,OAAO;IAC3BC,MAAA,GAAS,aAAaN,OAAA;IACtBO,OAAA,GAAUD,MAAA,GAASd,SAAA,CAAUQ,OAAA,CAAQO,OAAO,IAAI,GAAGR,IAAA,IAAQQ,OAAA;IAC3DG,QAAA,GAAW,cAAcV,OAAA,GAAU,CAAC,CAACA,OAAA,CAAQU,QAAQ,GAAGA,QAAA;EAC1D;EAEA,SAASE,WAAWC,IAAI;IACtB,MAAMC,IAAA,GAAOb,QAAA;MACXc,OAAA,GAAUX,QAAA;IAEZH,QAAA,GAAWG,QAAA,GAAWY,SAAA;IACtBb,cAAA,GAAiBU,IAAA;IACjBL,MAAA,GAASV,IAAA,CAAKmB,KAAK,CAACF,OAAA,EAASD,IAAA;IAC7B,OAAON,MAAA;EACT;EAEA,SAASU,YAAYL,IAAI;IACvB;IACAV,cAAA,GAAiBU,IAAA;IACjB;IACAJ,OAAA,GAAUU,UAAA,CAAWC,YAAA,EAAcrB,IAAA;IACnC;IACA,OAAOM,OAAA,GAAUO,UAAA,CAAWC,IAAA,IAAQL,MAAA;EACtC;EAEA,SAASa,cAAcR,IAAI;IACzB,MAAMS,iBAAA,GAAoBT,IAAA,GAAOX,YAAA;MAC/BqB,mBAAA,GAAsBV,IAAA,GAAOV,cAAA;MAC7BqB,WAAA,GAAczB,IAAA,GAAOuB,iBAAA;IAEvB,OAAOhB,MAAA,GAASX,SAAA,CAAU6B,WAAA,EAAajB,OAAA,GAAUgB,mBAAA,IAAuBC,WAAA;EAC1E;EAEA,SAASC,aAAaZ,IAAI;IACxB,MAAMS,iBAAA,GAAoBT,IAAA,GAAOX,YAAA;MAC/BqB,mBAAA,GAAsBV,IAAA,GAAOV,cAAA;IAE/B;IACA;IACA;IACA,OACED,YAAA,KAAiBc,SAAA,IACjBM,iBAAA,IAAqBvB,IAAA,IACrBuB,iBAAA,GAAoB,KACnBhB,MAAA,IAAUiB,mBAAA,IAAuBhB,OAAA;EAEtC;EAEA,SAASa,aAAA;IACP,MAAMP,IAAA,GAAOa,IAAA,CAAKC,GAAG;IACrB,IAAIF,YAAA,CAAaZ,IAAA,GAAO;MACtB,OAAOe,YAAA,CAAaf,IAAA;IACtB;IACA;IACAJ,OAAA,GAAUU,UAAA,CAAWC,YAAA,EAAcC,aAAA,CAAcR,IAAA;EACnD;EAEA,SAASe,aAAaf,IAAI;IACxBJ,OAAA,GAAUO,SAAA;IAEV;IACA;IACA,IAAIN,QAAA,IAAYT,QAAA,EAAU;MACxB,OAAOW,UAAA,CAAWC,IAAA;IACpB;IACAZ,QAAA,GAAWG,QAAA,GAAWY,SAAA;IACtB,OAAOR,MAAA;EACT;EAEA,SAASqB,OAAA;IACP,IAAIpB,OAAA,KAAYO,SAAA,EAAW;MACzBc,YAAA,CAAarB,OAAA;IACf;IACAN,cAAA,GAAiB;IACjBF,QAAA,GAAWC,YAAA,GAAeE,QAAA,GAAWK,OAAA,GAAUO,SAAA;EACjD;EAEA,SAASe,MAAA;IACP,OAAOtB,OAAA,KAAYO,SAAA,GAAYR,MAAA,GAASoB,YAAA,CAAaF,IAAA,CAAKC,GAAG;EAC/D;EAEA,SAASK,UAAA;IACP,MAAMnB,IAAA,GAAOa,IAAA,CAAKC,GAAG;MACnBM,UAAA,GAAaR,YAAA,CAAaZ,IAAA;IAE5B;IACAZ,QAAA,GAAWiC,SAAA;IACX;IACA9B,QAAA,GAAW,IAAI;IACfF,YAAA,GAAeW,IAAA;IAEf,IAAIoB,UAAA,EAAY;MACd,IAAIxB,OAAA,KAAYO,SAAA,EAAW;QACzB,OAAOE,WAAA,CAAYhB,YAAA;MACrB;MACA,IAAII,MAAA,EAAQ;QACV;QACAwB,YAAA,CAAarB,OAAA;QACbA,OAAA,GAAUU,UAAA,CAAWC,YAAA,EAAcrB,IAAA;QACnC,OAAOa,UAAA,CAAWV,YAAA;MACpB;IACF;IACA,IAAIO,OAAA,KAAYO,SAAA,EAAW;MACzBP,OAAA,GAAUU,UAAA,CAAWC,YAAA,EAAcrB,IAAA;IACrC;IACA,OAAOS,MAAA;EACT;EACAwB,SAAA,CAAUH,MAAM,GAAGA,MAAA;EACnBG,SAAA,CAAUD,KAAK,GAAGA,KAAA;EAClB,OAAOC,SAAA;AACT;AAEA;AACA,eAAenC,QAAA","ignoreList":[]}
+{"version":3,"sources":["../../../../../src/features/experimental_table/client/utils/debounce.ts"],"sourcesContent":["// eslint-disable-next-line @typescript-eslint/ban-ts-comment\n// @ts-nocheck - not worth it migrate jsdoc to tsdoc\n'use client'\n// Copied & modified from https://github.com/lodash/lodash/blob/main/src/debounce.ts\n/*\nThe MIT License\n\nCopyright JS Foundation and other contributors <https://js.foundation/>\n\nBased on Underscore.js, copyright Jeremy Ashkenas,\nDocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>\n\nThis software consists of voluntary contributions made by many\nindividuals. For exact contribution history, see the revision history\navailable at https://github.com/lodash/lodash\n\nThe following license applies to all parts of this software except as\ndocumented below:\n\n====\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\nLIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\nOF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\nWITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n====\n\nCopyright and related rights for sample code are waived via CC0. Sample\ncode is defined as all source code displayed within the prose of the\ndocumentation.\n\nCC0: http://creativecommons.org/publicdomain/zero/1.0/\n\n====\n\nFiles located in the node_modules and vendor directories are externally\nmaintained libraries used by this software which have their own\nlicenses; we recommend you read them, as their terms may differ from the\nterms above.\n */\n\n/** Error message constants. */\nconst FUNC_ERROR_TEXT = 'Expected a function'\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nconst nativeMax = Math.max,\n  nativeMin = Math.min\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [sortOnOptions={}] The options object.\n * @param {boolean} [sortOnOptions.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [sortOnOptions.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [sortOnOptions.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  let lastArgs,\n    lastCallTime,\n    lastInvokeTime = 0,\n    lastThis,\n    leading = false,\n    maxing = false,\n    maxWait,\n    result,\n    timerID,\n    trailing = true\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT)\n  }\n  wait = wait || 0\n  if (typeof options === 'object') {\n    leading = !!options.leading\n    maxing = 'maxWait' in options\n    maxWait = maxing ? nativeMax(options.maxWait || 0, wait) : maxWait\n    trailing = 'trailing' in options ? !!options.trailing : trailing\n  }\n\n  function invokeFunc(time) {\n    const args = lastArgs,\n      thisArg = lastThis\n\n    lastArgs = lastThis = undefined\n    lastInvokeTime = time\n    result = func.apply(thisArg, args)\n    return result\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time\n    // Start the timer for the trailing edge.\n    timerID = setTimeout(timerExpired, wait)\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result\n  }\n\n  function remainingWait(time) {\n    const timeSinceLastCall = time - lastCallTime,\n      timeSinceLastInvoke = time - lastInvokeTime,\n      timeWaiting = wait - timeSinceLastCall\n\n    return maxing ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke) : timeWaiting\n  }\n\n  function shouldInvoke(time) {\n    const timeSinceLastCall = time - lastCallTime,\n      timeSinceLastInvoke = time - lastInvokeTime\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (\n      lastCallTime === undefined ||\n      timeSinceLastCall >= wait ||\n      timeSinceLastCall < 0 ||\n      (maxing && timeSinceLastInvoke >= maxWait)\n    )\n  }\n\n  function timerExpired() {\n    const time = Date.now()\n    if (shouldInvoke(time)) {\n      return trailingEdge(time)\n    }\n    // Restart the timer.\n    timerID = setTimeout(timerExpired, remainingWait(time))\n  }\n\n  function trailingEdge(time) {\n    timerID = undefined\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time)\n    }\n    lastArgs = lastThis = undefined\n    return result\n  }\n\n  function cancel() {\n    if (timerID !== undefined) {\n      clearTimeout(timerID)\n    }\n    lastInvokeTime = 0\n    lastArgs = lastCallTime = lastThis = timerID = undefined\n  }\n\n  function flush() {\n    return timerID === undefined ? result : trailingEdge(Date.now())\n  }\n\n  function debounced() {\n    const time = Date.now(),\n      isInvoking = shouldInvoke(time)\n\n    // eslint-disable-next-line prefer-rest-params\n    lastArgs = arguments\n    // eslint-disable-next-line @typescript-eslint/no-this-alias\n    lastThis = this\n    lastCallTime = time\n\n    if (isInvoking) {\n      if (timerID === undefined) {\n        return leadingEdge(lastCallTime)\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        clearTimeout(timerID)\n        timerID = setTimeout(timerExpired, wait)\n        return invokeFunc(lastCallTime)\n      }\n    }\n    if (timerID === undefined) {\n      timerID = setTimeout(timerExpired, wait)\n    }\n    return result\n  }\n  debounced.cancel = cancel\n  debounced.flush = flush\n  return debounced\n}\n\n// eslint-disable-next-line no-restricted-exports\nexport default debounce\n"],"names":["FUNC_ERROR_TEXT","nativeMax","Math","max","nativeMin","min","debounce","func","wait","options","lastArgs","lastCallTime","lastInvokeTime","lastThis","leading","maxing","maxWait","result","timerID","trailing","TypeError","invokeFunc","time","args","thisArg","undefined","apply","leadingEdge","setTimeout","timerExpired","remainingWait","timeSinceLastCall","timeSinceLastInvoke","timeWaiting","shouldInvoke","Date","now","trailingEdge","cancel","clearTimeout","flush","debounced","isInvoking","arguments"],"mappings":"AAAA,6DAA6D;AAC7D,oDAAoD;AACpD;AACA,oFAAoF;AACpF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAkDC,GAED,6BAA6B,GAC7B,MAAMA,kBAAkB;AAExB,sFAAsF,GACtF,MAAMC,YAAYC,KAAKC,GAAG,EACxBC,YAAYF,KAAKG,GAAG;AAEtB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAqDC,GACD,SAASC,SAASC,IAAI,EAAEC,IAAI,EAAEC,OAAO;IACnC,IAAIC,UACFC,cACAC,iBAAiB,GACjBC,UACAC,UAAU,OACVC,SAAS,OACTC,SACAC,QACAC,SACAC,WAAW;IAEb,IAAI,OAAOZ,QAAQ,YAAY;QAC7B,MAAM,IAAIa,UAAUpB;IACtB;IACAQ,OAAOA,QAAQ;IACf,IAAI,OAAOC,YAAY,UAAU;QAC/BK,UAAU,CAAC,CAACL,QAAQK,OAAO;QAC3BC,SAAS,aAAaN;QACtBO,UAAUD,SAASd,UAAUQ,QAAQO,OAAO,IAAI,GAAGR,QAAQQ;QAC3DG,WAAW,cAAcV,UAAU,CAAC,CAACA,QAAQU,QAAQ,GAAGA;IAC1D;IAEA,SAASE,WAAWC,IAAI;QACtB,MAAMC,OAAOb,UACXc,UAAUX;QAEZH,WAAWG,WAAWY;QACtBb,iBAAiBU;QACjBL,SAASV,KAAKmB,KAAK,CAACF,SAASD;QAC7B,OAAON;IACT;IAEA,SAASU,YAAYL,IAAI;QACvB,6BAA6B;QAC7BV,iBAAiBU;QACjB,yCAAyC;QACzCJ,UAAUU,WAAWC,cAAcrB;QACnC,2BAA2B;QAC3B,OAAOM,UAAUO,WAAWC,QAAQL;IACtC;IAEA,SAASa,cAAcR,IAAI;QACzB,MAAMS,oBAAoBT,OAAOX,cAC/BqB,sBAAsBV,OAAOV,gBAC7BqB,cAAczB,OAAOuB;QAEvB,OAAOhB,SAASX,UAAU6B,aAAajB,UAAUgB,uBAAuBC;IAC1E;IAEA,SAASC,aAAaZ,IAAI;QACxB,MAAMS,oBAAoBT,OAAOX,cAC/BqB,sBAAsBV,OAAOV;QAE/B,uEAAuE;QACvE,uEAAuE;QACvE,6DAA6D;QAC7D,OACED,iBAAiBc,aACjBM,qBAAqBvB,QACrBuB,oBAAoB,KACnBhB,UAAUiB,uBAAuBhB;IAEtC;IAEA,SAASa;QACP,MAAMP,OAAOa,KAAKC,GAAG;QACrB,IAAIF,aAAaZ,OAAO;YACtB,OAAOe,aAAaf;QACtB;QACA,qBAAqB;QACrBJ,UAAUU,WAAWC,cAAcC,cAAcR;IACnD;IAEA,SAASe,aAAaf,IAAI;QACxBJ,UAAUO;QAEV,gEAAgE;QAChE,2BAA2B;QAC3B,IAAIN,YAAYT,UAAU;YACxB,OAAOW,WAAWC;QACpB;QACAZ,WAAWG,WAAWY;QACtB,OAAOR;IACT;IAEA,SAASqB;QACP,IAAIpB,YAAYO,WAAW;YACzBc,aAAarB;QACf;QACAN,iBAAiB;QACjBF,WAAWC,eAAeE,WAAWK,UAAUO;IACjD;IAEA,SAASe;QACP,OAAOtB,YAAYO,YAAYR,SAASoB,aAAaF,KAAKC,GAAG;IAC/D;IAEA,SAASK;QACP,MAAMnB,OAAOa,KAAKC,GAAG,IACnBM,aAAaR,aAAaZ;QAE5B,8CAA8C;QAC9CZ,WAAWiC;QACX,4DAA4D;QAC5D9B,WAAW,IAAI;QACfF,eAAeW;QAEf,IAAIoB,YAAY;YACd,IAAIxB,YAAYO,WAAW;gBACzB,OAAOE,YAAYhB;YACrB;YACA,IAAII,QAAQ;gBACV,sCAAsC;gBACtCwB,aAAarB;gBACbA,UAAUU,WAAWC,cAAcrB;gBACnC,OAAOa,WAAWV;YACpB;QACF;QACA,IAAIO,YAAYO,WAAW;YACzBP,UAAUU,WAAWC,cAAcrB;QACrC;QACA,OAAOS;IACT;IACAwB,UAAUH,MAAM,GAAGA;IACnBG,UAAUD,KAAK,GAAGA;IAClB,OAAOC;AACT;AAEA,iDAAiD;AACjD,eAAenC,SAAQ"}

package/dist/features/experimental_table/client/utils/useDebounce.js

@@ -1,46 +1,28 @@
 'use client';
-
-import { c as _c } from "react/compiler-runtime";
 import { useCallback, useEffect, useRef } from 'react';
 import debounce from './debounce.js';
+// Define the type for debounced function that includes cancel method
 export function useDebounce(fn, ms, maxWait) {
-  const $ = _c(6);
-  const debouncedRef = useRef(null);
-  let t0;
-  let t1;
-  if ($[0] !== fn || $[1] !== maxWait || $[2] !== ms) {
-    t0 = () => {
-      debouncedRef.current = debounce(fn, ms, {
+    // Update the ref type to include cancel method
+    const debouncedRef = useRef(null);
+    useEffect(()=>{
+        debouncedRef.current = debounce(fn, ms, {
+            maxWait
+        });
+        return ()=>{
+            debouncedRef.current?.cancel();
+        };
+    }, [
+        fn,
+        ms,
         maxWait
-      });
-      return () => {
-        debouncedRef.current?.cancel();
-      };
-    };
-    t1 = [fn, ms, maxWait];
-    $[0] = fn;
-    $[1] = maxWait;
-    $[2] = ms;
-    $[3] = t0;
-    $[4] = t1;
-  } else {
-    t0 = $[3];
-    t1 = $[4];
-  }
-  useEffect(t0, t1);
-  let t2;
-  if ($[5] === Symbol.for("react.memo_cache_sentinel")) {
-    t2 = (...t3) => {
-      const args = t3;
-      if (debouncedRef.current) {
-        debouncedRef.current(...args);
-      }
-    };
-    $[5] = t2;
-  } else {
-    t2 = $[5];
-  }
-  const callback = t2;
-  return callback;
+    ]);
+    const callback = useCallback((...args)=>{
+        if (debouncedRef.current) {
+            debouncedRef.current(...args);
+        }
+    }, []);
+    return callback;
 }
+
 //# sourceMappingURL=useDebounce.js.map

package/dist/features/experimental_table/client/utils/useDebounce.js.map

@@ -1 +1 @@
-{"version":3,"file":"useDebounce.js","names":["c","_c","useCallback","useEffect","useRef","debounce","useDebounce","fn","ms","maxWait","$","debouncedRef","t0","t1","current","cancel","t2","Symbol","for","t3","args","callback"],"sources":["../../../../../src/features/experimental_table/client/utils/useDebounce.ts"],"sourcesContent":["'use client'\nimport { useCallback, useEffect, useRef } from 'react'\n\nimport debounce from './debounce.js'\n\n// Define the type for debounced function that includes cancel method\ninterface DebouncedFunction<T extends (...args: any[]) => any> {\n  (...args: Parameters<T>): ReturnType<T>\n  cancel: () => void\n}\n\nexport function useDebounce<T extends (...args: never[]) => void>(\n  fn: T,\n  ms: number,\n  maxWait?: number,\n) {\n  // Update the ref type to include cancel method\n  const debouncedRef = useRef<DebouncedFunction<T> | null>(null)\n\n  useEffect(() => {\n    debouncedRef.current = debounce(fn, ms, { maxWait }) as DebouncedFunction<T>\n\n    return () => {\n      debouncedRef.current?.cancel()\n    }\n  }, [fn, ms, maxWait])\n\n  const callback = useCallback((...args: Parameters<T>) => {\n    if (debouncedRef.current) {\n      debouncedRef.current(...args)\n    }\n  }, [])\n\n  return callback\n}\n"],"mappings":"AAAA;;AAAA,SAAAA,CAAA,IAAAC,EAAA;AACA,SAASC,WAAW,EAAEC,SAAS,EAAEC,MAAM,QAAQ;AAE/C,OAAOC,QAAA,MAAc;AAQrB,OAAO,SAAAC,YAAAC,EAAA,EAAAC,EAAA,EAAAC,OAAA;EAAA,MAAAC,CAAA,GAAAT,EAAA;EAML,MAAAU,YAAA,GAAqBP,MAAA,KAAoC;EAAA,IAAAQ,EAAA;EAAA,IAAAC,EAAA;EAAA,IAAAH,CAAA,QAAAH,EAAA,IAAAG,CAAA,QAAAD,OAAA,IAAAC,CAAA,QAAAF,EAAA;IAE/CI,EAAA,GAAAA,CAAA;MACRD,YAAA,CAAAG,OAAA,GAAuBT,QAAA,CAASE,EAAA,EAAIC,EAAA;QAAAC;MAAA,CAAc;MAAA;QAGhDE,YAAA,CAAAG,OAAA,EAAAC,MAAA;MAAA;IAAA;IAEDF,EAAA,IAACN,EAAA,EAAIC,EAAA,EAAIC,OAAA;IAAQC,CAAA,MAAAH,EAAA;IAAAG,CAAA,MAAAD,OAAA;IAAAC,CAAA,MAAAF,EAAA;IAAAE,CAAA,MAAAE,EAAA;IAAAF,CAAA,MAAAG,EAAA;EAAA;IAAAD,EAAA,GAAAF,CAAA;IAAAG,EAAA,GAAAH,CAAA;EAAA;EANpBP,SAAA,CAAUS,EAMV,EAAGC,EAAiB;EAAA,IAAAG,EAAA;EAAA,IAAAN,CAAA,QAAAO,MAAA,CAAAC,GAAA;IAESF,EAAA,GAAAA,CAAA,GAAAG,EAAA;MAAC,MAAAC,IAAA,GAAAD,EAAG;MAAA,IAC3BR,YAAA,CAAAG,OAAA;QACFH,YAAA,CAAAG,OAAA,IAAwBM,IAAA;MAAA;IAAA;IAE5BV,CAAA,MAAAM,EAAA;EAAA;IAAAA,EAAA,GAAAN,CAAA;EAAA;EAJA,MAAAW,QAAA,GAAiBL,EAIZ;EAAA,OAEEK,QAAA;AAAA","ignoreList":[]}
+{"version":3,"sources":["../../../../../src/features/experimental_table/client/utils/useDebounce.ts"],"sourcesContent":["'use client'\nimport { useCallback, useEffect, useRef } from 'react'\n\nimport debounce from './debounce.js'\n\n// Define the type for debounced function that includes cancel method\ninterface DebouncedFunction<T extends (...args: any[]) => any> {\n  (...args: Parameters<T>): ReturnType<T>\n  cancel: () => void\n}\n\nexport function useDebounce<T extends (...args: never[]) => void>(\n  fn: T,\n  ms: number,\n  maxWait?: number,\n) {\n  // Update the ref type to include cancel method\n  const debouncedRef = useRef<DebouncedFunction<T> | null>(null)\n\n  useEffect(() => {\n    debouncedRef.current = debounce(fn, ms, { maxWait }) as DebouncedFunction<T>\n\n    return () => {\n      debouncedRef.current?.cancel()\n    }\n  }, [fn, ms, maxWait])\n\n  const callback = useCallback((...args: Parameters<T>) => {\n    if (debouncedRef.current) {\n      debouncedRef.current(...args)\n    }\n  }, [])\n\n  return callback\n}\n"],"names":["useCallback","useEffect","useRef","debounce","useDebounce","fn","ms","maxWait","debouncedRef","current","cancel","callback","args"],"mappings":"AAAA;AACA,SAASA,WAAW,EAAEC,SAAS,EAAEC,MAAM,QAAQ,QAAO;AAEtD,OAAOC,cAAc,gBAAe;AAEpC,qEAAqE;AAMrE,OAAO,SAASC,YACdC,EAAK,EACLC,EAAU,EACVC,OAAgB;IAEhB,+CAA+C;IAC/C,MAAMC,eAAeN,OAAoC;IAEzDD,UAAU;QACRO,aAAaC,OAAO,GAAGN,SAASE,IAAIC,IAAI;YAAEC;QAAQ;QAElD,OAAO;YACLC,aAAaC,OAAO,EAAEC;QACxB;IACF,GAAG;QAACL;QAAIC;QAAIC;KAAQ;IAEpB,MAAMI,WAAWX,YAAY,CAAC,GAAGY;QAC/B,IAAIJ,aAAaC,OAAO,EAAE;YACxBD,aAAaC,OAAO,IAAIG;QAC1B;IACF,GAAG,EAAE;IAEL,OAAOD;AACT"}

package/dist/features/experimental_table/markdownTransformer.js

@@ -5,127 +5,132 @@ import { $convertFromMarkdownString, $convertToMarkdownString } from '../../pack
 const TABLE_ROW_REG_EXP = /^\|(.+)\|\s?$/;
 // eslint-disable-next-line regexp/no-unused-capturing-group
 const TABLE_ROW_DIVIDER_REG_EXP = /^(\| ?:?-*:? ?)+\|\s?$/;
-export const TableMarkdownTransformer = ({
-  allTransformers
-}) => ({
-  type: 'element',
-  dependencies: [TableNode, TableRowNode, TableCellNode],
-  export: node => {
-    if (!$isTableNode(node)) {
-      return null;
-    }
-    const output = [];
-    for (const row of node.getChildren()) {
-      const rowOutput = [];
-      if (!$isTableRowNode(row)) {
-        continue;
-      }
-      let isHeaderRow = false;
-      for (const cell of row.getChildren()) {
-        // It's TableCellNode, so it's just to make flow happy
-        if ($isTableCellNode(cell)) {
-          rowOutput.push($convertToMarkdownString(allTransformers, cell).replace(/\n/g, '\\n').trim());
-          if (cell.__headerState === TableCellHeaderStates.ROW) {
-            isHeaderRow = true;
-          }
+export const TableMarkdownTransformer = ({ allTransformers })=>({
+        type: 'element',
+        dependencies: [
+            TableNode,
+            TableRowNode,
+            TableCellNode
+        ],
+        export: (node)=>{
+            if (!$isTableNode(node)) {
+                return null;
+            }
+            const output = [];
+            for (const row of node.getChildren()){
+                const rowOutput = [];
+                if (!$isTableRowNode(row)) {
+                    continue;
+                }
+                let isHeaderRow = false;
+                for (const cell of row.getChildren()){
+                    // It's TableCellNode, so it's just to make flow happy
+                    if ($isTableCellNode(cell)) {
+                        rowOutput.push($convertToMarkdownString(allTransformers, cell).replace(/\n/g, '\\n').trim());
+                        if (cell.__headerState === TableCellHeaderStates.ROW) {
+                            isHeaderRow = true;
+                        }
+                    }
+                }
+                output.push(`| ${rowOutput.join(' | ')} |`);
+                if (isHeaderRow) {
+                    output.push(`| ${rowOutput.map((_)=>'---').join(' | ')} |`);
+                }
+            }
+            return output.join('\n');
+        },
+        regExp: TABLE_ROW_REG_EXP,
+        replace: (parentNode, _1, match)=>{
+            const match0 = match[0];
+            if (!match0) {
+                return;
+            }
+            // Header row
+            if (TABLE_ROW_DIVIDER_REG_EXP.test(match0)) {
+                const table = parentNode.getPreviousSibling();
+                if (!table || !$isTableNode(table)) {
+                    return;
+                }
+                const rows = table.getChildren();
+                const lastRow = rows[rows.length - 1];
+                if (!lastRow || !$isTableRowNode(lastRow)) {
+                    return;
+                }
+                // Add header state to row cells
+                lastRow.getChildren().forEach((cell)=>{
+                    if (!$isTableCellNode(cell)) {
+                        return;
+                    }
+                    cell.setHeaderStyles(TableCellHeaderStates.ROW, TableCellHeaderStates.ROW);
+                });
+                // Remove line
+                parentNode.remove();
+                return;
+            }
+            const matchCells = mapToTableCells(match0, allTransformers);
+            if (matchCells == null) {
+                return;
+            }
+            const rows = [
+                matchCells
+            ];
+            let sibling = parentNode.getPreviousSibling();
+            let maxCells = matchCells.length;
+            while(sibling){
+                if (!$isParagraphNode(sibling)) {
+                    break;
+                }
+                if (sibling.getChildrenSize() !== 1) {
+                    break;
+                }
+                const firstChild = sibling.getFirstChild();
+                if (!$isTextNode(firstChild)) {
+                    break;
+                }
+                const cells = mapToTableCells(firstChild.getTextContent(), allTransformers);
+                if (cells == null) {
+                    break;
+                }
+                maxCells = Math.max(maxCells, cells.length);
+                rows.unshift(cells);
+                const previousSibling = sibling.getPreviousSibling();
+                sibling.remove();
+                sibling = previousSibling;
+            }
+            const table = $createTableNode();
+            for (const cells of rows){
+                const tableRow = $createTableRowNode();
+                table.append(tableRow);
+                for(let i = 0; i < maxCells; i++){
+                    tableRow.append(i < cells.length ? cells[i] : $createTableCell('', allTransformers));
+                }
+            }
+            const previousSibling = parentNode.getPreviousSibling();
+            if ($isTableNode(previousSibling) && getTableColumnsSize(previousSibling) === maxCells) {
+                previousSibling.append(...table.getChildren());
+                parentNode.remove();
+            } else {
+                parentNode.replace(table);
+            }
+            table.selectEnd();
         }
-      }
-      output.push(`| ${rowOutput.join(' | ')} |`);
-      if (isHeaderRow) {
-        output.push(`| ${rowOutput.map(_ => '---').join(' | ')} |`);
-      }
-    }
-    return output.join('\n');
-  },
-  regExp: TABLE_ROW_REG_EXP,
-  replace: (parentNode, _1, match) => {
-    const match0 = match[0];
-    if (!match0) {
-      return;
-    }
-    // Header row
-    if (TABLE_ROW_DIVIDER_REG_EXP.test(match0)) {
-      const table = parentNode.getPreviousSibling();
-      if (!table || !$isTableNode(table)) {
-        return;
-      }
-      const rows = table.getChildren();
-      const lastRow = rows[rows.length - 1];
-      if (!lastRow || !$isTableRowNode(lastRow)) {
-        return;
-      }
-      // Add header state to row cells
-      lastRow.getChildren().forEach(cell => {
-        if (!$isTableCellNode(cell)) {
-          return;
-        }
-        cell.setHeaderStyles(TableCellHeaderStates.ROW, TableCellHeaderStates.ROW);
-      });
-      // Remove line
-      parentNode.remove();
-      return;
-    }
-    const matchCells = mapToTableCells(match0, allTransformers);
-    if (matchCells == null) {
-      return;
-    }
-    const rows = [matchCells];
-    let sibling = parentNode.getPreviousSibling();
-    let maxCells = matchCells.length;
-    while (sibling) {
-      if (!$isParagraphNode(sibling)) {
-        break;
-      }
-      if (sibling.getChildrenSize() !== 1) {
-        break;
-      }
-      const firstChild = sibling.getFirstChild();
-      if (!$isTextNode(firstChild)) {
-        break;
-      }
-      const cells = mapToTableCells(firstChild.getTextContent(), allTransformers);
-      if (cells == null) {
-        break;
-      }
-      maxCells = Math.max(maxCells, cells.length);
-      rows.unshift(cells);
-      const previousSibling = sibling.getPreviousSibling();
-      sibling.remove();
-      sibling = previousSibling;
-    }
-    const table = $createTableNode();
-    for (const cells of rows) {
-      const tableRow = $createTableRowNode();
-      table.append(tableRow);
-      for (let i = 0; i < maxCells; i++) {
-        tableRow.append(i < cells.length ? cells[i] : $createTableCell('', allTransformers));
-      }
-    }
-    const previousSibling = parentNode.getPreviousSibling();
-    if ($isTableNode(previousSibling) && getTableColumnsSize(previousSibling) === maxCells) {
-      previousSibling.append(...table.getChildren());
-      parentNode.remove();
-    } else {
-      parentNode.replace(table);
-    }
-    table.selectEnd();
-  }
-});
+    });
 function getTableColumnsSize(table) {
-  const row = table.getFirstChild();
-  return $isTableRowNode(row) ? row.getChildrenSize() : 0;
+    const row = table.getFirstChild();
+    return $isTableRowNode(row) ? row.getChildrenSize() : 0;
 }
-const $createTableCell = (textContent, allTransformers) => {
-  textContent = textContent.replace(/\\n/g, '\n');
-  const cell = $createTableCellNode(TableCellHeaderStates.NO_STATUS);
-  $convertFromMarkdownString(textContent, allTransformers, cell);
-  return cell;
+const $createTableCell = (textContent, allTransformers)=>{
+    textContent = textContent.replace(/\\n/g, '\n');
+    const cell = $createTableCellNode(TableCellHeaderStates.NO_STATUS);
+    $convertFromMarkdownString(textContent, allTransformers, cell);
+    return cell;
 };
-const mapToTableCells = (textContent, allTransformers) => {
-  const match = textContent.match(TABLE_ROW_REG_EXP);
-  if (!match || !match[1]) {
-    return null;
-  }
-  return match[1].split('|').map(text => $createTableCell(text, allTransformers));
+const mapToTableCells = (textContent, allTransformers)=>{
+    const match = textContent.match(TABLE_ROW_REG_EXP);
+    if (!match || !match[1]) {
+        return null;
+    }
+    return match[1].split('|').map((text)=>$createTableCell(text, allTransformers));
 };
+
 //# sourceMappingURL=markdownTransformer.js.map

package/dist/features/experimental_table/markdownTransformer.js.map

@@ -1 +1 @@
-{"version":3,"file":"markdownTransformer.js","names":["$createTableCellNode","$createTableNode","$createTableRowNode","$isTableCellNode","$isTableNode","$isTableRowNode","TableCellHeaderStates","TableCellNode","TableNode","TableRowNode","$isParagraphNode","$isTextNode","$convertFromMarkdownString","$convertToMarkdownString","TABLE_ROW_REG_EXP","TABLE_ROW_DIVIDER_REG_EXP","TableMarkdownTransformer","allTransformers","type","dependencies","export","node","output","row","getChildren","rowOutput","isHeaderRow","cell","push","replace","trim","__headerState","ROW","join","map","_","regExp","parentNode","_1","match","match0","test","table","getPreviousSibling","rows","lastRow","length","forEach","setHeaderStyles","remove","matchCells","mapToTableCells","sibling","maxCells","getChildrenSize","firstChild","getFirstChild","cells","getTextContent","Math","max","unshift","previousSibling","tableRow","append","i","$createTableCell","getTableColumnsSize","selectEnd","textContent","NO_STATUS","split","text"],"sources":["../../../src/features/experimental_table/markdownTransformer.ts"],"sourcesContent":["import type { LexicalNode } from 'lexical'\n\nimport {\n  $createTableCellNode,\n  $createTableNode,\n  $createTableRowNode,\n  $isTableCellNode,\n  $isTableNode,\n  $isTableRowNode,\n  TableCellHeaderStates,\n  TableCellNode,\n  TableNode,\n  TableRowNode,\n} from '@lexical/table'\nimport { $isParagraphNode, $isTextNode } from 'lexical'\n\nimport {\n  $convertFromMarkdownString,\n  $convertToMarkdownString,\n  type ElementTransformer,\n  type Transformer,\n} from '../../packages/@lexical/markdown/index.js'\n\n// Very primitive table setup\nconst TABLE_ROW_REG_EXP = /^\\|(.+)\\|\\s?$/\n// eslint-disable-next-line regexp/no-unused-capturing-group\nconst TABLE_ROW_DIVIDER_REG_EXP = /^(\\| ?:?-*:? ?)+\\|\\s?$/\n\nexport const TableMarkdownTransformer: (props: {\n  allTransformers: Transformer[]\n}) => ElementTransformer = ({ allTransformers }) => ({\n  type: 'element',\n  dependencies: [TableNode, TableRowNode, TableCellNode],\n  export: (node: LexicalNode) => {\n    if (!$isTableNode(node)) {\n      return null\n    }\n\n    const output: string[] = []\n\n    for (const row of node.getChildren()) {\n      const rowOutput: string[] = []\n      if (!$isTableRowNode(row)) {\n        continue\n      }\n\n      let isHeaderRow = false\n      for (const cell of row.getChildren()) {\n        // It's TableCellNode, so it's just to make flow happy\n        if ($isTableCellNode(cell)) {\n          rowOutput.push(\n            $convertToMarkdownString(allTransformers, cell).replace(/\\n/g, '\\\\n').trim(),\n          )\n\n          if (cell.__headerState === TableCellHeaderStates.ROW) {\n            isHeaderRow = true\n          }\n        }\n      }\n\n      output.push(`| ${rowOutput.join(' | ')} |`)\n      if (isHeaderRow) {\n        output.push(`| ${rowOutput.map((_) => '---').join(' | ')} |`)\n      }\n    }\n\n    return output.join('\\n')\n  },\n  regExp: TABLE_ROW_REG_EXP,\n  replace: (parentNode, _1, match) => {\n    const match0 = match[0]\n    if (!match0) {\n      return\n    }\n    // Header row\n    if (TABLE_ROW_DIVIDER_REG_EXP.test(match0)) {\n      const table = parentNode.getPreviousSibling()\n      if (!table || !$isTableNode(table)) {\n        return\n      }\n\n      const rows = table.getChildren()\n      const lastRow = rows[rows.length - 1]\n      if (!lastRow || !$isTableRowNode(lastRow)) {\n        return\n      }\n\n      // Add header state to row cells\n      lastRow.getChildren().forEach((cell) => {\n        if (!$isTableCellNode(cell)) {\n          return\n        }\n        cell.setHeaderStyles(TableCellHeaderStates.ROW, TableCellHeaderStates.ROW)\n      })\n\n      // Remove line\n      parentNode.remove()\n      return\n    }\n\n    const matchCells = mapToTableCells(match0, allTransformers)\n\n    if (matchCells == null) {\n      return\n    }\n\n    const rows = [matchCells]\n    let sibling = parentNode.getPreviousSibling()\n    let maxCells = matchCells.length\n\n    while (sibling) {\n      if (!$isParagraphNode(sibling)) {\n        break\n      }\n\n      if (sibling.getChildrenSize() !== 1) {\n        break\n      }\n\n      const firstChild = sibling.getFirstChild()\n\n      if (!$isTextNode(firstChild)) {\n        break\n      }\n\n      const cells = mapToTableCells(firstChild.getTextContent(), allTransformers)\n\n      if (cells == null) {\n        break\n      }\n\n      maxCells = Math.max(maxCells, cells.length)\n      rows.unshift(cells)\n      const previousSibling = sibling.getPreviousSibling()\n      sibling.remove()\n      sibling = previousSibling\n    }\n\n    const table = $createTableNode()\n\n    for (const cells of rows) {\n      const tableRow = $createTableRowNode()\n      table.append(tableRow)\n\n      for (let i = 0; i < maxCells; i++) {\n        tableRow.append(i < cells.length ? cells[i]! : $createTableCell('', allTransformers))\n      }\n    }\n\n    const previousSibling = parentNode.getPreviousSibling()\n    if ($isTableNode(previousSibling) && getTableColumnsSize(previousSibling) === maxCells) {\n      previousSibling.append(...table.getChildren())\n      parentNode.remove()\n    } else {\n      parentNode.replace(table)\n    }\n\n    table.selectEnd()\n  },\n})\n\nfunction getTableColumnsSize(table: TableNode) {\n  const row = table.getFirstChild()\n  return $isTableRowNode(row) ? row.getChildrenSize() : 0\n}\n\nconst $createTableCell = (textContent: string, allTransformers: Transformer[]): TableCellNode => {\n  textContent = textContent.replace(/\\\\n/g, '\\n')\n  const cell = $createTableCellNode(TableCellHeaderStates.NO_STATUS)\n  $convertFromMarkdownString(textContent, allTransformers, cell)\n  return cell\n}\n\nconst mapToTableCells = (\n  textContent: string,\n  allTransformers: Transformer[],\n): Array<TableCellNode> | null => {\n  const match = textContent.match(TABLE_ROW_REG_EXP)\n  if (!match || !match[1]) {\n    return null\n  }\n  return match[1].split('|').map((text) => $createTableCell(text, allTransformers))\n}\n"],"mappings":"AAEA,SACEA,oBAAoB,EACpBC,gBAAgB,EAChBC,mBAAmB,EACnBC,gBAAgB,EAChBC,YAAY,EACZC,eAAe,EACfC,qBAAqB,EACrBC,aAAa,EACbC,SAAS,EACTC,YAAY,QACP;AACP,SAASC,gBAAgB,EAAEC,WAAW,QAAQ;AAE9C,SACEC,0BAA0B,EAC1BC,wBAAwB,QAGnB;AAEP;AACA,MAAMC,iBAAA,GAAoB;AAC1B;AACA,MAAMC,yBAAA,GAA4B;AAElC,OAAO,MAAMC,wBAAA,GAEcA,CAAC;EAAEC;AAAe,CAAE,MAAM;EACnDC,IAAA,EAAM;EACNC,YAAA,EAAc,CAACX,SAAA,EAAWC,YAAA,EAAcF,aAAA,CAAc;EACtDa,MAAA,EAASC,IAAA;IACP,IAAI,CAACjB,YAAA,CAAaiB,IAAA,GAAO;MACvB,OAAO;IACT;IAEA,MAAMC,MAAA,GAAmB,EAAE;IAE3B,KAAK,MAAMC,GAAA,IAAOF,IAAA,CAAKG,WAAW,IAAI;MACpC,MAAMC,SAAA,GAAsB,EAAE;MAC9B,IAAI,CAACpB,eAAA,CAAgBkB,GAAA,GAAM;QACzB;MACF;MAEA,IAAIG,WAAA,GAAc;MAClB,KAAK,MAAMC,IAAA,IAAQJ,GAAA,CAAIC,WAAW,IAAI;QACpC;QACA,IAAIrB,gBAAA,CAAiBwB,IAAA,GAAO;UAC1BF,SAAA,CAAUG,IAAI,CACZf,wBAAA,CAAyBI,eAAA,EAAiBU,IAAA,EAAME,OAAO,CAAC,OAAO,OAAOC,IAAI;UAG5E,IAAIH,IAAA,CAAKI,aAAa,KAAKzB,qBAAA,CAAsB0B,GAAG,EAAE;YACpDN,WAAA,GAAc;UAChB;QACF;MACF;MAEAJ,MAAA,CAAOM,IAAI,CAAC,KAAKH,SAAA,CAAUQ,IAAI,CAAC,UAAU;MAC1C,IAAIP,WAAA,EAAa;QACfJ,MAAA,CAAOM,IAAI,CAAC,KAAKH,SAAA,CAAUS,GAAG,CAAEC,CAAA,IAAM,OAAOF,IAAI,CAAC,UAAU;MAC9D;IACF;IAEA,OAAOX,MAAA,CAAOW,IAAI,CAAC;EACrB;EACAG,MAAA,EAAQtB,iBAAA;EACRe,OAAA,EAASA,CAACQ,UAAA,EAAYC,EAAA,EAAIC,KAAA;IACxB,MAAMC,MAAA,GAASD,KAAK,CAAC,EAAE;IACvB,IAAI,CAACC,MAAA,EAAQ;MACX;IACF;IACA;IACA,IAAIzB,yBAAA,CAA0B0B,IAAI,CAACD,MAAA,GAAS;MAC1C,MAAME,KAAA,GAAQL,UAAA,CAAWM,kBAAkB;MAC3C,IAAI,CAACD,KAAA,IAAS,CAACtC,YAAA,CAAasC,KAAA,GAAQ;QAClC;MACF;MAEA,MAAME,IAAA,GAAOF,KAAA,CAAMlB,WAAW;MAC9B,MAAMqB,OAAA,GAAUD,IAAI,CAACA,IAAA,CAAKE,MAAM,GAAG,EAAE;MACrC,IAAI,CAACD,OAAA,IAAW,CAACxC,eAAA,CAAgBwC,OAAA,GAAU;QACzC;MACF;MAEA;MACAA,OAAA,CAAQrB,WAAW,GAAGuB,OAAO,CAAEpB,IAAA;QAC7B,IAAI,CAACxB,gBAAA,CAAiBwB,IAAA,GAAO;UAC3B;QACF;QACAA,IAAA,CAAKqB,eAAe,CAAC1C,qBAAA,CAAsB0B,GAAG,EAAE1B,qBAAA,CAAsB0B,GAAG;MAC3E;MAEA;MACAK,UAAA,CAAWY,MAAM;MACjB;IACF;IAEA,MAAMC,UAAA,GAAaC,eAAA,CAAgBX,MAAA,EAAQvB,eAAA;IAE3C,IAAIiC,UAAA,IAAc,MAAM;MACtB;IACF;IAEA,MAAMN,IAAA,GAAO,CAACM,UAAA,CAAW;IACzB,IAAIE,OAAA,GAAUf,UAAA,CAAWM,kBAAkB;IAC3C,IAAIU,QAAA,GAAWH,UAAA,CAAWJ,MAAM;IAEhC,OAAOM,OAAA,EAAS;MACd,IAAI,CAAC1C,gBAAA,CAAiB0C,OAAA,GAAU;QAC9B;MACF;MAEA,IAAIA,OAAA,CAAQE,eAAe,OAAO,GAAG;QACnC;MACF;MAEA,MAAMC,UAAA,GAAaH,OAAA,CAAQI,aAAa;MAExC,IAAI,CAAC7C,WAAA,CAAY4C,UAAA,GAAa;QAC5B;MACF;MAEA,MAAME,KAAA,GAAQN,eAAA,CAAgBI,UAAA,CAAWG,cAAc,IAAIzC,eAAA;MAE3D,IAAIwC,KAAA,IAAS,MAAM;QACjB;MACF;MAEAJ,QAAA,GAAWM,IAAA,CAAKC,GAAG,CAACP,QAAA,EAAUI,KAAA,CAAMX,MAAM;MAC1CF,IAAA,CAAKiB,OAAO,CAACJ,KAAA;MACb,MAAMK,eAAA,GAAkBV,OAAA,CAAQT,kBAAkB;MAClDS,OAAA,CAAQH,MAAM;MACdG,OAAA,GAAUU,eAAA;IACZ;IAEA,MAAMpB,KAAA,GAAQzC,gBAAA;IAEd,KAAK,MAAMwD,KAAA,IAASb,IAAA,EAAM;MACxB,MAAMmB,QAAA,GAAW7D,mBAAA;MACjBwC,KAAA,CAAMsB,MAAM,CAACD,QAAA;MAEb,KAAK,IAAIE,CAAA,GAAI,GAAGA,CAAA,GAAIZ,QAAA,EAAUY,CAAA,IAAK;QACjCF,QAAA,CAASC,MAAM,CAACC,CAAA,GAAIR,KAAA,CAAMX,MAAM,GAAGW,KAAK,CAACQ,CAAA,CAAE,GAAIC,gBAAA,CAAiB,IAAIjD,eAAA;MACtE;IACF;IAEA,MAAM6C,eAAA,GAAkBzB,UAAA,CAAWM,kBAAkB;IACrD,IAAIvC,YAAA,CAAa0D,eAAA,KAAoBK,mBAAA,CAAoBL,eAAA,MAAqBT,QAAA,EAAU;MACtFS,eAAA,CAAgBE,MAAM,IAAItB,KAAA,CAAMlB,WAAW;MAC3Ca,UAAA,CAAWY,MAAM;IACnB,OAAO;MACLZ,UAAA,CAAWR,OAAO,CAACa,KAAA;IACrB;IAEAA,KAAA,CAAM0B,SAAS;EACjB;AACF;AAEA,SAASD,oBAAoBzB,KAAgB;EAC3C,MAAMnB,GAAA,GAAMmB,KAAA,CAAMc,aAAa;EAC/B,OAAOnD,eAAA,CAAgBkB,GAAA,IAAOA,GAAA,CAAI+B,eAAe,KAAK;AACxD;AAEA,MAAMY,gBAAA,GAAmBA,CAACG,WAAA,EAAqBpD,eAAA;EAC7CoD,WAAA,GAAcA,WAAA,CAAYxC,OAAO,CAAC,QAAQ;EAC1C,MAAMF,IAAA,GAAO3B,oBAAA,CAAqBM,qBAAA,CAAsBgE,SAAS;EACjE1D,0BAAA,CAA2ByD,WAAA,EAAapD,eAAA,EAAiBU,IAAA;EACzD,OAAOA,IAAA;AACT;AAEA,MAAMwB,eAAA,GAAkBA,CACtBkB,WAAA,EACApD,eAAA;EAEA,MAAMsB,KAAA,GAAQ8B,WAAA,CAAY9B,KAAK,CAACzB,iBAAA;EAChC,IAAI,CAACyB,KAAA,IAAS,CAACA,KAAK,CAAC,EAAE,EAAE;IACvB,OAAO;EACT;EACA,OAAOA,KAAK,CAAC,EAAE,CAACgC,KAAK,CAAC,KAAKrC,GAAG,CAAEsC,IAAA,IAASN,gBAAA,CAAiBM,IAAA,EAAMvD,eAAA;AAClE","ignoreList":[]}
+{"version":3,"sources":["../../../src/features/experimental_table/markdownTransformer.ts"],"sourcesContent":["import type { LexicalNode } from 'lexical'\n\nimport {\n  $createTableCellNode,\n  $createTableNode,\n  $createTableRowNode,\n  $isTableCellNode,\n  $isTableNode,\n  $isTableRowNode,\n  TableCellHeaderStates,\n  TableCellNode,\n  TableNode,\n  TableRowNode,\n} from '@lexical/table'\nimport { $isParagraphNode, $isTextNode } from 'lexical'\n\nimport {\n  $convertFromMarkdownString,\n  $convertToMarkdownString,\n  type ElementTransformer,\n  type Transformer,\n} from '../../packages/@lexical/markdown/index.js'\n\n// Very primitive table setup\nconst TABLE_ROW_REG_EXP = /^\\|(.+)\\|\\s?$/\n// eslint-disable-next-line regexp/no-unused-capturing-group\nconst TABLE_ROW_DIVIDER_REG_EXP = /^(\\| ?:?-*:? ?)+\\|\\s?$/\n\nexport const TableMarkdownTransformer: (props: {\n  allTransformers: Transformer[]\n}) => ElementTransformer = ({ allTransformers }) => ({\n  type: 'element',\n  dependencies: [TableNode, TableRowNode, TableCellNode],\n  export: (node: LexicalNode) => {\n    if (!$isTableNode(node)) {\n      return null\n    }\n\n    const output: string[] = []\n\n    for (const row of node.getChildren()) {\n      const rowOutput: string[] = []\n      if (!$isTableRowNode(row)) {\n        continue\n      }\n\n      let isHeaderRow = false\n      for (const cell of row.getChildren()) {\n        // It's TableCellNode, so it's just to make flow happy\n        if ($isTableCellNode(cell)) {\n          rowOutput.push(\n            $convertToMarkdownString(allTransformers, cell).replace(/\\n/g, '\\\\n').trim(),\n          )\n\n          if (cell.__headerState === TableCellHeaderStates.ROW) {\n            isHeaderRow = true\n          }\n        }\n      }\n\n      output.push(`| ${rowOutput.join(' | ')} |`)\n      if (isHeaderRow) {\n        output.push(`| ${rowOutput.map((_) => '---').join(' | ')} |`)\n      }\n    }\n\n    return output.join('\\n')\n  },\n  regExp: TABLE_ROW_REG_EXP,\n  replace: (parentNode, _1, match) => {\n    const match0 = match[0]\n    if (!match0) {\n      return\n    }\n    // Header row\n    if (TABLE_ROW_DIVIDER_REG_EXP.test(match0)) {\n      const table = parentNode.getPreviousSibling()\n      if (!table || !$isTableNode(table)) {\n        return\n      }\n\n      const rows = table.getChildren()\n      const lastRow = rows[rows.length - 1]\n      if (!lastRow || !$isTableRowNode(lastRow)) {\n        return\n      }\n\n      // Add header state to row cells\n      lastRow.getChildren().forEach((cell) => {\n        if (!$isTableCellNode(cell)) {\n          return\n        }\n        cell.setHeaderStyles(TableCellHeaderStates.ROW, TableCellHeaderStates.ROW)\n      })\n\n      // Remove line\n      parentNode.remove()\n      return\n    }\n\n    const matchCells = mapToTableCells(match0, allTransformers)\n\n    if (matchCells == null) {\n      return\n    }\n\n    const rows = [matchCells]\n    let sibling = parentNode.getPreviousSibling()\n    let maxCells = matchCells.length\n\n    while (sibling) {\n      if (!$isParagraphNode(sibling)) {\n        break\n      }\n\n      if (sibling.getChildrenSize() !== 1) {\n        break\n      }\n\n      const firstChild = sibling.getFirstChild()\n\n      if (!$isTextNode(firstChild)) {\n        break\n      }\n\n      const cells = mapToTableCells(firstChild.getTextContent(), allTransformers)\n\n      if (cells == null) {\n        break\n      }\n\n      maxCells = Math.max(maxCells, cells.length)\n      rows.unshift(cells)\n      const previousSibling = sibling.getPreviousSibling()\n      sibling.remove()\n      sibling = previousSibling\n    }\n\n    const table = $createTableNode()\n\n    for (const cells of rows) {\n      const tableRow = $createTableRowNode()\n      table.append(tableRow)\n\n      for (let i = 0; i < maxCells; i++) {\n        tableRow.append(i < cells.length ? cells[i]! : $createTableCell('', allTransformers))\n      }\n    }\n\n    const previousSibling = parentNode.getPreviousSibling()\n    if ($isTableNode(previousSibling) && getTableColumnsSize(previousSibling) === maxCells) {\n      previousSibling.append(...table.getChildren())\n      parentNode.remove()\n    } else {\n      parentNode.replace(table)\n    }\n\n    table.selectEnd()\n  },\n})\n\nfunction getTableColumnsSize(table: TableNode) {\n  const row = table.getFirstChild()\n  return $isTableRowNode(row) ? row.getChildrenSize() : 0\n}\n\nconst $createTableCell = (textContent: string, allTransformers: Transformer[]): TableCellNode => {\n  textContent = textContent.replace(/\\\\n/g, '\\n')\n  const cell = $createTableCellNode(TableCellHeaderStates.NO_STATUS)\n  $convertFromMarkdownString(textContent, allTransformers, cell)\n  return cell\n}\n\nconst mapToTableCells = (\n  textContent: string,\n  allTransformers: Transformer[],\n): Array<TableCellNode> | null => {\n  const match = textContent.match(TABLE_ROW_REG_EXP)\n  if (!match || !match[1]) {\n    return null\n  }\n  return match[1].split('|').map((text) => $createTableCell(text, allTransformers))\n}\n"],"names":["$createTableCellNode","$createTableNode","$createTableRowNode","$isTableCellNode","$isTableNode","$isTableRowNode","TableCellHeaderStates","TableCellNode","TableNode","TableRowNode","$isParagraphNode","$isTextNode","$convertFromMarkdownString","$convertToMarkdownString","TABLE_ROW_REG_EXP","TABLE_ROW_DIVIDER_REG_EXP","TableMarkdownTransformer","allTransformers","type","dependencies","export","node","output","row","getChildren","rowOutput","isHeaderRow","cell","push","replace","trim","__headerState","ROW","join","map","_","regExp","parentNode","_1","match","match0","test","table","getPreviousSibling","rows","lastRow","length","forEach","setHeaderStyles","remove","matchCells","mapToTableCells","sibling","maxCells","getChildrenSize","firstChild","getFirstChild","cells","getTextContent","Math","max","unshift","previousSibling","tableRow","append","i","$createTableCell","getTableColumnsSize","selectEnd","textContent","NO_STATUS","split","text"],"mappings":"AAEA,SACEA,oBAAoB,EACpBC,gBAAgB,EAChBC,mBAAmB,EACnBC,gBAAgB,EAChBC,YAAY,EACZC,eAAe,EACfC,qBAAqB,EACrBC,aAAa,EACbC,SAAS,EACTC,YAAY,QACP,iBAAgB;AACvB,SAASC,gBAAgB,EAAEC,WAAW,QAAQ,UAAS;AAEvD,SACEC,0BAA0B,EAC1BC,wBAAwB,QAGnB,4CAA2C;AAElD,6BAA6B;AAC7B,MAAMC,oBAAoB;AAC1B,4DAA4D;AAC5D,MAAMC,4BAA4B;AAElC,OAAO,MAAMC,2BAEc,CAAC,EAAEC,eAAe,EAAE,GAAM,CAAA;QACnDC,MAAM;QACNC,cAAc;YAACX;YAAWC;YAAcF;SAAc;QACtDa,QAAQ,CAACC;YACP,IAAI,CAACjB,aAAaiB,OAAO;gBACvB,OAAO;YACT;YAEA,MAAMC,SAAmB,EAAE;YAE3B,KAAK,MAAMC,OAAOF,KAAKG,WAAW,GAAI;gBACpC,MAAMC,YAAsB,EAAE;gBAC9B,IAAI,CAACpB,gBAAgBkB,MAAM;oBACzB;gBACF;gBAEA,IAAIG,cAAc;gBAClB,KAAK,MAAMC,QAAQJ,IAAIC,WAAW,GAAI;oBACpC,sDAAsD;oBACtD,IAAIrB,iBAAiBwB,OAAO;wBAC1BF,UAAUG,IAAI,CACZf,yBAAyBI,iBAAiBU,MAAME,OAAO,CAAC,OAAO,OAAOC,IAAI;wBAG5E,IAAIH,KAAKI,aAAa,KAAKzB,sBAAsB0B,GAAG,EAAE;4BACpDN,cAAc;wBAChB;oBACF;gBACF;gBAEAJ,OAAOM,IAAI,CAAC,CAAC,EAAE,EAAEH,UAAUQ,IAAI,CAAC,OAAO,EAAE,CAAC;gBAC1C,IAAIP,aAAa;oBACfJ,OAAOM,IAAI,CAAC,CAAC,EAAE,EAAEH,UAAUS,GAAG,CAAC,CAACC,IAAM,OAAOF,IAAI,CAAC,OAAO,EAAE,CAAC;gBAC9D;YACF;YAEA,OAAOX,OAAOW,IAAI,CAAC;QACrB;QACAG,QAAQtB;QACRe,SAAS,CAACQ,YAAYC,IAAIC;YACxB,MAAMC,SAASD,KAAK,CAAC,EAAE;YACvB,IAAI,CAACC,QAAQ;gBACX;YACF;YACA,aAAa;YACb,IAAIzB,0BAA0B0B,IAAI,CAACD,SAAS;gBAC1C,MAAME,QAAQL,WAAWM,kBAAkB;gBAC3C,IAAI,CAACD,SAAS,CAACtC,aAAasC,QAAQ;oBAClC;gBACF;gBAEA,MAAME,OAAOF,MAAMlB,WAAW;gBAC9B,MAAMqB,UAAUD,IAAI,CAACA,KAAKE,MAAM,GAAG,EAAE;gBACrC,IAAI,CAACD,WAAW,CAACxC,gBAAgBwC,UAAU;oBACzC;gBACF;gBAEA,gCAAgC;gBAChCA,QAAQrB,WAAW,GAAGuB,OAAO,CAAC,CAACpB;oBAC7B,IAAI,CAACxB,iBAAiBwB,OAAO;wBAC3B;oBACF;oBACAA,KAAKqB,eAAe,CAAC1C,sBAAsB0B,GAAG,EAAE1B,sBAAsB0B,GAAG;gBAC3E;gBAEA,cAAc;gBACdK,WAAWY,MAAM;gBACjB;YACF;YAEA,MAAMC,aAAaC,gBAAgBX,QAAQvB;YAE3C,IAAIiC,cAAc,MAAM;gBACtB;YACF;YAEA,MAAMN,OAAO;gBAACM;aAAW;YACzB,IAAIE,UAAUf,WAAWM,kBAAkB;YAC3C,IAAIU,WAAWH,WAAWJ,MAAM;YAEhC,MAAOM,QAAS;gBACd,IAAI,CAAC1C,iBAAiB0C,UAAU;oBAC9B;gBACF;gBAEA,IAAIA,QAAQE,eAAe,OAAO,GAAG;oBACnC;gBACF;gBAEA,MAAMC,aAAaH,QAAQI,aAAa;gBAExC,IAAI,CAAC7C,YAAY4C,aAAa;oBAC5B;gBACF;gBAEA,MAAME,QAAQN,gBAAgBI,WAAWG,cAAc,IAAIzC;gBAE3D,IAAIwC,SAAS,MAAM;oBACjB;gBACF;gBAEAJ,WAAWM,KAAKC,GAAG,CAACP,UAAUI,MAAMX,MAAM;gBAC1CF,KAAKiB,OAAO,CAACJ;gBACb,MAAMK,kBAAkBV,QAAQT,kBAAkB;gBAClDS,QAAQH,MAAM;gBACdG,UAAUU;YACZ;YAEA,MAAMpB,QAAQzC;YAEd,KAAK,MAAMwD,SAASb,KAAM;gBACxB,MAAMmB,WAAW7D;gBACjBwC,MAAMsB,MAAM,CAACD;gBAEb,IAAK,IAAIE,IAAI,GAAGA,IAAIZ,UAAUY,IAAK;oBACjCF,SAASC,MAAM,CAACC,IAAIR,MAAMX,MAAM,GAAGW,KAAK,CAACQ,EAAE,GAAIC,iBAAiB,IAAIjD;gBACtE;YACF;YAEA,MAAM6C,kBAAkBzB,WAAWM,kBAAkB;YACrD,IAAIvC,aAAa0D,oBAAoBK,oBAAoBL,qBAAqBT,UAAU;gBACtFS,gBAAgBE,MAAM,IAAItB,MAAMlB,WAAW;gBAC3Ca,WAAWY,MAAM;YACnB,OAAO;gBACLZ,WAAWR,OAAO,CAACa;YACrB;YAEAA,MAAM0B,SAAS;QACjB;IACF,CAAA,EAAE;AAEF,SAASD,oBAAoBzB,KAAgB;IAC3C,MAAMnB,MAAMmB,MAAMc,aAAa;IAC/B,OAAOnD,gBAAgBkB,OAAOA,IAAI+B,eAAe,KAAK;AACxD;AAEA,MAAMY,mBAAmB,CAACG,aAAqBpD;IAC7CoD,cAAcA,YAAYxC,OAAO,CAAC,QAAQ;IAC1C,MAAMF,OAAO3B,qBAAqBM,sBAAsBgE,SAAS;IACjE1D,2BAA2ByD,aAAapD,iBAAiBU;IACzD,OAAOA;AACT;AAEA,MAAMwB,kBAAkB,CACtBkB,aACApD;IAEA,MAAMsB,QAAQ8B,YAAY9B,KAAK,CAACzB;IAChC,IAAI,CAACyB,SAAS,CAACA,KAAK,CAAC,EAAE,EAAE;QACvB,OAAO;IACT;IACA,OAAOA,KAAK,CAAC,EAAE,CAACgC,KAAK,CAAC,KAAKrC,GAAG,CAAC,CAACsC,OAASN,iBAAiBM,MAAMvD;AAClE"}