@casual-simulation/expect 2.0.18

package/src/diff/cleanupSemantic.js

@@ -0,0 +1,526 @@
+/**
+ * Diff Match and Patch
+ * Copyright 2018 The diff-match-patch Authors.
+ * https://github.com/google/diff-match-patch
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * @fileoverview Computes the difference between two texts to create a patch.
+ * Applies the patch onto another text, allowing for errors.
+ * @author fraser@google.com (Neil Fraser)
+ */
+/**
+ * CHANGES by pedrottimark to diff_match_patch_uncompressed.ts file:
+ *
+ * 1. Delete anything not needed to use diff_cleanupSemantic method
+ * 2. Convert from prototype properties to var declarations
+ * 3. Convert Diff to class from constructor and prototype
+ * 4. Add type annotations for arguments and return values
+ * 5. Add exports
+ */
+/**
+ * The data structure representing a diff is an array of tuples:
+ * [[DIFF_DELETE, 'Hello'], [DIFF_INSERT, 'Goodbye'], [DIFF_EQUAL, ' world.']]
+ * which means: delete 'Hello', add 'Goodbye' and keep ' world.'
+ */
+var DIFF_DELETE = -1;
+var DIFF_INSERT = 1;
+var DIFF_EQUAL = 0;
+/**
+ * Class representing one diff tuple.
+ * Attempts to look like a two-element array (which is what this used to be).
+ * @param {number} op Operation, one of: DIFF_DELETE, DIFF_INSERT, DIFF_EQUAL.
+ * @param {string} text Text to be deleted, inserted, or retained.
+ * @constructor
+ */
+class Diff {
+    constructor(op, text) {
+        this[0] = op;
+        this[1] = text;
+    }
+}
+/**
+ * Determine the common prefix of two strings.
+ * @param {string} text1 First string.
+ * @param {string} text2 Second string.
+ * @return {number} The number of characters common to the start of each
+ *     string.
+ */
+var diff_commonPrefix = function (text1, text2) {
+    // Quick check for common null cases.
+    if (!text1 || !text2 || text1.charAt(0) != text2.charAt(0)) {
+        return 0;
+    }
+    // Binary search.
+    // Performance analysis: https://neil.fraser.name/news/2007/10/09/
+    var pointermin = 0;
+    var pointermax = Math.min(text1.length, text2.length);
+    var pointermid = pointermax;
+    var pointerstart = 0;
+    while (pointermin < pointermid) {
+        if (text1.substring(pointerstart, pointermid) ==
+            text2.substring(pointerstart, pointermid)) {
+            pointermin = pointermid;
+            pointerstart = pointermin;
+        }
+        else {
+            pointermax = pointermid;
+        }
+        pointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);
+    }
+    return pointermid;
+};
+/**
+ * Determine the common suffix of two strings.
+ * @param {string} text1 First string.
+ * @param {string} text2 Second string.
+ * @return {number} The number of characters common to the end of each string.
+ */
+var diff_commonSuffix = function (text1, text2) {
+    // Quick check for common null cases.
+    if (!text1 ||
+        !text2 ||
+        text1.charAt(text1.length - 1) != text2.charAt(text2.length - 1)) {
+        return 0;
+    }
+    // Binary search.
+    // Performance analysis: https://neil.fraser.name/news/2007/10/09/
+    var pointermin = 0;
+    var pointermax = Math.min(text1.length, text2.length);
+    var pointermid = pointermax;
+    var pointerend = 0;
+    while (pointermin < pointermid) {
+        if (text1.substring(text1.length - pointermid, text1.length - pointerend) ==
+            text2.substring(text2.length - pointermid, text2.length - pointerend)) {
+            pointermin = pointermid;
+            pointerend = pointermin;
+        }
+        else {
+            pointermax = pointermid;
+        }
+        pointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);
+    }
+    return pointermid;
+};
+/**
+ * Determine if the suffix of one string is the prefix of another.
+ * @param {string} text1 First string.
+ * @param {string} text2 Second string.
+ * @return {number} The number of characters common to the end of the first
+ *     string and the start of the second string.
+ * @private
+ */
+var diff_commonOverlap_ = function (text1, text2) {
+    // Cache the text lengths to prevent multiple calls.
+    var text1_length = text1.length;
+    var text2_length = text2.length;
+    // Eliminate the null case.
+    if (text1_length == 0 || text2_length == 0) {
+        return 0;
+    }
+    // Truncate the longer string.
+    if (text1_length > text2_length) {
+        text1 = text1.substring(text1_length - text2_length);
+    }
+    else if (text1_length < text2_length) {
+        text2 = text2.substring(0, text1_length);
+    }
+    var text_length = Math.min(text1_length, text2_length);
+    // Quick check for the worst case.
+    if (text1 == text2) {
+        return text_length;
+    }
+    // Start by looking for a single character match
+    // and increase length until no match is found.
+    // Performance analysis: https://neil.fraser.name/news/2010/11/04/
+    var best = 0;
+    var length = 1;
+    while (true) {
+        var pattern = text1.substring(text_length - length);
+        var found = text2.indexOf(pattern);
+        if (found == -1) {
+            return best;
+        }
+        length += found;
+        if (found == 0 ||
+            text1.substring(text_length - length) == text2.substring(0, length)) {
+            best = length;
+            length++;
+        }
+    }
+};
+/**
+ * Reduce the number of edits by eliminating semantically trivial equalities.
+ * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.
+ */
+var diff_cleanupSemantic = function (diffs) {
+    var changes = false;
+    var equalities = []; // Stack of indices where equalities are found.
+    var equalitiesLength = 0; // Keeping our own length var is faster in JS.
+    /** @type {?string} */
+    var lastEquality = null;
+    // Always equal to diffs[equalities[equalitiesLength - 1]][1]
+    var pointer = 0; // Index of current position.
+    // Number of characters that changed prior to the equality.
+    var length_insertions1 = 0;
+    var length_deletions1 = 0;
+    // Number of characters that changed after the equality.
+    var length_insertions2 = 0;
+    var length_deletions2 = 0;
+    while (pointer < diffs.length) {
+        if (diffs[pointer][0] == DIFF_EQUAL) {
+            // Equality found.
+            equalities[equalitiesLength++] = pointer;
+            length_insertions1 = length_insertions2;
+            length_deletions1 = length_deletions2;
+            length_insertions2 = 0;
+            length_deletions2 = 0;
+            lastEquality = diffs[pointer][1];
+        }
+        else {
+            // An insertion or deletion.
+            if (diffs[pointer][0] == DIFF_INSERT) {
+                length_insertions2 += diffs[pointer][1].length;
+            }
+            else {
+                length_deletions2 += diffs[pointer][1].length;
+            }
+            // Eliminate an equality that is smaller or equal to the edits on both
+            // sides of it.
+            if (lastEquality &&
+                lastEquality.length <=
+                    Math.max(length_insertions1, length_deletions1) &&
+                lastEquality.length <=
+                    Math.max(length_insertions2, length_deletions2)) {
+                // Duplicate record.
+                diffs.splice(equalities[equalitiesLength - 1], 0, new Diff(DIFF_DELETE, lastEquality));
+                // Change second copy to insert.
+                diffs[equalities[equalitiesLength - 1] + 1][0] = DIFF_INSERT;
+                // Throw away the equality we just deleted.
+                equalitiesLength--;
+                // Throw away the previous equality (it needs to be reevaluated).
+                equalitiesLength--;
+                pointer =
+                    equalitiesLength > 0
+                        ? equalities[equalitiesLength - 1]
+                        : -1;
+                length_insertions1 = 0; // Reset the counters.
+                length_deletions1 = 0;
+                length_insertions2 = 0;
+                length_deletions2 = 0;
+                lastEquality = null;
+                changes = true;
+            }
+        }
+        pointer++;
+    }
+    // Normalize the diff.
+    if (changes) {
+        diff_cleanupMerge(diffs);
+    }
+    diff_cleanupSemanticLossless(diffs);
+    // Find any overlaps between deletions and insertions.
+    // e.g: <del>abcxxx</del><ins>xxxdef</ins>
+    //   -> <del>abc</del>xxx<ins>def</ins>
+    // e.g: <del>xxxabc</del><ins>defxxx</ins>
+    //   -> <ins>def</ins>xxx<del>abc</del>
+    // Only extract an overlap if it is as big as the edit ahead or behind it.
+    pointer = 1;
+    while (pointer < diffs.length) {
+        if (diffs[pointer - 1][0] == DIFF_DELETE &&
+            diffs[pointer][0] == DIFF_INSERT) {
+            var deletion = diffs[pointer - 1][1];
+            var insertion = diffs[pointer][1];
+            var overlap_length1 = diff_commonOverlap_(deletion, insertion);
+            var overlap_length2 = diff_commonOverlap_(insertion, deletion);
+            if (overlap_length1 >= overlap_length2) {
+                if (overlap_length1 >= deletion.length / 2 ||
+                    overlap_length1 >= insertion.length / 2) {
+                    // Overlap found.  Insert an equality and trim the surrounding edits.
+                    diffs.splice(pointer, 0, new Diff(DIFF_EQUAL, insertion.substring(0, overlap_length1)));
+                    diffs[pointer - 1][1] = deletion.substring(0, deletion.length - overlap_length1);
+                    diffs[pointer + 1][1] =
+                        insertion.substring(overlap_length1);
+                    pointer++;
+                }
+            }
+            else {
+                if (overlap_length2 >= deletion.length / 2 ||
+                    overlap_length2 >= insertion.length / 2) {
+                    // Reverse overlap found.
+                    // Insert an equality and swap and trim the surrounding edits.
+                    diffs.splice(pointer, 0, new Diff(DIFF_EQUAL, deletion.substring(0, overlap_length2)));
+                    diffs[pointer - 1][0] = DIFF_INSERT;
+                    diffs[pointer - 1][1] = insertion.substring(0, insertion.length - overlap_length2);
+                    diffs[pointer + 1][0] = DIFF_DELETE;
+                    diffs[pointer + 1][1] = deletion.substring(overlap_length2);
+                    pointer++;
+                }
+            }
+            pointer++;
+        }
+        pointer++;
+    }
+};
+/**
+ * Look for single edits surrounded on both sides by equalities
+ * which can be shifted sideways to align the edit to a word boundary.
+ * e.g: The c<ins>at c</ins>ame. -> The <ins>cat </ins>came.
+ * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.
+ */
+var diff_cleanupSemanticLossless = function (diffs) {
+    /**
+     * Given two strings, compute a score representing whether the internal
+     * boundary falls on logical boundaries.
+     * Scores range from 6 (best) to 0 (worst).
+     * Closure, but does not reference any external variables.
+     * @param {string} one First string.
+     * @param {string} two Second string.
+     * @return {number} The score.
+     * @private
+     */
+    function diff_cleanupSemanticScore_(one, two) {
+        if (!one || !two) {
+            // Edges are the best.
+            return 6;
+        }
+        // Each port of this function behaves slightly differently due to
+        // subtle differences in each language's definition of things like
+        // 'whitespace'.  Since this function's purpose is largely cosmetic,
+        // the choice has been made to use each language's native features
+        // rather than force total conformity.
+        var char1 = one.charAt(one.length - 1);
+        var char2 = two.charAt(0);
+        var nonAlphaNumeric1 = char1.match(nonAlphaNumericRegex_);
+        var nonAlphaNumeric2 = char2.match(nonAlphaNumericRegex_);
+        var whitespace1 = nonAlphaNumeric1 && char1.match(whitespaceRegex_);
+        var whitespace2 = nonAlphaNumeric2 && char2.match(whitespaceRegex_);
+        var lineBreak1 = whitespace1 && char1.match(linebreakRegex_);
+        var lineBreak2 = whitespace2 && char2.match(linebreakRegex_);
+        var blankLine1 = lineBreak1 && one.match(blanklineEndRegex_);
+        var blankLine2 = lineBreak2 && two.match(blanklineStartRegex_);
+        if (blankLine1 || blankLine2) {
+            // Five points for blank lines.
+            return 5;
+        }
+        else if (lineBreak1 || lineBreak2) {
+            // Four points for line breaks.
+            return 4;
+        }
+        else if (nonAlphaNumeric1 && !whitespace1 && whitespace2) {
+            // Three points for end of sentences.
+            return 3;
+        }
+        else if (whitespace1 || whitespace2) {
+            // Two points for whitespace.
+            return 2;
+        }
+        else if (nonAlphaNumeric1 || nonAlphaNumeric2) {
+            // One point for non-alphanumeric.
+            return 1;
+        }
+        return 0;
+    }
+    var pointer = 1;
+    // Intentionally ignore the first and last element (don't need checking).
+    while (pointer < diffs.length - 1) {
+        if (diffs[pointer - 1][0] == DIFF_EQUAL &&
+            diffs[pointer + 1][0] == DIFF_EQUAL) {
+            // This is a single edit surrounded by equalities.
+            var equality1 = diffs[pointer - 1][1];
+            var edit = diffs[pointer][1];
+            var equality2 = diffs[pointer + 1][1];
+            // First, shift the edit as far left as possible.
+            var commonOffset = diff_commonSuffix(equality1, edit);
+            if (commonOffset) {
+                var commonString = edit.substring(edit.length - commonOffset);
+                equality1 = equality1.substring(0, equality1.length - commonOffset);
+                edit =
+                    commonString +
+                        edit.substring(0, edit.length - commonOffset);
+                equality2 = commonString + equality2;
+            }
+            // Second, step character by character right, looking for the best fit.
+            var bestEquality1 = equality1;
+            var bestEdit = edit;
+            var bestEquality2 = equality2;
+            var bestScore = diff_cleanupSemanticScore_(equality1, edit) +
+                diff_cleanupSemanticScore_(edit, equality2);
+            while (edit.charAt(0) === equality2.charAt(0)) {
+                equality1 += edit.charAt(0);
+                edit = edit.substring(1) + equality2.charAt(0);
+                equality2 = equality2.substring(1);
+                var score = diff_cleanupSemanticScore_(equality1, edit) +
+                    diff_cleanupSemanticScore_(edit, equality2);
+                // The >= encourages trailing rather than leading whitespace on edits.
+                if (score >= bestScore) {
+                    bestScore = score;
+                    bestEquality1 = equality1;
+                    bestEdit = edit;
+                    bestEquality2 = equality2;
+                }
+            }
+            if (diffs[pointer - 1][1] != bestEquality1) {
+                // We have an improvement, save it back to the diff.
+                if (bestEquality1) {
+                    diffs[pointer - 1][1] = bestEquality1;
+                }
+                else {
+                    diffs.splice(pointer - 1, 1);
+                    pointer--;
+                }
+                diffs[pointer][1] = bestEdit;
+                if (bestEquality2) {
+                    diffs[pointer + 1][1] = bestEquality2;
+                }
+                else {
+                    diffs.splice(pointer + 1, 1);
+                    pointer--;
+                }
+            }
+        }
+        pointer++;
+    }
+};
+// Define some regex patterns for matching boundaries.
+var nonAlphaNumericRegex_ = /[^a-zA-Z0-9]/;
+var whitespaceRegex_ = /\s/;
+var linebreakRegex_ = /[\r\n]/;
+var blanklineEndRegex_ = /\n\r?\n$/;
+var blanklineStartRegex_ = /^\r?\n\r?\n/;
+/**
+ * Reorder and merge like edit sections.  Merge equalities.
+ * Any edit section can move as long as it doesn't cross an equality.
+ * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.
+ */
+var diff_cleanupMerge = function (diffs) {
+    // Add a dummy entry at the end.
+    diffs.push(new Diff(DIFF_EQUAL, ''));
+    var pointer = 0;
+    var count_delete = 0;
+    var count_insert = 0;
+    var text_delete = '';
+    var text_insert = '';
+    var commonlength;
+    while (pointer < diffs.length) {
+        switch (diffs[pointer][0]) {
+            case DIFF_INSERT:
+                count_insert++;
+                text_insert += diffs[pointer][1];
+                pointer++;
+                break;
+            case DIFF_DELETE:
+                count_delete++;
+                text_delete += diffs[pointer][1];
+                pointer++;
+                break;
+            case DIFF_EQUAL:
+                // Upon reaching an equality, check for prior redundancies.
+                if (count_delete + count_insert > 1) {
+                    if (count_delete !== 0 && count_insert !== 0) {
+                        // Factor out any common prefixies.
+                        commonlength = diff_commonPrefix(text_insert, text_delete);
+                        if (commonlength !== 0) {
+                            if (pointer - count_delete - count_insert > 0 &&
+                                diffs[pointer - count_delete - count_insert - 1][0] == DIFF_EQUAL) {
+                                diffs[pointer - count_delete - count_insert - 1][1] += text_insert.substring(0, commonlength);
+                            }
+                            else {
+                                diffs.splice(0, 0, new Diff(DIFF_EQUAL, text_insert.substring(0, commonlength)));
+                                pointer++;
+                            }
+                            text_insert = text_insert.substring(commonlength);
+                            text_delete = text_delete.substring(commonlength);
+                        }
+                        // Factor out any common suffixies.
+                        commonlength = diff_commonSuffix(text_insert, text_delete);
+                        if (commonlength !== 0) {
+                            diffs[pointer][1] =
+                                text_insert.substring(text_insert.length - commonlength) + diffs[pointer][1];
+                            text_insert = text_insert.substring(0, text_insert.length - commonlength);
+                            text_delete = text_delete.substring(0, text_delete.length - commonlength);
+                        }
+                    }
+                    // Delete the offending records and add the merged ones.
+                    pointer -= count_delete + count_insert;
+                    diffs.splice(pointer, count_delete + count_insert);
+                    if (text_delete.length) {
+                        diffs.splice(pointer, 0, new Diff(DIFF_DELETE, text_delete));
+                        pointer++;
+                    }
+                    if (text_insert.length) {
+                        diffs.splice(pointer, 0, new Diff(DIFF_INSERT, text_insert));
+                        pointer++;
+                    }
+                    pointer++;
+                }
+                else if (pointer !== 0 &&
+                    diffs[pointer - 1][0] == DIFF_EQUAL) {
+                    // Merge this equality with the previous one.
+                    diffs[pointer - 1][1] += diffs[pointer][1];
+                    diffs.splice(pointer, 1);
+                }
+                else {
+                    pointer++;
+                }
+                count_insert = 0;
+                count_delete = 0;
+                text_delete = '';
+                text_insert = '';
+                break;
+        }
+    }
+    if (diffs[diffs.length - 1][1] === '') {
+        diffs.pop(); // Remove the dummy entry at the end.
+    }
+    // Second pass: look for single edits surrounded on both sides by equalities
+    // which can be shifted sideways to eliminate an equality.
+    // e.g: A<ins>BA</ins>C -> <ins>AB</ins>AC
+    var changes = false;
+    pointer = 1;
+    // Intentionally ignore the first and last element (don't need checking).
+    while (pointer < diffs.length - 1) {
+        if (diffs[pointer - 1][0] == DIFF_EQUAL &&
+            diffs[pointer + 1][0] == DIFF_EQUAL) {
+            // This is a single edit surrounded by equalities.
+            if (diffs[pointer][1].substring(diffs[pointer][1].length - diffs[pointer - 1][1].length) == diffs[pointer - 1][1]) {
+                // Shift the edit over the previous equality.
+                diffs[pointer][1] =
+                    diffs[pointer - 1][1] +
+                        diffs[pointer][1].substring(0, diffs[pointer][1].length - diffs[pointer - 1][1].length);
+                diffs[pointer + 1][1] =
+                    diffs[pointer - 1][1] + diffs[pointer + 1][1];
+                diffs.splice(pointer - 1, 1);
+                changes = true;
+            }
+            else if (diffs[pointer][1].substring(0, diffs[pointer + 1][1].length) ==
+                diffs[pointer + 1][1]) {
+                // Shift the edit over the next equality.
+                diffs[pointer - 1][1] += diffs[pointer + 1][1];
+                diffs[pointer][1] =
+                    diffs[pointer][1].substring(diffs[pointer + 1][1].length) +
+                        diffs[pointer + 1][1];
+                diffs.splice(pointer + 1, 1);
+                changes = true;
+            }
+        }
+        pointer++;
+    }
+    // If shifts were made, the diff needs reordering and another shift sweep.
+    if (changes) {
+        diff_cleanupMerge(diffs);
+    }
+};
+export { Diff, DIFF_EQUAL, DIFF_DELETE, DIFF_INSERT, diff_cleanupSemantic as cleanupSemantic, };
+//# sourceMappingURL=cleanupSemantic.js.map

package/src/diff/cleanupSemantic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cleanupSemantic.js","sourceRoot":"","sources":["cleanupSemantic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH;;;;GAIG;AAEH;;;;;;;;GAQG;AAEH;;;;GAIG;AACH,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;AACrB,IAAI,WAAW,GAAG,CAAC,CAAC;AACpB,IAAI,UAAU,GAAG,CAAC,CAAC;AAEnB;;;;;;GAMG;AACH,MAAM,IAAI;IAIN,YAAY,EAAU,EAAE,IAAY;QAChC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACnB,CAAC;CACJ;AAED;;;;;;GAMG;AACH,IAAI,iBAAiB,GAAG,UAAU,KAAa,EAAE,KAAa;IAC1D,qCAAqC;IACrC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;QACxD,OAAO,CAAC,CAAC;KACZ;IACD,iBAAiB;IACjB,kEAAkE;IAClE,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IACtD,IAAI,UAAU,GAAG,UAAU,CAAC;IAC5B,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,OAAO,UAAU,GAAG,UAAU,EAAE;QAC5B,IACI,KAAK,CAAC,SAAS,CAAC,YAAY,EAAE,UAAU,CAAC;YACzC,KAAK,CAAC,SAAS,CAAC,YAAY,EAAE,UAAU,CAAC,EAC3C;YACE,UAAU,GAAG,UAAU,CAAC;YACxB,YAAY,GAAG,UAAU,CAAC;SAC7B;aAAM;YACH,UAAU,GAAG,UAAU,CAAC;SAC3B;QACD,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;KACvE;IACD,OAAO,UAAU,CAAC;AACtB,CAAC,CAAC;AAEF;;;;;GAKG;AACH,IAAI,iBAAiB,GAAG,UAAU,KAAa,EAAE,KAAa;IAC1D,qCAAqC;IACrC,IACI,CAAC,KAAK;QACN,CAAC,KAAK;QACN,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAClE;QACE,OAAO,CAAC,CAAC;KACZ;IACD,iBAAiB;IACjB,kEAAkE;IAClE,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IACtD,IAAI,UAAU,GAAG,UAAU,CAAC;IAC5B,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,OAAO,UAAU,GAAG,UAAU,EAAE;QAC5B,IACI,KAAK,CAAC,SAAS,CACX,KAAK,CAAC,MAAM,GAAG,UAAU,EACzB,KAAK,CAAC,MAAM,GAAG,UAAU,CAC5B;YACD,KAAK,CAAC,SAAS,CACX,KAAK,CAAC,MAAM,GAAG,UAAU,EACzB,KAAK,CAAC,MAAM,GAAG,UAAU,CAC5B,EACH;YACE,UAAU,GAAG,UAAU,CAAC;YACxB,UAAU,GAAG,UAAU,CAAC;SAC3B;aAAM;YACH,UAAU,GAAG,UAAU,CAAC;SAC3B;QACD,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;KACvE;IACD,OAAO,UAAU,CAAC;AACtB,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,IAAI,mBAAmB,GAAG,UAAU,KAAa,EAAE,KAAa;IAC5D,oDAAoD;IACpD,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC;IAChC,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC;IAChC,2BAA2B;IAC3B,IAAI,YAAY,IAAI,CAAC,IAAI,YAAY,IAAI,CAAC,EAAE;QACxC,OAAO,CAAC,CAAC;KACZ;IACD,8BAA8B;IAC9B,IAAI,YAAY,GAAG,YAAY,EAAE;QAC7B,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,YAAY,GAAG,YAAY,CAAC,CAAC;KACxD;SAAM,IAAI,YAAY,GAAG,YAAY,EAAE;QACpC,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;KAC5C;IACD,IAAI,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;IACvD,kCAAkC;IAClC,IAAI,KAAK,IAAI,KAAK,EAAE;QAChB,OAAO,WAAW,CAAC;KACtB;IAED,gDAAgD;IAChD,+CAA+C;IAC/C,kEAAkE;IAClE,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,OAAO,IAAI,EAAE;QACT,IAAI,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC,WAAW,GAAG,MAAM,CAAC,CAAC;QACpD,IAAI,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACnC,IAAI,KAAK,IAAI,CAAC,CAAC,EAAE;YACb,OAAO,IAAI,CAAC;SACf;QACD,MAAM,IAAI,KAAK,CAAC;QAChB,IACI,KAAK,IAAI,CAAC;YACV,KAAK,CAAC,SAAS,CAAC,WAAW,GAAG,MAAM,CAAC,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,EACrE;YACE,IAAI,GAAG,MAAM,CAAC;YACd,MAAM,EAAE,CAAC;SACZ;KACJ;AACL,CAAC,CAAC;AAEF;;;GAGG;AACH,IAAI,oBAAoB,GAAG,UAAU,KAAkB;IACnD,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,IAAI,UAAU,GAAG,EAAE,CAAC,CAAC,+CAA+C;IACpE,IAAI,gBAAgB,GAAG,CAAC,CAAC,CAAC,8CAA8C;IACxE,sBAAsB;IACtB,IAAI,YAAY,GAAG,IAAI,CAAC;IACxB,6DAA6D;IAC7D,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC,6BAA6B;IAC9C,2DAA2D;IAC3D,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAC1B,wDAAwD;IACxD,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAC1B,OAAO,OAAO,GAAG,KAAK,CAAC,MAAM,EAAE;QAC3B,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU,EAAE;YACjC,kBAAkB;YAClB,UAAU,CAAC,gBAAgB,EAAE,CAAC,GAAG,OAAO,CAAC;YACzC,kBAAkB,GAAG,kBAAkB,CAAC;YACxC,iBAAiB,GAAG,iBAAiB,CAAC;YACtC,kBAAkB,GAAG,CAAC,CAAC;YACvB,iBAAiB,GAAG,CAAC,CAAC;YACtB,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;SACpC;aAAM;YACH,4BAA4B;YAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,WAAW,EAAE;gBAClC,kBAAkB,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;aAClD;iBAAM;gBACH,iBAAiB,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;aACjD;YACD,sEAAsE;YACtE,eAAe;YACf,IACI,YAAY;gBACZ,YAAY,CAAC,MAAM;oBACf,IAAI,CAAC,GAAG,CAAC,kBAAkB,EAAE,iBAAiB,CAAC;gBACnD,YAAY,CAAC,MAAM;oBACf,IAAI,CAAC,GAAG,CAAC,kBAAkB,EAAE,iBAAiB,CAAC,EACrD;gBACE,oBAAoB;gBACpB,KAAK,CAAC,MAAM,CACR,UAAU,CAAC,gBAAgB,GAAG,CAAC,CAAC,EAChC,CAAC,EACD,IAAI,IAAI,CAAC,WAAW,EAAE,YAAY,CAAC,CACtC,CAAC;gBACF,gCAAgC;gBAChC,KAAK,CAAC,UAAU,CAAC,gBAAgB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;gBAC7D,2CAA2C;gBAC3C,gBAAgB,EAAE,CAAC;gBACnB,iEAAiE;gBACjE,gBAAgB,EAAE,CAAC;gBACnB,OAAO;oBACH,gBAAgB,GAAG,CAAC;wBAChB,CAAC,CAAC,UAAU,CAAC,gBAAgB,GAAG,CAAC,CAAC;wBAClC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACb,kBAAkB,GAAG,CAAC,CAAC,CAAC,sBAAsB;gBAC9C,iBAAiB,GAAG,CAAC,CAAC;gBACtB,kBAAkB,GAAG,CAAC,CAAC;gBACvB,iBAAiB,GAAG,CAAC,CAAC;gBACtB,YAAY,GAAG,IAAI,CAAC;gBACpB,OAAO,GAAG,IAAI,CAAC;aAClB;SACJ;QACD,OAAO,EAAE,CAAC;KACb;IAED,sBAAsB;IACtB,IAAI,OAAO,EAAE;QACT,iBAAiB,CAAC,KAAK,CAAC,CAAC;KAC5B;IACD,4BAA4B,CAAC,KAAK,CAAC,CAAC;IAEpC,sDAAsD;IACtD,0CAA0C;IAC1C,uCAAuC;IACvC,0CAA0C;IAC1C,uCAAuC;IACvC,0EAA0E;IAC1E,OAAO,GAAG,CAAC,CAAC;IACZ,OAAO,OAAO,GAAG,KAAK,CAAC,MAAM,EAAE;QAC3B,IACI,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,WAAW;YACpC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,WAAW,EAClC;YACE,IAAI,QAAQ,GAAG,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,eAAe,GAAG,mBAAmB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YAC/D,IAAI,eAAe,GAAG,mBAAmB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;YAC/D,IAAI,eAAe,IAAI,eAAe,EAAE;gBACpC,IACI,eAAe,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;oBACtC,eAAe,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EACzC;oBACE,qEAAqE;oBACrE,KAAK,CAAC,MAAM,CACR,OAAO,EACP,CAAC,EACD,IAAI,IAAI,CACJ,UAAU,EACV,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,eAAe,CAAC,CAC1C,CACJ,CAAC;oBACF,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CACtC,CAAC,EACD,QAAQ,CAAC,MAAM,GAAG,eAAe,CACpC,CAAC;oBACF,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;wBACjB,SAAS,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;oBACzC,OAAO,EAAE,CAAC;iBACb;aACJ;iBAAM;gBACH,IACI,eAAe,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;oBACtC,eAAe,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EACzC;oBACE,yBAAyB;oBACzB,8DAA8D;oBAC9D,KAAK,CAAC,MAAM,CACR,OAAO,EACP,CAAC,EACD,IAAI,IAAI,CACJ,UAAU,EACV,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,eAAe,CAAC,CACzC,CACJ,CAAC;oBACF,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;oBACpC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,SAAS,CACvC,CAAC,EACD,SAAS,CAAC,MAAM,GAAG,eAAe,CACrC,CAAC;oBACF,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;oBACpC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;oBAC5D,OAAO,EAAE,CAAC;iBACb;aACJ;YACD,OAAO,EAAE,CAAC;SACb;QACD,OAAO,EAAE,CAAC;KACb;AACL,CAAC,CAAC;AAEF;;;;;GAKG;AACH,IAAI,4BAA4B,GAAG,UAAU,KAAkB;IAC3D;;;;;;;;;OASG;IACH,SAAS,0BAA0B,CAAC,GAAW,EAAE,GAAW;QACxD,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE;YACd,sBAAsB;YACtB,OAAO,CAAC,CAAC;SACZ;QAED,iEAAiE;QACjE,kEAAkE;QAClE,oEAAoE;QACpE,kEAAkE;QAClE,sCAAsC;QACtC,IAAI,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvC,IAAI,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,gBAAgB,GAAG,KAAK,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAC1D,IAAI,gBAAgB,GAAG,KAAK,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAC1D,IAAI,WAAW,GAAG,gBAAgB,IAAI,KAAK,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;QACpE,IAAI,WAAW,GAAG,gBAAgB,IAAI,KAAK,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;QACpE,IAAI,UAAU,GAAG,WAAW,IAAI,KAAK,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;QAC7D,IAAI,UAAU,GAAG,WAAW,IAAI,KAAK,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;QAC7D,IAAI,UAAU,GAAG,UAAU,IAAI,GAAG,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;QAC7D,IAAI,UAAU,GAAG,UAAU,IAAI,GAAG,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC;QAE/D,IAAI,UAAU,IAAI,UAAU,EAAE;YAC1B,+BAA+B;YAC/B,OAAO,CAAC,CAAC;SACZ;aAAM,IAAI,UAAU,IAAI,UAAU,EAAE;YACjC,+BAA+B;YAC/B,OAAO,CAAC,CAAC;SACZ;aAAM,IAAI,gBAAgB,IAAI,CAAC,WAAW,IAAI,WAAW,EAAE;YACxD,qCAAqC;YACrC,OAAO,CAAC,CAAC;SACZ;aAAM,IAAI,WAAW,IAAI,WAAW,EAAE;YACnC,6BAA6B;YAC7B,OAAO,CAAC,CAAC;SACZ;aAAM,IAAI,gBAAgB,IAAI,gBAAgB,EAAE;YAC7C,kCAAkC;YAClC,OAAO,CAAC,CAAC;SACZ;QACD,OAAO,CAAC,CAAC;IACb,CAAC;IAED,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,yEAAyE;IACzE,OAAO,OAAO,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;QAC/B,IACI,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU;YACnC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU,EACrC;YACE,kDAAkD;YAClD,IAAI,SAAS,GAAG,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,IAAI,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,SAAS,GAAG,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEtC,iDAAiD;YACjD,IAAI,YAAY,GAAG,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YACtD,IAAI,YAAY,EAAE;gBACd,IAAI,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC;gBAC9D,SAAS,GAAG,SAAS,CAAC,SAAS,CAC3B,CAAC,EACD,SAAS,CAAC,MAAM,GAAG,YAAY,CAClC,CAAC;gBACF,IAAI;oBACA,YAAY;wBACZ,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC;gBAClD,SAAS,GAAG,YAAY,GAAG,SAAS,CAAC;aACxC;YAED,uEAAuE;YACvE,IAAI,aAAa,GAAG,SAAS,CAAC;YAC9B,IAAI,QAAQ,GAAG,IAAI,CAAC;YACpB,IAAI,aAAa,GAAG,SAAS,CAAC;YAC9B,IAAI,SAAS,GACT,0BAA0B,CAAC,SAAS,EAAE,IAAI,CAAC;gBAC3C,0BAA0B,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAChD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;gBAC3C,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC/C,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBACnC,IAAI,KAAK,GACL,0BAA0B,CAAC,SAAS,EAAE,IAAI,CAAC;oBAC3C,0BAA0B,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;gBAChD,sEAAsE;gBACtE,IAAI,KAAK,IAAI,SAAS,EAAE;oBACpB,SAAS,GAAG,KAAK,CAAC;oBAClB,aAAa,GAAG,SAAS,CAAC;oBAC1B,QAAQ,GAAG,IAAI,CAAC;oBAChB,aAAa,GAAG,SAAS,CAAC;iBAC7B;aACJ;YAED,IAAI,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,aAAa,EAAE;gBACxC,oDAAoD;gBACpD,IAAI,aAAa,EAAE;oBACf,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC;iBACzC;qBAAM;oBACH,KAAK,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC7B,OAAO,EAAE,CAAC;iBACb;gBACD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;gBAC7B,IAAI,aAAa,EAAE;oBACf,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC;iBACzC;qBAAM;oBACH,KAAK,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC7B,OAAO,EAAE,CAAC;iBACb;aACJ;SACJ;QACD,OAAO,EAAE,CAAC;KACb;AACL,CAAC,CAAC;AAEF,sDAAsD;AACtD,IAAI,qBAAqB,GAAG,cAAc,CAAC;AAC3C,IAAI,gBAAgB,GAAG,IAAI,CAAC;AAC5B,IAAI,eAAe,GAAG,QAAQ,CAAC;AAC/B,IAAI,kBAAkB,GAAG,UAAU,CAAC;AACpC,IAAI,oBAAoB,GAAG,aAAa,CAAC;AAEzC;;;;GAIG;AACH,IAAI,iBAAiB,GAAG,UAAU,KAAkB;IAChD,gCAAgC;IAChC,KAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,CAAC;IACrC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,WAAW,GAAG,EAAE,CAAC;IACrB,IAAI,WAAW,GAAG,EAAE,CAAC;IACrB,IAAI,YAAY,CAAC;IACjB,OAAO,OAAO,GAAG,KAAK,CAAC,MAAM,EAAE;QAC3B,QAAQ,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE;YACvB,KAAK,WAAW;gBACZ,YAAY,EAAE,CAAC;gBACf,WAAW,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjC,OAAO,EAAE,CAAC;gBACV,MAAM;YACV,KAAK,WAAW;gBACZ,YAAY,EAAE,CAAC;gBACf,WAAW,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjC,OAAO,EAAE,CAAC;gBACV,MAAM;YACV,KAAK,UAAU;gBACX,2DAA2D;gBAC3D,IAAI,YAAY,GAAG,YAAY,GAAG,CAAC,EAAE;oBACjC,IAAI,YAAY,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE;wBAC1C,mCAAmC;wBACnC,YAAY,GAAG,iBAAiB,CAC5B,WAAW,EACX,WAAW,CACd,CAAC;wBACF,IAAI,YAAY,KAAK,CAAC,EAAE;4BACpB,IACI,OAAO,GAAG,YAAY,GAAG,YAAY,GAAG,CAAC;gCACzC,KAAK,CACD,OAAO,GAAG,YAAY,GAAG,YAAY,GAAG,CAAC,CAC5C,CAAC,CAAC,CAAC,IAAI,UAAU,EACpB;gCACE,KAAK,CACD,OAAO,GAAG,YAAY,GAAG,YAAY,GAAG,CAAC,CAC5C,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;6BAClD;iCAAM;gCACH,KAAK,CAAC,MAAM,CACR,CAAC,EACD,CAAC,EACD,IAAI,IAAI,CACJ,UAAU,EACV,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,YAAY,CAAC,CACzC,CACJ,CAAC;gCACF,OAAO,EAAE,CAAC;6BACb;4BACD,WAAW,GAAG,WAAW,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;4BAClD,WAAW,GAAG,WAAW,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;yBACrD;wBACD,mCAAmC;wBACnC,YAAY,GAAG,iBAAiB,CAC5B,WAAW,EACX,WAAW,CACd,CAAC;wBACF,IAAI,YAAY,KAAK,CAAC,EAAE;4BACpB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gCACb,WAAW,CAAC,SAAS,CACjB,WAAW,CAAC,MAAM,GAAG,YAAY,CACpC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;4BAC1B,WAAW,GAAG,WAAW,CAAC,SAAS,CAC/B,CAAC,EACD,WAAW,CAAC,MAAM,GAAG,YAAY,CACpC,CAAC;4BACF,WAAW,GAAG,WAAW,CAAC,SAAS,CAC/B,CAAC,EACD,WAAW,CAAC,MAAM,GAAG,YAAY,CACpC,CAAC;yBACL;qBACJ;oBACD,wDAAwD;oBACxD,OAAO,IAAI,YAAY,GAAG,YAAY,CAAC;oBACvC,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,YAAY,GAAG,YAAY,CAAC,CAAC;oBACnD,IAAI,WAAW,CAAC,MAAM,EAAE;wBACpB,KAAK,CAAC,MAAM,CACR,OAAO,EACP,CAAC,EACD,IAAI,IAAI,CAAC,WAAW,EAAE,WAAW,CAAC,CACrC,CAAC;wBACF,OAAO,EAAE,CAAC;qBACb;oBACD,IAAI,WAAW,CAAC,MAAM,EAAE;wBACpB,KAAK,CAAC,MAAM,CACR,OAAO,EACP,CAAC,EACD,IAAI,IAAI,CAAC,WAAW,EAAE,WAAW,CAAC,CACrC,CAAC;wBACF,OAAO,EAAE,CAAC;qBACb;oBACD,OAAO,EAAE,CAAC;iBACb;qBAAM,IACH,OAAO,KAAK,CAAC;oBACb,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU,EACrC;oBACE,6CAA6C;oBAC7C,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3C,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;iBAC5B;qBAAM;oBACH,OAAO,EAAE,CAAC;iBACb;gBACD,YAAY,GAAG,CAAC,CAAC;gBACjB,YAAY,GAAG,CAAC,CAAC;gBACjB,WAAW,GAAG,EAAE,CAAC;gBACjB,WAAW,GAAG,EAAE,CAAC;gBACjB,MAAM;SACb;KACJ;IACD,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE;QACnC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,qCAAqC;KACrD;IAED,4EAA4E;IAC5E,0DAA0D;IAC1D,0CAA0C;IAC1C,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,OAAO,GAAG,CAAC,CAAC;IACZ,yEAAyE;IACzE,OAAO,OAAO,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;QAC/B,IACI,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU;YACnC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU,EACrC;YACE,kDAAkD;YAClD,IACI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CACvB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAC1D,IAAI,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAC5B;gBACE,6CAA6C;gBAC7C,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBACb,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;wBACrB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CACvB,CAAC,EACD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAC1D,CAAC;gBACN,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBACjB,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClD,KAAK,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC7B,OAAO,GAAG,IAAI,CAAC;aAClB;iBAAM,IACH,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBAC5D,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EACvB;gBACE,yCAAyC;gBACzC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/C,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBACb,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;wBACzD,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,KAAK,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC7B,OAAO,GAAG,IAAI,CAAC;aAClB;SACJ;QACD,OAAO,EAAE,CAAC;KACb;IACD,0EAA0E;IAC1E,IAAI,OAAO,EAAE;QACT,iBAAiB,CAAC,KAAK,CAAC,CAAC;KAC5B;AACL,CAAC,CAAC;AAEF,OAAO,EACH,IAAI,EACJ,UAAU,EACV,WAAW,EACX,WAAW,EACX,oBAAoB,IAAI,eAAe,GAC1C,CAAC"}

package/src/diff/constants.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export declare const NO_DIFF_MESSAGE = "Compared values have no visual difference.";
+export declare const SIMILAR_MESSAGE: string;
+//# sourceMappingURL=constants.d.ts.map

package/src/diff/constants.js

@@ -0,0 +1,10 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export const NO_DIFF_MESSAGE = 'Compared values have no visual difference.';
+export const SIMILAR_MESSAGE = 'Compared values serialize to the same structure.\n' +
+    'Printing internal object structure without calling `toJSON` instead.';
+//# sourceMappingURL=constants.js.map

package/src/diff/constants.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.js","sourceRoot":"","sources":["constants.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,CAAC,MAAM,eAAe,GAAG,4CAA4C,CAAC;AAE5E,MAAM,CAAC,MAAM,eAAe,GACxB,oDAAoD;IACpD,sEAAsE,CAAC"}

package/src/diff/diffLines.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import { Diff } from './cleanupSemantic';
+import type { DiffOptions, DiffOptionsNormalized } from './types';
+export declare const printDiffLines: (diffs: Array<Diff>, options: DiffOptionsNormalized) => string;
+export declare const diffLinesUnified: (aLines: Array<string>, bLines: Array<string>, options?: DiffOptions) => string;
+export declare const diffLinesUnified2: (aLinesDisplay: Array<string>, bLinesDisplay: Array<string>, aLinesCompare: Array<string>, bLinesCompare: Array<string>, options?: DiffOptions) => string;
+export declare const diffLinesRaw: (aLines: Array<string>, bLines: Array<string>) => Array<Diff>;
+//# sourceMappingURL=diffLines.d.ts.map