@jcheesepkg/nanobot 0.8.7 → 0.8.9

package/dist/node_modules/@vitest/utils/dist/diff.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"diff.mjs","names":["c"],"sources":["../../../../../node_modules/@vitest/utils/dist/diff.js"],"sourcesContent":["import { format, plugins } from '@vitest/pretty-format';\nimport c from 'tinyrainbow';\nimport { g as getDefaultExportFromCjs, s as stringify } from './chunk-_commonjsHelpers.js';\nimport { deepClone, getOwnProperties, getType as getType$1 } from './helpers.js';\nimport 'loupe';\n\nconst DIFF_DELETE = -1;\nconst DIFF_INSERT = 1;\nconst DIFF_EQUAL = 0;\nclass Diff {\n  0;\n  1;\n  constructor(op, text) {\n    this[0] = op;\n    this[1] = text;\n  }\n}\nconst diff_commonPrefix = function(text1, text2) {\n  if (!text1 || !text2 || text1.charAt(0) !== text2.charAt(0)) {\n    return 0;\n  }\n  let pointermin = 0;\n  let pointermax = Math.min(text1.length, text2.length);\n  let pointermid = pointermax;\n  let pointerstart = 0;\n  while (pointermin < pointermid) {\n    if (text1.substring(pointerstart, pointermid) === text2.substring(pointerstart, pointermid)) {\n      pointermin = pointermid;\n      pointerstart = pointermin;\n    } else {\n      pointermax = pointermid;\n    }\n    pointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);\n  }\n  return pointermid;\n};\nconst diff_commonSuffix = function(text1, text2) {\n  if (!text1 || !text2 || text1.charAt(text1.length - 1) !== text2.charAt(text2.length - 1)) {\n    return 0;\n  }\n  let pointermin = 0;\n  let pointermax = Math.min(text1.length, text2.length);\n  let pointermid = pointermax;\n  let pointerend = 0;\n  while (pointermin < pointermid) {\n    if (text1.substring(text1.length - pointermid, text1.length - pointerend) === text2.substring(text2.length - pointermid, text2.length - pointerend)) {\n      pointermin = pointermid;\n      pointerend = pointermin;\n    } else {\n      pointermax = pointermid;\n    }\n    pointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);\n  }\n  return pointermid;\n};\nconst diff_commonOverlap_ = function(text1, text2) {\n  const text1_length = text1.length;\n  const text2_length = text2.length;\n  if (text1_length === 0 || text2_length === 0) {\n    return 0;\n  }\n  if (text1_length > text2_length) {\n    text1 = text1.substring(text1_length - text2_length);\n  } else if (text1_length < text2_length) {\n    text2 = text2.substring(0, text1_length);\n  }\n  const text_length = Math.min(text1_length, text2_length);\n  if (text1 === text2) {\n    return text_length;\n  }\n  let best = 0;\n  let length = 1;\n  while (true) {\n    const pattern = text1.substring(text_length - length);\n    const found = text2.indexOf(pattern);\n    if (found === -1) {\n      return best;\n    }\n    length += found;\n    if (found === 0 || text1.substring(text_length - length) === text2.substring(0, length)) {\n      best = length;\n      length++;\n    }\n  }\n};\nconst diff_cleanupSemantic = function(diffs) {\n  let changes = false;\n  const equalities = [];\n  let equalitiesLength = 0;\n  let lastEquality = null;\n  let pointer = 0;\n  let length_insertions1 = 0;\n  let length_deletions1 = 0;\n  let length_insertions2 = 0;\n  let length_deletions2 = 0;\n  while (pointer < diffs.length) {\n    if (diffs[pointer][0] === DIFF_EQUAL) {\n      equalities[equalitiesLength++] = pointer;\n      length_insertions1 = length_insertions2;\n      length_deletions1 = length_deletions2;\n      length_insertions2 = 0;\n      length_deletions2 = 0;\n      lastEquality = diffs[pointer][1];\n    } else {\n      if (diffs[pointer][0] === DIFF_INSERT) {\n        length_insertions2 += diffs[pointer][1].length;\n      } else {\n        length_deletions2 += diffs[pointer][1].length;\n      }\n      if (lastEquality && lastEquality.length <= Math.max(length_insertions1, length_deletions1) && lastEquality.length <= Math.max(length_insertions2, length_deletions2)) {\n        diffs.splice(\n          equalities[equalitiesLength - 1],\n          0,\n          new Diff(DIFF_DELETE, lastEquality)\n        );\n        diffs[equalities[equalitiesLength - 1] + 1][0] = DIFF_INSERT;\n        equalitiesLength--;\n        equalitiesLength--;\n        pointer = equalitiesLength > 0 ? equalities[equalitiesLength - 1] : -1;\n        length_insertions1 = 0;\n        length_deletions1 = 0;\n        length_insertions2 = 0;\n        length_deletions2 = 0;\n        lastEquality = null;\n        changes = true;\n      }\n    }\n    pointer++;\n  }\n  if (changes) {\n    diff_cleanupMerge(diffs);\n  }\n  diff_cleanupSemanticLossless(diffs);\n  pointer = 1;\n  while (pointer < diffs.length) {\n    if (diffs[pointer - 1][0] === DIFF_DELETE && diffs[pointer][0] === DIFF_INSERT) {\n      const deletion = diffs[pointer - 1][1];\n      const insertion = diffs[pointer][1];\n      const overlap_length1 = diff_commonOverlap_(deletion, insertion);\n      const overlap_length2 = diff_commonOverlap_(insertion, deletion);\n      if (overlap_length1 >= overlap_length2) {\n        if (overlap_length1 >= deletion.length / 2 || overlap_length1 >= insertion.length / 2) {\n          diffs.splice(\n            pointer,\n            0,\n            new Diff(DIFF_EQUAL, insertion.substring(0, overlap_length1))\n          );\n          diffs[pointer - 1][1] = deletion.substring(\n            0,\n            deletion.length - overlap_length1\n          );\n          diffs[pointer + 1][1] = insertion.substring(overlap_length1);\n          pointer++;\n        }\n      } else {\n        if (overlap_length2 >= deletion.length / 2 || overlap_length2 >= insertion.length / 2) {\n          diffs.splice(\n            pointer,\n            0,\n            new Diff(DIFF_EQUAL, deletion.substring(0, overlap_length2))\n          );\n          diffs[pointer - 1][0] = DIFF_INSERT;\n          diffs[pointer - 1][1] = insertion.substring(\n            0,\n            insertion.length - overlap_length2\n          );\n          diffs[pointer + 1][0] = DIFF_DELETE;\n          diffs[pointer + 1][1] = deletion.substring(overlap_length2);\n          pointer++;\n        }\n      }\n      pointer++;\n    }\n    pointer++;\n  }\n};\nconst nonAlphaNumericRegex_ = /[^a-z0-9]/i;\nconst whitespaceRegex_ = /\\s/;\nconst linebreakRegex_ = /[\\r\\n]/;\nconst blanklineEndRegex_ = /\\n\\r?\\n$/;\nconst blanklineStartRegex_ = /^\\r?\\n\\r?\\n/;\nfunction diff_cleanupSemanticLossless(diffs) {\n  let pointer = 1;\n  while (pointer < diffs.length - 1) {\n    if (diffs[pointer - 1][0] === DIFF_EQUAL && diffs[pointer + 1][0] === DIFF_EQUAL) {\n      let equality1 = diffs[pointer - 1][1];\n      let edit = diffs[pointer][1];\n      let equality2 = diffs[pointer + 1][1];\n      const commonOffset = diff_commonSuffix(equality1, edit);\n      if (commonOffset) {\n        const commonString = edit.substring(edit.length - commonOffset);\n        equality1 = equality1.substring(0, equality1.length - commonOffset);\n        edit = commonString + edit.substring(0, edit.length - commonOffset);\n        equality2 = commonString + equality2;\n      }\n      let bestEquality1 = equality1;\n      let bestEdit = edit;\n      let bestEquality2 = equality2;\n      let bestScore = diff_cleanupSemanticScore_(equality1, edit) + diff_cleanupSemanticScore_(edit, equality2);\n      while (edit.charAt(0) === equality2.charAt(0)) {\n        equality1 += edit.charAt(0);\n        edit = edit.substring(1) + equality2.charAt(0);\n        equality2 = equality2.substring(1);\n        const score = diff_cleanupSemanticScore_(equality1, edit) + diff_cleanupSemanticScore_(edit, equality2);\n        if (score >= bestScore) {\n          bestScore = score;\n          bestEquality1 = equality1;\n          bestEdit = edit;\n          bestEquality2 = equality2;\n        }\n      }\n      if (diffs[pointer - 1][1] !== bestEquality1) {\n        if (bestEquality1) {\n          diffs[pointer - 1][1] = bestEquality1;\n        } else {\n          diffs.splice(pointer - 1, 1);\n          pointer--;\n        }\n        diffs[pointer][1] = bestEdit;\n        if (bestEquality2) {\n          diffs[pointer + 1][1] = bestEquality2;\n        } else {\n          diffs.splice(pointer + 1, 1);\n          pointer--;\n        }\n      }\n    }\n    pointer++;\n  }\n}\nfunction diff_cleanupMerge(diffs) {\n  diffs.push(new Diff(DIFF_EQUAL, \"\"));\n  let pointer = 0;\n  let count_delete = 0;\n  let count_insert = 0;\n  let text_delete = \"\";\n  let text_insert = \"\";\n  let commonlength;\n  while (pointer < diffs.length) {\n    switch (diffs[pointer][0]) {\n      case DIFF_INSERT:\n        count_insert++;\n        text_insert += diffs[pointer][1];\n        pointer++;\n        break;\n      case DIFF_DELETE:\n        count_delete++;\n        text_delete += diffs[pointer][1];\n        pointer++;\n        break;\n      case DIFF_EQUAL:\n        if (count_delete + count_insert > 1) {\n          if (count_delete !== 0 && count_insert !== 0) {\n            commonlength = diff_commonPrefix(text_insert, text_delete);\n            if (commonlength !== 0) {\n              if (pointer - count_delete - count_insert > 0 && diffs[pointer - count_delete - count_insert - 1][0] === DIFF_EQUAL) {\n                diffs[pointer - count_delete - count_insert - 1][1] += text_insert.substring(0, commonlength);\n              } else {\n                diffs.splice(\n                  0,\n                  0,\n                  new Diff(DIFF_EQUAL, text_insert.substring(0, commonlength))\n                );\n                pointer++;\n              }\n              text_insert = text_insert.substring(commonlength);\n              text_delete = text_delete.substring(commonlength);\n            }\n            commonlength = diff_commonSuffix(text_insert, text_delete);\n            if (commonlength !== 0) {\n              diffs[pointer][1] = text_insert.substring(text_insert.length - commonlength) + diffs[pointer][1];\n              text_insert = text_insert.substring(\n                0,\n                text_insert.length - commonlength\n              );\n              text_delete = text_delete.substring(\n                0,\n                text_delete.length - commonlength\n              );\n            }\n          }\n          pointer -= count_delete + count_insert;\n          diffs.splice(pointer, count_delete + count_insert);\n          if (text_delete.length) {\n            diffs.splice(pointer, 0, new Diff(DIFF_DELETE, text_delete));\n            pointer++;\n          }\n          if (text_insert.length) {\n            diffs.splice(pointer, 0, new Diff(DIFF_INSERT, text_insert));\n            pointer++;\n          }\n          pointer++;\n        } else if (pointer !== 0 && diffs[pointer - 1][0] === DIFF_EQUAL) {\n          diffs[pointer - 1][1] += diffs[pointer][1];\n          diffs.splice(pointer, 1);\n        } else {\n          pointer++;\n        }\n        count_insert = 0;\n        count_delete = 0;\n        text_delete = \"\";\n        text_insert = \"\";\n        break;\n    }\n  }\n  if (diffs[diffs.length - 1][1] === \"\") {\n    diffs.pop();\n  }\n  let changes = false;\n  pointer = 1;\n  while (pointer < diffs.length - 1) {\n    if (diffs[pointer - 1][0] === DIFF_EQUAL && diffs[pointer + 1][0] === DIFF_EQUAL) {\n      if (diffs[pointer][1].substring(\n        diffs[pointer][1].length - diffs[pointer - 1][1].length\n      ) === diffs[pointer - 1][1]) {\n        diffs[pointer][1] = diffs[pointer - 1][1] + diffs[pointer][1].substring(\n          0,\n          diffs[pointer][1].length - diffs[pointer - 1][1].length\n        );\n        diffs[pointer + 1][1] = diffs[pointer - 1][1] + diffs[pointer + 1][1];\n        diffs.splice(pointer - 1, 1);\n        changes = true;\n      } else if (diffs[pointer][1].substring(0, diffs[pointer + 1][1].length) === diffs[pointer + 1][1]) {\n        diffs[pointer - 1][1] += diffs[pointer + 1][1];\n        diffs[pointer][1] = diffs[pointer][1].substring(diffs[pointer + 1][1].length) + diffs[pointer + 1][1];\n        diffs.splice(pointer + 1, 1);\n        changes = true;\n      }\n    }\n    pointer++;\n  }\n  if (changes) {\n    diff_cleanupMerge(diffs);\n  }\n}\nfunction diff_cleanupSemanticScore_(one, two) {\n  if (!one || !two) {\n    return 6;\n  }\n  const char1 = one.charAt(one.length - 1);\n  const char2 = two.charAt(0);\n  const nonAlphaNumeric1 = char1.match(nonAlphaNumericRegex_);\n  const nonAlphaNumeric2 = char2.match(nonAlphaNumericRegex_);\n  const whitespace1 = nonAlphaNumeric1 && char1.match(whitespaceRegex_);\n  const whitespace2 = nonAlphaNumeric2 && char2.match(whitespaceRegex_);\n  const lineBreak1 = whitespace1 && char1.match(linebreakRegex_);\n  const lineBreak2 = whitespace2 && char2.match(linebreakRegex_);\n  const blankLine1 = lineBreak1 && one.match(blanklineEndRegex_);\n  const blankLine2 = lineBreak2 && two.match(blanklineStartRegex_);\n  if (blankLine1 || blankLine2) {\n    return 5;\n  } else if (lineBreak1 || lineBreak2) {\n    return 4;\n  } else if (nonAlphaNumeric1 && !whitespace1 && whitespace2) {\n    return 3;\n  } else if (whitespace1 || whitespace2) {\n    return 2;\n  } else if (nonAlphaNumeric1 || nonAlphaNumeric2) {\n    return 1;\n  }\n  return 0;\n}\n\nconst NO_DIFF_MESSAGE = \"Compared values have no visual difference.\";\nconst SIMILAR_MESSAGE = \"Compared values serialize to the same structure.\\nPrinting internal object structure without calling `toJSON` instead.\";\n\nvar build = {};\n\nvar hasRequiredBuild;\n\nfunction requireBuild () {\n\tif (hasRequiredBuild) return build;\n\thasRequiredBuild = 1;\n\n\tObject.defineProperty(build, '__esModule', {\n\t  value: true\n\t});\n\tbuild.default = diffSequence;\n\t/**\n\t * Copyright (c) Meta Platforms, Inc. and affiliates.\n\t *\n\t * This source code is licensed under the MIT license found in the\n\t * LICENSE file in the root directory of this source tree.\n\t *\n\t */\n\n\t// This diff-sequences package implements the linear space variation in\n\t// An O(ND) Difference Algorithm and Its Variations by Eugene W. Myers\n\n\t// Relationship in notation between Myers paper and this package:\n\t// A is a\n\t// N is aLength, aEnd - aStart, and so on\n\t// x is aIndex, aFirst, aLast, and so on\n\t// B is b\n\t// M is bLength, bEnd - bStart, and so on\n\t// y is bIndex, bFirst, bLast, and so on\n\t// Δ = N - M is negative of baDeltaLength = bLength - aLength\n\t// D is d\n\t// k is kF\n\t// k + Δ is kF = kR - baDeltaLength\n\t// V is aIndexesF or aIndexesR (see comment below about Indexes type)\n\t// index intervals [1, N] and [1, M] are [0, aLength) and [0, bLength)\n\t// starting point in forward direction (0, 0) is (-1, -1)\n\t// starting point in reverse direction (N + 1, M + 1) is (aLength, bLength)\n\n\t// The “edit graph” for sequences a and b corresponds to items:\n\t// in a on the horizontal axis\n\t// in b on the vertical axis\n\t//\n\t// Given a-coordinate of a point in a diagonal, you can compute b-coordinate.\n\t//\n\t// Forward diagonals kF:\n\t// zero diagonal intersects top left corner\n\t// positive diagonals intersect top edge\n\t// negative diagonals insersect left edge\n\t//\n\t// Reverse diagonals kR:\n\t// zero diagonal intersects bottom right corner\n\t// positive diagonals intersect right edge\n\t// negative diagonals intersect bottom edge\n\n\t// The graph contains a directed acyclic graph of edges:\n\t// horizontal: delete an item from a\n\t// vertical: insert an item from b\n\t// diagonal: common item in a and b\n\t//\n\t// The algorithm solves dual problems in the graph analogy:\n\t// Find longest common subsequence: path with maximum number of diagonal edges\n\t// Find shortest edit script: path with minimum number of non-diagonal edges\n\n\t// Input callback function compares items at indexes in the sequences.\n\n\t// Output callback function receives the number of adjacent items\n\t// and starting indexes of each common subsequence.\n\t// Either original functions or wrapped to swap indexes if graph is transposed.\n\t// Indexes in sequence a of last point of forward or reverse paths in graph.\n\t// Myers algorithm indexes by diagonal k which for negative is bad deopt in V8.\n\t// This package indexes by iF and iR which are greater than or equal to zero.\n\t// and also updates the index arrays in place to cut memory in half.\n\t// kF = 2 * iF - d\n\t// kR = d - 2 * iR\n\t// Division of index intervals in sequences a and b at the middle change.\n\t// Invariant: intervals do not have common items at the start or end.\n\tconst pkg = 'diff-sequences'; // for error messages\n\tconst NOT_YET_SET = 0; // small int instead of undefined to avoid deopt in V8\n\n\t// Return the number of common items that follow in forward direction.\n\t// The length of what Myers paper calls a “snake” in a forward path.\n\tconst countCommonItemsF = (aIndex, aEnd, bIndex, bEnd, isCommon) => {\n\t  let nCommon = 0;\n\t  while (aIndex < aEnd && bIndex < bEnd && isCommon(aIndex, bIndex)) {\n\t    aIndex += 1;\n\t    bIndex += 1;\n\t    nCommon += 1;\n\t  }\n\t  return nCommon;\n\t};\n\n\t// Return the number of common items that precede in reverse direction.\n\t// The length of what Myers paper calls a “snake” in a reverse path.\n\tconst countCommonItemsR = (aStart, aIndex, bStart, bIndex, isCommon) => {\n\t  let nCommon = 0;\n\t  while (aStart <= aIndex && bStart <= bIndex && isCommon(aIndex, bIndex)) {\n\t    aIndex -= 1;\n\t    bIndex -= 1;\n\t    nCommon += 1;\n\t  }\n\t  return nCommon;\n\t};\n\n\t// A simple function to extend forward paths from (d - 1) to d changes\n\t// when forward and reverse paths cannot yet overlap.\n\tconst extendPathsF = (\n\t  d,\n\t  aEnd,\n\t  bEnd,\n\t  bF,\n\t  isCommon,\n\t  aIndexesF,\n\t  iMaxF // return the value because optimization might decrease it\n\t) => {\n\t  // Unroll the first iteration.\n\t  let iF = 0;\n\t  let kF = -d; // kF = 2 * iF - d\n\t  let aFirst = aIndexesF[iF]; // in first iteration always insert\n\t  let aIndexPrev1 = aFirst; // prev value of [iF - 1] in next iteration\n\t  aIndexesF[iF] += countCommonItemsF(\n\t    aFirst + 1,\n\t    aEnd,\n\t    bF + aFirst - kF + 1,\n\t    bEnd,\n\t    isCommon\n\t  );\n\n\t  // Optimization: skip diagonals in which paths cannot ever overlap.\n\t  const nF = d < iMaxF ? d : iMaxF;\n\n\t  // The diagonals kF are odd when d is odd and even when d is even.\n\t  for (iF += 1, kF += 2; iF <= nF; iF += 1, kF += 2) {\n\t    // To get first point of path segment, move one change in forward direction\n\t    // from last point of previous path segment in an adjacent diagonal.\n\t    // In last possible iteration when iF === d and kF === d always delete.\n\t    if (iF !== d && aIndexPrev1 < aIndexesF[iF]) {\n\t      aFirst = aIndexesF[iF]; // vertical to insert from b\n\t    } else {\n\t      aFirst = aIndexPrev1 + 1; // horizontal to delete from a\n\n\t      if (aEnd <= aFirst) {\n\t        // Optimization: delete moved past right of graph.\n\t        return iF - 1;\n\t      }\n\t    }\n\n\t    // To get last point of path segment, move along diagonal of common items.\n\t    aIndexPrev1 = aIndexesF[iF];\n\t    aIndexesF[iF] =\n\t      aFirst +\n\t      countCommonItemsF(aFirst + 1, aEnd, bF + aFirst - kF + 1, bEnd, isCommon);\n\t  }\n\t  return iMaxF;\n\t};\n\n\t// A simple function to extend reverse paths from (d - 1) to d changes\n\t// when reverse and forward paths cannot yet overlap.\n\tconst extendPathsR = (\n\t  d,\n\t  aStart,\n\t  bStart,\n\t  bR,\n\t  isCommon,\n\t  aIndexesR,\n\t  iMaxR // return the value because optimization might decrease it\n\t) => {\n\t  // Unroll the first iteration.\n\t  let iR = 0;\n\t  let kR = d; // kR = d - 2 * iR\n\t  let aFirst = aIndexesR[iR]; // in first iteration always insert\n\t  let aIndexPrev1 = aFirst; // prev value of [iR - 1] in next iteration\n\t  aIndexesR[iR] -= countCommonItemsR(\n\t    aStart,\n\t    aFirst - 1,\n\t    bStart,\n\t    bR + aFirst - kR - 1,\n\t    isCommon\n\t  );\n\n\t  // Optimization: skip diagonals in which paths cannot ever overlap.\n\t  const nR = d < iMaxR ? d : iMaxR;\n\n\t  // The diagonals kR are odd when d is odd and even when d is even.\n\t  for (iR += 1, kR -= 2; iR <= nR; iR += 1, kR -= 2) {\n\t    // To get first point of path segment, move one change in reverse direction\n\t    // from last point of previous path segment in an adjacent diagonal.\n\t    // In last possible iteration when iR === d and kR === -d always delete.\n\t    if (iR !== d && aIndexesR[iR] < aIndexPrev1) {\n\t      aFirst = aIndexesR[iR]; // vertical to insert from b\n\t    } else {\n\t      aFirst = aIndexPrev1 - 1; // horizontal to delete from a\n\n\t      if (aFirst < aStart) {\n\t        // Optimization: delete moved past left of graph.\n\t        return iR - 1;\n\t      }\n\t    }\n\n\t    // To get last point of path segment, move along diagonal of common items.\n\t    aIndexPrev1 = aIndexesR[iR];\n\t    aIndexesR[iR] =\n\t      aFirst -\n\t      countCommonItemsR(\n\t        aStart,\n\t        aFirst - 1,\n\t        bStart,\n\t        bR + aFirst - kR - 1,\n\t        isCommon\n\t      );\n\t  }\n\t  return iMaxR;\n\t};\n\n\t// A complete function to extend forward paths from (d - 1) to d changes.\n\t// Return true if a path overlaps reverse path of (d - 1) changes in its diagonal.\n\tconst extendOverlappablePathsF = (\n\t  d,\n\t  aStart,\n\t  aEnd,\n\t  bStart,\n\t  bEnd,\n\t  isCommon,\n\t  aIndexesF,\n\t  iMaxF,\n\t  aIndexesR,\n\t  iMaxR,\n\t  division // update prop values if return true\n\t) => {\n\t  const bF = bStart - aStart; // bIndex = bF + aIndex - kF\n\t  const aLength = aEnd - aStart;\n\t  const bLength = bEnd - bStart;\n\t  const baDeltaLength = bLength - aLength; // kF = kR - baDeltaLength\n\n\t  // Range of diagonals in which forward and reverse paths might overlap.\n\t  const kMinOverlapF = -baDeltaLength - (d - 1); // -(d - 1) <= kR\n\t  const kMaxOverlapF = -baDeltaLength + (d - 1); // kR <= (d - 1)\n\n\t  let aIndexPrev1 = NOT_YET_SET; // prev value of [iF - 1] in next iteration\n\n\t  // Optimization: skip diagonals in which paths cannot ever overlap.\n\t  const nF = d < iMaxF ? d : iMaxF;\n\n\t  // The diagonals kF = 2 * iF - d are odd when d is odd and even when d is even.\n\t  for (let iF = 0, kF = -d; iF <= nF; iF += 1, kF += 2) {\n\t    // To get first point of path segment, move one change in forward direction\n\t    // from last point of previous path segment in an adjacent diagonal.\n\t    // In first iteration when iF === 0 and kF === -d always insert.\n\t    // In last possible iteration when iF === d and kF === d always delete.\n\t    const insert = iF === 0 || (iF !== d && aIndexPrev1 < aIndexesF[iF]);\n\t    const aLastPrev = insert ? aIndexesF[iF] : aIndexPrev1;\n\t    const aFirst = insert\n\t      ? aLastPrev // vertical to insert from b\n\t      : aLastPrev + 1; // horizontal to delete from a\n\n\t    // To get last point of path segment, move along diagonal of common items.\n\t    const bFirst = bF + aFirst - kF;\n\t    const nCommonF = countCommonItemsF(\n\t      aFirst + 1,\n\t      aEnd,\n\t      bFirst + 1,\n\t      bEnd,\n\t      isCommon\n\t    );\n\t    const aLast = aFirst + nCommonF;\n\t    aIndexPrev1 = aIndexesF[iF];\n\t    aIndexesF[iF] = aLast;\n\t    if (kMinOverlapF <= kF && kF <= kMaxOverlapF) {\n\t      // Solve for iR of reverse path with (d - 1) changes in diagonal kF:\n\t      // kR = kF + baDeltaLength\n\t      // kR = (d - 1) - 2 * iR\n\t      const iR = (d - 1 - (kF + baDeltaLength)) / 2;\n\n\t      // If this forward path overlaps the reverse path in this diagonal,\n\t      // then this is the middle change of the index intervals.\n\t      if (iR <= iMaxR && aIndexesR[iR] - 1 <= aLast) {\n\t        // Unlike the Myers algorithm which finds only the middle “snake”\n\t        // this package can find two common subsequences per division.\n\t        // Last point of previous path segment is on an adjacent diagonal.\n\t        const bLastPrev = bF + aLastPrev - (insert ? kF + 1 : kF - 1);\n\n\t        // Because of invariant that intervals preceding the middle change\n\t        // cannot have common items at the end,\n\t        // move in reverse direction along a diagonal of common items.\n\t        const nCommonR = countCommonItemsR(\n\t          aStart,\n\t          aLastPrev,\n\t          bStart,\n\t          bLastPrev,\n\t          isCommon\n\t        );\n\t        const aIndexPrevFirst = aLastPrev - nCommonR;\n\t        const bIndexPrevFirst = bLastPrev - nCommonR;\n\t        const aEndPreceding = aIndexPrevFirst + 1;\n\t        const bEndPreceding = bIndexPrevFirst + 1;\n\t        division.nChangePreceding = d - 1;\n\t        if (d - 1 === aEndPreceding + bEndPreceding - aStart - bStart) {\n\t          // Optimization: number of preceding changes in forward direction\n\t          // is equal to number of items in preceding interval,\n\t          // therefore it cannot contain any common items.\n\t          division.aEndPreceding = aStart;\n\t          division.bEndPreceding = bStart;\n\t        } else {\n\t          division.aEndPreceding = aEndPreceding;\n\t          division.bEndPreceding = bEndPreceding;\n\t        }\n\t        division.nCommonPreceding = nCommonR;\n\t        if (nCommonR !== 0) {\n\t          division.aCommonPreceding = aEndPreceding;\n\t          division.bCommonPreceding = bEndPreceding;\n\t        }\n\t        division.nCommonFollowing = nCommonF;\n\t        if (nCommonF !== 0) {\n\t          division.aCommonFollowing = aFirst + 1;\n\t          division.bCommonFollowing = bFirst + 1;\n\t        }\n\t        const aStartFollowing = aLast + 1;\n\t        const bStartFollowing = bFirst + nCommonF + 1;\n\t        division.nChangeFollowing = d - 1;\n\t        if (d - 1 === aEnd + bEnd - aStartFollowing - bStartFollowing) {\n\t          // Optimization: number of changes in reverse direction\n\t          // is equal to number of items in following interval,\n\t          // therefore it cannot contain any common items.\n\t          division.aStartFollowing = aEnd;\n\t          division.bStartFollowing = bEnd;\n\t        } else {\n\t          division.aStartFollowing = aStartFollowing;\n\t          division.bStartFollowing = bStartFollowing;\n\t        }\n\t        return true;\n\t      }\n\t    }\n\t  }\n\t  return false;\n\t};\n\n\t// A complete function to extend reverse paths from (d - 1) to d changes.\n\t// Return true if a path overlaps forward path of d changes in its diagonal.\n\tconst extendOverlappablePathsR = (\n\t  d,\n\t  aStart,\n\t  aEnd,\n\t  bStart,\n\t  bEnd,\n\t  isCommon,\n\t  aIndexesF,\n\t  iMaxF,\n\t  aIndexesR,\n\t  iMaxR,\n\t  division // update prop values if return true\n\t) => {\n\t  const bR = bEnd - aEnd; // bIndex = bR + aIndex - kR\n\t  const aLength = aEnd - aStart;\n\t  const bLength = bEnd - bStart;\n\t  const baDeltaLength = bLength - aLength; // kR = kF + baDeltaLength\n\n\t  // Range of diagonals in which forward and reverse paths might overlap.\n\t  const kMinOverlapR = baDeltaLength - d; // -d <= kF\n\t  const kMaxOverlapR = baDeltaLength + d; // kF <= d\n\n\t  let aIndexPrev1 = NOT_YET_SET; // prev value of [iR - 1] in next iteration\n\n\t  // Optimization: skip diagonals in which paths cannot ever overlap.\n\t  const nR = d < iMaxR ? d : iMaxR;\n\n\t  // The diagonals kR = d - 2 * iR are odd when d is odd and even when d is even.\n\t  for (let iR = 0, kR = d; iR <= nR; iR += 1, kR -= 2) {\n\t    // To get first point of path segment, move one change in reverse direction\n\t    // from last point of previous path segment in an adjacent diagonal.\n\t    // In first iteration when iR === 0 and kR === d always insert.\n\t    // In last possible iteration when iR === d and kR === -d always delete.\n\t    const insert = iR === 0 || (iR !== d && aIndexesR[iR] < aIndexPrev1);\n\t    const aLastPrev = insert ? aIndexesR[iR] : aIndexPrev1;\n\t    const aFirst = insert\n\t      ? aLastPrev // vertical to insert from b\n\t      : aLastPrev - 1; // horizontal to delete from a\n\n\t    // To get last point of path segment, move along diagonal of common items.\n\t    const bFirst = bR + aFirst - kR;\n\t    const nCommonR = countCommonItemsR(\n\t      aStart,\n\t      aFirst - 1,\n\t      bStart,\n\t      bFirst - 1,\n\t      isCommon\n\t    );\n\t    const aLast = aFirst - nCommonR;\n\t    aIndexPrev1 = aIndexesR[iR];\n\t    aIndexesR[iR] = aLast;\n\t    if (kMinOverlapR <= kR && kR <= kMaxOverlapR) {\n\t      // Solve for iF of forward path with d changes in diagonal kR:\n\t      // kF = kR - baDeltaLength\n\t      // kF = 2 * iF - d\n\t      const iF = (d + (kR - baDeltaLength)) / 2;\n\n\t      // If this reverse path overlaps the forward path in this diagonal,\n\t      // then this is a middle change of the index intervals.\n\t      if (iF <= iMaxF && aLast - 1 <= aIndexesF[iF]) {\n\t        const bLast = bFirst - nCommonR;\n\t        division.nChangePreceding = d;\n\t        if (d === aLast + bLast - aStart - bStart) {\n\t          // Optimization: number of changes in reverse direction\n\t          // is equal to number of items in preceding interval,\n\t          // therefore it cannot contain any common items.\n\t          division.aEndPreceding = aStart;\n\t          division.bEndPreceding = bStart;\n\t        } else {\n\t          division.aEndPreceding = aLast;\n\t          division.bEndPreceding = bLast;\n\t        }\n\t        division.nCommonPreceding = nCommonR;\n\t        if (nCommonR !== 0) {\n\t          // The last point of reverse path segment is start of common subsequence.\n\t          division.aCommonPreceding = aLast;\n\t          division.bCommonPreceding = bLast;\n\t        }\n\t        division.nChangeFollowing = d - 1;\n\t        if (d === 1) {\n\t          // There is no previous path segment.\n\t          division.nCommonFollowing = 0;\n\t          division.aStartFollowing = aEnd;\n\t          division.bStartFollowing = bEnd;\n\t        } else {\n\t          // Unlike the Myers algorithm which finds only the middle “snake”\n\t          // this package can find two common subsequences per division.\n\t          // Last point of previous path segment is on an adjacent diagonal.\n\t          const bLastPrev = bR + aLastPrev - (insert ? kR - 1 : kR + 1);\n\n\t          // Because of invariant that intervals following the middle change\n\t          // cannot have common items at the start,\n\t          // move in forward direction along a diagonal of common items.\n\t          const nCommonF = countCommonItemsF(\n\t            aLastPrev,\n\t            aEnd,\n\t            bLastPrev,\n\t            bEnd,\n\t            isCommon\n\t          );\n\t          division.nCommonFollowing = nCommonF;\n\t          if (nCommonF !== 0) {\n\t            // The last point of reverse path segment is start of common subsequence.\n\t            division.aCommonFollowing = aLastPrev;\n\t            division.bCommonFollowing = bLastPrev;\n\t          }\n\t          const aStartFollowing = aLastPrev + nCommonF; // aFirstPrev\n\t          const bStartFollowing = bLastPrev + nCommonF; // bFirstPrev\n\n\t          if (d - 1 === aEnd + bEnd - aStartFollowing - bStartFollowing) {\n\t            // Optimization: number of changes in forward direction\n\t            // is equal to number of items in following interval,\n\t            // therefore it cannot contain any common items.\n\t            division.aStartFollowing = aEnd;\n\t            division.bStartFollowing = bEnd;\n\t          } else {\n\t            division.aStartFollowing = aStartFollowing;\n\t            division.bStartFollowing = bStartFollowing;\n\t          }\n\t        }\n\t        return true;\n\t      }\n\t    }\n\t  }\n\t  return false;\n\t};\n\n\t// Given index intervals and input function to compare items at indexes,\n\t// divide at the middle change.\n\t//\n\t// DO NOT CALL if start === end, because interval cannot contain common items\n\t// and because this function will throw the “no overlap” error.\n\tconst divide = (\n\t  nChange,\n\t  aStart,\n\t  aEnd,\n\t  bStart,\n\t  bEnd,\n\t  isCommon,\n\t  aIndexesF,\n\t  aIndexesR,\n\t  division // output\n\t) => {\n\t  const bF = bStart - aStart; // bIndex = bF + aIndex - kF\n\t  const bR = bEnd - aEnd; // bIndex = bR + aIndex - kR\n\t  const aLength = aEnd - aStart;\n\t  const bLength = bEnd - bStart;\n\n\t  // Because graph has square or portrait orientation,\n\t  // length difference is minimum number of items to insert from b.\n\t  // Corresponding forward and reverse diagonals in graph\n\t  // depend on length difference of the sequences:\n\t  // kF = kR - baDeltaLength\n\t  // kR = kF + baDeltaLength\n\t  const baDeltaLength = bLength - aLength;\n\n\t  // Optimization: max diagonal in graph intersects corner of shorter side.\n\t  let iMaxF = aLength;\n\t  let iMaxR = aLength;\n\n\t  // Initialize no changes yet in forward or reverse direction:\n\t  aIndexesF[0] = aStart - 1; // at open start of interval, outside closed start\n\t  aIndexesR[0] = aEnd; // at open end of interval\n\n\t  if (baDeltaLength % 2 === 0) {\n\t    // The number of changes in paths is 2 * d if length difference is even.\n\t    const dMin = (nChange || baDeltaLength) / 2;\n\t    const dMax = (aLength + bLength) / 2;\n\t    for (let d = 1; d <= dMax; d += 1) {\n\t      iMaxF = extendPathsF(d, aEnd, bEnd, bF, isCommon, aIndexesF, iMaxF);\n\t      if (d < dMin) {\n\t        iMaxR = extendPathsR(d, aStart, bStart, bR, isCommon, aIndexesR, iMaxR);\n\t      } else if (\n\t        // If a reverse path overlaps a forward path in the same diagonal,\n\t        // return a division of the index intervals at the middle change.\n\t        extendOverlappablePathsR(\n\t          d,\n\t          aStart,\n\t          aEnd,\n\t          bStart,\n\t          bEnd,\n\t          isCommon,\n\t          aIndexesF,\n\t          iMaxF,\n\t          aIndexesR,\n\t          iMaxR,\n\t          division\n\t        )\n\t      ) {\n\t        return;\n\t      }\n\t    }\n\t  } else {\n\t    // The number of changes in paths is 2 * d - 1 if length difference is odd.\n\t    const dMin = ((nChange || baDeltaLength) + 1) / 2;\n\t    const dMax = (aLength + bLength + 1) / 2;\n\n\t    // Unroll first half iteration so loop extends the relevant pairs of paths.\n\t    // Because of invariant that intervals have no common items at start or end,\n\t    // and limitation not to call divide with empty intervals,\n\t    // therefore it cannot be called if a forward path with one change\n\t    // would overlap a reverse path with no changes, even if dMin === 1.\n\t    let d = 1;\n\t    iMaxF = extendPathsF(d, aEnd, bEnd, bF, isCommon, aIndexesF, iMaxF);\n\t    for (d += 1; d <= dMax; d += 1) {\n\t      iMaxR = extendPathsR(\n\t        d - 1,\n\t        aStart,\n\t        bStart,\n\t        bR,\n\t        isCommon,\n\t        aIndexesR,\n\t        iMaxR\n\t      );\n\t      if (d < dMin) {\n\t        iMaxF = extendPathsF(d, aEnd, bEnd, bF, isCommon, aIndexesF, iMaxF);\n\t      } else if (\n\t        // If a forward path overlaps a reverse path in the same diagonal,\n\t        // return a division of the index intervals at the middle change.\n\t        extendOverlappablePathsF(\n\t          d,\n\t          aStart,\n\t          aEnd,\n\t          bStart,\n\t          bEnd,\n\t          isCommon,\n\t          aIndexesF,\n\t          iMaxF,\n\t          aIndexesR,\n\t          iMaxR,\n\t          division\n\t        )\n\t      ) {\n\t        return;\n\t      }\n\t    }\n\t  }\n\n\t  /* istanbul ignore next */\n\t  throw new Error(\n\t    `${pkg}: no overlap aStart=${aStart} aEnd=${aEnd} bStart=${bStart} bEnd=${bEnd}`\n\t  );\n\t};\n\n\t// Given index intervals and input function to compare items at indexes,\n\t// return by output function the number of adjacent items and starting indexes\n\t// of each common subsequence. Divide and conquer with only linear space.\n\t//\n\t// The index intervals are half open [start, end) like array slice method.\n\t// DO NOT CALL if start === end, because interval cannot contain common items\n\t// and because divide function will throw the “no overlap” error.\n\tconst findSubsequences = (\n\t  nChange,\n\t  aStart,\n\t  aEnd,\n\t  bStart,\n\t  bEnd,\n\t  transposed,\n\t  callbacks,\n\t  aIndexesF,\n\t  aIndexesR,\n\t  division // temporary memory, not input nor output\n\t) => {\n\t  if (bEnd - bStart < aEnd - aStart) {\n\t    // Transpose graph so it has portrait instead of landscape orientation.\n\t    // Always compare shorter to longer sequence for consistency and optimization.\n\t    transposed = !transposed;\n\t    if (transposed && callbacks.length === 1) {\n\t      // Lazily wrap callback functions to swap args if graph is transposed.\n\t      const {foundSubsequence, isCommon} = callbacks[0];\n\t      callbacks[1] = {\n\t        foundSubsequence: (nCommon, bCommon, aCommon) => {\n\t          foundSubsequence(nCommon, aCommon, bCommon);\n\t        },\n\t        isCommon: (bIndex, aIndex) => isCommon(aIndex, bIndex)\n\t      };\n\t    }\n\t    const tStart = aStart;\n\t    const tEnd = aEnd;\n\t    aStart = bStart;\n\t    aEnd = bEnd;\n\t    bStart = tStart;\n\t    bEnd = tEnd;\n\t  }\n\t  const {foundSubsequence, isCommon} = callbacks[transposed ? 1 : 0];\n\n\t  // Divide the index intervals at the middle change.\n\t  divide(\n\t    nChange,\n\t    aStart,\n\t    aEnd,\n\t    bStart,\n\t    bEnd,\n\t    isCommon,\n\t    aIndexesF,\n\t    aIndexesR,\n\t    division\n\t  );\n\t  const {\n\t    nChangePreceding,\n\t    aEndPreceding,\n\t    bEndPreceding,\n\t    nCommonPreceding,\n\t    aCommonPreceding,\n\t    bCommonPreceding,\n\t    nCommonFollowing,\n\t    aCommonFollowing,\n\t    bCommonFollowing,\n\t    nChangeFollowing,\n\t    aStartFollowing,\n\t    bStartFollowing\n\t  } = division;\n\n\t  // Unless either index interval is empty, they might contain common items.\n\t  if (aStart < aEndPreceding && bStart < bEndPreceding) {\n\t    // Recursely find and return common subsequences preceding the division.\n\t    findSubsequences(\n\t      nChangePreceding,\n\t      aStart,\n\t      aEndPreceding,\n\t      bStart,\n\t      bEndPreceding,\n\t      transposed,\n\t      callbacks,\n\t      aIndexesF,\n\t      aIndexesR,\n\t      division\n\t    );\n\t  }\n\n\t  // Return common subsequences that are adjacent to the middle change.\n\t  if (nCommonPreceding !== 0) {\n\t    foundSubsequence(nCommonPreceding, aCommonPreceding, bCommonPreceding);\n\t  }\n\t  if (nCommonFollowing !== 0) {\n\t    foundSubsequence(nCommonFollowing, aCommonFollowing, bCommonFollowing);\n\t  }\n\n\t  // Unless either index interval is empty, they might contain common items.\n\t  if (aStartFollowing < aEnd && bStartFollowing < bEnd) {\n\t    // Recursely find and return common subsequences following the division.\n\t    findSubsequences(\n\t      nChangeFollowing,\n\t      aStartFollowing,\n\t      aEnd,\n\t      bStartFollowing,\n\t      bEnd,\n\t      transposed,\n\t      callbacks,\n\t      aIndexesF,\n\t      aIndexesR,\n\t      division\n\t    );\n\t  }\n\t};\n\tconst validateLength = (name, arg) => {\n\t  if (typeof arg !== 'number') {\n\t    throw new TypeError(`${pkg}: ${name} typeof ${typeof arg} is not a number`);\n\t  }\n\t  if (!Number.isSafeInteger(arg)) {\n\t    throw new RangeError(`${pkg}: ${name} value ${arg} is not a safe integer`);\n\t  }\n\t  if (arg < 0) {\n\t    throw new RangeError(`${pkg}: ${name} value ${arg} is a negative integer`);\n\t  }\n\t};\n\tconst validateCallback = (name, arg) => {\n\t  const type = typeof arg;\n\t  if (type !== 'function') {\n\t    throw new TypeError(`${pkg}: ${name} typeof ${type} is not a function`);\n\t  }\n\t};\n\n\t// Compare items in two sequences to find a longest common subsequence.\n\t// Given lengths of sequences and input function to compare items at indexes,\n\t// return by output function the number of adjacent items and starting indexes\n\t// of each common subsequence.\n\tfunction diffSequence(aLength, bLength, isCommon, foundSubsequence) {\n\t  validateLength('aLength', aLength);\n\t  validateLength('bLength', bLength);\n\t  validateCallback('isCommon', isCommon);\n\t  validateCallback('foundSubsequence', foundSubsequence);\n\n\t  // Count common items from the start in the forward direction.\n\t  const nCommonF = countCommonItemsF(0, aLength, 0, bLength, isCommon);\n\t  if (nCommonF !== 0) {\n\t    foundSubsequence(nCommonF, 0, 0);\n\t  }\n\n\t  // Unless both sequences consist of common items only,\n\t  // find common items in the half-trimmed index intervals.\n\t  if (aLength !== nCommonF || bLength !== nCommonF) {\n\t    // Invariant: intervals do not have common items at the start.\n\t    // The start of an index interval is closed like array slice method.\n\t    const aStart = nCommonF;\n\t    const bStart = nCommonF;\n\n\t    // Count common items from the end in the reverse direction.\n\t    const nCommonR = countCommonItemsR(\n\t      aStart,\n\t      aLength - 1,\n\t      bStart,\n\t      bLength - 1,\n\t      isCommon\n\t    );\n\n\t    // Invariant: intervals do not have common items at the end.\n\t    // The end of an index interval is open like array slice method.\n\t    const aEnd = aLength - nCommonR;\n\t    const bEnd = bLength - nCommonR;\n\n\t    // Unless one sequence consists of common items only,\n\t    // therefore the other trimmed index interval consists of changes only,\n\t    // find common items in the trimmed index intervals.\n\t    const nCommonFR = nCommonF + nCommonR;\n\t    if (aLength !== nCommonFR && bLength !== nCommonFR) {\n\t      const nChange = 0; // number of change items is not yet known\n\t      const transposed = false; // call the original unwrapped functions\n\t      const callbacks = [\n\t        {\n\t          foundSubsequence,\n\t          isCommon\n\t        }\n\t      ];\n\n\t      // Indexes in sequence a of last points in furthest reaching paths\n\t      // from outside the start at top left in the forward direction:\n\t      const aIndexesF = [NOT_YET_SET];\n\t      // from the end at bottom right in the reverse direction:\n\t      const aIndexesR = [NOT_YET_SET];\n\n\t      // Initialize one object as output of all calls to divide function.\n\t      const division = {\n\t        aCommonFollowing: NOT_YET_SET,\n\t        aCommonPreceding: NOT_YET_SET,\n\t        aEndPreceding: NOT_YET_SET,\n\t        aStartFollowing: NOT_YET_SET,\n\t        bCommonFollowing: NOT_YET_SET,\n\t        bCommonPreceding: NOT_YET_SET,\n\t        bEndPreceding: NOT_YET_SET,\n\t        bStartFollowing: NOT_YET_SET,\n\t        nChangeFollowing: NOT_YET_SET,\n\t        nChangePreceding: NOT_YET_SET,\n\t        nCommonFollowing: NOT_YET_SET,\n\t        nCommonPreceding: NOT_YET_SET\n\t      };\n\n\t      // Find and return common subsequences in the trimmed index intervals.\n\t      findSubsequences(\n\t        nChange,\n\t        aStart,\n\t        aEnd,\n\t        bStart,\n\t        bEnd,\n\t        transposed,\n\t        callbacks,\n\t        aIndexesF,\n\t        aIndexesR,\n\t        division\n\t      );\n\t    }\n\t    if (nCommonR !== 0) {\n\t      foundSubsequence(nCommonR, aEnd, bEnd);\n\t    }\n\t  }\n\t}\n\treturn build;\n}\n\nvar buildExports = requireBuild();\nvar diffSequences = /*@__PURE__*/getDefaultExportFromCjs(buildExports);\n\nfunction formatTrailingSpaces(line, trailingSpaceFormatter) {\n  return line.replace(/\\s+$/, (match) => trailingSpaceFormatter(match));\n}\nfunction printDiffLine(line, isFirstOrLast, color, indicator, trailingSpaceFormatter, emptyFirstOrLastLinePlaceholder) {\n  return line.length !== 0 ? color(\n    `${indicator} ${formatTrailingSpaces(line, trailingSpaceFormatter)}`\n  ) : indicator !== \" \" ? color(indicator) : isFirstOrLast && emptyFirstOrLastLinePlaceholder.length !== 0 ? color(`${indicator} ${emptyFirstOrLastLinePlaceholder}`) : \"\";\n}\nfunction printDeleteLine(line, isFirstOrLast, {\n  aColor,\n  aIndicator,\n  changeLineTrailingSpaceColor,\n  emptyFirstOrLastLinePlaceholder\n}) {\n  return printDiffLine(\n    line,\n    isFirstOrLast,\n    aColor,\n    aIndicator,\n    changeLineTrailingSpaceColor,\n    emptyFirstOrLastLinePlaceholder\n  );\n}\nfunction printInsertLine(line, isFirstOrLast, {\n  bColor,\n  bIndicator,\n  changeLineTrailingSpaceColor,\n  emptyFirstOrLastLinePlaceholder\n}) {\n  return printDiffLine(\n    line,\n    isFirstOrLast,\n    bColor,\n    bIndicator,\n    changeLineTrailingSpaceColor,\n    emptyFirstOrLastLinePlaceholder\n  );\n}\nfunction printCommonLine(line, isFirstOrLast, {\n  commonColor,\n  commonIndicator,\n  commonLineTrailingSpaceColor,\n  emptyFirstOrLastLinePlaceholder\n}) {\n  return printDiffLine(\n    line,\n    isFirstOrLast,\n    commonColor,\n    commonIndicator,\n    commonLineTrailingSpaceColor,\n    emptyFirstOrLastLinePlaceholder\n  );\n}\nfunction createPatchMark(aStart, aEnd, bStart, bEnd, { patchColor }) {\n  return patchColor(\n    `@@ -${aStart + 1},${aEnd - aStart} +${bStart + 1},${bEnd - bStart} @@`\n  );\n}\nfunction joinAlignedDiffsNoExpand(diffs, options) {\n  const iLength = diffs.length;\n  const nContextLines = options.contextLines;\n  const nContextLines2 = nContextLines + nContextLines;\n  let jLength = iLength;\n  let hasExcessAtStartOrEnd = false;\n  let nExcessesBetweenChanges = 0;\n  let i = 0;\n  while (i !== iLength) {\n    const iStart = i;\n    while (i !== iLength && diffs[i][0] === DIFF_EQUAL) {\n      i += 1;\n    }\n    if (iStart !== i) {\n      if (iStart === 0) {\n        if (i > nContextLines) {\n          jLength -= i - nContextLines;\n          hasExcessAtStartOrEnd = true;\n        }\n      } else if (i === iLength) {\n        const n = i - iStart;\n        if (n > nContextLines) {\n          jLength -= n - nContextLines;\n          hasExcessAtStartOrEnd = true;\n        }\n      } else {\n        const n = i - iStart;\n        if (n > nContextLines2) {\n          jLength -= n - nContextLines2;\n          nExcessesBetweenChanges += 1;\n        }\n      }\n    }\n    while (i !== iLength && diffs[i][0] !== DIFF_EQUAL) {\n      i += 1;\n    }\n  }\n  const hasPatch = nExcessesBetweenChanges !== 0 || hasExcessAtStartOrEnd;\n  if (nExcessesBetweenChanges !== 0) {\n    jLength += nExcessesBetweenChanges + 1;\n  } else if (hasExcessAtStartOrEnd) {\n    jLength += 1;\n  }\n  const jLast = jLength - 1;\n  const lines = [];\n  let jPatchMark = 0;\n  if (hasPatch) {\n    lines.push(\"\");\n  }\n  let aStart = 0;\n  let bStart = 0;\n  let aEnd = 0;\n  let bEnd = 0;\n  const pushCommonLine = (line) => {\n    const j = lines.length;\n    lines.push(printCommonLine(line, j === 0 || j === jLast, options));\n    aEnd += 1;\n    bEnd += 1;\n  };\n  const pushDeleteLine = (line) => {\n    const j = lines.length;\n    lines.push(printDeleteLine(line, j === 0 || j === jLast, options));\n    aEnd += 1;\n  };\n  const pushInsertLine = (line) => {\n    const j = lines.length;\n    lines.push(printInsertLine(line, j === 0 || j === jLast, options));\n    bEnd += 1;\n  };\n  i = 0;\n  while (i !== iLength) {\n    let iStart = i;\n    while (i !== iLength && diffs[i][0] === DIFF_EQUAL) {\n      i += 1;\n    }\n    if (iStart !== i) {\n      if (iStart === 0) {\n        if (i > nContextLines) {\n          iStart = i - nContextLines;\n          aStart = iStart;\n          bStart = iStart;\n          aEnd = aStart;\n          bEnd = bStart;\n        }\n        for (let iCommon = iStart; iCommon !== i; iCommon += 1) {\n          pushCommonLine(diffs[iCommon][1]);\n        }\n      } else if (i === iLength) {\n        const iEnd = i - iStart > nContextLines ? iStart + nContextLines : i;\n        for (let iCommon = iStart; iCommon !== iEnd; iCommon += 1) {\n          pushCommonLine(diffs[iCommon][1]);\n        }\n      } else {\n        const nCommon = i - iStart;\n        if (nCommon > nContextLines2) {\n          const iEnd = iStart + nContextLines;\n          for (let iCommon = iStart; iCommon !== iEnd; iCommon += 1) {\n            pushCommonLine(diffs[iCommon][1]);\n          }\n          lines[jPatchMark] = createPatchMark(\n            aStart,\n            aEnd,\n            bStart,\n            bEnd,\n            options\n          );\n          jPatchMark = lines.length;\n          lines.push(\"\");\n          const nOmit = nCommon - nContextLines2;\n          aStart = aEnd + nOmit;\n          bStart = bEnd + nOmit;\n          aEnd = aStart;\n          bEnd = bStart;\n          for (let iCommon = i - nContextLines; iCommon !== i; iCommon += 1) {\n            pushCommonLine(diffs[iCommon][1]);\n          }\n        } else {\n          for (let iCommon = iStart; iCommon !== i; iCommon += 1) {\n            pushCommonLine(diffs[iCommon][1]);\n          }\n        }\n      }\n    }\n    while (i !== iLength && diffs[i][0] === DIFF_DELETE) {\n      pushDeleteLine(diffs[i][1]);\n      i += 1;\n    }\n    while (i !== iLength && diffs[i][0] === DIFF_INSERT) {\n      pushInsertLine(diffs[i][1]);\n      i += 1;\n    }\n  }\n  if (hasPatch) {\n    lines[jPatchMark] = createPatchMark(aStart, aEnd, bStart, bEnd, options);\n  }\n  return lines.join(\"\\n\");\n}\nfunction joinAlignedDiffsExpand(diffs, options) {\n  return diffs.map((diff, i, diffs2) => {\n    const line = diff[1];\n    const isFirstOrLast = i === 0 || i === diffs2.length - 1;\n    switch (diff[0]) {\n      case DIFF_DELETE:\n        return printDeleteLine(line, isFirstOrLast, options);\n      case DIFF_INSERT:\n        return printInsertLine(line, isFirstOrLast, options);\n      default:\n        return printCommonLine(line, isFirstOrLast, options);\n    }\n  }).join(\"\\n\");\n}\n\nconst noColor = (string) => string;\nconst DIFF_CONTEXT_DEFAULT = 5;\nconst DIFF_TRUNCATE_THRESHOLD_DEFAULT = 0;\nfunction getDefaultOptions() {\n  return {\n    aAnnotation: \"Expected\",\n    aColor: c.green,\n    aIndicator: \"-\",\n    bAnnotation: \"Received\",\n    bColor: c.red,\n    bIndicator: \"+\",\n    changeColor: c.inverse,\n    changeLineTrailingSpaceColor: noColor,\n    commonColor: c.dim,\n    commonIndicator: \" \",\n    commonLineTrailingSpaceColor: noColor,\n    compareKeys: void 0,\n    contextLines: DIFF_CONTEXT_DEFAULT,\n    emptyFirstOrLastLinePlaceholder: \"\",\n    expand: true,\n    includeChangeCounts: false,\n    omitAnnotationLines: false,\n    patchColor: c.yellow,\n    truncateThreshold: DIFF_TRUNCATE_THRESHOLD_DEFAULT,\n    truncateAnnotation: \"... Diff result is truncated\",\n    truncateAnnotationColor: noColor\n  };\n}\nfunction getCompareKeys(compareKeys) {\n  return compareKeys && typeof compareKeys === \"function\" ? compareKeys : void 0;\n}\nfunction getContextLines(contextLines) {\n  return typeof contextLines === \"number\" && Number.isSafeInteger(contextLines) && contextLines >= 0 ? contextLines : DIFF_CONTEXT_DEFAULT;\n}\nfunction normalizeDiffOptions(options = {}) {\n  return {\n    ...getDefaultOptions(),\n    ...options,\n    compareKeys: getCompareKeys(options.compareKeys),\n    contextLines: getContextLines(options.contextLines)\n  };\n}\n\nfunction isEmptyString(lines) {\n  return lines.length === 1 && lines[0].length === 0;\n}\nfunction countChanges(diffs) {\n  let a = 0;\n  let b = 0;\n  diffs.forEach((diff) => {\n    switch (diff[0]) {\n      case DIFF_DELETE:\n        a += 1;\n        break;\n      case DIFF_INSERT:\n        b += 1;\n        break;\n    }\n  });\n  return { a, b };\n}\nfunction printAnnotation({\n  aAnnotation,\n  aColor,\n  aIndicator,\n  bAnnotation,\n  bColor,\n  bIndicator,\n  includeChangeCounts,\n  omitAnnotationLines\n}, changeCounts) {\n  if (omitAnnotationLines) {\n    return \"\";\n  }\n  let aRest = \"\";\n  let bRest = \"\";\n  if (includeChangeCounts) {\n    const aCount = String(changeCounts.a);\n    const bCount = String(changeCounts.b);\n    const baAnnotationLengthDiff = bAnnotation.length - aAnnotation.length;\n    const aAnnotationPadding = \" \".repeat(Math.max(0, baAnnotationLengthDiff));\n    const bAnnotationPadding = \" \".repeat(Math.max(0, -baAnnotationLengthDiff));\n    const baCountLengthDiff = bCount.length - aCount.length;\n    const aCountPadding = \" \".repeat(Math.max(0, baCountLengthDiff));\n    const bCountPadding = \" \".repeat(Math.max(0, -baCountLengthDiff));\n    aRest = `${aAnnotationPadding}  ${aIndicator} ${aCountPadding}${aCount}`;\n    bRest = `${bAnnotationPadding}  ${bIndicator} ${bCountPadding}${bCount}`;\n  }\n  const a = `${aIndicator} ${aAnnotation}${aRest}`;\n  const b = `${bIndicator} ${bAnnotation}${bRest}`;\n  return `${aColor(a)}\n${bColor(b)}\n\n`;\n}\nfunction printDiffLines(diffs, truncated, options) {\n  return printAnnotation(options, countChanges(diffs)) + (options.expand ? joinAlignedDiffsExpand(diffs, options) : joinAlignedDiffsNoExpand(diffs, options)) + (truncated ? options.truncateAnnotationColor(`\n${options.truncateAnnotation}`) : \"\");\n}\nfunction diffLinesUnified(aLines, bLines, options) {\n  const normalizedOptions = normalizeDiffOptions(options);\n  const [diffs, truncated] = diffLinesRaw(\n    isEmptyString(aLines) ? [] : aLines,\n    isEmptyString(bLines) ? [] : bLines,\n    normalizedOptions\n  );\n  return printDiffLines(diffs, truncated, normalizedOptions);\n}\nfunction diffLinesUnified2(aLinesDisplay, bLinesDisplay, aLinesCompare, bLinesCompare, options) {\n  if (isEmptyString(aLinesDisplay) && isEmptyString(aLinesCompare)) {\n    aLinesDisplay = [];\n    aLinesCompare = [];\n  }\n  if (isEmptyString(bLinesDisplay) && isEmptyString(bLinesCompare)) {\n    bLinesDisplay = [];\n    bLinesCompare = [];\n  }\n  if (aLinesDisplay.length !== aLinesCompare.length || bLinesDisplay.length !== bLinesCompare.length) {\n    return diffLinesUnified(aLinesDisplay, bLinesDisplay, options);\n  }\n  const [diffs, truncated] = diffLinesRaw(\n    aLinesCompare,\n    bLinesCompare,\n    options\n  );\n  let aIndex = 0;\n  let bIndex = 0;\n  diffs.forEach((diff) => {\n    switch (diff[0]) {\n      case DIFF_DELETE:\n        diff[1] = aLinesDisplay[aIndex];\n        aIndex += 1;\n        break;\n      case DIFF_INSERT:\n        diff[1] = bLinesDisplay[bIndex];\n        bIndex += 1;\n        break;\n      default:\n        diff[1] = bLinesDisplay[bIndex];\n        aIndex += 1;\n        bIndex += 1;\n    }\n  });\n  return printDiffLines(diffs, truncated, normalizeDiffOptions(options));\n}\nfunction diffLinesRaw(aLines, bLines, options) {\n  const truncate = (options == null ? void 0 : options.truncateThreshold) ?? false;\n  const truncateThreshold = Math.max(\n    Math.floor((options == null ? void 0 : options.truncateThreshold) ?? 0),\n    0\n  );\n  const aLength = truncate ? Math.min(aLines.length, truncateThreshold) : aLines.length;\n  const bLength = truncate ? Math.min(bLines.length, truncateThreshold) : bLines.length;\n  const truncated = aLength !== aLines.length || bLength !== bLines.length;\n  const isCommon = (aIndex2, bIndex2) => aLines[aIndex2] === bLines[bIndex2];\n  const diffs = [];\n  let aIndex = 0;\n  let bIndex = 0;\n  const foundSubsequence = (nCommon, aCommon, bCommon) => {\n    for (; aIndex !== aCommon; aIndex += 1) {\n      diffs.push(new Diff(DIFF_DELETE, aLines[aIndex]));\n    }\n    for (; bIndex !== bCommon; bIndex += 1) {\n      diffs.push(new Diff(DIFF_INSERT, bLines[bIndex]));\n    }\n    for (; nCommon !== 0; nCommon -= 1, aIndex += 1, bIndex += 1) {\n      diffs.push(new Diff(DIFF_EQUAL, bLines[bIndex]));\n    }\n  };\n  diffSequences(aLength, bLength, isCommon, foundSubsequence);\n  for (; aIndex !== aLength; aIndex += 1) {\n    diffs.push(new Diff(DIFF_DELETE, aLines[aIndex]));\n  }\n  for (; bIndex !== bLength; bIndex += 1) {\n    diffs.push(new Diff(DIFF_INSERT, bLines[bIndex]));\n  }\n  return [diffs, truncated];\n}\n\nfunction getType(value) {\n  if (value === void 0) {\n    return \"undefined\";\n  } else if (value === null) {\n    return \"null\";\n  } else if (Array.isArray(value)) {\n    return \"array\";\n  } else if (typeof value === \"boolean\") {\n    return \"boolean\";\n  } else if (typeof value === \"function\") {\n    return \"function\";\n  } else if (typeof value === \"number\") {\n    return \"number\";\n  } else if (typeof value === \"string\") {\n    return \"string\";\n  } else if (typeof value === \"bigint\") {\n    return \"bigint\";\n  } else if (typeof value === \"object\") {\n    if (value != null) {\n      if (value.constructor === RegExp) {\n        return \"regexp\";\n      } else if (value.constructor === Map) {\n        return \"map\";\n      } else if (value.constructor === Set) {\n        return \"set\";\n      } else if (value.constructor === Date) {\n        return \"date\";\n      }\n    }\n    return \"object\";\n  } else if (typeof value === \"symbol\") {\n    return \"symbol\";\n  }\n  throw new Error(`value of unknown type: ${value}`);\n}\n\nfunction getNewLineSymbol(string) {\n  return string.includes(\"\\r\\n\") ? \"\\r\\n\" : \"\\n\";\n}\nfunction diffStrings(a, b, options) {\n  const truncate = (options == null ? void 0 : options.truncateThreshold) ?? false;\n  const truncateThreshold = Math.max(\n    Math.floor((options == null ? void 0 : options.truncateThreshold) ?? 0),\n    0\n  );\n  let aLength = a.length;\n  let bLength = b.length;\n  if (truncate) {\n    const aMultipleLines = a.includes(\"\\n\");\n    const bMultipleLines = b.includes(\"\\n\");\n    const aNewLineSymbol = getNewLineSymbol(a);\n    const bNewLineSymbol = getNewLineSymbol(b);\n    const _a = aMultipleLines ? `${a.split(aNewLineSymbol, truncateThreshold).join(aNewLineSymbol)}\n` : a;\n    const _b = bMultipleLines ? `${b.split(bNewLineSymbol, truncateThreshold).join(bNewLineSymbol)}\n` : b;\n    aLength = _a.length;\n    bLength = _b.length;\n  }\n  const truncated = aLength !== a.length || bLength !== b.length;\n  const isCommon = (aIndex2, bIndex2) => a[aIndex2] === b[bIndex2];\n  let aIndex = 0;\n  let bIndex = 0;\n  const diffs = [];\n  const foundSubsequence = (nCommon, aCommon, bCommon) => {\n    if (aIndex !== aCommon) {\n      diffs.push(new Diff(DIFF_DELETE, a.slice(aIndex, aCommon)));\n    }\n    if (bIndex !== bCommon) {\n      diffs.push(new Diff(DIFF_INSERT, b.slice(bIndex, bCommon)));\n    }\n    aIndex = aCommon + nCommon;\n    bIndex = bCommon + nCommon;\n    diffs.push(new Diff(DIFF_EQUAL, b.slice(bCommon, bIndex)));\n  };\n  diffSequences(aLength, bLength, isCommon, foundSubsequence);\n  if (aIndex !== aLength) {\n    diffs.push(new Diff(DIFF_DELETE, a.slice(aIndex)));\n  }\n  if (bIndex !== bLength) {\n    diffs.push(new Diff(DIFF_INSERT, b.slice(bIndex)));\n  }\n  return [diffs, truncated];\n}\n\nfunction concatenateRelevantDiffs(op, diffs, changeColor) {\n  return diffs.reduce(\n    (reduced, diff) => reduced + (diff[0] === DIFF_EQUAL ? diff[1] : diff[0] === op && diff[1].length !== 0 ? changeColor(diff[1]) : \"\"),\n    \"\"\n  );\n}\nclass ChangeBuffer {\n  op;\n  line;\n  // incomplete line\n  lines;\n  // complete lines\n  changeColor;\n  constructor(op, changeColor) {\n    this.op = op;\n    this.line = [];\n    this.lines = [];\n    this.changeColor = changeColor;\n  }\n  pushSubstring(substring) {\n    this.pushDiff(new Diff(this.op, substring));\n  }\n  pushLine() {\n    this.lines.push(\n      this.line.length !== 1 ? new Diff(\n        this.op,\n        concatenateRelevantDiffs(this.op, this.line, this.changeColor)\n      ) : this.line[0][0] === this.op ? this.line[0] : new Diff(this.op, this.line[0][1])\n      // was common diff\n    );\n    this.line.length = 0;\n  }\n  isLineEmpty() {\n    return this.line.length === 0;\n  }\n  // Minor input to buffer.\n  pushDiff(diff) {\n    this.line.push(diff);\n  }\n  // Main input to buffer.\n  align(diff) {\n    const string = diff[1];\n    if (string.includes(\"\\n\")) {\n      const substrings = string.split(\"\\n\");\n      const iLast = substrings.length - 1;\n      substrings.forEach((substring, i) => {\n        if (i < iLast) {\n          this.pushSubstring(substring);\n          this.pushLine();\n        } else if (substring.length !== 0) {\n          this.pushSubstring(substring);\n        }\n      });\n    } else {\n      this.pushDiff(diff);\n    }\n  }\n  // Output from buffer.\n  moveLinesTo(lines) {\n    if (!this.isLineEmpty()) {\n      this.pushLine();\n    }\n    lines.push(...this.lines);\n    this.lines.length = 0;\n  }\n}\nclass CommonBuffer {\n  deleteBuffer;\n  insertBuffer;\n  lines;\n  constructor(deleteBuffer, insertBuffer) {\n    this.deleteBuffer = deleteBuffer;\n    this.insertBuffer = insertBuffer;\n    this.lines = [];\n  }\n  pushDiffCommonLine(diff) {\n    this.lines.push(diff);\n  }\n  pushDiffChangeLines(diff) {\n    const isDiffEmpty = diff[1].length === 0;\n    if (!isDiffEmpty || this.deleteBuffer.isLineEmpty()) {\n      this.deleteBuffer.pushDiff(diff);\n    }\n    if (!isDiffEmpty || this.insertBuffer.isLineEmpty()) {\n      this.insertBuffer.pushDiff(diff);\n    }\n  }\n  flushChangeLines() {\n    this.deleteBuffer.moveLinesTo(this.lines);\n    this.insertBuffer.moveLinesTo(this.lines);\n  }\n  // Input to buffer.\n  align(diff) {\n    const op = diff[0];\n    const string = diff[1];\n    if (string.includes(\"\\n\")) {\n      const substrings = string.split(\"\\n\");\n      const iLast = substrings.length - 1;\n      substrings.forEach((substring, i) => {\n        if (i === 0) {\n          const subdiff = new Diff(op, substring);\n          if (this.deleteBuffer.isLineEmpty() && this.insertBuffer.isLineEmpty()) {\n            this.flushChangeLines();\n            this.pushDiffCommonLine(subdiff);\n          } else {\n            this.pushDiffChangeLines(subdiff);\n            this.flushChangeLines();\n          }\n        } else if (i < iLast) {\n          this.pushDiffCommonLine(new Diff(op, substring));\n        } else if (substring.length !== 0) {\n          this.pushDiffChangeLines(new Diff(op, substring));\n        }\n      });\n    } else {\n      this.pushDiffChangeLines(diff);\n    }\n  }\n  // Output from buffer.\n  getLines() {\n    this.flushChangeLines();\n    return this.lines;\n  }\n}\nfunction getAlignedDiffs(diffs, changeColor) {\n  const deleteBuffer = new ChangeBuffer(DIFF_DELETE, changeColor);\n  const insertBuffer = new ChangeBuffer(DIFF_INSERT, changeColor);\n  const commonBuffer = new CommonBuffer(deleteBuffer, insertBuffer);\n  diffs.forEach((diff) => {\n    switch (diff[0]) {\n      case DIFF_DELETE:\n        deleteBuffer.align(diff);\n        break;\n      case DIFF_INSERT:\n        insertBuffer.align(diff);\n        break;\n      default:\n        commonBuffer.align(diff);\n    }\n  });\n  return commonBuffer.getLines();\n}\n\nfunction hasCommonDiff(diffs, isMultiline) {\n  if (isMultiline) {\n    const iLast = diffs.length - 1;\n    return diffs.some(\n      (diff, i) => diff[0] === DIFF_EQUAL && (i !== iLast || diff[1] !== \"\\n\")\n    );\n  }\n  return diffs.some((diff) => diff[0] === DIFF_EQUAL);\n}\nfunction diffStringsUnified(a, b, options) {\n  if (a !== b && a.length !== 0 && b.length !== 0) {\n    const isMultiline = a.includes(\"\\n\") || b.includes(\"\\n\");\n    const [diffs, truncated] = diffStringsRaw(\n      isMultiline ? `${a}\n` : a,\n      isMultiline ? `${b}\n` : b,\n      true,\n      // cleanupSemantic\n      options\n    );\n    if (hasCommonDiff(diffs, isMultiline)) {\n      const optionsNormalized = normalizeDiffOptions(options);\n      const lines = getAlignedDiffs(diffs, optionsNormalized.changeColor);\n      return printDiffLines(lines, truncated, optionsNormalized);\n    }\n  }\n  return diffLinesUnified(a.split(\"\\n\"), b.split(\"\\n\"), options);\n}\nfunction diffStringsRaw(a, b, cleanup, options) {\n  const [diffs, truncated] = diffStrings(a, b, options);\n  if (cleanup) {\n    diff_cleanupSemantic(diffs);\n  }\n  return [diffs, truncated];\n}\n\nfunction getCommonMessage(message, options) {\n  const { commonColor } = normalizeDiffOptions(options);\n  return commonColor(message);\n}\nconst {\n  AsymmetricMatcher,\n  DOMCollection,\n  DOMElement,\n  Immutable,\n  ReactElement,\n  ReactTestComponent\n} = plugins;\nconst PLUGINS = [\n  ReactTestComponent,\n  ReactElement,\n  DOMElement,\n  DOMCollection,\n  Immutable,\n  AsymmetricMatcher\n];\nconst FORMAT_OPTIONS = {\n  plugins: PLUGINS\n};\nconst FALLBACK_FORMAT_OPTIONS = {\n  callToJSON: false,\n  maxDepth: 10,\n  plugins: PLUGINS\n};\nfunction diff(a, b, options) {\n  if (Object.is(a, b)) {\n    return \"\";\n  }\n  const aType = getType(a);\n  let expectedType = aType;\n  let omitDifference = false;\n  if (aType === \"object\" && typeof a.asymmetricMatch === \"function\") {\n    if (a.$$typeof !== Symbol.for(\"jest.asymmetricMatcher\")) {\n      return void 0;\n    }\n    if (typeof a.getExpectedType !== \"function\") {\n      return void 0;\n    }\n    expectedType = a.getExpectedType();\n    omitDifference = expectedType === \"string\";\n  }\n  if (expectedType !== getType(b)) {\n    const { aAnnotation, aColor, aIndicator, bAnnotation, bColor, bIndicator } = normalizeDiffOptions(options);\n    const formatOptions = getFormatOptions(FALLBACK_FORMAT_OPTIONS, options);\n    const aDisplay = format(a, formatOptions);\n    const bDisplay = format(b, formatOptions);\n    const aDiff = `${aColor(`${aIndicator} ${aAnnotation}:`)} \n${aDisplay}`;\n    const bDiff = `${bColor(`${bIndicator} ${bAnnotation}:`)} \n${bDisplay}`;\n    return `${aDiff}\n\n${bDiff}`;\n  }\n  if (omitDifference) {\n    return void 0;\n  }\n  switch (aType) {\n    case \"string\":\n      return diffLinesUnified(a.split(\"\\n\"), b.split(\"\\n\"), options);\n    case \"boolean\":\n    case \"number\":\n      return comparePrimitive(a, b, options);\n    case \"map\":\n      return compareObjects(sortMap(a), sortMap(b), options);\n    case \"set\":\n      return compareObjects(sortSet(a), sortSet(b), options);\n    default:\n      return compareObjects(a, b, options);\n  }\n}\nfunction comparePrimitive(a, b, options) {\n  const aFormat = format(a, FORMAT_OPTIONS);\n  const bFormat = format(b, FORMAT_OPTIONS);\n  return aFormat === bFormat ? \"\" : diffLinesUnified(aFormat.split(\"\\n\"), bFormat.split(\"\\n\"), options);\n}\nfunction sortMap(map) {\n  return new Map(Array.from(map.entries()).sort());\n}\nfunction sortSet(set) {\n  return new Set(Array.from(set.values()).sort());\n}\nfunction compareObjects(a, b, options) {\n  let difference;\n  let hasThrown = false;\n  try {\n    const formatOptions = getFormatOptions(FORMAT_OPTIONS, options);\n    difference = getObjectsDifference(a, b, formatOptions, options);\n  } catch {\n    hasThrown = true;\n  }\n  const noDiffMessage = getCommonMessage(NO_DIFF_MESSAGE, options);\n  if (difference === void 0 || difference === noDiffMessage) {\n    const formatOptions = getFormatOptions(FALLBACK_FORMAT_OPTIONS, options);\n    difference = getObjectsDifference(a, b, formatOptions, options);\n    if (difference !== noDiffMessage && !hasThrown) {\n      difference = `${getCommonMessage(\n        SIMILAR_MESSAGE,\n        options\n      )}\n\n${difference}`;\n    }\n  }\n  return difference;\n}\nfunction getFormatOptions(formatOptions, options) {\n  const { compareKeys } = normalizeDiffOptions(options);\n  return {\n    ...formatOptions,\n    compareKeys\n  };\n}\nfunction getObjectsDifference(a, b, formatOptions, options) {\n  const formatOptionsZeroIndent = { ...formatOptions, indent: 0 };\n  const aCompare = format(a, formatOptionsZeroIndent);\n  const bCompare = format(b, formatOptionsZeroIndent);\n  if (aCompare === bCompare) {\n    return getCommonMessage(NO_DIFF_MESSAGE, options);\n  } else {\n    const aDisplay = format(a, formatOptions);\n    const bDisplay = format(b, formatOptions);\n    return diffLinesUnified2(\n      aDisplay.split(\"\\n\"),\n      bDisplay.split(\"\\n\"),\n      aCompare.split(\"\\n\"),\n      bCompare.split(\"\\n\"),\n      options\n    );\n  }\n}\nconst MAX_DIFF_STRING_LENGTH = 2e4;\nfunction isAsymmetricMatcher(data) {\n  const type = getType$1(data);\n  return type === \"Object\" && typeof data.asymmetricMatch === \"function\";\n}\nfunction isReplaceable(obj1, obj2) {\n  const obj1Type = getType$1(obj1);\n  const obj2Type = getType$1(obj2);\n  return obj1Type === obj2Type && (obj1Type === \"Object\" || obj1Type === \"Array\");\n}\nfunction printDiffOrStringify(expected, received, options) {\n  const { aAnnotation, bAnnotation } = normalizeDiffOptions(options);\n  if (typeof expected === \"string\" && typeof received === \"string\" && expected.length > 0 && received.length > 0 && expected.length <= MAX_DIFF_STRING_LENGTH && received.length <= MAX_DIFF_STRING_LENGTH && expected !== received) {\n    if (expected.includes(\"\\n\") || received.includes(\"\\n\")) {\n      return diffStringsUnified(received, expected, options);\n    }\n    const [diffs] = diffStringsRaw(received, expected, true);\n    const hasCommonDiff = diffs.some((diff2) => diff2[0] === DIFF_EQUAL);\n    const printLabel = getLabelPrinter(aAnnotation, bAnnotation);\n    const expectedLine = printLabel(aAnnotation) + printExpected(\n      getCommonAndChangedSubstrings(diffs, DIFF_DELETE, hasCommonDiff)\n    );\n    const receivedLine = printLabel(bAnnotation) + printReceived(\n      getCommonAndChangedSubstrings(diffs, DIFF_INSERT, hasCommonDiff)\n    );\n    return `${expectedLine}\n${receivedLine}`;\n  }\n  const clonedExpected = deepClone(expected, { forceWritable: true });\n  const clonedReceived = deepClone(received, { forceWritable: true });\n  const { replacedExpected, replacedActual } = replaceAsymmetricMatcher(clonedExpected, clonedReceived);\n  const difference = diff(replacedExpected, replacedActual, options);\n  return difference;\n}\nfunction replaceAsymmetricMatcher(actual, expected, actualReplaced = /* @__PURE__ */ new WeakSet(), expectedReplaced = /* @__PURE__ */ new WeakSet()) {\n  if (!isReplaceable(actual, expected)) {\n    return { replacedActual: actual, replacedExpected: expected };\n  }\n  if (actualReplaced.has(actual) || expectedReplaced.has(expected)) {\n    return { replacedActual: actual, replacedExpected: expected };\n  }\n  actualReplaced.add(actual);\n  expectedReplaced.add(expected);\n  getOwnProperties(expected).forEach((key) => {\n    const expectedValue = expected[key];\n    const actualValue = actual[key];\n    if (isAsymmetricMatcher(expectedValue)) {\n      if (expectedValue.asymmetricMatch(actualValue)) {\n        actual[key] = expectedValue;\n      }\n    } else if (isAsymmetricMatcher(actualValue)) {\n      if (actualValue.asymmetricMatch(expectedValue)) {\n        expected[key] = actualValue;\n      }\n    } else if (isReplaceable(actualValue, expectedValue)) {\n      const replaced = replaceAsymmetricMatcher(\n        actualValue,\n        expectedValue,\n        actualReplaced,\n        expectedReplaced\n      );\n      actual[key] = replaced.replacedActual;\n      expected[key] = replaced.replacedExpected;\n    }\n  });\n  return {\n    replacedActual: actual,\n    replacedExpected: expected\n  };\n}\nfunction getLabelPrinter(...strings) {\n  const maxLength = strings.reduce(\n    (max, string) => string.length > max ? string.length : max,\n    0\n  );\n  return (string) => `${string}: ${\" \".repeat(maxLength - string.length)}`;\n}\nconst SPACE_SYMBOL = \"\\xB7\";\nfunction replaceTrailingSpaces(text) {\n  return text.replace(/\\s+$/gm, (spaces) => SPACE_SYMBOL.repeat(spaces.length));\n}\nfunction printReceived(object) {\n  return c.red(replaceTrailingSpaces(stringify(object)));\n}\nfunction printExpected(value) {\n  return c.green(replaceTrailingSpaces(stringify(value)));\n}\nfunction getCommonAndChangedSubstrings(diffs, op, hasCommonDiff) {\n  return diffs.reduce(\n    (reduced, diff2) => reduced + (diff2[0] === DIFF_EQUAL ? diff2[1] : diff2[0] === op ? hasCommonDiff ? c.inverse(diff2[1]) : diff2[1] : \"\"),\n    \"\"\n  );\n}\n\nexport { DIFF_DELETE, DIFF_EQUAL, DIFF_INSERT, Diff, diff, diffLinesRaw, diffLinesUnified, diffLinesUnified2, diffStringsRaw, diffStringsUnified, getLabelPrinter, printDiffOrStringify, replaceAsymmetricMatcher };\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;AAMA,MAAM,cAAc;AACpB,MAAM,cAAc;AACpB,MAAM,aAAa;AACnB,IAAM,OAAN,MAAW;CACT;CACA;CACA,YAAY,IAAI,MAAM;AACpB,OAAK,KAAK;AACV,OAAK,KAAK;;;AAGd,MAAM,oBAAoB,SAAS,OAAO,OAAO;AAC/C,KAAI,CAAC,SAAS,CAAC,SAAS,MAAM,OAAO,EAAE,KAAK,MAAM,OAAO,EAAE,CACzD,QAAO;CAET,IAAI,aAAa;CACjB,IAAI,aAAa,KAAK,IAAI,MAAM,QAAQ,MAAM,OAAO;CACrD,IAAI,aAAa;CACjB,IAAI,eAAe;AACnB,QAAO,aAAa,YAAY;AAC9B,MAAI,MAAM,UAAU,cAAc,WAAW,KAAK,MAAM,UAAU,cAAc,WAAW,EAAE;AAC3F,gBAAa;AACb,kBAAe;QAEf,cAAa;AAEf,eAAa,KAAK,OAAO,aAAa,cAAc,IAAI,WAAW;;AAErE,QAAO;;AAET,MAAM,oBAAoB,SAAS,OAAO,OAAO;AAC/C,KAAI,CAAC,SAAS,CAAC,SAAS,MAAM,OAAO,MAAM,SAAS,EAAE,KAAK,MAAM,OAAO,MAAM,SAAS,EAAE,CACvF,QAAO;CAET,IAAI,aAAa;CACjB,IAAI,aAAa,KAAK,IAAI,MAAM,QAAQ,MAAM,OAAO;CACrD,IAAI,aAAa;CACjB,IAAI,aAAa;AACjB,QAAO,aAAa,YAAY;AAC9B,MAAI,MAAM,UAAU,MAAM,SAAS,YAAY,MAAM,SAAS,WAAW,KAAK,MAAM,UAAU,MAAM,SAAS,YAAY,MAAM,SAAS,WAAW,EAAE;AACnJ,gBAAa;AACb,gBAAa;QAEb,cAAa;AAEf,eAAa,KAAK,OAAO,aAAa,cAAc,IAAI,WAAW;;AAErE,QAAO;;AAET,MAAM,sBAAsB,SAAS,OAAO,OAAO;CACjD,MAAM,eAAe,MAAM;CAC3B,MAAM,eAAe,MAAM;AAC3B,KAAI,iBAAiB,KAAK,iBAAiB,EACzC,QAAO;AAET,KAAI,eAAe,aACjB,SAAQ,MAAM,UAAU,eAAe,aAAa;UAC3C,eAAe,aACxB,SAAQ,MAAM,UAAU,GAAG,aAAa;CAE1C,MAAM,cAAc,KAAK,IAAI,cAAc,aAAa;AACxD,KAAI,UAAU,MACZ,QAAO;CAET,IAAI,OAAO;CACX,IAAI,SAAS;AACb,QAAO,MAAM;EACX,MAAM,UAAU,MAAM,UAAU,cAAc,OAAO;EACrD,MAAM,QAAQ,MAAM,QAAQ,QAAQ;AACpC,MAAI,UAAU,GACZ,QAAO;AAET,YAAU;AACV,MAAI,UAAU,KAAK,MAAM,UAAU,cAAc,OAAO,KAAK,MAAM,UAAU,GAAG,OAAO,EAAE;AACvF,UAAO;AACP;;;;AAIN,MAAM,uBAAuB,SAAS,OAAO;CAC3C,IAAI,UAAU;CACd,MAAM,aAAa,EAAE;CACrB,IAAI,mBAAmB;CACvB,IAAI,eAAe;CACnB,IAAI,UAAU;CACd,IAAI,qBAAqB;CACzB,IAAI,oBAAoB;CACxB,IAAI,qBAAqB;CACzB,IAAI,oBAAoB;AACxB,QAAO,UAAU,MAAM,QAAQ;AAC7B,MAAI,MAAM,SAAS,OAAO,YAAY;AACpC,cAAW,sBAAsB;AACjC,wBAAqB;AACrB,uBAAoB;AACpB,wBAAqB;AACrB,uBAAoB;AACpB,kBAAe,MAAM,SAAS;SACzB;AACL,OAAI,MAAM,SAAS,OAAO,YACxB,uBAAsB,MAAM,SAAS,GAAG;OAExC,sBAAqB,MAAM,SAAS,GAAG;AAEzC,OAAI,gBAAgB,aAAa,UAAU,KAAK,IAAI,oBAAoB,kBAAkB,IAAI,aAAa,UAAU,KAAK,IAAI,oBAAoB,kBAAkB,EAAE;AACpK,UAAM,OACJ,WAAW,mBAAmB,IAC9B,GACA,IAAI,KAAK,aAAa,aAAa,CACpC;AACD,UAAM,WAAW,mBAAmB,KAAK,GAAG,KAAK;AACjD;AACA;AACA,cAAU,mBAAmB,IAAI,WAAW,mBAAmB,KAAK;AACpE,yBAAqB;AACrB,wBAAoB;AACpB,yBAAqB;AACrB,wBAAoB;AACpB,mBAAe;AACf,cAAU;;;AAGd;;AAEF,KAAI,QACF,mBAAkB,MAAM;AAE1B,8BAA6B,MAAM;AACnC,WAAU;AACV,QAAO,UAAU,MAAM,QAAQ;AAC7B,MAAI,MAAM,UAAU,GAAG,OAAO,eAAe,MAAM,SAAS,OAAO,aAAa;GAC9E,MAAM,WAAW,MAAM,UAAU,GAAG;GACpC,MAAM,YAAY,MAAM,SAAS;GACjC,MAAM,kBAAkB,oBAAoB,UAAU,UAAU;GAChE,MAAM,kBAAkB,oBAAoB,WAAW,SAAS;AAChE,OAAI,mBAAmB,iBACrB;QAAI,mBAAmB,SAAS,SAAS,KAAK,mBAAmB,UAAU,SAAS,GAAG;AACrF,WAAM,OACJ,SACA,GACA,IAAI,KAAK,YAAY,UAAU,UAAU,GAAG,gBAAgB,CAAC,CAC9D;AACD,WAAM,UAAU,GAAG,KAAK,SAAS,UAC/B,GACA,SAAS,SAAS,gBACnB;AACD,WAAM,UAAU,GAAG,KAAK,UAAU,UAAU,gBAAgB;AAC5D;;cAGE,mBAAmB,SAAS,SAAS,KAAK,mBAAmB,UAAU,SAAS,GAAG;AACrF,UAAM,OACJ,SACA,GACA,IAAI,KAAK,YAAY,SAAS,UAAU,GAAG,gBAAgB,CAAC,CAC7D;AACD,UAAM,UAAU,GAAG,KAAK;AACxB,UAAM,UAAU,GAAG,KAAK,UAAU,UAChC,GACA,UAAU,SAAS,gBACpB;AACD,UAAM,UAAU,GAAG,KAAK;AACxB,UAAM,UAAU,GAAG,KAAK,SAAS,UAAU,gBAAgB;AAC3D;;AAGJ;;AAEF;;;AAGJ,MAAM,wBAAwB;AAC9B,MAAM,mBAAmB;AACzB,MAAM,kBAAkB;AACxB,MAAM,qBAAqB;AAC3B,MAAM,uBAAuB;AAC7B,SAAS,6BAA6B,OAAO;CAC3C,IAAI,UAAU;AACd,QAAO,UAAU,MAAM,SAAS,GAAG;AACjC,MAAI,MAAM,UAAU,GAAG,OAAO,cAAc,MAAM,UAAU,GAAG,OAAO,YAAY;GAChF,IAAI,YAAY,MAAM,UAAU,GAAG;GACnC,IAAI,OAAO,MAAM,SAAS;GAC1B,IAAI,YAAY,MAAM,UAAU,GAAG;GACnC,MAAM,eAAe,kBAAkB,WAAW,KAAK;AACvD,OAAI,cAAc;IAChB,MAAM,eAAe,KAAK,UAAU,KAAK,SAAS,aAAa;AAC/D,gBAAY,UAAU,UAAU,GAAG,UAAU,SAAS,aAAa;AACnE,WAAO,eAAe,KAAK,UAAU,GAAG,KAAK,SAAS,aAAa;AACnE,gBAAY,eAAe;;GAE7B,IAAI,gBAAgB;GACpB,IAAI,WAAW;GACf,IAAI,gBAAgB;GACpB,IAAI,YAAY,2BAA2B,WAAW,KAAK,GAAG,2BAA2B,MAAM,UAAU;AACzG,UAAO,KAAK,OAAO,EAAE,KAAK,UAAU,OAAO,EAAE,EAAE;AAC7C,iBAAa,KAAK,OAAO,EAAE;AAC3B,WAAO,KAAK,UAAU,EAAE,GAAG,UAAU,OAAO,EAAE;AAC9C,gBAAY,UAAU,UAAU,EAAE;IAClC,MAAM,QAAQ,2BAA2B,WAAW,KAAK,GAAG,2BAA2B,MAAM,UAAU;AACvG,QAAI,SAAS,WAAW;AACtB,iBAAY;AACZ,qBAAgB;AAChB,gBAAW;AACX,qBAAgB;;;AAGpB,OAAI,MAAM,UAAU,GAAG,OAAO,eAAe;AAC3C,QAAI,cACF,OAAM,UAAU,GAAG,KAAK;SACnB;AACL,WAAM,OAAO,UAAU,GAAG,EAAE;AAC5B;;AAEF,UAAM,SAAS,KAAK;AACpB,QAAI,cACF,OAAM,UAAU,GAAG,KAAK;SACnB;AACL,WAAM,OAAO,UAAU,GAAG,EAAE;AAC5B;;;;AAIN;;;AAGJ,SAAS,kBAAkB,OAAO;AAChC,OAAM,KAAK,IAAI,KAAK,YAAY,GAAG,CAAC;CACpC,IAAI,UAAU;CACd,IAAI,eAAe;CACnB,IAAI,eAAe;CACnB,IAAI,cAAc;CAClB,IAAI,cAAc;CAClB,IAAI;AACJ,QAAO,UAAU,MAAM,OACrB,SAAQ,MAAM,SAAS,IAAvB;EACE,KAAK;AACH;AACA,kBAAe,MAAM,SAAS;AAC9B;AACA;EACF,KAAK;AACH;AACA,kBAAe,MAAM,SAAS;AAC9B;AACA;EACF,KAAK;AACH,OAAI,eAAe,eAAe,GAAG;AACnC,QAAI,iBAAiB,KAAK,iBAAiB,GAAG;AAC5C,oBAAe,kBAAkB,aAAa,YAAY;AAC1D,SAAI,iBAAiB,GAAG;AACtB,UAAI,UAAU,eAAe,eAAe,KAAK,MAAM,UAAU,eAAe,eAAe,GAAG,OAAO,WACvG,OAAM,UAAU,eAAe,eAAe,GAAG,MAAM,YAAY,UAAU,GAAG,aAAa;WACxF;AACL,aAAM,OACJ,GACA,GACA,IAAI,KAAK,YAAY,YAAY,UAAU,GAAG,aAAa,CAAC,CAC7D;AACD;;AAEF,oBAAc,YAAY,UAAU,aAAa;AACjD,oBAAc,YAAY,UAAU,aAAa;;AAEnD,oBAAe,kBAAkB,aAAa,YAAY;AAC1D,SAAI,iBAAiB,GAAG;AACtB,YAAM,SAAS,KAAK,YAAY,UAAU,YAAY,SAAS,aAAa,GAAG,MAAM,SAAS;AAC9F,oBAAc,YAAY,UACxB,GACA,YAAY,SAAS,aACtB;AACD,oBAAc,YAAY,UACxB,GACA,YAAY,SAAS,aACtB;;;AAGL,eAAW,eAAe;AAC1B,UAAM,OAAO,SAAS,eAAe,aAAa;AAClD,QAAI,YAAY,QAAQ;AACtB,WAAM,OAAO,SAAS,GAAG,IAAI,KAAK,aAAa,YAAY,CAAC;AAC5D;;AAEF,QAAI,YAAY,QAAQ;AACtB,WAAM,OAAO,SAAS,GAAG,IAAI,KAAK,aAAa,YAAY,CAAC;AAC5D;;AAEF;cACS,YAAY,KAAK,MAAM,UAAU,GAAG,OAAO,YAAY;AAChE,UAAM,UAAU,GAAG,MAAM,MAAM,SAAS;AACxC,UAAM,OAAO,SAAS,EAAE;SAExB;AAEF,kBAAe;AACf,kBAAe;AACf,iBAAc;AACd,iBAAc;AACd;;AAGN,KAAI,MAAM,MAAM,SAAS,GAAG,OAAO,GACjC,OAAM,KAAK;CAEb,IAAI,UAAU;AACd,WAAU;AACV,QAAO,UAAU,MAAM,SAAS,GAAG;AACjC,MAAI,MAAM,UAAU,GAAG,OAAO,cAAc,MAAM,UAAU,GAAG,OAAO,YACpE;OAAI,MAAM,SAAS,GAAG,UACpB,MAAM,SAAS,GAAG,SAAS,MAAM,UAAU,GAAG,GAAG,OAClD,KAAK,MAAM,UAAU,GAAG,IAAI;AAC3B,UAAM,SAAS,KAAK,MAAM,UAAU,GAAG,KAAK,MAAM,SAAS,GAAG,UAC5D,GACA,MAAM,SAAS,GAAG,SAAS,MAAM,UAAU,GAAG,GAAG,OAClD;AACD,UAAM,UAAU,GAAG,KAAK,MAAM,UAAU,GAAG,KAAK,MAAM,UAAU,GAAG;AACnE,UAAM,OAAO,UAAU,GAAG,EAAE;AAC5B,cAAU;cACD,MAAM,SAAS,GAAG,UAAU,GAAG,MAAM,UAAU,GAAG,GAAG,OAAO,KAAK,MAAM,UAAU,GAAG,IAAI;AACjG,UAAM,UAAU,GAAG,MAAM,MAAM,UAAU,GAAG;AAC5C,UAAM,SAAS,KAAK,MAAM,SAAS,GAAG,UAAU,MAAM,UAAU,GAAG,GAAG,OAAO,GAAG,MAAM,UAAU,GAAG;AACnG,UAAM,OAAO,UAAU,GAAG,EAAE;AAC5B,cAAU;;;AAGd;;AAEF,KAAI,QACF,mBAAkB,MAAM;;AAG5B,SAAS,2BAA2B,KAAK,KAAK;AAC5C,KAAI,CAAC,OAAO,CAAC,IACX,QAAO;CAET,MAAM,QAAQ,IAAI,OAAO,IAAI,SAAS,EAAE;CACxC,MAAM,QAAQ,IAAI,OAAO,EAAE;CAC3B,MAAM,mBAAmB,MAAM,MAAM,sBAAsB;CAC3D,MAAM,mBAAmB,MAAM,MAAM,sBAAsB;CAC3D,MAAM,cAAc,oBAAoB,MAAM,MAAM,iBAAiB;CACrE,MAAM,cAAc,oBAAoB,MAAM,MAAM,iBAAiB;CACrE,MAAM,aAAa,eAAe,MAAM,MAAM,gBAAgB;CAC9D,MAAM,aAAa,eAAe,MAAM,MAAM,gBAAgB;CAC9D,MAAM,aAAa,cAAc,IAAI,MAAM,mBAAmB;CAC9D,MAAM,aAAa,cAAc,IAAI,MAAM,qBAAqB;AAChE,KAAI,cAAc,WAChB,QAAO;UACE,cAAc,WACvB,QAAO;UACE,oBAAoB,CAAC,eAAe,YAC7C,QAAO;UACE,eAAe,YACxB,QAAO;UACE,oBAAoB,iBAC7B,QAAO;AAET,QAAO;;AAGT,MAAM,kBAAkB;AACxB,MAAM,kBAAkB;AAExB,IAAI,QAAQ,EAAE;AAEd,IAAI;AAEJ,SAAS,eAAgB;AACxB,KAAI,iBAAkB,QAAO;AAC7B,oBAAmB;AAEnB,QAAO,eAAe,OAAO,cAAc,EACzC,OAAO,MACR,CAAC;AACF,OAAM,UAAU;;;;;;;;CAkEhB,MAAM,MAAM;CACZ,MAAM,cAAc;CAIpB,MAAM,qBAAqB,QAAQ,MAAM,QAAQ,MAAM,aAAa;EAClE,IAAI,UAAU;AACd,SAAO,SAAS,QAAQ,SAAS,QAAQ,SAAS,QAAQ,OAAO,EAAE;AACjE,aAAU;AACV,aAAU;AACV,cAAW;;AAEb,SAAO;;CAKT,MAAM,qBAAqB,QAAQ,QAAQ,QAAQ,QAAQ,aAAa;EACtE,IAAI,UAAU;AACd,SAAO,UAAU,UAAU,UAAU,UAAU,SAAS,QAAQ,OAAO,EAAE;AACvE,aAAU;AACV,aAAU;AACV,cAAW;;AAEb,SAAO;;CAKT,MAAM,gBACJ,GACA,MACA,MACA,IACA,UACA,WACA,UACG;EAEH,IAAI,KAAK;EACT,IAAI,KAAK,CAAC;EACV,IAAI,SAAS,UAAU;EACvB,IAAI,cAAc;AAClB,YAAU,OAAO,kBACf,SAAS,GACT,MACA,KAAK,SAAS,KAAK,GACnB,MACA,SACD;EAGD,MAAM,KAAK,IAAI,QAAQ,IAAI;AAG3B,OAAK,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;AAIjD,OAAI,OAAO,KAAK,cAAc,UAAU,IACtC,UAAS,UAAU;QACd;AACL,aAAS,cAAc;AAEvB,QAAI,QAAQ,OAEV,QAAO,KAAK;;AAKhB,iBAAc,UAAU;AACxB,aAAU,MACR,SACA,kBAAkB,SAAS,GAAG,MAAM,KAAK,SAAS,KAAK,GAAG,MAAM,SAAS;;AAE7E,SAAO;;CAKT,MAAM,gBACJ,GACA,QACA,QACA,IACA,UACA,WACA,UACG;EAEH,IAAI,KAAK;EACT,IAAI,KAAK;EACT,IAAI,SAAS,UAAU;EACvB,IAAI,cAAc;AAClB,YAAU,OAAO,kBACf,QACA,SAAS,GACT,QACA,KAAK,SAAS,KAAK,GACnB,SACD;EAGD,MAAM,KAAK,IAAI,QAAQ,IAAI;AAG3B,OAAK,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;AAIjD,OAAI,OAAO,KAAK,UAAU,MAAM,YAC9B,UAAS,UAAU;QACd;AACL,aAAS,cAAc;AAEvB,QAAI,SAAS,OAEX,QAAO,KAAK;;AAKhB,iBAAc,UAAU;AACxB,aAAU,MACR,SACA,kBACE,QACA,SAAS,GACT,QACA,KAAK,SAAS,KAAK,GACnB,SACD;;AAEL,SAAO;;CAKT,MAAM,4BACJ,GACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,aACG;EACH,MAAM,KAAK,SAAS;EACpB,MAAM,UAAU,OAAO;EAEvB,MAAM,gBADU,OAAO,SACS;EAGhC,MAAM,eAAe,CAAC,iBAAiB,IAAI;EAC3C,MAAM,eAAe,CAAC,iBAAiB,IAAI;EAE3C,IAAI,cAAc;EAGlB,MAAM,KAAK,IAAI,QAAQ,IAAI;AAG3B,OAAK,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;GAKpD,MAAM,SAAS,OAAO,KAAM,OAAO,KAAK,cAAc,UAAU;GAChE,MAAM,YAAY,SAAS,UAAU,MAAM;GAC3C,MAAM,SAAS,SACX,YACA,YAAY;GAGhB,MAAM,SAAS,KAAK,SAAS;GAC7B,MAAM,WAAW,kBACf,SAAS,GACT,MACA,SAAS,GACT,MACA,SACD;GACD,MAAM,QAAQ,SAAS;AACvB,iBAAc,UAAU;AACxB,aAAU,MAAM;AAChB,OAAI,gBAAgB,MAAM,MAAM,cAAc;IAI5C,MAAM,MAAM,IAAI,KAAK,KAAK,kBAAkB;AAI5C,QAAI,MAAM,SAAS,UAAU,MAAM,KAAK,OAAO;KAI7C,MAAM,YAAY,KAAK,aAAa,SAAS,KAAK,IAAI,KAAK;KAK3D,MAAM,WAAW,kBACf,QACA,WACA,QACA,WACA,SACD;KACD,MAAM,kBAAkB,YAAY;KACpC,MAAM,kBAAkB,YAAY;KACpC,MAAM,gBAAgB,kBAAkB;KACxC,MAAM,gBAAgB,kBAAkB;AACxC,cAAS,mBAAmB,IAAI;AAChC,SAAI,IAAI,MAAM,gBAAgB,gBAAgB,SAAS,QAAQ;AAI7D,eAAS,gBAAgB;AACzB,eAAS,gBAAgB;YACpB;AACL,eAAS,gBAAgB;AACzB,eAAS,gBAAgB;;AAE3B,cAAS,mBAAmB;AAC5B,SAAI,aAAa,GAAG;AAClB,eAAS,mBAAmB;AAC5B,eAAS,mBAAmB;;AAE9B,cAAS,mBAAmB;AAC5B,SAAI,aAAa,GAAG;AAClB,eAAS,mBAAmB,SAAS;AACrC,eAAS,mBAAmB,SAAS;;KAEvC,MAAM,kBAAkB,QAAQ;KAChC,MAAM,kBAAkB,SAAS,WAAW;AAC5C,cAAS,mBAAmB,IAAI;AAChC,SAAI,IAAI,MAAM,OAAO,OAAO,kBAAkB,iBAAiB;AAI7D,eAAS,kBAAkB;AAC3B,eAAS,kBAAkB;YACtB;AACL,eAAS,kBAAkB;AAC3B,eAAS,kBAAkB;;AAE7B,YAAO;;;;AAIb,SAAO;;CAKT,MAAM,4BACJ,GACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,aACG;EACH,MAAM,KAAK,OAAO;EAClB,MAAM,UAAU,OAAO;EAEvB,MAAM,gBADU,OAAO,SACS;EAGhC,MAAM,eAAe,gBAAgB;EACrC,MAAM,eAAe,gBAAgB;EAErC,IAAI,cAAc;EAGlB,MAAM,KAAK,IAAI,QAAQ,IAAI;AAG3B,OAAK,IAAI,KAAK,GAAG,KAAK,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;GAKnD,MAAM,SAAS,OAAO,KAAM,OAAO,KAAK,UAAU,MAAM;GACxD,MAAM,YAAY,SAAS,UAAU,MAAM;GAC3C,MAAM,SAAS,SACX,YACA,YAAY;GAGhB,MAAM,SAAS,KAAK,SAAS;GAC7B,MAAM,WAAW,kBACf,QACA,SAAS,GACT,QACA,SAAS,GACT,SACD;GACD,MAAM,QAAQ,SAAS;AACvB,iBAAc,UAAU;AACxB,aAAU,MAAM;AAChB,OAAI,gBAAgB,MAAM,MAAM,cAAc;IAI5C,MAAM,MAAM,KAAK,KAAK,kBAAkB;AAIxC,QAAI,MAAM,SAAS,QAAQ,KAAK,UAAU,KAAK;KAC7C,MAAM,QAAQ,SAAS;AACvB,cAAS,mBAAmB;AAC5B,SAAI,MAAM,QAAQ,QAAQ,SAAS,QAAQ;AAIzC,eAAS,gBAAgB;AACzB,eAAS,gBAAgB;YACpB;AACL,eAAS,gBAAgB;AACzB,eAAS,gBAAgB;;AAE3B,cAAS,mBAAmB;AAC5B,SAAI,aAAa,GAAG;AAElB,eAAS,mBAAmB;AAC5B,eAAS,mBAAmB;;AAE9B,cAAS,mBAAmB,IAAI;AAChC,SAAI,MAAM,GAAG;AAEX,eAAS,mBAAmB;AAC5B,eAAS,kBAAkB;AAC3B,eAAS,kBAAkB;YACtB;MAIL,MAAM,YAAY,KAAK,aAAa,SAAS,KAAK,IAAI,KAAK;MAK3D,MAAM,WAAW,kBACf,WACA,MACA,WACA,MACA,SACD;AACD,eAAS,mBAAmB;AAC5B,UAAI,aAAa,GAAG;AAElB,gBAAS,mBAAmB;AAC5B,gBAAS,mBAAmB;;MAE9B,MAAM,kBAAkB,YAAY;MACpC,MAAM,kBAAkB,YAAY;AAEpC,UAAI,IAAI,MAAM,OAAO,OAAO,kBAAkB,iBAAiB;AAI7D,gBAAS,kBAAkB;AAC3B,gBAAS,kBAAkB;aACtB;AACL,gBAAS,kBAAkB;AAC3B,gBAAS,kBAAkB;;;AAG/B,YAAO;;;;AAIb,SAAO;;CAQT,MAAM,UACJ,SACA,QACA,MACA,QACA,MACA,UACA,WACA,WACA,aACG;EACH,MAAM,KAAK,SAAS;EACpB,MAAM,KAAK,OAAO;EAClB,MAAM,UAAU,OAAO;EACvB,MAAM,UAAU,OAAO;EAQvB,MAAM,gBAAgB,UAAU;EAGhC,IAAI,QAAQ;EACZ,IAAI,QAAQ;AAGZ,YAAU,KAAK,SAAS;AACxB,YAAU,KAAK;AAEf,MAAI,gBAAgB,MAAM,GAAG;GAE3B,MAAM,QAAQ,WAAW,iBAAiB;GAC1C,MAAM,QAAQ,UAAU,WAAW;AACnC,QAAK,IAAI,IAAI,GAAG,KAAK,MAAM,KAAK,GAAG;AACjC,YAAQ,aAAa,GAAG,MAAM,MAAM,IAAI,UAAU,WAAW,MAAM;AACnE,QAAI,IAAI,KACN,SAAQ,aAAa,GAAG,QAAQ,QAAQ,IAAI,UAAU,WAAW,MAAM;aAIvE,yBACE,GACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,SACD,CAED;;SAGC;GAEL,MAAM,SAAS,WAAW,iBAAiB,KAAK;GAChD,MAAM,QAAQ,UAAU,UAAU,KAAK;GAOvC,IAAI,IAAI;AACR,WAAQ,aAAa,GAAG,MAAM,MAAM,IAAI,UAAU,WAAW,MAAM;AACnE,QAAK,KAAK,GAAG,KAAK,MAAM,KAAK,GAAG;AAC9B,YAAQ,aACN,IAAI,GACJ,QACA,QACA,IACA,UACA,WACA,MACD;AACD,QAAI,IAAI,KACN,SAAQ,aAAa,GAAG,MAAM,MAAM,IAAI,UAAU,WAAW,MAAM;aAInE,yBACE,GACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,SACD,CAED;;;;AAMN,QAAM,IAAI,MACR,GAAG,IAAI,sBAAsB,OAAO,QAAQ,KAAK,UAAU,OAAO,QAAQ,OAC3E;;CAUH,MAAM,oBACJ,SACA,QACA,MACA,QACA,MACA,YACA,WACA,WACA,WACA,aACG;AACH,MAAI,OAAO,SAAS,OAAO,QAAQ;AAGjC,gBAAa,CAAC;AACd,OAAI,cAAc,UAAU,WAAW,GAAG;IAExC,MAAM,EAAC,kBAAkB,aAAY,UAAU;AAC/C,cAAU,KAAK;KACb,mBAAmB,SAAS,SAAS,YAAY;AAC/C,uBAAiB,SAAS,SAAS,QAAQ;;KAE7C,WAAW,QAAQ,WAAW,SAAS,QAAQ,OAAO;KACvD;;GAEH,MAAM,SAAS;GACf,MAAM,OAAO;AACb,YAAS;AACT,UAAO;AACP,YAAS;AACT,UAAO;;EAET,MAAM,EAAC,kBAAkB,aAAY,UAAU,aAAa,IAAI;AAGhE,SACE,SACA,QACA,MACA,QACA,MACA,UACA,WACA,WACA,SACD;EACD,MAAM,EACJ,kBACA,eACA,eACA,kBACA,kBACA,kBACA,kBACA,kBACA,kBACA,kBACA,iBACA,oBACE;AAGJ,MAAI,SAAS,iBAAiB,SAAS,cAErC,kBACE,kBACA,QACA,eACA,QACA,eACA,YACA,WACA,WACA,WACA,SACD;AAIH,MAAI,qBAAqB,EACvB,kBAAiB,kBAAkB,kBAAkB,iBAAiB;AAExE,MAAI,qBAAqB,EACvB,kBAAiB,kBAAkB,kBAAkB,iBAAiB;AAIxE,MAAI,kBAAkB,QAAQ,kBAAkB,KAE9C,kBACE,kBACA,iBACA,MACA,iBACA,MACA,YACA,WACA,WACA,WACA,SACD;;CAGL,MAAM,kBAAkB,MAAM,QAAQ;AACpC,MAAI,OAAO,QAAQ,SACjB,OAAM,IAAI,UAAU,GAAG,IAAI,IAAI,KAAK,UAAU,OAAO,IAAI,kBAAkB;AAE7E,MAAI,CAAC,OAAO,cAAc,IAAI,CAC5B,OAAM,IAAI,WAAW,GAAG,IAAI,IAAI,KAAK,SAAS,IAAI,wBAAwB;AAE5E,MAAI,MAAM,EACR,OAAM,IAAI,WAAW,GAAG,IAAI,IAAI,KAAK,SAAS,IAAI,wBAAwB;;CAG9E,MAAM,oBAAoB,MAAM,QAAQ;EACtC,MAAM,OAAO,OAAO;AACpB,MAAI,SAAS,WACX,OAAM,IAAI,UAAU,GAAG,IAAI,IAAI,KAAK,UAAU,KAAK,oBAAoB;;CAQ3E,SAAS,aAAa,SAAS,SAAS,UAAU,kBAAkB;AAClE,iBAAe,WAAW,QAAQ;AAClC,iBAAe,WAAW,QAAQ;AAClC,mBAAiB,YAAY,SAAS;AACtC,mBAAiB,oBAAoB,iBAAiB;EAGtD,MAAM,WAAW,kBAAkB,GAAG,SAAS,GAAG,SAAS,SAAS;AACpE,MAAI,aAAa,EACf,kBAAiB,UAAU,GAAG,EAAE;AAKlC,MAAI,YAAY,YAAY,YAAY,UAAU;GAGhD,MAAM,SAAS;GACf,MAAM,SAAS;GAGf,MAAM,WAAW,kBACf,QACA,UAAU,GACV,QACA,UAAU,GACV,SACD;GAID,MAAM,OAAO,UAAU;GACvB,MAAM,OAAO,UAAU;GAKvB,MAAM,YAAY,WAAW;AAC7B,OAAI,YAAY,aAAa,YAAY,UAiCvC,kBAhCgB,GAkCd,QACA,MACA,QACA,MApCiB,OACD,CAChB;IACE;IACA;IACD,CACF,EAIiB,CAAC,YAAY,EAEb,CAAC,YAAY,EAGd;IACf,kBAAkB;IAClB,kBAAkB;IAClB,eAAe;IACf,iBAAiB;IACjB,kBAAkB;IAClB,kBAAkB;IAClB,eAAe;IACf,iBAAiB;IACjB,kBAAkB;IAClB,kBAAkB;IAClB,kBAAkB;IAClB,kBAAkB;IACnB,CAcA;AAEH,OAAI,aAAa,EACf,kBAAiB,UAAU,MAAM,KAAK;;;AAI5C,QAAO;;AAIR,IAAI,gBAA6B,wCADd,cAAc,CACqC;AAEtE,SAAS,qBAAqB,MAAM,wBAAwB;AAC1D,QAAO,KAAK,QAAQ,SAAS,UAAU,uBAAuB,MAAM,CAAC;;AAEvE,SAAS,cAAc,MAAM,eAAe,OAAO,WAAW,wBAAwB,iCAAiC;AACrH,QAAO,KAAK,WAAW,IAAI,MACzB,GAAG,UAAU,GAAG,qBAAqB,MAAM,uBAAuB,GACnE,GAAG,cAAc,MAAM,MAAM,UAAU,GAAG,iBAAiB,gCAAgC,WAAW,IAAI,MAAM,GAAG,UAAU,GAAG,kCAAkC,GAAG;;AAExK,SAAS,gBAAgB,MAAM,eAAe,EAC5C,QACA,YACA,8BACA,mCACC;AACD,QAAO,cACL,MACA,eACA,QACA,YACA,8BACA,gCACD;;AAEH,SAAS,gBAAgB,MAAM,eAAe,EAC5C,QACA,YACA,8BACA,mCACC;AACD,QAAO,cACL,MACA,eACA,QACA,YACA,8BACA,gCACD;;AAEH,SAAS,gBAAgB,MAAM,eAAe,EAC5C,aACA,iBACA,8BACA,mCACC;AACD,QAAO,cACL,MACA,eACA,aACA,iBACA,8BACA,gCACD;;AAEH,SAAS,gBAAgB,QAAQ,MAAM,QAAQ,MAAM,EAAE,cAAc;AACnE,QAAO,WACL,OAAO,SAAS,EAAE,GAAG,OAAO,OAAO,IAAI,SAAS,EAAE,GAAG,OAAO,OAAO,KACpE;;AAEH,SAAS,yBAAyB,OAAO,SAAS;CAChD,MAAM,UAAU,MAAM;CACtB,MAAM,gBAAgB,QAAQ;CAC9B,MAAM,iBAAiB,gBAAgB;CACvC,IAAI,UAAU;CACd,IAAI,wBAAwB;CAC5B,IAAI,0BAA0B;CAC9B,IAAI,IAAI;AACR,QAAO,MAAM,SAAS;EACpB,MAAM,SAAS;AACf,SAAO,MAAM,WAAW,MAAM,GAAG,OAAO,WACtC,MAAK;AAEP,MAAI,WAAW,EACb,KAAI,WAAW,GACb;OAAI,IAAI,eAAe;AACrB,eAAW,IAAI;AACf,4BAAwB;;aAEjB,MAAM,SAAS;GACxB,MAAM,IAAI,IAAI;AACd,OAAI,IAAI,eAAe;AACrB,eAAW,IAAI;AACf,4BAAwB;;SAErB;GACL,MAAM,IAAI,IAAI;AACd,OAAI,IAAI,gBAAgB;AACtB,eAAW,IAAI;AACf,+BAA2B;;;AAIjC,SAAO,MAAM,WAAW,MAAM,GAAG,OAAO,WACtC,MAAK;;CAGT,MAAM,WAAW,4BAA4B,KAAK;AAClD,KAAI,4BAA4B,EAC9B,YAAW,0BAA0B;UAC5B,sBACT,YAAW;CAEb,MAAM,QAAQ,UAAU;CACxB,MAAM,QAAQ,EAAE;CAChB,IAAI,aAAa;AACjB,KAAI,SACF,OAAM,KAAK,GAAG;CAEhB,IAAI,SAAS;CACb,IAAI,SAAS;CACb,IAAI,OAAO;CACX,IAAI,OAAO;CACX,MAAM,kBAAkB,SAAS;EAC/B,MAAM,IAAI,MAAM;AAChB,QAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC;AAClE,UAAQ;AACR,UAAQ;;CAEV,MAAM,kBAAkB,SAAS;EAC/B,MAAM,IAAI,MAAM;AAChB,QAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC;AAClE,UAAQ;;CAEV,MAAM,kBAAkB,SAAS;EAC/B,MAAM,IAAI,MAAM;AAChB,QAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC;AAClE,UAAQ;;AAEV,KAAI;AACJ,QAAO,MAAM,SAAS;EACpB,IAAI,SAAS;AACb,SAAO,MAAM,WAAW,MAAM,GAAG,OAAO,WACtC,MAAK;AAEP,MAAI,WAAW,EACb,KAAI,WAAW,GAAG;AAChB,OAAI,IAAI,eAAe;AACrB,aAAS,IAAI;AACb,aAAS;AACT,aAAS;AACT,WAAO;AACP,WAAO;;AAET,QAAK,IAAI,UAAU,QAAQ,YAAY,GAAG,WAAW,EACnD,gBAAe,MAAM,SAAS,GAAG;aAE1B,MAAM,SAAS;GACxB,MAAM,OAAO,IAAI,SAAS,gBAAgB,SAAS,gBAAgB;AACnE,QAAK,IAAI,UAAU,QAAQ,YAAY,MAAM,WAAW,EACtD,gBAAe,MAAM,SAAS,GAAG;SAE9B;GACL,MAAM,UAAU,IAAI;AACpB,OAAI,UAAU,gBAAgB;IAC5B,MAAM,OAAO,SAAS;AACtB,SAAK,IAAI,UAAU,QAAQ,YAAY,MAAM,WAAW,EACtD,gBAAe,MAAM,SAAS,GAAG;AAEnC,UAAM,cAAc,gBAClB,QACA,MACA,QACA,MACA,QACD;AACD,iBAAa,MAAM;AACnB,UAAM,KAAK,GAAG;IACd,MAAM,QAAQ,UAAU;AACxB,aAAS,OAAO;AAChB,aAAS,OAAO;AAChB,WAAO;AACP,WAAO;AACP,SAAK,IAAI,UAAU,IAAI,eAAe,YAAY,GAAG,WAAW,EAC9D,gBAAe,MAAM,SAAS,GAAG;SAGnC,MAAK,IAAI,UAAU,QAAQ,YAAY,GAAG,WAAW,EACnD,gBAAe,MAAM,SAAS,GAAG;;AAKzC,SAAO,MAAM,WAAW,MAAM,GAAG,OAAO,aAAa;AACnD,kBAAe,MAAM,GAAG,GAAG;AAC3B,QAAK;;AAEP,SAAO,MAAM,WAAW,MAAM,GAAG,OAAO,aAAa;AACnD,kBAAe,MAAM,GAAG,GAAG;AAC3B,QAAK;;;AAGT,KAAI,SACF,OAAM,cAAc,gBAAgB,QAAQ,MAAM,QAAQ,MAAM,QAAQ;AAE1E,QAAO,MAAM,KAAK,KAAK;;AAEzB,SAAS,uBAAuB,OAAO,SAAS;AAC9C,QAAO,MAAM,KAAK,MAAM,GAAG,WAAW;EACpC,MAAM,OAAO,KAAK;EAClB,MAAM,gBAAgB,MAAM,KAAK,MAAM,OAAO,SAAS;AACvD,UAAQ,KAAK,IAAb;GACE,KAAK,YACH,QAAO,gBAAgB,MAAM,eAAe,QAAQ;GACtD,KAAK,YACH,QAAO,gBAAgB,MAAM,eAAe,QAAQ;GACtD,QACE,QAAO,gBAAgB,MAAM,eAAe,QAAQ;;GAExD,CAAC,KAAK,KAAK;;AAGf,MAAM,WAAW,WAAW;AAC5B,MAAM,uBAAuB;AAC7B,MAAM,kCAAkC;AACxC,SAAS,oBAAoB;AAC3B,QAAO;EACL,aAAa;EACb,QAAQA,EAAE;EACV,YAAY;EACZ,aAAa;EACb,QAAQA,EAAE;EACV,YAAY;EACZ,aAAaA,EAAE;EACf,8BAA8B;EAC9B,aAAaA,EAAE;EACf,iBAAiB;EACjB,8BAA8B;EAC9B,aAAa,KAAK;EAClB,cAAc;EACd,iCAAiC;EACjC,QAAQ;EACR,qBAAqB;EACrB,qBAAqB;EACrB,YAAYA,EAAE;EACd,mBAAmB;EACnB,oBAAoB;EACpB,yBAAyB;EAC1B;;AAEH,SAAS,eAAe,aAAa;AACnC,QAAO,eAAe,OAAO,gBAAgB,aAAa,cAAc,KAAK;;AAE/E,SAAS,gBAAgB,cAAc;AACrC,QAAO,OAAO,iBAAiB,YAAY,OAAO,cAAc,aAAa,IAAI,gBAAgB,IAAI,eAAe;;AAEtH,SAAS,qBAAqB,UAAU,EAAE,EAAE;AAC1C,QAAO;EACL,GAAG,mBAAmB;EACtB,GAAG;EACH,aAAa,eAAe,QAAQ,YAAY;EAChD,cAAc,gBAAgB,QAAQ,aAAa;EACpD;;AAGH,SAAS,cAAc,OAAO;AAC5B,QAAO,MAAM,WAAW,KAAK,MAAM,GAAG,WAAW;;AAEnD,SAAS,aAAa,OAAO;CAC3B,IAAI,IAAI;CACR,IAAI,IAAI;AACR,OAAM,SAAS,SAAS;AACtB,UAAQ,KAAK,IAAb;GACE,KAAK;AACH,SAAK;AACL;GACF,KAAK;AACH,SAAK;AACL;;GAEJ;AACF,QAAO;EAAE;EAAG;EAAG;;AAEjB,SAAS,gBAAgB,EACvB,aACA,QACA,YACA,aACA,QACA,YACA,qBACA,uBACC,cAAc;AACf,KAAI,oBACF,QAAO;CAET,IAAI,QAAQ;CACZ,IAAI,QAAQ;AACZ,KAAI,qBAAqB;EACvB,MAAM,SAAS,OAAO,aAAa,EAAE;EACrC,MAAM,SAAS,OAAO,aAAa,EAAE;EACrC,MAAM,yBAAyB,YAAY,SAAS,YAAY;EAChE,MAAM,qBAAqB,IAAI,OAAO,KAAK,IAAI,GAAG,uBAAuB,CAAC;EAC1E,MAAM,qBAAqB,IAAI,OAAO,KAAK,IAAI,GAAG,CAAC,uBAAuB,CAAC;EAC3E,MAAM,oBAAoB,OAAO,SAAS,OAAO;EACjD,MAAM,gBAAgB,IAAI,OAAO,KAAK,IAAI,GAAG,kBAAkB,CAAC;EAChE,MAAM,gBAAgB,IAAI,OAAO,KAAK,IAAI,GAAG,CAAC,kBAAkB,CAAC;AACjE,UAAQ,GAAG,mBAAmB,IAAI,WAAW,GAAG,gBAAgB;AAChE,UAAQ,GAAG,mBAAmB,IAAI,WAAW,GAAG,gBAAgB;;CAElE,MAAM,IAAI,GAAG,WAAW,GAAG,cAAc;CACzC,MAAM,IAAI,GAAG,WAAW,GAAG,cAAc;AACzC,QAAO,GAAG,OAAO,EAAE,CAAC;EACpB,OAAO,EAAE,CAAC;;;;AAIZ,SAAS,eAAe,OAAO,WAAW,SAAS;AACjD,QAAO,gBAAgB,SAAS,aAAa,MAAM,CAAC,IAAI,QAAQ,SAAS,uBAAuB,OAAO,QAAQ,GAAG,yBAAyB,OAAO,QAAQ,KAAK,YAAY,QAAQ,wBAAwB;EAC3M,QAAQ,qBAAqB,GAAG;;AAElC,SAAS,iBAAiB,QAAQ,QAAQ,SAAS;CACjD,MAAM,oBAAoB,qBAAqB,QAAQ;CACvD,MAAM,CAAC,OAAO,aAAa,aACzB,cAAc,OAAO,GAAG,EAAE,GAAG,QAC7B,cAAc,OAAO,GAAG,EAAE,GAAG,QAC7B,kBACD;AACD,QAAO,eAAe,OAAO,WAAW,kBAAkB;;AAE5D,SAAS,kBAAkB,eAAe,eAAe,eAAe,eAAe,SAAS;AAC9F,KAAI,cAAc,cAAc,IAAI,cAAc,cAAc,EAAE;AAChE,kBAAgB,EAAE;AAClB,kBAAgB,EAAE;;AAEpB,KAAI,cAAc,cAAc,IAAI,cAAc,cAAc,EAAE;AAChE,kBAAgB,EAAE;AAClB,kBAAgB,EAAE;;AAEpB,KAAI,cAAc,WAAW,cAAc,UAAU,cAAc,WAAW,cAAc,OAC1F,QAAO,iBAAiB,eAAe,eAAe,QAAQ;CAEhE,MAAM,CAAC,OAAO,aAAa,aACzB,eACA,eACA,QACD;CACD,IAAI,SAAS;CACb,IAAI,SAAS;AACb,OAAM,SAAS,SAAS;AACtB,UAAQ,KAAK,IAAb;GACE,KAAK;AACH,SAAK,KAAK,cAAc;AACxB,cAAU;AACV;GACF,KAAK;AACH,SAAK,KAAK,cAAc;AACxB,cAAU;AACV;GACF;AACE,SAAK,KAAK,cAAc;AACxB,cAAU;AACV,cAAU;;GAEd;AACF,QAAO,eAAe,OAAO,WAAW,qBAAqB,QAAQ,CAAC;;AAExE,SAAS,aAAa,QAAQ,QAAQ,SAAS;CAC7C,MAAM,YAAY,WAAW,OAAO,KAAK,IAAI,QAAQ,sBAAsB;CAC3E,MAAM,oBAAoB,KAAK,IAC7B,KAAK,OAAO,WAAW,OAAO,KAAK,IAAI,QAAQ,sBAAsB,EAAE,EACvE,EACD;CACD,MAAM,UAAU,WAAW,KAAK,IAAI,OAAO,QAAQ,kBAAkB,GAAG,OAAO;CAC/E,MAAM,UAAU,WAAW,KAAK,IAAI,OAAO,QAAQ,kBAAkB,GAAG,OAAO;CAC/E,MAAM,YAAY,YAAY,OAAO,UAAU,YAAY,OAAO;CAClE,MAAM,YAAY,SAAS,YAAY,OAAO,aAAa,OAAO;CAClE,MAAM,QAAQ,EAAE;CAChB,IAAI,SAAS;CACb,IAAI,SAAS;CACb,MAAM,oBAAoB,SAAS,SAAS,YAAY;AACtD,SAAO,WAAW,SAAS,UAAU,EACnC,OAAM,KAAK,IAAI,KAAK,aAAa,OAAO,QAAQ,CAAC;AAEnD,SAAO,WAAW,SAAS,UAAU,EACnC,OAAM,KAAK,IAAI,KAAK,aAAa,OAAO,QAAQ,CAAC;AAEnD,SAAO,YAAY,GAAG,WAAW,GAAG,UAAU,GAAG,UAAU,EACzD,OAAM,KAAK,IAAI,KAAK,YAAY,OAAO,QAAQ,CAAC;;AAGpD,eAAc,SAAS,SAAS,UAAU,iBAAiB;AAC3D,QAAO,WAAW,SAAS,UAAU,EACnC,OAAM,KAAK,IAAI,KAAK,aAAa,OAAO,QAAQ,CAAC;AAEnD,QAAO,WAAW,SAAS,UAAU,EACnC,OAAM,KAAK,IAAI,KAAK,aAAa,OAAO,QAAQ,CAAC;AAEnD,QAAO,CAAC,OAAO,UAAU;;AAG3B,SAAS,QAAQ,OAAO;AACtB,KAAI,UAAU,KAAK,EACjB,QAAO;UACE,UAAU,KACnB,QAAO;UACE,MAAM,QAAQ,MAAM,CAC7B,QAAO;UACE,OAAO,UAAU,UAC1B,QAAO;UACE,OAAO,UAAU,WAC1B,QAAO;UACE,OAAO,UAAU,SAC1B,QAAO;UACE,OAAO,UAAU,SAC1B,QAAO;UACE,OAAO,UAAU,SAC1B,QAAO;UACE,OAAO,UAAU,UAAU;AACpC,MAAI,SAAS,MACX;OAAI,MAAM,gBAAgB,OACxB,QAAO;YACE,MAAM,gBAAgB,IAC/B,QAAO;YACE,MAAM,gBAAgB,IAC/B,QAAO;YACE,MAAM,gBAAgB,KAC/B,QAAO;;AAGX,SAAO;YACE,OAAO,UAAU,SAC1B,QAAO;AAET,OAAM,IAAI,MAAM,0BAA0B,QAAQ;;AAGpD,SAAS,iBAAiB,QAAQ;AAChC,QAAO,OAAO,SAAS,OAAO,GAAG,SAAS;;AAE5C,SAAS,YAAY,GAAG,GAAG,SAAS;CAClC,MAAM,YAAY,WAAW,OAAO,KAAK,IAAI,QAAQ,sBAAsB;CAC3E,MAAM,oBAAoB,KAAK,IAC7B,KAAK,OAAO,WAAW,OAAO,KAAK,IAAI,QAAQ,sBAAsB,EAAE,EACvE,EACD;CACD,IAAI,UAAU,EAAE;CAChB,IAAI,UAAU,EAAE;AAChB,KAAI,UAAU;EACZ,MAAM,iBAAiB,EAAE,SAAS,KAAK;EACvC,MAAM,iBAAiB,EAAE,SAAS,KAAK;EACvC,MAAM,iBAAiB,iBAAiB,EAAE;EAC1C,MAAM,iBAAiB,iBAAiB,EAAE;EAC1C,MAAM,KAAK,iBAAiB,GAAG,EAAE,MAAM,gBAAgB,kBAAkB,CAAC,KAAK,eAAe,CAAC;IAC/F;EACA,MAAM,KAAK,iBAAiB,GAAG,EAAE,MAAM,gBAAgB,kBAAkB,CAAC,KAAK,eAAe,CAAC;IAC/F;AACA,YAAU,GAAG;AACb,YAAU,GAAG;;CAEf,MAAM,YAAY,YAAY,EAAE,UAAU,YAAY,EAAE;CACxD,MAAM,YAAY,SAAS,YAAY,EAAE,aAAa,EAAE;CACxD,IAAI,SAAS;CACb,IAAI,SAAS;CACb,MAAM,QAAQ,EAAE;CAChB,MAAM,oBAAoB,SAAS,SAAS,YAAY;AACtD,MAAI,WAAW,QACb,OAAM,KAAK,IAAI,KAAK,aAAa,EAAE,MAAM,QAAQ,QAAQ,CAAC,CAAC;AAE7D,MAAI,WAAW,QACb,OAAM,KAAK,IAAI,KAAK,aAAa,EAAE,MAAM,QAAQ,QAAQ,CAAC,CAAC;AAE7D,WAAS,UAAU;AACnB,WAAS,UAAU;AACnB,QAAM,KAAK,IAAI,KAAK,YAAY,EAAE,MAAM,SAAS,OAAO,CAAC,CAAC;;AAE5D,eAAc,SAAS,SAAS,UAAU,iBAAiB;AAC3D,KAAI,WAAW,QACb,OAAM,KAAK,IAAI,KAAK,aAAa,EAAE,MAAM,OAAO,CAAC,CAAC;AAEpD,KAAI,WAAW,QACb,OAAM,KAAK,IAAI,KAAK,aAAa,EAAE,MAAM,OAAO,CAAC,CAAC;AAEpD,QAAO,CAAC,OAAO,UAAU;;AAG3B,SAAS,yBAAyB,IAAI,OAAO,aAAa;AACxD,QAAO,MAAM,QACV,SAAS,SAAS,WAAW,KAAK,OAAO,aAAa,KAAK,KAAK,KAAK,OAAO,MAAM,KAAK,GAAG,WAAW,IAAI,YAAY,KAAK,GAAG,GAAG,KACjI,GACD;;AAEH,IAAM,eAAN,MAAmB;CACjB;CACA;CAEA;CAEA;CACA,YAAY,IAAI,aAAa;AAC3B,OAAK,KAAK;AACV,OAAK,OAAO,EAAE;AACd,OAAK,QAAQ,EAAE;AACf,OAAK,cAAc;;CAErB,cAAc,WAAW;AACvB,OAAK,SAAS,IAAI,KAAK,KAAK,IAAI,UAAU,CAAC;;CAE7C,WAAW;AACT,OAAK,MAAM,KACT,KAAK,KAAK,WAAW,IAAI,IAAI,KAC3B,KAAK,IACL,yBAAyB,KAAK,IAAI,KAAK,MAAM,KAAK,YAAY,CAC/D,GAAG,KAAK,KAAK,GAAG,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,GAAG,GAAG,CAEpF;AACD,OAAK,KAAK,SAAS;;CAErB,cAAc;AACZ,SAAO,KAAK,KAAK,WAAW;;CAG9B,SAAS,MAAM;AACb,OAAK,KAAK,KAAK,KAAK;;CAGtB,MAAM,MAAM;EACV,MAAM,SAAS,KAAK;AACpB,MAAI,OAAO,SAAS,KAAK,EAAE;GACzB,MAAM,aAAa,OAAO,MAAM,KAAK;GACrC,MAAM,QAAQ,WAAW,SAAS;AAClC,cAAW,SAAS,WAAW,MAAM;AACnC,QAAI,IAAI,OAAO;AACb,UAAK,cAAc,UAAU;AAC7B,UAAK,UAAU;eACN,UAAU,WAAW,EAC9B,MAAK,cAAc,UAAU;KAE/B;QAEF,MAAK,SAAS,KAAK;;CAIvB,YAAY,OAAO;AACjB,MAAI,CAAC,KAAK,aAAa,CACrB,MAAK,UAAU;AAEjB,QAAM,KAAK,GAAG,KAAK,MAAM;AACzB,OAAK,MAAM,SAAS;;;AAGxB,IAAM,eAAN,MAAmB;CACjB;CACA;CACA;CACA,YAAY,cAAc,cAAc;AACtC,OAAK,eAAe;AACpB,OAAK,eAAe;AACpB,OAAK,QAAQ,EAAE;;CAEjB,mBAAmB,MAAM;AACvB,OAAK,MAAM,KAAK,KAAK;;CAEvB,oBAAoB,MAAM;EACxB,MAAM,cAAc,KAAK,GAAG,WAAW;AACvC,MAAI,CAAC,eAAe,KAAK,aAAa,aAAa,CACjD,MAAK,aAAa,SAAS,KAAK;AAElC,MAAI,CAAC,eAAe,KAAK,aAAa,aAAa,CACjD,MAAK,aAAa,SAAS,KAAK;;CAGpC,mBAAmB;AACjB,OAAK,aAAa,YAAY,KAAK,MAAM;AACzC,OAAK,aAAa,YAAY,KAAK,MAAM;;CAG3C,MAAM,MAAM;EACV,MAAM,KAAK,KAAK;EAChB,MAAM,SAAS,KAAK;AACpB,MAAI,OAAO,SAAS,KAAK,EAAE;GACzB,MAAM,aAAa,OAAO,MAAM,KAAK;GACrC,MAAM,QAAQ,WAAW,SAAS;AAClC,cAAW,SAAS,WAAW,MAAM;AACnC,QAAI,MAAM,GAAG;KACX,MAAM,UAAU,IAAI,KAAK,IAAI,UAAU;AACvC,SAAI,KAAK,aAAa,aAAa,IAAI,KAAK,aAAa,aAAa,EAAE;AACtE,WAAK,kBAAkB;AACvB,WAAK,mBAAmB,QAAQ;YAC3B;AACL,WAAK,oBAAoB,QAAQ;AACjC,WAAK,kBAAkB;;eAEhB,IAAI,MACb,MAAK,mBAAmB,IAAI,KAAK,IAAI,UAAU,CAAC;aACvC,UAAU,WAAW,EAC9B,MAAK,oBAAoB,IAAI,KAAK,IAAI,UAAU,CAAC;KAEnD;QAEF,MAAK,oBAAoB,KAAK;;CAIlC,WAAW;AACT,OAAK,kBAAkB;AACvB,SAAO,KAAK;;;AAGhB,SAAS,gBAAgB,OAAO,aAAa;CAC3C,MAAM,eAAe,IAAI,aAAa,aAAa,YAAY;CAC/D,MAAM,eAAe,IAAI,aAAa,aAAa,YAAY;CAC/D,MAAM,eAAe,IAAI,aAAa,cAAc,aAAa;AACjE,OAAM,SAAS,SAAS;AACtB,UAAQ,KAAK,IAAb;GACE,KAAK;AACH,iBAAa,MAAM,KAAK;AACxB;GACF,KAAK;AACH,iBAAa,MAAM,KAAK;AACxB;GACF,QACE,cAAa,MAAM,KAAK;;GAE5B;AACF,QAAO,aAAa,UAAU;;AAGhC,SAAS,cAAc,OAAO,aAAa;AACzC,KAAI,aAAa;EACf,MAAM,QAAQ,MAAM,SAAS;AAC7B,SAAO,MAAM,MACV,MAAM,MAAM,KAAK,OAAO,eAAe,MAAM,SAAS,KAAK,OAAO,MACpE;;AAEH,QAAO,MAAM,MAAM,SAAS,KAAK,OAAO,WAAW;;AAErD,SAAS,mBAAmB,GAAG,GAAG,SAAS;AACzC,KAAI,MAAM,KAAK,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG;EAC/C,MAAM,cAAc,EAAE,SAAS,KAAK,IAAI,EAAE,SAAS,KAAK;EACxD,MAAM,CAAC,OAAO,aAAa,eACzB,cAAc,GAAG,EAAE;IACrB,GACE,cAAc,GAAG,EAAE;IACrB,GACE,MAEA,QACD;AACD,MAAI,cAAc,OAAO,YAAY,EAAE;GACrC,MAAM,oBAAoB,qBAAqB,QAAQ;AAEvD,UAAO,eADO,gBAAgB,OAAO,kBAAkB,YAAY,EACtC,WAAW,kBAAkB;;;AAG9D,QAAO,iBAAiB,EAAE,MAAM,KAAK,EAAE,EAAE,MAAM,KAAK,EAAE,QAAQ;;AAEhE,SAAS,eAAe,GAAG,GAAG,SAAS,SAAS;CAC9C,MAAM,CAAC,OAAO,aAAa,YAAY,GAAG,GAAG,QAAQ;AACrD,KAAI,QACF,sBAAqB,MAAM;AAE7B,QAAO,CAAC,OAAO,UAAU;;AAG3B,SAAS,iBAAiB,SAAS,SAAS;CAC1C,MAAM,EAAE,gBAAgB,qBAAqB,QAAQ;AACrD,QAAO,YAAY,QAAQ;;AAE7B,MAAM,EACJ,mBACA,eACA,YACA,WACA,cACA,uBACE;AACJ,MAAM,UAAU;CACd;CACA;CACA;CACA;CACA;CACA;CACD;AACD,MAAM,iBAAiB,EACrB,SAAS,SACV;AACD,MAAM,0BAA0B;CAC9B,YAAY;CACZ,UAAU;CACV,SAAS;CACV;AACD,SAAS,KAAK,GAAG,GAAG,SAAS;AAC3B,KAAI,OAAO,GAAG,GAAG,EAAE,CACjB,QAAO;CAET,MAAM,QAAQ,QAAQ,EAAE;CACxB,IAAI,eAAe;CACnB,IAAI,iBAAiB;AACrB,KAAI,UAAU,YAAY,OAAO,EAAE,oBAAoB,YAAY;AACjE,MAAI,EAAE,aAAa,OAAO,IAAI,yBAAyB,CACrD;AAEF,MAAI,OAAO,EAAE,oBAAoB,WAC/B;AAEF,iBAAe,EAAE,iBAAiB;AAClC,mBAAiB,iBAAiB;;AAEpC,KAAI,iBAAiB,QAAQ,EAAE,EAAE;EAC/B,MAAM,EAAE,aAAa,QAAQ,YAAY,aAAa,QAAQ,eAAe,qBAAqB,QAAQ;EAC1G,MAAM,gBAAgB,iBAAiB,yBAAyB,QAAQ;EACxE,MAAM,WAAW,OAAO,GAAG,cAAc;EACzC,MAAM,WAAW,OAAO,GAAG,cAAc;AAKzC,SAAO,GAJO,GAAG,OAAO,GAAG,WAAW,GAAG,YAAY,GAAG,CAAC;EAC3D,WAGkB;;EAFF,GAAG,OAAO,GAAG,WAAW,GAAG,YAAY,GAAG,CAAC;EAC3D;;AAKA,KAAI,eACF;AAEF,SAAQ,OAAR;EACE,KAAK,SACH,QAAO,iBAAiB,EAAE,MAAM,KAAK,EAAE,EAAE,MAAM,KAAK,EAAE,QAAQ;EAChE,KAAK;EACL,KAAK,SACH,QAAO,iBAAiB,GAAG,GAAG,QAAQ;EACxC,KAAK,MACH,QAAO,eAAe,QAAQ,EAAE,EAAE,QAAQ,EAAE,EAAE,QAAQ;EACxD,KAAK,MACH,QAAO,eAAe,QAAQ,EAAE,EAAE,QAAQ,EAAE,EAAE,QAAQ;EACxD,QACE,QAAO,eAAe,GAAG,GAAG,QAAQ;;;AAG1C,SAAS,iBAAiB,GAAG,GAAG,SAAS;CACvC,MAAM,UAAU,OAAO,GAAG,eAAe;CACzC,MAAM,UAAU,OAAO,GAAG,eAAe;AACzC,QAAO,YAAY,UAAU,KAAK,iBAAiB,QAAQ,MAAM,KAAK,EAAE,QAAQ,MAAM,KAAK,EAAE,QAAQ;;AAEvG,SAAS,QAAQ,KAAK;AACpB,QAAO,IAAI,IAAI,MAAM,KAAK,IAAI,SAAS,CAAC,CAAC,MAAM,CAAC;;AAElD,SAAS,QAAQ,KAAK;AACpB,QAAO,IAAI,IAAI,MAAM,KAAK,IAAI,QAAQ,CAAC,CAAC,MAAM,CAAC;;AAEjD,SAAS,eAAe,GAAG,GAAG,SAAS;CACrC,IAAI;CACJ,IAAI,YAAY;AAChB,KAAI;AAEF,eAAa,qBAAqB,GAAG,GADf,iBAAiB,gBAAgB,QAAQ,EACR,QAAQ;SACzD;AACN,cAAY;;CAEd,MAAM,gBAAgB,iBAAiB,iBAAiB,QAAQ;AAChE,KAAI,eAAe,KAAK,KAAK,eAAe,eAAe;AAEzD,eAAa,qBAAqB,GAAG,GADf,iBAAiB,yBAAyB,QAAQ,EACjB,QAAQ;AAC/D,MAAI,eAAe,iBAAiB,CAAC,UACnC,cAAa,GAAG,iBACd,iBACA,QACD,CAAC;;EAEN;;AAGA,QAAO;;AAET,SAAS,iBAAiB,eAAe,SAAS;CAChD,MAAM,EAAE,gBAAgB,qBAAqB,QAAQ;AACrD,QAAO;EACL,GAAG;EACH;EACD;;AAEH,SAAS,qBAAqB,GAAG,GAAG,eAAe,SAAS;CAC1D,MAAM,0BAA0B;EAAE,GAAG;EAAe,QAAQ;EAAG;CAC/D,MAAM,WAAW,OAAO,GAAG,wBAAwB;CACnD,MAAM,WAAW,OAAO,GAAG,wBAAwB;AACnD,KAAI,aAAa,SACf,QAAO,iBAAiB,iBAAiB,QAAQ;MAC5C;EACL,MAAM,WAAW,OAAO,GAAG,cAAc;EACzC,MAAM,WAAW,OAAO,GAAG,cAAc;AACzC,SAAO,kBACL,SAAS,MAAM,KAAK,EACpB,SAAS,MAAM,KAAK,EACpB,SAAS,MAAM,KAAK,EACpB,SAAS,MAAM,KAAK,EACpB,QACD;;;AAGL,MAAM,yBAAyB;AAC/B,SAAS,oBAAoB,MAAM;AAEjC,QADa,UAAU,KAAK,KACZ,YAAY,OAAO,KAAK,oBAAoB;;AAE9D,SAAS,cAAc,MAAM,MAAM;CACjC,MAAM,WAAW,UAAU,KAAK;AAEhC,QAAO,aADU,UAAU,KAAK,KACC,aAAa,YAAY,aAAa;;AAEzE,SAAS,qBAAqB,UAAU,UAAU,SAAS;CACzD,MAAM,EAAE,aAAa,gBAAgB,qBAAqB,QAAQ;AAClE,KAAI,OAAO,aAAa,YAAY,OAAO,aAAa,YAAY,SAAS,SAAS,KAAK,SAAS,SAAS,KAAK,SAAS,UAAU,0BAA0B,SAAS,UAAU,0BAA0B,aAAa,UAAU;AACjO,MAAI,SAAS,SAAS,KAAK,IAAI,SAAS,SAAS,KAAK,CACpD,QAAO,mBAAmB,UAAU,UAAU,QAAQ;EAExD,MAAM,CAAC,SAAS,eAAe,UAAU,UAAU,KAAK;EACxD,MAAM,gBAAgB,MAAM,MAAM,UAAU,MAAM,OAAO,WAAW;EACpE,MAAM,aAAa,gBAAgB,aAAa,YAAY;AAO5D,SAAO,GANc,WAAW,YAAY,GAAG,cAC7C,8BAA8B,OAAO,aAAa,cAAc,CACjE,CAIsB;EAHF,WAAW,YAAY,GAAG,cAC7C,8BAA8B,OAAO,aAAa,cAAc,CACjE;;CAMH,MAAM,EAAE,kBAAkB,mBAAmB,yBAFtB,UAAU,UAAU,EAAE,eAAe,MAAM,CAAC,EAC5C,UAAU,UAAU,EAAE,eAAe,MAAM,CAAC,CACkC;AAErG,QADmB,KAAK,kBAAkB,gBAAgB,QAAQ;;AAGpE,SAAS,yBAAyB,QAAQ,UAAU,iCAAiC,IAAI,SAAS,EAAE,mCAAmC,IAAI,SAAS,EAAE;AACpJ,KAAI,CAAC,cAAc,QAAQ,SAAS,CAClC,QAAO;EAAE,gBAAgB;EAAQ,kBAAkB;EAAU;AAE/D,KAAI,eAAe,IAAI,OAAO,IAAI,iBAAiB,IAAI,SAAS,CAC9D,QAAO;EAAE,gBAAgB;EAAQ,kBAAkB;EAAU;AAE/D,gBAAe,IAAI,OAAO;AAC1B,kBAAiB,IAAI,SAAS;AAC9B,kBAAiB,SAAS,CAAC,SAAS,QAAQ;EAC1C,MAAM,gBAAgB,SAAS;EAC/B,MAAM,cAAc,OAAO;AAC3B,MAAI,oBAAoB,cAAc,EACpC;OAAI,cAAc,gBAAgB,YAAY,CAC5C,QAAO,OAAO;aAEP,oBAAoB,YAAY,EACzC;OAAI,YAAY,gBAAgB,cAAc,CAC5C,UAAS,OAAO;aAET,cAAc,aAAa,cAAc,EAAE;GACpD,MAAM,WAAW,yBACf,aACA,eACA,gBACA,iBACD;AACD,UAAO,OAAO,SAAS;AACvB,YAAS,OAAO,SAAS;;GAE3B;AACF,QAAO;EACL,gBAAgB;EAChB,kBAAkB;EACnB;;AAEH,SAAS,gBAAgB,GAAG,SAAS;CACnC,MAAM,YAAY,QAAQ,QACvB,KAAK,WAAW,OAAO,SAAS,MAAM,OAAO,SAAS,KACvD,EACD;AACD,SAAQ,WAAW,GAAG,OAAO,IAAI,IAAI,OAAO,YAAY,OAAO,OAAO;;AAExE,MAAM,eAAe;AACrB,SAAS,sBAAsB,MAAM;AACnC,QAAO,KAAK,QAAQ,WAAW,WAAW,aAAa,OAAO,OAAO,OAAO,CAAC;;AAE/E,SAAS,cAAc,QAAQ;AAC7B,QAAOA,EAAE,IAAI,sBAAsB,UAAU,OAAO,CAAC,CAAC;;AAExD,SAAS,cAAc,OAAO;AAC5B,QAAOA,EAAE,MAAM,sBAAsB,UAAU,MAAM,CAAC,CAAC;;AAEzD,SAAS,8BAA8B,OAAO,IAAI,eAAe;AAC/D,QAAO,MAAM,QACV,SAAS,UAAU,WAAW,MAAM,OAAO,aAAa,MAAM,KAAK,MAAM,OAAO,KAAK,gBAAgBA,EAAE,QAAQ,MAAM,GAAG,GAAG,MAAM,KAAK,KACvI,GACD"}

package/dist/node_modules/@vitest/utils/dist/error.mjs

@@ -0,0 +1,92 @@
+import "../../../tinyrainbow/dist/node.mjs";
+import "../../../loupe/lib/index.mjs";
+import { format, stringify } from "./chunk-_commonjsHelpers.mjs";
+import { printDiffOrStringify } from "./diff.mjs";
+
+//#region node_modules/@vitest/utils/dist/error.js
+const IS_RECORD_SYMBOL = "@@__IMMUTABLE_RECORD__@@";
+const IS_COLLECTION_SYMBOL = "@@__IMMUTABLE_ITERABLE__@@";
+function isImmutable(v) {
+	return v && (v[IS_COLLECTION_SYMBOL] || v[IS_RECORD_SYMBOL]);
+}
+const OBJECT_PROTO = Object.getPrototypeOf({});
+function getUnserializableMessage(err) {
+	if (err instanceof Error) return `<unserializable>: ${err.message}`;
+	if (typeof err === "string") return `<unserializable>: ${err}`;
+	return "<unserializable>";
+}
+function serializeValue(val, seen = /* @__PURE__ */ new WeakMap()) {
+	if (!val || typeof val === "string") return val;
+	if (typeof val === "function") return `Function<${val.name || "anonymous"}>`;
+	if (typeof val === "symbol") return val.toString();
+	if (typeof val !== "object") return val;
+	if (isImmutable(val)) return serializeValue(val.toJSON(), seen);
+	if (val instanceof Promise || val.constructor && val.constructor.prototype === "AsyncFunction") return "Promise";
+	if (typeof Element !== "undefined" && val instanceof Element) return val.tagName;
+	if (typeof val.asymmetricMatch === "function") return `${val.toString()} ${format(val.sample)}`;
+	if (typeof val.toJSON === "function") return serializeValue(val.toJSON(), seen);
+	if (seen.has(val)) return seen.get(val);
+	if (Array.isArray(val)) {
+		const clone = new Array(val.length);
+		seen.set(val, clone);
+		val.forEach((e, i) => {
+			try {
+				clone[i] = serializeValue(e, seen);
+			} catch (err) {
+				clone[i] = getUnserializableMessage(err);
+			}
+		});
+		return clone;
+	} else {
+		const clone = /* @__PURE__ */ Object.create(null);
+		seen.set(val, clone);
+		let obj = val;
+		while (obj && obj !== OBJECT_PROTO) {
+			Object.getOwnPropertyNames(obj).forEach((key) => {
+				if (key in clone) return;
+				try {
+					clone[key] = serializeValue(val[key], seen);
+				} catch (err) {
+					delete clone[key];
+					clone[key] = getUnserializableMessage(err);
+				}
+			});
+			obj = Object.getPrototypeOf(obj);
+		}
+		return clone;
+	}
+}
+function normalizeErrorMessage(message) {
+	return message.replace(/__(vite_ssr_import|vi_import)_\d+__\./g, "");
+}
+function processError(_err, diffOptions, seen = /* @__PURE__ */ new WeakSet()) {
+	if (!_err || typeof _err !== "object") return { message: String(_err) };
+	const err = _err;
+	if (err.stack) err.stackStr = String(err.stack);
+	if (err.name) err.nameStr = String(err.name);
+	if (err.showDiff || err.showDiff === void 0 && err.expected !== void 0 && err.actual !== void 0) err.diff = printDiffOrStringify(err.actual, err.expected, {
+		...diffOptions,
+		...err.diffOptions
+	});
+	if (typeof err.expected !== "string") err.expected = stringify(err.expected, 10);
+	if (typeof err.actual !== "string") err.actual = stringify(err.actual, 10);
+	try {
+		if (typeof err.message === "string") err.message = normalizeErrorMessage(err.message);
+	} catch {}
+	try {
+		if (!seen.has(err) && typeof err.cause === "object") {
+			seen.add(err);
+			err.cause = processError(err.cause, diffOptions, seen);
+		}
+	} catch {}
+	try {
+		return serializeValue(err);
+	} catch (e) {
+		return serializeValue(/* @__PURE__ */ new Error(`Failed to fully serialize error: ${e == null ? void 0 : e.message}
+Inner error message: ${err == null ? void 0 : err.message}`));
+	}
+}
+
+//#endregion
+export { processError };
+//# sourceMappingURL=error.mjs.map

package/dist/node_modules/@vitest/utils/dist/error.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"error.mjs","names":[],"sources":["../../../../../node_modules/@vitest/utils/dist/error.js"],"sourcesContent":["import { printDiffOrStringify } from './diff.js';\nimport { f as format, s as stringify } from './chunk-_commonjsHelpers.js';\nimport '@vitest/pretty-format';\nimport 'tinyrainbow';\nimport './helpers.js';\nimport 'loupe';\n\nconst IS_RECORD_SYMBOL = \"@@__IMMUTABLE_RECORD__@@\";\nconst IS_COLLECTION_SYMBOL = \"@@__IMMUTABLE_ITERABLE__@@\";\nfunction isImmutable(v) {\n  return v && (v[IS_COLLECTION_SYMBOL] || v[IS_RECORD_SYMBOL]);\n}\nconst OBJECT_PROTO = Object.getPrototypeOf({});\nfunction getUnserializableMessage(err) {\n  if (err instanceof Error) {\n    return `<unserializable>: ${err.message}`;\n  }\n  if (typeof err === \"string\") {\n    return `<unserializable>: ${err}`;\n  }\n  return \"<unserializable>\";\n}\nfunction serializeValue(val, seen = /* @__PURE__ */ new WeakMap()) {\n  if (!val || typeof val === \"string\") {\n    return val;\n  }\n  if (typeof val === \"function\") {\n    return `Function<${val.name || \"anonymous\"}>`;\n  }\n  if (typeof val === \"symbol\") {\n    return val.toString();\n  }\n  if (typeof val !== \"object\") {\n    return val;\n  }\n  if (isImmutable(val)) {\n    return serializeValue(val.toJSON(), seen);\n  }\n  if (val instanceof Promise || val.constructor && val.constructor.prototype === \"AsyncFunction\") {\n    return \"Promise\";\n  }\n  if (typeof Element !== \"undefined\" && val instanceof Element) {\n    return val.tagName;\n  }\n  if (typeof val.asymmetricMatch === \"function\") {\n    return `${val.toString()} ${format(val.sample)}`;\n  }\n  if (typeof val.toJSON === \"function\") {\n    return serializeValue(val.toJSON(), seen);\n  }\n  if (seen.has(val)) {\n    return seen.get(val);\n  }\n  if (Array.isArray(val)) {\n    const clone = new Array(val.length);\n    seen.set(val, clone);\n    val.forEach((e, i) => {\n      try {\n        clone[i] = serializeValue(e, seen);\n      } catch (err) {\n        clone[i] = getUnserializableMessage(err);\n      }\n    });\n    return clone;\n  } else {\n    const clone = /* @__PURE__ */ Object.create(null);\n    seen.set(val, clone);\n    let obj = val;\n    while (obj && obj !== OBJECT_PROTO) {\n      Object.getOwnPropertyNames(obj).forEach((key) => {\n        if (key in clone) {\n          return;\n        }\n        try {\n          clone[key] = serializeValue(val[key], seen);\n        } catch (err) {\n          delete clone[key];\n          clone[key] = getUnserializableMessage(err);\n        }\n      });\n      obj = Object.getPrototypeOf(obj);\n    }\n    return clone;\n  }\n}\nfunction normalizeErrorMessage(message) {\n  return message.replace(/__(vite_ssr_import|vi_import)_\\d+__\\./g, \"\");\n}\nfunction processError(_err, diffOptions, seen = /* @__PURE__ */ new WeakSet()) {\n  if (!_err || typeof _err !== \"object\") {\n    return { message: String(_err) };\n  }\n  const err = _err;\n  if (err.stack) {\n    err.stackStr = String(err.stack);\n  }\n  if (err.name) {\n    err.nameStr = String(err.name);\n  }\n  if (err.showDiff || err.showDiff === void 0 && err.expected !== void 0 && err.actual !== void 0) {\n    err.diff = printDiffOrStringify(err.actual, err.expected, {\n      ...diffOptions,\n      ...err.diffOptions\n    });\n  }\n  if (typeof err.expected !== \"string\") {\n    err.expected = stringify(err.expected, 10);\n  }\n  if (typeof err.actual !== \"string\") {\n    err.actual = stringify(err.actual, 10);\n  }\n  try {\n    if (typeof err.message === \"string\") {\n      err.message = normalizeErrorMessage(err.message);\n    }\n  } catch {\n  }\n  try {\n    if (!seen.has(err) && typeof err.cause === \"object\") {\n      seen.add(err);\n      err.cause = processError(err.cause, diffOptions, seen);\n    }\n  } catch {\n  }\n  try {\n    return serializeValue(err);\n  } catch (e) {\n    return serializeValue(\n      new Error(\n        `Failed to fully serialize error: ${e == null ? void 0 : e.message}\nInner error message: ${err == null ? void 0 : err.message}`\n      )\n    );\n  }\n}\n\nexport { processError, serializeValue as serializeError, serializeValue };\n"],"x_google_ignoreList":[0],"mappings":";;;;;;AAOA,MAAM,mBAAmB;AACzB,MAAM,uBAAuB;AAC7B,SAAS,YAAY,GAAG;AACtB,QAAO,MAAM,EAAE,yBAAyB,EAAE;;AAE5C,MAAM,eAAe,OAAO,eAAe,EAAE,CAAC;AAC9C,SAAS,yBAAyB,KAAK;AACrC,KAAI,eAAe,MACjB,QAAO,qBAAqB,IAAI;AAElC,KAAI,OAAO,QAAQ,SACjB,QAAO,qBAAqB;AAE9B,QAAO;;AAET,SAAS,eAAe,KAAK,uBAAuB,IAAI,SAAS,EAAE;AACjE,KAAI,CAAC,OAAO,OAAO,QAAQ,SACzB,QAAO;AAET,KAAI,OAAO,QAAQ,WACjB,QAAO,YAAY,IAAI,QAAQ,YAAY;AAE7C,KAAI,OAAO,QAAQ,SACjB,QAAO,IAAI,UAAU;AAEvB,KAAI,OAAO,QAAQ,SACjB,QAAO;AAET,KAAI,YAAY,IAAI,CAClB,QAAO,eAAe,IAAI,QAAQ,EAAE,KAAK;AAE3C,KAAI,eAAe,WAAW,IAAI,eAAe,IAAI,YAAY,cAAc,gBAC7E,QAAO;AAET,KAAI,OAAO,YAAY,eAAe,eAAe,QACnD,QAAO,IAAI;AAEb,KAAI,OAAO,IAAI,oBAAoB,WACjC,QAAO,GAAG,IAAI,UAAU,CAAC,GAAG,OAAO,IAAI,OAAO;AAEhD,KAAI,OAAO,IAAI,WAAW,WACxB,QAAO,eAAe,IAAI,QAAQ,EAAE,KAAK;AAE3C,KAAI,KAAK,IAAI,IAAI,CACf,QAAO,KAAK,IAAI,IAAI;AAEtB,KAAI,MAAM,QAAQ,IAAI,EAAE;EACtB,MAAM,QAAQ,IAAI,MAAM,IAAI,OAAO;AACnC,OAAK,IAAI,KAAK,MAAM;AACpB,MAAI,SAAS,GAAG,MAAM;AACpB,OAAI;AACF,UAAM,KAAK,eAAe,GAAG,KAAK;YAC3B,KAAK;AACZ,UAAM,KAAK,yBAAyB,IAAI;;IAE1C;AACF,SAAO;QACF;EACL,MAAM,QAAwB,uBAAO,OAAO,KAAK;AACjD,OAAK,IAAI,KAAK,MAAM;EACpB,IAAI,MAAM;AACV,SAAO,OAAO,QAAQ,cAAc;AAClC,UAAO,oBAAoB,IAAI,CAAC,SAAS,QAAQ;AAC/C,QAAI,OAAO,MACT;AAEF,QAAI;AACF,WAAM,OAAO,eAAe,IAAI,MAAM,KAAK;aACpC,KAAK;AACZ,YAAO,MAAM;AACb,WAAM,OAAO,yBAAyB,IAAI;;KAE5C;AACF,SAAM,OAAO,eAAe,IAAI;;AAElC,SAAO;;;AAGX,SAAS,sBAAsB,SAAS;AACtC,QAAO,QAAQ,QAAQ,0CAA0C,GAAG;;AAEtE,SAAS,aAAa,MAAM,aAAa,uBAAuB,IAAI,SAAS,EAAE;AAC7E,KAAI,CAAC,QAAQ,OAAO,SAAS,SAC3B,QAAO,EAAE,SAAS,OAAO,KAAK,EAAE;CAElC,MAAM,MAAM;AACZ,KAAI,IAAI,MACN,KAAI,WAAW,OAAO,IAAI,MAAM;AAElC,KAAI,IAAI,KACN,KAAI,UAAU,OAAO,IAAI,KAAK;AAEhC,KAAI,IAAI,YAAY,IAAI,aAAa,KAAK,KAAK,IAAI,aAAa,KAAK,KAAK,IAAI,WAAW,KAAK,EAC5F,KAAI,OAAO,qBAAqB,IAAI,QAAQ,IAAI,UAAU;EACxD,GAAG;EACH,GAAG,IAAI;EACR,CAAC;AAEJ,KAAI,OAAO,IAAI,aAAa,SAC1B,KAAI,WAAW,UAAU,IAAI,UAAU,GAAG;AAE5C,KAAI,OAAO,IAAI,WAAW,SACxB,KAAI,SAAS,UAAU,IAAI,QAAQ,GAAG;AAExC,KAAI;AACF,MAAI,OAAO,IAAI,YAAY,SACzB,KAAI,UAAU,sBAAsB,IAAI,QAAQ;SAE5C;AAER,KAAI;AACF,MAAI,CAAC,KAAK,IAAI,IAAI,IAAI,OAAO,IAAI,UAAU,UAAU;AACnD,QAAK,IAAI,IAAI;AACb,OAAI,QAAQ,aAAa,IAAI,OAAO,aAAa,KAAK;;SAElD;AAER,KAAI;AACF,SAAO,eAAe,IAAI;UACnB,GAAG;AACV,SAAO,+BACL,IAAI,MACF,oCAAoC,KAAK,OAAO,KAAK,IAAI,EAAE,QAAQ;uBACpD,OAAO,OAAO,KAAK,IAAI,IAAI,UAC3C,CACF"}

package/dist/node_modules/@vitest/utils/dist/helpers.mjs

@@ -0,0 +1,113 @@
+//#region node_modules/@vitest/utils/dist/helpers.js
+function createSimpleStackTrace(options) {
+	const { message = "$$stack trace error", stackTraceLimit = 1 } = options || {};
+	const limit = Error.stackTraceLimit;
+	const prepareStackTrace = Error.prepareStackTrace;
+	Error.stackTraceLimit = stackTraceLimit;
+	Error.prepareStackTrace = (e) => e.stack;
+	const stackTrace = new Error(message).stack || "";
+	Error.prepareStackTrace = prepareStackTrace;
+	Error.stackTraceLimit = limit;
+	return stackTrace;
+}
+function assertTypes(value, name, types) {
+	const receivedType = typeof value;
+	if (!types.includes(receivedType)) throw new TypeError(`${name} value must be ${types.join(" or ")}, received "${receivedType}"`);
+}
+function toArray(array) {
+	if (array === null || array === void 0) array = [];
+	if (Array.isArray(array)) return array;
+	return [array];
+}
+function isObject(item) {
+	return item != null && typeof item === "object" && !Array.isArray(item);
+}
+function isFinalObj(obj) {
+	return obj === Object.prototype || obj === Function.prototype || obj === RegExp.prototype;
+}
+function getType(value) {
+	return Object.prototype.toString.apply(value).slice(8, -1);
+}
+function collectOwnProperties(obj, collector) {
+	const collect = typeof collector === "function" ? collector : (key) => collector.add(key);
+	Object.getOwnPropertyNames(obj).forEach(collect);
+	Object.getOwnPropertySymbols(obj).forEach(collect);
+}
+function getOwnProperties(obj) {
+	const ownProps = /* @__PURE__ */ new Set();
+	if (isFinalObj(obj)) return [];
+	collectOwnProperties(obj, ownProps);
+	return Array.from(ownProps);
+}
+const defaultCloneOptions = { forceWritable: false };
+function deepClone(val, options = defaultCloneOptions) {
+	return clone(val, /* @__PURE__ */ new WeakMap(), options);
+}
+function clone(val, seen, options = defaultCloneOptions) {
+	let k, out;
+	if (seen.has(val)) return seen.get(val);
+	if (Array.isArray(val)) {
+		out = Array.from({ length: k = val.length });
+		seen.set(val, out);
+		while (k--) out[k] = clone(val[k], seen, options);
+		return out;
+	}
+	if (Object.prototype.toString.call(val) === "[object Object]") {
+		out = Object.create(Object.getPrototypeOf(val));
+		seen.set(val, out);
+		const props = getOwnProperties(val);
+		for (const k2 of props) {
+			const descriptor = Object.getOwnPropertyDescriptor(val, k2);
+			if (!descriptor) continue;
+			const cloned = clone(val[k2], seen, options);
+			if (options.forceWritable) Object.defineProperty(out, k2, {
+				enumerable: descriptor.enumerable,
+				configurable: true,
+				writable: true,
+				value: cloned
+			});
+			else if ("get" in descriptor) Object.defineProperty(out, k2, {
+				...descriptor,
+				get() {
+					return cloned;
+				}
+			});
+			else Object.defineProperty(out, k2, {
+				...descriptor,
+				value: cloned
+			});
+		}
+		return out;
+	}
+	return val;
+}
+function objectAttr(source, path, defaultValue = void 0) {
+	const paths = path.replace(/\[(\d+)\]/g, ".$1").split(".");
+	let result = source;
+	for (const p of paths) {
+		result = new Object(result)[p];
+		if (result === void 0) return defaultValue;
+	}
+	return result;
+}
+function createDefer() {
+	let resolve = null;
+	let reject = null;
+	const p = new Promise((_resolve, _reject) => {
+		resolve = _resolve;
+		reject = _reject;
+	});
+	p.resolve = resolve;
+	p.reject = reject;
+	return p;
+}
+function isNegativeNaN(val) {
+	if (!Number.isNaN(val)) return false;
+	const f64 = new Float64Array(1);
+	f64[0] = val;
+	return new Uint32Array(f64.buffer)[1] >>> 31 === 1;
+}
+
+//#endregion
+export { assertTypes, clone, createDefer, createSimpleStackTrace, deepClone, getOwnProperties, getType, isNegativeNaN, isObject, objectAttr, toArray };
+//# sourceMappingURL=helpers.mjs.map

package/dist/node_modules/@vitest/utils/dist/helpers.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.mjs","names":[],"sources":["../../../../../node_modules/@vitest/utils/dist/helpers.js"],"sourcesContent":["function createSimpleStackTrace(options) {\n  const { message = \"$$stack trace error\", stackTraceLimit = 1 } = options || {};\n  const limit = Error.stackTraceLimit;\n  const prepareStackTrace = Error.prepareStackTrace;\n  Error.stackTraceLimit = stackTraceLimit;\n  Error.prepareStackTrace = (e) => e.stack;\n  const err = new Error(message);\n  const stackTrace = err.stack || \"\";\n  Error.prepareStackTrace = prepareStackTrace;\n  Error.stackTraceLimit = limit;\n  return stackTrace;\n}\nfunction notNullish(v) {\n  return v != null;\n}\nfunction assertTypes(value, name, types) {\n  const receivedType = typeof value;\n  const pass = types.includes(receivedType);\n  if (!pass) {\n    throw new TypeError(\n      `${name} value must be ${types.join(\" or \")}, received \"${receivedType}\"`\n    );\n  }\n}\nfunction isPrimitive(value) {\n  return value === null || typeof value !== \"function\" && typeof value !== \"object\";\n}\nfunction slash(path) {\n  return path.replace(/\\\\/g, \"/\");\n}\nfunction parseRegexp(input) {\n  const m = input.match(/(\\/?)(.+)\\1([a-z]*)/i);\n  if (!m) {\n    return /$^/;\n  }\n  if (m[3] && !/^(?!.*?(.).*?\\1)[gmixXsuUAJ]+$/.test(m[3])) {\n    return new RegExp(input);\n  }\n  return new RegExp(m[2], m[3]);\n}\nfunction toArray(array) {\n  if (array === null || array === void 0) {\n    array = [];\n  }\n  if (Array.isArray(array)) {\n    return array;\n  }\n  return [array];\n}\nfunction isObject(item) {\n  return item != null && typeof item === \"object\" && !Array.isArray(item);\n}\nfunction isFinalObj(obj) {\n  return obj === Object.prototype || obj === Function.prototype || obj === RegExp.prototype;\n}\nfunction getType(value) {\n  return Object.prototype.toString.apply(value).slice(8, -1);\n}\nfunction collectOwnProperties(obj, collector) {\n  const collect = typeof collector === \"function\" ? collector : (key) => collector.add(key);\n  Object.getOwnPropertyNames(obj).forEach(collect);\n  Object.getOwnPropertySymbols(obj).forEach(collect);\n}\nfunction getOwnProperties(obj) {\n  const ownProps = /* @__PURE__ */ new Set();\n  if (isFinalObj(obj)) {\n    return [];\n  }\n  collectOwnProperties(obj, ownProps);\n  return Array.from(ownProps);\n}\nconst defaultCloneOptions = { forceWritable: false };\nfunction deepClone(val, options = defaultCloneOptions) {\n  const seen = /* @__PURE__ */ new WeakMap();\n  return clone(val, seen, options);\n}\nfunction clone(val, seen, options = defaultCloneOptions) {\n  let k, out;\n  if (seen.has(val)) {\n    return seen.get(val);\n  }\n  if (Array.isArray(val)) {\n    out = Array.from({ length: k = val.length });\n    seen.set(val, out);\n    while (k--) {\n      out[k] = clone(val[k], seen, options);\n    }\n    return out;\n  }\n  if (Object.prototype.toString.call(val) === \"[object Object]\") {\n    out = Object.create(Object.getPrototypeOf(val));\n    seen.set(val, out);\n    const props = getOwnProperties(val);\n    for (const k2 of props) {\n      const descriptor = Object.getOwnPropertyDescriptor(val, k2);\n      if (!descriptor) {\n        continue;\n      }\n      const cloned = clone(val[k2], seen, options);\n      if (options.forceWritable) {\n        Object.defineProperty(out, k2, {\n          enumerable: descriptor.enumerable,\n          configurable: true,\n          writable: true,\n          value: cloned\n        });\n      } else if (\"get\" in descriptor) {\n        Object.defineProperty(out, k2, {\n          ...descriptor,\n          get() {\n            return cloned;\n          }\n        });\n      } else {\n        Object.defineProperty(out, k2, {\n          ...descriptor,\n          value: cloned\n        });\n      }\n    }\n    return out;\n  }\n  return val;\n}\nfunction noop() {\n}\nfunction objectAttr(source, path, defaultValue = void 0) {\n  const paths = path.replace(/\\[(\\d+)\\]/g, \".$1\").split(\".\");\n  let result = source;\n  for (const p of paths) {\n    result = new Object(result)[p];\n    if (result === void 0) {\n      return defaultValue;\n    }\n  }\n  return result;\n}\nfunction createDefer() {\n  let resolve = null;\n  let reject = null;\n  const p = new Promise((_resolve, _reject) => {\n    resolve = _resolve;\n    reject = _reject;\n  });\n  p.resolve = resolve;\n  p.reject = reject;\n  return p;\n}\nfunction getCallLastIndex(code) {\n  let charIndex = -1;\n  let inString = null;\n  let startedBracers = 0;\n  let endedBracers = 0;\n  let beforeChar = null;\n  while (charIndex <= code.length) {\n    beforeChar = code[charIndex];\n    charIndex++;\n    const char = code[charIndex];\n    const isCharString = char === '\"' || char === \"'\" || char === \"`\";\n    if (isCharString && beforeChar !== \"\\\\\") {\n      if (inString === char) {\n        inString = null;\n      } else if (!inString) {\n        inString = char;\n      }\n    }\n    if (!inString) {\n      if (char === \"(\") {\n        startedBracers++;\n      }\n      if (char === \")\") {\n        endedBracers++;\n      }\n    }\n    if (startedBracers && endedBracers && startedBracers === endedBracers) {\n      return charIndex;\n    }\n  }\n  return null;\n}\nfunction isNegativeNaN(val) {\n  if (!Number.isNaN(val)) {\n    return false;\n  }\n  const f64 = new Float64Array(1);\n  f64[0] = val;\n  const u32 = new Uint32Array(f64.buffer);\n  const isNegative = u32[1] >>> 31 === 1;\n  return isNegative;\n}\nfunction toString(v) {\n  return Object.prototype.toString.call(v);\n}\nfunction isPlainObject(val) {\n  return toString(val) === \"[object Object]\" && (!val.constructor || val.constructor.name === \"Object\");\n}\nfunction isMergeableObject(item) {\n  return isPlainObject(item) && !Array.isArray(item);\n}\nfunction deepMerge(target, ...sources) {\n  if (!sources.length) {\n    return target;\n  }\n  const source = sources.shift();\n  if (source === void 0) {\n    return target;\n  }\n  if (isMergeableObject(target) && isMergeableObject(source)) {\n    Object.keys(source).forEach((key) => {\n      const _source = source;\n      if (isMergeableObject(_source[key])) {\n        if (!target[key]) {\n          target[key] = {};\n        }\n        deepMerge(target[key], _source[key]);\n      } else {\n        target[key] = _source[key];\n      }\n    });\n  }\n  return deepMerge(target, ...sources);\n}\n\nexport { assertTypes, clone, createDefer, createSimpleStackTrace, deepClone, deepMerge, getCallLastIndex, getOwnProperties, getType, isNegativeNaN, isObject, isPrimitive, noop, notNullish, objectAttr, parseRegexp, slash, toArray };\n"],"x_google_ignoreList":[0],"mappings":";AAAA,SAAS,uBAAuB,SAAS;CACvC,MAAM,EAAE,UAAU,uBAAuB,kBAAkB,MAAM,WAAW,EAAE;CAC9E,MAAM,QAAQ,MAAM;CACpB,MAAM,oBAAoB,MAAM;AAChC,OAAM,kBAAkB;AACxB,OAAM,qBAAqB,MAAM,EAAE;CAEnC,MAAM,aADM,IAAI,MAAM,QAAQ,CACP,SAAS;AAChC,OAAM,oBAAoB;AAC1B,OAAM,kBAAkB;AACxB,QAAO;;AAKT,SAAS,YAAY,OAAO,MAAM,OAAO;CACvC,MAAM,eAAe,OAAO;AAE5B,KAAI,CADS,MAAM,SAAS,aAAa,CAEvC,OAAM,IAAI,UACR,GAAG,KAAK,iBAAiB,MAAM,KAAK,OAAO,CAAC,cAAc,aAAa,GACxE;;AAmBL,SAAS,QAAQ,OAAO;AACtB,KAAI,UAAU,QAAQ,UAAU,KAAK,EACnC,SAAQ,EAAE;AAEZ,KAAI,MAAM,QAAQ,MAAM,CACtB,QAAO;AAET,QAAO,CAAC,MAAM;;AAEhB,SAAS,SAAS,MAAM;AACtB,QAAO,QAAQ,QAAQ,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,KAAK;;AAEzE,SAAS,WAAW,KAAK;AACvB,QAAO,QAAQ,OAAO,aAAa,QAAQ,SAAS,aAAa,QAAQ,OAAO;;AAElF,SAAS,QAAQ,OAAO;AACtB,QAAO,OAAO,UAAU,SAAS,MAAM,MAAM,CAAC,MAAM,GAAG,GAAG;;AAE5D,SAAS,qBAAqB,KAAK,WAAW;CAC5C,MAAM,UAAU,OAAO,cAAc,aAAa,aAAa,QAAQ,UAAU,IAAI,IAAI;AACzF,QAAO,oBAAoB,IAAI,CAAC,QAAQ,QAAQ;AAChD,QAAO,sBAAsB,IAAI,CAAC,QAAQ,QAAQ;;AAEpD,SAAS,iBAAiB,KAAK;CAC7B,MAAM,2BAA2B,IAAI,KAAK;AAC1C,KAAI,WAAW,IAAI,CACjB,QAAO,EAAE;AAEX,sBAAqB,KAAK,SAAS;AACnC,QAAO,MAAM,KAAK,SAAS;;AAE7B,MAAM,sBAAsB,EAAE,eAAe,OAAO;AACpD,SAAS,UAAU,KAAK,UAAU,qBAAqB;AAErD,QAAO,MAAM,qBADgB,IAAI,SAAS,EAClB,QAAQ;;AAElC,SAAS,MAAM,KAAK,MAAM,UAAU,qBAAqB;CACvD,IAAI,GAAG;AACP,KAAI,KAAK,IAAI,IAAI,CACf,QAAO,KAAK,IAAI,IAAI;AAEtB,KAAI,MAAM,QAAQ,IAAI,EAAE;AACtB,QAAM,MAAM,KAAK,EAAE,QAAQ,IAAI,IAAI,QAAQ,CAAC;AAC5C,OAAK,IAAI,KAAK,IAAI;AAClB,SAAO,IACL,KAAI,KAAK,MAAM,IAAI,IAAI,MAAM,QAAQ;AAEvC,SAAO;;AAET,KAAI,OAAO,UAAU,SAAS,KAAK,IAAI,KAAK,mBAAmB;AAC7D,QAAM,OAAO,OAAO,OAAO,eAAe,IAAI,CAAC;AAC/C,OAAK,IAAI,KAAK,IAAI;EAClB,MAAM,QAAQ,iBAAiB,IAAI;AACnC,OAAK,MAAM,MAAM,OAAO;GACtB,MAAM,aAAa,OAAO,yBAAyB,KAAK,GAAG;AAC3D,OAAI,CAAC,WACH;GAEF,MAAM,SAAS,MAAM,IAAI,KAAK,MAAM,QAAQ;AAC5C,OAAI,QAAQ,cACV,QAAO,eAAe,KAAK,IAAI;IAC7B,YAAY,WAAW;IACvB,cAAc;IACd,UAAU;IACV,OAAO;IACR,CAAC;YACO,SAAS,WAClB,QAAO,eAAe,KAAK,IAAI;IAC7B,GAAG;IACH,MAAM;AACJ,YAAO;;IAEV,CAAC;OAEF,QAAO,eAAe,KAAK,IAAI;IAC7B,GAAG;IACH,OAAO;IACR,CAAC;;AAGN,SAAO;;AAET,QAAO;;AAIT,SAAS,WAAW,QAAQ,MAAM,eAAe,KAAK,GAAG;CACvD,MAAM,QAAQ,KAAK,QAAQ,cAAc,MAAM,CAAC,MAAM,IAAI;CAC1D,IAAI,SAAS;AACb,MAAK,MAAM,KAAK,OAAO;AACrB,WAAS,IAAI,OAAO,OAAO,CAAC;AAC5B,MAAI,WAAW,KAAK,EAClB,QAAO;;AAGX,QAAO;;AAET,SAAS,cAAc;CACrB,IAAI,UAAU;CACd,IAAI,SAAS;CACb,MAAM,IAAI,IAAI,SAAS,UAAU,YAAY;AAC3C,YAAU;AACV,WAAS;GACT;AACF,GAAE,UAAU;AACZ,GAAE,SAAS;AACX,QAAO;;AAkCT,SAAS,cAAc,KAAK;AAC1B,KAAI,CAAC,OAAO,MAAM,IAAI,CACpB,QAAO;CAET,MAAM,MAAM,IAAI,aAAa,EAAE;AAC/B,KAAI,KAAK;AAGT,QAFY,IAAI,YAAY,IAAI,OAAO,CAChB,OAAO,OAAO"}