@revideo/2d 0.4.7-alpha.1027 → 0.4.7-beta.1025

package/lib/code/diff.js

@@ -14,206 +14,221 @@
  * {@link https://github.com/jonTrent/PatienceDiff}
  */
 export function patienceDiff(aLines, bLines) {
-    /**
-     * Finds all unique values in lines[start...end], inclusive. This
-     * function is used in preparation for determining the longest common
-     * subsequence.
-     *
-     * @param lines - The array to search
-     * @param start - The starting index (inclusive)
-     * @param end - The ending index (inclusive)
-     * @returns A map of the unique lines to their index
-     */
-    function findUnique(lines, start, end) {
-        const lineMap = new Map();
-        for (let i = start; i <= end; i++) {
-            const line = lines[i];
-            const data = lineMap.get(line);
-            if (data) {
-                data.count++;
-                data.index = i;
-            }
-            else {
-                lineMap.set(line, { count: 1, index: i });
-            }
-        }
-        const newMap = new Map();
-        for (const [key, value] of lineMap) {
-            if (value.count === 1) {
-                newMap.set(key, value.index);
-            }
-        }
-        return newMap;
+  /**
+   * Finds all unique values in lines[start...end], inclusive. This
+   * function is used in preparation for determining the longest common
+   * subsequence.
+   *
+   * @param lines - The array to search
+   * @param start - The starting index (inclusive)
+   * @param end - The ending index (inclusive)
+   * @returns A map of the unique lines to their index
+   */
+  function findUnique(lines, start, end) {
+    const lineMap = new Map();
+    for (let i = start; i <= end; i++) {
+      const line = lines[i];
+      const data = lineMap.get(line);
+      if (data) {
+        data.count++;
+        data.index = i;
+      } else {
+        lineMap.set(line, {count: 1, index: i});
+      }
     }
-    /**
-     * Finds all the unique common entries between aArray[aStart...aEnd] and
-     * bArray[bStart...bEnd], inclusive. This function uses findUnique to pare
-     * down the aArray and bArray ranges first, before then walking the
-     * comparison between the two arrays.
-     *
-     *
-     * @param aArray - The original array
-     * @param aStart - The start of the original array to search
-     * @param aEnd - The end of the original array to search, inclusive
-     * @param bArray - The new array
-     * @param bStart - the start of the new array to search
-     * @param bEnd - The end of the new array to search, inclusive
-     * @returns a Map, with the key as the common line between aArray and
-     * bArray, with the value as an object containing the array indices of the
-     * matching uniqe lines.
-     */
-    function uniqueCommon(aArray, aStart, aEnd, bArray, bStart, bEnd) {
-        const aUnique = findUnique(aArray, aStart, aEnd);
-        const bUnique = findUnique(bArray, bStart, bEnd);
-        return [...aUnique.entries()].reduce((paired, [key, value]) => {
-            const bIndex = bUnique.get(key);
-            if (bIndex !== undefined) {
-                paired.set(key, {
-                    aIndex: value,
-                    bIndex,
-                });
-            }
-            return paired;
-        }, new Map());
+    const newMap = new Map();
+    for (const [key, value] of lineMap) {
+      if (value.count === 1) {
+        newMap.set(key, value.index);
+      }
     }
-    /**
-     * Takes a map from the unique common lines between two arrays and determines
-     * the longest common subsequence.
-     *
-     * @see uniqueCommon
-     *
-     * @param abMap - The map of unique common lines between two arrays.
-     * @returns An array of objects containing the indices of the longest common
-     * subsequence.
-     */
-    function longestCommonSubsequence(abMap) {
-        const jagged = [];
-        abMap.forEach(value => {
-            let i = 0;
-            while (jagged[i] && jagged[i].at(-1).bIndex < value.bIndex) {
-                i++;
-            }
-            if (i > 0) {
-                value.prev = jagged[i - 1].at(-1);
-            }
-            if (!jagged[i]) {
-                jagged[i] = [value];
-            }
-            else {
-                jagged[i].push(value);
-            }
+    return newMap;
+  }
+  /**
+   * Finds all the unique common entries between aArray[aStart...aEnd] and
+   * bArray[bStart...bEnd], inclusive. This function uses findUnique to pare
+   * down the aArray and bArray ranges first, before then walking the
+   * comparison between the two arrays.
+   *
+   *
+   * @param aArray - The original array
+   * @param aStart - The start of the original array to search
+   * @param aEnd - The end of the original array to search, inclusive
+   * @param bArray - The new array
+   * @param bStart - the start of the new array to search
+   * @param bEnd - The end of the new array to search, inclusive
+   * @returns a Map, with the key as the common line between aArray and
+   * bArray, with the value as an object containing the array indices of the
+   * matching uniqe lines.
+   */
+  function uniqueCommon(aArray, aStart, aEnd, bArray, bStart, bEnd) {
+    const aUnique = findUnique(aArray, aStart, aEnd);
+    const bUnique = findUnique(bArray, bStart, bEnd);
+    return [...aUnique.entries()].reduce((paired, [key, value]) => {
+      const bIndex = bUnique.get(key);
+      if (bIndex !== undefined) {
+        paired.set(key, {
+          aIndex: value,
+          bIndex,
         });
-        // Pull out the longest common subsequence
-        let lcs = [];
-        if (jagged.length > 0) {
-            lcs = [jagged.at(-1).at(-1)];
-            let cursor = lcs.at(-1);
-            while (cursor?.prev) {
-                cursor = cursor.prev;
-                lcs.push(cursor);
-            }
-        }
-        return lcs.reverse();
+      }
+      return paired;
+    }, new Map());
+  }
+  /**
+   * Takes a map from the unique common lines between two arrays and determines
+   * the longest common subsequence.
+   *
+   * @see uniqueCommon
+   *
+   * @param abMap - The map of unique common lines between two arrays.
+   * @returns An array of objects containing the indices of the longest common
+   * subsequence.
+   */
+  function longestCommonSubsequence(abMap) {
+    const jagged = [];
+    abMap.forEach(value => {
+      let i = 0;
+      while (jagged[i] && jagged[i].at(-1).bIndex < value.bIndex) {
+        i++;
+      }
+      if (i > 0) {
+        value.prev = jagged[i - 1].at(-1);
+      }
+      if (!jagged[i]) {
+        jagged[i] = [value];
+      } else {
+        jagged[i].push(value);
+      }
+    });
+    // Pull out the longest common subsequence
+    let lcs = [];
+    if (jagged.length > 0) {
+      lcs = [jagged.at(-1).at(-1)];
+      let cursor = lcs.at(-1);
+      while (cursor?.prev) {
+        cursor = cursor.prev;
+        lcs.push(cursor);
+      }
     }
-    /**
-     * Keeps track of the aLines that have been deleted, are shared between aLines
-     * and bLines, and bLines that have been inserted.
-     */
-    const result = [];
-    let deleted = 0;
-    let inserted = 0;
-    function addToResult(aIndex, bIndex) {
-        if (bIndex < 0) {
-            deleted++;
-        }
-        else if (aIndex < 0) {
-            inserted++;
-        }
-        result.push({
-            line: 0 <= aIndex ? aLines[aIndex] : bLines[bIndex],
-            aIndex,
-            bIndex,
-            moved: false,
-        });
+    return lcs.reverse();
+  }
+  /**
+   * Keeps track of the aLines that have been deleted, are shared between aLines
+   * and bLines, and bLines that have been inserted.
+   */
+  const result = [];
+  let deleted = 0;
+  let inserted = 0;
+  function addToResult(aIndex, bIndex) {
+    if (bIndex < 0) {
+      deleted++;
+    } else if (aIndex < 0) {
+      inserted++;
+    }
+    result.push({
+      line: 0 <= aIndex ? aLines[aIndex] : bLines[bIndex],
+      aIndex,
+      bIndex,
+      moved: false,
+    });
+  }
+  function addSubMatch(aStart, aEnd, bStart, bEnd) {
+    // Match any lines at the beginning of aLines and bLines.
+    while (
+      aStart <= aEnd &&
+      bStart <= bEnd &&
+      aLines[aStart] === bLines[bStart]
+    ) {
+      addToResult(aStart++, bStart++);
     }
-    function addSubMatch(aStart, aEnd, bStart, bEnd) {
-        // Match any lines at the beginning of aLines and bLines.
-        while (aStart <= aEnd &&
-            bStart <= bEnd &&
-            aLines[aStart] === bLines[bStart]) {
-            addToResult(aStart++, bStart++);
-        }
-        // Match any lines at the end of aLines and bLines, but don't place them
-        // in the "result" array just yet, as the lines between these matches at
-        // the beginning and the end need to be analyzed first.
-        const aEndTemp = aEnd;
-        while (aStart <= aEnd && bStart <= bEnd && aLines[aEnd] === bLines[bEnd]) {
-            aEnd--;
-            bEnd--;
-        }
-        // Now, check to determine with the remaining lines in the subsequence
-        // whether there are any unique common lines between aLines and bLines.
-        //
-        // If not, add the subsequence to the result (all aLines having been
-        // deleted, and all bLines having been inserted).
-        //
-        // If there are unique common lines between aLines and bLines, then let's
-        // recursively perform the patience diff on the subsequence.
-        const uniqueCommonMap = uniqueCommon(aLines, aStart, aEnd, bLines, bStart, bEnd);
-        if (uniqueCommonMap.size === 0) {
-            while (aStart <= aEnd) {
-                addToResult(aStart++, -1);
-            }
-            while (bStart <= bEnd) {
-                addToResult(-1, bStart++);
-            }
-        }
-        else {
-            recurseLCS(aStart, aEnd, bStart, bEnd, uniqueCommonMap);
-        }
-        // Finally, let's add the matches at the end to the result.
-        while (aEnd < aEndTemp) {
-            addToResult(++aEnd, ++bEnd);
-        }
+    // Match any lines at the end of aLines and bLines, but don't place them
+    // in the "result" array just yet, as the lines between these matches at
+    // the beginning and the end need to be analyzed first.
+    const aEndTemp = aEnd;
+    while (aStart <= aEnd && bStart <= bEnd && aLines[aEnd] === bLines[bEnd]) {
+      aEnd--;
+      bEnd--;
     }
-    /**
-     * Finds the longest common subsequence between the arrays
-     * aLines[aStart...aEnd] and bLines[bStart...bEnd], inclusive. Then for each
-     * subsequence, recursively performs another LCS search (via addSubMatch),
-     * until there are none found, at which point the subsequence is dumped to
-     * the result.
-     *
-     * @param aStart - The start of the original array to search
-     * @param aEnd - The end of the original array to search, inclusive
-     * @param bStart - The start of the new array to search
-     * @param bEnd - The end of the new array to search, inclusive
-     * @param uniqueCommonMap - A map of the unique common lines between
-     * aLines[aStart...aEnd] and bLines[bStart...bEnd], inclusive.
-     */
-    function recurseLCS(aStart, aEnd, bStart, bEnd, uniqueCommonMap = uniqueCommon(aLines, aStart, aEnd, bLines, bStart, bEnd)) {
-        const lcs = longestCommonSubsequence(uniqueCommonMap);
-        if (lcs.length === 0) {
-            addSubMatch(aStart, aEnd, bStart, bEnd);
-        }
-        else {
-            if (aStart < lcs[0].aIndex || bStart < lcs[0].bIndex) {
-                addSubMatch(aStart, lcs[0].aIndex - 1, bStart, lcs[0].bIndex - 1);
-            }
-            let i;
-            for (i = 0; i < lcs.length - 1; i++) {
-                addSubMatch(lcs[i].aIndex, lcs[i + 1].aIndex - 1, lcs[i].bIndex, lcs[i + 1].bIndex - 1);
-            }
-            if (lcs[i].aIndex <= aEnd || lcs[i].bIndex <= bEnd) {
-                addSubMatch(lcs[i].aIndex, aEnd, lcs[i].bIndex, bEnd);
-            }
-        }
+    // Now, check to determine with the remaining lines in the subsequence
+    // whether there are any unique common lines between aLines and bLines.
+    //
+    // If not, add the subsequence to the result (all aLines having been
+    // deleted, and all bLines having been inserted).
+    //
+    // If there are unique common lines between aLines and bLines, then let's
+    // recursively perform the patience diff on the subsequence.
+    const uniqueCommonMap = uniqueCommon(
+      aLines,
+      aStart,
+      aEnd,
+      bLines,
+      bStart,
+      bEnd,
+    );
+    if (uniqueCommonMap.size === 0) {
+      while (aStart <= aEnd) {
+        addToResult(aStart++, -1);
+      }
+      while (bStart <= bEnd) {
+        addToResult(-1, bStart++);
+      }
+    } else {
+      recurseLCS(aStart, aEnd, bStart, bEnd, uniqueCommonMap);
     }
-    recurseLCS(0, aLines.length - 1, 0, bLines.length - 1);
-    return {
-        lines: result,
-        lineCountDeleted: deleted,
-        lineCountInserted: inserted,
-    };
+    // Finally, let's add the matches at the end to the result.
+    while (aEnd < aEndTemp) {
+      addToResult(++aEnd, ++bEnd);
+    }
+  }
+  /**
+   * Finds the longest common subsequence between the arrays
+   * aLines[aStart...aEnd] and bLines[bStart...bEnd], inclusive. Then for each
+   * subsequence, recursively performs another LCS search (via addSubMatch),
+   * until there are none found, at which point the subsequence is dumped to
+   * the result.
+   *
+   * @param aStart - The start of the original array to search
+   * @param aEnd - The end of the original array to search, inclusive
+   * @param bStart - The start of the new array to search
+   * @param bEnd - The end of the new array to search, inclusive
+   * @param uniqueCommonMap - A map of the unique common lines between
+   * aLines[aStart...aEnd] and bLines[bStart...bEnd], inclusive.
+   */
+  function recurseLCS(
+    aStart,
+    aEnd,
+    bStart,
+    bEnd,
+    uniqueCommonMap = uniqueCommon(aLines, aStart, aEnd, bLines, bStart, bEnd),
+  ) {
+    const lcs = longestCommonSubsequence(uniqueCommonMap);
+    if (lcs.length === 0) {
+      addSubMatch(aStart, aEnd, bStart, bEnd);
+    } else {
+      if (aStart < lcs[0].aIndex || bStart < lcs[0].bIndex) {
+        addSubMatch(aStart, lcs[0].aIndex - 1, bStart, lcs[0].bIndex - 1);
+      }
+      let i;
+      for (i = 0; i < lcs.length - 1; i++) {
+        addSubMatch(
+          lcs[i].aIndex,
+          lcs[i + 1].aIndex - 1,
+          lcs[i].bIndex,
+          lcs[i + 1].bIndex - 1,
+        );
+      }
+      if (lcs[i].aIndex <= aEnd || lcs[i].bIndex <= bEnd) {
+        addSubMatch(lcs[i].aIndex, aEnd, lcs[i].bIndex, bEnd);
+      }
+    }
+  }
+  recurseLCS(0, aLines.length - 1, 0, bLines.length - 1);
+  return {
+    lines: result,
+    lineCountDeleted: deleted,
+    lineCountInserted: inserted,
+  };
 }
 /**
  * Utility function for debugging patienceDiff.
@@ -221,16 +236,14 @@ export function patienceDiff(aLines, bLines) {
  * @internal
  */
 export function printDiff(diff) {
-    diff.lines.forEach(line => {
-        if (line.bIndex < 0) {
-            console.log(`- ${line.line}`);
-        }
-        else if (line.aIndex < 0) {
-            console.log(`+ ${line.line}`);
-        }
-        else {
-            console.log(`  ${line.line}`);
-        }
-    });
+  diff.lines.forEach(line => {
+    if (line.bIndex < 0) {
+      console.log(`- ${line.line}`);
+    } else if (line.aIndex < 0) {
+      console.log(`+ ${line.line}`);
+    } else {
+      console.log(`  ${line.line}`);
+    }
+  });
 }
-//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"diff.js","sourceRoot":"","sources":["../../src/lib/code/diff.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAgB,EAChB,MAAgB;IAUhB;;;;;;;;;OASG;IACH,SAAS,UAAU,CAAC,KAAe,EAAE,KAAa,EAAE,GAAW;QAC7D,MAAM,OAAO,GAAG,IAAI,GAAG,EAA0C,CAAC;QAClE,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAC,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;YACnC,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;gBACtB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACH,SAAS,YAAY,CACnB,MAAgB,EAChB,MAAc,EACd,IAAY,EACZ,MAAgB,EAChB,MAAc,EACd,IAAY;QAEZ,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAEjD,OAAO,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAClC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE;YACvB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE;oBACd,MAAM,EAAE,KAAK;oBACb,MAAM;iBACP,CAAC,CAAC;YACL,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC,EACD,IAAI,GAAG,EAAE,CACV,CAAC;IACJ,CAAC;IAED;;;;;;;;;OASG;IACH,SAAS,wBAAwB,CAC/B,KAA+B;QAE/B,MAAM,MAAM,GAAoB,EAAE,CAAC;QAEnC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YACpB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;gBAC5D,CAAC,EAAE,CAAC;YACN,CAAC;YAED,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACV,KAAK,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACpC,CAAC;YAED,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACf,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,0CAA0C;QAC1C,IAAI,GAAG,GAAkB,EAAE,CAAC;QAE5B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC;YAC/B,IAAI,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,OAAO,MAAM,EAAE,IAAI,EAAE,CAAC;gBACpB,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;gBACrB,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,GAAG,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,MAAM,MAAM,GAKN,EAAE,CAAC;IACT,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,SAAS,WAAW,CAAC,MAAc,EAAE,MAAc;QACjD,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACf,OAAO,EAAE,CAAC;QACZ,CAAC;aAAM,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,QAAQ,EAAE,CAAC;QACb,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;YACnD,MAAM;YACN,MAAM;YACN,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IAED,SAAS,WAAW,CAClB,MAAc,EACd,IAAY,EACZ,MAAc,EACd,IAAY;QAEZ,yDAAyD;QACzD,OACE,MAAM,IAAI,IAAI;YACd,MAAM,IAAI,IAAI;YACd,MAAM,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,EACjC,CAAC;YACD,WAAW,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;QAClC,CAAC;QAED,wEAAwE;QACxE,wEAAwE;QACxE,uDAAuD;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC;QACtB,OAAO,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACzE,IAAI,EAAE,CAAC;YACP,IAAI,EAAE,CAAC;QACT,CAAC;QAED,sEAAsE;QACtE,uEAAuE;QACvE,EAAE;QACF,oEAAoE;QACpE,iDAAiD;QACjD,EAAE;QACF,yEAAyE;QACzE,4DAA4D;QAC5D,MAAM,eAAe,GAAG,YAAY,CAClC,MAAM,EACN,MAAM,EACN,IAAI,EACJ,MAAM,EACN,MAAM,EACN,IAAI,CACL,CAAC;QAEF,IAAI,eAAe,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,MAAM,IAAI,IAAI,EAAE,CAAC;gBACtB,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;YACD,OAAO,MAAM,IAAI,IAAI,EAAE,CAAC;gBACtB,WAAW,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;QAC1D,CAAC;QAED,2DAA2D;QAC3D,OAAO,IAAI,GAAG,QAAQ,EAAE,CAAC;YACvB,WAAW,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,SAAS,UAAU,CACjB,MAAc,EACd,IAAY,EACZ,MAAc,EACd,IAAY,EACZ,kBAA4C,YAAY,CACtD,MAAM,EACN,MAAM,EACN,IAAI,EACJ,MAAM,EACN,MAAM,EACN,IAAI,CACL;QAED,MAAM,GAAG,GAAG,wBAAwB,CAAC,eAAe,CAAC,CAAC;QAEtD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACN,IAAI,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;gBACrD,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpE,CAAC;YAED,IAAI,CAAC,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,WAAW,CACT,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EACb,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EACrB,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EACb,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CACtB,CAAC;YACJ,CAAC;YAED,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;gBACnD,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;IACH,CAAC;IAED,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEvD,OAAO;QACL,KAAK,EAAE,MAAM;QACb,gBAAgB,EAAE,OAAO;QACzB,iBAAiB,EAAE,QAAQ;KAC5B,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,IAAqC;IAC7D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACxB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAChC,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAChC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC"}
+//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"diff.js","sourceRoot":"","sources":["../../src/lib/code/diff.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAgB,EAChB,MAAgB;IAUhB;;;;;;;;;OASG;IACH,SAAS,UAAU,CAAC,KAAe,EAAE,KAAa,EAAE,GAAW;QAC7D,MAAM,OAAO,GAAG,IAAI,GAAG,EAA0C,CAAC;QAClE,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAC,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;YACnC,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;gBACtB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACH,SAAS,YAAY,CACnB,MAAgB,EAChB,MAAc,EACd,IAAY,EACZ,MAAgB,EAChB,MAAc,EACd,IAAY;QAEZ,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAEjD,OAAO,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAClC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE;YACvB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE;oBACd,MAAM,EAAE,KAAK;oBACb,MAAM;iBACP,CAAC,CAAC;YACL,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC,EACD,IAAI,GAAG,EAAE,CACV,CAAC;IACJ,CAAC;IAED;;;;;;;;;OASG;IACH,SAAS,wBAAwB,CAC/B,KAA+B;QAE/B,MAAM,MAAM,GAAoB,EAAE,CAAC;QAEnC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YACpB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;gBAC5D,CAAC,EAAE,CAAC;YACN,CAAC;YAED,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACV,KAAK,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACpC,CAAC;YAED,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACf,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,0CAA0C;QAC1C,IAAI,GAAG,GAAkB,EAAE,CAAC;QAE5B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC;YAC/B,IAAI,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,OAAO,MAAM,EAAE,IAAI,EAAE,CAAC;gBACpB,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;gBACrB,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,GAAG,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,MAAM,MAAM,GAKN,EAAE,CAAC;IACT,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,SAAS,WAAW,CAAC,MAAc,EAAE,MAAc;QACjD,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACf,OAAO,EAAE,CAAC;QACZ,CAAC;aAAM,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,QAAQ,EAAE,CAAC;QACb,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;YACnD,MAAM;YACN,MAAM;YACN,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IAED,SAAS,WAAW,CAClB,MAAc,EACd,IAAY,EACZ,MAAc,EACd,IAAY;QAEZ,yDAAyD;QACzD,OACE,MAAM,IAAI,IAAI;YACd,MAAM,IAAI,IAAI;YACd,MAAM,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,EACjC,CAAC;YACD,WAAW,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;QAClC,CAAC;QAED,wEAAwE;QACxE,wEAAwE;QACxE,uDAAuD;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC;QACtB,OAAO,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACzE,IAAI,EAAE,CAAC;YACP,IAAI,EAAE,CAAC;QACT,CAAC;QAED,sEAAsE;QACtE,uEAAuE;QACvE,EAAE;QACF,oEAAoE;QACpE,iDAAiD;QACjD,EAAE;QACF,yEAAyE;QACzE,4DAA4D;QAC5D,MAAM,eAAe,GAAG,YAAY,CAClC,MAAM,EACN,MAAM,EACN,IAAI,EACJ,MAAM,EACN,MAAM,EACN,IAAI,CACL,CAAC;QAEF,IAAI,eAAe,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,MAAM,IAAI,IAAI,EAAE,CAAC;gBACtB,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;YACD,OAAO,MAAM,IAAI,IAAI,EAAE,CAAC;gBACtB,WAAW,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;QAC1D,CAAC;QAED,2DAA2D;QAC3D,OAAO,IAAI,GAAG,QAAQ,EAAE,CAAC;YACvB,WAAW,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,SAAS,UAAU,CACjB,MAAc,EACd,IAAY,EACZ,MAAc,EACd,IAAY,EACZ,kBAA4C,YAAY,CACtD,MAAM,EACN,MAAM,EACN,IAAI,EACJ,MAAM,EACN,MAAM,EACN,IAAI,CACL;QAED,MAAM,GAAG,GAAG,wBAAwB,CAAC,eAAe,CAAC,CAAC;QAEtD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACN,IAAI,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;gBACrD,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpE,CAAC;YAED,IAAI,CAAC,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,WAAW,CACT,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EACb,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EACrB,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EACb,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CACtB,CAAC;YACJ,CAAC;YAED,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;gBACnD,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;IACH,CAAC;IAED,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEvD,OAAO;QACL,KAAK,EAAE,MAAM;QACb,gBAAgB,EAAE,OAAO;QACzB,iBAAiB,EAAE,QAAQ;KAC5B,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,IAAqC;IAC7D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACxB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAChC,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAChC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC"}

package/lib/code/extractRange.d.ts

@@ -1,5 +1,5 @@
-import { CodeRange } from './CodeRange';
-import { CodeTag } from './CodeScope';
+import {CodeRange} from './CodeRange';
+import {CodeTag} from './CodeScope';
 /**
  * Transform the fragments to isolate the given range into its own fragment.
  *
@@ -13,5 +13,8 @@ import { CodeTag } from './CodeScope';
  * @returns A tuple containing the transformed fragments and the index of the
  *          isolated fragment within.
  */
-export declare function extractRange(range: CodeRange, fragments: CodeTag[]): [CodeTag[], number];
-//# sourceMappingURL=extractRange.d.ts.map
+export declare function extractRange(
+  range: CodeRange,
+  fragments: CodeTag[],
+): [CodeTag[], number];
+//# sourceMappingURL=extractRange.d.ts.map