node-diff3 - npm Package Compare versions

Comparing version 3.2.0 to 3.2.1

dist/diff3.d.mts

+export function LCS(buffer1: any, buffer2: any): {
+    buffer1index: number;
+    buffer2index: number;
+    chain: null;
+} | undefined;
+export function diffComm(buffer1: any, buffer2: any): {
+    buffer1: never[];
+    buffer2: never[];
+}[];
+export function diffIndices(buffer1: any, buffer2: any): {
+    buffer1: any[];
+    buffer1Content: any;
+    buffer2: any[];
+    buffer2Content: any;
+}[];
+export function diffPatch(buffer1: any, buffer2: any): {
+    buffer1: {
+        offset: any;
+        length: any;
+        chunk: any[];
+    };
+    buffer2: {
+        offset: any;
+        length: any;
+        chunk: any[];
+    };
+}[];
+export function diff3MergeRegions(a: any, o: any, b: any): ({
+    stable: boolean;
+    aStart: any;
+    aLength: number;
+    aContent: any;
+    oStart: any;
+    oLength: number;
+    oContent: any;
+    bStart: any;
+    bLength: number;
+    bContent: any;
+} | {
+    stable: boolean;
+    buffer: any;
+    bufferStart: any;
+    bufferLength: any;
+    bufferContent: any;
+})[];
+export function diff3Merge(a: any, o: any, b: any, options: any): any[];
+export function mergeDiff3(a: any, o: any, b: any, options: any): {
+    conflict: boolean;
+    result: any[];
+};
+export function merge(a: any, o: any, b: any, options: any): {
+    conflict: boolean;
+    result: any[];
+};
+export function mergeDigIn(a: any, o: any, b: any, options: any): {
+    conflict: boolean;
+    result: any[];
+};
+export function patch(buffer: any, patch: any): any[];
+export function stripPatch(patch: any): any;
+export function invertPatch(patch: any): any;

dist/index.d.ts

+export {};

dist/diff3.cjs

@@ -5,16 +5,26 @@ var __defProp = Object.defineProperty;
 var __hasOwnProp = Object.prototype.hasOwnProperty;
-var __moduleCache = /* @__PURE__ */ new WeakMap;
+function __accessProp(key) {
+  return this[key];
+}
 var __toCommonJS = (from) => {
-  var entry = __moduleCache.get(from), desc;
+  var entry = (__moduleCache ??= new WeakMap).get(from), desc;
   if (entry)
     return entry;
   entry = __defProp({}, "__esModule", { value: true });
-  if (from && typeof from === "object" || typeof from === "function")
-    __getOwnPropNames(from).map((key) => !__hasOwnProp.call(entry, key) && __defProp(entry, key, {
-      get: () => from[key],
-      enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable
-    }));
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (var key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(entry, key))
+        __defProp(entry, key, {
+          get: __accessProp.bind(from, key),
+          enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable
+        });
+  }
   __moduleCache.set(from, entry);
   return entry;
 };
+var __moduleCache;
+var __returnValue = (v) => v;
+function __exportSetter(name, newValue) {
+  this[name] = __returnValue.bind(null, newValue);
+}
 var __export = (target, all) => {
@@ -26,3 +36,3 @@ for (var name in all)
       configurable: true,
-      set: (newValue) => all[name] = () => newValue
+      set: __exportSetter.bind(all, name)
     });
@@ -49,3 +59,3 @@ };
 function LCS(buffer1, buffer2) {
-  let equivalenceClasses = {};
+  let equivalenceClasses = Object.create(null);
   for (let j = 0;j < buffer2.length; j++) {
@@ -66,4 +76,3 @@ const item = buffer2[j];
     let c = candidates[0];
-    for (let jx = 0;jx < buffer2indices.length; jx++) {
-      const j = buffer2indices[jx];
+    for (const j of buffer2indices) {
       let s;
@@ -399,4 +408,3 @@ for (s = r;s < candidates.length; s++) {
       const c = diffComm(region.conflict.a, region.conflict.b);
-      for (let j = 0;j < c.length; j++) {
-        let inner = c[j];
+      for (const inner of c) {
         if (inner.common) {
@@ -425,7 +433,6 @@ result = result.concat(inner.common);
   }
-  for (let chunkIndex = 0;chunkIndex < patch2.length; chunkIndex++) {
-    let chunk = patch2[chunkIndex];
+  for (const chunk of patch2) {
     advanceTo(chunk.buffer1.offset);
-    for (let itemIndex = 0;itemIndex < chunk.buffer2.chunk.length; itemIndex++) {
-      result.push(chunk.buffer2.chunk[itemIndex]);
+    for (const item of chunk.buffer2.chunk) {
+      result.push(item);
     }
@@ -450,3 +457,3 @@ currOffset += chunk.buffer1.length;
 
-//# debugId=D476F1A6F1EBC8F364756E2164756E21
+//# debugId=19FA63E3C145F4F864756E2164756E21
 //# sourceMappingURL=diff3.cjs.map

dist/diff3.cjs.map

@@ -5,7 +5,7 @@ {
   "sourcesContent": [
-    "export {\n  LCS,\n  diffComm,\n  diffIndices,\n  diffPatch,\n  diff3MergeRegions,\n  diff3Merge,\n  mergeDiff3,\n  merge,\n  mergeDigIn,\n  patch,\n  stripPatch,\n  invertPatch\n};\n\n\n// Text diff algorithm following Hunt and McIlroy 1976.\n// J. W. Hunt and M. D. McIlroy, An algorithm for differential buffer\n// comparison, Bell Telephone Laboratories CSTR #41 (1976)\n// http://www.cs.dartmouth.edu/~doug/\n// https://en.wikipedia.org/wiki/Longest_common_subsequence_problem\n//\n// Expects two arrays, finds longest common sequence\nfunction LCS(buffer1, buffer2) {\n  let equivalenceClasses = {};\n  for (let j = 0; j < buffer2.length; j++) {\n    const item = buffer2[j];\n    if (equivalenceClasses[item]) {\n      equivalenceClasses[item].push(j);\n    } else {\n      equivalenceClasses[item] = [j];\n    }\n  }\n\n  const NULLRESULT = { buffer1index: -1, buffer2index: -1, chain: null };\n  let candidates = [NULLRESULT];\n\n  for (let i = 0; i < buffer1.length; i++) {\n    const item = buffer1[i];\n    const buffer2indices = equivalenceClasses[item] || [];\n    let r = 0;\n    let c = candidates[0];\n\n    for (let jx = 0; jx < buffer2indices.length; jx++) {\n      const j = buffer2indices[jx];\n\n      let s;\n      for (s = r; s < candidates.length; s++) {\n        if ((candidates[s].buffer2index < j) && ((s === candidates.length - 1) || (candidates[s + 1].buffer2index > j))) {\n          break;\n        }\n      }\n\n      if (s < candidates.length) {\n        const newCandidate = { buffer1index: i, buffer2index: j, chain: candidates[s] };\n        if (r === candidates.length) {\n          candidates.push(c);\n        } else {\n          candidates[r] = c;\n        }\n        r = s + 1;\n        c = newCandidate;\n        if (r === candidates.length) {\n          break; // no point in examining further (j)s\n        }\n      }\n    }\n\n    candidates[r] = c;\n  }\n\n  // At this point, we know the LCS: it's in the reverse of the\n  // linked-list through .chain of candidates[candidates.length - 1].\n\n  return candidates[candidates.length - 1];\n}\n\n\n// We apply the LCS to build a 'comm'-style picture of the\n// differences between buffer1 and buffer2.\nfunction diffComm(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n  let common = {common: []};\n\n  function processCommon() {\n    if (common.common.length) {\n      common.common.reverse();\n      result.push(common);\n      common = {common: []};\n    }\n  }\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    let different = {buffer1: [], buffer2: []};\n\n    while (--tail1 > candidate.buffer1index) {\n      different.buffer1.push(buffer1[tail1]);\n    }\n\n    while (--tail2 > candidate.buffer2index) {\n      different.buffer2.push(buffer2[tail2]);\n    }\n\n    if (different.buffer1.length || different.buffer2.length) {\n      processCommon();\n      different.buffer1.reverse();\n      different.buffer2.reverse();\n      result.push(different);\n    }\n\n    if (tail1 >= 0) {\n      common.common.push(buffer1[tail1]);\n    }\n  }\n\n  processCommon();\n\n  result.reverse();\n  return result;\n}\n\n\n// We apply the LCS to give a simple representation of the\n// offsets and lengths of mismatched chunks in the input\n// buffers. This is used by diff3MergeRegions.\nfunction diffIndices(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    const mismatchLength1 = tail1 - candidate.buffer1index - 1;\n    const mismatchLength2 = tail2 - candidate.buffer2index - 1;\n    tail1 = candidate.buffer1index;\n    tail2 = candidate.buffer2index;\n\n    if (mismatchLength1 || mismatchLength2) {\n      result.push({\n        buffer1: [tail1 + 1, mismatchLength1],\n        buffer1Content: buffer1.slice(tail1 + 1, tail1 + 1 + mismatchLength1),\n        buffer2: [tail2 + 1, mismatchLength2],\n        buffer2Content: buffer2.slice(tail2 + 1, tail2 + 1 + mismatchLength2)\n      });\n    }\n  }\n\n  result.reverse();\n  return result;\n}\n\n\n// We apply the LCS to build a JSON representation of a\n// diff(1)-style patch.\nfunction diffPatch(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n\n  function chunkDescription(buffer, offset, length) {\n    let chunk = [];\n    for (let i = 0; i < length; i++) {\n      chunk.push(buffer[offset + i]);\n    }\n    return {\n      offset: offset,\n      length: length,\n      chunk: chunk\n    };\n  }\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    const mismatchLength1 = tail1 - candidate.buffer1index - 1;\n    const mismatchLength2 = tail2 - candidate.buffer2index - 1;\n    tail1 = candidate.buffer1index;\n    tail2 = candidate.buffer2index;\n\n    if (mismatchLength1 || mismatchLength2) {\n      result.push({\n        buffer1: chunkDescription(buffer1, candidate.buffer1index + 1, mismatchLength1),\n        buffer2: chunkDescription(buffer2, candidate.buffer2index + 1, mismatchLength2)\n      });\n    }\n  }\n\n  result.reverse();\n  return result;\n}\n\n\n// Given three buffers, A, O, and B, where both A and B are\n// independently derived from O, returns a fairly complicated\n// internal representation of merge decisions it's taken. The\n// interested reader may wish to consult\n//\n// Sanjeev Khanna, Keshav Kunal, and Benjamin C. Pierce.\n// 'A Formal Investigation of ' In Arvind and Prasad,\n// editors, Foundations of Software Technology and Theoretical\n// Computer Science (FSTTCS), December 2007.\n//\n// (http://www.cis.upenn.edu/~bcpierce/papers/diff3-short.pdf)\n//\nfunction diff3MergeRegions(a, o, b) {\n\n  // \"hunks\" are array subsets where `a` or `b` are different from `o`\n  // https://www.gnu.org/software/diffutils/manual/html_node/diff3-Hunks.html\n  let hunks = [];\n  function addHunk(h, ab) {\n    hunks.push({\n      ab: ab,\n      oStart: h.buffer1[0],\n      oLength: h.buffer1[1],   // length of o to remove\n      abStart: h.buffer2[0],\n      abLength: h.buffer2[1]   // length of a/b to insert\n      // abContent: (ab === 'a' ? a : b).slice(h.buffer2[0], h.buffer2[0] + h.buffer2[1])\n    });\n  }\n\n  diffIndices(o, a).forEach(item => addHunk(item, 'a'));\n  diffIndices(o, b).forEach(item => addHunk(item, 'b'));\n  hunks.sort((x,y) => x.oStart - y.oStart);\n\n  let results = [];\n  let currOffset = 0;\n\n  function advanceTo(endOffset) {\n    if (endOffset > currOffset) {\n      results.push({\n        stable: true,\n        buffer: 'o',\n        bufferStart: currOffset,\n        bufferLength: endOffset - currOffset,\n        bufferContent: o.slice(currOffset, endOffset)\n      });\n      currOffset = endOffset;\n    }\n  }\n\n  while (hunks.length) {\n    let hunk = hunks.shift();\n    let regionStart = hunk.oStart;\n    let regionEnd = hunk.oStart + hunk.oLength;\n    let regionHunks = [hunk];\n    advanceTo(regionStart);\n\n    // Try to pull next overlapping hunk into this region\n    while (hunks.length) {\n      const nextHunk = hunks[0];\n      const nextHunkStart = nextHunk.oStart;\n      if (nextHunkStart > regionEnd) break;   // no overlap\n\n      regionEnd = Math.max(regionEnd, nextHunkStart + nextHunk.oLength);\n      regionHunks.push(hunks.shift());\n    }\n\n    if (regionHunks.length === 1) {\n      // Only one hunk touches this region, meaning that there is no conflict here.\n      // Either `a` or `b` is inserting into a region of `o` unchanged by the other.\n      if (hunk.abLength > 0) {\n        const buffer = (hunk.ab === 'a' ? a : b);\n        results.push({\n          stable: true,\n          buffer: hunk.ab,\n          bufferStart: hunk.abStart,\n          bufferLength: hunk.abLength,\n          bufferContent: buffer.slice(hunk.abStart, hunk.abStart + hunk.abLength)\n        });\n      }\n    } else {\n      // A true a/b conflict. Determine the bounds involved from `a`, `o`, and `b`.\n      // Effectively merge all the `a` hunks into one giant hunk, then do the\n      // same for the `b` hunks; then, correct for skew in the regions of `o`\n      // that each side changed, and report appropriate spans for the three sides.\n      let bounds = {\n        a: [a.length, -1, o.length, -1],\n        b: [b.length, -1, o.length, -1]\n      };\n      while (regionHunks.length) {\n        hunk = regionHunks.shift();\n        const oStart = hunk.oStart;\n        const oEnd = oStart + hunk.oLength;\n        const abStart = hunk.abStart;\n        const abEnd = abStart + hunk.abLength;\n        let b = bounds[hunk.ab];\n        b[0] = Math.min(abStart, b[0]);\n        b[1] = Math.max(abEnd, b[1]);\n        b[2] = Math.min(oStart, b[2]);\n        b[3] = Math.max(oEnd, b[3]);\n      }\n\n      const aStart = bounds.a[0] + (regionStart - bounds.a[2]);\n      const aEnd = bounds.a[1] + (regionEnd - bounds.a[3]);\n      const bStart = bounds.b[0] + (regionStart - bounds.b[2]);\n      const bEnd = bounds.b[1] + (regionEnd - bounds.b[3]);\n\n      let result = {\n        stable: false,\n        aStart: aStart,\n        aLength: aEnd - aStart,\n        aContent: a.slice(aStart, aEnd),\n        oStart: regionStart,\n        oLength: regionEnd - regionStart,\n        oContent: o.slice(regionStart, regionEnd),\n        bStart: bStart,\n        bLength: bEnd - bStart,\n        bContent: b.slice(bStart, bEnd)\n      };\n      results.push(result);\n    }\n    currOffset = regionEnd;\n  }\n\n  advanceTo(o.length);\n\n  return results;\n}\n\n\n// Applies the output of diff3MergeRegions to actually\n// construct the merged buffer; the returned result alternates\n// between 'ok' and 'conflict' blocks.\n// A \"false conflict\" is where `a` and `b` both change the same from `o`\nfunction diff3Merge(a, o, b, options) {\n  let defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/\n  };\n  options = Object.assign(defaults, options);\n\n  if (typeof a === 'string') a = a.split(options.stringSeparator);\n  if (typeof o === 'string') o = o.split(options.stringSeparator);\n  if (typeof b === 'string') b = b.split(options.stringSeparator);\n\n  let results = [];\n  const regions = diff3MergeRegions(a, o, b);\n\n  let okBuffer = [];\n  function flushOk() {\n    if (okBuffer.length) {\n      results.push({ ok: okBuffer });\n    }\n    okBuffer = [];\n  }\n\n  function isFalseConflict(a, b) {\n    if (a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) {\n      if (a[i] !== b[i]) return false;\n    }\n    return true;\n  }\n\n  regions.forEach(region =>  {\n    if (region.stable) {\n      okBuffer.push(...region.bufferContent);\n    } else {\n      if (options.excludeFalseConflicts && isFalseConflict(region.aContent, region.bContent)) {\n        okBuffer.push(...region.aContent);\n      } else {\n        flushOk();\n        results.push({\n          conflict: {\n            a: region.aContent,\n            aIndex: region.aStart,\n            o: region.oContent,\n            oIndex: region.oStart,\n            b: region.bContent,\n            bIndex: region.bStart\n          }\n        });\n      }\n    }\n  });\n\n  flushOk();\n  return results;\n}\n\n\nfunction mergeDiff3(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const oSection = '|||||||' + (options.label.o ? ` ${options.label.o}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else if (region.conflict) {\n      conflict = true;\n      result = result.concat(\n        [aSection],\n        region.conflict.a,\n        [oSection],\n        region.conflict.o,\n        [xSection],\n        region.conflict.b,\n        [bSection]\n      );\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\nfunction merge(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else if (region.conflict) {\n      conflict = true;\n      result = result.concat(\n        [aSection],\n        region.conflict.a,\n        [xSection],\n        region.conflict.b,\n        [bSection]\n      );\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\nfunction mergeDigIn(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else {\n      const c = diffComm(region.conflict.a, region.conflict.b);\n      for (let j = 0; j < c.length; j++) {\n        let inner = c[j];\n        if (inner.common) {\n          result = result.concat(inner.common);\n        } else {\n          conflict = true;\n          result = result.concat(\n            [aSection],\n            inner.buffer1,\n            [xSection],\n            inner.buffer2,\n            [bSection]\n          );\n        }\n      }\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\n// Applies a patch to a buffer.\n// Given buffer1 and buffer2, `patch(buffer1, diffPatch(buffer1, buffer2))` should give buffer2.\nfunction patch(buffer, patch) {\n  let result = [];\n  let currOffset = 0;\n\n  function advanceTo(targetOffset) {\n    while (currOffset < targetOffset) {\n      result.push(buffer[currOffset]);\n      currOffset++;\n    }\n  }\n\n  for (let chunkIndex = 0; chunkIndex < patch.length; chunkIndex++) {\n    let chunk = patch[chunkIndex];\n    advanceTo(chunk.buffer1.offset);\n    for (let itemIndex = 0; itemIndex < chunk.buffer2.chunk.length; itemIndex++) {\n      result.push(chunk.buffer2.chunk[itemIndex]);\n    }\n    currOffset += chunk.buffer1.length;\n  }\n\n  advanceTo(buffer.length);\n  return result;\n}\n\n\n// Takes the output of diffPatch(), and removes extra information from it.\n// It can still be used by patch(), below, but can no longer be inverted.\nfunction stripPatch(patch) {\n  return patch.map(chunk => ({\n    buffer1: { offset: chunk.buffer1.offset, length: chunk.buffer1.length },\n    buffer2: { chunk: chunk.buffer2.chunk }\n  }));\n}\n\n\n// Takes the output of diffPatch(), and inverts the sense of it, so that it\n// can be applied to buffer2 to give buffer1 rather than the other way around.\nfunction invertPatch(patch) {\n  return patch.map(chunk => ({\n    buffer1: chunk.buffer2,\n    buffer2: chunk.buffer1\n  }));\n}\n"
+    "export {\n  LCS,\n  diffComm,\n  diffIndices,\n  diffPatch,\n  diff3MergeRegions,\n  diff3Merge,\n  mergeDiff3,\n  merge,\n  mergeDigIn,\n  patch,\n  stripPatch,\n  invertPatch\n};\n\n\n// Text diff algorithm following Hunt and McIlroy 1976.\n// J. W. Hunt and M. D. McIlroy, An algorithm for differential buffer\n// comparison, Bell Telephone Laboratories CSTR #41 (1976)\n// http://www.cs.dartmouth.edu/~doug/\n// https://en.wikipedia.org/wiki/Longest_common_subsequence_problem\n//\n// Expects two arrays, finds longest common sequence\nfunction LCS(buffer1, buffer2) {\n  // Use a prototype-less object so input elements that happen to match\n  // `Object.prototype` members (`constructor`, `__proto__`, `toString`, ...)\n  // don't shadow the lookup with inherited values.\n  let equivalenceClasses = Object.create(null);\n  for (let j = 0; j < buffer2.length; j++) {\n    const item = buffer2[j];\n    if (equivalenceClasses[item]) {\n      equivalenceClasses[item].push(j);\n    } else {\n      equivalenceClasses[item] = [j];\n    }\n  }\n\n  const NULLRESULT = { buffer1index: -1, buffer2index: -1, chain: null };\n  let candidates = [NULLRESULT];\n\n  for (let i = 0; i < buffer1.length; i++) {\n    const item = buffer1[i];\n    const buffer2indices = equivalenceClasses[item] || [];\n    let r = 0;\n    let c = candidates[0];\n\n    for (const j of buffer2indices) {\n      let s;\n      for (s = r; s < candidates.length; s++) {\n        if ((candidates[s].buffer2index < j) && ((s === candidates.length - 1) || (candidates[s + 1].buffer2index > j))) {\n          break;\n        }\n      }\n\n      if (s < candidates.length) {\n        const newCandidate = { buffer1index: i, buffer2index: j, chain: candidates[s] };\n        if (r === candidates.length) {\n          candidates.push(c);\n        } else {\n          candidates[r] = c;\n        }\n        r = s + 1;\n        c = newCandidate;\n        if (r === candidates.length) {\n          break; // no point in examining further (j)s\n        }\n      }\n    }\n\n    candidates[r] = c;\n  }\n\n  // At this point, we know the LCS: it's in the reverse of the\n  // linked-list through .chain of candidates[candidates.length - 1].\n\n  return candidates[candidates.length - 1];\n}\n\n\n// We apply the LCS to build a 'comm'-style picture of the\n// differences between buffer1 and buffer2.\nfunction diffComm(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n  let common = {common: []};\n\n  function processCommon() {\n    if (common.common.length) {\n      common.common.reverse();\n      result.push(common);\n      common = {common: []};\n    }\n  }\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    let different = {buffer1: [], buffer2: []};\n\n    while (--tail1 > candidate.buffer1index) {\n      different.buffer1.push(buffer1[tail1]);\n    }\n\n    while (--tail2 > candidate.buffer2index) {\n      different.buffer2.push(buffer2[tail2]);\n    }\n\n    if (different.buffer1.length || different.buffer2.length) {\n      processCommon();\n      different.buffer1.reverse();\n      different.buffer2.reverse();\n      result.push(different);\n    }\n\n    if (tail1 >= 0) {\n      common.common.push(buffer1[tail1]);\n    }\n  }\n\n  processCommon();\n\n  result.reverse();\n  return result;\n}\n\n\n// We apply the LCS to give a simple representation of the\n// offsets and lengths of mismatched chunks in the input\n// buffers. This is used by diff3MergeRegions.\nfunction diffIndices(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    const mismatchLength1 = tail1 - candidate.buffer1index - 1;\n    const mismatchLength2 = tail2 - candidate.buffer2index - 1;\n    tail1 = candidate.buffer1index;\n    tail2 = candidate.buffer2index;\n\n    if (mismatchLength1 || mismatchLength2) {\n      result.push({\n        buffer1: [tail1 + 1, mismatchLength1],\n        buffer1Content: buffer1.slice(tail1 + 1, tail1 + 1 + mismatchLength1),\n        buffer2: [tail2 + 1, mismatchLength2],\n        buffer2Content: buffer2.slice(tail2 + 1, tail2 + 1 + mismatchLength2)\n      });\n    }\n  }\n\n  result.reverse();\n  return result;\n}\n\n\n// We apply the LCS to build a JSON representation of a\n// diff(1)-style patch.\nfunction diffPatch(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n\n  function chunkDescription(buffer, offset, length) {\n    let chunk = [];\n    for (let i = 0; i < length; i++) {\n      chunk.push(buffer[offset + i]);\n    }\n    return {\n      offset: offset,\n      length: length,\n      chunk: chunk\n    };\n  }\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    const mismatchLength1 = tail1 - candidate.buffer1index - 1;\n    const mismatchLength2 = tail2 - candidate.buffer2index - 1;\n    tail1 = candidate.buffer1index;\n    tail2 = candidate.buffer2index;\n\n    if (mismatchLength1 || mismatchLength2) {\n      result.push({\n        buffer1: chunkDescription(buffer1, candidate.buffer1index + 1, mismatchLength1),\n        buffer2: chunkDescription(buffer2, candidate.buffer2index + 1, mismatchLength2)\n      });\n    }\n  }\n\n  result.reverse();\n  return result;\n}\n\n\n// Given three buffers, A, O, and B, where both A and B are\n// independently derived from O, returns a fairly complicated\n// internal representation of merge decisions it's taken. The\n// interested reader may wish to consult\n//\n// Sanjeev Khanna, Keshav Kunal, and Benjamin C. Pierce.\n// 'A Formal Investigation of ' In Arvind and Prasad,\n// editors, Foundations of Software Technology and Theoretical\n// Computer Science (FSTTCS), December 2007.\n//\n// (http://www.cis.upenn.edu/~bcpierce/papers/diff3-short.pdf)\n//\nfunction diff3MergeRegions(a, o, b) {\n\n  // \"hunks\" are array subsets where `a` or `b` are different from `o`\n  // https://www.gnu.org/software/diffutils/manual/html_node/diff3-Hunks.html\n  let hunks = [];\n  function addHunk(h, ab) {\n    hunks.push({\n      ab: ab,\n      oStart: h.buffer1[0],\n      oLength: h.buffer1[1],   // length of o to remove\n      abStart: h.buffer2[0],\n      abLength: h.buffer2[1]   // length of a/b to insert\n      // abContent: (ab === 'a' ? a : b).slice(h.buffer2[0], h.buffer2[0] + h.buffer2[1])\n    });\n  }\n\n  diffIndices(o, a).forEach(item => addHunk(item, 'a'));\n  diffIndices(o, b).forEach(item => addHunk(item, 'b'));\n  hunks.sort((x,y) => x.oStart - y.oStart);\n\n  let results = [];\n  let currOffset = 0;\n\n  function advanceTo(endOffset) {\n    if (endOffset > currOffset) {\n      results.push({\n        stable: true,\n        buffer: 'o',\n        bufferStart: currOffset,\n        bufferLength: endOffset - currOffset,\n        bufferContent: o.slice(currOffset, endOffset)\n      });\n      currOffset = endOffset;\n    }\n  }\n\n  while (hunks.length) {\n    let hunk = hunks.shift();\n    let regionStart = hunk.oStart;\n    let regionEnd = hunk.oStart + hunk.oLength;\n    let regionHunks = [hunk];\n    advanceTo(regionStart);\n\n    // Try to pull next overlapping hunk into this region\n    while (hunks.length) {\n      const nextHunk = hunks[0];\n      const nextHunkStart = nextHunk.oStart;\n      if (nextHunkStart > regionEnd) break;   // no overlap\n\n      regionEnd = Math.max(regionEnd, nextHunkStart + nextHunk.oLength);\n      regionHunks.push(hunks.shift());\n    }\n\n    if (regionHunks.length === 1) {\n      // Only one hunk touches this region, meaning that there is no conflict here.\n      // Either `a` or `b` is inserting into a region of `o` unchanged by the other.\n      if (hunk.abLength > 0) {\n        const buffer = (hunk.ab === 'a' ? a : b);\n        results.push({\n          stable: true,\n          buffer: hunk.ab,\n          bufferStart: hunk.abStart,\n          bufferLength: hunk.abLength,\n          bufferContent: buffer.slice(hunk.abStart, hunk.abStart + hunk.abLength)\n        });\n      }\n    } else {\n      // A true a/b conflict. Determine the bounds involved from `a`, `o`, and `b`.\n      // Effectively merge all the `a` hunks into one giant hunk, then do the\n      // same for the `b` hunks; then, correct for skew in the regions of `o`\n      // that each side changed, and report appropriate spans for the three sides.\n      let bounds = {\n        a: [a.length, -1, o.length, -1],\n        b: [b.length, -1, o.length, -1]\n      };\n      while (regionHunks.length) {\n        hunk = regionHunks.shift();\n        const oStart = hunk.oStart;\n        const oEnd = oStart + hunk.oLength;\n        const abStart = hunk.abStart;\n        const abEnd = abStart + hunk.abLength;\n        let b = bounds[hunk.ab];\n        b[0] = Math.min(abStart, b[0]);\n        b[1] = Math.max(abEnd, b[1]);\n        b[2] = Math.min(oStart, b[2]);\n        b[3] = Math.max(oEnd, b[3]);\n      }\n\n      const aStart = bounds.a[0] + (regionStart - bounds.a[2]);\n      const aEnd = bounds.a[1] + (regionEnd - bounds.a[3]);\n      const bStart = bounds.b[0] + (regionStart - bounds.b[2]);\n      const bEnd = bounds.b[1] + (regionEnd - bounds.b[3]);\n\n      let result = {\n        stable: false,\n        aStart: aStart,\n        aLength: aEnd - aStart,\n        aContent: a.slice(aStart, aEnd),\n        oStart: regionStart,\n        oLength: regionEnd - regionStart,\n        oContent: o.slice(regionStart, regionEnd),\n        bStart: bStart,\n        bLength: bEnd - bStart,\n        bContent: b.slice(bStart, bEnd)\n      };\n      results.push(result);\n    }\n    currOffset = regionEnd;\n  }\n\n  advanceTo(o.length);\n\n  return results;\n}\n\n\n// Applies the output of diff3MergeRegions to actually\n// construct the merged buffer; the returned result alternates\n// between 'ok' and 'conflict' blocks.\n// A \"false conflict\" is where `a` and `b` both change the same from `o`\nfunction diff3Merge(a, o, b, options) {\n  let defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/\n  };\n  options = Object.assign(defaults, options);\n\n  if (typeof a === 'string') a = a.split(options.stringSeparator);\n  if (typeof o === 'string') o = o.split(options.stringSeparator);\n  if (typeof b === 'string') b = b.split(options.stringSeparator);\n\n  let results = [];\n  const regions = diff3MergeRegions(a, o, b);\n\n  let okBuffer = [];\n  function flushOk() {\n    if (okBuffer.length) {\n      results.push({ ok: okBuffer });\n    }\n    okBuffer = [];\n  }\n\n  function isFalseConflict(a, b) {\n    if (a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) {\n      if (a[i] !== b[i]) return false;\n    }\n    return true;\n  }\n\n  regions.forEach(region =>  {\n    if (region.stable) {\n      okBuffer.push(...region.bufferContent);\n    } else {\n      if (options.excludeFalseConflicts && isFalseConflict(region.aContent, region.bContent)) {\n        okBuffer.push(...region.aContent);\n      } else {\n        flushOk();\n        results.push({\n          conflict: {\n            a: region.aContent,\n            aIndex: region.aStart,\n            o: region.oContent,\n            oIndex: region.oStart,\n            b: region.bContent,\n            bIndex: region.bStart\n          }\n        });\n      }\n    }\n  });\n\n  flushOk();\n  return results;\n}\n\n\nfunction mergeDiff3(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const oSection = '|||||||' + (options.label.o ? ` ${options.label.o}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else if (region.conflict) {\n      conflict = true;\n      result = result.concat(\n        [aSection],\n        region.conflict.a,\n        [oSection],\n        region.conflict.o,\n        [xSection],\n        region.conflict.b,\n        [bSection]\n      );\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\nfunction merge(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else if (region.conflict) {\n      conflict = true;\n      result = result.concat(\n        [aSection],\n        region.conflict.a,\n        [xSection],\n        region.conflict.b,\n        [bSection]\n      );\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\nfunction mergeDigIn(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else {\n      const c = diffComm(region.conflict.a, region.conflict.b);\n      for (const inner of c) {\n        if (inner.common) {\n          result = result.concat(inner.common);\n        } else {\n          conflict = true;\n          result = result.concat(\n            [aSection],\n            inner.buffer1,\n            [xSection],\n            inner.buffer2,\n            [bSection]\n          );\n        }\n      }\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\n// Applies a patch to a buffer.\n// Given buffer1 and buffer2, `patch(buffer1, diffPatch(buffer1, buffer2))` should give buffer2.\nfunction patch(buffer, patch) {\n  let result = [];\n  let currOffset = 0;\n\n  function advanceTo(targetOffset) {\n    while (currOffset < targetOffset) {\n      result.push(buffer[currOffset]);\n      currOffset++;\n    }\n  }\n\n  for (const chunk of patch) {\n    advanceTo(chunk.buffer1.offset);\n    for (const item of chunk.buffer2.chunk) {\n      result.push(item);\n    }\n    currOffset += chunk.buffer1.length;\n  }\n\n  advanceTo(buffer.length);\n  return result;\n}\n\n\n// Takes the output of diffPatch(), and removes extra information from it.\n// It can still be used by patch(), below, but can no longer be inverted.\nfunction stripPatch(patch) {\n  return patch.map(chunk => ({\n    buffer1: { offset: chunk.buffer1.offset, length: chunk.buffer1.length },\n    buffer2: { chunk: chunk.buffer2.chunk }\n  }));\n}\n\n\n// Takes the output of diffPatch(), and inverts the sense of it, so that it\n// can be applied to buffer2 to give buffer1 rather than the other way around.\nfunction invertPatch(patch) {\n  return patch.map(chunk => ({\n    buffer1: chunk.buffer2,\n    buffer2: chunk.buffer1\n  }));\n}\n"
   ],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuBA,SAAS,GAAG,CAAC,SAAS,SAAS;AAAA,EAC7B,IAAI,qBAAqB,CAAC;AAAA,EAC1B,SAAS,IAAI,EAAG,IAAI,QAAQ,QAAQ,KAAK;AAAA,IACvC,MAAM,OAAO,QAAQ;AAAA,IACrB,IAAI,mBAAmB,OAAO;AAAA,MAC5B,mBAAmB,MAAM,KAAK,CAAC;AAAA,IACjC,EAAO;AAAA,MACL,mBAAmB,QAAQ,CAAC,CAAC;AAAA;AAAA,EAEjC;AAAA,EAEA,MAAM,aAAa,EAAE,cAAc,IAAI,cAAc,IAAI,OAAO,KAAK;AAAA,EACrE,IAAI,aAAa,CAAC,UAAU;AAAA,EAE5B,SAAS,IAAI,EAAG,IAAI,QAAQ,QAAQ,KAAK;AAAA,IACvC,MAAM,OAAO,QAAQ;AAAA,IACrB,MAAM,iBAAiB,mBAAmB,SAAS,CAAC;AAAA,IACpD,IAAI,IAAI;AAAA,IACR,IAAI,IAAI,WAAW;AAAA,IAEnB,SAAS,KAAK,EAAG,KAAK,eAAe,QAAQ,MAAM;AAAA,MACjD,MAAM,IAAI,eAAe;AAAA,MAEzB,IAAI;AAAA,MACJ,KAAK,IAAI,EAAG,IAAI,WAAW,QAAQ,KAAK;AAAA,QACtC,IAAK,WAAW,GAAG,eAAe,MAAQ,MAAM,WAAW,SAAS,KAAO,WAAW,IAAI,GAAG,eAAe,IAAK;AAAA,UAC/G;AAAA,QACF;AAAA,MACF;AAAA,MAEA,IAAI,IAAI,WAAW,QAAQ;AAAA,QACzB,MAAM,eAAe,EAAE,cAAc,GAAG,cAAc,GAAG,OAAO,WAAW,GAAG;AAAA,QAC9E,IAAI,MAAM,WAAW,QAAQ;AAAA,UAC3B,WAAW,KAAK,CAAC;AAAA,QACnB,EAAO;AAAA,UACL,WAAW,KAAK;AAAA;AAAA,QAElB,IAAI,IAAI;AAAA,QACR,IAAI;AAAA,QACJ,IAAI,MAAM,WAAW,QAAQ;AAAA,UAC3B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,IAEA,WAAW,KAAK;AAAA,EAClB;AAAA,EAKA,OAAO,WAAW,WAAW,SAAS;AAAA;AAMxC,SAAS,QAAQ,CAAC,SAAS,SAAS;AAAA,EAClC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,EAChC,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,SAAS,EAAC,QAAQ,CAAC,EAAC;AAAA,EAExB,SAAS,aAAa,GAAG;AAAA,IACvB,IAAI,OAAO,OAAO,QAAQ;AAAA,MACxB,OAAO,OAAO,QAAQ;AAAA,MACtB,OAAO,KAAK,MAAM;AAAA,MAClB,SAAS,EAAC,QAAQ,CAAC,EAAC;AAAA,IACtB;AAAA;AAAA,EAGF,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,IACzE,IAAI,YAAY,EAAC,SAAS,CAAC,GAAG,SAAS,CAAC,EAAC;AAAA,IAEzC,OAAO,EAAE,QAAQ,UAAU,cAAc;AAAA,MACvC,UAAU,QAAQ,KAAK,QAAQ,MAAM;AAAA,IACvC;AAAA,IAEA,OAAO,EAAE,QAAQ,UAAU,cAAc;AAAA,MACvC,UAAU,QAAQ,KAAK,QAAQ,MAAM;AAAA,IACvC;AAAA,IAEA,IAAI,UAAU,QAAQ,UAAU,UAAU,QAAQ,QAAQ;AAAA,MACxD,cAAc;AAAA,MACd,UAAU,QAAQ,QAAQ;AAAA,MAC1B,UAAU,QAAQ,QAAQ;AAAA,MAC1B,OAAO,KAAK,SAAS;AAAA,IACvB;AAAA,IAEA,IAAI,SAAS,GAAG;AAAA,MACd,OAAO,OAAO,KAAK,QAAQ,MAAM;AAAA,IACnC;AAAA,EACF;AAAA,EAEA,cAAc;AAAA,EAEd,OAAO,QAAQ;AAAA,EACf,OAAO;AAAA;AAOT,SAAS,WAAW,CAAC,SAAS,SAAS;AAAA,EACrC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,EAChC,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,QAAQ,QAAQ;AAAA,EAEpB,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,IACzE,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,QAAQ,UAAU;AAAA,IAClB,QAAQ,UAAU;AAAA,IAElB,IAAI,mBAAmB,iBAAiB;AAAA,MACtC,OAAO,KAAK;AAAA,QACV,SAAS,CAAC,QAAQ,GAAG,eAAe;AAAA,QACpC,gBAAgB,QAAQ,MAAM,QAAQ,GAAG,QAAQ,IAAI,eAAe;AAAA,QACpE,SAAS,CAAC,QAAQ,GAAG,eAAe;AAAA,QACpC,gBAAgB,QAAQ,MAAM,QAAQ,GAAG,QAAQ,IAAI,eAAe;AAAA,MACtE,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,OAAO,QAAQ;AAAA,EACf,OAAO;AAAA;AAMT,SAAS,SAAS,CAAC,SAAS,SAAS;AAAA,EACnC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,EAChC,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,QAAQ,QAAQ;AAAA,EAEpB,SAAS,gBAAgB,CAAC,QAAQ,QAAQ,QAAQ;AAAA,IAChD,IAAI,QAAQ,CAAC;AAAA,IACb,SAAS,IAAI,EAAG,IAAI,QAAQ,KAAK;AAAA,MAC/B,MAAM,KAAK,OAAO,SAAS,EAAE;AAAA,IAC/B;AAAA,IACA,OAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA;AAAA,EAGF,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,IACzE,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,QAAQ,UAAU;AAAA,IAClB,QAAQ,UAAU;AAAA,IAElB,IAAI,mBAAmB,iBAAiB;AAAA,MACtC,OAAO,KAAK;AAAA,QACV,SAAS,iBAAiB,SAAS,UAAU,eAAe,GAAG,eAAe;AAAA,QAC9E,SAAS,iBAAiB,SAAS,UAAU,eAAe,GAAG,eAAe;AAAA,MAChF,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,OAAO,QAAQ;AAAA,EACf,OAAO;AAAA;AAgBT,SAAS,iBAAiB,CAAC,GAAG,GAAG,GAAG;AAAA,EAIlC,IAAI,QAAQ,CAAC;AAAA,EACb,SAAS,OAAO,CAAC,GAAG,IAAI;AAAA,IACtB,MAAM,KAAK;AAAA,MACT;AAAA,MACA,QAAQ,EAAE,QAAQ;AAAA,MAClB,SAAS,EAAE,QAAQ;AAAA,MACnB,SAAS,EAAE,QAAQ;AAAA,MACnB,UAAU,EAAE,QAAQ;AAAA,IAEtB,CAAC;AAAA;AAAA,EAGH,YAAY,GAAG,CAAC,EAAE,QAAQ,UAAQ,QAAQ,MAAM,GAAG,CAAC;AAAA,EACpD,YAAY,GAAG,CAAC,EAAE,QAAQ,UAAQ,QAAQ,MAAM,GAAG,CAAC;AAAA,EACpD,MAAM,KAAK,CAAC,GAAE,MAAM,EAAE,SAAS,EAAE,MAAM;AAAA,EAEvC,IAAI,UAAU,CAAC;AAAA,EACf,IAAI,aAAa;AAAA,EAEjB,SAAS,SAAS,CAAC,WAAW;AAAA,IAC5B,IAAI,YAAY,YAAY;AAAA,MAC1B,QAAQ,KAAK;AAAA,QACX,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,aAAa;AAAA,QACb,cAAc,YAAY;AAAA,QAC1B,eAAe,EAAE,MAAM,YAAY,SAAS;AAAA,MAC9C,CAAC;AAAA,MACD,aAAa;AAAA,IACf;AAAA;AAAA,EAGF,OAAO,MAAM,QAAQ;AAAA,IACnB,IAAI,OAAO,MAAM,MAAM;AAAA,IACvB,IAAI,cAAc,KAAK;AAAA,IACvB,IAAI,YAAY,KAAK,SAAS,KAAK;AAAA,IACnC,IAAI,cAAc,CAAC,IAAI;AAAA,IACvB,UAAU,WAAW;AAAA,IAGrB,OAAO,MAAM,QAAQ;AAAA,MACnB,MAAM,WAAW,MAAM;AAAA,MACvB,MAAM,gBAAgB,SAAS;AAAA,MAC/B,IAAI,gBAAgB;AAAA,QAAW;AAAA,MAE/B,YAAY,KAAK,IAAI,WAAW,gBAAgB,SAAS,OAAO;AAAA,MAChE,YAAY,KAAK,MAAM,MAAM,CAAC;AAAA,IAChC;AAAA,IAEA,IAAI,YAAY,WAAW,GAAG;AAAA,MAG5B,IAAI,KAAK,WAAW,GAAG;AAAA,QACrB,MAAM,SAAU,KAAK,OAAO,MAAM,IAAI;AAAA,QACtC,QAAQ,KAAK;AAAA,UACX,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,aAAa,KAAK;AAAA,UAClB,cAAc,KAAK;AAAA,UACnB,eAAe,OAAO,MAAM,KAAK,SAAS,KAAK,UAAU,KAAK,QAAQ;AAAA,QACxE,CAAC;AAAA,MACH;AAAA,IACF,EAAO;AAAA,MAKL,IAAI,SAAS;AAAA,QACX,GAAG,CAAC,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE;AAAA,QAC9B,GAAG,CAAC,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE;AAAA,MAChC;AAAA,MACA,OAAO,YAAY,QAAQ;AAAA,QACzB,OAAO,YAAY,MAAM;AAAA,QACzB,MAAM,SAAS,KAAK;AAAA,QACpB,MAAM,OAAO,SAAS,KAAK;AAAA,QAC3B,MAAM,UAAU,KAAK;AAAA,QACrB,MAAM,QAAQ,UAAU,KAAK;AAAA,QAC7B,IAAI,KAAI,OAAO,KAAK;AAAA,QACpB,GAAE,KAAK,KAAK,IAAI,SAAS,GAAE,EAAE;AAAA,QAC7B,GAAE,KAAK,KAAK,IAAI,OAAO,GAAE,EAAE;AAAA,QAC3B,GAAE,KAAK,KAAK,IAAI,QAAQ,GAAE,EAAE;AAAA,QAC5B,GAAE,KAAK,KAAK,IAAI,MAAM,GAAE,EAAE;AAAA,MAC5B;AAAA,MAEA,MAAM,SAAS,OAAO,EAAE,MAAM,cAAc,OAAO,EAAE;AAAA,MACrD,MAAM,OAAO,OAAO,EAAE,MAAM,YAAY,OAAO,EAAE;AAAA,MACjD,MAAM,SAAS,OAAO,EAAE,MAAM,cAAc,OAAO,EAAE;AAAA,MACrD,MAAM,OAAO,OAAO,EAAE,MAAM,YAAY,OAAO,EAAE;AAAA,MAEjD,IAAI,SAAS;AAAA,QACX,QAAQ;AAAA,QACR;AAAA,QACA,SAAS,OAAO;AAAA,QAChB,UAAU,EAAE,MAAM,QAAQ,IAAI;AAAA,QAC9B,QAAQ;AAAA,QACR,SAAS,YAAY;AAAA,QACrB,UAAU,EAAE,MAAM,aAAa,SAAS;AAAA,QACxC;AAAA,QACA,SAAS,OAAO;AAAA,QAChB,UAAU,EAAE,MAAM,QAAQ,IAAI;AAAA,MAChC;AAAA,MACA,QAAQ,KAAK,MAAM;AAAA;AAAA,IAErB,aAAa;AAAA,EACf;AAAA,EAEA,UAAU,EAAE,MAAM;AAAA,EAElB,OAAO;AAAA;AAQT,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EACpC,IAAI,WAAW;AAAA,IACb,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,EACnB;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,IAAI,OAAO,MAAM;AAAA,IAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,EAC9D,IAAI,OAAO,MAAM;AAAA,IAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,EAC9D,IAAI,OAAO,MAAM;AAAA,IAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,EAE9D,IAAI,UAAU,CAAC;AAAA,EACf,MAAM,UAAU,kBAAkB,GAAG,GAAG,CAAC;AAAA,EAEzC,IAAI,WAAW,CAAC;AAAA,EAChB,SAAS,OAAO,GAAG;AAAA,IACjB,IAAI,SAAS,QAAQ;AAAA,MACnB,QAAQ,KAAK,EAAE,IAAI,SAAS,CAAC;AAAA,IAC/B;AAAA,IACA,WAAW,CAAC;AAAA;AAAA,EAGd,SAAS,eAAe,CAAC,IAAG,IAAG;AAAA,IAC7B,IAAI,GAAE,WAAW,GAAE;AAAA,MAAQ,OAAO;AAAA,IAClC,SAAS,IAAI,EAAG,IAAI,GAAE,QAAQ,KAAK;AAAA,MACjC,IAAI,GAAE,OAAO,GAAE;AAAA,QAAI,OAAO;AAAA,IAC5B;AAAA,IACA,OAAO;AAAA;AAAA,EAGT,QAAQ,QAAQ,YAAW;AAAA,IACzB,IAAI,OAAO,QAAQ;AAAA,MACjB,SAAS,KAAK,GAAG,OAAO,aAAa;AAAA,IACvC,EAAO;AAAA,MACL,IAAI,QAAQ,yBAAyB,gBAAgB,OAAO,UAAU,OAAO,QAAQ,GAAG;AAAA,QACtF,SAAS,KAAK,GAAG,OAAO,QAAQ;AAAA,MAClC,EAAO;AAAA,QACL,QAAQ;AAAA,QACR,QAAQ,KAAK;AAAA,UACX,UAAU;AAAA,YACR,GAAG,OAAO;AAAA,YACV,QAAQ,OAAO;AAAA,YACf,GAAG,OAAO;AAAA,YACV,QAAQ,OAAO;AAAA,YACf,GAAG,OAAO;AAAA,YACV,QAAQ,OAAO;AAAA,UACjB;AAAA,QACF,CAAC;AAAA;AAAA;AAAA,GAGN;AAAA,EAED,QAAQ;AAAA,EACR,OAAO;AAAA;AAIT,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EACpC,MAAM,WAAW;AAAA,IACf,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,IACjB,OAAO,CAAC;AAAA,EACV;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW;AAAA,EACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,EAC3C,IAAI,WAAW;AAAA,EACf,IAAI,SAAS,CAAC;AAAA,EAEd,QAAQ,QAAQ,YAAU;AAAA,IACxB,IAAI,OAAO,IAAI;AAAA,MACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,IAClC,EAAO,SAAI,OAAO,UAAU;AAAA,MAC1B,WAAW;AAAA,MACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,CACX;AAAA,IACF;AAAA,GACD;AAAA,EAED,OAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AAAA;AAIF,SAAS,KAAK,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EAC/B,MAAM,WAAW;AAAA,IACf,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,IACjB,OAAO,CAAC;AAAA,EACV;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW;AAAA,EACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,EAC3C,IAAI,WAAW;AAAA,EACf,IAAI,SAAS,CAAC;AAAA,EAEd,QAAQ,QAAQ,YAAU;AAAA,IACxB,IAAI,OAAO,IAAI;AAAA,MACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,IAClC,EAAO,SAAI,OAAO,UAAU;AAAA,MAC1B,WAAW;AAAA,MACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,CACX;AAAA,IACF;AAAA,GACD;AAAA,EAED,OAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AAAA;AAIF,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EACpC,MAAM,WAAW;AAAA,IACf,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,IACjB,OAAO,CAAC;AAAA,EACV;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW;AAAA,EACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,EAC3C,IAAI,WAAW;AAAA,EACf,IAAI,SAAS,CAAC;AAAA,EAEd,QAAQ,QAAQ,YAAU;AAAA,IACxB,IAAI,OAAO,IAAI;AAAA,MACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,IAClC,EAAO;AAAA,MACL,MAAM,IAAI,SAAS,OAAO,SAAS,GAAG,OAAO,SAAS,CAAC;AAAA,MACvD,SAAS,IAAI,EAAG,IAAI,EAAE,QAAQ,KAAK;AAAA,QACjC,IAAI,QAAQ,EAAE;AAAA,QACd,IAAI,MAAM,QAAQ;AAAA,UAChB,SAAS,OAAO,OAAO,MAAM,MAAM;AAAA,QACrC,EAAO;AAAA,UACL,WAAW;AAAA,UACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,MAAM,SACN,CAAC,QAAQ,GACT,MAAM,SACN,CAAC,QAAQ,CACX;AAAA;AAAA,MAEJ;AAAA;AAAA,GAEH;AAAA,EAED,OAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AAAA;AAMF,SAAS,KAAK,CAAC,QAAQ,QAAO;AAAA,EAC5B,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,aAAa;AAAA,EAEjB,SAAS,SAAS,CAAC,cAAc;AAAA,IAC/B,OAAO,aAAa,cAAc;AAAA,MAChC,OAAO,KAAK,OAAO,WAAW;AAAA,MAC9B;AAAA,IACF;AAAA;AAAA,EAGF,SAAS,aAAa,EAAG,aAAa,OAAM,QAAQ,cAAc;AAAA,IAChE,IAAI,QAAQ,OAAM;AAAA,IAClB,UAAU,MAAM,QAAQ,MAAM;AAAA,IAC9B,SAAS,YAAY,EAAG,YAAY,MAAM,QAAQ,MAAM,QAAQ,aAAa;AAAA,MAC3E,OAAO,KAAK,MAAM,QAAQ,MAAM,UAAU;AAAA,IAC5C;AAAA,IACA,cAAc,MAAM,QAAQ;AAAA,EAC9B;AAAA,EAEA,UAAU,OAAO,MAAM;AAAA,EACvB,OAAO;AAAA;AAMT,SAAS,UAAU,CAAC,QAAO;AAAA,EACzB,OAAO,OAAM,IAAI,YAAU;AAAA,IACzB,SAAS,EAAE,QAAQ,MAAM,QAAQ,QAAQ,QAAQ,MAAM,QAAQ,OAAO;AAAA,IACtE,SAAS,EAAE,OAAO,MAAM,QAAQ,MAAM;AAAA,EACxC,EAAE;AAAA;AAMJ,SAAS,WAAW,CAAC,QAAO;AAAA,EAC1B,OAAO,OAAM,IAAI,YAAU;AAAA,IACzB,SAAS,MAAM;AAAA,IACf,SAAS,MAAM;AAAA,EACjB,EAAE;AAAA;",
-  "debugId": "D476F1A6F1EBC8F364756E2164756E21",
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuBA,SAAS,GAAG,CAAC,SAAS,SAAS;AAAA,EAI7B,IAAI,qBAAqB,OAAO,OAAO,IAAI;AAAA,EAC3C,SAAS,IAAI,EAAG,IAAI,QAAQ,QAAQ,KAAK;AAAA,IACvC,MAAM,OAAO,QAAQ;AAAA,IACrB,IAAI,mBAAmB,OAAO;AAAA,MAC5B,mBAAmB,MAAM,KAAK,CAAC;AAAA,IACjC,EAAO;AAAA,MACL,mBAAmB,QAAQ,CAAC,CAAC;AAAA;AAAA,EAEjC;AAAA,EAEA,MAAM,aAAa,EAAE,cAAc,IAAI,cAAc,IAAI,OAAO,KAAK;AAAA,EACrE,IAAI,aAAa,CAAC,UAAU;AAAA,EAE5B,SAAS,IAAI,EAAG,IAAI,QAAQ,QAAQ,KAAK;AAAA,IACvC,MAAM,OAAO,QAAQ;AAAA,IACrB,MAAM,iBAAiB,mBAAmB,SAAS,CAAC;AAAA,IACpD,IAAI,IAAI;AAAA,IACR,IAAI,IAAI,WAAW;AAAA,IAEnB,WAAW,KAAK,gBAAgB;AAAA,MAC9B,IAAI;AAAA,MACJ,KAAK,IAAI,EAAG,IAAI,WAAW,QAAQ,KAAK;AAAA,QACtC,IAAK,WAAW,GAAG,eAAe,MAAQ,MAAM,WAAW,SAAS,KAAO,WAAW,IAAI,GAAG,eAAe,IAAK;AAAA,UAC/G;AAAA,QACF;AAAA,MACF;AAAA,MAEA,IAAI,IAAI,WAAW,QAAQ;AAAA,QACzB,MAAM,eAAe,EAAE,cAAc,GAAG,cAAc,GAAG,OAAO,WAAW,GAAG;AAAA,QAC9E,IAAI,MAAM,WAAW,QAAQ;AAAA,UAC3B,WAAW,KAAK,CAAC;AAAA,QACnB,EAAO;AAAA,UACL,WAAW,KAAK;AAAA;AAAA,QAElB,IAAI,IAAI;AAAA,QACR,IAAI;AAAA,QACJ,IAAI,MAAM,WAAW,QAAQ;AAAA,UAC3B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,IAEA,WAAW,KAAK;AAAA,EAClB;AAAA,EAKA,OAAO,WAAW,WAAW,SAAS;AAAA;AAMxC,SAAS,QAAQ,CAAC,SAAS,SAAS;AAAA,EAClC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,EAChC,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,SAAS,EAAC,QAAQ,CAAC,EAAC;AAAA,EAExB,SAAS,aAAa,GAAG;AAAA,IACvB,IAAI,OAAO,OAAO,QAAQ;AAAA,MACxB,OAAO,OAAO,QAAQ;AAAA,MACtB,OAAO,KAAK,MAAM;AAAA,MAClB,SAAS,EAAC,QAAQ,CAAC,EAAC;AAAA,IACtB;AAAA;AAAA,EAGF,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,IACzE,IAAI,YAAY,EAAC,SAAS,CAAC,GAAG,SAAS,CAAC,EAAC;AAAA,IAEzC,OAAO,EAAE,QAAQ,UAAU,cAAc;AAAA,MACvC,UAAU,QAAQ,KAAK,QAAQ,MAAM;AAAA,IACvC;AAAA,IAEA,OAAO,EAAE,QAAQ,UAAU,cAAc;AAAA,MACvC,UAAU,QAAQ,KAAK,QAAQ,MAAM;AAAA,IACvC;AAAA,IAEA,IAAI,UAAU,QAAQ,UAAU,UAAU,QAAQ,QAAQ;AAAA,MACxD,cAAc;AAAA,MACd,UAAU,QAAQ,QAAQ;AAAA,MAC1B,UAAU,QAAQ,QAAQ;AAAA,MAC1B,OAAO,KAAK,SAAS;AAAA,IACvB;AAAA,IAEA,IAAI,SAAS,GAAG;AAAA,MACd,OAAO,OAAO,KAAK,QAAQ,MAAM;AAAA,IACnC;AAAA,EACF;AAAA,EAEA,cAAc;AAAA,EAEd,OAAO,QAAQ;AAAA,EACf,OAAO;AAAA;AAOT,SAAS,WAAW,CAAC,SAAS,SAAS;AAAA,EACrC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,EAChC,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,QAAQ,QAAQ;AAAA,EAEpB,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,IACzE,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,QAAQ,UAAU;AAAA,IAClB,QAAQ,UAAU;AAAA,IAElB,IAAI,mBAAmB,iBAAiB;AAAA,MACtC,OAAO,KAAK;AAAA,QACV,SAAS,CAAC,QAAQ,GAAG,eAAe;AAAA,QACpC,gBAAgB,QAAQ,MAAM,QAAQ,GAAG,QAAQ,IAAI,eAAe;AAAA,QACpE,SAAS,CAAC,QAAQ,GAAG,eAAe;AAAA,QACpC,gBAAgB,QAAQ,MAAM,QAAQ,GAAG,QAAQ,IAAI,eAAe;AAAA,MACtE,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,OAAO,QAAQ;AAAA,EACf,OAAO;AAAA;AAMT,SAAS,SAAS,CAAC,SAAS,SAAS;AAAA,EACnC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,EAChC,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,QAAQ,QAAQ;AAAA,EAEpB,SAAS,gBAAgB,CAAC,QAAQ,QAAQ,QAAQ;AAAA,IAChD,IAAI,QAAQ,CAAC;AAAA,IACb,SAAS,IAAI,EAAG,IAAI,QAAQ,KAAK;AAAA,MAC/B,MAAM,KAAK,OAAO,SAAS,EAAE;AAAA,IAC/B;AAAA,IACA,OAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA;AAAA,EAGF,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,IACzE,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,QAAQ,UAAU;AAAA,IAClB,QAAQ,UAAU;AAAA,IAElB,IAAI,mBAAmB,iBAAiB;AAAA,MACtC,OAAO,KAAK;AAAA,QACV,SAAS,iBAAiB,SAAS,UAAU,eAAe,GAAG,eAAe;AAAA,QAC9E,SAAS,iBAAiB,SAAS,UAAU,eAAe,GAAG,eAAe;AAAA,MAChF,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,OAAO,QAAQ;AAAA,EACf,OAAO;AAAA;AAgBT,SAAS,iBAAiB,CAAC,GAAG,GAAG,GAAG;AAAA,EAIlC,IAAI,QAAQ,CAAC;AAAA,EACb,SAAS,OAAO,CAAC,GAAG,IAAI;AAAA,IACtB,MAAM,KAAK;AAAA,MACT;AAAA,MACA,QAAQ,EAAE,QAAQ;AAAA,MAClB,SAAS,EAAE,QAAQ;AAAA,MACnB,SAAS,EAAE,QAAQ;AAAA,MACnB,UAAU,EAAE,QAAQ;AAAA,IAEtB,CAAC;AAAA;AAAA,EAGH,YAAY,GAAG,CAAC,EAAE,QAAQ,UAAQ,QAAQ,MAAM,GAAG,CAAC;AAAA,EACpD,YAAY,GAAG,CAAC,EAAE,QAAQ,UAAQ,QAAQ,MAAM,GAAG,CAAC;AAAA,EACpD,MAAM,KAAK,CAAC,GAAE,MAAM,EAAE,SAAS,EAAE,MAAM;AAAA,EAEvC,IAAI,UAAU,CAAC;AAAA,EACf,IAAI,aAAa;AAAA,EAEjB,SAAS,SAAS,CAAC,WAAW;AAAA,IAC5B,IAAI,YAAY,YAAY;AAAA,MAC1B,QAAQ,KAAK;AAAA,QACX,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,aAAa;AAAA,QACb,cAAc,YAAY;AAAA,QAC1B,eAAe,EAAE,MAAM,YAAY,SAAS;AAAA,MAC9C,CAAC;AAAA,MACD,aAAa;AAAA,IACf;AAAA;AAAA,EAGF,OAAO,MAAM,QAAQ;AAAA,IACnB,IAAI,OAAO,MAAM,MAAM;AAAA,IACvB,IAAI,cAAc,KAAK;AAAA,IACvB,IAAI,YAAY,KAAK,SAAS,KAAK;AAAA,IACnC,IAAI,cAAc,CAAC,IAAI;AAAA,IACvB,UAAU,WAAW;AAAA,IAGrB,OAAO,MAAM,QAAQ;AAAA,MACnB,MAAM,WAAW,MAAM;AAAA,MACvB,MAAM,gBAAgB,SAAS;AAAA,MAC/B,IAAI,gBAAgB;AAAA,QAAW;AAAA,MAE/B,YAAY,KAAK,IAAI,WAAW,gBAAgB,SAAS,OAAO;AAAA,MAChE,YAAY,KAAK,MAAM,MAAM,CAAC;AAAA,IAChC;AAAA,IAEA,IAAI,YAAY,WAAW,GAAG;AAAA,MAG5B,IAAI,KAAK,WAAW,GAAG;AAAA,QACrB,MAAM,SAAU,KAAK,OAAO,MAAM,IAAI;AAAA,QACtC,QAAQ,KAAK;AAAA,UACX,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,aAAa,KAAK;AAAA,UAClB,cAAc,KAAK;AAAA,UACnB,eAAe,OAAO,MAAM,KAAK,SAAS,KAAK,UAAU,KAAK,QAAQ;AAAA,QACxE,CAAC;AAAA,MACH;AAAA,IACF,EAAO;AAAA,MAKL,IAAI,SAAS;AAAA,QACX,GAAG,CAAC,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE;AAAA,QAC9B,GAAG,CAAC,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE;AAAA,MAChC;AAAA,MACA,OAAO,YAAY,QAAQ;AAAA,QACzB,OAAO,YAAY,MAAM;AAAA,QACzB,MAAM,SAAS,KAAK;AAAA,QACpB,MAAM,OAAO,SAAS,KAAK;AAAA,QAC3B,MAAM,UAAU,KAAK;AAAA,QACrB,MAAM,QAAQ,UAAU,KAAK;AAAA,QAC7B,IAAI,KAAI,OAAO,KAAK;AAAA,QACpB,GAAE,KAAK,KAAK,IAAI,SAAS,GAAE,EAAE;AAAA,QAC7B,GAAE,KAAK,KAAK,IAAI,OAAO,GAAE,EAAE;AAAA,QAC3B,GAAE,KAAK,KAAK,IAAI,QAAQ,GAAE,EAAE;AAAA,QAC5B,GAAE,KAAK,KAAK,IAAI,MAAM,GAAE,EAAE;AAAA,MAC5B;AAAA,MAEA,MAAM,SAAS,OAAO,EAAE,MAAM,cAAc,OAAO,EAAE;AAAA,MACrD,MAAM,OAAO,OAAO,EAAE,MAAM,YAAY,OAAO,EAAE;AAAA,MACjD,MAAM,SAAS,OAAO,EAAE,MAAM,cAAc,OAAO,EAAE;AAAA,MACrD,MAAM,OAAO,OAAO,EAAE,MAAM,YAAY,OAAO,EAAE;AAAA,MAEjD,IAAI,SAAS;AAAA,QACX,QAAQ;AAAA,QACR;AAAA,QACA,SAAS,OAAO;AAAA,QAChB,UAAU,EAAE,MAAM,QAAQ,IAAI;AAAA,QAC9B,QAAQ;AAAA,QACR,SAAS,YAAY;AAAA,QACrB,UAAU,EAAE,MAAM,aAAa,SAAS;AAAA,QACxC;AAAA,QACA,SAAS,OAAO;AAAA,QAChB,UAAU,EAAE,MAAM,QAAQ,IAAI;AAAA,MAChC;AAAA,MACA,QAAQ,KAAK,MAAM;AAAA;AAAA,IAErB,aAAa;AAAA,EACf;AAAA,EAEA,UAAU,EAAE,MAAM;AAAA,EAElB,OAAO;AAAA;AAQT,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EACpC,IAAI,WAAW;AAAA,IACb,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,EACnB;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,IAAI,OAAO,MAAM;AAAA,IAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,EAC9D,IAAI,OAAO,MAAM;AAAA,IAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,EAC9D,IAAI,OAAO,MAAM;AAAA,IAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,EAE9D,IAAI,UAAU,CAAC;AAAA,EACf,MAAM,UAAU,kBAAkB,GAAG,GAAG,CAAC;AAAA,EAEzC,IAAI,WAAW,CAAC;AAAA,EAChB,SAAS,OAAO,GAAG;AAAA,IACjB,IAAI,SAAS,QAAQ;AAAA,MACnB,QAAQ,KAAK,EAAE,IAAI,SAAS,CAAC;AAAA,IAC/B;AAAA,IACA,WAAW,CAAC;AAAA;AAAA,EAGd,SAAS,eAAe,CAAC,IAAG,IAAG;AAAA,IAC7B,IAAI,GAAE,WAAW,GAAE;AAAA,MAAQ,OAAO;AAAA,IAClC,SAAS,IAAI,EAAG,IAAI,GAAE,QAAQ,KAAK;AAAA,MACjC,IAAI,GAAE,OAAO,GAAE;AAAA,QAAI,OAAO;AAAA,IAC5B;AAAA,IACA,OAAO;AAAA;AAAA,EAGT,QAAQ,QAAQ,YAAW;AAAA,IACzB,IAAI,OAAO,QAAQ;AAAA,MACjB,SAAS,KAAK,GAAG,OAAO,aAAa;AAAA,IACvC,EAAO;AAAA,MACL,IAAI,QAAQ,yBAAyB,gBAAgB,OAAO,UAAU,OAAO,QAAQ,GAAG;AAAA,QACtF,SAAS,KAAK,GAAG,OAAO,QAAQ;AAAA,MAClC,EAAO;AAAA,QACL,QAAQ;AAAA,QACR,QAAQ,KAAK;AAAA,UACX,UAAU;AAAA,YACR,GAAG,OAAO;AAAA,YACV,QAAQ,OAAO;AAAA,YACf,GAAG,OAAO;AAAA,YACV,QAAQ,OAAO;AAAA,YACf,GAAG,OAAO;AAAA,YACV,QAAQ,OAAO;AAAA,UACjB;AAAA,QACF,CAAC;AAAA;AAAA;AAAA,GAGN;AAAA,EAED,QAAQ;AAAA,EACR,OAAO;AAAA;AAIT,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EACpC,MAAM,WAAW;AAAA,IACf,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,IACjB,OAAO,CAAC;AAAA,EACV;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW;AAAA,EACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,EAC3C,IAAI,WAAW;AAAA,EACf,IAAI,SAAS,CAAC;AAAA,EAEd,QAAQ,QAAQ,YAAU;AAAA,IACxB,IAAI,OAAO,IAAI;AAAA,MACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,IAClC,EAAO,SAAI,OAAO,UAAU;AAAA,MAC1B,WAAW;AAAA,MACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,CACX;AAAA,IACF;AAAA,GACD;AAAA,EAED,OAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AAAA;AAIF,SAAS,KAAK,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EAC/B,MAAM,WAAW;AAAA,IACf,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,IACjB,OAAO,CAAC;AAAA,EACV;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW;AAAA,EACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,EAC3C,IAAI,WAAW;AAAA,EACf,IAAI,SAAS,CAAC;AAAA,EAEd,QAAQ,QAAQ,YAAU;AAAA,IACxB,IAAI,OAAO,IAAI;AAAA,MACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,IAClC,EAAO,SAAI,OAAO,UAAU;AAAA,MAC1B,WAAW;AAAA,MACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,CACX;AAAA,IACF;AAAA,GACD;AAAA,EAED,OAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AAAA;AAIF,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EACpC,MAAM,WAAW;AAAA,IACf,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,IACjB,OAAO,CAAC;AAAA,EACV;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW;AAAA,EACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,EAC3C,IAAI,WAAW;AAAA,EACf,IAAI,SAAS,CAAC;AAAA,EAEd,QAAQ,QAAQ,YAAU;AAAA,IACxB,IAAI,OAAO,IAAI;AAAA,MACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,IAClC,EAAO;AAAA,MACL,MAAM,IAAI,SAAS,OAAO,SAAS,GAAG,OAAO,SAAS,CAAC;AAAA,MACvD,WAAW,SAAS,GAAG;AAAA,QACrB,IAAI,MAAM,QAAQ;AAAA,UAChB,SAAS,OAAO,OAAO,MAAM,MAAM;AAAA,QACrC,EAAO;AAAA,UACL,WAAW;AAAA,UACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,MAAM,SACN,CAAC,QAAQ,GACT,MAAM,SACN,CAAC,QAAQ,CACX;AAAA;AAAA,MAEJ;AAAA;AAAA,GAEH;AAAA,EAED,OAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AAAA;AAMF,SAAS,KAAK,CAAC,QAAQ,QAAO;AAAA,EAC5B,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,aAAa;AAAA,EAEjB,SAAS,SAAS,CAAC,cAAc;AAAA,IAC/B,OAAO,aAAa,cAAc;AAAA,MAChC,OAAO,KAAK,OAAO,WAAW;AAAA,MAC9B;AAAA,IACF;AAAA;AAAA,EAGF,WAAW,SAAS,QAAO;AAAA,IACzB,UAAU,MAAM,QAAQ,MAAM;AAAA,IAC9B,WAAW,QAAQ,MAAM,QAAQ,OAAO;AAAA,MACtC,OAAO,KAAK,IAAI;AAAA,IAClB;AAAA,IACA,cAAc,MAAM,QAAQ;AAAA,EAC9B;AAAA,EAEA,UAAU,OAAO,MAAM;AAAA,EACvB,OAAO;AAAA;AAMT,SAAS,UAAU,CAAC,QAAO;AAAA,EACzB,OAAO,OAAM,IAAI,YAAU;AAAA,IACzB,SAAS,EAAE,QAAQ,MAAM,QAAQ,QAAQ,QAAQ,MAAM,QAAQ,OAAO;AAAA,IACtE,SAAS,EAAE,OAAO,MAAM,QAAQ,MAAM;AAAA,EACxC,EAAE;AAAA;AAMJ,SAAS,WAAW,CAAC,QAAO;AAAA,EAC1B,OAAO,OAAM,IAAI,YAAU;AAAA,IACzB,SAAS,MAAM;AAAA,IACf,SAAS,MAAM;AAAA,EACjB,EAAE;AAAA;",
+  "debugId": "19FA63E3C145F4F864756E2164756E21",
   "names": []
 }

dist/diff3.iife.js

 (() => {
   var __defProp = Object.defineProperty;
+  var __returnValue = (v) => v;
+  function __exportSetter(name, newValue) {
+    this[name] = __returnValue.bind(null, newValue);
+  }
   var __export = (target, all) => {
@@ -9,3 +13,3 @@ for (var name in all)
         configurable: true,
-        set: (newValue) => all[name] = () => newValue
+        set: __exportSetter.bind(all, name)
       });
@@ -31,3 +35,3 @@ };
   function LCS(buffer1, buffer2) {
-    let equivalenceClasses = {};
+    let equivalenceClasses = Object.create(null);
     for (let j = 0;j < buffer2.length; j++) {
@@ -48,4 +52,3 @@ const item = buffer2[j];
       let c = candidates[0];
-      for (let jx = 0;jx < buffer2indices.length; jx++) {
-        const j = buffer2indices[jx];
+      for (const j of buffer2indices) {
         let s;
@@ -381,4 +384,3 @@ for (s = r;s < candidates.length; s++) {
         const c = diffComm(region.conflict.a, region.conflict.b);
-        for (let j = 0;j < c.length; j++) {
-          let inner = c[j];
+        for (const inner of c) {
           if (inner.common) {
@@ -407,7 +409,6 @@ result = result.concat(inner.common);
     }
-    for (let chunkIndex = 0;chunkIndex < patch2.length; chunkIndex++) {
-      let chunk = patch2[chunkIndex];
+    for (const chunk of patch2) {
       advanceTo(chunk.buffer1.offset);
-      for (let itemIndex = 0;itemIndex < chunk.buffer2.chunk.length; itemIndex++) {
-        result.push(chunk.buffer2.chunk[itemIndex]);
+      for (const item of chunk.buffer2.chunk) {
+        result.push(item);
       }
@@ -436,3 +437,3 @@ currOffset += chunk.buffer1.length;
 
-//# debugId=5D96D19B25AE829964756E2164756E21
+//# debugId=C89158E5AADAC8F364756E2164756E21
 //# sourceMappingURL=diff3.iife.js.map

dist/diff3.iife.js.map

@@ -5,8 +5,8 @@ {
   "sourcesContent": [
-    "export {\n  LCS,\n  diffComm,\n  diffIndices,\n  diffPatch,\n  diff3MergeRegions,\n  diff3Merge,\n  mergeDiff3,\n  merge,\n  mergeDigIn,\n  patch,\n  stripPatch,\n  invertPatch\n};\n\n\n// Text diff algorithm following Hunt and McIlroy 1976.\n// J. W. Hunt and M. D. McIlroy, An algorithm for differential buffer\n// comparison, Bell Telephone Laboratories CSTR #41 (1976)\n// http://www.cs.dartmouth.edu/~doug/\n// https://en.wikipedia.org/wiki/Longest_common_subsequence_problem\n//\n// Expects two arrays, finds longest common sequence\nfunction LCS(buffer1, buffer2) {\n  let equivalenceClasses = {};\n  for (let j = 0; j < buffer2.length; j++) {\n    const item = buffer2[j];\n    if (equivalenceClasses[item]) {\n      equivalenceClasses[item].push(j);\n    } else {\n      equivalenceClasses[item] = [j];\n    }\n  }\n\n  const NULLRESULT = { buffer1index: -1, buffer2index: -1, chain: null };\n  let candidates = [NULLRESULT];\n\n  for (let i = 0; i < buffer1.length; i++) {\n    const item = buffer1[i];\n    const buffer2indices = equivalenceClasses[item] || [];\n    let r = 0;\n    let c = candidates[0];\n\n    for (let jx = 0; jx < buffer2indices.length; jx++) {\n      const j = buffer2indices[jx];\n\n      let s;\n      for (s = r; s < candidates.length; s++) {\n        if ((candidates[s].buffer2index < j) && ((s === candidates.length - 1) || (candidates[s + 1].buffer2index > j))) {\n          break;\n        }\n      }\n\n      if (s < candidates.length) {\n        const newCandidate = { buffer1index: i, buffer2index: j, chain: candidates[s] };\n        if (r === candidates.length) {\n          candidates.push(c);\n        } else {\n          candidates[r] = c;\n        }\n        r = s + 1;\n        c = newCandidate;\n        if (r === candidates.length) {\n          break; // no point in examining further (j)s\n        }\n      }\n    }\n\n    candidates[r] = c;\n  }\n\n  // At this point, we know the LCS: it's in the reverse of the\n  // linked-list through .chain of candidates[candidates.length - 1].\n\n  return candidates[candidates.length - 1];\n}\n\n\n// We apply the LCS to build a 'comm'-style picture of the\n// differences between buffer1 and buffer2.\nfunction diffComm(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n  let common = {common: []};\n\n  function processCommon() {\n    if (common.common.length) {\n      common.common.reverse();\n      result.push(common);\n      common = {common: []};\n    }\n  }\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    let different = {buffer1: [], buffer2: []};\n\n    while (--tail1 > candidate.buffer1index) {\n      different.buffer1.push(buffer1[tail1]);\n    }\n\n    while (--tail2 > candidate.buffer2index) {\n      different.buffer2.push(buffer2[tail2]);\n    }\n\n    if (different.buffer1.length || different.buffer2.length) {\n      processCommon();\n      different.buffer1.reverse();\n      different.buffer2.reverse();\n      result.push(different);\n    }\n\n    if (tail1 >= 0) {\n      common.common.push(buffer1[tail1]);\n    }\n  }\n\n  processCommon();\n\n  result.reverse();\n  return result;\n}\n\n\n// We apply the LCS to give a simple representation of the\n// offsets and lengths of mismatched chunks in the input\n// buffers. This is used by diff3MergeRegions.\nfunction diffIndices(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    const mismatchLength1 = tail1 - candidate.buffer1index - 1;\n    const mismatchLength2 = tail2 - candidate.buffer2index - 1;\n    tail1 = candidate.buffer1index;\n    tail2 = candidate.buffer2index;\n\n    if (mismatchLength1 || mismatchLength2) {\n      result.push({\n        buffer1: [tail1 + 1, mismatchLength1],\n        buffer1Content: buffer1.slice(tail1 + 1, tail1 + 1 + mismatchLength1),\n        buffer2: [tail2 + 1, mismatchLength2],\n        buffer2Content: buffer2.slice(tail2 + 1, tail2 + 1 + mismatchLength2)\n      });\n    }\n  }\n\n  result.reverse();\n  return result;\n}\n\n\n// We apply the LCS to build a JSON representation of a\n// diff(1)-style patch.\nfunction diffPatch(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n\n  function chunkDescription(buffer, offset, length) {\n    let chunk = [];\n    for (let i = 0; i < length; i++) {\n      chunk.push(buffer[offset + i]);\n    }\n    return {\n      offset: offset,\n      length: length,\n      chunk: chunk\n    };\n  }\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    const mismatchLength1 = tail1 - candidate.buffer1index - 1;\n    const mismatchLength2 = tail2 - candidate.buffer2index - 1;\n    tail1 = candidate.buffer1index;\n    tail2 = candidate.buffer2index;\n\n    if (mismatchLength1 || mismatchLength2) {\n      result.push({\n        buffer1: chunkDescription(buffer1, candidate.buffer1index + 1, mismatchLength1),\n        buffer2: chunkDescription(buffer2, candidate.buffer2index + 1, mismatchLength2)\n      });\n    }\n  }\n\n  result.reverse();\n  return result;\n}\n\n\n// Given three buffers, A, O, and B, where both A and B are\n// independently derived from O, returns a fairly complicated\n// internal representation of merge decisions it's taken. The\n// interested reader may wish to consult\n//\n// Sanjeev Khanna, Keshav Kunal, and Benjamin C. Pierce.\n// 'A Formal Investigation of ' In Arvind and Prasad,\n// editors, Foundations of Software Technology and Theoretical\n// Computer Science (FSTTCS), December 2007.\n//\n// (http://www.cis.upenn.edu/~bcpierce/papers/diff3-short.pdf)\n//\nfunction diff3MergeRegions(a, o, b) {\n\n  // \"hunks\" are array subsets where `a` or `b` are different from `o`\n  // https://www.gnu.org/software/diffutils/manual/html_node/diff3-Hunks.html\n  let hunks = [];\n  function addHunk(h, ab) {\n    hunks.push({\n      ab: ab,\n      oStart: h.buffer1[0],\n      oLength: h.buffer1[1],   // length of o to remove\n      abStart: h.buffer2[0],\n      abLength: h.buffer2[1]   // length of a/b to insert\n      // abContent: (ab === 'a' ? a : b).slice(h.buffer2[0], h.buffer2[0] + h.buffer2[1])\n    });\n  }\n\n  diffIndices(o, a).forEach(item => addHunk(item, 'a'));\n  diffIndices(o, b).forEach(item => addHunk(item, 'b'));\n  hunks.sort((x,y) => x.oStart - y.oStart);\n\n  let results = [];\n  let currOffset = 0;\n\n  function advanceTo(endOffset) {\n    if (endOffset > currOffset) {\n      results.push({\n        stable: true,\n        buffer: 'o',\n        bufferStart: currOffset,\n        bufferLength: endOffset - currOffset,\n        bufferContent: o.slice(currOffset, endOffset)\n      });\n      currOffset = endOffset;\n    }\n  }\n\n  while (hunks.length) {\n    let hunk = hunks.shift();\n    let regionStart = hunk.oStart;\n    let regionEnd = hunk.oStart + hunk.oLength;\n    let regionHunks = [hunk];\n    advanceTo(regionStart);\n\n    // Try to pull next overlapping hunk into this region\n    while (hunks.length) {\n      const nextHunk = hunks[0];\n      const nextHunkStart = nextHunk.oStart;\n      if (nextHunkStart > regionEnd) break;   // no overlap\n\n      regionEnd = Math.max(regionEnd, nextHunkStart + nextHunk.oLength);\n      regionHunks.push(hunks.shift());\n    }\n\n    if (regionHunks.length === 1) {\n      // Only one hunk touches this region, meaning that there is no conflict here.\n      // Either `a` or `b` is inserting into a region of `o` unchanged by the other.\n      if (hunk.abLength > 0) {\n        const buffer = (hunk.ab === 'a' ? a : b);\n        results.push({\n          stable: true,\n          buffer: hunk.ab,\n          bufferStart: hunk.abStart,\n          bufferLength: hunk.abLength,\n          bufferContent: buffer.slice(hunk.abStart, hunk.abStart + hunk.abLength)\n        });\n      }\n    } else {\n      // A true a/b conflict. Determine the bounds involved from `a`, `o`, and `b`.\n      // Effectively merge all the `a` hunks into one giant hunk, then do the\n      // same for the `b` hunks; then, correct for skew in the regions of `o`\n      // that each side changed, and report appropriate spans for the three sides.\n      let bounds = {\n        a: [a.length, -1, o.length, -1],\n        b: [b.length, -1, o.length, -1]\n      };\n      while (regionHunks.length) {\n        hunk = regionHunks.shift();\n        const oStart = hunk.oStart;\n        const oEnd = oStart + hunk.oLength;\n        const abStart = hunk.abStart;\n        const abEnd = abStart + hunk.abLength;\n        let b = bounds[hunk.ab];\n        b[0] = Math.min(abStart, b[0]);\n        b[1] = Math.max(abEnd, b[1]);\n        b[2] = Math.min(oStart, b[2]);\n        b[3] = Math.max(oEnd, b[3]);\n      }\n\n      const aStart = bounds.a[0] + (regionStart - bounds.a[2]);\n      const aEnd = bounds.a[1] + (regionEnd - bounds.a[3]);\n      const bStart = bounds.b[0] + (regionStart - bounds.b[2]);\n      const bEnd = bounds.b[1] + (regionEnd - bounds.b[3]);\n\n      let result = {\n        stable: false,\n        aStart: aStart,\n        aLength: aEnd - aStart,\n        aContent: a.slice(aStart, aEnd),\n        oStart: regionStart,\n        oLength: regionEnd - regionStart,\n        oContent: o.slice(regionStart, regionEnd),\n        bStart: bStart,\n        bLength: bEnd - bStart,\n        bContent: b.slice(bStart, bEnd)\n      };\n      results.push(result);\n    }\n    currOffset = regionEnd;\n  }\n\n  advanceTo(o.length);\n\n  return results;\n}\n\n\n// Applies the output of diff3MergeRegions to actually\n// construct the merged buffer; the returned result alternates\n// between 'ok' and 'conflict' blocks.\n// A \"false conflict\" is where `a` and `b` both change the same from `o`\nfunction diff3Merge(a, o, b, options) {\n  let defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/\n  };\n  options = Object.assign(defaults, options);\n\n  if (typeof a === 'string') a = a.split(options.stringSeparator);\n  if (typeof o === 'string') o = o.split(options.stringSeparator);\n  if (typeof b === 'string') b = b.split(options.stringSeparator);\n\n  let results = [];\n  const regions = diff3MergeRegions(a, o, b);\n\n  let okBuffer = [];\n  function flushOk() {\n    if (okBuffer.length) {\n      results.push({ ok: okBuffer });\n    }\n    okBuffer = [];\n  }\n\n  function isFalseConflict(a, b) {\n    if (a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) {\n      if (a[i] !== b[i]) return false;\n    }\n    return true;\n  }\n\n  regions.forEach(region =>  {\n    if (region.stable) {\n      okBuffer.push(...region.bufferContent);\n    } else {\n      if (options.excludeFalseConflicts && isFalseConflict(region.aContent, region.bContent)) {\n        okBuffer.push(...region.aContent);\n      } else {\n        flushOk();\n        results.push({\n          conflict: {\n            a: region.aContent,\n            aIndex: region.aStart,\n            o: region.oContent,\n            oIndex: region.oStart,\n            b: region.bContent,\n            bIndex: region.bStart\n          }\n        });\n      }\n    }\n  });\n\n  flushOk();\n  return results;\n}\n\n\nfunction mergeDiff3(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const oSection = '|||||||' + (options.label.o ? ` ${options.label.o}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else if (region.conflict) {\n      conflict = true;\n      result = result.concat(\n        [aSection],\n        region.conflict.a,\n        [oSection],\n        region.conflict.o,\n        [xSection],\n        region.conflict.b,\n        [bSection]\n      );\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\nfunction merge(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else if (region.conflict) {\n      conflict = true;\n      result = result.concat(\n        [aSection],\n        region.conflict.a,\n        [xSection],\n        region.conflict.b,\n        [bSection]\n      );\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\nfunction mergeDigIn(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else {\n      const c = diffComm(region.conflict.a, region.conflict.b);\n      for (let j = 0; j < c.length; j++) {\n        let inner = c[j];\n        if (inner.common) {\n          result = result.concat(inner.common);\n        } else {\n          conflict = true;\n          result = result.concat(\n            [aSection],\n            inner.buffer1,\n            [xSection],\n            inner.buffer2,\n            [bSection]\n          );\n        }\n      }\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\n// Applies a patch to a buffer.\n// Given buffer1 and buffer2, `patch(buffer1, diffPatch(buffer1, buffer2))` should give buffer2.\nfunction patch(buffer, patch) {\n  let result = [];\n  let currOffset = 0;\n\n  function advanceTo(targetOffset) {\n    while (currOffset < targetOffset) {\n      result.push(buffer[currOffset]);\n      currOffset++;\n    }\n  }\n\n  for (let chunkIndex = 0; chunkIndex < patch.length; chunkIndex++) {\n    let chunk = patch[chunkIndex];\n    advanceTo(chunk.buffer1.offset);\n    for (let itemIndex = 0; itemIndex < chunk.buffer2.chunk.length; itemIndex++) {\n      result.push(chunk.buffer2.chunk[itemIndex]);\n    }\n    currOffset += chunk.buffer1.length;\n  }\n\n  advanceTo(buffer.length);\n  return result;\n}\n\n\n// Takes the output of diffPatch(), and removes extra information from it.\n// It can still be used by patch(), below, but can no longer be inverted.\nfunction stripPatch(patch) {\n  return patch.map(chunk => ({\n    buffer1: { offset: chunk.buffer1.offset, length: chunk.buffer1.length },\n    buffer2: { chunk: chunk.buffer2.chunk }\n  }));\n}\n\n\n// Takes the output of diffPatch(), and inverts the sense of it, so that it\n// can be applied to buffer2 to give buffer1 rather than the other way around.\nfunction invertPatch(patch) {\n  return patch.map(chunk => ({\n    buffer1: chunk.buffer2,\n    buffer2: chunk.buffer1\n  }));\n}\n",
+    "export {\n  LCS,\n  diffComm,\n  diffIndices,\n  diffPatch,\n  diff3MergeRegions,\n  diff3Merge,\n  mergeDiff3,\n  merge,\n  mergeDigIn,\n  patch,\n  stripPatch,\n  invertPatch\n};\n\n\n// Text diff algorithm following Hunt and McIlroy 1976.\n// J. W. Hunt and M. D. McIlroy, An algorithm for differential buffer\n// comparison, Bell Telephone Laboratories CSTR #41 (1976)\n// http://www.cs.dartmouth.edu/~doug/\n// https://en.wikipedia.org/wiki/Longest_common_subsequence_problem\n//\n// Expects two arrays, finds longest common sequence\nfunction LCS(buffer1, buffer2) {\n  // Use a prototype-less object so input elements that happen to match\n  // `Object.prototype` members (`constructor`, `__proto__`, `toString`, ...)\n  // don't shadow the lookup with inherited values.\n  let equivalenceClasses = Object.create(null);\n  for (let j = 0; j < buffer2.length; j++) {\n    const item = buffer2[j];\n    if (equivalenceClasses[item]) {\n      equivalenceClasses[item].push(j);\n    } else {\n      equivalenceClasses[item] = [j];\n    }\n  }\n\n  const NULLRESULT = { buffer1index: -1, buffer2index: -1, chain: null };\n  let candidates = [NULLRESULT];\n\n  for (let i = 0; i < buffer1.length; i++) {\n    const item = buffer1[i];\n    const buffer2indices = equivalenceClasses[item] || [];\n    let r = 0;\n    let c = candidates[0];\n\n    for (const j of buffer2indices) {\n      let s;\n      for (s = r; s < candidates.length; s++) {\n        if ((candidates[s].buffer2index < j) && ((s === candidates.length - 1) || (candidates[s + 1].buffer2index > j))) {\n          break;\n        }\n      }\n\n      if (s < candidates.length) {\n        const newCandidate = { buffer1index: i, buffer2index: j, chain: candidates[s] };\n        if (r === candidates.length) {\n          candidates.push(c);\n        } else {\n          candidates[r] = c;\n        }\n        r = s + 1;\n        c = newCandidate;\n        if (r === candidates.length) {\n          break; // no point in examining further (j)s\n        }\n      }\n    }\n\n    candidates[r] = c;\n  }\n\n  // At this point, we know the LCS: it's in the reverse of the\n  // linked-list through .chain of candidates[candidates.length - 1].\n\n  return candidates[candidates.length - 1];\n}\n\n\n// We apply the LCS to build a 'comm'-style picture of the\n// differences between buffer1 and buffer2.\nfunction diffComm(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n  let common = {common: []};\n\n  function processCommon() {\n    if (common.common.length) {\n      common.common.reverse();\n      result.push(common);\n      common = {common: []};\n    }\n  }\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    let different = {buffer1: [], buffer2: []};\n\n    while (--tail1 > candidate.buffer1index) {\n      different.buffer1.push(buffer1[tail1]);\n    }\n\n    while (--tail2 > candidate.buffer2index) {\n      different.buffer2.push(buffer2[tail2]);\n    }\n\n    if (different.buffer1.length || different.buffer2.length) {\n      processCommon();\n      different.buffer1.reverse();\n      different.buffer2.reverse();\n      result.push(different);\n    }\n\n    if (tail1 >= 0) {\n      common.common.push(buffer1[tail1]);\n    }\n  }\n\n  processCommon();\n\n  result.reverse();\n  return result;\n}\n\n\n// We apply the LCS to give a simple representation of the\n// offsets and lengths of mismatched chunks in the input\n// buffers. This is used by diff3MergeRegions.\nfunction diffIndices(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    const mismatchLength1 = tail1 - candidate.buffer1index - 1;\n    const mismatchLength2 = tail2 - candidate.buffer2index - 1;\n    tail1 = candidate.buffer1index;\n    tail2 = candidate.buffer2index;\n\n    if (mismatchLength1 || mismatchLength2) {\n      result.push({\n        buffer1: [tail1 + 1, mismatchLength1],\n        buffer1Content: buffer1.slice(tail1 + 1, tail1 + 1 + mismatchLength1),\n        buffer2: [tail2 + 1, mismatchLength2],\n        buffer2Content: buffer2.slice(tail2 + 1, tail2 + 1 + mismatchLength2)\n      });\n    }\n  }\n\n  result.reverse();\n  return result;\n}\n\n\n// We apply the LCS to build a JSON representation of a\n// diff(1)-style patch.\nfunction diffPatch(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n\n  function chunkDescription(buffer, offset, length) {\n    let chunk = [];\n    for (let i = 0; i < length; i++) {\n      chunk.push(buffer[offset + i]);\n    }\n    return {\n      offset: offset,\n      length: length,\n      chunk: chunk\n    };\n  }\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    const mismatchLength1 = tail1 - candidate.buffer1index - 1;\n    const mismatchLength2 = tail2 - candidate.buffer2index - 1;\n    tail1 = candidate.buffer1index;\n    tail2 = candidate.buffer2index;\n\n    if (mismatchLength1 || mismatchLength2) {\n      result.push({\n        buffer1: chunkDescription(buffer1, candidate.buffer1index + 1, mismatchLength1),\n        buffer2: chunkDescription(buffer2, candidate.buffer2index + 1, mismatchLength2)\n      });\n    }\n  }\n\n  result.reverse();\n  return result;\n}\n\n\n// Given three buffers, A, O, and B, where both A and B are\n// independently derived from O, returns a fairly complicated\n// internal representation of merge decisions it's taken. The\n// interested reader may wish to consult\n//\n// Sanjeev Khanna, Keshav Kunal, and Benjamin C. Pierce.\n// 'A Formal Investigation of ' In Arvind and Prasad,\n// editors, Foundations of Software Technology and Theoretical\n// Computer Science (FSTTCS), December 2007.\n//\n// (http://www.cis.upenn.edu/~bcpierce/papers/diff3-short.pdf)\n//\nfunction diff3MergeRegions(a, o, b) {\n\n  // \"hunks\" are array subsets where `a` or `b` are different from `o`\n  // https://www.gnu.org/software/diffutils/manual/html_node/diff3-Hunks.html\n  let hunks = [];\n  function addHunk(h, ab) {\n    hunks.push({\n      ab: ab,\n      oStart: h.buffer1[0],\n      oLength: h.buffer1[1],   // length of o to remove\n      abStart: h.buffer2[0],\n      abLength: h.buffer2[1]   // length of a/b to insert\n      // abContent: (ab === 'a' ? a : b).slice(h.buffer2[0], h.buffer2[0] + h.buffer2[1])\n    });\n  }\n\n  diffIndices(o, a).forEach(item => addHunk(item, 'a'));\n  diffIndices(o, b).forEach(item => addHunk(item, 'b'));\n  hunks.sort((x,y) => x.oStart - y.oStart);\n\n  let results = [];\n  let currOffset = 0;\n\n  function advanceTo(endOffset) {\n    if (endOffset > currOffset) {\n      results.push({\n        stable: true,\n        buffer: 'o',\n        bufferStart: currOffset,\n        bufferLength: endOffset - currOffset,\n        bufferContent: o.slice(currOffset, endOffset)\n      });\n      currOffset = endOffset;\n    }\n  }\n\n  while (hunks.length) {\n    let hunk = hunks.shift();\n    let regionStart = hunk.oStart;\n    let regionEnd = hunk.oStart + hunk.oLength;\n    let regionHunks = [hunk];\n    advanceTo(regionStart);\n\n    // Try to pull next overlapping hunk into this region\n    while (hunks.length) {\n      const nextHunk = hunks[0];\n      const nextHunkStart = nextHunk.oStart;\n      if (nextHunkStart > regionEnd) break;   // no overlap\n\n      regionEnd = Math.max(regionEnd, nextHunkStart + nextHunk.oLength);\n      regionHunks.push(hunks.shift());\n    }\n\n    if (regionHunks.length === 1) {\n      // Only one hunk touches this region, meaning that there is no conflict here.\n      // Either `a` or `b` is inserting into a region of `o` unchanged by the other.\n      if (hunk.abLength > 0) {\n        const buffer = (hunk.ab === 'a' ? a : b);\n        results.push({\n          stable: true,\n          buffer: hunk.ab,\n          bufferStart: hunk.abStart,\n          bufferLength: hunk.abLength,\n          bufferContent: buffer.slice(hunk.abStart, hunk.abStart + hunk.abLength)\n        });\n      }\n    } else {\n      // A true a/b conflict. Determine the bounds involved from `a`, `o`, and `b`.\n      // Effectively merge all the `a` hunks into one giant hunk, then do the\n      // same for the `b` hunks; then, correct for skew in the regions of `o`\n      // that each side changed, and report appropriate spans for the three sides.\n      let bounds = {\n        a: [a.length, -1, o.length, -1],\n        b: [b.length, -1, o.length, -1]\n      };\n      while (regionHunks.length) {\n        hunk = regionHunks.shift();\n        const oStart = hunk.oStart;\n        const oEnd = oStart + hunk.oLength;\n        const abStart = hunk.abStart;\n        const abEnd = abStart + hunk.abLength;\n        let b = bounds[hunk.ab];\n        b[0] = Math.min(abStart, b[0]);\n        b[1] = Math.max(abEnd, b[1]);\n        b[2] = Math.min(oStart, b[2]);\n        b[3] = Math.max(oEnd, b[3]);\n      }\n\n      const aStart = bounds.a[0] + (regionStart - bounds.a[2]);\n      const aEnd = bounds.a[1] + (regionEnd - bounds.a[3]);\n      const bStart = bounds.b[0] + (regionStart - bounds.b[2]);\n      const bEnd = bounds.b[1] + (regionEnd - bounds.b[3]);\n\n      let result = {\n        stable: false,\n        aStart: aStart,\n        aLength: aEnd - aStart,\n        aContent: a.slice(aStart, aEnd),\n        oStart: regionStart,\n        oLength: regionEnd - regionStart,\n        oContent: o.slice(regionStart, regionEnd),\n        bStart: bStart,\n        bLength: bEnd - bStart,\n        bContent: b.slice(bStart, bEnd)\n      };\n      results.push(result);\n    }\n    currOffset = regionEnd;\n  }\n\n  advanceTo(o.length);\n\n  return results;\n}\n\n\n// Applies the output of diff3MergeRegions to actually\n// construct the merged buffer; the returned result alternates\n// between 'ok' and 'conflict' blocks.\n// A \"false conflict\" is where `a` and `b` both change the same from `o`\nfunction diff3Merge(a, o, b, options) {\n  let defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/\n  };\n  options = Object.assign(defaults, options);\n\n  if (typeof a === 'string') a = a.split(options.stringSeparator);\n  if (typeof o === 'string') o = o.split(options.stringSeparator);\n  if (typeof b === 'string') b = b.split(options.stringSeparator);\n\n  let results = [];\n  const regions = diff3MergeRegions(a, o, b);\n\n  let okBuffer = [];\n  function flushOk() {\n    if (okBuffer.length) {\n      results.push({ ok: okBuffer });\n    }\n    okBuffer = [];\n  }\n\n  function isFalseConflict(a, b) {\n    if (a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) {\n      if (a[i] !== b[i]) return false;\n    }\n    return true;\n  }\n\n  regions.forEach(region =>  {\n    if (region.stable) {\n      okBuffer.push(...region.bufferContent);\n    } else {\n      if (options.excludeFalseConflicts && isFalseConflict(region.aContent, region.bContent)) {\n        okBuffer.push(...region.aContent);\n      } else {\n        flushOk();\n        results.push({\n          conflict: {\n            a: region.aContent,\n            aIndex: region.aStart,\n            o: region.oContent,\n            oIndex: region.oStart,\n            b: region.bContent,\n            bIndex: region.bStart\n          }\n        });\n      }\n    }\n  });\n\n  flushOk();\n  return results;\n}\n\n\nfunction mergeDiff3(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const oSection = '|||||||' + (options.label.o ? ` ${options.label.o}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else if (region.conflict) {\n      conflict = true;\n      result = result.concat(\n        [aSection],\n        region.conflict.a,\n        [oSection],\n        region.conflict.o,\n        [xSection],\n        region.conflict.b,\n        [bSection]\n      );\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\nfunction merge(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else if (region.conflict) {\n      conflict = true;\n      result = result.concat(\n        [aSection],\n        region.conflict.a,\n        [xSection],\n        region.conflict.b,\n        [bSection]\n      );\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\nfunction mergeDigIn(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else {\n      const c = diffComm(region.conflict.a, region.conflict.b);\n      for (const inner of c) {\n        if (inner.common) {\n          result = result.concat(inner.common);\n        } else {\n          conflict = true;\n          result = result.concat(\n            [aSection],\n            inner.buffer1,\n            [xSection],\n            inner.buffer2,\n            [bSection]\n          );\n        }\n      }\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\n// Applies a patch to a buffer.\n// Given buffer1 and buffer2, `patch(buffer1, diffPatch(buffer1, buffer2))` should give buffer2.\nfunction patch(buffer, patch) {\n  let result = [];\n  let currOffset = 0;\n\n  function advanceTo(targetOffset) {\n    while (currOffset < targetOffset) {\n      result.push(buffer[currOffset]);\n      currOffset++;\n    }\n  }\n\n  for (const chunk of patch) {\n    advanceTo(chunk.buffer1.offset);\n    for (const item of chunk.buffer2.chunk) {\n      result.push(item);\n    }\n    currOffset += chunk.buffer1.length;\n  }\n\n  advanceTo(buffer.length);\n  return result;\n}\n\n\n// Takes the output of diffPatch(), and removes extra information from it.\n// It can still be used by patch(), below, but can no longer be inverted.\nfunction stripPatch(patch) {\n  return patch.map(chunk => ({\n    buffer1: { offset: chunk.buffer1.offset, length: chunk.buffer1.length },\n    buffer2: { chunk: chunk.buffer2.chunk }\n  }));\n}\n\n\n// Takes the output of diffPatch(), and inverts the sense of it, so that it\n// can be applied to buffer2 to give buffer1 rather than the other way around.\nfunction invertPatch(patch) {\n  return patch.map(chunk => ({\n    buffer1: chunk.buffer2,\n    buffer2: chunk.buffer1\n  }));\n}\n",
     "import * as Diff3 from './diff3.mjs';\nglobalThis.Diff3 = Diff3;\n"
   ],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;EAuBA,SAAS,GAAG,CAAC,SAAS,SAAS;AAAA,IAC7B,IAAI,qBAAqB,CAAC;AAAA,IAC1B,SAAS,IAAI,EAAG,IAAI,QAAQ,QAAQ,KAAK;AAAA,MACvC,MAAM,OAAO,QAAQ;AAAA,MACrB,IAAI,mBAAmB,OAAO;AAAA,QAC5B,mBAAmB,MAAM,KAAK,CAAC;AAAA,MACjC,EAAO;AAAA,QACL,mBAAmB,QAAQ,CAAC,CAAC;AAAA;AAAA,IAEjC;AAAA,IAEA,MAAM,aAAa,EAAE,cAAc,IAAI,cAAc,IAAI,OAAO,KAAK;AAAA,IACrE,IAAI,aAAa,CAAC,UAAU;AAAA,IAE5B,SAAS,IAAI,EAAG,IAAI,QAAQ,QAAQ,KAAK;AAAA,MACvC,MAAM,OAAO,QAAQ;AAAA,MACrB,MAAM,iBAAiB,mBAAmB,SAAS,CAAC;AAAA,MACpD,IAAI,IAAI;AAAA,MACR,IAAI,IAAI,WAAW;AAAA,MAEnB,SAAS,KAAK,EAAG,KAAK,eAAe,QAAQ,MAAM;AAAA,QACjD,MAAM,IAAI,eAAe;AAAA,QAEzB,IAAI;AAAA,QACJ,KAAK,IAAI,EAAG,IAAI,WAAW,QAAQ,KAAK;AAAA,UACtC,IAAK,WAAW,GAAG,eAAe,MAAQ,MAAM,WAAW,SAAS,KAAO,WAAW,IAAI,GAAG,eAAe,IAAK;AAAA,YAC/G;AAAA,UACF;AAAA,QACF;AAAA,QAEA,IAAI,IAAI,WAAW,QAAQ;AAAA,UACzB,MAAM,eAAe,EAAE,cAAc,GAAG,cAAc,GAAG,OAAO,WAAW,GAAG;AAAA,UAC9E,IAAI,MAAM,WAAW,QAAQ;AAAA,YAC3B,WAAW,KAAK,CAAC;AAAA,UACnB,EAAO;AAAA,YACL,WAAW,KAAK;AAAA;AAAA,UAElB,IAAI,IAAI;AAAA,UACR,IAAI;AAAA,UACJ,IAAI,MAAM,WAAW,QAAQ;AAAA,YAC3B;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,MAEA,WAAW,KAAK;AAAA,IAClB;AAAA,IAKA,OAAO,WAAW,WAAW,SAAS;AAAA;AAAA,EAMxC,SAAS,QAAQ,CAAC,SAAS,SAAS;AAAA,IAClC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,IAChC,IAAI,SAAS,CAAC;AAAA,IACd,IAAI,QAAQ,QAAQ;AAAA,IACpB,IAAI,QAAQ,QAAQ;AAAA,IACpB,IAAI,SAAS,EAAC,QAAQ,CAAC,EAAC;AAAA,IAExB,SAAS,aAAa,GAAG;AAAA,MACvB,IAAI,OAAO,OAAO,QAAQ;AAAA,QACxB,OAAO,OAAO,QAAQ;AAAA,QACtB,OAAO,KAAK,MAAM;AAAA,QAClB,SAAS,EAAC,QAAQ,CAAC,EAAC;AAAA,MACtB;AAAA;AAAA,IAGF,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,MACzE,IAAI,YAAY,EAAC,SAAS,CAAC,GAAG,SAAS,CAAC,EAAC;AAAA,MAEzC,OAAO,EAAE,QAAQ,UAAU,cAAc;AAAA,QACvC,UAAU,QAAQ,KAAK,QAAQ,MAAM;AAAA,MACvC;AAAA,MAEA,OAAO,EAAE,QAAQ,UAAU,cAAc;AAAA,QACvC,UAAU,QAAQ,KAAK,QAAQ,MAAM;AAAA,MACvC;AAAA,MAEA,IAAI,UAAU,QAAQ,UAAU,UAAU,QAAQ,QAAQ;AAAA,QACxD,cAAc;AAAA,QACd,UAAU,QAAQ,QAAQ;AAAA,QAC1B,UAAU,QAAQ,QAAQ;AAAA,QAC1B,OAAO,KAAK,SAAS;AAAA,MACvB;AAAA,MAEA,IAAI,SAAS,GAAG;AAAA,QACd,OAAO,OAAO,KAAK,QAAQ,MAAM;AAAA,MACnC;AAAA,IACF;AAAA,IAEA,cAAc;AAAA,IAEd,OAAO,QAAQ;AAAA,IACf,OAAO;AAAA;AAAA,EAOT,SAAS,WAAW,CAAC,SAAS,SAAS;AAAA,IACrC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,IAChC,IAAI,SAAS,CAAC;AAAA,IACd,IAAI,QAAQ,QAAQ;AAAA,IACpB,IAAI,QAAQ,QAAQ;AAAA,IAEpB,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,MACzE,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,MACzD,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,MACzD,QAAQ,UAAU;AAAA,MAClB,QAAQ,UAAU;AAAA,MAElB,IAAI,mBAAmB,iBAAiB;AAAA,QACtC,OAAO,KAAK;AAAA,UACV,SAAS,CAAC,QAAQ,GAAG,eAAe;AAAA,UACpC,gBAAgB,QAAQ,MAAM,QAAQ,GAAG,QAAQ,IAAI,eAAe;AAAA,UACpE,SAAS,CAAC,QAAQ,GAAG,eAAe;AAAA,UACpC,gBAAgB,QAAQ,MAAM,QAAQ,GAAG,QAAQ,IAAI,eAAe;AAAA,QACtE,CAAC;AAAA,MACH;AAAA,IACF;AAAA,IAEA,OAAO,QAAQ;AAAA,IACf,OAAO;AAAA;AAAA,EAMT,SAAS,SAAS,CAAC,SAAS,SAAS;AAAA,IACnC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,IAChC,IAAI,SAAS,CAAC;AAAA,IACd,IAAI,QAAQ,QAAQ;AAAA,IACpB,IAAI,QAAQ,QAAQ;AAAA,IAEpB,SAAS,gBAAgB,CAAC,QAAQ,QAAQ,QAAQ;AAAA,MAChD,IAAI,QAAQ,CAAC;AAAA,MACb,SAAS,IAAI,EAAG,IAAI,QAAQ,KAAK;AAAA,QAC/B,MAAM,KAAK,OAAO,SAAS,EAAE;AAAA,MAC/B;AAAA,MACA,OAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA;AAAA,IAGF,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,MACzE,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,MACzD,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,MACzD,QAAQ,UAAU;AAAA,MAClB,QAAQ,UAAU;AAAA,MAElB,IAAI,mBAAmB,iBAAiB;AAAA,QACtC,OAAO,KAAK;AAAA,UACV,SAAS,iBAAiB,SAAS,UAAU,eAAe,GAAG,eAAe;AAAA,UAC9E,SAAS,iBAAiB,SAAS,UAAU,eAAe,GAAG,eAAe;AAAA,QAChF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,IAEA,OAAO,QAAQ;AAAA,IACf,OAAO;AAAA;AAAA,EAgBT,SAAS,iBAAiB,CAAC,GAAG,GAAG,GAAG;AAAA,IAIlC,IAAI,QAAQ,CAAC;AAAA,IACb,SAAS,OAAO,CAAC,GAAG,IAAI;AAAA,MACtB,MAAM,KAAK;AAAA,QACT;AAAA,QACA,QAAQ,EAAE,QAAQ;AAAA,QAClB,SAAS,EAAE,QAAQ;AAAA,QACnB,SAAS,EAAE,QAAQ;AAAA,QACnB,UAAU,EAAE,QAAQ;AAAA,MAEtB,CAAC;AAAA;AAAA,IAGH,YAAY,GAAG,CAAC,EAAE,QAAQ,UAAQ,QAAQ,MAAM,GAAG,CAAC;AAAA,IACpD,YAAY,GAAG,CAAC,EAAE,QAAQ,UAAQ,QAAQ,MAAM,GAAG,CAAC;AAAA,IACpD,MAAM,KAAK,CAAC,GAAE,MAAM,EAAE,SAAS,EAAE,MAAM;AAAA,IAEvC,IAAI,UAAU,CAAC;AAAA,IACf,IAAI,aAAa;AAAA,IAEjB,SAAS,SAAS,CAAC,WAAW;AAAA,MAC5B,IAAI,YAAY,YAAY;AAAA,QAC1B,QAAQ,KAAK;AAAA,UACX,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,aAAa;AAAA,UACb,cAAc,YAAY;AAAA,UAC1B,eAAe,EAAE,MAAM,YAAY,SAAS;AAAA,QAC9C,CAAC;AAAA,QACD,aAAa;AAAA,MACf;AAAA;AAAA,IAGF,OAAO,MAAM,QAAQ;AAAA,MACnB,IAAI,OAAO,MAAM,MAAM;AAAA,MACvB,IAAI,cAAc,KAAK;AAAA,MACvB,IAAI,YAAY,KAAK,SAAS,KAAK;AAAA,MACnC,IAAI,cAAc,CAAC,IAAI;AAAA,MACvB,UAAU,WAAW;AAAA,MAGrB,OAAO,MAAM,QAAQ;AAAA,QACnB,MAAM,WAAW,MAAM;AAAA,QACvB,MAAM,gBAAgB,SAAS;AAAA,QAC/B,IAAI,gBAAgB;AAAA,UAAW;AAAA,QAE/B,YAAY,KAAK,IAAI,WAAW,gBAAgB,SAAS,OAAO;AAAA,QAChE,YAAY,KAAK,MAAM,MAAM,CAAC;AAAA,MAChC;AAAA,MAEA,IAAI,YAAY,WAAW,GAAG;AAAA,QAG5B,IAAI,KAAK,WAAW,GAAG;AAAA,UACrB,MAAM,SAAU,KAAK,OAAO,MAAM,IAAI;AAAA,UACtC,QAAQ,KAAK;AAAA,YACX,QAAQ;AAAA,YACR,QAAQ,KAAK;AAAA,YACb,aAAa,KAAK;AAAA,YAClB,cAAc,KAAK;AAAA,YACnB,eAAe,OAAO,MAAM,KAAK,SAAS,KAAK,UAAU,KAAK,QAAQ;AAAA,UACxE,CAAC;AAAA,QACH;AAAA,MACF,EAAO;AAAA,QAKL,IAAI,SAAS;AAAA,UACX,GAAG,CAAC,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE;AAAA,UAC9B,GAAG,CAAC,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE;AAAA,QAChC;AAAA,QACA,OAAO,YAAY,QAAQ;AAAA,UACzB,OAAO,YAAY,MAAM;AAAA,UACzB,MAAM,SAAS,KAAK;AAAA,UACpB,MAAM,OAAO,SAAS,KAAK;AAAA,UAC3B,MAAM,UAAU,KAAK;AAAA,UACrB,MAAM,QAAQ,UAAU,KAAK;AAAA,UAC7B,IAAI,KAAI,OAAO,KAAK;AAAA,UACpB,GAAE,KAAK,KAAK,IAAI,SAAS,GAAE,EAAE;AAAA,UAC7B,GAAE,KAAK,KAAK,IAAI,OAAO,GAAE,EAAE;AAAA,UAC3B,GAAE,KAAK,KAAK,IAAI,QAAQ,GAAE,EAAE;AAAA,UAC5B,GAAE,KAAK,KAAK,IAAI,MAAM,GAAE,EAAE;AAAA,QAC5B;AAAA,QAEA,MAAM,SAAS,OAAO,EAAE,MAAM,cAAc,OAAO,EAAE;AAAA,QACrD,MAAM,OAAO,OAAO,EAAE,MAAM,YAAY,OAAO,EAAE;AAAA,QACjD,MAAM,SAAS,OAAO,EAAE,MAAM,cAAc,OAAO,EAAE;AAAA,QACrD,MAAM,OAAO,OAAO,EAAE,MAAM,YAAY,OAAO,EAAE;AAAA,QAEjD,IAAI,SAAS;AAAA,UACX,QAAQ;AAAA,UACR;AAAA,UACA,SAAS,OAAO;AAAA,UAChB,UAAU,EAAE,MAAM,QAAQ,IAAI;AAAA,UAC9B,QAAQ;AAAA,UACR,SAAS,YAAY;AAAA,UACrB,UAAU,EAAE,MAAM,aAAa,SAAS;AAAA,UACxC;AAAA,UACA,SAAS,OAAO;AAAA,UAChB,UAAU,EAAE,MAAM,QAAQ,IAAI;AAAA,QAChC;AAAA,QACA,QAAQ,KAAK,MAAM;AAAA;AAAA,MAErB,aAAa;AAAA,IACf;AAAA,IAEA,UAAU,EAAE,MAAM;AAAA,IAElB,OAAO;AAAA;AAAA,EAQT,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,IACpC,IAAI,WAAW;AAAA,MACb,uBAAuB;AAAA,MACvB,iBAAiB;AAAA,IACnB;AAAA,IACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,IAEzC,IAAI,OAAO,MAAM;AAAA,MAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,IAC9D,IAAI,OAAO,MAAM;AAAA,MAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,IAC9D,IAAI,OAAO,MAAM;AAAA,MAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,IAE9D,IAAI,UAAU,CAAC;AAAA,IACf,MAAM,UAAU,kBAAkB,GAAG,GAAG,CAAC;AAAA,IAEzC,IAAI,WAAW,CAAC;AAAA,IAChB,SAAS,OAAO,GAAG;AAAA,MACjB,IAAI,SAAS,QAAQ;AAAA,QACnB,QAAQ,KAAK,EAAE,IAAI,SAAS,CAAC;AAAA,MAC/B;AAAA,MACA,WAAW,CAAC;AAAA;AAAA,IAGd,SAAS,eAAe,CAAC,IAAG,IAAG;AAAA,MAC7B,IAAI,GAAE,WAAW,GAAE;AAAA,QAAQ,OAAO;AAAA,MAClC,SAAS,IAAI,EAAG,IAAI,GAAE,QAAQ,KAAK;AAAA,QACjC,IAAI,GAAE,OAAO,GAAE;AAAA,UAAI,OAAO;AAAA,MAC5B;AAAA,MACA,OAAO;AAAA;AAAA,IAGT,QAAQ,QAAQ,YAAW;AAAA,MACzB,IAAI,OAAO,QAAQ;AAAA,QACjB,SAAS,KAAK,GAAG,OAAO,aAAa;AAAA,MACvC,EAAO;AAAA,QACL,IAAI,QAAQ,yBAAyB,gBAAgB,OAAO,UAAU,OAAO,QAAQ,GAAG;AAAA,UACtF,SAAS,KAAK,GAAG,OAAO,QAAQ;AAAA,QAClC,EAAO;AAAA,UACL,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,YACX,UAAU;AAAA,cACR,GAAG,OAAO;AAAA,cACV,QAAQ,OAAO;AAAA,cACf,GAAG,OAAO;AAAA,cACV,QAAQ,OAAO;AAAA,cACf,GAAG,OAAO;AAAA,cACV,QAAQ,OAAO;AAAA,YACjB;AAAA,UACF,CAAC;AAAA;AAAA;AAAA,KAGN;AAAA,IAED,QAAQ;AAAA,IACR,OAAO;AAAA;AAAA,EAIT,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,IACpC,MAAM,WAAW;AAAA,MACf,uBAAuB;AAAA,MACvB,iBAAiB;AAAA,MACjB,OAAO,CAAC;AAAA,IACV;AAAA,IACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,IAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IACxE,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IACxE,MAAM,WAAW;AAAA,IACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,IAC3C,IAAI,WAAW;AAAA,IACf,IAAI,SAAS,CAAC;AAAA,IAEd,QAAQ,QAAQ,YAAU;AAAA,MACxB,IAAI,OAAO,IAAI;AAAA,QACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,MAClC,EAAO,SAAI,OAAO,UAAU;AAAA,QAC1B,WAAW;AAAA,QACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,CACX;AAAA,MACF;AAAA,KACD;AAAA,IAED,OAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA;AAAA,EAIF,SAAS,KAAK,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,IAC/B,MAAM,WAAW;AAAA,MACf,uBAAuB;AAAA,MACvB,iBAAiB;AAAA,MACjB,OAAO,CAAC;AAAA,IACV;AAAA,IACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,IAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IACxE,MAAM,WAAW;AAAA,IACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,IAC3C,IAAI,WAAW;AAAA,IACf,IAAI,SAAS,CAAC;AAAA,IAEd,QAAQ,QAAQ,YAAU;AAAA,MACxB,IAAI,OAAO,IAAI;AAAA,QACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,MAClC,EAAO,SAAI,OAAO,UAAU;AAAA,QAC1B,WAAW;AAAA,QACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,CACX;AAAA,MACF;AAAA,KACD;AAAA,IAED,OAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA;AAAA,EAIF,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,IACpC,MAAM,WAAW;AAAA,MACf,uBAAuB;AAAA,MACvB,iBAAiB;AAAA,MACjB,OAAO,CAAC;AAAA,IACV;AAAA,IACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,IAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IACxE,MAAM,WAAW;AAAA,IACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,IAC3C,IAAI,WAAW;AAAA,IACf,IAAI,SAAS,CAAC;AAAA,IAEd,QAAQ,QAAQ,YAAU;AAAA,MACxB,IAAI,OAAO,IAAI;AAAA,QACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,MAClC,EAAO;AAAA,QACL,MAAM,IAAI,SAAS,OAAO,SAAS,GAAG,OAAO,SAAS,CAAC;AAAA,QACvD,SAAS,IAAI,EAAG,IAAI,EAAE,QAAQ,KAAK;AAAA,UACjC,IAAI,QAAQ,EAAE;AAAA,UACd,IAAI,MAAM,QAAQ;AAAA,YAChB,SAAS,OAAO,OAAO,MAAM,MAAM;AAAA,UACrC,EAAO;AAAA,YACL,WAAW;AAAA,YACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,MAAM,SACN,CAAC,QAAQ,GACT,MAAM,SACN,CAAC,QAAQ,CACX;AAAA;AAAA,QAEJ;AAAA;AAAA,KAEH;AAAA,IAED,OAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA;AAAA,EAMF,SAAS,KAAK,CAAC,QAAQ,QAAO;AAAA,IAC5B,IAAI,SAAS,CAAC;AAAA,IACd,IAAI,aAAa;AAAA,IAEjB,SAAS,SAAS,CAAC,cAAc;AAAA,MAC/B,OAAO,aAAa,cAAc;AAAA,QAChC,OAAO,KAAK,OAAO,WAAW;AAAA,QAC9B;AAAA,MACF;AAAA;AAAA,IAGF,SAAS,aAAa,EAAG,aAAa,OAAM,QAAQ,cAAc;AAAA,MAChE,IAAI,QAAQ,OAAM;AAAA,MAClB,UAAU,MAAM,QAAQ,MAAM;AAAA,MAC9B,SAAS,YAAY,EAAG,YAAY,MAAM,QAAQ,MAAM,QAAQ,aAAa;AAAA,QAC3E,OAAO,KAAK,MAAM,QAAQ,MAAM,UAAU;AAAA,MAC5C;AAAA,MACA,cAAc,MAAM,QAAQ;AAAA,IAC9B;AAAA,IAEA,UAAU,OAAO,MAAM;AAAA,IACvB,OAAO;AAAA;AAAA,EAMT,SAAS,UAAU,CAAC,QAAO;AAAA,IACzB,OAAO,OAAM,IAAI,YAAU;AAAA,MACzB,SAAS,EAAE,QAAQ,MAAM,QAAQ,QAAQ,QAAQ,MAAM,QAAQ,OAAO;AAAA,MACtE,SAAS,EAAE,OAAO,MAAM,QAAQ,MAAM;AAAA,IACxC,EAAE;AAAA;AAAA,EAMJ,SAAS,WAAW,CAAC,QAAO;AAAA,IAC1B,OAAO,OAAM,IAAI,YAAU;AAAA,MACzB,SAAS,MAAM;AAAA,MACf,SAAS,MAAM;AAAA,IACjB,EAAE;AAAA;;;ECtiBJ,WAAW,QAAQ;",
-  "debugId": "5D96D19B25AE829964756E2164756E21",
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAuBA,SAAS,GAAG,CAAC,SAAS,SAAS;AAAA,IAI7B,IAAI,qBAAqB,OAAO,OAAO,IAAI;AAAA,IAC3C,SAAS,IAAI,EAAG,IAAI,QAAQ,QAAQ,KAAK;AAAA,MACvC,MAAM,OAAO,QAAQ;AAAA,MACrB,IAAI,mBAAmB,OAAO;AAAA,QAC5B,mBAAmB,MAAM,KAAK,CAAC;AAAA,MACjC,EAAO;AAAA,QACL,mBAAmB,QAAQ,CAAC,CAAC;AAAA;AAAA,IAEjC;AAAA,IAEA,MAAM,aAAa,EAAE,cAAc,IAAI,cAAc,IAAI,OAAO,KAAK;AAAA,IACrE,IAAI,aAAa,CAAC,UAAU;AAAA,IAE5B,SAAS,IAAI,EAAG,IAAI,QAAQ,QAAQ,KAAK;AAAA,MACvC,MAAM,OAAO,QAAQ;AAAA,MACrB,MAAM,iBAAiB,mBAAmB,SAAS,CAAC;AAAA,MACpD,IAAI,IAAI;AAAA,MACR,IAAI,IAAI,WAAW;AAAA,MAEnB,WAAW,KAAK,gBAAgB;AAAA,QAC9B,IAAI;AAAA,QACJ,KAAK,IAAI,EAAG,IAAI,WAAW,QAAQ,KAAK;AAAA,UACtC,IAAK,WAAW,GAAG,eAAe,MAAQ,MAAM,WAAW,SAAS,KAAO,WAAW,IAAI,GAAG,eAAe,IAAK;AAAA,YAC/G;AAAA,UACF;AAAA,QACF;AAAA,QAEA,IAAI,IAAI,WAAW,QAAQ;AAAA,UACzB,MAAM,eAAe,EAAE,cAAc,GAAG,cAAc,GAAG,OAAO,WAAW,GAAG;AAAA,UAC9E,IAAI,MAAM,WAAW,QAAQ;AAAA,YAC3B,WAAW,KAAK,CAAC;AAAA,UACnB,EAAO;AAAA,YACL,WAAW,KAAK;AAAA;AAAA,UAElB,IAAI,IAAI;AAAA,UACR,IAAI;AAAA,UACJ,IAAI,MAAM,WAAW,QAAQ;AAAA,YAC3B;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,MAEA,WAAW,KAAK;AAAA,IAClB;AAAA,IAKA,OAAO,WAAW,WAAW,SAAS;AAAA;AAAA,EAMxC,SAAS,QAAQ,CAAC,SAAS,SAAS;AAAA,IAClC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,IAChC,IAAI,SAAS,CAAC;AAAA,IACd,IAAI,QAAQ,QAAQ;AAAA,IACpB,IAAI,QAAQ,QAAQ;AAAA,IACpB,IAAI,SAAS,EAAC,QAAQ,CAAC,EAAC;AAAA,IAExB,SAAS,aAAa,GAAG;AAAA,MACvB,IAAI,OAAO,OAAO,QAAQ;AAAA,QACxB,OAAO,OAAO,QAAQ;AAAA,QACtB,OAAO,KAAK,MAAM;AAAA,QAClB,SAAS,EAAC,QAAQ,CAAC,EAAC;AAAA,MACtB;AAAA;AAAA,IAGF,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,MACzE,IAAI,YAAY,EAAC,SAAS,CAAC,GAAG,SAAS,CAAC,EAAC;AAAA,MAEzC,OAAO,EAAE,QAAQ,UAAU,cAAc;AAAA,QACvC,UAAU,QAAQ,KAAK,QAAQ,MAAM;AAAA,MACvC;AAAA,MAEA,OAAO,EAAE,QAAQ,UAAU,cAAc;AAAA,QACvC,UAAU,QAAQ,KAAK,QAAQ,MAAM;AAAA,MACvC;AAAA,MAEA,IAAI,UAAU,QAAQ,UAAU,UAAU,QAAQ,QAAQ;AAAA,QACxD,cAAc;AAAA,QACd,UAAU,QAAQ,QAAQ;AAAA,QAC1B,UAAU,QAAQ,QAAQ;AAAA,QAC1B,OAAO,KAAK,SAAS;AAAA,MACvB;AAAA,MAEA,IAAI,SAAS,GAAG;AAAA,QACd,OAAO,OAAO,KAAK,QAAQ,MAAM;AAAA,MACnC;AAAA,IACF;AAAA,IAEA,cAAc;AAAA,IAEd,OAAO,QAAQ;AAAA,IACf,OAAO;AAAA;AAAA,EAOT,SAAS,WAAW,CAAC,SAAS,SAAS;AAAA,IACrC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,IAChC,IAAI,SAAS,CAAC;AAAA,IACd,IAAI,QAAQ,QAAQ;AAAA,IACpB,IAAI,QAAQ,QAAQ;AAAA,IAEpB,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,MACzE,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,MACzD,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,MACzD,QAAQ,UAAU;AAAA,MAClB,QAAQ,UAAU;AAAA,MAElB,IAAI,mBAAmB,iBAAiB;AAAA,QACtC,OAAO,KAAK;AAAA,UACV,SAAS,CAAC,QAAQ,GAAG,eAAe;AAAA,UACpC,gBAAgB,QAAQ,MAAM,QAAQ,GAAG,QAAQ,IAAI,eAAe;AAAA,UACpE,SAAS,CAAC,QAAQ,GAAG,eAAe;AAAA,UACpC,gBAAgB,QAAQ,MAAM,QAAQ,GAAG,QAAQ,IAAI,eAAe;AAAA,QACtE,CAAC;AAAA,MACH;AAAA,IACF;AAAA,IAEA,OAAO,QAAQ;AAAA,IACf,OAAO;AAAA;AAAA,EAMT,SAAS,SAAS,CAAC,SAAS,SAAS;AAAA,IACnC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,IAChC,IAAI,SAAS,CAAC;AAAA,IACd,IAAI,QAAQ,QAAQ;AAAA,IACpB,IAAI,QAAQ,QAAQ;AAAA,IAEpB,SAAS,gBAAgB,CAAC,QAAQ,QAAQ,QAAQ;AAAA,MAChD,IAAI,QAAQ,CAAC;AAAA,MACb,SAAS,IAAI,EAAG,IAAI,QAAQ,KAAK;AAAA,QAC/B,MAAM,KAAK,OAAO,SAAS,EAAE;AAAA,MAC/B;AAAA,MACA,OAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA;AAAA,IAGF,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,MACzE,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,MACzD,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,MACzD,QAAQ,UAAU;AAAA,MAClB,QAAQ,UAAU;AAAA,MAElB,IAAI,mBAAmB,iBAAiB;AAAA,QACtC,OAAO,KAAK;AAAA,UACV,SAAS,iBAAiB,SAAS,UAAU,eAAe,GAAG,eAAe;AAAA,UAC9E,SAAS,iBAAiB,SAAS,UAAU,eAAe,GAAG,eAAe;AAAA,QAChF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,IAEA,OAAO,QAAQ;AAAA,IACf,OAAO;AAAA;AAAA,EAgBT,SAAS,iBAAiB,CAAC,GAAG,GAAG,GAAG;AAAA,IAIlC,IAAI,QAAQ,CAAC;AAAA,IACb,SAAS,OAAO,CAAC,GAAG,IAAI;AAAA,MACtB,MAAM,KAAK;AAAA,QACT;AAAA,QACA,QAAQ,EAAE,QAAQ;AAAA,QAClB,SAAS,EAAE,QAAQ;AAAA,QACnB,SAAS,EAAE,QAAQ;AAAA,QACnB,UAAU,EAAE,QAAQ;AAAA,MAEtB,CAAC;AAAA;AAAA,IAGH,YAAY,GAAG,CAAC,EAAE,QAAQ,UAAQ,QAAQ,MAAM,GAAG,CAAC;AAAA,IACpD,YAAY,GAAG,CAAC,EAAE,QAAQ,UAAQ,QAAQ,MAAM,GAAG,CAAC;AAAA,IACpD,MAAM,KAAK,CAAC,GAAE,MAAM,EAAE,SAAS,EAAE,MAAM;AAAA,IAEvC,IAAI,UAAU,CAAC;AAAA,IACf,IAAI,aAAa;AAAA,IAEjB,SAAS,SAAS,CAAC,WAAW;AAAA,MAC5B,IAAI,YAAY,YAAY;AAAA,QAC1B,QAAQ,KAAK;AAAA,UACX,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,aAAa;AAAA,UACb,cAAc,YAAY;AAAA,UAC1B,eAAe,EAAE,MAAM,YAAY,SAAS;AAAA,QAC9C,CAAC;AAAA,QACD,aAAa;AAAA,MACf;AAAA;AAAA,IAGF,OAAO,MAAM,QAAQ;AAAA,MACnB,IAAI,OAAO,MAAM,MAAM;AAAA,MACvB,IAAI,cAAc,KAAK;AAAA,MACvB,IAAI,YAAY,KAAK,SAAS,KAAK;AAAA,MACnC,IAAI,cAAc,CAAC,IAAI;AAAA,MACvB,UAAU,WAAW;AAAA,MAGrB,OAAO,MAAM,QAAQ;AAAA,QACnB,MAAM,WAAW,MAAM;AAAA,QACvB,MAAM,gBAAgB,SAAS;AAAA,QAC/B,IAAI,gBAAgB;AAAA,UAAW;AAAA,QAE/B,YAAY,KAAK,IAAI,WAAW,gBAAgB,SAAS,OAAO;AAAA,QAChE,YAAY,KAAK,MAAM,MAAM,CAAC;AAAA,MAChC;AAAA,MAEA,IAAI,YAAY,WAAW,GAAG;AAAA,QAG5B,IAAI,KAAK,WAAW,GAAG;AAAA,UACrB,MAAM,SAAU,KAAK,OAAO,MAAM,IAAI;AAAA,UACtC,QAAQ,KAAK;AAAA,YACX,QAAQ;AAAA,YACR,QAAQ,KAAK;AAAA,YACb,aAAa,KAAK;AAAA,YAClB,cAAc,KAAK;AAAA,YACnB,eAAe,OAAO,MAAM,KAAK,SAAS,KAAK,UAAU,KAAK,QAAQ;AAAA,UACxE,CAAC;AAAA,QACH;AAAA,MACF,EAAO;AAAA,QAKL,IAAI,SAAS;AAAA,UACX,GAAG,CAAC,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE;AAAA,UAC9B,GAAG,CAAC,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE;AAAA,QAChC;AAAA,QACA,OAAO,YAAY,QAAQ;AAAA,UACzB,OAAO,YAAY,MAAM;AAAA,UACzB,MAAM,SAAS,KAAK;AAAA,UACpB,MAAM,OAAO,SAAS,KAAK;AAAA,UAC3B,MAAM,UAAU,KAAK;AAAA,UACrB,MAAM,QAAQ,UAAU,KAAK;AAAA,UAC7B,IAAI,KAAI,OAAO,KAAK;AAAA,UACpB,GAAE,KAAK,KAAK,IAAI,SAAS,GAAE,EAAE;AAAA,UAC7B,GAAE,KAAK,KAAK,IAAI,OAAO,GAAE,EAAE;AAAA,UAC3B,GAAE,KAAK,KAAK,IAAI,QAAQ,GAAE,EAAE;AAAA,UAC5B,GAAE,KAAK,KAAK,IAAI,MAAM,GAAE,EAAE;AAAA,QAC5B;AAAA,QAEA,MAAM,SAAS,OAAO,EAAE,MAAM,cAAc,OAAO,EAAE;AAAA,QACrD,MAAM,OAAO,OAAO,EAAE,MAAM,YAAY,OAAO,EAAE;AAAA,QACjD,MAAM,SAAS,OAAO,EAAE,MAAM,cAAc,OAAO,EAAE;AAAA,QACrD,MAAM,OAAO,OAAO,EAAE,MAAM,YAAY,OAAO,EAAE;AAAA,QAEjD,IAAI,SAAS;AAAA,UACX,QAAQ;AAAA,UACR;AAAA,UACA,SAAS,OAAO;AAAA,UAChB,UAAU,EAAE,MAAM,QAAQ,IAAI;AAAA,UAC9B,QAAQ;AAAA,UACR,SAAS,YAAY;AAAA,UACrB,UAAU,EAAE,MAAM,aAAa,SAAS;AAAA,UACxC;AAAA,UACA,SAAS,OAAO;AAAA,UAChB,UAAU,EAAE,MAAM,QAAQ,IAAI;AAAA,QAChC;AAAA,QACA,QAAQ,KAAK,MAAM;AAAA;AAAA,MAErB,aAAa;AAAA,IACf;AAAA,IAEA,UAAU,EAAE,MAAM;AAAA,IAElB,OAAO;AAAA;AAAA,EAQT,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,IACpC,IAAI,WAAW;AAAA,MACb,uBAAuB;AAAA,MACvB,iBAAiB;AAAA,IACnB;AAAA,IACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,IAEzC,IAAI,OAAO,MAAM;AAAA,MAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,IAC9D,IAAI,OAAO,MAAM;AAAA,MAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,IAC9D,IAAI,OAAO,MAAM;AAAA,MAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,IAE9D,IAAI,UAAU,CAAC;AAAA,IACf,MAAM,UAAU,kBAAkB,GAAG,GAAG,CAAC;AAAA,IAEzC,IAAI,WAAW,CAAC;AAAA,IAChB,SAAS,OAAO,GAAG;AAAA,MACjB,IAAI,SAAS,QAAQ;AAAA,QACnB,QAAQ,KAAK,EAAE,IAAI,SAAS,CAAC;AAAA,MAC/B;AAAA,MACA,WAAW,CAAC;AAAA;AAAA,IAGd,SAAS,eAAe,CAAC,IAAG,IAAG;AAAA,MAC7B,IAAI,GAAE,WAAW,GAAE;AAAA,QAAQ,OAAO;AAAA,MAClC,SAAS,IAAI,EAAG,IAAI,GAAE,QAAQ,KAAK;AAAA,QACjC,IAAI,GAAE,OAAO,GAAE;AAAA,UAAI,OAAO;AAAA,MAC5B;AAAA,MACA,OAAO;AAAA;AAAA,IAGT,QAAQ,QAAQ,YAAW;AAAA,MACzB,IAAI,OAAO,QAAQ;AAAA,QACjB,SAAS,KAAK,GAAG,OAAO,aAAa;AAAA,MACvC,EAAO;AAAA,QACL,IAAI,QAAQ,yBAAyB,gBAAgB,OAAO,UAAU,OAAO,QAAQ,GAAG;AAAA,UACtF,SAAS,KAAK,GAAG,OAAO,QAAQ;AAAA,QAClC,EAAO;AAAA,UACL,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,YACX,UAAU;AAAA,cACR,GAAG,OAAO;AAAA,cACV,QAAQ,OAAO;AAAA,cACf,GAAG,OAAO;AAAA,cACV,QAAQ,OAAO;AAAA,cACf,GAAG,OAAO;AAAA,cACV,QAAQ,OAAO;AAAA,YACjB;AAAA,UACF,CAAC;AAAA;AAAA;AAAA,KAGN;AAAA,IAED,QAAQ;AAAA,IACR,OAAO;AAAA;AAAA,EAIT,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,IACpC,MAAM,WAAW;AAAA,MACf,uBAAuB;AAAA,MACvB,iBAAiB;AAAA,MACjB,OAAO,CAAC;AAAA,IACV;AAAA,IACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,IAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IACxE,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IACxE,MAAM,WAAW;AAAA,IACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,IAC3C,IAAI,WAAW;AAAA,IACf,IAAI,SAAS,CAAC;AAAA,IAEd,QAAQ,QAAQ,YAAU;AAAA,MACxB,IAAI,OAAO,IAAI;AAAA,QACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,MAClC,EAAO,SAAI,OAAO,UAAU;AAAA,QAC1B,WAAW;AAAA,QACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,CACX;AAAA,MACF;AAAA,KACD;AAAA,IAED,OAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA;AAAA,EAIF,SAAS,KAAK,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,IAC/B,MAAM,WAAW;AAAA,MACf,uBAAuB;AAAA,MACvB,iBAAiB;AAAA,MACjB,OAAO,CAAC;AAAA,IACV;AAAA,IACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,IAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IACxE,MAAM,WAAW;AAAA,IACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,IAC3C,IAAI,WAAW;AAAA,IACf,IAAI,SAAS,CAAC;AAAA,IAEd,QAAQ,QAAQ,YAAU;AAAA,MACxB,IAAI,OAAO,IAAI;AAAA,QACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,MAClC,EAAO,SAAI,OAAO,UAAU;AAAA,QAC1B,WAAW;AAAA,QACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,CACX;AAAA,MACF;AAAA,KACD;AAAA,IAED,OAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA;AAAA,EAIF,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,IACpC,MAAM,WAAW;AAAA,MACf,uBAAuB;AAAA,MACvB,iBAAiB;AAAA,MACjB,OAAO,CAAC;AAAA,IACV;AAAA,IACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,IAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IACxE,MAAM,WAAW;AAAA,IACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,IAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,IAC3C,IAAI,WAAW;AAAA,IACf,IAAI,SAAS,CAAC;AAAA,IAEd,QAAQ,QAAQ,YAAU;AAAA,MACxB,IAAI,OAAO,IAAI;AAAA,QACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,MAClC,EAAO;AAAA,QACL,MAAM,IAAI,SAAS,OAAO,SAAS,GAAG,OAAO,SAAS,CAAC;AAAA,QACvD,WAAW,SAAS,GAAG;AAAA,UACrB,IAAI,MAAM,QAAQ;AAAA,YAChB,SAAS,OAAO,OAAO,MAAM,MAAM;AAAA,UACrC,EAAO;AAAA,YACL,WAAW;AAAA,YACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,MAAM,SACN,CAAC,QAAQ,GACT,MAAM,SACN,CAAC,QAAQ,CACX;AAAA;AAAA,QAEJ;AAAA;AAAA,KAEH;AAAA,IAED,OAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA;AAAA,EAMF,SAAS,KAAK,CAAC,QAAQ,QAAO;AAAA,IAC5B,IAAI,SAAS,CAAC;AAAA,IACd,IAAI,aAAa;AAAA,IAEjB,SAAS,SAAS,CAAC,cAAc;AAAA,MAC/B,OAAO,aAAa,cAAc;AAAA,QAChC,OAAO,KAAK,OAAO,WAAW;AAAA,QAC9B;AAAA,MACF;AAAA;AAAA,IAGF,WAAW,SAAS,QAAO;AAAA,MACzB,UAAU,MAAM,QAAQ,MAAM;AAAA,MAC9B,WAAW,QAAQ,MAAM,QAAQ,OAAO;AAAA,QACtC,OAAO,KAAK,IAAI;AAAA,MAClB;AAAA,MACA,cAAc,MAAM,QAAQ;AAAA,IAC9B;AAAA,IAEA,UAAU,OAAO,MAAM;AAAA,IACvB,OAAO;AAAA;AAAA,EAMT,SAAS,UAAU,CAAC,QAAO;AAAA,IACzB,OAAO,OAAM,IAAI,YAAU;AAAA,MACzB,SAAS,EAAE,QAAQ,MAAM,QAAQ,QAAQ,QAAQ,MAAM,QAAQ,OAAO;AAAA,MACtE,SAAS,EAAE,OAAO,MAAM,QAAQ,MAAM;AAAA,IACxC,EAAE;AAAA;AAAA,EAMJ,SAAS,WAAW,CAAC,QAAO;AAAA,IAC1B,OAAO,OAAM,IAAI,YAAU;AAAA,MACzB,SAAS,MAAM;AAAA,MACf,SAAS,MAAM;AAAA,IACjB,EAAE;AAAA;;;ECriBJ,WAAW,QAAQ;",
+  "debugId": "C89158E5AADAC8F364756E2164756E21",
   "names": []
 }

dist/diff3.mjs

 // src/diff3.mjs
 function LCS(buffer1, buffer2) {
-  let equivalenceClasses = {};
+  let equivalenceClasses = Object.create(null);
   for (let j = 0;j < buffer2.length; j++) {
@@ -19,4 +19,3 @@ const item = buffer2[j];
     let c = candidates[0];
-    for (let jx = 0;jx < buffer2indices.length; jx++) {
-      const j = buffer2indices[jx];
+    for (const j of buffer2indices) {
       let s;
@@ -352,4 +351,3 @@ for (s = r;s < candidates.length; s++) {
       const c = diffComm(region.conflict.a, region.conflict.b);
-      for (let j = 0;j < c.length; j++) {
-        let inner = c[j];
+      for (const inner of c) {
         if (inner.common) {
@@ -378,7 +376,6 @@ result = result.concat(inner.common);
   }
-  for (let chunkIndex = 0;chunkIndex < patch2.length; chunkIndex++) {
-    let chunk = patch2[chunkIndex];
+  for (const chunk of patch2) {
     advanceTo(chunk.buffer1.offset);
-    for (let itemIndex = 0;itemIndex < chunk.buffer2.chunk.length; itemIndex++) {
-      result.push(chunk.buffer2.chunk[itemIndex]);
+    for (const item of chunk.buffer2.chunk) {
+      result.push(item);
     }
@@ -417,3 +414,3 @@ currOffset += chunk.buffer1.length;
 
-//# debugId=1E2500EFBA7ACEE264756E2164756E21
+//# debugId=78A7F40B895BC9BF64756E2164756E21
 //# sourceMappingURL=diff3.mjs.map

dist/diff3.mjs.map

@@ -5,7 +5,7 @@ {
   "sourcesContent": [
-    "export {\n  LCS,\n  diffComm,\n  diffIndices,\n  diffPatch,\n  diff3MergeRegions,\n  diff3Merge,\n  mergeDiff3,\n  merge,\n  mergeDigIn,\n  patch,\n  stripPatch,\n  invertPatch\n};\n\n\n// Text diff algorithm following Hunt and McIlroy 1976.\n// J. W. Hunt and M. D. McIlroy, An algorithm for differential buffer\n// comparison, Bell Telephone Laboratories CSTR #41 (1976)\n// http://www.cs.dartmouth.edu/~doug/\n// https://en.wikipedia.org/wiki/Longest_common_subsequence_problem\n//\n// Expects two arrays, finds longest common sequence\nfunction LCS(buffer1, buffer2) {\n  let equivalenceClasses = {};\n  for (let j = 0; j < buffer2.length; j++) {\n    const item = buffer2[j];\n    if (equivalenceClasses[item]) {\n      equivalenceClasses[item].push(j);\n    } else {\n      equivalenceClasses[item] = [j];\n    }\n  }\n\n  const NULLRESULT = { buffer1index: -1, buffer2index: -1, chain: null };\n  let candidates = [NULLRESULT];\n\n  for (let i = 0; i < buffer1.length; i++) {\n    const item = buffer1[i];\n    const buffer2indices = equivalenceClasses[item] || [];\n    let r = 0;\n    let c = candidates[0];\n\n    for (let jx = 0; jx < buffer2indices.length; jx++) {\n      const j = buffer2indices[jx];\n\n      let s;\n      for (s = r; s < candidates.length; s++) {\n        if ((candidates[s].buffer2index < j) && ((s === candidates.length - 1) || (candidates[s + 1].buffer2index > j))) {\n          break;\n        }\n      }\n\n      if (s < candidates.length) {\n        const newCandidate = { buffer1index: i, buffer2index: j, chain: candidates[s] };\n        if (r === candidates.length) {\n          candidates.push(c);\n        } else {\n          candidates[r] = c;\n        }\n        r = s + 1;\n        c = newCandidate;\n        if (r === candidates.length) {\n          break; // no point in examining further (j)s\n        }\n      }\n    }\n\n    candidates[r] = c;\n  }\n\n  // At this point, we know the LCS: it's in the reverse of the\n  // linked-list through .chain of candidates[candidates.length - 1].\n\n  return candidates[candidates.length - 1];\n}\n\n\n// We apply the LCS to build a 'comm'-style picture of the\n// differences between buffer1 and buffer2.\nfunction diffComm(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n  let common = {common: []};\n\n  function processCommon() {\n    if (common.common.length) {\n      common.common.reverse();\n      result.push(common);\n      common = {common: []};\n    }\n  }\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    let different = {buffer1: [], buffer2: []};\n\n    while (--tail1 > candidate.buffer1index) {\n      different.buffer1.push(buffer1[tail1]);\n    }\n\n    while (--tail2 > candidate.buffer2index) {\n      different.buffer2.push(buffer2[tail2]);\n    }\n\n    if (different.buffer1.length || different.buffer2.length) {\n      processCommon();\n      different.buffer1.reverse();\n      different.buffer2.reverse();\n      result.push(different);\n    }\n\n    if (tail1 >= 0) {\n      common.common.push(buffer1[tail1]);\n    }\n  }\n\n  processCommon();\n\n  result.reverse();\n  return result;\n}\n\n\n// We apply the LCS to give a simple representation of the\n// offsets and lengths of mismatched chunks in the input\n// buffers. This is used by diff3MergeRegions.\nfunction diffIndices(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    const mismatchLength1 = tail1 - candidate.buffer1index - 1;\n    const mismatchLength2 = tail2 - candidate.buffer2index - 1;\n    tail1 = candidate.buffer1index;\n    tail2 = candidate.buffer2index;\n\n    if (mismatchLength1 || mismatchLength2) {\n      result.push({\n        buffer1: [tail1 + 1, mismatchLength1],\n        buffer1Content: buffer1.slice(tail1 + 1, tail1 + 1 + mismatchLength1),\n        buffer2: [tail2 + 1, mismatchLength2],\n        buffer2Content: buffer2.slice(tail2 + 1, tail2 + 1 + mismatchLength2)\n      });\n    }\n  }\n\n  result.reverse();\n  return result;\n}\n\n\n// We apply the LCS to build a JSON representation of a\n// diff(1)-style patch.\nfunction diffPatch(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n\n  function chunkDescription(buffer, offset, length) {\n    let chunk = [];\n    for (let i = 0; i < length; i++) {\n      chunk.push(buffer[offset + i]);\n    }\n    return {\n      offset: offset,\n      length: length,\n      chunk: chunk\n    };\n  }\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    const mismatchLength1 = tail1 - candidate.buffer1index - 1;\n    const mismatchLength2 = tail2 - candidate.buffer2index - 1;\n    tail1 = candidate.buffer1index;\n    tail2 = candidate.buffer2index;\n\n    if (mismatchLength1 || mismatchLength2) {\n      result.push({\n        buffer1: chunkDescription(buffer1, candidate.buffer1index + 1, mismatchLength1),\n        buffer2: chunkDescription(buffer2, candidate.buffer2index + 1, mismatchLength2)\n      });\n    }\n  }\n\n  result.reverse();\n  return result;\n}\n\n\n// Given three buffers, A, O, and B, where both A and B are\n// independently derived from O, returns a fairly complicated\n// internal representation of merge decisions it's taken. The\n// interested reader may wish to consult\n//\n// Sanjeev Khanna, Keshav Kunal, and Benjamin C. Pierce.\n// 'A Formal Investigation of ' In Arvind and Prasad,\n// editors, Foundations of Software Technology and Theoretical\n// Computer Science (FSTTCS), December 2007.\n//\n// (http://www.cis.upenn.edu/~bcpierce/papers/diff3-short.pdf)\n//\nfunction diff3MergeRegions(a, o, b) {\n\n  // \"hunks\" are array subsets where `a` or `b` are different from `o`\n  // https://www.gnu.org/software/diffutils/manual/html_node/diff3-Hunks.html\n  let hunks = [];\n  function addHunk(h, ab) {\n    hunks.push({\n      ab: ab,\n      oStart: h.buffer1[0],\n      oLength: h.buffer1[1],   // length of o to remove\n      abStart: h.buffer2[0],\n      abLength: h.buffer2[1]   // length of a/b to insert\n      // abContent: (ab === 'a' ? a : b).slice(h.buffer2[0], h.buffer2[0] + h.buffer2[1])\n    });\n  }\n\n  diffIndices(o, a).forEach(item => addHunk(item, 'a'));\n  diffIndices(o, b).forEach(item => addHunk(item, 'b'));\n  hunks.sort((x,y) => x.oStart - y.oStart);\n\n  let results = [];\n  let currOffset = 0;\n\n  function advanceTo(endOffset) {\n    if (endOffset > currOffset) {\n      results.push({\n        stable: true,\n        buffer: 'o',\n        bufferStart: currOffset,\n        bufferLength: endOffset - currOffset,\n        bufferContent: o.slice(currOffset, endOffset)\n      });\n      currOffset = endOffset;\n    }\n  }\n\n  while (hunks.length) {\n    let hunk = hunks.shift();\n    let regionStart = hunk.oStart;\n    let regionEnd = hunk.oStart + hunk.oLength;\n    let regionHunks = [hunk];\n    advanceTo(regionStart);\n\n    // Try to pull next overlapping hunk into this region\n    while (hunks.length) {\n      const nextHunk = hunks[0];\n      const nextHunkStart = nextHunk.oStart;\n      if (nextHunkStart > regionEnd) break;   // no overlap\n\n      regionEnd = Math.max(regionEnd, nextHunkStart + nextHunk.oLength);\n      regionHunks.push(hunks.shift());\n    }\n\n    if (regionHunks.length === 1) {\n      // Only one hunk touches this region, meaning that there is no conflict here.\n      // Either `a` or `b` is inserting into a region of `o` unchanged by the other.\n      if (hunk.abLength > 0) {\n        const buffer = (hunk.ab === 'a' ? a : b);\n        results.push({\n          stable: true,\n          buffer: hunk.ab,\n          bufferStart: hunk.abStart,\n          bufferLength: hunk.abLength,\n          bufferContent: buffer.slice(hunk.abStart, hunk.abStart + hunk.abLength)\n        });\n      }\n    } else {\n      // A true a/b conflict. Determine the bounds involved from `a`, `o`, and `b`.\n      // Effectively merge all the `a` hunks into one giant hunk, then do the\n      // same for the `b` hunks; then, correct for skew in the regions of `o`\n      // that each side changed, and report appropriate spans for the three sides.\n      let bounds = {\n        a: [a.length, -1, o.length, -1],\n        b: [b.length, -1, o.length, -1]\n      };\n      while (regionHunks.length) {\n        hunk = regionHunks.shift();\n        const oStart = hunk.oStart;\n        const oEnd = oStart + hunk.oLength;\n        const abStart = hunk.abStart;\n        const abEnd = abStart + hunk.abLength;\n        let b = bounds[hunk.ab];\n        b[0] = Math.min(abStart, b[0]);\n        b[1] = Math.max(abEnd, b[1]);\n        b[2] = Math.min(oStart, b[2]);\n        b[3] = Math.max(oEnd, b[3]);\n      }\n\n      const aStart = bounds.a[0] + (regionStart - bounds.a[2]);\n      const aEnd = bounds.a[1] + (regionEnd - bounds.a[3]);\n      const bStart = bounds.b[0] + (regionStart - bounds.b[2]);\n      const bEnd = bounds.b[1] + (regionEnd - bounds.b[3]);\n\n      let result = {\n        stable: false,\n        aStart: aStart,\n        aLength: aEnd - aStart,\n        aContent: a.slice(aStart, aEnd),\n        oStart: regionStart,\n        oLength: regionEnd - regionStart,\n        oContent: o.slice(regionStart, regionEnd),\n        bStart: bStart,\n        bLength: bEnd - bStart,\n        bContent: b.slice(bStart, bEnd)\n      };\n      results.push(result);\n    }\n    currOffset = regionEnd;\n  }\n\n  advanceTo(o.length);\n\n  return results;\n}\n\n\n// Applies the output of diff3MergeRegions to actually\n// construct the merged buffer; the returned result alternates\n// between 'ok' and 'conflict' blocks.\n// A \"false conflict\" is where `a` and `b` both change the same from `o`\nfunction diff3Merge(a, o, b, options) {\n  let defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/\n  };\n  options = Object.assign(defaults, options);\n\n  if (typeof a === 'string') a = a.split(options.stringSeparator);\n  if (typeof o === 'string') o = o.split(options.stringSeparator);\n  if (typeof b === 'string') b = b.split(options.stringSeparator);\n\n  let results = [];\n  const regions = diff3MergeRegions(a, o, b);\n\n  let okBuffer = [];\n  function flushOk() {\n    if (okBuffer.length) {\n      results.push({ ok: okBuffer });\n    }\n    okBuffer = [];\n  }\n\n  function isFalseConflict(a, b) {\n    if (a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) {\n      if (a[i] !== b[i]) return false;\n    }\n    return true;\n  }\n\n  regions.forEach(region =>  {\n    if (region.stable) {\n      okBuffer.push(...region.bufferContent);\n    } else {\n      if (options.excludeFalseConflicts && isFalseConflict(region.aContent, region.bContent)) {\n        okBuffer.push(...region.aContent);\n      } else {\n        flushOk();\n        results.push({\n          conflict: {\n            a: region.aContent,\n            aIndex: region.aStart,\n            o: region.oContent,\n            oIndex: region.oStart,\n            b: region.bContent,\n            bIndex: region.bStart\n          }\n        });\n      }\n    }\n  });\n\n  flushOk();\n  return results;\n}\n\n\nfunction mergeDiff3(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const oSection = '|||||||' + (options.label.o ? ` ${options.label.o}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else if (region.conflict) {\n      conflict = true;\n      result = result.concat(\n        [aSection],\n        region.conflict.a,\n        [oSection],\n        region.conflict.o,\n        [xSection],\n        region.conflict.b,\n        [bSection]\n      );\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\nfunction merge(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else if (region.conflict) {\n      conflict = true;\n      result = result.concat(\n        [aSection],\n        region.conflict.a,\n        [xSection],\n        region.conflict.b,\n        [bSection]\n      );\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\nfunction mergeDigIn(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else {\n      const c = diffComm(region.conflict.a, region.conflict.b);\n      for (let j = 0; j < c.length; j++) {\n        let inner = c[j];\n        if (inner.common) {\n          result = result.concat(inner.common);\n        } else {\n          conflict = true;\n          result = result.concat(\n            [aSection],\n            inner.buffer1,\n            [xSection],\n            inner.buffer2,\n            [bSection]\n          );\n        }\n      }\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\n// Applies a patch to a buffer.\n// Given buffer1 and buffer2, `patch(buffer1, diffPatch(buffer1, buffer2))` should give buffer2.\nfunction patch(buffer, patch) {\n  let result = [];\n  let currOffset = 0;\n\n  function advanceTo(targetOffset) {\n    while (currOffset < targetOffset) {\n      result.push(buffer[currOffset]);\n      currOffset++;\n    }\n  }\n\n  for (let chunkIndex = 0; chunkIndex < patch.length; chunkIndex++) {\n    let chunk = patch[chunkIndex];\n    advanceTo(chunk.buffer1.offset);\n    for (let itemIndex = 0; itemIndex < chunk.buffer2.chunk.length; itemIndex++) {\n      result.push(chunk.buffer2.chunk[itemIndex]);\n    }\n    currOffset += chunk.buffer1.length;\n  }\n\n  advanceTo(buffer.length);\n  return result;\n}\n\n\n// Takes the output of diffPatch(), and removes extra information from it.\n// It can still be used by patch(), below, but can no longer be inverted.\nfunction stripPatch(patch) {\n  return patch.map(chunk => ({\n    buffer1: { offset: chunk.buffer1.offset, length: chunk.buffer1.length },\n    buffer2: { chunk: chunk.buffer2.chunk }\n  }));\n}\n\n\n// Takes the output of diffPatch(), and inverts the sense of it, so that it\n// can be applied to buffer2 to give buffer1 rather than the other way around.\nfunction invertPatch(patch) {\n  return patch.map(chunk => ({\n    buffer1: chunk.buffer2,\n    buffer2: chunk.buffer1\n  }));\n}\n"
+    "export {\n  LCS,\n  diffComm,\n  diffIndices,\n  diffPatch,\n  diff3MergeRegions,\n  diff3Merge,\n  mergeDiff3,\n  merge,\n  mergeDigIn,\n  patch,\n  stripPatch,\n  invertPatch\n};\n\n\n// Text diff algorithm following Hunt and McIlroy 1976.\n// J. W. Hunt and M. D. McIlroy, An algorithm for differential buffer\n// comparison, Bell Telephone Laboratories CSTR #41 (1976)\n// http://www.cs.dartmouth.edu/~doug/\n// https://en.wikipedia.org/wiki/Longest_common_subsequence_problem\n//\n// Expects two arrays, finds longest common sequence\nfunction LCS(buffer1, buffer2) {\n  // Use a prototype-less object so input elements that happen to match\n  // `Object.prototype` members (`constructor`, `__proto__`, `toString`, ...)\n  // don't shadow the lookup with inherited values.\n  let equivalenceClasses = Object.create(null);\n  for (let j = 0; j < buffer2.length; j++) {\n    const item = buffer2[j];\n    if (equivalenceClasses[item]) {\n      equivalenceClasses[item].push(j);\n    } else {\n      equivalenceClasses[item] = [j];\n    }\n  }\n\n  const NULLRESULT = { buffer1index: -1, buffer2index: -1, chain: null };\n  let candidates = [NULLRESULT];\n\n  for (let i = 0; i < buffer1.length; i++) {\n    const item = buffer1[i];\n    const buffer2indices = equivalenceClasses[item] || [];\n    let r = 0;\n    let c = candidates[0];\n\n    for (const j of buffer2indices) {\n      let s;\n      for (s = r; s < candidates.length; s++) {\n        if ((candidates[s].buffer2index < j) && ((s === candidates.length - 1) || (candidates[s + 1].buffer2index > j))) {\n          break;\n        }\n      }\n\n      if (s < candidates.length) {\n        const newCandidate = { buffer1index: i, buffer2index: j, chain: candidates[s] };\n        if (r === candidates.length) {\n          candidates.push(c);\n        } else {\n          candidates[r] = c;\n        }\n        r = s + 1;\n        c = newCandidate;\n        if (r === candidates.length) {\n          break; // no point in examining further (j)s\n        }\n      }\n    }\n\n    candidates[r] = c;\n  }\n\n  // At this point, we know the LCS: it's in the reverse of the\n  // linked-list through .chain of candidates[candidates.length - 1].\n\n  return candidates[candidates.length - 1];\n}\n\n\n// We apply the LCS to build a 'comm'-style picture of the\n// differences between buffer1 and buffer2.\nfunction diffComm(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n  let common = {common: []};\n\n  function processCommon() {\n    if (common.common.length) {\n      common.common.reverse();\n      result.push(common);\n      common = {common: []};\n    }\n  }\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    let different = {buffer1: [], buffer2: []};\n\n    while (--tail1 > candidate.buffer1index) {\n      different.buffer1.push(buffer1[tail1]);\n    }\n\n    while (--tail2 > candidate.buffer2index) {\n      different.buffer2.push(buffer2[tail2]);\n    }\n\n    if (different.buffer1.length || different.buffer2.length) {\n      processCommon();\n      different.buffer1.reverse();\n      different.buffer2.reverse();\n      result.push(different);\n    }\n\n    if (tail1 >= 0) {\n      common.common.push(buffer1[tail1]);\n    }\n  }\n\n  processCommon();\n\n  result.reverse();\n  return result;\n}\n\n\n// We apply the LCS to give a simple representation of the\n// offsets and lengths of mismatched chunks in the input\n// buffers. This is used by diff3MergeRegions.\nfunction diffIndices(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    const mismatchLength1 = tail1 - candidate.buffer1index - 1;\n    const mismatchLength2 = tail2 - candidate.buffer2index - 1;\n    tail1 = candidate.buffer1index;\n    tail2 = candidate.buffer2index;\n\n    if (mismatchLength1 || mismatchLength2) {\n      result.push({\n        buffer1: [tail1 + 1, mismatchLength1],\n        buffer1Content: buffer1.slice(tail1 + 1, tail1 + 1 + mismatchLength1),\n        buffer2: [tail2 + 1, mismatchLength2],\n        buffer2Content: buffer2.slice(tail2 + 1, tail2 + 1 + mismatchLength2)\n      });\n    }\n  }\n\n  result.reverse();\n  return result;\n}\n\n\n// We apply the LCS to build a JSON representation of a\n// diff(1)-style patch.\nfunction diffPatch(buffer1, buffer2) {\n  const lcs = LCS(buffer1, buffer2);\n  let result = [];\n  let tail1 = buffer1.length;\n  let tail2 = buffer2.length;\n\n  function chunkDescription(buffer, offset, length) {\n    let chunk = [];\n    for (let i = 0; i < length; i++) {\n      chunk.push(buffer[offset + i]);\n    }\n    return {\n      offset: offset,\n      length: length,\n      chunk: chunk\n    };\n  }\n\n  for (let candidate = lcs; candidate !== null; candidate = candidate.chain) {\n    const mismatchLength1 = tail1 - candidate.buffer1index - 1;\n    const mismatchLength2 = tail2 - candidate.buffer2index - 1;\n    tail1 = candidate.buffer1index;\n    tail2 = candidate.buffer2index;\n\n    if (mismatchLength1 || mismatchLength2) {\n      result.push({\n        buffer1: chunkDescription(buffer1, candidate.buffer1index + 1, mismatchLength1),\n        buffer2: chunkDescription(buffer2, candidate.buffer2index + 1, mismatchLength2)\n      });\n    }\n  }\n\n  result.reverse();\n  return result;\n}\n\n\n// Given three buffers, A, O, and B, where both A and B are\n// independently derived from O, returns a fairly complicated\n// internal representation of merge decisions it's taken. The\n// interested reader may wish to consult\n//\n// Sanjeev Khanna, Keshav Kunal, and Benjamin C. Pierce.\n// 'A Formal Investigation of ' In Arvind and Prasad,\n// editors, Foundations of Software Technology and Theoretical\n// Computer Science (FSTTCS), December 2007.\n//\n// (http://www.cis.upenn.edu/~bcpierce/papers/diff3-short.pdf)\n//\nfunction diff3MergeRegions(a, o, b) {\n\n  // \"hunks\" are array subsets where `a` or `b` are different from `o`\n  // https://www.gnu.org/software/diffutils/manual/html_node/diff3-Hunks.html\n  let hunks = [];\n  function addHunk(h, ab) {\n    hunks.push({\n      ab: ab,\n      oStart: h.buffer1[0],\n      oLength: h.buffer1[1],   // length of o to remove\n      abStart: h.buffer2[0],\n      abLength: h.buffer2[1]   // length of a/b to insert\n      // abContent: (ab === 'a' ? a : b).slice(h.buffer2[0], h.buffer2[0] + h.buffer2[1])\n    });\n  }\n\n  diffIndices(o, a).forEach(item => addHunk(item, 'a'));\n  diffIndices(o, b).forEach(item => addHunk(item, 'b'));\n  hunks.sort((x,y) => x.oStart - y.oStart);\n\n  let results = [];\n  let currOffset = 0;\n\n  function advanceTo(endOffset) {\n    if (endOffset > currOffset) {\n      results.push({\n        stable: true,\n        buffer: 'o',\n        bufferStart: currOffset,\n        bufferLength: endOffset - currOffset,\n        bufferContent: o.slice(currOffset, endOffset)\n      });\n      currOffset = endOffset;\n    }\n  }\n\n  while (hunks.length) {\n    let hunk = hunks.shift();\n    let regionStart = hunk.oStart;\n    let regionEnd = hunk.oStart + hunk.oLength;\n    let regionHunks = [hunk];\n    advanceTo(regionStart);\n\n    // Try to pull next overlapping hunk into this region\n    while (hunks.length) {\n      const nextHunk = hunks[0];\n      const nextHunkStart = nextHunk.oStart;\n      if (nextHunkStart > regionEnd) break;   // no overlap\n\n      regionEnd = Math.max(regionEnd, nextHunkStart + nextHunk.oLength);\n      regionHunks.push(hunks.shift());\n    }\n\n    if (regionHunks.length === 1) {\n      // Only one hunk touches this region, meaning that there is no conflict here.\n      // Either `a` or `b` is inserting into a region of `o` unchanged by the other.\n      if (hunk.abLength > 0) {\n        const buffer = (hunk.ab === 'a' ? a : b);\n        results.push({\n          stable: true,\n          buffer: hunk.ab,\n          bufferStart: hunk.abStart,\n          bufferLength: hunk.abLength,\n          bufferContent: buffer.slice(hunk.abStart, hunk.abStart + hunk.abLength)\n        });\n      }\n    } else {\n      // A true a/b conflict. Determine the bounds involved from `a`, `o`, and `b`.\n      // Effectively merge all the `a` hunks into one giant hunk, then do the\n      // same for the `b` hunks; then, correct for skew in the regions of `o`\n      // that each side changed, and report appropriate spans for the three sides.\n      let bounds = {\n        a: [a.length, -1, o.length, -1],\n        b: [b.length, -1, o.length, -1]\n      };\n      while (regionHunks.length) {\n        hunk = regionHunks.shift();\n        const oStart = hunk.oStart;\n        const oEnd = oStart + hunk.oLength;\n        const abStart = hunk.abStart;\n        const abEnd = abStart + hunk.abLength;\n        let b = bounds[hunk.ab];\n        b[0] = Math.min(abStart, b[0]);\n        b[1] = Math.max(abEnd, b[1]);\n        b[2] = Math.min(oStart, b[2]);\n        b[3] = Math.max(oEnd, b[3]);\n      }\n\n      const aStart = bounds.a[0] + (regionStart - bounds.a[2]);\n      const aEnd = bounds.a[1] + (regionEnd - bounds.a[3]);\n      const bStart = bounds.b[0] + (regionStart - bounds.b[2]);\n      const bEnd = bounds.b[1] + (regionEnd - bounds.b[3]);\n\n      let result = {\n        stable: false,\n        aStart: aStart,\n        aLength: aEnd - aStart,\n        aContent: a.slice(aStart, aEnd),\n        oStart: regionStart,\n        oLength: regionEnd - regionStart,\n        oContent: o.slice(regionStart, regionEnd),\n        bStart: bStart,\n        bLength: bEnd - bStart,\n        bContent: b.slice(bStart, bEnd)\n      };\n      results.push(result);\n    }\n    currOffset = regionEnd;\n  }\n\n  advanceTo(o.length);\n\n  return results;\n}\n\n\n// Applies the output of diff3MergeRegions to actually\n// construct the merged buffer; the returned result alternates\n// between 'ok' and 'conflict' blocks.\n// A \"false conflict\" is where `a` and `b` both change the same from `o`\nfunction diff3Merge(a, o, b, options) {\n  let defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/\n  };\n  options = Object.assign(defaults, options);\n\n  if (typeof a === 'string') a = a.split(options.stringSeparator);\n  if (typeof o === 'string') o = o.split(options.stringSeparator);\n  if (typeof b === 'string') b = b.split(options.stringSeparator);\n\n  let results = [];\n  const regions = diff3MergeRegions(a, o, b);\n\n  let okBuffer = [];\n  function flushOk() {\n    if (okBuffer.length) {\n      results.push({ ok: okBuffer });\n    }\n    okBuffer = [];\n  }\n\n  function isFalseConflict(a, b) {\n    if (a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) {\n      if (a[i] !== b[i]) return false;\n    }\n    return true;\n  }\n\n  regions.forEach(region =>  {\n    if (region.stable) {\n      okBuffer.push(...region.bufferContent);\n    } else {\n      if (options.excludeFalseConflicts && isFalseConflict(region.aContent, region.bContent)) {\n        okBuffer.push(...region.aContent);\n      } else {\n        flushOk();\n        results.push({\n          conflict: {\n            a: region.aContent,\n            aIndex: region.aStart,\n            o: region.oContent,\n            oIndex: region.oStart,\n            b: region.bContent,\n            bIndex: region.bStart\n          }\n        });\n      }\n    }\n  });\n\n  flushOk();\n  return results;\n}\n\n\nfunction mergeDiff3(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const oSection = '|||||||' + (options.label.o ? ` ${options.label.o}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else if (region.conflict) {\n      conflict = true;\n      result = result.concat(\n        [aSection],\n        region.conflict.a,\n        [oSection],\n        region.conflict.o,\n        [xSection],\n        region.conflict.b,\n        [bSection]\n      );\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\nfunction merge(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else if (region.conflict) {\n      conflict = true;\n      result = result.concat(\n        [aSection],\n        region.conflict.a,\n        [xSection],\n        region.conflict.b,\n        [bSection]\n      );\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\nfunction mergeDigIn(a, o, b, options) {\n  const defaults = {\n    excludeFalseConflicts: true,\n    stringSeparator: /\\s+/,\n    label: {}\n  };\n  options = Object.assign(defaults, options);\n\n  const aSection = '<<<<<<<' + (options.label.a ? ` ${options.label.a}` : '');\n  const xSection = '=======';\n  const bSection = '>>>>>>>' + (options.label.b ? ` ${options.label.b}` : '');\n\n  const regions = diff3Merge(a, o, b, options);\n  let conflict = false;\n  let result = [];\n\n  regions.forEach(region => {\n    if (region.ok) {\n      result = result.concat(region.ok);\n    } else {\n      const c = diffComm(region.conflict.a, region.conflict.b);\n      for (const inner of c) {\n        if (inner.common) {\n          result = result.concat(inner.common);\n        } else {\n          conflict = true;\n          result = result.concat(\n            [aSection],\n            inner.buffer1,\n            [xSection],\n            inner.buffer2,\n            [bSection]\n          );\n        }\n      }\n    }\n  });\n\n  return {\n    conflict: conflict,\n    result: result\n  };\n}\n\n\n// Applies a patch to a buffer.\n// Given buffer1 and buffer2, `patch(buffer1, diffPatch(buffer1, buffer2))` should give buffer2.\nfunction patch(buffer, patch) {\n  let result = [];\n  let currOffset = 0;\n\n  function advanceTo(targetOffset) {\n    while (currOffset < targetOffset) {\n      result.push(buffer[currOffset]);\n      currOffset++;\n    }\n  }\n\n  for (const chunk of patch) {\n    advanceTo(chunk.buffer1.offset);\n    for (const item of chunk.buffer2.chunk) {\n      result.push(item);\n    }\n    currOffset += chunk.buffer1.length;\n  }\n\n  advanceTo(buffer.length);\n  return result;\n}\n\n\n// Takes the output of diffPatch(), and removes extra information from it.\n// It can still be used by patch(), below, but can no longer be inverted.\nfunction stripPatch(patch) {\n  return patch.map(chunk => ({\n    buffer1: { offset: chunk.buffer1.offset, length: chunk.buffer1.length },\n    buffer2: { chunk: chunk.buffer2.chunk }\n  }));\n}\n\n\n// Takes the output of diffPatch(), and inverts the sense of it, so that it\n// can be applied to buffer2 to give buffer1 rather than the other way around.\nfunction invertPatch(patch) {\n  return patch.map(chunk => ({\n    buffer1: chunk.buffer2,\n    buffer2: chunk.buffer1\n  }));\n}\n"
   ],
-  "mappings": ";AAuBA,SAAS,GAAG,CAAC,SAAS,SAAS;AAAA,EAC7B,IAAI,qBAAqB,CAAC;AAAA,EAC1B,SAAS,IAAI,EAAG,IAAI,QAAQ,QAAQ,KAAK;AAAA,IACvC,MAAM,OAAO,QAAQ;AAAA,IACrB,IAAI,mBAAmB,OAAO;AAAA,MAC5B,mBAAmB,MAAM,KAAK,CAAC;AAAA,IACjC,EAAO;AAAA,MACL,mBAAmB,QAAQ,CAAC,CAAC;AAAA;AAAA,EAEjC;AAAA,EAEA,MAAM,aAAa,EAAE,cAAc,IAAI,cAAc,IAAI,OAAO,KAAK;AAAA,EACrE,IAAI,aAAa,CAAC,UAAU;AAAA,EAE5B,SAAS,IAAI,EAAG,IAAI,QAAQ,QAAQ,KAAK;AAAA,IACvC,MAAM,OAAO,QAAQ;AAAA,IACrB,MAAM,iBAAiB,mBAAmB,SAAS,CAAC;AAAA,IACpD,IAAI,IAAI;AAAA,IACR,IAAI,IAAI,WAAW;AAAA,IAEnB,SAAS,KAAK,EAAG,KAAK,eAAe,QAAQ,MAAM;AAAA,MACjD,MAAM,IAAI,eAAe;AAAA,MAEzB,IAAI;AAAA,MACJ,KAAK,IAAI,EAAG,IAAI,WAAW,QAAQ,KAAK;AAAA,QACtC,IAAK,WAAW,GAAG,eAAe,MAAQ,MAAM,WAAW,SAAS,KAAO,WAAW,IAAI,GAAG,eAAe,IAAK;AAAA,UAC/G;AAAA,QACF;AAAA,MACF;AAAA,MAEA,IAAI,IAAI,WAAW,QAAQ;AAAA,QACzB,MAAM,eAAe,EAAE,cAAc,GAAG,cAAc,GAAG,OAAO,WAAW,GAAG;AAAA,QAC9E,IAAI,MAAM,WAAW,QAAQ;AAAA,UAC3B,WAAW,KAAK,CAAC;AAAA,QACnB,EAAO;AAAA,UACL,WAAW,KAAK;AAAA;AAAA,QAElB,IAAI,IAAI;AAAA,QACR,IAAI;AAAA,QACJ,IAAI,MAAM,WAAW,QAAQ;AAAA,UAC3B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,IAEA,WAAW,KAAK;AAAA,EAClB;AAAA,EAKA,OAAO,WAAW,WAAW,SAAS;AAAA;AAMxC,SAAS,QAAQ,CAAC,SAAS,SAAS;AAAA,EAClC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,EAChC,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,SAAS,EAAC,QAAQ,CAAC,EAAC;AAAA,EAExB,SAAS,aAAa,GAAG;AAAA,IACvB,IAAI,OAAO,OAAO,QAAQ;AAAA,MACxB,OAAO,OAAO,QAAQ;AAAA,MACtB,OAAO,KAAK,MAAM;AAAA,MAClB,SAAS,EAAC,QAAQ,CAAC,EAAC;AAAA,IACtB;AAAA;AAAA,EAGF,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,IACzE,IAAI,YAAY,EAAC,SAAS,CAAC,GAAG,SAAS,CAAC,EAAC;AAAA,IAEzC,OAAO,EAAE,QAAQ,UAAU,cAAc;AAAA,MACvC,UAAU,QAAQ,KAAK,QAAQ,MAAM;AAAA,IACvC;AAAA,IAEA,OAAO,EAAE,QAAQ,UAAU,cAAc;AAAA,MACvC,UAAU,QAAQ,KAAK,QAAQ,MAAM;AAAA,IACvC;AAAA,IAEA,IAAI,UAAU,QAAQ,UAAU,UAAU,QAAQ,QAAQ;AAAA,MACxD,cAAc;AAAA,MACd,UAAU,QAAQ,QAAQ;AAAA,MAC1B,UAAU,QAAQ,QAAQ;AAAA,MAC1B,OAAO,KAAK,SAAS;AAAA,IACvB;AAAA,IAEA,IAAI,SAAS,GAAG;AAAA,MACd,OAAO,OAAO,KAAK,QAAQ,MAAM;AAAA,IACnC;AAAA,EACF;AAAA,EAEA,cAAc;AAAA,EAEd,OAAO,QAAQ;AAAA,EACf,OAAO;AAAA;AAOT,SAAS,WAAW,CAAC,SAAS,SAAS;AAAA,EACrC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,EAChC,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,QAAQ,QAAQ;AAAA,EAEpB,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,IACzE,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,QAAQ,UAAU;AAAA,IAClB,QAAQ,UAAU;AAAA,IAElB,IAAI,mBAAmB,iBAAiB;AAAA,MACtC,OAAO,KAAK;AAAA,QACV,SAAS,CAAC,QAAQ,GAAG,eAAe;AAAA,QACpC,gBAAgB,QAAQ,MAAM,QAAQ,GAAG,QAAQ,IAAI,eAAe;AAAA,QACpE,SAAS,CAAC,QAAQ,GAAG,eAAe;AAAA,QACpC,gBAAgB,QAAQ,MAAM,QAAQ,GAAG,QAAQ,IAAI,eAAe;AAAA,MACtE,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,OAAO,QAAQ;AAAA,EACf,OAAO;AAAA;AAMT,SAAS,SAAS,CAAC,SAAS,SAAS;AAAA,EACnC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,EAChC,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,QAAQ,QAAQ;AAAA,EAEpB,SAAS,gBAAgB,CAAC,QAAQ,QAAQ,QAAQ;AAAA,IAChD,IAAI,QAAQ,CAAC;AAAA,IACb,SAAS,IAAI,EAAG,IAAI,QAAQ,KAAK;AAAA,MAC/B,MAAM,KAAK,OAAO,SAAS,EAAE;AAAA,IAC/B;AAAA,IACA,OAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA;AAAA,EAGF,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,IACzE,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,QAAQ,UAAU;AAAA,IAClB,QAAQ,UAAU;AAAA,IAElB,IAAI,mBAAmB,iBAAiB;AAAA,MACtC,OAAO,KAAK;AAAA,QACV,SAAS,iBAAiB,SAAS,UAAU,eAAe,GAAG,eAAe;AAAA,QAC9E,SAAS,iBAAiB,SAAS,UAAU,eAAe,GAAG,eAAe;AAAA,MAChF,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,OAAO,QAAQ;AAAA,EACf,OAAO;AAAA;AAgBT,SAAS,iBAAiB,CAAC,GAAG,GAAG,GAAG;AAAA,EAIlC,IAAI,QAAQ,CAAC;AAAA,EACb,SAAS,OAAO,CAAC,GAAG,IAAI;AAAA,IACtB,MAAM,KAAK;AAAA,MACT;AAAA,MACA,QAAQ,EAAE,QAAQ;AAAA,MAClB,SAAS,EAAE,QAAQ;AAAA,MACnB,SAAS,EAAE,QAAQ;AAAA,MACnB,UAAU,EAAE,QAAQ;AAAA,IAEtB,CAAC;AAAA;AAAA,EAGH,YAAY,GAAG,CAAC,EAAE,QAAQ,UAAQ,QAAQ,MAAM,GAAG,CAAC;AAAA,EACpD,YAAY,GAAG,CAAC,EAAE,QAAQ,UAAQ,QAAQ,MAAM,GAAG,CAAC;AAAA,EACpD,MAAM,KAAK,CAAC,GAAE,MAAM,EAAE,SAAS,EAAE,MAAM;AAAA,EAEvC,IAAI,UAAU,CAAC;AAAA,EACf,IAAI,aAAa;AAAA,EAEjB,SAAS,SAAS,CAAC,WAAW;AAAA,IAC5B,IAAI,YAAY,YAAY;AAAA,MAC1B,QAAQ,KAAK;AAAA,QACX,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,aAAa;AAAA,QACb,cAAc,YAAY;AAAA,QAC1B,eAAe,EAAE,MAAM,YAAY,SAAS;AAAA,MAC9C,CAAC;AAAA,MACD,aAAa;AAAA,IACf;AAAA;AAAA,EAGF,OAAO,MAAM,QAAQ;AAAA,IACnB,IAAI,OAAO,MAAM,MAAM;AAAA,IACvB,IAAI,cAAc,KAAK;AAAA,IACvB,IAAI,YAAY,KAAK,SAAS,KAAK;AAAA,IACnC,IAAI,cAAc,CAAC,IAAI;AAAA,IACvB,UAAU,WAAW;AAAA,IAGrB,OAAO,MAAM,QAAQ;AAAA,MACnB,MAAM,WAAW,MAAM;AAAA,MACvB,MAAM,gBAAgB,SAAS;AAAA,MAC/B,IAAI,gBAAgB;AAAA,QAAW;AAAA,MAE/B,YAAY,KAAK,IAAI,WAAW,gBAAgB,SAAS,OAAO;AAAA,MAChE,YAAY,KAAK,MAAM,MAAM,CAAC;AAAA,IAChC;AAAA,IAEA,IAAI,YAAY,WAAW,GAAG;AAAA,MAG5B,IAAI,KAAK,WAAW,GAAG;AAAA,QACrB,MAAM,SAAU,KAAK,OAAO,MAAM,IAAI;AAAA,QACtC,QAAQ,KAAK;AAAA,UACX,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,aAAa,KAAK;AAAA,UAClB,cAAc,KAAK;AAAA,UACnB,eAAe,OAAO,MAAM,KAAK,SAAS,KAAK,UAAU,KAAK,QAAQ;AAAA,QACxE,CAAC;AAAA,MACH;AAAA,IACF,EAAO;AAAA,MAKL,IAAI,SAAS;AAAA,QACX,GAAG,CAAC,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE;AAAA,QAC9B,GAAG,CAAC,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE;AAAA,MAChC;AAAA,MACA,OAAO,YAAY,QAAQ;AAAA,QACzB,OAAO,YAAY,MAAM;AAAA,QACzB,MAAM,SAAS,KAAK;AAAA,QACpB,MAAM,OAAO,SAAS,KAAK;AAAA,QAC3B,MAAM,UAAU,KAAK;AAAA,QACrB,MAAM,QAAQ,UAAU,KAAK;AAAA,QAC7B,IAAI,KAAI,OAAO,KAAK;AAAA,QACpB,GAAE,KAAK,KAAK,IAAI,SAAS,GAAE,EAAE;AAAA,QAC7B,GAAE,KAAK,KAAK,IAAI,OAAO,GAAE,EAAE;AAAA,QAC3B,GAAE,KAAK,KAAK,IAAI,QAAQ,GAAE,EAAE;AAAA,QAC5B,GAAE,KAAK,KAAK,IAAI,MAAM,GAAE,EAAE;AAAA,MAC5B;AAAA,MAEA,MAAM,SAAS,OAAO,EAAE,MAAM,cAAc,OAAO,EAAE;AAAA,MACrD,MAAM,OAAO,OAAO,EAAE,MAAM,YAAY,OAAO,EAAE;AAAA,MACjD,MAAM,SAAS,OAAO,EAAE,MAAM,cAAc,OAAO,EAAE;AAAA,MACrD,MAAM,OAAO,OAAO,EAAE,MAAM,YAAY,OAAO,EAAE;AAAA,MAEjD,IAAI,SAAS;AAAA,QACX,QAAQ;AAAA,QACR;AAAA,QACA,SAAS,OAAO;AAAA,QAChB,UAAU,EAAE,MAAM,QAAQ,IAAI;AAAA,QAC9B,QAAQ;AAAA,QACR,SAAS,YAAY;AAAA,QACrB,UAAU,EAAE,MAAM,aAAa,SAAS;AAAA,QACxC;AAAA,QACA,SAAS,OAAO;AAAA,QAChB,UAAU,EAAE,MAAM,QAAQ,IAAI;AAAA,MAChC;AAAA,MACA,QAAQ,KAAK,MAAM;AAAA;AAAA,IAErB,aAAa;AAAA,EACf;AAAA,EAEA,UAAU,EAAE,MAAM;AAAA,EAElB,OAAO;AAAA;AAQT,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EACpC,IAAI,WAAW;AAAA,IACb,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,EACnB;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,IAAI,OAAO,MAAM;AAAA,IAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,EAC9D,IAAI,OAAO,MAAM;AAAA,IAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,EAC9D,IAAI,OAAO,MAAM;AAAA,IAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,EAE9D,IAAI,UAAU,CAAC;AAAA,EACf,MAAM,UAAU,kBAAkB,GAAG,GAAG,CAAC;AAAA,EAEzC,IAAI,WAAW,CAAC;AAAA,EAChB,SAAS,OAAO,GAAG;AAAA,IACjB,IAAI,SAAS,QAAQ;AAAA,MACnB,QAAQ,KAAK,EAAE,IAAI,SAAS,CAAC;AAAA,IAC/B;AAAA,IACA,WAAW,CAAC;AAAA;AAAA,EAGd,SAAS,eAAe,CAAC,IAAG,IAAG;AAAA,IAC7B,IAAI,GAAE,WAAW,GAAE;AAAA,MAAQ,OAAO;AAAA,IAClC,SAAS,IAAI,EAAG,IAAI,GAAE,QAAQ,KAAK;AAAA,MACjC,IAAI,GAAE,OAAO,GAAE;AAAA,QAAI,OAAO;AAAA,IAC5B;AAAA,IACA,OAAO;AAAA;AAAA,EAGT,QAAQ,QAAQ,YAAW;AAAA,IACzB,IAAI,OAAO,QAAQ;AAAA,MACjB,SAAS,KAAK,GAAG,OAAO,aAAa;AAAA,IACvC,EAAO;AAAA,MACL,IAAI,QAAQ,yBAAyB,gBAAgB,OAAO,UAAU,OAAO,QAAQ,GAAG;AAAA,QACtF,SAAS,KAAK,GAAG,OAAO,QAAQ;AAAA,MAClC,EAAO;AAAA,QACL,QAAQ;AAAA,QACR,QAAQ,KAAK;AAAA,UACX,UAAU;AAAA,YACR,GAAG,OAAO;AAAA,YACV,QAAQ,OAAO;AAAA,YACf,GAAG,OAAO;AAAA,YACV,QAAQ,OAAO;AAAA,YACf,GAAG,OAAO;AAAA,YACV,QAAQ,OAAO;AAAA,UACjB;AAAA,QACF,CAAC;AAAA;AAAA;AAAA,GAGN;AAAA,EAED,QAAQ;AAAA,EACR,OAAO;AAAA;AAIT,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EACpC,MAAM,WAAW;AAAA,IACf,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,IACjB,OAAO,CAAC;AAAA,EACV;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW;AAAA,EACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,EAC3C,IAAI,WAAW;AAAA,EACf,IAAI,SAAS,CAAC;AAAA,EAEd,QAAQ,QAAQ,YAAU;AAAA,IACxB,IAAI,OAAO,IAAI;AAAA,MACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,IAClC,EAAO,SAAI,OAAO,UAAU;AAAA,MAC1B,WAAW;AAAA,MACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,CACX;AAAA,IACF;AAAA,GACD;AAAA,EAED,OAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AAAA;AAIF,SAAS,KAAK,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EAC/B,MAAM,WAAW;AAAA,IACf,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,IACjB,OAAO,CAAC;AAAA,EACV;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW;AAAA,EACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,EAC3C,IAAI,WAAW;AAAA,EACf,IAAI,SAAS,CAAC;AAAA,EAEd,QAAQ,QAAQ,YAAU;AAAA,IACxB,IAAI,OAAO,IAAI;AAAA,MACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,IAClC,EAAO,SAAI,OAAO,UAAU;AAAA,MAC1B,WAAW;AAAA,MACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,CACX;AAAA,IACF;AAAA,GACD;AAAA,EAED,OAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AAAA;AAIF,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EACpC,MAAM,WAAW;AAAA,IACf,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,IACjB,OAAO,CAAC;AAAA,EACV;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW;AAAA,EACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,EAC3C,IAAI,WAAW;AAAA,EACf,IAAI,SAAS,CAAC;AAAA,EAEd,QAAQ,QAAQ,YAAU;AAAA,IACxB,IAAI,OAAO,IAAI;AAAA,MACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,IAClC,EAAO;AAAA,MACL,MAAM,IAAI,SAAS,OAAO,SAAS,GAAG,OAAO,SAAS,CAAC;AAAA,MACvD,SAAS,IAAI,EAAG,IAAI,EAAE,QAAQ,KAAK;AAAA,QACjC,IAAI,QAAQ,EAAE;AAAA,QACd,IAAI,MAAM,QAAQ;AAAA,UAChB,SAAS,OAAO,OAAO,MAAM,MAAM;AAAA,QACrC,EAAO;AAAA,UACL,WAAW;AAAA,UACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,MAAM,SACN,CAAC,QAAQ,GACT,MAAM,SACN,CAAC,QAAQ,CACX;AAAA;AAAA,MAEJ;AAAA;AAAA,GAEH;AAAA,EAED,OAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AAAA;AAMF,SAAS,KAAK,CAAC,QAAQ,QAAO;AAAA,EAC5B,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,aAAa;AAAA,EAEjB,SAAS,SAAS,CAAC,cAAc;AAAA,IAC/B,OAAO,aAAa,cAAc;AAAA,MAChC,OAAO,KAAK,OAAO,WAAW;AAAA,MAC9B;AAAA,IACF;AAAA;AAAA,EAGF,SAAS,aAAa,EAAG,aAAa,OAAM,QAAQ,cAAc;AAAA,IAChE,IAAI,QAAQ,OAAM;AAAA,IAClB,UAAU,MAAM,QAAQ,MAAM;AAAA,IAC9B,SAAS,YAAY,EAAG,YAAY,MAAM,QAAQ,MAAM,QAAQ,aAAa;AAAA,MAC3E,OAAO,KAAK,MAAM,QAAQ,MAAM,UAAU;AAAA,IAC5C;AAAA,IACA,cAAc,MAAM,QAAQ;AAAA,EAC9B;AAAA,EAEA,UAAU,OAAO,MAAM;AAAA,EACvB,OAAO;AAAA;AAMT,SAAS,UAAU,CAAC,QAAO;AAAA,EACzB,OAAO,OAAM,IAAI,YAAU;AAAA,IACzB,SAAS,EAAE,QAAQ,MAAM,QAAQ,QAAQ,QAAQ,MAAM,QAAQ,OAAO;AAAA,IACtE,SAAS,EAAE,OAAO,MAAM,QAAQ,MAAM;AAAA,EACxC,EAAE;AAAA;AAMJ,SAAS,WAAW,CAAC,QAAO;AAAA,EAC1B,OAAO,OAAM,IAAI,YAAU;AAAA,IACzB,SAAS,MAAM;AAAA,IACf,SAAS,MAAM;AAAA,EACjB,EAAE;AAAA;",
-  "debugId": "1E2500EFBA7ACEE264756E2164756E21",
+  "mappings": ";AAuBA,SAAS,GAAG,CAAC,SAAS,SAAS;AAAA,EAI7B,IAAI,qBAAqB,OAAO,OAAO,IAAI;AAAA,EAC3C,SAAS,IAAI,EAAG,IAAI,QAAQ,QAAQ,KAAK;AAAA,IACvC,MAAM,OAAO,QAAQ;AAAA,IACrB,IAAI,mBAAmB,OAAO;AAAA,MAC5B,mBAAmB,MAAM,KAAK,CAAC;AAAA,IACjC,EAAO;AAAA,MACL,mBAAmB,QAAQ,CAAC,CAAC;AAAA;AAAA,EAEjC;AAAA,EAEA,MAAM,aAAa,EAAE,cAAc,IAAI,cAAc,IAAI,OAAO,KAAK;AAAA,EACrE,IAAI,aAAa,CAAC,UAAU;AAAA,EAE5B,SAAS,IAAI,EAAG,IAAI,QAAQ,QAAQ,KAAK;AAAA,IACvC,MAAM,OAAO,QAAQ;AAAA,IACrB,MAAM,iBAAiB,mBAAmB,SAAS,CAAC;AAAA,IACpD,IAAI,IAAI;AAAA,IACR,IAAI,IAAI,WAAW;AAAA,IAEnB,WAAW,KAAK,gBAAgB;AAAA,MAC9B,IAAI;AAAA,MACJ,KAAK,IAAI,EAAG,IAAI,WAAW,QAAQ,KAAK;AAAA,QACtC,IAAK,WAAW,GAAG,eAAe,MAAQ,MAAM,WAAW,SAAS,KAAO,WAAW,IAAI,GAAG,eAAe,IAAK;AAAA,UAC/G;AAAA,QACF;AAAA,MACF;AAAA,MAEA,IAAI,IAAI,WAAW,QAAQ;AAAA,QACzB,MAAM,eAAe,EAAE,cAAc,GAAG,cAAc,GAAG,OAAO,WAAW,GAAG;AAAA,QAC9E,IAAI,MAAM,WAAW,QAAQ;AAAA,UAC3B,WAAW,KAAK,CAAC;AAAA,QACnB,EAAO;AAAA,UACL,WAAW,KAAK;AAAA;AAAA,QAElB,IAAI,IAAI;AAAA,QACR,IAAI;AAAA,QACJ,IAAI,MAAM,WAAW,QAAQ;AAAA,UAC3B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,IAEA,WAAW,KAAK;AAAA,EAClB;AAAA,EAKA,OAAO,WAAW,WAAW,SAAS;AAAA;AAMxC,SAAS,QAAQ,CAAC,SAAS,SAAS;AAAA,EAClC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,EAChC,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,SAAS,EAAC,QAAQ,CAAC,EAAC;AAAA,EAExB,SAAS,aAAa,GAAG;AAAA,IACvB,IAAI,OAAO,OAAO,QAAQ;AAAA,MACxB,OAAO,OAAO,QAAQ;AAAA,MACtB,OAAO,KAAK,MAAM;AAAA,MAClB,SAAS,EAAC,QAAQ,CAAC,EAAC;AAAA,IACtB;AAAA;AAAA,EAGF,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,IACzE,IAAI,YAAY,EAAC,SAAS,CAAC,GAAG,SAAS,CAAC,EAAC;AAAA,IAEzC,OAAO,EAAE,QAAQ,UAAU,cAAc;AAAA,MACvC,UAAU,QAAQ,KAAK,QAAQ,MAAM;AAAA,IACvC;AAAA,IAEA,OAAO,EAAE,QAAQ,UAAU,cAAc;AAAA,MACvC,UAAU,QAAQ,KAAK,QAAQ,MAAM;AAAA,IACvC;AAAA,IAEA,IAAI,UAAU,QAAQ,UAAU,UAAU,QAAQ,QAAQ;AAAA,MACxD,cAAc;AAAA,MACd,UAAU,QAAQ,QAAQ;AAAA,MAC1B,UAAU,QAAQ,QAAQ;AAAA,MAC1B,OAAO,KAAK,SAAS;AAAA,IACvB;AAAA,IAEA,IAAI,SAAS,GAAG;AAAA,MACd,OAAO,OAAO,KAAK,QAAQ,MAAM;AAAA,IACnC;AAAA,EACF;AAAA,EAEA,cAAc;AAAA,EAEd,OAAO,QAAQ;AAAA,EACf,OAAO;AAAA;AAOT,SAAS,WAAW,CAAC,SAAS,SAAS;AAAA,EACrC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,EAChC,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,QAAQ,QAAQ;AAAA,EAEpB,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,IACzE,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,QAAQ,UAAU;AAAA,IAClB,QAAQ,UAAU;AAAA,IAElB,IAAI,mBAAmB,iBAAiB;AAAA,MACtC,OAAO,KAAK;AAAA,QACV,SAAS,CAAC,QAAQ,GAAG,eAAe;AAAA,QACpC,gBAAgB,QAAQ,MAAM,QAAQ,GAAG,QAAQ,IAAI,eAAe;AAAA,QACpE,SAAS,CAAC,QAAQ,GAAG,eAAe;AAAA,QACpC,gBAAgB,QAAQ,MAAM,QAAQ,GAAG,QAAQ,IAAI,eAAe;AAAA,MACtE,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,OAAO,QAAQ;AAAA,EACf,OAAO;AAAA;AAMT,SAAS,SAAS,CAAC,SAAS,SAAS;AAAA,EACnC,MAAM,MAAM,IAAI,SAAS,OAAO;AAAA,EAChC,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,QAAQ,QAAQ;AAAA,EACpB,IAAI,QAAQ,QAAQ;AAAA,EAEpB,SAAS,gBAAgB,CAAC,QAAQ,QAAQ,QAAQ;AAAA,IAChD,IAAI,QAAQ,CAAC;AAAA,IACb,SAAS,IAAI,EAAG,IAAI,QAAQ,KAAK;AAAA,MAC/B,MAAM,KAAK,OAAO,SAAS,EAAE;AAAA,IAC/B;AAAA,IACA,OAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA;AAAA,EAGF,SAAS,YAAY,IAAK,cAAc,MAAM,YAAY,UAAU,OAAO;AAAA,IACzE,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,MAAM,kBAAkB,QAAQ,UAAU,eAAe;AAAA,IACzD,QAAQ,UAAU;AAAA,IAClB,QAAQ,UAAU;AAAA,IAElB,IAAI,mBAAmB,iBAAiB;AAAA,MACtC,OAAO,KAAK;AAAA,QACV,SAAS,iBAAiB,SAAS,UAAU,eAAe,GAAG,eAAe;AAAA,QAC9E,SAAS,iBAAiB,SAAS,UAAU,eAAe,GAAG,eAAe;AAAA,MAChF,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,OAAO,QAAQ;AAAA,EACf,OAAO;AAAA;AAgBT,SAAS,iBAAiB,CAAC,GAAG,GAAG,GAAG;AAAA,EAIlC,IAAI,QAAQ,CAAC;AAAA,EACb,SAAS,OAAO,CAAC,GAAG,IAAI;AAAA,IACtB,MAAM,KAAK;AAAA,MACT;AAAA,MACA,QAAQ,EAAE,QAAQ;AAAA,MAClB,SAAS,EAAE,QAAQ;AAAA,MACnB,SAAS,EAAE,QAAQ;AAAA,MACnB,UAAU,EAAE,QAAQ;AAAA,IAEtB,CAAC;AAAA;AAAA,EAGH,YAAY,GAAG,CAAC,EAAE,QAAQ,UAAQ,QAAQ,MAAM,GAAG,CAAC;AAAA,EACpD,YAAY,GAAG,CAAC,EAAE,QAAQ,UAAQ,QAAQ,MAAM,GAAG,CAAC;AAAA,EACpD,MAAM,KAAK,CAAC,GAAE,MAAM,EAAE,SAAS,EAAE,MAAM;AAAA,EAEvC,IAAI,UAAU,CAAC;AAAA,EACf,IAAI,aAAa;AAAA,EAEjB,SAAS,SAAS,CAAC,WAAW;AAAA,IAC5B,IAAI,YAAY,YAAY;AAAA,MAC1B,QAAQ,KAAK;AAAA,QACX,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,aAAa;AAAA,QACb,cAAc,YAAY;AAAA,QAC1B,eAAe,EAAE,MAAM,YAAY,SAAS;AAAA,MAC9C,CAAC;AAAA,MACD,aAAa;AAAA,IACf;AAAA;AAAA,EAGF,OAAO,MAAM,QAAQ;AAAA,IACnB,IAAI,OAAO,MAAM,MAAM;AAAA,IACvB,IAAI,cAAc,KAAK;AAAA,IACvB,IAAI,YAAY,KAAK,SAAS,KAAK;AAAA,IACnC,IAAI,cAAc,CAAC,IAAI;AAAA,IACvB,UAAU,WAAW;AAAA,IAGrB,OAAO,MAAM,QAAQ;AAAA,MACnB,MAAM,WAAW,MAAM;AAAA,MACvB,MAAM,gBAAgB,SAAS;AAAA,MAC/B,IAAI,gBAAgB;AAAA,QAAW;AAAA,MAE/B,YAAY,KAAK,IAAI,WAAW,gBAAgB,SAAS,OAAO;AAAA,MAChE,YAAY,KAAK,MAAM,MAAM,CAAC;AAAA,IAChC;AAAA,IAEA,IAAI,YAAY,WAAW,GAAG;AAAA,MAG5B,IAAI,KAAK,WAAW,GAAG;AAAA,QACrB,MAAM,SAAU,KAAK,OAAO,MAAM,IAAI;AAAA,QACtC,QAAQ,KAAK;AAAA,UACX,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,aAAa,KAAK;AAAA,UAClB,cAAc,KAAK;AAAA,UACnB,eAAe,OAAO,MAAM,KAAK,SAAS,KAAK,UAAU,KAAK,QAAQ;AAAA,QACxE,CAAC;AAAA,MACH;AAAA,IACF,EAAO;AAAA,MAKL,IAAI,SAAS;AAAA,QACX,GAAG,CAAC,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE;AAAA,QAC9B,GAAG,CAAC,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE;AAAA,MAChC;AAAA,MACA,OAAO,YAAY,QAAQ;AAAA,QACzB,OAAO,YAAY,MAAM;AAAA,QACzB,MAAM,SAAS,KAAK;AAAA,QACpB,MAAM,OAAO,SAAS,KAAK;AAAA,QAC3B,MAAM,UAAU,KAAK;AAAA,QACrB,MAAM,QAAQ,UAAU,KAAK;AAAA,QAC7B,IAAI,KAAI,OAAO,KAAK;AAAA,QACpB,GAAE,KAAK,KAAK,IAAI,SAAS,GAAE,EAAE;AAAA,QAC7B,GAAE,KAAK,KAAK,IAAI,OAAO,GAAE,EAAE;AAAA,QAC3B,GAAE,KAAK,KAAK,IAAI,QAAQ,GAAE,EAAE;AAAA,QAC5B,GAAE,KAAK,KAAK,IAAI,MAAM,GAAE,EAAE;AAAA,MAC5B;AAAA,MAEA,MAAM,SAAS,OAAO,EAAE,MAAM,cAAc,OAAO,EAAE;AAAA,MACrD,MAAM,OAAO,OAAO,EAAE,MAAM,YAAY,OAAO,EAAE;AAAA,MACjD,MAAM,SAAS,OAAO,EAAE,MAAM,cAAc,OAAO,EAAE;AAAA,MACrD,MAAM,OAAO,OAAO,EAAE,MAAM,YAAY,OAAO,EAAE;AAAA,MAEjD,IAAI,SAAS;AAAA,QACX,QAAQ;AAAA,QACR;AAAA,QACA,SAAS,OAAO;AAAA,QAChB,UAAU,EAAE,MAAM,QAAQ,IAAI;AAAA,QAC9B,QAAQ;AAAA,QACR,SAAS,YAAY;AAAA,QACrB,UAAU,EAAE,MAAM,aAAa,SAAS;AAAA,QACxC;AAAA,QACA,SAAS,OAAO;AAAA,QAChB,UAAU,EAAE,MAAM,QAAQ,IAAI;AAAA,MAChC;AAAA,MACA,QAAQ,KAAK,MAAM;AAAA;AAAA,IAErB,aAAa;AAAA,EACf;AAAA,EAEA,UAAU,EAAE,MAAM;AAAA,EAElB,OAAO;AAAA;AAQT,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EACpC,IAAI,WAAW;AAAA,IACb,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,EACnB;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,IAAI,OAAO,MAAM;AAAA,IAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,EAC9D,IAAI,OAAO,MAAM;AAAA,IAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,EAC9D,IAAI,OAAO,MAAM;AAAA,IAAU,IAAI,EAAE,MAAM,QAAQ,eAAe;AAAA,EAE9D,IAAI,UAAU,CAAC;AAAA,EACf,MAAM,UAAU,kBAAkB,GAAG,GAAG,CAAC;AAAA,EAEzC,IAAI,WAAW,CAAC;AAAA,EAChB,SAAS,OAAO,GAAG;AAAA,IACjB,IAAI,SAAS,QAAQ;AAAA,MACnB,QAAQ,KAAK,EAAE,IAAI,SAAS,CAAC;AAAA,IAC/B;AAAA,IACA,WAAW,CAAC;AAAA;AAAA,EAGd,SAAS,eAAe,CAAC,IAAG,IAAG;AAAA,IAC7B,IAAI,GAAE,WAAW,GAAE;AAAA,MAAQ,OAAO;AAAA,IAClC,SAAS,IAAI,EAAG,IAAI,GAAE,QAAQ,KAAK;AAAA,MACjC,IAAI,GAAE,OAAO,GAAE;AAAA,QAAI,OAAO;AAAA,IAC5B;AAAA,IACA,OAAO;AAAA;AAAA,EAGT,QAAQ,QAAQ,YAAW;AAAA,IACzB,IAAI,OAAO,QAAQ;AAAA,MACjB,SAAS,KAAK,GAAG,OAAO,aAAa;AAAA,IACvC,EAAO;AAAA,MACL,IAAI,QAAQ,yBAAyB,gBAAgB,OAAO,UAAU,OAAO,QAAQ,GAAG;AAAA,QACtF,SAAS,KAAK,GAAG,OAAO,QAAQ;AAAA,MAClC,EAAO;AAAA,QACL,QAAQ;AAAA,QACR,QAAQ,KAAK;AAAA,UACX,UAAU;AAAA,YACR,GAAG,OAAO;AAAA,YACV,QAAQ,OAAO;AAAA,YACf,GAAG,OAAO;AAAA,YACV,QAAQ,OAAO;AAAA,YACf,GAAG,OAAO;AAAA,YACV,QAAQ,OAAO;AAAA,UACjB;AAAA,QACF,CAAC;AAAA;AAAA;AAAA,GAGN;AAAA,EAED,QAAQ;AAAA,EACR,OAAO;AAAA;AAIT,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EACpC,MAAM,WAAW;AAAA,IACf,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,IACjB,OAAO,CAAC;AAAA,EACV;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW;AAAA,EACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,EAC3C,IAAI,WAAW;AAAA,EACf,IAAI,SAAS,CAAC;AAAA,EAEd,QAAQ,QAAQ,YAAU;AAAA,IACxB,IAAI,OAAO,IAAI;AAAA,MACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,IAClC,EAAO,SAAI,OAAO,UAAU;AAAA,MAC1B,WAAW;AAAA,MACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,CACX;AAAA,IACF;AAAA,GACD;AAAA,EAED,OAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AAAA;AAIF,SAAS,KAAK,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EAC/B,MAAM,WAAW;AAAA,IACf,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,IACjB,OAAO,CAAC;AAAA,EACV;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW;AAAA,EACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,EAC3C,IAAI,WAAW;AAAA,EACf,IAAI,SAAS,CAAC;AAAA,EAEd,QAAQ,QAAQ,YAAU;AAAA,IACxB,IAAI,OAAO,IAAI;AAAA,MACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,IAClC,EAAO,SAAI,OAAO,UAAU;AAAA,MAC1B,WAAW;AAAA,MACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,GACT,OAAO,SAAS,GAChB,CAAC,QAAQ,CACX;AAAA,IACF;AAAA,GACD;AAAA,EAED,OAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AAAA;AAIF,SAAS,UAAU,CAAC,GAAG,GAAG,GAAG,SAAS;AAAA,EACpC,MAAM,WAAW;AAAA,IACf,uBAAuB;AAAA,IACvB,iBAAiB;AAAA,IACjB,OAAO,CAAC;AAAA,EACV;AAAA,EACA,UAAU,OAAO,OAAO,UAAU,OAAO;AAAA,EAEzC,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EACxE,MAAM,WAAW;AAAA,EACjB,MAAM,WAAW,aAAa,QAAQ,MAAM,IAAI,IAAI,QAAQ,MAAM,MAAM;AAAA,EAExE,MAAM,UAAU,WAAW,GAAG,GAAG,GAAG,OAAO;AAAA,EAC3C,IAAI,WAAW;AAAA,EACf,IAAI,SAAS,CAAC;AAAA,EAEd,QAAQ,QAAQ,YAAU;AAAA,IACxB,IAAI,OAAO,IAAI;AAAA,MACb,SAAS,OAAO,OAAO,OAAO,EAAE;AAAA,IAClC,EAAO;AAAA,MACL,MAAM,IAAI,SAAS,OAAO,SAAS,GAAG,OAAO,SAAS,CAAC;AAAA,MACvD,WAAW,SAAS,GAAG;AAAA,QACrB,IAAI,MAAM,QAAQ;AAAA,UAChB,SAAS,OAAO,OAAO,MAAM,MAAM;AAAA,QACrC,EAAO;AAAA,UACL,WAAW;AAAA,UACX,SAAS,OAAO,OACd,CAAC,QAAQ,GACT,MAAM,SACN,CAAC,QAAQ,GACT,MAAM,SACN,CAAC,QAAQ,CACX;AAAA;AAAA,MAEJ;AAAA;AAAA,GAEH;AAAA,EAED,OAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AAAA;AAMF,SAAS,KAAK,CAAC,QAAQ,QAAO;AAAA,EAC5B,IAAI,SAAS,CAAC;AAAA,EACd,IAAI,aAAa;AAAA,EAEjB,SAAS,SAAS,CAAC,cAAc;AAAA,IAC/B,OAAO,aAAa,cAAc;AAAA,MAChC,OAAO,KAAK,OAAO,WAAW;AAAA,MAC9B;AAAA,IACF;AAAA;AAAA,EAGF,WAAW,SAAS,QAAO;AAAA,IACzB,UAAU,MAAM,QAAQ,MAAM;AAAA,IAC9B,WAAW,QAAQ,MAAM,QAAQ,OAAO;AAAA,MACtC,OAAO,KAAK,IAAI;AAAA,IAClB;AAAA,IACA,cAAc,MAAM,QAAQ;AAAA,EAC9B;AAAA,EAEA,UAAU,OAAO,MAAM;AAAA,EACvB,OAAO;AAAA;AAMT,SAAS,UAAU,CAAC,QAAO;AAAA,EACzB,OAAO,OAAM,IAAI,YAAU;AAAA,IACzB,SAAS,EAAE,QAAQ,MAAM,QAAQ,QAAQ,QAAQ,MAAM,QAAQ,OAAO;AAAA,IACtE,SAAS,EAAE,OAAO,MAAM,QAAQ,MAAM;AAAA,EACxC,EAAE;AAAA;AAMJ,SAAS,WAAW,CAAC,QAAO;AAAA,EAC1B,OAAO,OAAM,IAAI,YAAU;AAAA,IACzB,SAAS,MAAM;AAAA,IACf,SAAS,MAAM;AAAA,EACjB,EAAE;AAAA;",
+  "debugId": "78A7F40B895BC9BF64756E2164756E21",
   "names": []
 }

LICENSE.md

@@ -11,3 +11,3 @@ ### The MIT License (MIT)
 Copyright (c) 2006, 2008 LShift Ltd. &lt;[e-mail]&gt;<br/>
-Copyright (c) 2019-2025 Bryan Housel &lt;[e-mail]&gt;<br/>
+Copyright (c) 2019-2026 Bryan Housel &lt;[e-mail]&gt;<br/>
 
@@ -14,0 +14,0 @@ Permission is hereby granted, free of charge, to any person

package.json

 {
   "name": "node-diff3",
-  "version": "3.2.0",
+  "version": "3.2.1",
   "license": "MIT",
-  "repository": "github:bhousel/node-diff3",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/bhousel/node-diff3.git"
+  },
   "description": "A JavaScript module for text diffing and three-way-merge.",
@@ -25,2 +28,3 @@ "contributors": [
   "exports": {
+    "bun": "./src/diff3.mjs",
     "types": "./src/diff3.d.ts",
@@ -32,12 +36,18 @@ "import": "./dist/diff3.mjs",
   "scripts": {
-    "all": "run-s clean lint build test",
+    "all": "bun run --sequential clean check build test",
     "clean": "bun ./scripts/clean.ts",
-    "build": "bun ./scripts/build.ts",
-    "test": "bun test --dots --coverage ./test/*.js",
-    "lint": "eslint ./src/diff3.mjs ./test/*.js"
+    "build": "bun run --parallel 'build:*'",
+    "build:js": "bun ./scripts/build_js.ts",
+    "build:ts": "tsc",
+    "check": "bun run --parallel 'check:*'",
+    "check:lint": "eslint ./scripts ./src ./test",
+    "test": "bun test --dots --coverage ./test"
   },
   "devDependencies": {
-    "@types/bun": "^1.3.0",
-    "eslint": "^9.38.0",
-    "npm-run-all2": "^8.0.4"
+    "@eslint/js": "^10.0.1",
+    "@types/bun": "^1.3.14",
+    "eslint": "^10.4.1",
+    "globals": "^17.6.0",
+    "typescript-eslint": "^8.60.0",
+    "typescript": "^5.9.3"
   },
@@ -49,5 +59,4 @@ "sideEffects": false,
   "engines": {
-    "bun": ">=1.3.0",
-    "node": ">=18"
+    "bun": ">=1.3.10"
   }
 }

README.md

 [![build](https://github.com/bhousel/node-diff3/workflows/build/badge.svg)](https://github.com/bhousel/node-diff3/actions?query=workflow%3A%22build%22)
 [![npm version](https://badge.fury.io/js/node-diff3.svg)](https://badge.fury.io/js/node-diff3)
+[![License](https://img.shields.io/badge/license-MIT-blue.svg)](LICENSE.md)
 
@@ -4,0 +5,0 @@ # node-diff3

src/diff3.d.ts

@@ -16,6 +16,11 @@ export interface ILCSResult {
 
-export interface ICommResult<T> {
+export type ICommResult<T> = {
+  common: T[];
+  buffer1?: never;
+  buffer2?: never;
+} | {
+  common?: never;
   buffer1: T[];
   buffer2: T[];
-}
+};
 
@@ -128,5 +133,5 @@ /**
 
-export interface MergeResult {
+export interface MergeResult<T = string> {
   conflict: boolean;
-  result: string[];
+  result: Array<T | string>;
 }
@@ -139,2 +144,10 @@
 
+export interface IMergeLabelOptions extends IMergeOptions {
+  label?: {
+    a?: string;
+    o?: string;
+    b?: string;
+  };
+}
+
 /**
@@ -152,3 +165,3 @@ * Applies the output of diff3MergeRegions to actually
  */
-export function diff3Merge<T>(
+export function diff3Merge<T = string>(
   a: string | T[],
@@ -160,27 +173,21 @@ o: string | T[],
 
-export function merge<T>(
+export function merge<T = string>(
   a: string | T[],
   o: string | T[],
   b: string | T[],
-  options?: IMergeOptions
-): MergeResult;
+  options?: IMergeLabelOptions
+): MergeResult<T>;
 
-export function mergeDiff3<T>(
+export function mergeDiff3<T = string>(
   a: string | T[],
   o: string | T[],
   b: string | T[],
-  options?: IMergeOptions & {
-    label?: {
-      a?: string;
-      o?: string;
-      b?: string;
-    }
-  }
-): MergeResult;
+  options?: IMergeLabelOptions
+): MergeResult<T>;
 
-export function mergeDigIn<T>(
+export function mergeDigIn<T = string>(
   a: string | T[],
   o: string | T[],
   b: string | T[],
-  options?: IMergeOptions
-): MergeResult;
+  options?: IMergeLabelOptions
+): MergeResult<T>;

src/diff3.mjs

@@ -25,3 +25,6 @@ export {
 function LCS(buffer1, buffer2) {
-  let equivalenceClasses = {};
+  // Use a prototype-less object so input elements that happen to match
+  // `Object.prototype` members (`constructor`, `__proto__`, `toString`, ...)
+  // don't shadow the lookup with inherited values.
+  let equivalenceClasses = Object.create(null);
   for (let j = 0; j < buffer2.length; j++) {
@@ -45,5 +48,3 @@ const item = buffer2[j];
 
-    for (let jx = 0; jx < buffer2indices.length; jx++) {
-      const j = buffer2indices[jx];
-
+    for (const j of buffer2indices) {
       let s;
@@ -486,4 +487,3 @@ for (s = r; s < candidates.length; s++) {
       const c = diffComm(region.conflict.a, region.conflict.b);
-      for (let j = 0; j < c.length; j++) {
-        let inner = c[j];
+      for (const inner of c) {
         if (inner.common) {
@@ -525,7 +525,6 @@ result = result.concat(inner.common);
 
-  for (let chunkIndex = 0; chunkIndex < patch.length; chunkIndex++) {
-    let chunk = patch[chunkIndex];
+  for (const chunk of patch) {
     advanceTo(chunk.buffer1.offset);
-    for (let itemIndex = 0; itemIndex < chunk.buffer2.chunk.length; itemIndex++) {
-      result.push(chunk.buffer2.chunk[itemIndex]);
+    for (const item of chunk.buffer2.chunk) {
+      result.push(item);
     }
@@ -532,0 +531,0 @@ currOffset += chunk.buffer1.length;

Fixed alerts

Major refactor

Supply chain risk

Package has recently undergone a major refactor. It may be unstable or indicate significant internal changes. Use caution when updating to versions that include significant changes.

No repository

Supply chain risk

Package does not have a linked source code repository. Without this field, a package will have no reference to the location of the source code use to generate the package.

Improved metrics

Total package byte prevSize

151522

0.87%

Number of package files

14

16.67%

Lines of code

1934

0.62%

Number of lines in readme file

323

0.31%

Number of low supply chain risk alerts

0

-100%

Number of medium supply chain risk alerts

0

-100%

Worsened metrics

Dev dependency count

6

100%

No dependency changes