{"ast":null,"code":"/* eslint-disable */\n// @ts-nocheck\nvar LIMIT_REPLACE_NODE = \"[...]\";\nvar CIRCULAR_REPLACE_NODE = {\n  result: \"[Circular]\"\n};\nvar arr = [];\nvar replacerStack = [];\nfunction defaultOptions() {\n  return {\n    depthLimit: Number.MAX_SAFE_INTEGER,\n    edgesLimit: Number.MAX_SAFE_INTEGER\n  };\n}\n// Regular stringify\nexport function stringify(obj, replacer, spacer, options) {\n  try {\n    return JSON.stringify(obj, replacer, spacer);\n  } catch (e) {\n    var _e$message;\n    // Fall back to more complex stringify if circular reference\n    if (!((_e$message = e.message) !== null && _e$message !== void 0 && _e$message.includes(\"Converting circular structure to JSON\"))) {\n      console.warn(\"[WARNING]: LangSmith received unserializable value.\");\n      return \"[Unserializable]\";\n    }\n    console.warn(\"[WARNING]: LangSmith received circular JSON. This will decrease tracer performance.\");\n    if (typeof options === \"undefined\") {\n      options = defaultOptions();\n    }\n    decirc(obj, \"\", 0, [], undefined, 0, options);\n    var res;\n    try {\n      if (replacerStack.length === 0) {\n        res = JSON.stringify(obj, replacer, spacer);\n      } else {\n        res = JSON.stringify(obj, replaceGetterValues(replacer), spacer);\n      }\n    } catch (_) {\n      return JSON.stringify(\"[unable to serialize, circular reference is too complex to analyze]\");\n    } finally {\n      while (arr.length !== 0) {\n        var part = arr.pop();\n        if (part.length === 4) {\n          Object.defineProperty(part[0], part[1], part[3]);\n        } else {\n          part[0][part[1]] = part[2];\n        }\n      }\n    }\n    return res;\n  }\n}\nfunction setReplace(replace, val, k, parent) {\n  var propertyDescriptor = Object.getOwnPropertyDescriptor(parent, k);\n  if (propertyDescriptor.get !== undefined) {\n    if (propertyDescriptor.configurable) {\n      Object.defineProperty(parent, k, {\n        value: replace\n      });\n      arr.push([parent, k, val, propertyDescriptor]);\n    } else {\n      replacerStack.push([val, k, replace]);\n    }\n  } else {\n    parent[k] = replace;\n    arr.push([parent, k, val]);\n  }\n}\nfunction decirc(val, k, edgeIndex, stack, parent, depth, options) {\n  depth += 1;\n  var i;\n  if (typeof val === \"object\" && val !== null) {\n    for (i = 0; i < stack.length; i++) {\n      if (stack[i] === val) {\n        setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);\n        return;\n      }\n    }\n    if (typeof options.depthLimit !== \"undefined\" && depth > options.depthLimit) {\n      setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n      return;\n    }\n    if (typeof options.edgesLimit !== \"undefined\" && edgeIndex + 1 > options.edgesLimit) {\n      setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n      return;\n    }\n    stack.push(val);\n    // Optimize for Arrays. Big arrays could kill the performance otherwise!\n    if (Array.isArray(val)) {\n      for (i = 0; i < val.length; i++) {\n        decirc(val[i], i, i, stack, val, depth, options);\n      }\n    } else {\n      var keys = Object.keys(val);\n      for (i = 0; i < keys.length; i++) {\n        var key = keys[i];\n        decirc(val[key], key, i, stack, val, depth, options);\n      }\n    }\n    stack.pop();\n  }\n}\n// Stable-stringify\nfunction compareFunction(a, b) {\n  if (a < b) {\n    return -1;\n  }\n  if (a > b) {\n    return 1;\n  }\n  return 0;\n}\nfunction deterministicStringify(obj, replacer, spacer, options) {\n  if (typeof options === \"undefined\") {\n    options = defaultOptions();\n  }\n  var tmp = deterministicDecirc(obj, \"\", 0, [], undefined, 0, options) || obj;\n  var res;\n  try {\n    if (replacerStack.length === 0) {\n      res = JSON.stringify(tmp, replacer, spacer);\n    } else {\n      res = JSON.stringify(tmp, replaceGetterValues(replacer), spacer);\n    }\n  } catch (_) {\n    return JSON.stringify(\"[unable to serialize, circular reference is too complex to analyze]\");\n  } finally {\n    // Ensure that we restore the object as it was.\n    while (arr.length !== 0) {\n      var part = arr.pop();\n      if (part.length === 4) {\n        Object.defineProperty(part[0], part[1], part[3]);\n      } else {\n        part[0][part[1]] = part[2];\n      }\n    }\n  }\n  return res;\n}\nfunction deterministicDecirc(val, k, edgeIndex, stack, parent, depth, options) {\n  depth += 1;\n  var i;\n  if (typeof val === \"object\" && val !== null) {\n    for (i = 0; i < stack.length; i++) {\n      if (stack[i] === val) {\n        setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);\n        return;\n      }\n    }\n    try {\n      if (typeof val.toJSON === \"function\") {\n        return;\n      }\n    } catch (_) {\n      return;\n    }\n    if (typeof options.depthLimit !== \"undefined\" && depth > options.depthLimit) {\n      setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n      return;\n    }\n    if (typeof options.edgesLimit !== \"undefined\" && edgeIndex + 1 > options.edgesLimit) {\n      setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n      return;\n    }\n    stack.push(val);\n    // Optimize for Arrays. Big arrays could kill the performance otherwise!\n    if (Array.isArray(val)) {\n      for (i = 0; i < val.length; i++) {\n        deterministicDecirc(val[i], i, i, stack, val, depth, options);\n      }\n    } else {\n      // Create a temporary object in the required way\n      var tmp = {};\n      var keys = Object.keys(val).sort(compareFunction);\n      for (i = 0; i < keys.length; i++) {\n        var key = keys[i];\n        deterministicDecirc(val[key], key, i, stack, val, depth, options);\n        tmp[key] = val[key];\n      }\n      if (typeof parent !== \"undefined\") {\n        arr.push([parent, k, val]);\n        parent[k] = tmp;\n      } else {\n        return tmp;\n      }\n    }\n    stack.pop();\n  }\n}\n// wraps replacer function to handle values we couldn't replace\n// and mark them as replaced value\nfunction replaceGetterValues(replacer) {\n  replacer = typeof replacer !== \"undefined\" ? replacer : function (k, v) {\n    return v;\n  };\n  return function (key, val) {\n    if (replacerStack.length > 0) {\n      for (var i = 0; i < replacerStack.length; i++) {\n        var part = replacerStack[i];\n        if (part[1] === key && part[0] === val) {\n          val = part[2];\n          replacerStack.splice(i, 1);\n          break;\n        }\n      }\n    }\n    return replacer.call(this, key, val);\n  };\n}","map":{"version":3,"names":["LIMIT_REPLACE_NODE","CIRCULAR_REPLACE_NODE","result","arr","replacerStack","defaultOptions","depthLimit","Number","MAX_SAFE_INTEGER","edgesLimit","stringify","obj","replacer","spacer","options","JSON","e","_e$message","message","includes","console","warn","decirc","undefined","res","length","replaceGetterValues","_","part","pop","Object","defineProperty","setReplace","replace","val","k","parent","propertyDescriptor","getOwnPropertyDescriptor","get","configurable","value","push","edgeIndex","stack","depth","i","Array","isArray","keys","key","compareFunction","a","b","deterministicStringify","tmp","deterministicDecirc","toJSON","sort","v","splice","call"],"sources":["F:/workspace/202226701027/huinongbao-app/node_modules/langsmith/dist/utils/fast-safe-stringify/index.js"],"sourcesContent":["/* eslint-disable */\n// @ts-nocheck\nvar LIMIT_REPLACE_NODE = \"[...]\";\nvar CIRCULAR_REPLACE_NODE = { result: \"[Circular]\" };\nvar arr = [];\nvar replacerStack = [];\nfunction defaultOptions() {\n    return {\n        depthLimit: Number.MAX_SAFE_INTEGER,\n        edgesLimit: Number.MAX_SAFE_INTEGER,\n    };\n}\n// Regular stringify\nexport function stringify(obj, replacer, spacer, options) {\n    try {\n        return JSON.stringify(obj, replacer, spacer);\n    }\n    catch (e) {\n        // Fall back to more complex stringify if circular reference\n        if (!e.message?.includes(\"Converting circular structure to JSON\")) {\n            console.warn(\"[WARNING]: LangSmith received unserializable value.\");\n            return \"[Unserializable]\";\n        }\n        console.warn(\"[WARNING]: LangSmith received circular JSON. This will decrease tracer performance.\");\n        if (typeof options === \"undefined\") {\n            options = defaultOptions();\n        }\n        decirc(obj, \"\", 0, [], undefined, 0, options);\n        var res;\n        try {\n            if (replacerStack.length === 0) {\n                res = JSON.stringify(obj, replacer, spacer);\n            }\n            else {\n                res = JSON.stringify(obj, replaceGetterValues(replacer), spacer);\n            }\n        }\n        catch (_) {\n            return JSON.stringify(\"[unable to serialize, circular reference is too complex to analyze]\");\n        }\n        finally {\n            while (arr.length !== 0) {\n                var part = arr.pop();\n                if (part.length === 4) {\n                    Object.defineProperty(part[0], part[1], part[3]);\n                }\n                else {\n                    part[0][part[1]] = part[2];\n                }\n            }\n        }\n        return res;\n    }\n}\nfunction setReplace(replace, val, k, parent) {\n    var propertyDescriptor = Object.getOwnPropertyDescriptor(parent, k);\n    if (propertyDescriptor.get !== undefined) {\n        if (propertyDescriptor.configurable) {\n            Object.defineProperty(parent, k, { value: replace });\n            arr.push([parent, k, val, propertyDescriptor]);\n        }\n        else {\n            replacerStack.push([val, k, replace]);\n        }\n    }\n    else {\n        parent[k] = replace;\n        arr.push([parent, k, val]);\n    }\n}\nfunction decirc(val, k, edgeIndex, stack, parent, depth, options) {\n    depth += 1;\n    var i;\n    if (typeof val === \"object\" && val !== null) {\n        for (i = 0; i < stack.length; i++) {\n            if (stack[i] === val) {\n                setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);\n                return;\n            }\n        }\n        if (typeof options.depthLimit !== \"undefined\" &&\n            depth > options.depthLimit) {\n            setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n            return;\n        }\n        if (typeof options.edgesLimit !== \"undefined\" &&\n            edgeIndex + 1 > options.edgesLimit) {\n            setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n            return;\n        }\n        stack.push(val);\n        // Optimize for Arrays. Big arrays could kill the performance otherwise!\n        if (Array.isArray(val)) {\n            for (i = 0; i < val.length; i++) {\n                decirc(val[i], i, i, stack, val, depth, options);\n            }\n        }\n        else {\n            var keys = Object.keys(val);\n            for (i = 0; i < keys.length; i++) {\n                var key = keys[i];\n                decirc(val[key], key, i, stack, val, depth, options);\n            }\n        }\n        stack.pop();\n    }\n}\n// Stable-stringify\nfunction compareFunction(a, b) {\n    if (a < b) {\n        return -1;\n    }\n    if (a > b) {\n        return 1;\n    }\n    return 0;\n}\nfunction deterministicStringify(obj, replacer, spacer, options) {\n    if (typeof options === \"undefined\") {\n        options = defaultOptions();\n    }\n    var tmp = deterministicDecirc(obj, \"\", 0, [], undefined, 0, options) || obj;\n    var res;\n    try {\n        if (replacerStack.length === 0) {\n            res = JSON.stringify(tmp, replacer, spacer);\n        }\n        else {\n            res = JSON.stringify(tmp, replaceGetterValues(replacer), spacer);\n        }\n    }\n    catch (_) {\n        return JSON.stringify(\"[unable to serialize, circular reference is too complex to analyze]\");\n    }\n    finally {\n        // Ensure that we restore the object as it was.\n        while (arr.length !== 0) {\n            var part = arr.pop();\n            if (part.length === 4) {\n                Object.defineProperty(part[0], part[1], part[3]);\n            }\n            else {\n                part[0][part[1]] = part[2];\n            }\n        }\n    }\n    return res;\n}\nfunction deterministicDecirc(val, k, edgeIndex, stack, parent, depth, options) {\n    depth += 1;\n    var i;\n    if (typeof val === \"object\" && val !== null) {\n        for (i = 0; i < stack.length; i++) {\n            if (stack[i] === val) {\n                setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);\n                return;\n            }\n        }\n        try {\n            if (typeof val.toJSON === \"function\") {\n                return;\n            }\n        }\n        catch (_) {\n            return;\n        }\n        if (typeof options.depthLimit !== \"undefined\" &&\n            depth > options.depthLimit) {\n            setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n            return;\n        }\n        if (typeof options.edgesLimit !== \"undefined\" &&\n            edgeIndex + 1 > options.edgesLimit) {\n            setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n            return;\n        }\n        stack.push(val);\n        // Optimize for Arrays. Big arrays could kill the performance otherwise!\n        if (Array.isArray(val)) {\n            for (i = 0; i < val.length; i++) {\n                deterministicDecirc(val[i], i, i, stack, val, depth, options);\n            }\n        }\n        else {\n            // Create a temporary object in the required way\n            var tmp = {};\n            var keys = Object.keys(val).sort(compareFunction);\n            for (i = 0; i < keys.length; i++) {\n                var key = keys[i];\n                deterministicDecirc(val[key], key, i, stack, val, depth, options);\n                tmp[key] = val[key];\n            }\n            if (typeof parent !== \"undefined\") {\n                arr.push([parent, k, val]);\n                parent[k] = tmp;\n            }\n            else {\n                return tmp;\n            }\n        }\n        stack.pop();\n    }\n}\n// wraps replacer function to handle values we couldn't replace\n// and mark them as replaced value\nfunction replaceGetterValues(replacer) {\n    replacer =\n        typeof replacer !== \"undefined\"\n            ? replacer\n            : function (k, v) {\n                return v;\n            };\n    return function (key, val) {\n        if (replacerStack.length > 0) {\n            for (var i = 0; i < replacerStack.length; i++) {\n                var part = replacerStack[i];\n                if (part[1] === key && part[0] === val) {\n                    val = part[2];\n                    replacerStack.splice(i, 1);\n                    break;\n                }\n            }\n        }\n        return replacer.call(this, key, val);\n    };\n}\n"],"mappings":"AAAA;AACA;AACA,IAAIA,kBAAkB,GAAG,OAAO;AAChC,IAAIC,qBAAqB,GAAG;EAAEC,MAAM,EAAE;AAAa,CAAC;AACpD,IAAIC,GAAG,GAAG,EAAE;AACZ,IAAIC,aAAa,GAAG,EAAE;AACtB,SAASC,cAAcA,CAAA,EAAG;EACtB,OAAO;IACHC,UAAU,EAAEC,MAAM,CAACC,gBAAgB;IACnCC,UAAU,EAAEF,MAAM,CAACC;EACvB,CAAC;AACL;AACA;AACA,OAAO,SAASE,SAASA,CAACC,GAAG,EAAEC,QAAQ,EAAEC,MAAM,EAAEC,OAAO,EAAE;EACtD,IAAI;IACA,OAAOC,IAAI,CAACL,SAAS,CAACC,GAAG,EAAEC,QAAQ,EAAEC,MAAM,CAAC;EAChD,CAAC,CACD,OAAOG,CAAC,EAAE;IAAA,IAAAC,UAAA;IACN;IACA,IAAI,GAAAA,UAAA,GAACD,CAAC,CAACE,OAAO,cAAAD,UAAA,eAATA,UAAA,CAAWE,QAAQ,CAAC,uCAAuC,CAAC,GAAE;MAC/DC,OAAO,CAACC,IAAI,CAAC,qDAAqD,CAAC;MACnE,OAAO,kBAAkB;IAC7B;IACAD,OAAO,CAACC,IAAI,CAAC,qFAAqF,CAAC;IACnG,IAAI,OAAOP,OAAO,KAAK,WAAW,EAAE;MAChCA,OAAO,GAAGT,cAAc,CAAC,CAAC;IAC9B;IACAiB,MAAM,CAACX,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAEY,SAAS,EAAE,CAAC,EAAET,OAAO,CAAC;IAC7C,IAAIU,GAAG;IACP,IAAI;MACA,IAAIpB,aAAa,CAACqB,MAAM,KAAK,CAAC,EAAE;QAC5BD,GAAG,GAAGT,IAAI,CAACL,SAAS,CAACC,GAAG,EAAEC,QAAQ,EAAEC,MAAM,CAAC;MAC/C,CAAC,MACI;QACDW,GAAG,GAAGT,IAAI,CAACL,SAAS,CAACC,GAAG,EAAEe,mBAAmB,CAACd,QAAQ,CAAC,EAAEC,MAAM,CAAC;MACpE;IACJ,CAAC,CACD,OAAOc,CAAC,EAAE;MACN,OAAOZ,IAAI,CAACL,SAAS,CAAC,qEAAqE,CAAC;IAChG,CAAC,SACO;MACJ,OAAOP,GAAG,CAACsB,MAAM,KAAK,CAAC,EAAE;QACrB,IAAIG,IAAI,GAAGzB,GAAG,CAAC0B,GAAG,CAAC,CAAC;QACpB,IAAID,IAAI,CAACH,MAAM,KAAK,CAAC,EAAE;UACnBK,MAAM,CAACC,cAAc,CAACH,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC,MACI;UACDA,IAAI,CAAC,CAAC,CAAC,CAACA,IAAI,CAAC,CAAC,CAAC,CAAC,GAAGA,IAAI,CAAC,CAAC,CAAC;QAC9B;MACJ;IACJ;IACA,OAAOJ,GAAG;EACd;AACJ;AACA,SAASQ,UAAUA,CAACC,OAAO,EAAEC,GAAG,EAAEC,CAAC,EAAEC,MAAM,EAAE;EACzC,IAAIC,kBAAkB,GAAGP,MAAM,CAACQ,wBAAwB,CAACF,MAAM,EAAED,CAAC,CAAC;EACnE,IAAIE,kBAAkB,CAACE,GAAG,KAAKhB,SAAS,EAAE;IACtC,IAAIc,kBAAkB,CAACG,YAAY,EAAE;MACjCV,MAAM,CAACC,cAAc,CAACK,MAAM,EAAED,CAAC,EAAE;QAAEM,KAAK,EAAER;MAAQ,CAAC,CAAC;MACpD9B,GAAG,CAACuC,IAAI,CAAC,CAACN,MAAM,EAAED,CAAC,EAAED,GAAG,EAAEG,kBAAkB,CAAC,CAAC;IAClD,CAAC,MACI;MACDjC,aAAa,CAACsC,IAAI,CAAC,CAACR,GAAG,EAAEC,CAAC,EAAEF,OAAO,CAAC,CAAC;IACzC;EACJ,CAAC,MACI;IACDG,MAAM,CAACD,CAAC,CAAC,GAAGF,OAAO;IACnB9B,GAAG,CAACuC,IAAI,CAAC,CAACN,MAAM,EAAED,CAAC,EAAED,GAAG,CAAC,CAAC;EAC9B;AACJ;AACA,SAASZ,MAAMA,CAACY,GAAG,EAAEC,CAAC,EAAEQ,SAAS,EAAEC,KAAK,EAAER,MAAM,EAAES,KAAK,EAAE/B,OAAO,EAAE;EAC9D+B,KAAK,IAAI,CAAC;EACV,IAAIC,CAAC;EACL,IAAI,OAAOZ,GAAG,KAAK,QAAQ,IAAIA,GAAG,KAAK,IAAI,EAAE;IACzC,KAAKY,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,KAAK,CAACnB,MAAM,EAAEqB,CAAC,EAAE,EAAE;MAC/B,IAAIF,KAAK,CAACE,CAAC,CAAC,KAAKZ,GAAG,EAAE;QAClBF,UAAU,CAAC/B,qBAAqB,EAAEiC,GAAG,EAAEC,CAAC,EAAEC,MAAM,CAAC;QACjD;MACJ;IACJ;IACA,IAAI,OAAOtB,OAAO,CAACR,UAAU,KAAK,WAAW,IACzCuC,KAAK,GAAG/B,OAAO,CAACR,UAAU,EAAE;MAC5B0B,UAAU,CAAChC,kBAAkB,EAAEkC,GAAG,EAAEC,CAAC,EAAEC,MAAM,CAAC;MAC9C;IACJ;IACA,IAAI,OAAOtB,OAAO,CAACL,UAAU,KAAK,WAAW,IACzCkC,SAAS,GAAG,CAAC,GAAG7B,OAAO,CAACL,UAAU,EAAE;MACpCuB,UAAU,CAAChC,kBAAkB,EAAEkC,GAAG,EAAEC,CAAC,EAAEC,MAAM,CAAC;MAC9C;IACJ;IACAQ,KAAK,CAACF,IAAI,CAACR,GAAG,CAAC;IACf;IACA,IAAIa,KAAK,CAACC,OAAO,CAACd,GAAG,CAAC,EAAE;MACpB,KAAKY,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGZ,GAAG,CAACT,MAAM,EAAEqB,CAAC,EAAE,EAAE;QAC7BxB,MAAM,CAACY,GAAG,CAACY,CAAC,CAAC,EAAEA,CAAC,EAAEA,CAAC,EAAEF,KAAK,EAAEV,GAAG,EAAEW,KAAK,EAAE/B,OAAO,CAAC;MACpD;IACJ,CAAC,MACI;MACD,IAAImC,IAAI,GAAGnB,MAAM,CAACmB,IAAI,CAACf,GAAG,CAAC;MAC3B,KAAKY,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGG,IAAI,CAACxB,MAAM,EAAEqB,CAAC,EAAE,EAAE;QAC9B,IAAII,GAAG,GAAGD,IAAI,CAACH,CAAC,CAAC;QACjBxB,MAAM,CAACY,GAAG,CAACgB,GAAG,CAAC,EAAEA,GAAG,EAAEJ,CAAC,EAAEF,KAAK,EAAEV,GAAG,EAAEW,KAAK,EAAE/B,OAAO,CAAC;MACxD;IACJ;IACA8B,KAAK,CAACf,GAAG,CAAC,CAAC;EACf;AACJ;AACA;AACA,SAASsB,eAAeA,CAACC,CAAC,EAAEC,CAAC,EAAE;EAC3B,IAAID,CAAC,GAAGC,CAAC,EAAE;IACP,OAAO,CAAC,CAAC;EACb;EACA,IAAID,CAAC,GAAGC,CAAC,EAAE;IACP,OAAO,CAAC;EACZ;EACA,OAAO,CAAC;AACZ;AACA,SAASC,sBAAsBA,CAAC3C,GAAG,EAAEC,QAAQ,EAAEC,MAAM,EAAEC,OAAO,EAAE;EAC5D,IAAI,OAAOA,OAAO,KAAK,WAAW,EAAE;IAChCA,OAAO,GAAGT,cAAc,CAAC,CAAC;EAC9B;EACA,IAAIkD,GAAG,GAAGC,mBAAmB,CAAC7C,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAEY,SAAS,EAAE,CAAC,EAAET,OAAO,CAAC,IAAIH,GAAG;EAC3E,IAAIa,GAAG;EACP,IAAI;IACA,IAAIpB,aAAa,CAACqB,MAAM,KAAK,CAAC,EAAE;MAC5BD,GAAG,GAAGT,IAAI,CAACL,SAAS,CAAC6C,GAAG,EAAE3C,QAAQ,EAAEC,MAAM,CAAC;IAC/C,CAAC,MACI;MACDW,GAAG,GAAGT,IAAI,CAACL,SAAS,CAAC6C,GAAG,EAAE7B,mBAAmB,CAACd,QAAQ,CAAC,EAAEC,MAAM,CAAC;IACpE;EACJ,CAAC,CACD,OAAOc,CAAC,EAAE;IACN,OAAOZ,IAAI,CAACL,SAAS,CAAC,qEAAqE,CAAC;EAChG,CAAC,SACO;IACJ;IACA,OAAOP,GAAG,CAACsB,MAAM,KAAK,CAAC,EAAE;MACrB,IAAIG,IAAI,GAAGzB,GAAG,CAAC0B,GAAG,CAAC,CAAC;MACpB,IAAID,IAAI,CAACH,MAAM,KAAK,CAAC,EAAE;QACnBK,MAAM,CAACC,cAAc,CAACH,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,CAAC,CAAC,CAAC,CAAC;MACpD,CAAC,MACI;QACDA,IAAI,CAAC,CAAC,CAAC,CAACA,IAAI,CAAC,CAAC,CAAC,CAAC,GAAGA,IAAI,CAAC,CAAC,CAAC;MAC9B;IACJ;EACJ;EACA,OAAOJ,GAAG;AACd;AACA,SAASgC,mBAAmBA,CAACtB,GAAG,EAAEC,CAAC,EAAEQ,SAAS,EAAEC,KAAK,EAAER,MAAM,EAAES,KAAK,EAAE/B,OAAO,EAAE;EAC3E+B,KAAK,IAAI,CAAC;EACV,IAAIC,CAAC;EACL,IAAI,OAAOZ,GAAG,KAAK,QAAQ,IAAIA,GAAG,KAAK,IAAI,EAAE;IACzC,KAAKY,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,KAAK,CAACnB,MAAM,EAAEqB,CAAC,EAAE,EAAE;MAC/B,IAAIF,KAAK,CAACE,CAAC,CAAC,KAAKZ,GAAG,EAAE;QAClBF,UAAU,CAAC/B,qBAAqB,EAAEiC,GAAG,EAAEC,CAAC,EAAEC,MAAM,CAAC;QACjD;MACJ;IACJ;IACA,IAAI;MACA,IAAI,OAAOF,GAAG,CAACuB,MAAM,KAAK,UAAU,EAAE;QAClC;MACJ;IACJ,CAAC,CACD,OAAO9B,CAAC,EAAE;MACN;IACJ;IACA,IAAI,OAAOb,OAAO,CAACR,UAAU,KAAK,WAAW,IACzCuC,KAAK,GAAG/B,OAAO,CAACR,UAAU,EAAE;MAC5B0B,UAAU,CAAChC,kBAAkB,EAAEkC,GAAG,EAAEC,CAAC,EAAEC,MAAM,CAAC;MAC9C;IACJ;IACA,IAAI,OAAOtB,OAAO,CAACL,UAAU,KAAK,WAAW,IACzCkC,SAAS,GAAG,CAAC,GAAG7B,OAAO,CAACL,UAAU,EAAE;MACpCuB,UAAU,CAAChC,kBAAkB,EAAEkC,GAAG,EAAEC,CAAC,EAAEC,MAAM,CAAC;MAC9C;IACJ;IACAQ,KAAK,CAACF,IAAI,CAACR,GAAG,CAAC;IACf;IACA,IAAIa,KAAK,CAACC,OAAO,CAACd,GAAG,CAAC,EAAE;MACpB,KAAKY,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGZ,GAAG,CAACT,MAAM,EAAEqB,CAAC,EAAE,EAAE;QAC7BU,mBAAmB,CAACtB,GAAG,CAACY,CAAC,CAAC,EAAEA,CAAC,EAAEA,CAAC,EAAEF,KAAK,EAAEV,GAAG,EAAEW,KAAK,EAAE/B,OAAO,CAAC;MACjE;IACJ,CAAC,MACI;MACD;MACA,IAAIyC,GAAG,GAAG,CAAC,CAAC;MACZ,IAAIN,IAAI,GAAGnB,MAAM,CAACmB,IAAI,CAACf,GAAG,CAAC,CAACwB,IAAI,CAACP,eAAe,CAAC;MACjD,KAAKL,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGG,IAAI,CAACxB,MAAM,EAAEqB,CAAC,EAAE,EAAE;QAC9B,IAAII,GAAG,GAAGD,IAAI,CAACH,CAAC,CAAC;QACjBU,mBAAmB,CAACtB,GAAG,CAACgB,GAAG,CAAC,EAAEA,GAAG,EAAEJ,CAAC,EAAEF,KAAK,EAAEV,GAAG,EAAEW,KAAK,EAAE/B,OAAO,CAAC;QACjEyC,GAAG,CAACL,GAAG,CAAC,GAAGhB,GAAG,CAACgB,GAAG,CAAC;MACvB;MACA,IAAI,OAAOd,MAAM,KAAK,WAAW,EAAE;QAC/BjC,GAAG,CAACuC,IAAI,CAAC,CAACN,MAAM,EAAED,CAAC,EAAED,GAAG,CAAC,CAAC;QAC1BE,MAAM,CAACD,CAAC,CAAC,GAAGoB,GAAG;MACnB,CAAC,MACI;QACD,OAAOA,GAAG;MACd;IACJ;IACAX,KAAK,CAACf,GAAG,CAAC,CAAC;EACf;AACJ;AACA;AACA;AACA,SAASH,mBAAmBA,CAACd,QAAQ,EAAE;EACnCA,QAAQ,GACJ,OAAOA,QAAQ,KAAK,WAAW,GACzBA,QAAQ,GACR,UAAUuB,CAAC,EAAEwB,CAAC,EAAE;IACd,OAAOA,CAAC;EACZ,CAAC;EACT,OAAO,UAAUT,GAAG,EAAEhB,GAAG,EAAE;IACvB,IAAI9B,aAAa,CAACqB,MAAM,GAAG,CAAC,EAAE;MAC1B,KAAK,IAAIqB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG1C,aAAa,CAACqB,MAAM,EAAEqB,CAAC,EAAE,EAAE;QAC3C,IAAIlB,IAAI,GAAGxB,aAAa,CAAC0C,CAAC,CAAC;QAC3B,IAAIlB,IAAI,CAAC,CAAC,CAAC,KAAKsB,GAAG,IAAItB,IAAI,CAAC,CAAC,CAAC,KAAKM,GAAG,EAAE;UACpCA,GAAG,GAAGN,IAAI,CAAC,CAAC,CAAC;UACbxB,aAAa,CAACwD,MAAM,CAACd,CAAC,EAAE,CAAC,CAAC;UAC1B;QACJ;MACJ;IACJ;IACA,OAAOlC,QAAQ,CAACiD,IAAI,CAAC,IAAI,EAAEX,GAAG,EAAEhB,GAAG,CAAC;EACxC,CAAC;AACL","ignoreList":[]},"metadata":{},"sourceType":"module","externalDependencies":[]}