@manifest-network/manifest-mcp-core 0.1.0

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

@@ -0,0 +1 @@
+{"version":3,"file":"diff.js","names":["c"],"sources":["../../../../../../../node_modules/@vitest/utils/dist/diff.js"],"sourcesContent":["import { plugins, format } from '@vitest/pretty-format';\nimport c from 'tinyrainbow';\nimport { stringify } from './display.js';\nimport { deepClone, getOwnProperties, getType as getType$1 } from './helpers.js';\nimport './constants.js';\n\n/**\n* Diff Match and Patch\n* Copyright 2018 The diff-match-patch Authors.\n* https://github.com/google/diff-match-patch\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n/**\n* @fileoverview Computes the difference between two texts to create a patch.\n* Applies the patch onto another text, allowing for errors.\n* @author fraser@google.com (Neil Fraser)\n*/\n/**\n* CHANGES by pedrottimark to diff_match_patch_uncompressed.ts file:\n*\n* 1. Delete anything not needed to use diff_cleanupSemantic method\n* 2. Convert from prototype properties to var declarations\n* 3. Convert Diff to class from constructor and prototype\n* 4. Add type annotations for arguments and return values\n* 5. Add exports\n*/\n/**\n* The data structure representing a diff is an array of tuples:\n* [[DIFF_DELETE, 'Hello'], [DIFF_INSERT, 'Goodbye'], [DIFF_EQUAL, ' world.']]\n* which means: delete 'Hello', add 'Goodbye' and keep ' world.'\n*/\nconst DIFF_DELETE = -1;\nconst DIFF_INSERT = 1;\nconst DIFF_EQUAL = 0;\n/**\n* Class representing one diff tuple.\n* Attempts to look like a two-element array (which is what this used to be).\n* @param {number} op Operation, one of: DIFF_DELETE, DIFF_INSERT, DIFF_EQUAL.\n* @param {string} text Text to be deleted, inserted, or retained.\n* @constructor\n*/\nclass Diff {\n\t0;\n\t1;\n\tconstructor(op, text) {\n\t\tthis[0] = op;\n\t\tthis[1] = text;\n\t}\n}\n/**\n* Determine the common prefix of two strings.\n* @param {string} text1 First string.\n* @param {string} text2 Second string.\n* @return {number} The number of characters common to the start of each\n*     string.\n*/\nfunction diff_commonPrefix(text1, text2) {\n\t// Quick check for common null cases.\n\tif (!text1 || !text2 || text1.charAt(0) !== text2.charAt(0)) {\n\t\treturn 0;\n\t}\n\t// Binary search.\n\t// Performance analysis: https://neil.fraser.name/news/2007/10/09/\n\tlet pointermin = 0;\n\tlet pointermax = Math.min(text1.length, text2.length);\n\tlet pointermid = pointermax;\n\tlet pointerstart = 0;\n\twhile (pointermin < pointermid) {\n\t\tif (text1.substring(pointerstart, pointermid) === text2.substring(pointerstart, pointermid)) {\n\t\t\tpointermin = pointermid;\n\t\t\tpointerstart = pointermin;\n\t\t} else {\n\t\t\tpointermax = pointermid;\n\t\t}\n\t\tpointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);\n\t}\n\treturn pointermid;\n}\n/**\n* Determine the common suffix of two strings.\n* @param {string} text1 First string.\n* @param {string} text2 Second string.\n* @return {number} The number of characters common to the end of each string.\n*/\nfunction diff_commonSuffix(text1, text2) {\n\t// Quick check for common null cases.\n\tif (!text1 || !text2 || text1.charAt(text1.length - 1) !== text2.charAt(text2.length - 1)) {\n\t\treturn 0;\n\t}\n\t// Binary search.\n\t// Performance analysis: https://neil.fraser.name/news/2007/10/09/\n\tlet pointermin = 0;\n\tlet pointermax = Math.min(text1.length, text2.length);\n\tlet pointermid = pointermax;\n\tlet pointerend = 0;\n\twhile (pointermin < pointermid) {\n\t\tif (text1.substring(text1.length - pointermid, text1.length - pointerend) === text2.substring(text2.length - pointermid, text2.length - pointerend)) {\n\t\t\tpointermin = pointermid;\n\t\t\tpointerend = pointermin;\n\t\t} else {\n\t\t\tpointermax = pointermid;\n\t\t}\n\t\tpointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);\n\t}\n\treturn pointermid;\n}\n/**\n* Determine if the suffix of one string is the prefix of another.\n* @param {string} text1 First string.\n* @param {string} text2 Second string.\n* @return {number} The number of characters common to the end of the first\n*     string and the start of the second string.\n* @private\n*/\nfunction diff_commonOverlap_(text1, text2) {\n\t// Cache the text lengths to prevent multiple calls.\n\tconst text1_length = text1.length;\n\tconst text2_length = text2.length;\n\t// Eliminate the null case.\n\tif (text1_length === 0 || text2_length === 0) {\n\t\treturn 0;\n\t}\n\t// Truncate the longer string.\n\tif (text1_length > text2_length) {\n\t\ttext1 = text1.substring(text1_length - text2_length);\n\t} else if (text1_length < text2_length) {\n\t\ttext2 = text2.substring(0, text1_length);\n\t}\n\tconst text_length = Math.min(text1_length, text2_length);\n\t// Quick check for the worst case.\n\tif (text1 === text2) {\n\t\treturn text_length;\n\t}\n\t// Start by looking for a single character match\n\t// and increase length until no match is found.\n\t// Performance analysis: https://neil.fraser.name/news/2010/11/04/\n\tlet best = 0;\n\tlet length = 1;\n\twhile (true) {\n\t\tconst pattern = text1.substring(text_length - length);\n\t\tconst found = text2.indexOf(pattern);\n\t\tif (found === -1) {\n\t\t\treturn best;\n\t\t}\n\t\tlength += found;\n\t\tif (found === 0 || text1.substring(text_length - length) === text2.substring(0, length)) {\n\t\t\tbest = length;\n\t\t\tlength++;\n\t\t}\n\t}\n}\n/**\n* Reduce the number of edits by eliminating semantically trivial equalities.\n* @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\n*/\nfunction diff_cleanupSemantic(diffs) {\n\tlet changes = false;\n\tconst equalities = [];\n\tlet equalitiesLength = 0;\n\t/** @type {?string} */\n\tlet lastEquality = null;\n\t// Always equal to diffs[equalities[equalitiesLength - 1]][1]\n\tlet pointer = 0;\n\t// Number of characters that changed prior to the equality.\n\tlet length_insertions1 = 0;\n\tlet length_deletions1 = 0;\n\t// Number of characters that changed after the equality.\n\tlet length_insertions2 = 0;\n\tlet length_deletions2 = 0;\n\twhile (pointer < diffs.length) {\n\t\tif (diffs[pointer][0] === DIFF_EQUAL) {\n\t\t\t// Equality found.\n\t\t\tequalities[equalitiesLength++] = pointer;\n\t\t\tlength_insertions1 = length_insertions2;\n\t\t\tlength_deletions1 = length_deletions2;\n\t\t\tlength_insertions2 = 0;\n\t\t\tlength_deletions2 = 0;\n\t\t\tlastEquality = diffs[pointer][1];\n\t\t} else {\n\t\t\t// An insertion or deletion.\n\t\t\tif (diffs[pointer][0] === DIFF_INSERT) {\n\t\t\t\tlength_insertions2 += diffs[pointer][1].length;\n\t\t\t} else {\n\t\t\t\tlength_deletions2 += diffs[pointer][1].length;\n\t\t\t}\n\t\t\t// Eliminate an equality that is smaller or equal to the edits on both\n\t\t\t// sides of it.\n\t\t\tif (lastEquality && lastEquality.length <= Math.max(length_insertions1, length_deletions1) && lastEquality.length <= Math.max(length_insertions2, length_deletions2)) {\n\t\t\t\t// Duplicate record.\n\t\t\t\tdiffs.splice(equalities[equalitiesLength - 1], 0, new Diff(DIFF_DELETE, lastEquality));\n\t\t\t\t// Change second copy to insert.\n\t\t\t\tdiffs[equalities[equalitiesLength - 1] + 1][0] = DIFF_INSERT;\n\t\t\t\t// Throw away the equality we just deleted.\n\t\t\t\tequalitiesLength--;\n\t\t\t\t// Throw away the previous equality (it needs to be reevaluated).\n\t\t\t\tequalitiesLength--;\n\t\t\t\tpointer = equalitiesLength > 0 ? equalities[equalitiesLength - 1] : -1;\n\t\t\t\tlength_insertions1 = 0;\n\t\t\t\tlength_deletions1 = 0;\n\t\t\t\tlength_insertions2 = 0;\n\t\t\t\tlength_deletions2 = 0;\n\t\t\t\tlastEquality = null;\n\t\t\t\tchanges = true;\n\t\t\t}\n\t\t}\n\t\tpointer++;\n\t}\n\t// Normalize the diff.\n\tif (changes) {\n\t\tdiff_cleanupMerge(diffs);\n\t}\n\tdiff_cleanupSemanticLossless(diffs);\n\t// Find any overlaps between deletions and insertions.\n\t// e.g: <del>abcxxx</del><ins>xxxdef</ins>\n\t//   -> <del>abc</del>xxx<ins>def</ins>\n\t// e.g: <del>xxxabc</del><ins>defxxx</ins>\n\t//   -> <ins>def</ins>xxx<del>abc</del>\n\t// Only extract an overlap if it is as big as the edit ahead or behind it.\n\tpointer = 1;\n\twhile (pointer < diffs.length) {\n\t\tif (diffs[pointer - 1][0] === DIFF_DELETE && diffs[pointer][0] === DIFF_INSERT) {\n\t\t\tconst deletion = diffs[pointer - 1][1];\n\t\t\tconst insertion = diffs[pointer][1];\n\t\t\tconst overlap_length1 = diff_commonOverlap_(deletion, insertion);\n\t\t\tconst overlap_length2 = diff_commonOverlap_(insertion, deletion);\n\t\t\tif (overlap_length1 >= overlap_length2) {\n\t\t\t\tif (overlap_length1 >= deletion.length / 2 || overlap_length1 >= insertion.length / 2) {\n\t\t\t\t\t// Overlap found.  Insert an equality and trim the surrounding edits.\n\t\t\t\t\tdiffs.splice(pointer, 0, new Diff(DIFF_EQUAL, insertion.substring(0, overlap_length1)));\n\t\t\t\t\tdiffs[pointer - 1][1] = deletion.substring(0, deletion.length - overlap_length1);\n\t\t\t\t\tdiffs[pointer + 1][1] = insertion.substring(overlap_length1);\n\t\t\t\t\tpointer++;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (overlap_length2 >= deletion.length / 2 || overlap_length2 >= insertion.length / 2) {\n\t\t\t\t\t// Reverse overlap found.\n\t\t\t\t\t// Insert an equality and swap and trim the surrounding edits.\n\t\t\t\t\tdiffs.splice(pointer, 0, new Diff(DIFF_EQUAL, deletion.substring(0, overlap_length2)));\n\t\t\t\t\tdiffs[pointer - 1][0] = DIFF_INSERT;\n\t\t\t\t\tdiffs[pointer - 1][1] = insertion.substring(0, insertion.length - overlap_length2);\n\t\t\t\t\tdiffs[pointer + 1][0] = DIFF_DELETE;\n\t\t\t\t\tdiffs[pointer + 1][1] = deletion.substring(overlap_length2);\n\t\t\t\t\tpointer++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tpointer++;\n\t\t}\n\t\tpointer++;\n\t}\n}\n// Define some regex patterns for matching boundaries.\nconst nonAlphaNumericRegex_ = /[^a-z0-9]/i;\nconst whitespaceRegex_ = /\\s/;\nconst linebreakRegex_ = /[\\r\\n]/;\nconst blanklineEndRegex_ = /\\n\\r?\\n$/;\nconst blanklineStartRegex_ = /^\\r?\\n\\r?\\n/;\n/**\n* Look for single edits surrounded on both sides by equalities\n* which can be shifted sideways to align the edit to a word boundary.\n* e.g: The c<ins>at c</ins>ame. -> The <ins>cat </ins>came.\n* @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\n*/\nfunction diff_cleanupSemanticLossless(diffs) {\n\tlet pointer = 1;\n\t// Intentionally ignore the first and last element (don't need checking).\n\twhile (pointer < diffs.length - 1) {\n\t\tif (diffs[pointer - 1][0] === DIFF_EQUAL && diffs[pointer + 1][0] === DIFF_EQUAL) {\n\t\t\t// This is a single edit surrounded by equalities.\n\t\t\tlet equality1 = diffs[pointer - 1][1];\n\t\t\tlet edit = diffs[pointer][1];\n\t\t\tlet equality2 = diffs[pointer + 1][1];\n\t\t\t// First, shift the edit as far left as possible.\n\t\t\tconst commonOffset = diff_commonSuffix(equality1, edit);\n\t\t\tif (commonOffset) {\n\t\t\t\tconst commonString = edit.substring(edit.length - commonOffset);\n\t\t\t\tequality1 = equality1.substring(0, equality1.length - commonOffset);\n\t\t\t\tedit = commonString + edit.substring(0, edit.length - commonOffset);\n\t\t\t\tequality2 = commonString + equality2;\n\t\t\t}\n\t\t\t// Second, step character by character right, looking for the best fit.\n\t\t\tlet bestEquality1 = equality1;\n\t\t\tlet bestEdit = edit;\n\t\t\tlet bestEquality2 = equality2;\n\t\t\tlet bestScore = diff_cleanupSemanticScore_(equality1, edit) + diff_cleanupSemanticScore_(edit, equality2);\n\t\t\twhile (edit.charAt(0) === equality2.charAt(0)) {\n\t\t\t\tequality1 += edit.charAt(0);\n\t\t\t\tedit = edit.substring(1) + equality2.charAt(0);\n\t\t\t\tequality2 = equality2.substring(1);\n\t\t\t\tconst score = diff_cleanupSemanticScore_(equality1, edit) + diff_cleanupSemanticScore_(edit, equality2);\n\t\t\t\t// The >= encourages trailing rather than leading whitespace on edits.\n\t\t\t\tif (score >= bestScore) {\n\t\t\t\t\tbestScore = score;\n\t\t\t\t\tbestEquality1 = equality1;\n\t\t\t\t\tbestEdit = edit;\n\t\t\t\t\tbestEquality2 = equality2;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (diffs[pointer - 1][1] !== bestEquality1) {\n\t\t\t\t// We have an improvement, save it back to the diff.\n\t\t\t\tif (bestEquality1) {\n\t\t\t\t\tdiffs[pointer - 1][1] = bestEquality1;\n\t\t\t\t} else {\n\t\t\t\t\tdiffs.splice(pointer - 1, 1);\n\t\t\t\t\tpointer--;\n\t\t\t\t}\n\t\t\t\tdiffs[pointer][1] = bestEdit;\n\t\t\t\tif (bestEquality2) {\n\t\t\t\t\tdiffs[pointer + 1][1] = bestEquality2;\n\t\t\t\t} else {\n\t\t\t\t\tdiffs.splice(pointer + 1, 1);\n\t\t\t\t\tpointer--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tpointer++;\n\t}\n}\n/**\n* Reorder and merge like edit sections.  Merge equalities.\n* Any edit section can move as long as it doesn't cross an equality.\n* @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\n*/\nfunction diff_cleanupMerge(diffs) {\n\t// Add a dummy entry at the end.\n\tdiffs.push(new Diff(DIFF_EQUAL, \"\"));\n\tlet pointer = 0;\n\tlet count_delete = 0;\n\tlet count_insert = 0;\n\tlet text_delete = \"\";\n\tlet text_insert = \"\";\n\tlet commonlength;\n\twhile (pointer < diffs.length) {\n\t\tswitch (diffs[pointer][0]) {\n\t\t\tcase DIFF_INSERT:\n\t\t\t\tcount_insert++;\n\t\t\t\ttext_insert += diffs[pointer][1];\n\t\t\t\tpointer++;\n\t\t\t\tbreak;\n\t\t\tcase DIFF_DELETE:\n\t\t\t\tcount_delete++;\n\t\t\t\ttext_delete += diffs[pointer][1];\n\t\t\t\tpointer++;\n\t\t\t\tbreak;\n\t\t\tcase DIFF_EQUAL:\n\t\t\t\t// Upon reaching an equality, check for prior redundancies.\n\t\t\t\tif (count_delete + count_insert > 1) {\n\t\t\t\t\tif (count_delete !== 0 && count_insert !== 0) {\n\t\t\t\t\t\t// Factor out any common prefixes.\n\t\t\t\t\t\tcommonlength = diff_commonPrefix(text_insert, text_delete);\n\t\t\t\t\t\tif (commonlength !== 0) {\n\t\t\t\t\t\t\tif (pointer - count_delete - count_insert > 0 && diffs[pointer - count_delete - count_insert - 1][0] === DIFF_EQUAL) {\n\t\t\t\t\t\t\t\tdiffs[pointer - count_delete - count_insert - 1][1] += text_insert.substring(0, commonlength);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tdiffs.splice(0, 0, new Diff(DIFF_EQUAL, text_insert.substring(0, commonlength)));\n\t\t\t\t\t\t\t\tpointer++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttext_insert = text_insert.substring(commonlength);\n\t\t\t\t\t\t\ttext_delete = text_delete.substring(commonlength);\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Factor out any common suffixes.\n\t\t\t\t\t\tcommonlength = diff_commonSuffix(text_insert, text_delete);\n\t\t\t\t\t\tif (commonlength !== 0) {\n\t\t\t\t\t\t\tdiffs[pointer][1] = text_insert.substring(text_insert.length - commonlength) + diffs[pointer][1];\n\t\t\t\t\t\t\ttext_insert = text_insert.substring(0, text_insert.length - commonlength);\n\t\t\t\t\t\t\ttext_delete = text_delete.substring(0, text_delete.length - commonlength);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t// Delete the offending records and add the merged ones.\n\t\t\t\t\tpointer -= count_delete + count_insert;\n\t\t\t\t\tdiffs.splice(pointer, count_delete + count_insert);\n\t\t\t\t\tif (text_delete.length) {\n\t\t\t\t\t\tdiffs.splice(pointer, 0, new Diff(DIFF_DELETE, text_delete));\n\t\t\t\t\t\tpointer++;\n\t\t\t\t\t}\n\t\t\t\t\tif (text_insert.length) {\n\t\t\t\t\t\tdiffs.splice(pointer, 0, new Diff(DIFF_INSERT, text_insert));\n\t\t\t\t\t\tpointer++;\n\t\t\t\t\t}\n\t\t\t\t\tpointer++;\n\t\t\t\t} else if (pointer !== 0 && diffs[pointer - 1][0] === DIFF_EQUAL) {\n\t\t\t\t\t// Merge this equality with the previous one.\n\t\t\t\t\tdiffs[pointer - 1][1] += diffs[pointer][1];\n\t\t\t\t\tdiffs.splice(pointer, 1);\n\t\t\t\t} else {\n\t\t\t\t\tpointer++;\n\t\t\t\t}\n\t\t\t\tcount_insert = 0;\n\t\t\t\tcount_delete = 0;\n\t\t\t\ttext_delete = \"\";\n\t\t\t\ttext_insert = \"\";\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tif (diffs.at(-1)?.[1] === \"\") {\n\t\tdiffs.pop();\n\t}\n\t// Second pass: look for single edits surrounded on both sides by equalities\n\t// which can be shifted sideways to eliminate an equality.\n\t// e.g: A<ins>BA</ins>C -> <ins>AB</ins>AC\n\tlet changes = false;\n\tpointer = 1;\n\t// Intentionally ignore the first and last element (don't need checking).\n\twhile (pointer < diffs.length - 1) {\n\t\tif (diffs[pointer - 1][0] === DIFF_EQUAL && diffs[pointer + 1][0] === DIFF_EQUAL) {\n\t\t\t// This is a single edit surrounded by equalities.\n\t\t\tif (diffs[pointer][1].substring(diffs[pointer][1].length - diffs[pointer - 1][1].length) === diffs[pointer - 1][1]) {\n\t\t\t\t// Shift the edit over the previous equality.\n\t\t\t\tdiffs[pointer][1] = diffs[pointer - 1][1] + diffs[pointer][1].substring(0, diffs[pointer][1].length - diffs[pointer - 1][1].length);\n\t\t\t\tdiffs[pointer + 1][1] = diffs[pointer - 1][1] + diffs[pointer + 1][1];\n\t\t\t\tdiffs.splice(pointer - 1, 1);\n\t\t\t\tchanges = true;\n\t\t\t} else if (diffs[pointer][1].substring(0, diffs[pointer + 1][1].length) === diffs[pointer + 1][1]) {\n\t\t\t\t// Shift the edit over the next equality.\n\t\t\t\tdiffs[pointer - 1][1] += diffs[pointer + 1][1];\n\t\t\t\tdiffs[pointer][1] = diffs[pointer][1].substring(diffs[pointer + 1][1].length) + diffs[pointer + 1][1];\n\t\t\t\tdiffs.splice(pointer + 1, 1);\n\t\t\t\tchanges = true;\n\t\t\t}\n\t\t}\n\t\tpointer++;\n\t}\n\t// If shifts were made, the diff needs reordering and another shift sweep.\n\tif (changes) {\n\t\tdiff_cleanupMerge(diffs);\n\t}\n}\n/**\n* Given two strings, compute a score representing whether the internal\n* boundary falls on logical boundaries.\n* Scores range from 6 (best) to 0 (worst).\n* Closure, but does not reference any external variables.\n* @param {string} one First string.\n* @param {string} two Second string.\n* @return {number} The score.\n* @private\n*/\nfunction diff_cleanupSemanticScore_(one, two) {\n\tif (!one || !two) {\n\t\t// Edges are the best.\n\t\treturn 6;\n\t}\n\t// Each port of this function behaves slightly differently due to\n\t// subtle differences in each language's definition of things like\n\t// 'whitespace'.  Since this function's purpose is largely cosmetic,\n\t// the choice has been made to use each language's native features\n\t// rather than force total conformity.\n\tconst char1 = one.charAt(one.length - 1);\n\tconst char2 = two.charAt(0);\n\tconst nonAlphaNumeric1 = char1.match(nonAlphaNumericRegex_);\n\tconst nonAlphaNumeric2 = char2.match(nonAlphaNumericRegex_);\n\tconst whitespace1 = nonAlphaNumeric1 && char1.match(whitespaceRegex_);\n\tconst whitespace2 = nonAlphaNumeric2 && char2.match(whitespaceRegex_);\n\tconst lineBreak1 = whitespace1 && char1.match(linebreakRegex_);\n\tconst lineBreak2 = whitespace2 && char2.match(linebreakRegex_);\n\tconst blankLine1 = lineBreak1 && one.match(blanklineEndRegex_);\n\tconst blankLine2 = lineBreak2 && two.match(blanklineStartRegex_);\n\tif (blankLine1 || blankLine2) {\n\t\t// Five points for blank lines.\n\t\treturn 5;\n\t} else if (lineBreak1 || lineBreak2) {\n\t\t// Four points for line breaks.\n\t\treturn 4;\n\t} else if (nonAlphaNumeric1 && !whitespace1 && whitespace2) {\n\t\t// Three points for end of sentences.\n\t\treturn 3;\n\t} else if (whitespace1 || whitespace2) {\n\t\t// Two points for whitespace.\n\t\treturn 2;\n\t} else if (nonAlphaNumeric1 || nonAlphaNumeric2) {\n\t\t// One point for non-alphanumeric.\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n\n/**\n* Copyright (c) Meta Platforms, Inc. and affiliates.\n*\n* This source code is licensed under the MIT license found in the\n* LICENSE file in the root directory of this source tree.\n*/\nconst NO_DIFF_MESSAGE = \"Compared values have no visual difference.\";\nconst SIMILAR_MESSAGE = \"Compared values serialize to the same structure.\\n\" + \"Printing internal object structure without calling `toJSON` instead.\";\n\nfunction getDefaultExportFromCjs(x) {\n\treturn x && x.__esModule && Object.prototype.hasOwnProperty.call(x, \"default\") ? x[\"default\"] : x;\n}\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 = /*@__PURE__*/ requireBuild();\nvar diffSequences = /*@__PURE__*/getDefaultExportFromCjs(buildExports);\n\nfunction formatTrailingSpaces(line, trailingSpaceFormatter) {\n\treturn line.replace(/\\s+$/, (match) => trailingSpaceFormatter(match));\n}\nfunction printDiffLine(line, isFirstOrLast, color, indicator, trailingSpaceFormatter, emptyFirstOrLastLinePlaceholder) {\n\treturn line.length !== 0 ? color(`${indicator} ${formatTrailingSpaces(line, trailingSpaceFormatter)}`) : indicator !== \" \" ? color(indicator) : isFirstOrLast && emptyFirstOrLastLinePlaceholder.length !== 0 ? color(`${indicator} ${emptyFirstOrLastLinePlaceholder}`) : \"\";\n}\nfunction printDeleteLine(line, isFirstOrLast, { aColor, aIndicator, changeLineTrailingSpaceColor, emptyFirstOrLastLinePlaceholder }) {\n\treturn printDiffLine(line, isFirstOrLast, aColor, aIndicator, changeLineTrailingSpaceColor, emptyFirstOrLastLinePlaceholder);\n}\nfunction printInsertLine(line, isFirstOrLast, { bColor, bIndicator, changeLineTrailingSpaceColor, emptyFirstOrLastLinePlaceholder }) {\n\treturn printDiffLine(line, isFirstOrLast, bColor, bIndicator, changeLineTrailingSpaceColor, emptyFirstOrLastLinePlaceholder);\n}\nfunction printCommonLine(line, isFirstOrLast, { commonColor, commonIndicator, commonLineTrailingSpaceColor, emptyFirstOrLastLinePlaceholder }) {\n\treturn printDiffLine(line, isFirstOrLast, commonColor, commonIndicator, commonLineTrailingSpaceColor, emptyFirstOrLastLinePlaceholder);\n}\n// In GNU diff format, indexes are one-based instead of zero-based.\nfunction createPatchMark(aStart, aEnd, bStart, bEnd, { patchColor }) {\n\treturn patchColor(`@@ -${aStart + 1},${aEnd - aStart} +${bStart + 1},${bEnd - bStart} @@`);\n}\n// jest --no-expand\n//\n// Given array of aligned strings with inverse highlight formatting,\n// return joined lines with diff formatting (and patch marks, if needed).\nfunction joinAlignedDiffsNoExpand(diffs, options) {\n\tconst iLength = diffs.length;\n\tconst nContextLines = options.contextLines;\n\tconst nContextLines2 = nContextLines + nContextLines;\n\t// First pass: count output lines and see if it has patches.\n\tlet jLength = iLength;\n\tlet hasExcessAtStartOrEnd = false;\n\tlet nExcessesBetweenChanges = 0;\n\tlet i = 0;\n\twhile (i !== iLength) {\n\t\tconst iStart = i;\n\t\twhile (i !== iLength && diffs[i][0] === DIFF_EQUAL) {\n\t\t\ti += 1;\n\t\t}\n\t\tif (iStart !== i) {\n\t\t\tif (iStart === 0) {\n\t\t\t\t// at start\n\t\t\t\tif (i > nContextLines) {\n\t\t\t\t\tjLength -= i - nContextLines;\n\t\t\t\t\thasExcessAtStartOrEnd = true;\n\t\t\t\t}\n\t\t\t} else if (i === iLength) {\n\t\t\t\t// at end\n\t\t\t\tconst n = i - iStart;\n\t\t\t\tif (n > nContextLines) {\n\t\t\t\t\tjLength -= n - nContextLines;\n\t\t\t\t\thasExcessAtStartOrEnd = true;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// between changes\n\t\t\t\tconst n = i - iStart;\n\t\t\t\tif (n > nContextLines2) {\n\t\t\t\t\tjLength -= n - nContextLines2;\n\t\t\t\t\tnExcessesBetweenChanges += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile (i !== iLength && diffs[i][0] !== DIFF_EQUAL) {\n\t\t\ti += 1;\n\t\t}\n\t}\n\tconst hasPatch = nExcessesBetweenChanges !== 0 || hasExcessAtStartOrEnd;\n\tif (nExcessesBetweenChanges !== 0) {\n\t\tjLength += nExcessesBetweenChanges + 1;\n\t} else if (hasExcessAtStartOrEnd) {\n\t\tjLength += 1;\n\t}\n\tconst jLast = jLength - 1;\n\tconst lines = [];\n\tlet jPatchMark = 0;\n\tif (hasPatch) {\n\t\tlines.push(\"\");\n\t}\n\t// Indexes of expected or received lines in current patch:\n\tlet aStart = 0;\n\tlet bStart = 0;\n\tlet aEnd = 0;\n\tlet bEnd = 0;\n\tconst pushCommonLine = (line) => {\n\t\tconst j = lines.length;\n\t\tlines.push(printCommonLine(line, j === 0 || j === jLast, options));\n\t\taEnd += 1;\n\t\tbEnd += 1;\n\t};\n\tconst pushDeleteLine = (line) => {\n\t\tconst j = lines.length;\n\t\tlines.push(printDeleteLine(line, j === 0 || j === jLast, options));\n\t\taEnd += 1;\n\t};\n\tconst pushInsertLine = (line) => {\n\t\tconst j = lines.length;\n\t\tlines.push(printInsertLine(line, j === 0 || j === jLast, options));\n\t\tbEnd += 1;\n\t};\n\t// Second pass: push lines with diff formatting (and patch marks, if needed).\n\ti = 0;\n\twhile (i !== iLength) {\n\t\tlet iStart = i;\n\t\twhile (i !== iLength && diffs[i][0] === DIFF_EQUAL) {\n\t\t\ti += 1;\n\t\t}\n\t\tif (iStart !== i) {\n\t\t\tif (iStart === 0) {\n\t\t\t\t// at beginning\n\t\t\t\tif (i > nContextLines) {\n\t\t\t\t\tiStart = i - nContextLines;\n\t\t\t\t\taStart = iStart;\n\t\t\t\t\tbStart = iStart;\n\t\t\t\t\taEnd = aStart;\n\t\t\t\t\tbEnd = bStart;\n\t\t\t\t}\n\t\t\t\tfor (let iCommon = iStart; iCommon !== i; iCommon += 1) {\n\t\t\t\t\tpushCommonLine(diffs[iCommon][1]);\n\t\t\t\t}\n\t\t\t} else if (i === iLength) {\n\t\t\t\t// at end\n\t\t\t\tconst iEnd = i - iStart > nContextLines ? iStart + nContextLines : i;\n\t\t\t\tfor (let iCommon = iStart; iCommon !== iEnd; iCommon += 1) {\n\t\t\t\t\tpushCommonLine(diffs[iCommon][1]);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// between changes\n\t\t\t\tconst nCommon = i - iStart;\n\t\t\t\tif (nCommon > nContextLines2) {\n\t\t\t\t\tconst iEnd = iStart + nContextLines;\n\t\t\t\t\tfor (let iCommon = iStart; iCommon !== iEnd; iCommon += 1) {\n\t\t\t\t\t\tpushCommonLine(diffs[iCommon][1]);\n\t\t\t\t\t}\n\t\t\t\t\tlines[jPatchMark] = createPatchMark(aStart, aEnd, bStart, bEnd, options);\n\t\t\t\t\tjPatchMark = lines.length;\n\t\t\t\t\tlines.push(\"\");\n\t\t\t\t\tconst nOmit = nCommon - nContextLines2;\n\t\t\t\t\taStart = aEnd + nOmit;\n\t\t\t\t\tbStart = bEnd + nOmit;\n\t\t\t\t\taEnd = aStart;\n\t\t\t\t\tbEnd = bStart;\n\t\t\t\t\tfor (let iCommon = i - nContextLines; iCommon !== i; iCommon += 1) {\n\t\t\t\t\t\tpushCommonLine(diffs[iCommon][1]);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tfor (let iCommon = iStart; iCommon !== i; iCommon += 1) {\n\t\t\t\t\t\tpushCommonLine(diffs[iCommon][1]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile (i !== iLength && diffs[i][0] === DIFF_DELETE) {\n\t\t\tpushDeleteLine(diffs[i][1]);\n\t\t\ti += 1;\n\t\t}\n\t\twhile (i !== iLength && diffs[i][0] === DIFF_INSERT) {\n\t\t\tpushInsertLine(diffs[i][1]);\n\t\t\ti += 1;\n\t\t}\n\t}\n\tif (hasPatch) {\n\t\tlines[jPatchMark] = createPatchMark(aStart, aEnd, bStart, bEnd, options);\n\t}\n\treturn lines.join(\"\\n\");\n}\n// jest --expand\n//\n// Given array of aligned strings with inverse highlight formatting,\n// return joined lines with diff formatting.\nfunction joinAlignedDiffsExpand(diffs, options) {\n\treturn diffs.map((diff, i, diffs) => {\n\t\tconst line = diff[1];\n\t\tconst isFirstOrLast = i === 0 || i === diffs.length - 1;\n\t\tswitch (diff[0]) {\n\t\t\tcase DIFF_DELETE: return printDeleteLine(line, isFirstOrLast, options);\n\t\t\tcase DIFF_INSERT: return printInsertLine(line, isFirstOrLast, options);\n\t\t\tdefault: return printCommonLine(line, isFirstOrLast, options);\n\t\t}\n\t}).join(\"\\n\");\n}\n\nconst noColor = (string) => string;\nconst DIFF_CONTEXT_DEFAULT = 5;\nconst DIFF_TRUNCATE_THRESHOLD_DEFAULT = 0;\nfunction getDefaultOptions() {\n\treturn {\n\t\taAnnotation: \"Expected\",\n\t\taColor: c.green,\n\t\taIndicator: \"-\",\n\t\tbAnnotation: \"Received\",\n\t\tbColor: c.red,\n\t\tbIndicator: \"+\",\n\t\tchangeColor: c.inverse,\n\t\tchangeLineTrailingSpaceColor: noColor,\n\t\tcommonColor: c.dim,\n\t\tcommonIndicator: \" \",\n\t\tcommonLineTrailingSpaceColor: noColor,\n\t\tcompareKeys: undefined,\n\t\tcontextLines: DIFF_CONTEXT_DEFAULT,\n\t\temptyFirstOrLastLinePlaceholder: \"\",\n\t\texpand: false,\n\t\tincludeChangeCounts: false,\n\t\tomitAnnotationLines: false,\n\t\tpatchColor: c.yellow,\n\t\tprintBasicPrototype: false,\n\t\ttruncateThreshold: DIFF_TRUNCATE_THRESHOLD_DEFAULT,\n\t\ttruncateAnnotation: \"... Diff result is truncated\",\n\t\ttruncateAnnotationColor: noColor\n\t};\n}\nfunction getCompareKeys(compareKeys) {\n\treturn compareKeys && typeof compareKeys === \"function\" ? compareKeys : undefined;\n}\nfunction getContextLines(contextLines) {\n\treturn typeof contextLines === \"number\" && Number.isSafeInteger(contextLines) && contextLines >= 0 ? contextLines : DIFF_CONTEXT_DEFAULT;\n}\n// Pure function returns options with all properties.\nfunction normalizeDiffOptions(options = {}) {\n\treturn {\n\t\t...getDefaultOptions(),\n\t\t...options,\n\t\tcompareKeys: getCompareKeys(options.compareKeys),\n\t\tcontextLines: getContextLines(options.contextLines)\n\t};\n}\n\nfunction isEmptyString(lines) {\n\treturn lines.length === 1 && lines[0].length === 0;\n}\nfunction countChanges(diffs) {\n\tlet a = 0;\n\tlet b = 0;\n\tdiffs.forEach((diff) => {\n\t\tswitch (diff[0]) {\n\t\t\tcase DIFF_DELETE:\n\t\t\t\ta += 1;\n\t\t\t\tbreak;\n\t\t\tcase DIFF_INSERT:\n\t\t\t\tb += 1;\n\t\t\t\tbreak;\n\t\t}\n\t});\n\treturn {\n\t\ta,\n\t\tb\n\t};\n}\nfunction printAnnotation({ aAnnotation, aColor, aIndicator, bAnnotation, bColor, bIndicator, includeChangeCounts, omitAnnotationLines }, changeCounts) {\n\tif (omitAnnotationLines) {\n\t\treturn \"\";\n\t}\n\tlet aRest = \"\";\n\tlet bRest = \"\";\n\tif (includeChangeCounts) {\n\t\tconst aCount = String(changeCounts.a);\n\t\tconst bCount = String(changeCounts.b);\n\t\t// Padding right aligns the ends of the annotations.\n\t\tconst baAnnotationLengthDiff = bAnnotation.length - aAnnotation.length;\n\t\tconst aAnnotationPadding = \" \".repeat(Math.max(0, baAnnotationLengthDiff));\n\t\tconst bAnnotationPadding = \" \".repeat(Math.max(0, -baAnnotationLengthDiff));\n\t\t// Padding left aligns the ends of the counts.\n\t\tconst baCountLengthDiff = bCount.length - aCount.length;\n\t\tconst aCountPadding = \" \".repeat(Math.max(0, baCountLengthDiff));\n\t\tconst bCountPadding = \" \".repeat(Math.max(0, -baCountLengthDiff));\n\t\taRest = `${aAnnotationPadding}  ${aIndicator} ${aCountPadding}${aCount}`;\n\t\tbRest = `${bAnnotationPadding}  ${bIndicator} ${bCountPadding}${bCount}`;\n\t}\n\tconst a = `${aIndicator} ${aAnnotation}${aRest}`;\n\tconst b = `${bIndicator} ${bAnnotation}${bRest}`;\n\treturn `${aColor(a)}\\n${bColor(b)}\\n\\n`;\n}\nfunction printDiffLines(diffs, truncated, options) {\n\treturn printAnnotation(options, countChanges(diffs)) + (options.expand ? joinAlignedDiffsExpand(diffs, options) : joinAlignedDiffsNoExpand(diffs, options)) + (truncated ? options.truncateAnnotationColor(`\\n${options.truncateAnnotation}`) : \"\");\n}\n// Compare two arrays of strings line-by-line. Format as comparison lines.\nfunction diffLinesUnified(aLines, bLines, options) {\n\tconst normalizedOptions = normalizeDiffOptions(options);\n\tconst [diffs, truncated] = diffLinesRaw(isEmptyString(aLines) ? [] : aLines, isEmptyString(bLines) ? [] : bLines, normalizedOptions);\n\treturn printDiffLines(diffs, truncated, normalizedOptions);\n}\n// Given two pairs of arrays of strings:\n// Compare the pair of comparison arrays line-by-line.\n// Format the corresponding lines in the pair of displayable arrays.\nfunction diffLinesUnified2(aLinesDisplay, bLinesDisplay, aLinesCompare, bLinesCompare, options) {\n\tif (isEmptyString(aLinesDisplay) && isEmptyString(aLinesCompare)) {\n\t\taLinesDisplay = [];\n\t\taLinesCompare = [];\n\t}\n\tif (isEmptyString(bLinesDisplay) && isEmptyString(bLinesCompare)) {\n\t\tbLinesDisplay = [];\n\t\tbLinesCompare = [];\n\t}\n\tif (aLinesDisplay.length !== aLinesCompare.length || bLinesDisplay.length !== bLinesCompare.length) {\n\t\t// Fall back to diff of display lines.\n\t\treturn diffLinesUnified(aLinesDisplay, bLinesDisplay, options);\n\t}\n\tconst [diffs, truncated] = diffLinesRaw(aLinesCompare, bLinesCompare, options);\n\t// Replace comparison lines with displayable lines.\n\tlet aIndex = 0;\n\tlet bIndex = 0;\n\tdiffs.forEach((diff) => {\n\t\tswitch (diff[0]) {\n\t\t\tcase DIFF_DELETE:\n\t\t\t\tdiff[1] = aLinesDisplay[aIndex];\n\t\t\t\taIndex += 1;\n\t\t\t\tbreak;\n\t\t\tcase DIFF_INSERT:\n\t\t\t\tdiff[1] = bLinesDisplay[bIndex];\n\t\t\t\tbIndex += 1;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tdiff[1] = bLinesDisplay[bIndex];\n\t\t\t\taIndex += 1;\n\t\t\t\tbIndex += 1;\n\t\t}\n\t});\n\treturn printDiffLines(diffs, truncated, normalizeDiffOptions(options));\n}\n// Compare two arrays of strings line-by-line.\nfunction diffLinesRaw(aLines, bLines, options) {\n\tconst truncate = options?.truncateThreshold ?? false;\n\tconst truncateThreshold = Math.max(Math.floor(options?.truncateThreshold ?? 0), 0);\n\tconst aLength = truncate ? Math.min(aLines.length, truncateThreshold) : aLines.length;\n\tconst bLength = truncate ? Math.min(bLines.length, truncateThreshold) : bLines.length;\n\tconst truncated = aLength !== aLines.length || bLength !== bLines.length;\n\tconst isCommon = (aIndex, bIndex) => aLines[aIndex] === bLines[bIndex];\n\tconst diffs = [];\n\tlet aIndex = 0;\n\tlet bIndex = 0;\n\tconst foundSubsequence = (nCommon, aCommon, bCommon) => {\n\t\tfor (; aIndex !== aCommon; aIndex += 1) {\n\t\t\tdiffs.push(new Diff(DIFF_DELETE, aLines[aIndex]));\n\t\t}\n\t\tfor (; bIndex !== bCommon; bIndex += 1) {\n\t\t\tdiffs.push(new Diff(DIFF_INSERT, bLines[bIndex]));\n\t\t}\n\t\tfor (; nCommon !== 0; nCommon -= 1, aIndex += 1, bIndex += 1) {\n\t\t\tdiffs.push(new Diff(DIFF_EQUAL, bLines[bIndex]));\n\t\t}\n\t};\n\tdiffSequences(aLength, bLength, isCommon, foundSubsequence);\n\t// After the last common subsequence, push remaining change items.\n\tfor (; aIndex !== aLength; aIndex += 1) {\n\t\tdiffs.push(new Diff(DIFF_DELETE, aLines[aIndex]));\n\t}\n\tfor (; bIndex !== bLength; bIndex += 1) {\n\t\tdiffs.push(new Diff(DIFF_INSERT, bLines[bIndex]));\n\t}\n\treturn [diffs, truncated];\n}\n\n// get the type of a value with handling the edge cases like `typeof []`\n// and `typeof null`\nfunction getType(value) {\n\tif (value === undefined) {\n\t\treturn \"undefined\";\n\t} else if (value === null) {\n\t\treturn \"null\";\n\t} else if (Array.isArray(value)) {\n\t\treturn \"array\";\n\t} else if (typeof value === \"boolean\") {\n\t\treturn \"boolean\";\n\t} else if (typeof value === \"function\") {\n\t\treturn \"function\";\n\t} else if (typeof value === \"number\") {\n\t\treturn \"number\";\n\t} else if (typeof value === \"string\") {\n\t\treturn \"string\";\n\t} else if (typeof value === \"bigint\") {\n\t\treturn \"bigint\";\n\t} else if (typeof value === \"object\") {\n\t\tif (value != null) {\n\t\t\tif (value.constructor === RegExp) {\n\t\t\t\treturn \"regexp\";\n\t\t\t} else if (value.constructor === Map) {\n\t\t\t\treturn \"map\";\n\t\t\t} else if (value.constructor === Set) {\n\t\t\t\treturn \"set\";\n\t\t\t} else if (value.constructor === Date) {\n\t\t\t\treturn \"date\";\n\t\t\t}\n\t\t}\n\t\treturn \"object\";\n\t} else if (typeof value === \"symbol\") {\n\t\treturn \"symbol\";\n\t}\n\tthrow new Error(`value of unknown type: ${value}`);\n}\n\n// platforms compatible\nfunction getNewLineSymbol(string) {\n\treturn string.includes(\"\\r\\n\") ? \"\\r\\n\" : \"\\n\";\n}\nfunction diffStrings(a, b, options) {\n\tconst truncate = options?.truncateThreshold ?? false;\n\tconst truncateThreshold = Math.max(Math.floor(options?.truncateThreshold ?? 0), 0);\n\tlet aLength = a.length;\n\tlet bLength = b.length;\n\tif (truncate) {\n\t\tconst aMultipleLines = a.includes(\"\\n\");\n\t\tconst bMultipleLines = b.includes(\"\\n\");\n\t\tconst aNewLineSymbol = getNewLineSymbol(a);\n\t\tconst bNewLineSymbol = getNewLineSymbol(b);\n\t\t// multiple-lines string expects a newline to be appended at the end\n\t\tconst _a = aMultipleLines ? `${a.split(aNewLineSymbol, truncateThreshold).join(aNewLineSymbol)}\\n` : a;\n\t\tconst _b = bMultipleLines ? `${b.split(bNewLineSymbol, truncateThreshold).join(bNewLineSymbol)}\\n` : b;\n\t\taLength = _a.length;\n\t\tbLength = _b.length;\n\t}\n\tconst truncated = aLength !== a.length || bLength !== b.length;\n\tconst isCommon = (aIndex, bIndex) => a[aIndex] === b[bIndex];\n\tlet aIndex = 0;\n\tlet bIndex = 0;\n\tconst diffs = [];\n\tconst foundSubsequence = (nCommon, aCommon, bCommon) => {\n\t\tif (aIndex !== aCommon) {\n\t\t\tdiffs.push(new Diff(DIFF_DELETE, a.slice(aIndex, aCommon)));\n\t\t}\n\t\tif (bIndex !== bCommon) {\n\t\t\tdiffs.push(new Diff(DIFF_INSERT, b.slice(bIndex, bCommon)));\n\t\t}\n\t\taIndex = aCommon + nCommon;\n\t\tbIndex = bCommon + nCommon;\n\t\tdiffs.push(new Diff(DIFF_EQUAL, b.slice(bCommon, bIndex)));\n\t};\n\tdiffSequences(aLength, bLength, isCommon, foundSubsequence);\n\t// After the last common subsequence, push remaining change items.\n\tif (aIndex !== aLength) {\n\t\tdiffs.push(new Diff(DIFF_DELETE, a.slice(aIndex)));\n\t}\n\tif (bIndex !== bLength) {\n\t\tdiffs.push(new Diff(DIFF_INSERT, b.slice(bIndex)));\n\t}\n\treturn [diffs, truncated];\n}\n\n// Given change op and array of diffs, return concatenated string:\n// * include common strings\n// * include change strings which have argument op with changeColor\n// * exclude change strings which have opposite op\nfunction concatenateRelevantDiffs(op, diffs, changeColor) {\n\treturn diffs.reduce((reduced, diff) => reduced + (diff[0] === DIFF_EQUAL ? diff[1] : diff[0] === op && diff[1].length !== 0 ? changeColor(diff[1]) : \"\"), \"\");\n}\n// Encapsulate change lines until either a common newline or the end.\nclass ChangeBuffer {\n\top;\n\tline;\n\tlines;\n\tchangeColor;\n\tconstructor(op, changeColor) {\n\t\tthis.op = op;\n\t\tthis.line = [];\n\t\tthis.lines = [];\n\t\tthis.changeColor = changeColor;\n\t}\n\tpushSubstring(substring) {\n\t\tthis.pushDiff(new Diff(this.op, substring));\n\t}\n\tpushLine() {\n\t\t// Assume call only if line has at least one diff,\n\t\t// therefore an empty line must have a diff which has an empty string.\n\t\t// If line has multiple diffs, then assume it has a common diff,\n\t\t// therefore change diffs have change color;\n\t\t// otherwise then it has line color only.\n\t\tthis.lines.push(this.line.length !== 1 ? new Diff(this.op, concatenateRelevantDiffs(this.op, this.line, this.changeColor)) : this.line[0][0] === this.op ? this.line[0] : new Diff(this.op, this.line[0][1]));\n\t\tthis.line.length = 0;\n\t}\n\tisLineEmpty() {\n\t\treturn this.line.length === 0;\n\t}\n\t// Minor input to buffer.\n\tpushDiff(diff) {\n\t\tthis.line.push(diff);\n\t}\n\t// Main input to buffer.\n\talign(diff) {\n\t\tconst string = diff[1];\n\t\tif (string.includes(\"\\n\")) {\n\t\t\tconst substrings = string.split(\"\\n\");\n\t\t\tconst iLast = substrings.length - 1;\n\t\t\tsubstrings.forEach((substring, i) => {\n\t\t\t\tif (i < iLast) {\n\t\t\t\t\t// The first substring completes the current change line.\n\t\t\t\t\t// A middle substring is a change line.\n\t\t\t\t\tthis.pushSubstring(substring);\n\t\t\t\t\tthis.pushLine();\n\t\t\t\t} else if (substring.length !== 0) {\n\t\t\t\t\t// The last substring starts a change line, if it is not empty.\n\t\t\t\t\t// Important: This non-empty condition also automatically omits\n\t\t\t\t\t// the newline appended to the end of expected and received strings.\n\t\t\t\t\tthis.pushSubstring(substring);\n\t\t\t\t}\n\t\t\t});\n\t\t} else {\n\t\t\t// Append non-multiline string to current change line.\n\t\t\tthis.pushDiff(diff);\n\t\t}\n\t}\n\t// Output from buffer.\n\tmoveLinesTo(lines) {\n\t\tif (!this.isLineEmpty()) {\n\t\t\tthis.pushLine();\n\t\t}\n\t\tlines.push(...this.lines);\n\t\tthis.lines.length = 0;\n\t}\n}\n// Encapsulate common and change lines.\nclass CommonBuffer {\n\tdeleteBuffer;\n\tinsertBuffer;\n\tlines;\n\tconstructor(deleteBuffer, insertBuffer) {\n\t\tthis.deleteBuffer = deleteBuffer;\n\t\tthis.insertBuffer = insertBuffer;\n\t\tthis.lines = [];\n\t}\n\tpushDiffCommonLine(diff) {\n\t\tthis.lines.push(diff);\n\t}\n\tpushDiffChangeLines(diff) {\n\t\tconst isDiffEmpty = diff[1].length === 0;\n\t\t// An empty diff string is redundant, unless a change line is empty.\n\t\tif (!isDiffEmpty || this.deleteBuffer.isLineEmpty()) {\n\t\t\tthis.deleteBuffer.pushDiff(diff);\n\t\t}\n\t\tif (!isDiffEmpty || this.insertBuffer.isLineEmpty()) {\n\t\t\tthis.insertBuffer.pushDiff(diff);\n\t\t}\n\t}\n\tflushChangeLines() {\n\t\tthis.deleteBuffer.moveLinesTo(this.lines);\n\t\tthis.insertBuffer.moveLinesTo(this.lines);\n\t}\n\t// Input to buffer.\n\talign(diff) {\n\t\tconst op = diff[0];\n\t\tconst string = diff[1];\n\t\tif (string.includes(\"\\n\")) {\n\t\t\tconst substrings = string.split(\"\\n\");\n\t\t\tconst iLast = substrings.length - 1;\n\t\t\tsubstrings.forEach((substring, i) => {\n\t\t\t\tif (i === 0) {\n\t\t\t\t\tconst subdiff = new Diff(op, substring);\n\t\t\t\t\tif (this.deleteBuffer.isLineEmpty() && this.insertBuffer.isLineEmpty()) {\n\t\t\t\t\t\t// If both current change lines are empty,\n\t\t\t\t\t\t// then the first substring is a common line.\n\t\t\t\t\t\tthis.flushChangeLines();\n\t\t\t\t\t\tthis.pushDiffCommonLine(subdiff);\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// If either current change line is non-empty,\n\t\t\t\t\t\t// then the first substring completes the change lines.\n\t\t\t\t\t\tthis.pushDiffChangeLines(subdiff);\n\t\t\t\t\t\tthis.flushChangeLines();\n\t\t\t\t\t}\n\t\t\t\t} else if (i < iLast) {\n\t\t\t\t\t// A middle substring is a common line.\n\t\t\t\t\tthis.pushDiffCommonLine(new Diff(op, substring));\n\t\t\t\t} else if (substring.length !== 0) {\n\t\t\t\t\t// The last substring starts a change line, if it is not empty.\n\t\t\t\t\t// Important: This non-empty condition also automatically omits\n\t\t\t\t\t// the newline appended to the end of expected and received strings.\n\t\t\t\t\tthis.pushDiffChangeLines(new Diff(op, substring));\n\t\t\t\t}\n\t\t\t});\n\t\t} else {\n\t\t\t// Append non-multiline string to current change lines.\n\t\t\t// Important: It cannot be at the end following empty change lines,\n\t\t\t// because newline appended to the end of expected and received strings.\n\t\t\tthis.pushDiffChangeLines(diff);\n\t\t}\n\t}\n\t// Output from buffer.\n\tgetLines() {\n\t\tthis.flushChangeLines();\n\t\treturn this.lines;\n\t}\n}\n// Given diffs from expected and received strings,\n// return new array of diffs split or joined into lines.\n//\n// To correctly align a change line at the end, the algorithm:\n// * assumes that a newline was appended to the strings\n// * omits the last newline from the output array\n//\n// Assume the function is not called:\n// * if either expected or received is empty string\n// * if neither expected nor received is multiline string\nfunction getAlignedDiffs(diffs, changeColor) {\n\tconst deleteBuffer = new ChangeBuffer(DIFF_DELETE, changeColor);\n\tconst insertBuffer = new ChangeBuffer(DIFF_INSERT, changeColor);\n\tconst commonBuffer = new CommonBuffer(deleteBuffer, insertBuffer);\n\tdiffs.forEach((diff) => {\n\t\tswitch (diff[0]) {\n\t\t\tcase DIFF_DELETE:\n\t\t\t\tdeleteBuffer.align(diff);\n\t\t\t\tbreak;\n\t\t\tcase DIFF_INSERT:\n\t\t\t\tinsertBuffer.align(diff);\n\t\t\t\tbreak;\n\t\t\tdefault: commonBuffer.align(diff);\n\t\t}\n\t});\n\treturn commonBuffer.getLines();\n}\n\nfunction hasCommonDiff(diffs, isMultiline) {\n\tif (isMultiline) {\n\t\t// Important: Ignore common newline that was appended to multiline strings!\n\t\tconst iLast = diffs.length - 1;\n\t\treturn diffs.some((diff, i) => diff[0] === DIFF_EQUAL && (i !== iLast || diff[1] !== \"\\n\"));\n\t}\n\treturn diffs.some((diff) => diff[0] === DIFF_EQUAL);\n}\n// Compare two strings character-by-character.\n// Format as comparison lines in which changed substrings have inverse colors.\nfunction diffStringsUnified(a, b, options) {\n\tif (a !== b && a.length !== 0 && b.length !== 0) {\n\t\tconst isMultiline = a.includes(\"\\n\") || b.includes(\"\\n\");\n\t\t// getAlignedDiffs assumes that a newline was appended to the strings.\n\t\tconst [diffs, truncated] = diffStringsRaw(isMultiline ? `${a}\\n` : a, isMultiline ? `${b}\\n` : b, true, options);\n\t\tif (hasCommonDiff(diffs, isMultiline)) {\n\t\t\tconst optionsNormalized = normalizeDiffOptions(options);\n\t\t\tconst lines = getAlignedDiffs(diffs, optionsNormalized.changeColor);\n\t\t\treturn printDiffLines(lines, truncated, optionsNormalized);\n\t\t}\n\t}\n\t// Fall back to line-by-line diff.\n\treturn diffLinesUnified(a.split(\"\\n\"), b.split(\"\\n\"), options);\n}\n// Compare two strings character-by-character.\n// Optionally clean up small common substrings, also known as chaff.\nfunction diffStringsRaw(a, b, cleanup, options) {\n\tconst [diffs, truncated] = diffStrings(a, b, options);\n\tif (cleanup) {\n\t\tdiff_cleanupSemantic(diffs);\n\t}\n\treturn [diffs, truncated];\n}\n\nfunction getCommonMessage(message, options) {\n\tconst { commonColor } = normalizeDiffOptions(options);\n\treturn commonColor(message);\n}\nconst { AsymmetricMatcher, DOMCollection, DOMElement, Immutable, ReactElement, ReactTestComponent } = plugins;\nconst PLUGINS = [\n\tReactTestComponent,\n\tReactElement,\n\tDOMElement,\n\tDOMCollection,\n\tImmutable,\n\tAsymmetricMatcher,\n\tplugins.Error\n];\nconst FORMAT_OPTIONS = {\n\tmaxDepth: 20,\n\tplugins: PLUGINS\n};\nconst FALLBACK_FORMAT_OPTIONS = {\n\tcallToJSON: false,\n\tmaxDepth: 8,\n\tplugins: PLUGINS\n};\n// Generate a string that will highlight the difference between two values\n// with green and red. (similar to how github does code diffing)\n/**\n* @param a Expected value\n* @param b Received value\n* @param options Diff options\n* @returns {string | null} a string diff\n*/\nfunction diff(a, b, options) {\n\tif (Object.is(a, b)) {\n\t\treturn \"\";\n\t}\n\tconst aType = getType(a);\n\tlet expectedType = aType;\n\tlet omitDifference = false;\n\tif (aType === \"object\" && typeof a.asymmetricMatch === \"function\") {\n\t\tif (a.$$typeof !== Symbol.for(\"jest.asymmetricMatcher\")) {\n\t\t\t// Do not know expected type of user-defined asymmetric matcher.\n\t\t\treturn undefined;\n\t\t}\n\t\tif (typeof a.getExpectedType !== \"function\") {\n\t\t\t// For example, expect.anything() matches either null or undefined\n\t\t\treturn undefined;\n\t\t}\n\t\texpectedType = a.getExpectedType();\n\t\t// Primitive types boolean and number omit difference below.\n\t\t// For example, omit difference for expect.stringMatching(regexp)\n\t\tomitDifference = expectedType === \"string\";\n\t}\n\tif (expectedType !== getType(b)) {\n\t\tconst { aAnnotation, aColor, aIndicator, bAnnotation, bColor, bIndicator } = normalizeDiffOptions(options);\n\t\tconst formatOptions = getFormatOptions(FALLBACK_FORMAT_OPTIONS, options);\n\t\tlet aDisplay = format(a, formatOptions);\n\t\tlet bDisplay = format(b, formatOptions);\n\t\t// even if prettyFormat prints successfully big objects,\n\t\t// large string can choke later on (concatenation? RPC?),\n\t\t// so truncate it to a reasonable length here.\n\t\t// (For example, playwright's ElementHandle can become about 200_000_000 length string)\n\t\tconst MAX_LENGTH = 1e5;\n\t\tfunction truncate(s) {\n\t\t\treturn s.length <= MAX_LENGTH ? s : `${s.slice(0, MAX_LENGTH)}...`;\n\t\t}\n\t\taDisplay = truncate(aDisplay);\n\t\tbDisplay = truncate(bDisplay);\n\t\tconst aDiff = `${aColor(`${aIndicator} ${aAnnotation}:`)}\\n${aDisplay}`;\n\t\tconst bDiff = `${bColor(`${bIndicator} ${bAnnotation}:`)}\\n${bDisplay}`;\n\t\treturn `${aDiff}\\n\\n${bDiff}`;\n\t}\n\tif (omitDifference) {\n\t\treturn undefined;\n\t}\n\tswitch (aType) {\n\t\tcase \"string\": return diffLinesUnified(a.split(\"\\n\"), b.split(\"\\n\"), options);\n\t\tcase \"boolean\":\n\t\tcase \"number\": return comparePrimitive(a, b, options);\n\t\tcase \"map\": return compareObjects(sortMap(a), sortMap(b), options);\n\t\tcase \"set\": return compareObjects(sortSet(a), sortSet(b), options);\n\t\tdefault: return compareObjects(a, b, options);\n\t}\n}\nfunction comparePrimitive(a, b, options) {\n\tconst aFormat = format(a, FORMAT_OPTIONS);\n\tconst bFormat = format(b, FORMAT_OPTIONS);\n\treturn aFormat === bFormat ? \"\" : diffLinesUnified(aFormat.split(\"\\n\"), bFormat.split(\"\\n\"), options);\n}\nfunction sortMap(map) {\n\treturn new Map(Array.from(map.entries()).sort());\n}\nfunction sortSet(set) {\n\treturn new Set(Array.from(set.values()).sort());\n}\nfunction compareObjects(a, b, options) {\n\tlet difference;\n\tlet hasThrown = false;\n\ttry {\n\t\tconst formatOptions = getFormatOptions(FORMAT_OPTIONS, options);\n\t\tdifference = getObjectsDifference(a, b, formatOptions, options);\n\t} catch {\n\t\thasThrown = true;\n\t}\n\tconst noDiffMessage = getCommonMessage(NO_DIFF_MESSAGE, options);\n\t// If the comparison yields no results, compare again but this time\n\t// without calling `toJSON`. It's also possible that toJSON might throw.\n\tif (difference === undefined || difference === noDiffMessage) {\n\t\tconst formatOptions = getFormatOptions(FALLBACK_FORMAT_OPTIONS, options);\n\t\tdifference = getObjectsDifference(a, b, formatOptions, options);\n\t\tif (difference !== noDiffMessage && !hasThrown) {\n\t\t\tdifference = `${getCommonMessage(SIMILAR_MESSAGE, options)}\\n\\n${difference}`;\n\t\t}\n\t}\n\treturn difference;\n}\nfunction getFormatOptions(formatOptions, options) {\n\tconst { compareKeys, printBasicPrototype, maxDepth } = normalizeDiffOptions(options);\n\treturn {\n\t\t...formatOptions,\n\t\tcompareKeys,\n\t\tprintBasicPrototype,\n\t\tmaxDepth: maxDepth ?? formatOptions.maxDepth\n\t};\n}\nfunction getObjectsDifference(a, b, formatOptions, options) {\n\tconst formatOptionsZeroIndent = {\n\t\t...formatOptions,\n\t\tindent: 0\n\t};\n\tconst aCompare = format(a, formatOptionsZeroIndent);\n\tconst bCompare = format(b, formatOptionsZeroIndent);\n\tif (aCompare === bCompare) {\n\t\treturn getCommonMessage(NO_DIFF_MESSAGE, options);\n\t} else {\n\t\tconst aDisplay = format(a, formatOptions);\n\t\tconst bDisplay = format(b, formatOptions);\n\t\treturn diffLinesUnified2(aDisplay.split(\"\\n\"), bDisplay.split(\"\\n\"), aCompare.split(\"\\n\"), bCompare.split(\"\\n\"), options);\n\t}\n}\nconst MAX_DIFF_STRING_LENGTH = 2e4;\nfunction isAsymmetricMatcher(data) {\n\tconst type = getType$1(data);\n\treturn type === \"Object\" && typeof data.asymmetricMatch === \"function\";\n}\nfunction isReplaceable(obj1, obj2) {\n\tconst obj1Type = getType$1(obj1);\n\tconst obj2Type = getType$1(obj2);\n\treturn obj1Type === obj2Type && (obj1Type === \"Object\" || obj1Type === \"Array\");\n}\nfunction printDiffOrStringify(received, expected, options) {\n\tconst { aAnnotation, bAnnotation } = normalizeDiffOptions(options);\n\tif (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\t\tif (expected.includes(\"\\n\") || received.includes(\"\\n\")) {\n\t\t\treturn diffStringsUnified(expected, received, options);\n\t\t}\n\t\tconst [diffs] = diffStringsRaw(expected, received, true);\n\t\tconst hasCommonDiff = diffs.some((diff) => diff[0] === DIFF_EQUAL);\n\t\tconst printLabel = getLabelPrinter(aAnnotation, bAnnotation);\n\t\tconst expectedLine = printLabel(aAnnotation) + printExpected(getCommonAndChangedSubstrings(diffs, DIFF_DELETE, hasCommonDiff));\n\t\tconst receivedLine = printLabel(bAnnotation) + printReceived(getCommonAndChangedSubstrings(diffs, DIFF_INSERT, hasCommonDiff));\n\t\treturn `${expectedLine}\\n${receivedLine}`;\n\t}\n\t// if (isLineDiffable(expected, received)) {\n\tconst clonedExpected = deepClone(expected, { forceWritable: true });\n\tconst clonedReceived = deepClone(received, { forceWritable: true });\n\tconst { replacedExpected, replacedActual } = replaceAsymmetricMatcher(clonedReceived, clonedExpected);\n\tconst difference = diff(replacedExpected, replacedActual, options);\n\treturn difference;\n\t// }\n\t// const printLabel = getLabelPrinter(aAnnotation, bAnnotation)\n\t// const expectedLine = printLabel(aAnnotation) + printExpected(expected)\n\t// const receivedLine\n\t//   = printLabel(bAnnotation)\n\t//   + (stringify(expected) === stringify(received)\n\t//     ? 'serializes to the same string'\n\t//     : printReceived(received))\n\t// return `${expectedLine}\\n${receivedLine}`\n}\nfunction replaceAsymmetricMatcher(actual, expected, actualReplaced = new WeakSet(), expectedReplaced = new WeakSet()) {\n\t// handle asymmetric Error.cause diff\n\tif (actual instanceof Error && expected instanceof Error && typeof actual.cause !== \"undefined\" && typeof expected.cause === \"undefined\") {\n\t\tdelete actual.cause;\n\t\treturn {\n\t\t\treplacedActual: actual,\n\t\t\treplacedExpected: expected\n\t\t};\n\t}\n\tif (!isReplaceable(actual, expected)) {\n\t\treturn {\n\t\t\treplacedActual: actual,\n\t\t\treplacedExpected: expected\n\t\t};\n\t}\n\tif (actualReplaced.has(actual) || expectedReplaced.has(expected)) {\n\t\treturn {\n\t\t\treplacedActual: actual,\n\t\t\treplacedExpected: expected\n\t\t};\n\t}\n\tactualReplaced.add(actual);\n\texpectedReplaced.add(expected);\n\tgetOwnProperties(expected).forEach((key) => {\n\t\tconst expectedValue = expected[key];\n\t\tconst actualValue = actual[key];\n\t\tif (isAsymmetricMatcher(expectedValue)) {\n\t\t\tif (expectedValue.asymmetricMatch(actualValue)) {\n\t\t\t\t// When matcher matches, replace expected with actual value\n\t\t\t\t// so they appear the same in the diff\n\t\t\t\texpected[key] = actualValue;\n\t\t\t} else if (\"sample\" in expectedValue && expectedValue.sample !== undefined && isReplaceable(actualValue, expectedValue.sample)) {\n\t\t\t\t// For container matchers (ArrayContaining, ObjectContaining), unwrap and recursively process\n\t\t\t\t// Matcher doesn't match: unwrap but keep structure to show mismatch\n\t\t\t\tconst replaced = replaceAsymmetricMatcher(actualValue, expectedValue.sample, actualReplaced, expectedReplaced);\n\t\t\t\tactual[key] = replaced.replacedActual;\n\t\t\t\texpected[key] = replaced.replacedExpected;\n\t\t\t}\n\t\t} else if (isAsymmetricMatcher(actualValue)) {\n\t\t\tif (actualValue.asymmetricMatch(expectedValue)) {\n\t\t\t\tactual[key] = expectedValue;\n\t\t\t} else if (\"sample\" in actualValue && actualValue.sample !== undefined && isReplaceable(actualValue.sample, expectedValue)) {\n\t\t\t\tconst replaced = replaceAsymmetricMatcher(actualValue.sample, expectedValue, actualReplaced, expectedReplaced);\n\t\t\t\tactual[key] = replaced.replacedActual;\n\t\t\t\texpected[key] = replaced.replacedExpected;\n\t\t\t}\n\t\t} else if (isReplaceable(actualValue, expectedValue)) {\n\t\t\tconst replaced = replaceAsymmetricMatcher(actualValue, expectedValue, actualReplaced, expectedReplaced);\n\t\t\tactual[key] = replaced.replacedActual;\n\t\t\texpected[key] = replaced.replacedExpected;\n\t\t}\n\t});\n\treturn {\n\t\treplacedActual: actual,\n\t\treplacedExpected: expected\n\t};\n}\nfunction getLabelPrinter(...strings) {\n\tconst maxLength = strings.reduce((max, string) => string.length > max ? string.length : max, 0);\n\treturn (string) => `${string}: ${\" \".repeat(maxLength - string.length)}`;\n}\nconst SPACE_SYMBOL = \"·\";\nfunction replaceTrailingSpaces(text) {\n\treturn text.replace(/\\s+$/gm, (spaces) => SPACE_SYMBOL.repeat(spaces.length));\n}\nfunction printReceived(object) {\n\treturn c.red(replaceTrailingSpaces(stringify(object)));\n}\nfunction printExpected(value) {\n\treturn c.green(replaceTrailingSpaces(stringify(value)));\n}\nfunction getCommonAndChangedSubstrings(diffs, op, hasCommonDiff) {\n\treturn diffs.reduce((reduced, diff) => reduced + (diff[0] === DIFF_EQUAL ? diff[1] : diff[0] === op ? hasCommonDiff ? c.inverse(diff[1]) : diff[1] : \"\"), \"\");\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":";;;;;;;;;;;AAoDA,IAAM,OAAN,MAAW;CAGV,YAAY,IAAI,MAAM;AACrB,OAAK,KAAK;AACV,OAAK,KAAK;;;;;;;;;;AAUZ,SAAS,kBAAkB,OAAO,OAAO;AAExC,KAAI,CAAC,SAAS,CAAC,SAAS,MAAM,OAAO,EAAE,KAAK,MAAM,OAAO,EAAE,CAC1D,QAAO;CAIR,IAAI,aAAa;CACjB,IAAI,aAAa,KAAK,IAAI,MAAM,QAAQ,MAAM,OAAO;CACrD,IAAI,aAAa;CACjB,IAAI,eAAe;AACnB,QAAO,aAAa,YAAY;AAC/B,MAAI,MAAM,UAAU,cAAc,WAAW,KAAK,MAAM,UAAU,cAAc,WAAW,EAAE;AAC5F,gBAAa;AACb,kBAAe;QAEf,cAAa;AAEd,eAAa,KAAK,OAAO,aAAa,cAAc,IAAI,WAAW;;AAEpE,QAAO;;;;;;;;AAQR,SAAS,kBAAkB,OAAO,OAAO;AAExC,KAAI,CAAC,SAAS,CAAC,SAAS,MAAM,OAAO,MAAM,SAAS,EAAE,KAAK,MAAM,OAAO,MAAM,SAAS,EAAE,CACxF,QAAO;CAIR,IAAI,aAAa;CACjB,IAAI,aAAa,KAAK,IAAI,MAAM,QAAQ,MAAM,OAAO;CACrD,IAAI,aAAa;CACjB,IAAI,aAAa;AACjB,QAAO,aAAa,YAAY;AAC/B,MAAI,MAAM,UAAU,MAAM,SAAS,YAAY,MAAM,SAAS,WAAW,KAAK,MAAM,UAAU,MAAM,SAAS,YAAY,MAAM,SAAS,WAAW,EAAE;AACpJ,gBAAa;AACb,gBAAa;QAEb,cAAa;AAEd,eAAa,KAAK,OAAO,aAAa,cAAc,IAAI,WAAW;;AAEpE,QAAO;;;;;;;;;;AAUR,SAAS,oBAAoB,OAAO,OAAO;CAE1C,MAAM,eAAe,MAAM;CAC3B,MAAM,eAAe,MAAM;AAE3B,KAAI,iBAAiB,KAAK,iBAAiB,EAC1C,QAAO;AAGR,KAAI,eAAe,aAClB,SAAQ,MAAM,UAAU,eAAe,aAAa;UAC1C,eAAe,aACzB,SAAQ,MAAM,UAAU,GAAG,aAAa;CAEzC,MAAM,cAAc,KAAK,IAAI,cAAc,aAAa;AAExD,KAAI,UAAU,MACb,QAAO;CAKR,IAAI,OAAO;CACX,IAAI,SAAS;AACb,QAAO,MAAM;EACZ,MAAM,UAAU,MAAM,UAAU,cAAc,OAAO;EACrD,MAAM,QAAQ,MAAM,QAAQ,QAAQ;AACpC,MAAI,UAAU,GACb,QAAO;AAER,YAAU;AACV,MAAI,UAAU,KAAK,MAAM,UAAU,cAAc,OAAO,KAAK,MAAM,UAAU,GAAG,OAAO,EAAE;AACxF,UAAO;AACP;;;;;;;;AAQH,SAAS,qBAAqB,OAAO;CACpC,IAAI,UAAU;CACd,MAAM,aAAa,EAAE;CACrB,IAAI,mBAAmB;;CAEvB,IAAI,eAAe;CAEnB,IAAI,UAAU;CAEd,IAAI,qBAAqB;CACzB,IAAI,oBAAoB;CAExB,IAAI,qBAAqB;CACzB,IAAI,oBAAoB;AACxB,QAAO,UAAU,MAAM,QAAQ;AAC9B,MAAI,MAAM,SAAS,OAAA,GAAmB;AAErC,cAAW,sBAAsB;AACjC,wBAAqB;AACrB,uBAAoB;AACpB,wBAAqB;AACrB,uBAAoB;AACpB,kBAAe,MAAM,SAAS;SACxB;AAEN,OAAI,MAAM,SAAS,OAAA,EAClB,uBAAsB,MAAM,SAAS,GAAG;OAExC,sBAAqB,MAAM,SAAS,GAAG;AAIxC,OAAI,gBAAgB,aAAa,UAAU,KAAK,IAAI,oBAAoB,kBAAkB,IAAI,aAAa,UAAU,KAAK,IAAI,oBAAoB,kBAAkB,EAAE;AAErK,UAAM,OAAO,WAAW,mBAAmB,IAAI,GAAG,IAAI,KAAA,IAAkB,aAAa,CAAC;AAEtF,UAAM,WAAW,mBAAmB,KAAK,GAAG,KAAA;AAE5C;AAEA;AACA,cAAU,mBAAmB,IAAI,WAAW,mBAAmB,KAAK;AACpE,yBAAqB;AACrB,wBAAoB;AACpB,yBAAqB;AACrB,wBAAoB;AACpB,mBAAe;AACf,cAAU;;;AAGZ;;AAGD,KAAI,QACH,mBAAkB,MAAM;AAEzB,8BAA6B,MAAM;AAOnC,WAAU;AACV,QAAO,UAAU,MAAM,QAAQ;AAC9B,MAAI,MAAM,UAAU,GAAG,OAAA,MAAsB,MAAM,SAAS,OAAA,GAAoB;GAC/E,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;QAClB,mBAAmB,SAAS,SAAS,KAAK,mBAAmB,UAAU,SAAS,GAAG;AAEtF,WAAM,OAAO,SAAS,GAAG,IAAI,KAAA,GAAiB,UAAU,UAAU,GAAG,gBAAgB,CAAC,CAAC;AACvF,WAAM,UAAU,GAAG,KAAK,SAAS,UAAU,GAAG,SAAS,SAAS,gBAAgB;AAChF,WAAM,UAAU,GAAG,KAAK,UAAU,UAAU,gBAAgB;AAC5D;;cAGG,mBAAmB,SAAS,SAAS,KAAK,mBAAmB,UAAU,SAAS,GAAG;AAGtF,UAAM,OAAO,SAAS,GAAG,IAAI,KAAA,GAAiB,SAAS,UAAU,GAAG,gBAAgB,CAAC,CAAC;AACtF,UAAM,UAAU,GAAG,KAAA;AACnB,UAAM,UAAU,GAAG,KAAK,UAAU,UAAU,GAAG,UAAU,SAAS,gBAAgB;AAClF,UAAM,UAAU,GAAG,KAAA;AACnB,UAAM,UAAU,GAAG,KAAK,SAAS,UAAU,gBAAgB;AAC3D;;AAGF;;AAED;;;AAIF,MAAM,wBAAwB;AAC9B,MAAM,mBAAmB;AACzB,MAAM,kBAAkB;AACxB,MAAM,qBAAqB;AAC3B,MAAM,uBAAuB;;;;;;;AAO7B,SAAS,6BAA6B,OAAO;CAC5C,IAAI,UAAU;AAEd,QAAO,UAAU,MAAM,SAAS,GAAG;AAClC,MAAI,MAAM,UAAU,GAAG,OAAA,KAAqB,MAAM,UAAU,GAAG,OAAA,GAAmB;GAEjF,IAAI,YAAY,MAAM,UAAU,GAAG;GACnC,IAAI,OAAO,MAAM,SAAS;GAC1B,IAAI,YAAY,MAAM,UAAU,GAAG;GAEnC,MAAM,eAAe,kBAAkB,WAAW,KAAK;AACvD,OAAI,cAAc;IACjB,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;;GAG5B,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;AAC9C,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;AAEvG,QAAI,SAAS,WAAW;AACvB,iBAAY;AACZ,qBAAgB;AAChB,gBAAW;AACX,qBAAgB;;;AAGlB,OAAI,MAAM,UAAU,GAAG,OAAO,eAAe;AAE5C,QAAI,cACH,OAAM,UAAU,GAAG,KAAK;SAClB;AACN,WAAM,OAAO,UAAU,GAAG,EAAE;AAC5B;;AAED,UAAM,SAAS,KAAK;AACpB,QAAI,cACH,OAAM,UAAU,GAAG,KAAK;SAClB;AACN,WAAM,OAAO,UAAU,GAAG,EAAE;AAC5B;;;;AAIH;;;;;;;;AAQF,SAAS,kBAAkB,OAAO;AAEjC,OAAM,KAAK,IAAI,KAAA,GAAiB,GAAG,CAAC;CACpC,IAAI,UAAU;CACd,IAAI,eAAe;CACnB,IAAI,eAAe;CACnB,IAAI,cAAc;CAClB,IAAI,cAAc;CAClB,IAAI;AACJ,QAAO,UAAU,MAAM,OACtB,SAAQ,MAAM,SAAS,IAAvB;EACC,KAAA;AACC;AACA,kBAAe,MAAM,SAAS;AAC9B;AACA;EACD,KAAA;AACC;AACA,kBAAe,MAAM,SAAS;AAC9B;AACA;EACD,KAAA;AAEC,OAAI,eAAe,eAAe,GAAG;AACpC,QAAI,iBAAiB,KAAK,iBAAiB,GAAG;AAE7C,oBAAe,kBAAkB,aAAa,YAAY;AAC1D,SAAI,iBAAiB,GAAG;AACvB,UAAI,UAAU,eAAe,eAAe,KAAK,MAAM,UAAU,eAAe,eAAe,GAAG,OAAA,EACjG,OAAM,UAAU,eAAe,eAAe,GAAG,MAAM,YAAY,UAAU,GAAG,aAAa;WACvF;AACN,aAAM,OAAO,GAAG,GAAG,IAAI,KAAA,GAAiB,YAAY,UAAU,GAAG,aAAa,CAAC,CAAC;AAChF;;AAED,oBAAc,YAAY,UAAU,aAAa;AACjD,oBAAc,YAAY,UAAU,aAAa;;AAGlD,oBAAe,kBAAkB,aAAa,YAAY;AAC1D,SAAI,iBAAiB,GAAG;AACvB,YAAM,SAAS,KAAK,YAAY,UAAU,YAAY,SAAS,aAAa,GAAG,MAAM,SAAS;AAC9F,oBAAc,YAAY,UAAU,GAAG,YAAY,SAAS,aAAa;AACzE,oBAAc,YAAY,UAAU,GAAG,YAAY,SAAS,aAAa;;;AAI3E,eAAW,eAAe;AAC1B,UAAM,OAAO,SAAS,eAAe,aAAa;AAClD,QAAI,YAAY,QAAQ;AACvB,WAAM,OAAO,SAAS,GAAG,IAAI,KAAA,IAAkB,YAAY,CAAC;AAC5D;;AAED,QAAI,YAAY,QAAQ;AACvB,WAAM,OAAO,SAAS,GAAG,IAAI,KAAA,GAAkB,YAAY,CAAC;AAC5D;;AAED;cACU,YAAY,KAAK,MAAM,UAAU,GAAG,OAAA,GAAmB;AAEjE,UAAM,UAAU,GAAG,MAAM,MAAM,SAAS;AACxC,UAAM,OAAO,SAAS,EAAE;SAExB;AAED,kBAAe;AACf,kBAAe;AACf,iBAAc;AACd,iBAAc;AACd;;AAGH,KAAI,MAAM,GAAG,GAAG,GAAG,OAAO,GACzB,OAAM,KAAK;CAKZ,IAAI,UAAU;AACd,WAAU;AAEV,QAAO,UAAU,MAAM,SAAS,GAAG;AAClC,MAAI,MAAM,UAAU,GAAG,OAAA,KAAqB,MAAM,UAAU,GAAG,OAAA;OAE1D,MAAM,SAAS,GAAG,UAAU,MAAM,SAAS,GAAG,SAAS,MAAM,UAAU,GAAG,GAAG,OAAO,KAAK,MAAM,UAAU,GAAG,IAAI;AAEnH,UAAM,SAAS,KAAK,MAAM,UAAU,GAAG,KAAK,MAAM,SAAS,GAAG,UAAU,GAAG,MAAM,SAAS,GAAG,SAAS,MAAM,UAAU,GAAG,GAAG,OAAO;AACnI,UAAM,UAAU,GAAG,KAAK,MAAM,UAAU,GAAG,KAAK,MAAM,UAAU,GAAG;AACnE,UAAM,OAAO,UAAU,GAAG,EAAE;AAC5B,cAAU;cACA,MAAM,SAAS,GAAG,UAAU,GAAG,MAAM,UAAU,GAAG,GAAG,OAAO,KAAK,MAAM,UAAU,GAAG,IAAI;AAElG,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;;;AAGZ;;AAGD,KAAI,QACH,mBAAkB,MAAM;;;;;;;;;;;;AAa1B,SAAS,2BAA2B,KAAK,KAAK;AAC7C,KAAI,CAAC,OAAO,CAAC,IAEZ,QAAO;CAOR,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,WAEjB,QAAO;UACG,cAAc,WAExB,QAAO;UACG,oBAAoB,CAAC,eAAe,YAE9C,QAAO;UACG,eAAe,YAEzB,QAAO;UACG,oBAAoB,iBAE9B,QAAO;AAER,QAAO;;;;;;;;AASR,MAAM,kBAAkB;AACxB,MAAM,kBAAkB;AAExB,SAAS,wBAAwB,GAAG;AACnC,QAAO,KAAK,EAAE,cAAc,OAAO,UAAU,eAAe,KAAK,GAAG,UAAU,GAAG,EAAE,aAAa;;AAGjG,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,wCADA,8BAAc,CACuB;AAEtE,SAAS,qBAAqB,MAAM,wBAAwB;AAC3D,QAAO,KAAK,QAAQ,SAAS,UAAU,uBAAuB,MAAM,CAAC;;AAEtE,SAAS,cAAc,MAAM,eAAe,OAAO,WAAW,wBAAwB,iCAAiC;AACtH,QAAO,KAAK,WAAW,IAAI,MAAM,GAAG,UAAU,GAAG,qBAAqB,MAAM,uBAAuB,GAAG,GAAG,cAAc,MAAM,MAAM,UAAU,GAAG,iBAAiB,gCAAgC,WAAW,IAAI,MAAM,GAAG,UAAU,GAAG,kCAAkC,GAAG;;AAE5Q,SAAS,gBAAgB,MAAM,eAAe,EAAE,QAAQ,YAAY,8BAA8B,mCAAmC;AACpI,QAAO,cAAc,MAAM,eAAe,QAAQ,YAAY,8BAA8B,gCAAgC;;AAE7H,SAAS,gBAAgB,MAAM,eAAe,EAAE,QAAQ,YAAY,8BAA8B,mCAAmC;AACpI,QAAO,cAAc,MAAM,eAAe,QAAQ,YAAY,8BAA8B,gCAAgC;;AAE7H,SAAS,gBAAgB,MAAM,eAAe,EAAE,aAAa,iBAAiB,8BAA8B,mCAAmC;AAC9I,QAAO,cAAc,MAAM,eAAe,aAAa,iBAAiB,8BAA8B,gCAAgC;;AAGvI,SAAS,gBAAgB,QAAQ,MAAM,QAAQ,MAAM,EAAE,cAAc;AACpE,QAAO,WAAW,OAAO,SAAS,EAAE,GAAG,OAAO,OAAO,IAAI,SAAS,EAAE,GAAG,OAAO,OAAO,KAAK;;AAM3F,SAAS,yBAAyB,OAAO,SAAS;CACjD,MAAM,UAAU,MAAM;CACtB,MAAM,gBAAgB,QAAQ;CAC9B,MAAM,iBAAiB,gBAAgB;CAEvC,IAAI,UAAU;CACd,IAAI,wBAAwB;CAC5B,IAAI,0BAA0B;CAC9B,IAAI,IAAI;AACR,QAAO,MAAM,SAAS;EACrB,MAAM,SAAS;AACf,SAAO,MAAM,WAAW,MAAM,GAAG,OAAA,EAChC,MAAK;AAEN,MAAI,WAAW,EACd,KAAI,WAAW;OAEV,IAAI,eAAe;AACtB,eAAW,IAAI;AACf,4BAAwB;;aAEf,MAAM,SAAS;GAEzB,MAAM,IAAI,IAAI;AACd,OAAI,IAAI,eAAe;AACtB,eAAW,IAAI;AACf,4BAAwB;;SAEnB;GAEN,MAAM,IAAI,IAAI;AACd,OAAI,IAAI,gBAAgB;AACvB,eAAW,IAAI;AACf,+BAA2B;;;AAI9B,SAAO,MAAM,WAAW,MAAM,GAAG,OAAA,EAChC,MAAK;;CAGP,MAAM,WAAW,4BAA4B,KAAK;AAClD,KAAI,4BAA4B,EAC/B,YAAW,0BAA0B;UAC3B,sBACV,YAAW;CAEZ,MAAM,QAAQ,UAAU;CACxB,MAAM,QAAQ,EAAE;CAChB,IAAI,aAAa;AACjB,KAAI,SACH,OAAM,KAAK,GAAG;CAGf,IAAI,SAAS;CACb,IAAI,SAAS;CACb,IAAI,OAAO;CACX,IAAI,OAAO;CACX,MAAM,kBAAkB,SAAS;EAChC,MAAM,IAAI,MAAM;AAChB,QAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC;AAClE,UAAQ;AACR,UAAQ;;CAET,MAAM,kBAAkB,SAAS;EAChC,MAAM,IAAI,MAAM;AAChB,QAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC;AAClE,UAAQ;;CAET,MAAM,kBAAkB,SAAS;EAChC,MAAM,IAAI,MAAM;AAChB,QAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC;AAClE,UAAQ;;AAGT,KAAI;AACJ,QAAO,MAAM,SAAS;EACrB,IAAI,SAAS;AACb,SAAO,MAAM,WAAW,MAAM,GAAG,OAAA,EAChC,MAAK;AAEN,MAAI,WAAW,EACd,KAAI,WAAW,GAAG;AAEjB,OAAI,IAAI,eAAe;AACtB,aAAS,IAAI;AACb,aAAS;AACT,aAAS;AACT,WAAO;AACP,WAAO;;AAER,QAAK,IAAI,UAAU,QAAQ,YAAY,GAAG,WAAW,EACpD,gBAAe,MAAM,SAAS,GAAG;aAExB,MAAM,SAAS;GAEzB,MAAM,OAAO,IAAI,SAAS,gBAAgB,SAAS,gBAAgB;AACnE,QAAK,IAAI,UAAU,QAAQ,YAAY,MAAM,WAAW,EACvD,gBAAe,MAAM,SAAS,GAAG;SAE5B;GAEN,MAAM,UAAU,IAAI;AACpB,OAAI,UAAU,gBAAgB;IAC7B,MAAM,OAAO,SAAS;AACtB,SAAK,IAAI,UAAU,QAAQ,YAAY,MAAM,WAAW,EACvD,gBAAe,MAAM,SAAS,GAAG;AAElC,UAAM,cAAc,gBAAgB,QAAQ,MAAM,QAAQ,MAAM,QAAQ;AACxE,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,EAC/D,gBAAe,MAAM,SAAS,GAAG;SAGlC,MAAK,IAAI,UAAU,QAAQ,YAAY,GAAG,WAAW,EACpD,gBAAe,MAAM,SAAS,GAAG;;AAKrC,SAAO,MAAM,WAAW,MAAM,GAAG,OAAA,IAAoB;AACpD,kBAAe,MAAM,GAAG,GAAG;AAC3B,QAAK;;AAEN,SAAO,MAAM,WAAW,MAAM,GAAG,OAAA,GAAoB;AACpD,kBAAe,MAAM,GAAG,GAAG;AAC3B,QAAK;;;AAGP,KAAI,SACH,OAAM,cAAc,gBAAgB,QAAQ,MAAM,QAAQ,MAAM,QAAQ;AAEzE,QAAO,MAAM,KAAK,KAAK;;AAMxB,SAAS,uBAAuB,OAAO,SAAS;AAC/C,QAAO,MAAM,KAAK,MAAM,GAAG,UAAU;EACpC,MAAM,OAAO,KAAK;EAClB,MAAM,gBAAgB,MAAM,KAAK,MAAM,MAAM,SAAS;AACtD,UAAQ,KAAK,IAAb;GACC,KAAA,GAAkB,QAAO,gBAAgB,MAAM,eAAe,QAAQ;GACtE,KAAA,EAAkB,QAAO,gBAAgB,MAAM,eAAe,QAAQ;GACtE,QAAS,QAAO,gBAAgB,MAAM,eAAe,QAAQ;;GAE7D,CAAC,KAAK,KAAK;;AAGd,MAAM,WAAW,WAAW;AAC5B,MAAM,uBAAuB;AAC7B,MAAM,kCAAkC;AACxC,SAAS,oBAAoB;AAC5B,QAAO;EACN,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,KAAA;EACb,cAAc;EACd,iCAAiC;EACjC,QAAQ;EACR,qBAAqB;EACrB,qBAAqB;EACrB,YAAYA,EAAE;EACd,qBAAqB;EACrB,mBAAmB;EACnB,oBAAoB;EACpB,yBAAyB;EACzB;;AAEF,SAAS,eAAe,aAAa;AACpC,QAAO,eAAe,OAAO,gBAAgB,aAAa,cAAc,KAAA;;AAEzE,SAAS,gBAAgB,cAAc;AACtC,QAAO,OAAO,iBAAiB,YAAY,OAAO,cAAc,aAAa,IAAI,gBAAgB,IAAI,eAAe;;AAGrH,SAAS,qBAAqB,UAAU,EAAE,EAAE;AAC3C,QAAO;EACN,GAAG,mBAAmB;EACtB,GAAG;EACH,aAAa,eAAe,QAAQ,YAAY;EAChD,cAAc,gBAAgB,QAAQ,aAAa;EACnD;;AAGF,SAAS,cAAc,OAAO;AAC7B,QAAO,MAAM,WAAW,KAAK,MAAM,GAAG,WAAW;;AAElD,SAAS,aAAa,OAAO;CAC5B,IAAI,IAAI;CACR,IAAI,IAAI;AACR,OAAM,SAAS,SAAS;AACvB,UAAQ,KAAK,IAAb;GACC,KAAA;AACC,SAAK;AACL;GACD,KAAA;AACC,SAAK;AACL;;GAED;AACF,QAAO;EACN;EACA;EACA;;AAEF,SAAS,gBAAgB,EAAE,aAAa,QAAQ,YAAY,aAAa,QAAQ,YAAY,qBAAqB,uBAAuB,cAAc;AACtJ,KAAI,oBACH,QAAO;CAER,IAAI,QAAQ;CACZ,IAAI,QAAQ;AACZ,KAAI,qBAAqB;EACxB,MAAM,SAAS,OAAO,aAAa,EAAE;EACrC,MAAM,SAAS,OAAO,aAAa,EAAE;EAErC,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;EAE3E,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;;CAEjE,MAAM,IAAI,GAAG,WAAW,GAAG,cAAc;CACzC,MAAM,IAAI,GAAG,WAAW,GAAG,cAAc;AACzC,QAAO,GAAG,OAAO,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC;;AAEnC,SAAS,eAAe,OAAO,WAAW,SAAS;AAClD,QAAO,gBAAgB,SAAS,aAAa,MAAM,CAAC,IAAI,QAAQ,SAAS,uBAAuB,OAAO,QAAQ,GAAG,yBAAyB,OAAO,QAAQ,KAAK,YAAY,QAAQ,wBAAwB,KAAK,QAAQ,qBAAqB,GAAG;;AAGjP,SAAS,iBAAiB,QAAQ,QAAQ,SAAS;CAClD,MAAM,oBAAoB,qBAAqB,QAAQ;CACvD,MAAM,CAAC,OAAO,aAAa,aAAa,cAAc,OAAO,GAAG,EAAE,GAAG,QAAQ,cAAc,OAAO,GAAG,EAAE,GAAG,QAAQ,kBAAkB;AACpI,QAAO,eAAe,OAAO,WAAW,kBAAkB;;AAK3D,SAAS,kBAAkB,eAAe,eAAe,eAAe,eAAe,SAAS;AAC/F,KAAI,cAAc,cAAc,IAAI,cAAc,cAAc,EAAE;AACjE,kBAAgB,EAAE;AAClB,kBAAgB,EAAE;;AAEnB,KAAI,cAAc,cAAc,IAAI,cAAc,cAAc,EAAE;AACjE,kBAAgB,EAAE;AAClB,kBAAgB,EAAE;;AAEnB,KAAI,cAAc,WAAW,cAAc,UAAU,cAAc,WAAW,cAAc,OAE3F,QAAO,iBAAiB,eAAe,eAAe,QAAQ;CAE/D,MAAM,CAAC,OAAO,aAAa,aAAa,eAAe,eAAe,QAAQ;CAE9E,IAAI,SAAS;CACb,IAAI,SAAS;AACb,OAAM,SAAS,SAAS;AACvB,UAAQ,KAAK,IAAb;GACC,KAAA;AACC,SAAK,KAAK,cAAc;AACxB,cAAU;AACV;GACD,KAAA;AACC,SAAK,KAAK,cAAc;AACxB,cAAU;AACV;GACD;AACC,SAAK,KAAK,cAAc;AACxB,cAAU;AACV,cAAU;;GAEX;AACF,QAAO,eAAe,OAAO,WAAW,qBAAqB,QAAQ,CAAC;;AAGvE,SAAS,aAAa,QAAQ,QAAQ,SAAS;CAC9C,MAAM,WAAW,SAAS,qBAAqB;CAC/C,MAAM,oBAAoB,KAAK,IAAI,KAAK,MAAM,SAAS,qBAAqB,EAAE,EAAE,EAAE;CAClF,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,QAAQ,WAAW,OAAO,YAAY,OAAO;CAC/D,MAAM,QAAQ,EAAE;CAChB,IAAI,SAAS;CACb,IAAI,SAAS;CACb,MAAM,oBAAoB,SAAS,SAAS,YAAY;AACvD,SAAO,WAAW,SAAS,UAAU,EACpC,OAAM,KAAK,IAAI,KAAA,IAAkB,OAAO,QAAQ,CAAC;AAElD,SAAO,WAAW,SAAS,UAAU,EACpC,OAAM,KAAK,IAAI,KAAA,GAAkB,OAAO,QAAQ,CAAC;AAElD,SAAO,YAAY,GAAG,WAAW,GAAG,UAAU,GAAG,UAAU,EAC1D,OAAM,KAAK,IAAI,KAAA,GAAiB,OAAO,QAAQ,CAAC;;AAGlD,eAAc,SAAS,SAAS,UAAU,iBAAiB;AAE3D,QAAO,WAAW,SAAS,UAAU,EACpC,OAAM,KAAK,IAAI,KAAA,IAAkB,OAAO,QAAQ,CAAC;AAElD,QAAO,WAAW,SAAS,UAAU,EACpC,OAAM,KAAK,IAAI,KAAA,GAAkB,OAAO,QAAQ,CAAC;AAElD,QAAO,CAAC,OAAO,UAAU;;AAK1B,SAAS,QAAQ,OAAO;AACvB,KAAI,UAAU,KAAA,EACb,QAAO;UACG,UAAU,KACpB,QAAO;UACG,MAAM,QAAQ,MAAM,CAC9B,QAAO;UACG,OAAO,UAAU,UAC3B,QAAO;UACG,OAAO,UAAU,WAC3B,QAAO;UACG,OAAO,UAAU,SAC3B,QAAO;UACG,OAAO,UAAU,SAC3B,QAAO;UACG,OAAO,UAAU,SAC3B,QAAO;UACG,OAAO,UAAU,UAAU;AACrC,MAAI,SAAS;OACR,MAAM,gBAAgB,OACzB,QAAO;YACG,MAAM,gBAAgB,IAChC,QAAO;YACG,MAAM,gBAAgB,IAChC,QAAO;YACG,MAAM,gBAAgB,KAChC,QAAO;;AAGT,SAAO;YACG,OAAO,UAAU,SAC3B,QAAO;AAER,OAAM,IAAI,MAAM,0BAA0B,QAAQ;;AAInD,SAAS,iBAAiB,QAAQ;AACjC,QAAO,OAAO,SAAS,OAAO,GAAG,SAAS;;AAE3C,SAAS,YAAY,GAAG,GAAG,SAAS;CACnC,MAAM,WAAW,SAAS,qBAAqB;CAC/C,MAAM,oBAAoB,KAAK,IAAI,KAAK,MAAM,SAAS,qBAAqB,EAAE,EAAE,EAAE;CAClF,IAAI,UAAU,EAAE;CAChB,IAAI,UAAU,EAAE;AAChB,KAAI,UAAU;EACb,MAAM,iBAAiB,EAAE,SAAS,KAAK;EACvC,MAAM,iBAAiB,EAAE,SAAS,KAAK;EACvC,MAAM,iBAAiB,iBAAiB,EAAE;EAC1C,MAAM,iBAAiB,iBAAiB,EAAE;EAE1C,MAAM,KAAK,iBAAiB,GAAG,EAAE,MAAM,gBAAgB,kBAAkB,CAAC,KAAK,eAAe,CAAC,MAAM;EACrG,MAAM,KAAK,iBAAiB,GAAG,EAAE,MAAM,gBAAgB,kBAAkB,CAAC,KAAK,eAAe,CAAC,MAAM;AACrG,YAAU,GAAG;AACb,YAAU,GAAG;;CAEd,MAAM,YAAY,YAAY,EAAE,UAAU,YAAY,EAAE;CACxD,MAAM,YAAY,QAAQ,WAAW,EAAE,YAAY,EAAE;CACrD,IAAI,SAAS;CACb,IAAI,SAAS;CACb,MAAM,QAAQ,EAAE;CAChB,MAAM,oBAAoB,SAAS,SAAS,YAAY;AACvD,MAAI,WAAW,QACd,OAAM,KAAK,IAAI,KAAA,IAAkB,EAAE,MAAM,QAAQ,QAAQ,CAAC,CAAC;AAE5D,MAAI,WAAW,QACd,OAAM,KAAK,IAAI,KAAA,GAAkB,EAAE,MAAM,QAAQ,QAAQ,CAAC,CAAC;AAE5D,WAAS,UAAU;AACnB,WAAS,UAAU;AACnB,QAAM,KAAK,IAAI,KAAA,GAAiB,EAAE,MAAM,SAAS,OAAO,CAAC,CAAC;;AAE3D,eAAc,SAAS,SAAS,UAAU,iBAAiB;AAE3D,KAAI,WAAW,QACd,OAAM,KAAK,IAAI,KAAA,IAAkB,EAAE,MAAM,OAAO,CAAC,CAAC;AAEnD,KAAI,WAAW,QACd,OAAM,KAAK,IAAI,KAAA,GAAkB,EAAE,MAAM,OAAO,CAAC,CAAC;AAEnD,QAAO,CAAC,OAAO,UAAU;;AAO1B,SAAS,yBAAyB,IAAI,OAAO,aAAa;AACzD,QAAO,MAAM,QAAQ,SAAS,SAAS,WAAW,KAAK,OAAA,IAAoB,KAAK,KAAK,KAAK,OAAO,MAAM,KAAK,GAAG,WAAW,IAAI,YAAY,KAAK,GAAG,GAAG,KAAK,GAAG;;AAG9J,IAAM,eAAN,MAAmB;CAKlB,YAAY,IAAI,aAAa;AAC5B,OAAK,KAAK;AACV,OAAK,OAAO,EAAE;AACd,OAAK,QAAQ,EAAE;AACf,OAAK,cAAc;;CAEpB,cAAc,WAAW;AACxB,OAAK,SAAS,IAAI,KAAK,KAAK,IAAI,UAAU,CAAC;;CAE5C,WAAW;AAMV,OAAK,MAAM,KAAK,KAAK,KAAK,WAAW,IAAI,IAAI,KAAK,KAAK,IAAI,yBAAyB,KAAK,IAAI,KAAK,MAAM,KAAK,YAAY,CAAC,GAAG,KAAK,KAAK,GAAG,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,GAAG,GAAG,CAAC;AAC7M,OAAK,KAAK,SAAS;;CAEpB,cAAc;AACb,SAAO,KAAK,KAAK,WAAW;;CAG7B,SAAS,MAAM;AACd,OAAK,KAAK,KAAK,KAAK;;CAGrB,MAAM,MAAM;EACX,MAAM,SAAS,KAAK;AACpB,MAAI,OAAO,SAAS,KAAK,EAAE;GAC1B,MAAM,aAAa,OAAO,MAAM,KAAK;GACrC,MAAM,QAAQ,WAAW,SAAS;AAClC,cAAW,SAAS,WAAW,MAAM;AACpC,QAAI,IAAI,OAAO;AAGd,UAAK,cAAc,UAAU;AAC7B,UAAK,UAAU;eACL,UAAU,WAAW,EAI/B,MAAK,cAAc,UAAU;KAE7B;QAGF,MAAK,SAAS,KAAK;;CAIrB,YAAY,OAAO;AAClB,MAAI,CAAC,KAAK,aAAa,CACtB,MAAK,UAAU;AAEhB,QAAM,KAAK,GAAG,KAAK,MAAM;AACzB,OAAK,MAAM,SAAS;;;AAItB,IAAM,eAAN,MAAmB;CAIlB,YAAY,cAAc,cAAc;AACvC,OAAK,eAAe;AACpB,OAAK,eAAe;AACpB,OAAK,QAAQ,EAAE;;CAEhB,mBAAmB,MAAM;AACxB,OAAK,MAAM,KAAK,KAAK;;CAEtB,oBAAoB,MAAM;EACzB,MAAM,cAAc,KAAK,GAAG,WAAW;AAEvC,MAAI,CAAC,eAAe,KAAK,aAAa,aAAa,CAClD,MAAK,aAAa,SAAS,KAAK;AAEjC,MAAI,CAAC,eAAe,KAAK,aAAa,aAAa,CAClD,MAAK,aAAa,SAAS,KAAK;;CAGlC,mBAAmB;AAClB,OAAK,aAAa,YAAY,KAAK,MAAM;AACzC,OAAK,aAAa,YAAY,KAAK,MAAM;;CAG1C,MAAM,MAAM;EACX,MAAM,KAAK,KAAK;EAChB,MAAM,SAAS,KAAK;AACpB,MAAI,OAAO,SAAS,KAAK,EAAE;GAC1B,MAAM,aAAa,OAAO,MAAM,KAAK;GACrC,MAAM,QAAQ,WAAW,SAAS;AAClC,cAAW,SAAS,WAAW,MAAM;AACpC,QAAI,MAAM,GAAG;KACZ,MAAM,UAAU,IAAI,KAAK,IAAI,UAAU;AACvC,SAAI,KAAK,aAAa,aAAa,IAAI,KAAK,aAAa,aAAa,EAAE;AAGvE,WAAK,kBAAkB;AACvB,WAAK,mBAAmB,QAAQ;YAC1B;AAGN,WAAK,oBAAoB,QAAQ;AACjC,WAAK,kBAAkB;;eAEd,IAAI,MAEd,MAAK,mBAAmB,IAAI,KAAK,IAAI,UAAU,CAAC;aACtC,UAAU,WAAW,EAI/B,MAAK,oBAAoB,IAAI,KAAK,IAAI,UAAU,CAAC;KAEjD;QAKF,MAAK,oBAAoB,KAAK;;CAIhC,WAAW;AACV,OAAK,kBAAkB;AACvB,SAAO,KAAK;;;AAad,SAAS,gBAAgB,OAAO,aAAa;CAC5C,MAAM,eAAe,IAAI,aAAA,IAA0B,YAAY;CAC/D,MAAM,eAAe,IAAI,aAAA,GAA0B,YAAY;CAC/D,MAAM,eAAe,IAAI,aAAa,cAAc,aAAa;AACjE,OAAM,SAAS,SAAS;AACvB,UAAQ,KAAK,IAAb;GACC,KAAA;AACC,iBAAa,MAAM,KAAK;AACxB;GACD,KAAA;AACC,iBAAa,MAAM,KAAK;AACxB;GACD,QAAS,cAAa,MAAM,KAAK;;GAEjC;AACF,QAAO,aAAa,UAAU;;AAG/B,SAAS,cAAc,OAAO,aAAa;AAC1C,KAAI,aAAa;EAEhB,MAAM,QAAQ,MAAM,SAAS;AAC7B,SAAO,MAAM,MAAM,MAAM,MAAM,KAAK,OAAA,MAAsB,MAAM,SAAS,KAAK,OAAO,MAAM;;AAE5F,QAAO,MAAM,MAAM,SAAS,KAAK,OAAA,EAAkB;;AAIpD,SAAS,mBAAmB,GAAG,GAAG,SAAS;AAC1C,KAAI,MAAM,KAAK,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG;EAChD,MAAM,cAAc,EAAE,SAAS,KAAK,IAAI,EAAE,SAAS,KAAK;EAExD,MAAM,CAAC,OAAO,aAAa,eAAe,cAAc,GAAG,EAAE,MAAM,GAAG,cAAc,GAAG,EAAE,MAAM,GAAG,MAAM,QAAQ;AAChH,MAAI,cAAc,OAAO,YAAY,EAAE;GACtC,MAAM,oBAAoB,qBAAqB,QAAQ;AAEvD,UAAO,eADO,gBAAgB,OAAO,kBAAkB,YAAY,EACtC,WAAW,kBAAkB;;;AAI5D,QAAO,iBAAiB,EAAE,MAAM,KAAK,EAAE,EAAE,MAAM,KAAK,EAAE,QAAQ;;AAI/D,SAAS,eAAe,GAAG,GAAG,SAAS,SAAS;CAC/C,MAAM,CAAC,OAAO,aAAa,YAAY,GAAG,GAAG,QAAQ;AACrD,KAAI,QACH,sBAAqB,MAAM;AAE5B,QAAO,CAAC,OAAO,UAAU;;AAG1B,SAAS,iBAAiB,SAAS,SAAS;CAC3C,MAAM,EAAE,gBAAgB,qBAAqB,QAAQ;AACrD,QAAO,YAAY,QAAQ;;AAE5B,MAAM,EAAE,mBAAmB,eAAe,YAAY,WAAW,cAAc,uBAAuB;AACtG,MAAM,UAAU;CACf;CACA;CACA;CACA;CACA;CACA;CACA,QAAQ;CACR;AACD,MAAM,iBAAiB;CACtB,UAAU;CACV,SAAS;CACT;AACD,MAAM,0BAA0B;CAC/B,YAAY;CACZ,UAAU;CACV,SAAS;CACT;;;;;;;AASD,SAAS,KAAK,GAAG,GAAG,SAAS;AAC5B,KAAI,OAAO,GAAG,GAAG,EAAE,CAClB,QAAO;CAER,MAAM,QAAQ,QAAQ,EAAE;CACxB,IAAI,eAAe;CACnB,IAAI,iBAAiB;AACrB,KAAI,UAAU,YAAY,OAAO,EAAE,oBAAoB,YAAY;AAClE,MAAI,EAAE,aAAa,OAAO,IAAI,yBAAyB,CAEtD;AAED,MAAI,OAAO,EAAE,oBAAoB,WAEhC;AAED,iBAAe,EAAE,iBAAiB;AAGlC,mBAAiB,iBAAiB;;AAEnC,KAAI,iBAAiB,QAAQ,EAAE,EAAE;EAChC,MAAM,EAAE,aAAa,QAAQ,YAAY,aAAa,QAAQ,eAAe,qBAAqB,QAAQ;EAC1G,MAAM,gBAAgB,iBAAiB,yBAAyB,QAAQ;EACxE,IAAI,WAAW,OAAO,GAAG,cAAc;EACvC,IAAI,WAAW,OAAO,GAAG,cAAc;EAKvC,MAAM,aAAa;EACnB,SAAS,SAAS,GAAG;AACpB,UAAO,EAAE,UAAU,aAAa,IAAI,GAAG,EAAE,MAAM,GAAG,WAAW,CAAC;;AAE/D,aAAW,SAAS,SAAS;AAC7B,aAAW,SAAS,SAAS;AAG7B,SAAO,GAFO,GAAG,OAAO,GAAG,WAAW,GAAG,YAAY,GAAG,CAAC,IAAI,WAE7C,MADF,GAAG,OAAO,GAAG,WAAW,GAAG,YAAY,GAAG,CAAC,IAAI;;AAG9D,KAAI,eACH;AAED,SAAQ,OAAR;EACC,KAAK,SAAU,QAAO,iBAAiB,EAAE,MAAM,KAAK,EAAE,EAAE,MAAM,KAAK,EAAE,QAAQ;EAC7E,KAAK;EACL,KAAK,SAAU,QAAO,iBAAiB,GAAG,GAAG,QAAQ;EACrD,KAAK,MAAO,QAAO,eAAe,QAAQ,EAAE,EAAE,QAAQ,EAAE,EAAE,QAAQ;EAClE,KAAK,MAAO,QAAO,eAAe,QAAQ,EAAE,EAAE,QAAQ,EAAE,EAAE,QAAQ;EAClE,QAAS,QAAO,eAAe,GAAG,GAAG,QAAQ;;;AAG/C,SAAS,iBAAiB,GAAG,GAAG,SAAS;CACxC,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;;AAEtG,SAAS,QAAQ,KAAK;AACrB,QAAO,IAAI,IAAI,MAAM,KAAK,IAAI,SAAS,CAAC,CAAC,MAAM,CAAC;;AAEjD,SAAS,QAAQ,KAAK;AACrB,QAAO,IAAI,IAAI,MAAM,KAAK,IAAI,QAAQ,CAAC,CAAC,MAAM,CAAC;;AAEhD,SAAS,eAAe,GAAG,GAAG,SAAS;CACtC,IAAI;CACJ,IAAI,YAAY;AAChB,KAAI;AAEH,eAAa,qBAAqB,GAAG,GADf,iBAAiB,gBAAgB,QAAQ,EACR,QAAQ;SACxD;AACP,cAAY;;CAEb,MAAM,gBAAgB,iBAAiB,iBAAiB,QAAQ;AAGhE,KAAI,eAAe,KAAA,KAAa,eAAe,eAAe;AAE7D,eAAa,qBAAqB,GAAG,GADf,iBAAiB,yBAAyB,QAAQ,EACjB,QAAQ;AAC/D,MAAI,eAAe,iBAAiB,CAAC,UACpC,cAAa,GAAG,iBAAiB,iBAAiB,QAAQ,CAAC,MAAM;;AAGnE,QAAO;;AAER,SAAS,iBAAiB,eAAe,SAAS;CACjD,MAAM,EAAE,aAAa,qBAAqB,aAAa,qBAAqB,QAAQ;AACpF,QAAO;EACN,GAAG;EACH;EACA;EACA,UAAU,YAAY,cAAc;EACpC;;AAEF,SAAS,qBAAqB,GAAG,GAAG,eAAe,SAAS;CAC3D,MAAM,0BAA0B;EAC/B,GAAG;EACH,QAAQ;EACR;CACD,MAAM,WAAW,OAAO,GAAG,wBAAwB;CACnD,MAAM,WAAW,OAAO,GAAG,wBAAwB;AACnD,KAAI,aAAa,SAChB,QAAO,iBAAiB,iBAAiB,QAAQ;MAC3C;EACN,MAAM,WAAW,OAAO,GAAG,cAAc;EACzC,MAAM,WAAW,OAAO,GAAG,cAAc;AACzC,SAAO,kBAAkB,SAAS,MAAM,KAAK,EAAE,SAAS,MAAM,KAAK,EAAE,SAAS,MAAM,KAAK,EAAE,SAAS,MAAM,KAAK,EAAE,QAAQ;;;AAG3H,MAAM,yBAAyB;AAC/B,SAAS,oBAAoB,MAAM;AAElC,QADa,UAAU,KAAK,KACZ,YAAY,OAAO,KAAK,oBAAoB;;AAE7D,SAAS,cAAc,MAAM,MAAM;CAClC,MAAM,WAAW,UAAU,KAAK;AAEhC,QAAO,aADU,UAAU,KAAK,KACC,aAAa,YAAY,aAAa;;AAExE,SAAS,qBAAqB,UAAU,UAAU,SAAS;CAC1D,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;AAClO,MAAI,SAAS,SAAS,KAAK,IAAI,SAAS,SAAS,KAAK,CACrD,QAAO,mBAAmB,UAAU,UAAU,QAAQ;EAEvD,MAAM,CAAC,SAAS,eAAe,UAAU,UAAU,KAAK;EACxD,MAAM,gBAAgB,MAAM,MAAM,SAAS,KAAK,OAAA,EAAkB;EAClE,MAAM,aAAa,gBAAgB,aAAa,YAAY;AAG5D,SAAO,GAFc,WAAW,YAAY,GAAG,cAAc,8BAA8B,OAAA,IAAoB,cAAc,CAAC,CAEvG,IADF,WAAW,YAAY,GAAG,cAAc,8BAA8B,OAAA,GAAoB,cAAc,CAAC;;CAI/H,MAAM,iBAAiB,UAAU,UAAU,EAAE,eAAe,MAAM,CAAC;CAEnE,MAAM,EAAE,kBAAkB,mBAAmB,yBADtB,UAAU,UAAU,EAAE,eAAe,MAAM,CAAC,EACmB,eAAe;AAErG,QADmB,KAAK,kBAAkB,gBAAgB,QAAQ;;AAYnE,SAAS,yBAAyB,QAAQ,UAAU,iCAAiB,IAAI,SAAS,EAAE,mCAAmB,IAAI,SAAS,EAAE;AAErH,KAAI,kBAAkB,SAAS,oBAAoB,SAAS,OAAO,OAAO,UAAU,eAAe,OAAO,SAAS,UAAU,aAAa;AACzI,SAAO,OAAO;AACd,SAAO;GACN,gBAAgB;GAChB,kBAAkB;GAClB;;AAEF,KAAI,CAAC,cAAc,QAAQ,SAAS,CACnC,QAAO;EACN,gBAAgB;EAChB,kBAAkB;EAClB;AAEF,KAAI,eAAe,IAAI,OAAO,IAAI,iBAAiB,IAAI,SAAS,CAC/D,QAAO;EACN,gBAAgB;EAChB,kBAAkB;EAClB;AAEF,gBAAe,IAAI,OAAO;AAC1B,kBAAiB,IAAI,SAAS;AAC9B,kBAAiB,SAAS,CAAC,SAAS,QAAQ;EAC3C,MAAM,gBAAgB,SAAS;EAC/B,MAAM,cAAc,OAAO;AAC3B,MAAI,oBAAoB,cAAc;OACjC,cAAc,gBAAgB,YAAY,CAG7C,UAAS,OAAO;YACN,YAAY,iBAAiB,cAAc,WAAW,KAAA,KAAa,cAAc,aAAa,cAAc,OAAO,EAAE;IAG/H,MAAM,WAAW,yBAAyB,aAAa,cAAc,QAAQ,gBAAgB,iBAAiB;AAC9G,WAAO,OAAO,SAAS;AACvB,aAAS,OAAO,SAAS;;aAEhB,oBAAoB,YAAY;OACtC,YAAY,gBAAgB,cAAc,CAC7C,QAAO,OAAO;YACJ,YAAY,eAAe,YAAY,WAAW,KAAA,KAAa,cAAc,YAAY,QAAQ,cAAc,EAAE;IAC3H,MAAM,WAAW,yBAAyB,YAAY,QAAQ,eAAe,gBAAgB,iBAAiB;AAC9G,WAAO,OAAO,SAAS;AACvB,aAAS,OAAO,SAAS;;aAEhB,cAAc,aAAa,cAAc,EAAE;GACrD,MAAM,WAAW,yBAAyB,aAAa,eAAe,gBAAgB,iBAAiB;AACvG,UAAO,OAAO,SAAS;AACvB,YAAS,OAAO,SAAS;;GAEzB;AACF,QAAO;EACN,gBAAgB;EAChB,kBAAkB;EAClB;;AAEF,SAAS,gBAAgB,GAAG,SAAS;CACpC,MAAM,YAAY,QAAQ,QAAQ,KAAK,WAAW,OAAO,SAAS,MAAM,OAAO,SAAS,KAAK,EAAE;AAC/F,SAAQ,WAAW,GAAG,OAAO,IAAI,IAAI,OAAO,YAAY,OAAO,OAAO;;AAEvE,MAAM,eAAe;AACrB,SAAS,sBAAsB,MAAM;AACpC,QAAO,KAAK,QAAQ,WAAW,WAAW,aAAa,OAAO,OAAO,OAAO,CAAC;;AAE9E,SAAS,cAAc,QAAQ;AAC9B,QAAOA,EAAE,IAAI,sBAAsB,UAAU,OAAO,CAAC,CAAC;;AAEvD,SAAS,cAAc,OAAO;AAC7B,QAAOA,EAAE,MAAM,sBAAsB,UAAU,MAAM,CAAC,CAAC;;AAExD,SAAS,8BAA8B,OAAO,IAAI,eAAe;AAChE,QAAO,MAAM,QAAQ,SAAS,SAAS,WAAW,KAAK,OAAA,IAAoB,KAAK,KAAK,KAAK,OAAO,KAAK,gBAAgBA,EAAE,QAAQ,KAAK,GAAG,GAAG,KAAK,KAAK,KAAK,GAAG"}

package/dist/node_modules/@vitest/utils/dist/display.d.ts

@@ -0,0 +1,15 @@
+import { PrettyFormatOptions } from "../../pretty-format/dist/index.js";
+
+//#region ../../node_modules/@vitest/utils/dist/display.d.ts
+interface StringifyOptions extends PrettyFormatOptions {
+  maxLength?: number;
+  filterNode?: string | ((node: any) => boolean);
+}
+declare function stringify(object: unknown, maxDepth?: number, {
+  maxLength,
+  filterNode,
+  ...options
+}?: StringifyOptions): string;
+//#endregion
+export { stringify };
+//# sourceMappingURL=display.d.ts.map

package/dist/node_modules/@vitest/utils/dist/display.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"display.d.ts","names":["PrettyFormatOptions","Inspect","Options","value","options","showHidden","depth","colors","customInspect","showProxy","maxArrayLength","breakLength","truncate","seen","inspect","stylize","styleType","LoupeOptions","Partial","StringifyOptions","maxLength","filterNode","node","stringify","object","maxDepth","formatRegExp","RegExp","format","args","browserFormat","obj","objDisplay"],"sources":["../../../../../../../node_modules/@vitest/utils/dist/display.d.ts"],"x_google_ignoreList":[0],"mappings":";;;UAiBUmB,gBAAAA,SAAyBnB,mBAAAA;EAClCoB,SAAAA;EACAC,UAAAA,cAAwBC,IAAAA;AAAAA;AAAAA,iBAERC,SAAAA,CAAUC,MAAAA,WAAiBC,QAAAA;EAAqBL,SAAAA;EAAWC,UAAAA;EAAAA,GAAejB;AAAAA,IAAYe,gBAAAA"}