@keystrokehq/platform 0.1.15 → 0.1.16

package/dist/{diff-MWJFIG7X-COe_aM14.cjs.map → diff-MWJFIG7X-DkKded0v.cjs.map}

@@ -1 +1 @@
-{"version":3,"file":"diff-MWJFIG7X-COe_aM14.cjs","names":["p","u","c","s","o","a","g.createTwoFilesPatch"],"sources":["../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/base.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/character.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/util/string.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/word.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/line.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/sentence.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/css.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/json.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/array.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/patch/create.js","../../../node_modules/.pnpm/just-bash@3.0.1/node_modules/just-bash/dist/bundle/chunks/chunk-CBJVD2XA.js","../../../node_modules/.pnpm/just-bash@3.0.1/node_modules/just-bash/dist/bundle/chunks/diff-MWJFIG7X.js"],"sourcesContent":["export default class Diff {\n    diff(oldStr, newStr, \n    // Type below is not accurate/complete - see above for full possibilities - but it compiles\n    options = {}) {\n        let callback;\n        if (typeof options === 'function') {\n            callback = options;\n            options = {};\n        }\n        else if ('callback' in options) {\n            callback = options.callback;\n        }\n        // Allow subclasses to massage the input prior to running\n        const oldString = this.castInput(oldStr, options);\n        const newString = this.castInput(newStr, options);\n        const oldTokens = this.removeEmpty(this.tokenize(oldString, options));\n        const newTokens = this.removeEmpty(this.tokenize(newString, options));\n        return this.diffWithOptionsObj(oldTokens, newTokens, options, callback);\n    }\n    diffWithOptionsObj(oldTokens, newTokens, options, callback) {\n        var _a;\n        const done = (value) => {\n            value = this.postProcess(value, options);\n            if (callback) {\n                setTimeout(function () { callback(value); }, 0);\n                return undefined;\n            }\n            else {\n                return value;\n            }\n        };\n        const newLen = newTokens.length, oldLen = oldTokens.length;\n        let editLength = 1;\n        let maxEditLength = newLen + oldLen;\n        if (options.maxEditLength != null) {\n            maxEditLength = Math.min(maxEditLength, options.maxEditLength);\n        }\n        const maxExecutionTime = (_a = options.timeout) !== null && _a !== void 0 ? _a : Infinity;\n        const abortAfterTimestamp = Date.now() + maxExecutionTime;\n        const bestPath = [{ oldPos: -1, lastComponent: undefined }];\n        // Seed editLength = 0, i.e. the content starts with the same values\n        let newPos = this.extractCommon(bestPath[0], newTokens, oldTokens, 0, options);\n        if (bestPath[0].oldPos + 1 >= oldLen && newPos + 1 >= newLen) {\n            // Identity per the equality and tokenizer\n            return done(this.buildValues(bestPath[0].lastComponent, newTokens, oldTokens));\n        }\n        // Once we hit the right edge of the edit graph on some diagonal k, we can\n        // definitely reach the end of the edit graph in no more than k edits, so\n        // there's no point in considering any moves to diagonal k+1 any more (from\n        // which we're guaranteed to need at least k+1 more edits).\n        // Similarly, once we've reached the bottom of the edit graph, there's no\n        // point considering moves to lower diagonals.\n        // We record this fact by setting minDiagonalToConsider and\n        // maxDiagonalToConsider to some finite value once we've hit the edge of\n        // the edit graph.\n        // This optimization is not faithful to the original algorithm presented in\n        // Myers's paper, which instead pointlessly extends D-paths off the end of\n        // the edit graph - see page 7 of Myers's paper which notes this point\n        // explicitly and illustrates it with a diagram. This has major performance\n        // implications for some common scenarios. For instance, to compute a diff\n        // where the new text simply appends d characters on the end of the\n        // original text of length n, the true Myers algorithm will take O(n+d^2)\n        // time while this optimization needs only O(n+d) time.\n        let minDiagonalToConsider = -Infinity, maxDiagonalToConsider = Infinity;\n        // Main worker method. checks all permutations of a given edit length for acceptance.\n        const execEditLength = () => {\n            for (let diagonalPath = Math.max(minDiagonalToConsider, -editLength); diagonalPath <= Math.min(maxDiagonalToConsider, editLength); diagonalPath += 2) {\n                let basePath;\n                const removePath = bestPath[diagonalPath - 1], addPath = bestPath[diagonalPath + 1];\n                if (removePath) {\n                    // No one else is going to attempt to use this value, clear it\n                    // @ts-expect-error - perf optimisation. This type-violating value will never be read.\n                    bestPath[diagonalPath - 1] = undefined;\n                }\n                let canAdd = false;\n                if (addPath) {\n                    // what newPos will be after we do an insertion:\n                    const addPathNewPos = addPath.oldPos - diagonalPath;\n                    canAdd = addPath && 0 <= addPathNewPos && addPathNewPos < newLen;\n                }\n                const canRemove = removePath && removePath.oldPos + 1 < oldLen;\n                if (!canAdd && !canRemove) {\n                    // If this path is a terminal then prune\n                    // @ts-expect-error - perf optimisation. This type-violating value will never be read.\n                    bestPath[diagonalPath] = undefined;\n                    continue;\n                }\n                // Select the diagonal that we want to branch from. We select the prior\n                // path whose position in the old string is the farthest from the origin\n                // and does not pass the bounds of the diff graph\n                if (!canRemove || (canAdd && removePath.oldPos < addPath.oldPos)) {\n                    basePath = this.addToPath(addPath, true, false, 0, options);\n                }\n                else {\n                    basePath = this.addToPath(removePath, false, true, 1, options);\n                }\n                newPos = this.extractCommon(basePath, newTokens, oldTokens, diagonalPath, options);\n                if (basePath.oldPos + 1 >= oldLen && newPos + 1 >= newLen) {\n                    // If we have hit the end of both strings, then we are done\n                    return done(this.buildValues(basePath.lastComponent, newTokens, oldTokens)) || true;\n                }\n                else {\n                    bestPath[diagonalPath] = basePath;\n                    if (basePath.oldPos + 1 >= oldLen) {\n                        maxDiagonalToConsider = Math.min(maxDiagonalToConsider, diagonalPath - 1);\n                    }\n                    if (newPos + 1 >= newLen) {\n                        minDiagonalToConsider = Math.max(minDiagonalToConsider, diagonalPath + 1);\n                    }\n                }\n            }\n            editLength++;\n        };\n        // Performs the length of edit iteration. Is a bit fugly as this has to support the\n        // sync and async mode which is never fun. Loops over execEditLength until a value\n        // is produced, or until the edit length exceeds options.maxEditLength (if given),\n        // in which case it will return undefined.\n        if (callback) {\n            (function exec() {\n                setTimeout(function () {\n                    if (editLength > maxEditLength || Date.now() > abortAfterTimestamp) {\n                        return callback(undefined);\n                    }\n                    if (!execEditLength()) {\n                        exec();\n                    }\n                }, 0);\n            }());\n        }\n        else {\n            while (editLength <= maxEditLength && Date.now() <= abortAfterTimestamp) {\n                const ret = execEditLength();\n                if (ret) {\n                    return ret;\n                }\n            }\n        }\n    }\n    addToPath(path, added, removed, oldPosInc, options) {\n        const last = path.lastComponent;\n        if (last && !options.oneChangePerToken && last.added === added && last.removed === removed) {\n            return {\n                oldPos: path.oldPos + oldPosInc,\n                lastComponent: { count: last.count + 1, added: added, removed: removed, previousComponent: last.previousComponent }\n            };\n        }\n        else {\n            return {\n                oldPos: path.oldPos + oldPosInc,\n                lastComponent: { count: 1, added: added, removed: removed, previousComponent: last }\n            };\n        }\n    }\n    extractCommon(basePath, newTokens, oldTokens, diagonalPath, options) {\n        const newLen = newTokens.length, oldLen = oldTokens.length;\n        let oldPos = basePath.oldPos, newPos = oldPos - diagonalPath, commonCount = 0;\n        while (newPos + 1 < newLen && oldPos + 1 < oldLen && this.equals(oldTokens[oldPos + 1], newTokens[newPos + 1], options)) {\n            newPos++;\n            oldPos++;\n            commonCount++;\n            if (options.oneChangePerToken) {\n                basePath.lastComponent = { count: 1, previousComponent: basePath.lastComponent, added: false, removed: false };\n            }\n        }\n        if (commonCount && !options.oneChangePerToken) {\n            basePath.lastComponent = { count: commonCount, previousComponent: basePath.lastComponent, added: false, removed: false };\n        }\n        basePath.oldPos = oldPos;\n        return newPos;\n    }\n    equals(left, right, options) {\n        if (options.comparator) {\n            return options.comparator(left, right);\n        }\n        else {\n            return left === right\n                || (!!options.ignoreCase && left.toLowerCase() === right.toLowerCase());\n        }\n    }\n    removeEmpty(array) {\n        const ret = [];\n        for (let i = 0; i < array.length; i++) {\n            if (array[i]) {\n                ret.push(array[i]);\n            }\n        }\n        return ret;\n    }\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    castInput(value, options) {\n        return value;\n    }\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    tokenize(value, options) {\n        return Array.from(value);\n    }\n    join(chars) {\n        // Assumes ValueT is string, which is the case for most subclasses.\n        // When it's false, e.g. in diffArrays, this method needs to be overridden (e.g. with a no-op)\n        // Yes, the casts are verbose and ugly, because this pattern - of having the base class SORT OF\n        // assume tokens and values are strings, but not completely - is weird and janky.\n        return chars.join('');\n    }\n    postProcess(changeObjects, \n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    options) {\n        return changeObjects;\n    }\n    get useLongestToken() {\n        return false;\n    }\n    buildValues(lastComponent, newTokens, oldTokens) {\n        // First we convert our linked list of components in reverse order to an\n        // array in the right order:\n        const components = [];\n        let nextComponent;\n        while (lastComponent) {\n            components.push(lastComponent);\n            nextComponent = lastComponent.previousComponent;\n            delete lastComponent.previousComponent;\n            lastComponent = nextComponent;\n        }\n        components.reverse();\n        const componentLen = components.length;\n        let componentPos = 0, newPos = 0, oldPos = 0;\n        for (; componentPos < componentLen; componentPos++) {\n            const component = components[componentPos];\n            if (!component.removed) {\n                if (!component.added && this.useLongestToken) {\n                    let value = newTokens.slice(newPos, newPos + component.count);\n                    value = value.map(function (value, i) {\n                        const oldValue = oldTokens[oldPos + i];\n                        return oldValue.length > value.length ? oldValue : value;\n                    });\n                    component.value = this.join(value);\n                }\n                else {\n                    component.value = this.join(newTokens.slice(newPos, newPos + component.count));\n                }\n                newPos += component.count;\n                // Common case\n                if (!component.added) {\n                    oldPos += component.count;\n                }\n            }\n            else {\n                component.value = this.join(oldTokens.slice(oldPos, oldPos + component.count));\n                oldPos += component.count;\n            }\n        }\n        return components;\n    }\n}\n","import Diff from './base.js';\nclass CharacterDiff extends Diff {\n}\nexport const characterDiff = new CharacterDiff();\nexport function diffChars(oldStr, newStr, options) {\n    return characterDiff.diff(oldStr, newStr, options);\n}\n","export function longestCommonPrefix(str1, str2) {\n    let i;\n    for (i = 0; i < str1.length && i < str2.length; i++) {\n        if (str1[i] != str2[i]) {\n            return str1.slice(0, i);\n        }\n    }\n    return str1.slice(0, i);\n}\nexport function longestCommonSuffix(str1, str2) {\n    let i;\n    // Unlike longestCommonPrefix, we need a special case to handle all scenarios\n    // where we return the empty string since str1.slice(-0) will return the\n    // entire string.\n    if (!str1 || !str2 || str1[str1.length - 1] != str2[str2.length - 1]) {\n        return '';\n    }\n    for (i = 0; i < str1.length && i < str2.length; i++) {\n        if (str1[str1.length - (i + 1)] != str2[str2.length - (i + 1)]) {\n            return str1.slice(-i);\n        }\n    }\n    return str1.slice(-i);\n}\nexport function replacePrefix(string, oldPrefix, newPrefix) {\n    if (string.slice(0, oldPrefix.length) != oldPrefix) {\n        throw Error(`string ${JSON.stringify(string)} doesn't start with prefix ${JSON.stringify(oldPrefix)}; this is a bug`);\n    }\n    return newPrefix + string.slice(oldPrefix.length);\n}\nexport function replaceSuffix(string, oldSuffix, newSuffix) {\n    if (!oldSuffix) {\n        return string + newSuffix;\n    }\n    if (string.slice(-oldSuffix.length) != oldSuffix) {\n        throw Error(`string ${JSON.stringify(string)} doesn't end with suffix ${JSON.stringify(oldSuffix)}; this is a bug`);\n    }\n    return string.slice(0, -oldSuffix.length) + newSuffix;\n}\nexport function removePrefix(string, oldPrefix) {\n    return replacePrefix(string, oldPrefix, '');\n}\nexport function removeSuffix(string, oldSuffix) {\n    return replaceSuffix(string, oldSuffix, '');\n}\nexport function maximumOverlap(string1, string2) {\n    return string2.slice(0, overlapCount(string1, string2));\n}\n// Nicked from https://stackoverflow.com/a/60422853/1709587\nfunction overlapCount(a, b) {\n    // Deal with cases where the strings differ in length\n    let startA = 0;\n    if (a.length > b.length) {\n        startA = a.length - b.length;\n    }\n    let endB = b.length;\n    if (a.length < b.length) {\n        endB = a.length;\n    }\n    // Create a back-reference for each index\n    //   that should be followed in case of a mismatch.\n    //   We only need B to make these references:\n    const map = Array(endB);\n    let k = 0; // Index that lags behind j\n    map[0] = 0;\n    for (let j = 1; j < endB; j++) {\n        if (b[j] == b[k]) {\n            map[j] = map[k]; // skip over the same character (optional optimisation)\n        }\n        else {\n            map[j] = k;\n        }\n        while (k > 0 && b[j] != b[k]) {\n            k = map[k];\n        }\n        if (b[j] == b[k]) {\n            k++;\n        }\n    }\n    // Phase 2: use these references while iterating over A\n    k = 0;\n    for (let i = startA; i < a.length; i++) {\n        while (k > 0 && a[i] != b[k]) {\n            k = map[k];\n        }\n        if (a[i] == b[k]) {\n            k++;\n        }\n    }\n    return k;\n}\n/**\n * Returns true if the string consistently uses Windows line endings.\n */\nexport function hasOnlyWinLineEndings(string) {\n    return string.includes('\\r\\n') && !string.startsWith('\\n') && !string.match(/[^\\r]\\n/);\n}\n/**\n * Returns true if the string consistently uses Unix line endings.\n */\nexport function hasOnlyUnixLineEndings(string) {\n    return !string.includes('\\r\\n') && string.includes('\\n');\n}\n/**\n * Split a string into segments using a word segmenter, merging consecutive\n * segments if they are both whitespace segments. Whitespace segments can\n * appear adjacent to one another for two reasons:\n * - newlines always get their own segment\n * - where a diacritic is attached to a whitespace character in the text, the\n *   segment ends after the diacritic, so e.g. \" \\u0300 \" becomes two segments.\n * This function therefore runs the segmenter's .segment() method and then\n * merges consecutive segments of whitespace into a single part.\n */\nexport function segment(string, segmenter) {\n    const parts = [];\n    for (const segmentObj of Array.from(segmenter.segment(string))) {\n        const segment = segmentObj.segment;\n        if (parts.length && (/\\s/).test(parts[parts.length - 1]) && (/\\s/).test(segment)) {\n            parts[parts.length - 1] += segment;\n        }\n        else {\n            parts.push(segment);\n        }\n    }\n    return parts;\n}\n// The functions below take a `segmenter` argument so that, when called from\n// diffWords when it is using a segmenter, they can use a notion of what\n// constitutes \"whitespace\" that is consistent with the segmenter.\n//\n// USUALLY this will be identical to the result of the non-segmenter-based\n// logic, but it differs in at least one case: when whitespace characters are\n// modified by diacritics. A word segmenter considers these diacritics to be\n// part of the whitespace, whereas our non-segmenter-based logic does not.\n//\n// Because the segmenter-based approach necessarily requires segmenting the\n// entire string, we offer a leadingAndTrailingWs function to allow getting the\n// whitespace prefix AND whitespace suffix with a single call to the segmenter,\n// for efficiency's sake.\nexport function trailingWs(string, segmenter) {\n    if (segmenter) {\n        return leadingAndTrailingWs(string, segmenter)[1];\n    }\n    // Yes, this looks overcomplicated and dumb - why not replace the whole function with\n    //     return string.match(/\\s*$/)[0]\n    // you ask? Because:\n    // 1. the trap described at https://markamery.com/blog/quadratic-time-regexes/ would mean doing\n    //    this would cause this function to take O(n²) time in the worst case (specifically when\n    //    there is a massive run of NON-TRAILING whitespace in `string`), and\n    // 2. the fix proposed in the same blog post, of using a negative lookbehind, is incompatible\n    //    with old Safari versions that we'd like to not break if possible (see\n    //    https://github.com/kpdecker/jsdiff/pull/550)\n    // It feels absurd to do this with an explicit loop instead of a regex, but I really can't see a\n    // better way that doesn't result in broken behaviour.\n    let i;\n    for (i = string.length - 1; i >= 0; i--) {\n        if (!string[i].match(/\\s/)) {\n            break;\n        }\n    }\n    return string.substring(i + 1);\n}\nexport function leadingWs(string, segmenter) {\n    if (segmenter) {\n        return leadingAndTrailingWs(string, segmenter)[0];\n    }\n    // Thankfully the annoying considerations described in trailingWs don't apply here:\n    const match = string.match(/^\\s*/);\n    return match ? match[0] : '';\n}\nexport function leadingAndTrailingWs(string, segmenter) {\n    if (!segmenter) {\n        return [leadingWs(string), trailingWs(string)];\n    }\n    if (segmenter.resolvedOptions().granularity != 'word') {\n        throw new Error('The segmenter passed must have a granularity of \"word\"');\n    }\n    const segments = segment(string, segmenter);\n    const firstSeg = segments[0];\n    const lastSeg = segments[segments.length - 1];\n    const head = (/\\s/).test(firstSeg) ? firstSeg : '';\n    const tail = (/\\s/).test(lastSeg) ? lastSeg : '';\n    return [head, tail];\n}\n","import Diff from './base.js';\nimport { longestCommonPrefix, longestCommonSuffix, replacePrefix, replaceSuffix, removePrefix, removeSuffix, maximumOverlap, leadingWs, trailingWs, leadingAndTrailingWs, segment } from '../util/string.js';\n// Based on https://en.wikipedia.org/wiki/Latin_script_in_Unicode\n//\n// Chars/ranges counted as \"word\" characters by this regex are as follows:\n//\n// + U+00AD  Soft hyphen\n// + 00C0–00FF (letters with diacritics from the Latin-1 Supplement), except:\n//   - U+00D7  × Multiplication sign\n//   - U+00F7  ÷ Division sign\n// + Latin Extended-A, 0100–017F\n// + Latin Extended-B, 0180–024F\n// + IPA Extensions, 0250–02AF\n// + Spacing Modifier Letters, 02B0–02FF, except:\n//   - U+02C7  ˇ &#711;  Caron\n//   - U+02D8  ˘ &#728;  Breve\n//   - U+02D9  ˙ &#729;  Dot Above\n//   - U+02DA  ˚ &#730;  Ring Above\n//   - U+02DB  ˛ &#731;  Ogonek\n//   - U+02DC  ˜ &#732;  Small Tilde\n//   - U+02DD  ˝ &#733;  Double Acute Accent\n// + Latin Extended Additional, 1E00–1EFF\nconst extendedWordChars = 'a-zA-Z0-9_\\\\u{AD}\\\\u{C0}-\\\\u{D6}\\\\u{D8}-\\\\u{F6}\\\\u{F8}-\\\\u{2C6}\\\\u{2C8}-\\\\u{2D7}\\\\u{2DE}-\\\\u{2FF}\\\\u{1E00}-\\\\u{1EFF}';\n// Each token is one of the following:\n// - A punctuation mark plus the surrounding whitespace\n// - A word plus the surrounding whitespace\n// - Pure whitespace (but only in the special case where the entire text\n//   is just whitespace)\n//\n// We have to include surrounding whitespace in the tokens because the two\n// alternative approaches produce horribly broken results:\n// * If we just discard the whitespace, we can't fully reproduce the original\n//   text from the sequence of tokens and any attempt to render the diff will\n//   get the whitespace wrong.\n// * If we have separate tokens for whitespace, then in a typical text every\n//   second token will be a single space character. But this often results in\n//   the optimal diff between two texts being a perverse one that preserves\n//   the spaces between words but deletes and reinserts actual common words.\n//   See https://github.com/kpdecker/jsdiff/issues/160#issuecomment-1866099640\n//   for an example.\n//\n// Keeping the surrounding whitespace of course has implications for .equals\n// and .join, not just .tokenize.\n// This regex does NOT fully implement the tokenization rules described above.\n// Instead, it gives runs of whitespace their own \"token\". The tokenize method\n// then handles stitching whitespace tokens onto adjacent word or punctuation\n// tokens.\nconst tokenizeIncludingWhitespace = new RegExp(`[${extendedWordChars}]+|\\\\s+|[^${extendedWordChars}]`, 'ug');\nclass WordDiff extends Diff {\n    equals(left, right, options) {\n        if (options.ignoreCase) {\n            left = left.toLowerCase();\n            right = right.toLowerCase();\n        }\n        return left.trim() === right.trim();\n    }\n    tokenize(value, options = {}) {\n        let parts;\n        if (options.intlSegmenter) {\n            const segmenter = options.intlSegmenter;\n            if (segmenter.resolvedOptions().granularity != 'word') {\n                throw new Error('The segmenter passed must have a granularity of \"word\"');\n            }\n            // We want `parts` to be an array whose elements alternate between being\n            // pure whitespace and being pure non-whitespace. This is ALMOST what the\n            // segments returned by a word-based Intl.Segmenter already look like,\n            // but not quite - see explanation in the docs of our custom segment()\n            // function.\n            parts = segment(value, segmenter);\n        }\n        else {\n            parts = value.match(tokenizeIncludingWhitespace) || [];\n        }\n        const tokens = [];\n        let prevPart = null;\n        parts.forEach(part => {\n            if ((/\\s/).test(part)) {\n                if (prevPart == null) {\n                    tokens.push(part);\n                }\n                else {\n                    tokens.push(tokens.pop() + part);\n                }\n            }\n            else if (prevPart != null && (/\\s/).test(prevPart)) {\n                if (tokens[tokens.length - 1] == prevPart) {\n                    tokens.push(tokens.pop() + part);\n                }\n                else {\n                    tokens.push(prevPart + part);\n                }\n            }\n            else {\n                tokens.push(part);\n            }\n            prevPart = part;\n        });\n        return tokens;\n    }\n    join(tokens) {\n        // Tokens being joined here will always have appeared consecutively in the\n        // same text, so we can simply strip off the leading whitespace from all the\n        // tokens except the first (and except any whitespace-only tokens - but such\n        // a token will always be the first and only token anyway) and then join them\n        // and the whitespace around words and punctuation will end up correct.\n        return tokens.map((token, i) => {\n            if (i == 0) {\n                return token;\n            }\n            else {\n                return token.replace((/^\\s+/), '');\n            }\n        }).join('');\n    }\n    postProcess(changes, options) {\n        if (!changes || options.oneChangePerToken) {\n            return changes;\n        }\n        let lastKeep = null;\n        // Change objects representing any insertion or deletion since the last\n        // \"keep\" change object. There can be at most one of each.\n        let insertion = null;\n        let deletion = null;\n        changes.forEach(change => {\n            if (change.added) {\n                insertion = change;\n            }\n            else if (change.removed) {\n                deletion = change;\n            }\n            else {\n                if (insertion || deletion) { // May be false at start of text\n                    dedupeWhitespaceInChangeObjects(lastKeep, deletion, insertion, change, options.intlSegmenter);\n                }\n                lastKeep = change;\n                insertion = null;\n                deletion = null;\n            }\n        });\n        if (insertion || deletion) {\n            dedupeWhitespaceInChangeObjects(lastKeep, deletion, insertion, null, options.intlSegmenter);\n        }\n        return changes;\n    }\n}\nexport const wordDiff = new WordDiff();\nexport function diffWords(oldStr, newStr, options) {\n    // This option has never been documented and never will be (it's clearer to\n    // just call `diffWordsWithSpace` directly if you need that behavior), but\n    // has existed in jsdiff for a long time, so we retain support for it here\n    // for the sake of backwards compatibility.\n    if ((options === null || options === void 0 ? void 0 : options.ignoreWhitespace) != null && !options.ignoreWhitespace) {\n        return diffWordsWithSpace(oldStr, newStr, options);\n    }\n    return wordDiff.diff(oldStr, newStr, options);\n}\nfunction dedupeWhitespaceInChangeObjects(startKeep, deletion, insertion, endKeep, segmenter) {\n    // Before returning, we tidy up the leading and trailing whitespace of the\n    // change objects to eliminate cases where trailing whitespace in one object\n    // is repeated as leading whitespace in the next.\n    // Below are examples of the outcomes we want here to explain the code.\n    // I=insert, K=keep, D=delete\n    // 1. diffing 'foo bar baz' vs 'foo baz'\n    //    Prior to cleanup, we have K:'foo ' D:' bar ' K:' baz'\n    //    After cleanup, we want:   K:'foo ' D:'bar ' K:'baz'\n    //\n    // 2. Diffing 'foo bar baz' vs 'foo qux baz'\n    //    Prior to cleanup, we have K:'foo ' D:' bar ' I:' qux ' K:' baz'\n    //    After cleanup, we want K:'foo ' D:'bar' I:'qux' K:' baz'\n    //\n    // 3. Diffing 'foo\\nbar baz' vs 'foo baz'\n    //    Prior to cleanup, we have K:'foo ' D:'\\nbar ' K:' baz'\n    //    After cleanup, we want K'foo' D:'\\nbar' K:' baz'\n    //\n    // 4. Diffing 'foo baz' vs 'foo\\nbar baz'\n    //    Prior to cleanup, we have K:'foo\\n' I:'\\nbar ' K:' baz'\n    //    After cleanup, we ideally want K'foo' I:'\\nbar' K:' baz'\n    //    but don't actually manage this currently (the pre-cleanup change\n    //    objects don't contain enough information to make it possible).\n    //\n    // 5. Diffing 'foo   bar baz' vs 'foo  baz'\n    //    Prior to cleanup, we have K:'foo  ' D:'   bar ' K:'  baz'\n    //    After cleanup, we want K:'foo  ' D:' bar ' K:'baz'\n    //\n    // Our handling is unavoidably imperfect in the case where there's a single\n    // indel between keeps and the whitespace has changed. For instance, consider\n    // diffing 'foo\\tbar\\nbaz' vs 'foo baz'. Unless we create an extra change\n    // object to represent the insertion of the space character (which isn't even\n    // a token), we have no way to avoid losing information about the texts'\n    // original whitespace in the result we return. Still, we do our best to\n    // output something that will look sensible if we e.g. print it with\n    // insertions in green and deletions in red.\n    // Between two \"keep\" change objects (or before the first or after the last\n    // change object), we can have either:\n    // * A \"delete\" followed by an \"insert\"\n    // * Just an \"insert\"\n    // * Just a \"delete\"\n    // We handle the three cases separately.\n    if (deletion && insertion) {\n        const [oldWsPrefix, oldWsSuffix] = leadingAndTrailingWs(deletion.value, segmenter);\n        const [newWsPrefix, newWsSuffix] = leadingAndTrailingWs(insertion.value, segmenter);\n        if (startKeep) {\n            const commonWsPrefix = longestCommonPrefix(oldWsPrefix, newWsPrefix);\n            startKeep.value = replaceSuffix(startKeep.value, newWsPrefix, commonWsPrefix);\n            deletion.value = removePrefix(deletion.value, commonWsPrefix);\n            insertion.value = removePrefix(insertion.value, commonWsPrefix);\n        }\n        if (endKeep) {\n            const commonWsSuffix = longestCommonSuffix(oldWsSuffix, newWsSuffix);\n            endKeep.value = replacePrefix(endKeep.value, newWsSuffix, commonWsSuffix);\n            deletion.value = removeSuffix(deletion.value, commonWsSuffix);\n            insertion.value = removeSuffix(insertion.value, commonWsSuffix);\n        }\n    }\n    else if (insertion) {\n        // The whitespaces all reflect what was in the new text rather than\n        // the old, so we essentially have no information about whitespace\n        // insertion or deletion. We just want to dedupe the whitespace.\n        // We do that by having each change object keep its trailing\n        // whitespace and deleting duplicate leading whitespace where\n        // present.\n        if (startKeep) {\n            const ws = leadingWs(insertion.value, segmenter);\n            insertion.value = insertion.value.substring(ws.length);\n        }\n        if (endKeep) {\n            const ws = leadingWs(endKeep.value, segmenter);\n            endKeep.value = endKeep.value.substring(ws.length);\n        }\n        // otherwise we've got a deletion and no insertion\n    }\n    else if (startKeep && endKeep) {\n        const newWsFull = leadingWs(endKeep.value, segmenter), [delWsStart, delWsEnd] = leadingAndTrailingWs(deletion.value, segmenter);\n        // Any whitespace that comes straight after startKeep in both the old and\n        // new texts, assign to startKeep and remove from the deletion.\n        const newWsStart = longestCommonPrefix(newWsFull, delWsStart);\n        deletion.value = removePrefix(deletion.value, newWsStart);\n        // Any whitespace that comes straight before endKeep in both the old and\n        // new texts, and hasn't already been assigned to startKeep, assign to\n        // endKeep and remove from the deletion.\n        const newWsEnd = longestCommonSuffix(removePrefix(newWsFull, newWsStart), delWsEnd);\n        deletion.value = removeSuffix(deletion.value, newWsEnd);\n        endKeep.value = replacePrefix(endKeep.value, newWsFull, newWsEnd);\n        // If there's any whitespace from the new text that HASN'T already been\n        // assigned, assign it to the start:\n        startKeep.value = replaceSuffix(startKeep.value, newWsFull, newWsFull.slice(0, newWsFull.length - newWsEnd.length));\n    }\n    else if (endKeep) {\n        // We are at the start of the text. Preserve all the whitespace on\n        // endKeep, and just remove whitespace from the end of deletion to the\n        // extent that it overlaps with the start of endKeep.\n        const endKeepWsPrefix = leadingWs(endKeep.value, segmenter);\n        const deletionWsSuffix = trailingWs(deletion.value, segmenter);\n        const overlap = maximumOverlap(deletionWsSuffix, endKeepWsPrefix);\n        deletion.value = removeSuffix(deletion.value, overlap);\n    }\n    else if (startKeep) {\n        // We are at the END of the text. Preserve all the whitespace on\n        // startKeep, and just remove whitespace from the start of deletion to\n        // the extent that it overlaps with the end of startKeep.\n        const startKeepWsSuffix = trailingWs(startKeep.value, segmenter);\n        const deletionWsPrefix = leadingWs(deletion.value, segmenter);\n        const overlap = maximumOverlap(startKeepWsSuffix, deletionWsPrefix);\n        deletion.value = removePrefix(deletion.value, overlap);\n    }\n}\nclass WordsWithSpaceDiff extends Diff {\n    tokenize(value) {\n        // Slightly different to the tokenizeIncludingWhitespace regex used above in\n        // that this one treats each individual newline as a distinct token, rather\n        // than merging them into other surrounding whitespace. This was requested\n        // in https://github.com/kpdecker/jsdiff/issues/180 &\n        //    https://github.com/kpdecker/jsdiff/issues/211\n        const regex = new RegExp(`(\\\\r?\\\\n)|[${extendedWordChars}]+|[^\\\\S\\\\n\\\\r]+|[^${extendedWordChars}]`, 'ug');\n        return value.match(regex) || [];\n    }\n}\nexport const wordsWithSpaceDiff = new WordsWithSpaceDiff();\nexport function diffWordsWithSpace(oldStr, newStr, options) {\n    return wordsWithSpaceDiff.diff(oldStr, newStr, options);\n}\n","import Diff from './base.js';\nimport { generateOptions } from '../util/params.js';\nclass LineDiff extends Diff {\n    constructor() {\n        super(...arguments);\n        this.tokenize = tokenize;\n    }\n    equals(left, right, options) {\n        // If we're ignoring whitespace, we need to normalise lines by stripping\n        // whitespace before checking equality. (This has an annoying interaction\n        // with newlineIsToken that requires special handling: if newlines get their\n        // own token, then we DON'T want to trim the *newline* tokens down to empty\n        // strings, since this would cause us to treat whitespace-only line content\n        // as equal to a separator between lines, which would be weird and\n        // inconsistent with the documented behavior of the options.)\n        if (options.ignoreWhitespace) {\n            if (!options.newlineIsToken || !left.includes('\\n')) {\n                left = left.trim();\n            }\n            if (!options.newlineIsToken || !right.includes('\\n')) {\n                right = right.trim();\n            }\n        }\n        else if (options.ignoreNewlineAtEof && !options.newlineIsToken) {\n            if (left.endsWith('\\n')) {\n                left = left.slice(0, -1);\n            }\n            if (right.endsWith('\\n')) {\n                right = right.slice(0, -1);\n            }\n        }\n        return super.equals(left, right, options);\n    }\n}\nexport const lineDiff = new LineDiff();\nexport function diffLines(oldStr, newStr, options) {\n    return lineDiff.diff(oldStr, newStr, options);\n}\nexport function diffTrimmedLines(oldStr, newStr, options) {\n    options = generateOptions(options, { ignoreWhitespace: true });\n    return lineDiff.diff(oldStr, newStr, options);\n}\n// Exported standalone so it can be used from jsonDiff too.\nexport function tokenize(value, options) {\n    if (options.stripTrailingCr) {\n        // remove one \\r before \\n to match GNU diff's --strip-trailing-cr behavior\n        value = value.replace(/\\r\\n/g, '\\n');\n    }\n    const retLines = [], linesAndNewlines = value.split(/(\\n|\\r\\n)/);\n    // Ignore the final empty token that occurs if the string ends with a new line\n    if (!linesAndNewlines[linesAndNewlines.length - 1]) {\n        linesAndNewlines.pop();\n    }\n    // Merge the content and line separators into single tokens\n    for (let i = 0; i < linesAndNewlines.length; i++) {\n        const line = linesAndNewlines[i];\n        if (i % 2 && !options.newlineIsToken) {\n            retLines[retLines.length - 1] += line;\n        }\n        else {\n            retLines.push(line);\n        }\n    }\n    return retLines;\n}\n","import Diff from './base.js';\nfunction isSentenceEndPunct(char) {\n    return char == '.' || char == '!' || char == '?';\n}\nclass SentenceDiff extends Diff {\n    tokenize(value) {\n        var _a;\n        // If in future we drop support for environments that don't support lookbehinds, we can replace\n        // this entire function with:\n        //     return value.split(/(?<=[.!?])(\\s+|$)/);\n        // but until then, for similar reasons to the trailingWs function in string.ts, we are forced\n        // to do this verbosely \"by hand\" instead of using a regex.\n        const result = [];\n        let tokenStartI = 0;\n        for (let i = 0; i < value.length; i++) {\n            if (i == value.length - 1) {\n                result.push(value.slice(tokenStartI));\n                break;\n            }\n            if (isSentenceEndPunct(value[i]) && value[i + 1].match(/\\s/)) {\n                // We've hit a sentence break - i.e. a punctuation mark followed by whitespace.\n                // We now want to push TWO tokens to the result:\n                // 1. the sentence\n                result.push(value.slice(tokenStartI, i + 1));\n                // 2. the whitespace\n                i = tokenStartI = i + 1;\n                while ((_a = value[i + 1]) === null || _a === void 0 ? void 0 : _a.match(/\\s/)) {\n                    i++;\n                }\n                result.push(value.slice(tokenStartI, i + 1));\n                // Then the next token (a sentence) starts on the character after the whitespace.\n                // (It's okay if this is off the end of the string - then the outer loop will terminate\n                // here anyway.)\n                tokenStartI = i + 1;\n            }\n        }\n        return result;\n    }\n}\nexport const sentenceDiff = new SentenceDiff();\nexport function diffSentences(oldStr, newStr, options) {\n    return sentenceDiff.diff(oldStr, newStr, options);\n}\n","import Diff from './base.js';\nclass CssDiff extends Diff {\n    tokenize(value) {\n        return value.split(/([{}:;,]|\\s+)/);\n    }\n}\nexport const cssDiff = new CssDiff();\nexport function diffCss(oldStr, newStr, options) {\n    return cssDiff.diff(oldStr, newStr, options);\n}\n","import Diff from './base.js';\nimport { tokenize } from './line.js';\nclass JsonDiff extends Diff {\n    constructor() {\n        super(...arguments);\n        this.tokenize = tokenize;\n    }\n    get useLongestToken() {\n        // Discriminate between two lines of pretty-printed, serialized JSON where one of them has a\n        // dangling comma and the other doesn't. Turns out including the dangling comma yields the nicest output:\n        return true;\n    }\n    castInput(value, options) {\n        const { undefinedReplacement, stringifyReplacer = (k, v) => typeof v === 'undefined' ? undefinedReplacement : v } = options;\n        return typeof value === 'string' ? value : JSON.stringify(canonicalize(value, null, null, stringifyReplacer), null, '  ');\n    }\n    equals(left, right, options) {\n        return super.equals(left.replace(/,([\\r\\n])/g, '$1'), right.replace(/,([\\r\\n])/g, '$1'), options);\n    }\n}\nexport const jsonDiff = new JsonDiff();\nexport function diffJson(oldStr, newStr, options) {\n    return jsonDiff.diff(oldStr, newStr, options);\n}\n// This function handles the presence of circular references by bailing out when encountering an\n// object that is already on the \"stack\" of items being processed. Accepts an optional replacer\nexport function canonicalize(obj, stack, replacementStack, replacer, key) {\n    stack = stack || [];\n    replacementStack = replacementStack || [];\n    if (replacer) {\n        obj = replacer(key === undefined ? '' : key, obj);\n    }\n    let i;\n    for (i = 0; i < stack.length; i += 1) {\n        if (stack[i] === obj) {\n            return replacementStack[i];\n        }\n    }\n    let canonicalizedObj;\n    if ('[object Array]' === Object.prototype.toString.call(obj)) {\n        stack.push(obj);\n        canonicalizedObj = new Array(obj.length);\n        replacementStack.push(canonicalizedObj);\n        for (i = 0; i < obj.length; i += 1) {\n            canonicalizedObj[i] = canonicalize(obj[i], stack, replacementStack, replacer, String(i));\n        }\n        stack.pop();\n        replacementStack.pop();\n        return canonicalizedObj;\n    }\n    if (obj && obj.toJSON) {\n        obj = obj.toJSON();\n    }\n    if (typeof obj === 'object' && obj !== null) {\n        stack.push(obj);\n        canonicalizedObj = {};\n        replacementStack.push(canonicalizedObj);\n        const sortedKeys = [];\n        let key;\n        for (key in obj) {\n            /* istanbul ignore else */\n            if (Object.prototype.hasOwnProperty.call(obj, key)) {\n                sortedKeys.push(key);\n            }\n        }\n        sortedKeys.sort();\n        for (i = 0; i < sortedKeys.length; i += 1) {\n            key = sortedKeys[i];\n            canonicalizedObj[key] = canonicalize(obj[key], stack, replacementStack, replacer, key);\n        }\n        stack.pop();\n        replacementStack.pop();\n    }\n    else {\n        canonicalizedObj = obj;\n    }\n    return canonicalizedObj;\n}\n","import Diff from './base.js';\nclass ArrayDiff extends Diff {\n    tokenize(value) {\n        return value.slice();\n    }\n    join(value) {\n        return value;\n    }\n    removeEmpty(value) {\n        return value;\n    }\n}\nexport const arrayDiff = new ArrayDiff();\nexport function diffArrays(oldArr, newArr, options) {\n    return arrayDiff.diff(oldArr, newArr, options);\n}\n","import { diffLines } from '../diff/line.js';\nexport const INCLUDE_HEADERS = {\n    includeIndex: true,\n    includeUnderline: true,\n    includeFileHeaders: true\n};\nexport const FILE_HEADERS_ONLY = {\n    includeIndex: false,\n    includeUnderline: false,\n    includeFileHeaders: true\n};\nexport const OMIT_HEADERS = {\n    includeIndex: false,\n    includeUnderline: false,\n    includeFileHeaders: false\n};\nexport function structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options) {\n    let optionsObj;\n    if (!options) {\n        optionsObj = {};\n    }\n    else if (typeof options === 'function') {\n        optionsObj = { callback: options };\n    }\n    else {\n        optionsObj = options;\n    }\n    if (typeof optionsObj.context === 'undefined') {\n        optionsObj.context = 4;\n    }\n    // We copy this into its own variable to placate TypeScript, which thinks\n    // optionsObj.context might be undefined in the callbacks below.\n    const context = optionsObj.context;\n    // @ts-expect-error (runtime check for something that is correctly a static type error)\n    if (optionsObj.newlineIsToken) {\n        throw new Error('newlineIsToken may not be used with patch-generation functions, only with diffing functions');\n    }\n    if (!optionsObj.callback) {\n        return diffLinesResultToPatch(diffLines(oldStr, newStr, optionsObj));\n    }\n    else {\n        const { callback } = optionsObj;\n        diffLines(oldStr, newStr, Object.assign(Object.assign({}, optionsObj), { callback: (diff) => {\n                const patch = diffLinesResultToPatch(diff);\n                // TypeScript is unhappy without the cast because it does not understand that `patch` may\n                // be undefined here only if `callback` is StructuredPatchCallbackAbortable:\n                callback(patch);\n            } }));\n    }\n    function diffLinesResultToPatch(diff) {\n        // STEP 1: Build up the patch with no \"\\" lines and with the arrays\n        //         of lines containing trailing newline characters. We'll tidy up later...\n        if (!diff) {\n            return;\n        }\n        diff.push({ value: '', lines: [] }); // Append an empty value to make cleanup easier\n        function contextLines(lines) {\n            return lines.map(function (entry) { return ' ' + entry; });\n        }\n        const hunks = [];\n        let oldRangeStart = 0, newRangeStart = 0, curRange = [], oldLine = 1, newLine = 1;\n        for (let i = 0; i < diff.length; i++) {\n            const current = diff[i], lines = current.lines || splitLines(current.value);\n            current.lines = lines;\n            if (current.added || current.removed) {\n                // If we have previous context, start with that\n                if (!oldRangeStart) {\n                    const prev = diff[i - 1];\n                    oldRangeStart = oldLine;\n                    newRangeStart = newLine;\n                    if (prev) {\n                        curRange = context > 0 ? contextLines(prev.lines.slice(-context)) : [];\n                        oldRangeStart -= curRange.length;\n                        newRangeStart -= curRange.length;\n                    }\n                }\n                // Output our changes\n                for (const line of lines) {\n                    curRange.push((current.added ? '+' : '-') + line);\n                }\n                // Track the updated file position\n                if (current.added) {\n                    newLine += lines.length;\n                }\n                else {\n                    oldLine += lines.length;\n                }\n            }\n            else {\n                // Identical context lines. Track line changes\n                if (oldRangeStart) {\n                    // Close out any changes that have been output (or join overlapping)\n                    if (lines.length <= context * 2 && i < diff.length - 2) {\n                        // Overlapping\n                        for (const line of contextLines(lines)) {\n                            curRange.push(line);\n                        }\n                    }\n                    else {\n                        // end the range and output\n                        const contextSize = Math.min(lines.length, context);\n                        for (const line of contextLines(lines.slice(0, contextSize))) {\n                            curRange.push(line);\n                        }\n                        const hunk = {\n                            oldStart: oldRangeStart,\n                            oldLines: (oldLine - oldRangeStart + contextSize),\n                            newStart: newRangeStart,\n                            newLines: (newLine - newRangeStart + contextSize),\n                            lines: curRange\n                        };\n                        hunks.push(hunk);\n                        oldRangeStart = 0;\n                        newRangeStart = 0;\n                        curRange = [];\n                    }\n                }\n                oldLine += lines.length;\n                newLine += lines.length;\n            }\n        }\n        // Step 2: eliminate the trailing `\\n` from each line of each hunk, and, where needed, add\n        //         \"\\".\n        for (const hunk of hunks) {\n            for (let i = 0; i < hunk.lines.length; i++) {\n                if (hunk.lines[i].endsWith('\\n')) {\n                    hunk.lines[i] = hunk.lines[i].slice(0, -1);\n                }\n                else {\n                    hunk.lines.splice(i + 1, 0, '\\\');\n                    i++; // Skip the line we just added, then continue iterating\n                }\n            }\n        }\n        return {\n            oldFileName: oldFileName, newFileName: newFileName,\n            oldHeader: oldHeader, newHeader: newHeader,\n            hunks: hunks\n        };\n    }\n}\n/**\n * creates a unified diff patch.\n * @param patch either a single structured patch object (as returned by `structuredPatch`) or an array of them (as returned by `parsePatch`)\n */\nexport function formatPatch(patch, headerOptions) {\n    if (!headerOptions) {\n        headerOptions = INCLUDE_HEADERS;\n    }\n    if (Array.isArray(patch)) {\n        if (patch.length > 1 && !headerOptions.includeFileHeaders) {\n            throw new Error('Cannot omit file headers on a multi-file patch. '\n                + '(The result would be unparseable; how would a tool trying to apply '\n                + 'the patch know which changes are to which file?)');\n        }\n        return patch.map(p => formatPatch(p, headerOptions)).join('\\n');\n    }\n    const ret = [];\n    if (headerOptions.includeIndex && patch.oldFileName == patch.newFileName) {\n        ret.push('Index: ' + patch.oldFileName);\n    }\n    if (headerOptions.includeUnderline) {\n        ret.push('===================================================================');\n    }\n    if (headerOptions.includeFileHeaders) {\n        ret.push('--- ' + patch.oldFileName + (typeof patch.oldHeader === 'undefined' ? '' : '\\t' + patch.oldHeader));\n        ret.push('+++ ' + patch.newFileName + (typeof patch.newHeader === 'undefined' ? '' : '\\t' + patch.newHeader));\n    }\n    for (let i = 0; i < patch.hunks.length; i++) {\n        const hunk = patch.hunks[i];\n        // Unified Diff Format quirk: If the chunk size is 0,\n        // the first number is one lower than one would expect.\n        // https://www.artima.com/weblogs/viewpost.jsp?thread=164293\n        if (hunk.oldLines === 0) {\n            hunk.oldStart -= 1;\n        }\n        if (hunk.newLines === 0) {\n            hunk.newStart -= 1;\n        }\n        ret.push('@@ -' + hunk.oldStart + ',' + hunk.oldLines\n            + ' +' + hunk.newStart + ',' + hunk.newLines\n            + ' @@');\n        for (const line of hunk.lines) {\n            ret.push(line);\n        }\n    }\n    return ret.join('\\n') + '\\n';\n}\nexport function createTwoFilesPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options) {\n    if (typeof options === 'function') {\n        options = { callback: options };\n    }\n    if (!(options === null || options === void 0 ? void 0 : options.callback)) {\n        const patchObj = structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options);\n        if (!patchObj) {\n            return;\n        }\n        return formatPatch(patchObj, options === null || options === void 0 ? void 0 : options.headerOptions);\n    }\n    else {\n        const { callback } = options;\n        structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, Object.assign(Object.assign({}, options), { callback: patchObj => {\n                if (!patchObj) {\n                    callback(undefined);\n                }\n                else {\n                    callback(formatPatch(patchObj, options.headerOptions));\n                }\n            } }));\n    }\n}\nexport function createPatch(fileName, oldStr, newStr, oldHeader, newHeader, options) {\n    return createTwoFilesPatch(fileName, fileName, oldStr, newStr, oldHeader, newHeader, options);\n}\n/**\n * Split `text` into an array of lines, including the trailing newline character (where present)\n */\nfunction splitLines(text) {\n    const hasTrailingNl = text.endsWith('\\n');\n    const result = text.split('\\n').map(line => line + '\\n');\n    if (hasTrailingNl) {\n        result.pop();\n    }\n    else {\n        result.push(result.pop().slice(0, -1));\n    }\n    return result;\n}\n","import{createRequire} from\"node:module\";const require=createRequire(import.meta.url);\nimport{c as a}from\"./chunk-NRSASXYY.js\";import{a as c}from\"./chunk-QIQMJJZ4.js\";import{a as u,b as p}from\"./chunk-QAYAQNCG.js\";import*as g from\"diff\";var b={name:\"diff\",summary:\"compare files line by line\",usage:\"diff [OPTION]... FILE1 FILE2\",options:[\"-u, --unified     output unified diff format (default)\",\"-q, --brief       report only whether files differ\",\"-s, --report-identical-files  report when files are the same\",\"-i, --ignore-case  ignore case differences\",\"    --help        display this help and exit\"]},C={unified:{short:\"u\",long:\"unified\",type:\"boolean\"},brief:{short:\"q\",long:\"brief\",type:\"boolean\"},reportSame:{short:\"s\",long:\"report-identical-files\",type:\"boolean\"},ignoreCase:{short:\"i\",long:\"ignore-case\",type:\"boolean\"}},L={name:\"diff\",async execute(d,e){if(p(d))return u(b);let t=c(\"diff\",d,C);if(!t.ok)return t.error;let m=t.result.flags.brief,h=t.result.flags.reportSame,y=t.result.flags.ignoreCase,l=t.result.positional;if(t.result.flags.unified,l.length<2)return{stdout:\"\",stderr:`diff: missing operand\n`,exitCode:2};let i,s,[r,o]=l;try{i=r===\"-\"?a(e.stdin):await e.fs.readFile(e.fs.resolvePath(e.cwd,r))}catch{return{stdout:\"\",stderr:`diff: ${r}: No such file or directory\n`,exitCode:2}}try{s=o===\"-\"?a(e.stdin):await e.fs.readFile(e.fs.resolvePath(e.cwd,o))}catch{return{stdout:\"\",stderr:`diff: ${o}: No such file or directory\n`,exitCode:2}}let f=i,n=s;return y&&(f=f.toLowerCase(),n=n.toLowerCase()),f===n?h?{stdout:`Files ${r} and ${o} are identical\n`,stderr:\"\",exitCode:0}:{stdout:\"\",stderr:\"\",exitCode:0}:m?{stdout:`Files ${r} and ${o} differ\n`,stderr:\"\",exitCode:1}:{stdout:g.createTwoFilesPatch(r,o,i,s,\"\",\"\",{context:3}),stderr:\"\",exitCode:1}}},P={name:\"diff\",flags:[{flag:\"-u\",type:\"boolean\"},{flag:\"-q\",type:\"boolean\"},{flag:\"-s\",type:\"boolean\"},{flag:\"-i\",type:\"boolean\"}],needsArgs:!0,minArgs:2};export{L as a,P as b};\n","import{createRequire} from\"node:module\";const require=createRequire(import.meta.url);\nimport{a,b}from\"./chunk-CBJVD2XA.js\";import\"./chunk-NRSASXYY.js\";import\"./chunk-QIQMJJZ4.js\";import\"./chunk-QAYAQNCG.js\";import\"./chunk-BZUGFHVS.js\";export{a as diffCommand,b as flagsForFuzzing};\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11],"mappings":";;;;;;AAAA,IAAqB,OAArB,MAA0B;CACtB,KAAK,QAAQ,QAEb,UAAU,CAAC,GAAG;EACV,IAAI;EACJ,IAAI,OAAO,YAAY,YAAY;GAC/B,WAAW;GACX,UAAU,CAAC;EACf,OACK,IAAI,cAAc,SACnB,WAAW,QAAQ;EAGvB,MAAM,YAAY,KAAK,UAAU,QAAQ,OAAO;EAChD,MAAM,YAAY,KAAK,UAAU,QAAQ,OAAO;EAChD,MAAM,YAAY,KAAK,YAAY,KAAK,SAAS,WAAW,OAAO,CAAC;EACpE,MAAM,YAAY,KAAK,YAAY,KAAK,SAAS,WAAW,OAAO,CAAC;EACpE,OAAO,KAAK,mBAAmB,WAAW,WAAW,SAAS,QAAQ;CAC1E;CACA,mBAAmB,WAAW,WAAW,SAAS,UAAU;EACxD,IAAI;EACJ,MAAM,QAAQ,UAAU;GACpB,QAAQ,KAAK,YAAY,OAAO,OAAO;GACvC,IAAI,UAAU;IACV,WAAW,WAAY;KAAE,SAAS,KAAK;IAAG,GAAG,CAAC;IAC9C;GACJ,OAEI,OAAO;EAEf;EACA,MAAM,SAAS,UAAU,QAAQ,SAAS,UAAU;EACpD,IAAI,aAAa;EACjB,IAAI,gBAAgB,SAAS;EAC7B,IAAI,QAAQ,iBAAiB,MACzB,gBAAgB,KAAK,IAAI,eAAe,QAAQ,aAAa;EAEjE,MAAM,oBAAoB,KAAK,QAAQ,aAAa,QAAQ,OAAO,KAAK,IAAI,KAAK;EACjF,MAAM,sBAAsB,KAAK,IAAI,IAAI;EACzC,MAAM,WAAW,CAAC;GAAE,QAAQ;GAAI,eAAe,KAAA;EAAU,CAAC;EAE1D,IAAI,SAAS,KAAK,cAAc,SAAS,IAAI,WAAW,WAAW,GAAG,OAAO;EAC7E,IAAI,SAAS,GAAG,SAAS,KAAK,UAAU,SAAS,KAAK,QAElD,OAAO,KAAK,KAAK,YAAY,SAAS,GAAG,eAAe,WAAW,SAAS,CAAC;EAmBjF,IAAI,wBAAwB,WAAW,wBAAwB;EAE/D,MAAM,uBAAuB;GACzB,KAAK,IAAI,eAAe,KAAK,IAAI,uBAAuB,CAAC,UAAU,GAAG,gBAAgB,KAAK,IAAI,uBAAuB,UAAU,GAAG,gBAAgB,GAAG;IAClJ,IAAI;IACJ,MAAM,aAAa,SAAS,eAAe,IAAI,UAAU,SAAS,eAAe;IACjF,IAAI,YAGA,SAAS,eAAe,KAAK,KAAA;IAEjC,IAAI,SAAS;IACb,IAAI,SAAS;KAET,MAAM,gBAAgB,QAAQ,SAAS;KACvC,SAAS,WAAW,KAAK,iBAAiB,gBAAgB;IAC9D;IACA,MAAM,YAAY,cAAc,WAAW,SAAS,IAAI;IACxD,IAAI,CAAC,UAAU,CAAC,WAAW;KAGvB,SAAS,gBAAgB,KAAA;KACzB;IACJ;IAIA,IAAI,CAAC,aAAc,UAAU,WAAW,SAAS,QAAQ,QACrD,WAAW,KAAK,UAAU,SAAS,MAAM,OAAO,GAAG,OAAO;SAG1D,WAAW,KAAK,UAAU,YAAY,OAAO,MAAM,GAAG,OAAO;IAEjE,SAAS,KAAK,cAAc,UAAU,WAAW,WAAW,cAAc,OAAO;IACjF,IAAI,SAAS,SAAS,KAAK,UAAU,SAAS,KAAK,QAE/C,OAAO,KAAK,KAAK,YAAY,SAAS,eAAe,WAAW,SAAS,CAAC,KAAK;SAE9E;KACD,SAAS,gBAAgB;KACzB,IAAI,SAAS,SAAS,KAAK,QACvB,wBAAwB,KAAK,IAAI,uBAAuB,eAAe,CAAC;KAE5E,IAAI,SAAS,KAAK,QACd,wBAAwB,KAAK,IAAI,uBAAuB,eAAe,CAAC;IAEhF;GACJ;GACA;EACJ;EAKA,IAAI,UACA,CAAC,SAAS,OAAO;GACb,WAAW,WAAY;IACnB,IAAI,aAAa,iBAAiB,KAAK,IAAI,IAAI,qBAC3C,OAAO,SAAS,KAAA,CAAS;IAE7B,IAAI,CAAC,eAAe,GAChB,KAAK;GAEb,GAAG,CAAC;EACR,GAAE;OAGF,OAAO,cAAc,iBAAiB,KAAK,IAAI,KAAK,qBAAqB;GACrE,MAAM,MAAM,eAAe;GAC3B,IAAI,KACA,OAAO;EAEf;CAER;CACA,UAAU,MAAM,OAAO,SAAS,WAAW,SAAS;EAChD,MAAM,OAAO,KAAK;EAClB,IAAI,QAAQ,CAAC,QAAQ,qBAAqB,KAAK,UAAU,SAAS,KAAK,YAAY,SAC/E,OAAO;GACH,QAAQ,KAAK,SAAS;GACtB,eAAe;IAAE,OAAO,KAAK,QAAQ;IAAU;IAAgB;IAAS,mBAAmB,KAAK;GAAkB;EACtH;OAGA,OAAO;GACH,QAAQ,KAAK,SAAS;GACtB,eAAe;IAAE,OAAO;IAAU;IAAgB;IAAS,mBAAmB;GAAK;EACvF;CAER;CACA,cAAc,UAAU,WAAW,WAAW,cAAc,SAAS;EACjE,MAAM,SAAS,UAAU,QAAQ,SAAS,UAAU;EACpD,IAAI,SAAS,SAAS,QAAQ,SAAS,SAAS,cAAc,cAAc;EAC5E,OAAO,SAAS,IAAI,UAAU,SAAS,IAAI,UAAU,KAAK,OAAO,UAAU,SAAS,IAAI,UAAU,SAAS,IAAI,OAAO,GAAG;GACrH;GACA;GACA;GACA,IAAI,QAAQ,mBACR,SAAS,gBAAgB;IAAE,OAAO;IAAG,mBAAmB,SAAS;IAAe,OAAO;IAAO,SAAS;GAAM;EAErH;EACA,IAAI,eAAe,CAAC,QAAQ,mBACxB,SAAS,gBAAgB;GAAE,OAAO;GAAa,mBAAmB,SAAS;GAAe,OAAO;GAAO,SAAS;EAAM;EAE3H,SAAS,SAAS;EAClB,OAAO;CACX;CACA,OAAO,MAAM,OAAO,SAAS;EACzB,IAAI,QAAQ,YACR,OAAO,QAAQ,WAAW,MAAM,KAAK;OAGrC,OAAO,SAAS,SACR,CAAC,CAAC,QAAQ,cAAc,KAAK,YAAY,MAAM,MAAM,YAAY;CAEjF;CACA,YAAY,OAAO;EACf,MAAM,MAAM,CAAC;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAC9B,IAAI,MAAM,IACN,IAAI,KAAK,MAAM,EAAE;EAGzB,OAAO;CACX;CAEA,UAAU,OAAO,SAAS;EACtB,OAAO;CACX;CAEA,SAAS,OAAO,SAAS;EACrB,OAAO,MAAM,KAAK,KAAK;CAC3B;CACA,KAAK,OAAO;EAKR,OAAO,MAAM,KAAK,EAAE;CACxB;CACA,YAAY,eAEZ,SAAS;EACL,OAAO;CACX;CACA,IAAI,kBAAkB;EAClB,OAAO;CACX;CACA,YAAY,eAAe,WAAW,WAAW;EAG7C,MAAM,aAAa,CAAC;EACpB,IAAI;EACJ,OAAO,eAAe;GAClB,WAAW,KAAK,aAAa;GAC7B,gBAAgB,cAAc;GAC9B,OAAO,cAAc;GACrB,gBAAgB;EACpB;EACA,WAAW,QAAQ;EACnB,MAAM,eAAe,WAAW;EAChC,IAAI,eAAe,GAAG,SAAS,GAAG,SAAS;EAC3C,OAAO,eAAe,cAAc,gBAAgB;GAChD,MAAM,YAAY,WAAW;GAC7B,IAAI,CAAC,UAAU,SAAS;IACpB,IAAI,CAAC,UAAU,SAAS,KAAK,iBAAiB;KAC1C,IAAI,QAAQ,UAAU,MAAM,QAAQ,SAAS,UAAU,KAAK;KAC5D,QAAQ,MAAM,IAAI,SAAU,OAAO,GAAG;MAClC,MAAM,WAAW,UAAU,SAAS;MACpC,OAAO,SAAS,SAAS,MAAM,SAAS,WAAW;KACvD,CAAC;KACD,UAAU,QAAQ,KAAK,KAAK,KAAK;IACrC,OAEI,UAAU,QAAQ,KAAK,KAAK,UAAU,MAAM,QAAQ,SAAS,UAAU,KAAK,CAAC;IAEjF,UAAU,UAAU;IAEpB,IAAI,CAAC,UAAU,OACX,UAAU,UAAU;GAE5B,OACK;IACD,UAAU,QAAQ,KAAK,KAAK,UAAU,MAAM,QAAQ,SAAS,UAAU,KAAK,CAAC;IAC7E,UAAU,UAAU;GACxB;EACJ;EACA,OAAO;CACX;AACJ;;;AC3PA,IAAM,gBAAN,cAA4B,KAAK,CACjC;AAC6B,IAAI,cAAc;;;ACH/C,SAAgB,oBAAoB,MAAM,MAAM;CAC5C,IAAI;CACJ,KAAK,IAAI,GAAG,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ,KAC5C,IAAI,KAAK,MAAM,KAAK,IAChB,OAAO,KAAK,MAAM,GAAG,CAAC;CAG9B,OAAO,KAAK,MAAM,GAAG,CAAC;AAC1B;AACA,SAAgB,oBAAoB,MAAM,MAAM;CAC5C,IAAI;CAIJ,IAAI,CAAC,QAAQ,CAAC,QAAQ,KAAK,KAAK,SAAS,MAAM,KAAK,KAAK,SAAS,IAC9D,OAAO;CAEX,KAAK,IAAI,GAAG,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ,KAC5C,IAAI,KAAK,KAAK,UAAU,IAAI,OAAO,KAAK,KAAK,UAAU,IAAI,KACvD,OAAO,KAAK,MAAM,CAAC,CAAC;CAG5B,OAAO,KAAK,MAAM,CAAC,CAAC;AACxB;AACA,SAAgB,cAAc,QAAQ,WAAW,WAAW;CACxD,IAAI,OAAO,MAAM,GAAG,UAAU,MAAM,KAAK,WACrC,MAAM,MAAM,UAAU,KAAK,UAAU,MAAM,EAAE,6BAA6B,KAAK,UAAU,SAAS,EAAE,gBAAgB;CAExH,OAAO,YAAY,OAAO,MAAM,UAAU,MAAM;AACpD;AACA,SAAgB,cAAc,QAAQ,WAAW,WAAW;CACxD,IAAI,CAAC,WACD,OAAO,SAAS;CAEpB,IAAI,OAAO,MAAM,CAAC,UAAU,MAAM,KAAK,WACnC,MAAM,MAAM,UAAU,KAAK,UAAU,MAAM,EAAE,2BAA2B,KAAK,UAAU,SAAS,EAAE,gBAAgB;CAEtH,OAAO,OAAO,MAAM,GAAG,CAAC,UAAU,MAAM,IAAI;AAChD;AACA,SAAgB,aAAa,QAAQ,WAAW;CAC5C,OAAO,cAAc,QAAQ,WAAW,EAAE;AAC9C;AACA,SAAgB,aAAa,QAAQ,WAAW;CAC5C,OAAO,cAAc,QAAQ,WAAW,EAAE;AAC9C;AACA,SAAgB,eAAe,SAAS,SAAS;CAC7C,OAAO,QAAQ,MAAM,GAAG,aAAa,SAAS,OAAO,CAAC;AAC1D;AAEA,SAAS,aAAa,GAAG,GAAG;CAExB,IAAI,SAAS;CACb,IAAI,EAAE,SAAS,EAAE,QACb,SAAS,EAAE,SAAS,EAAE;CAE1B,IAAI,OAAO,EAAE;CACb,IAAI,EAAE,SAAS,EAAE,QACb,OAAO,EAAE;CAKb,MAAM,MAAM,MAAM,IAAI;CACtB,IAAI,IAAI;CACR,IAAI,KAAK;CACT,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;EAC3B,IAAI,EAAE,MAAM,EAAE,IACV,IAAI,KAAK,IAAI;OAGb,IAAI,KAAK;EAEb,OAAO,IAAI,KAAK,EAAE,MAAM,EAAE,IACtB,IAAI,IAAI;EAEZ,IAAI,EAAE,MAAM,EAAE,IACV;CAER;CAEA,IAAI;CACJ,KAAK,IAAI,IAAI,QAAQ,IAAI,EAAE,QAAQ,KAAK;EACpC,OAAO,IAAI,KAAK,EAAE,MAAM,EAAE,IACtB,IAAI,IAAI;EAEZ,IAAI,EAAE,MAAM,EAAE,IACV;CAER;CACA,OAAO;AACX;;;;;;;;;;;AAuBA,SAAgB,QAAQ,QAAQ,WAAW;CACvC,MAAM,QAAQ,CAAC;CACf,KAAK,MAAM,cAAc,MAAM,KAAK,UAAU,QAAQ,MAAM,CAAC,GAAG;EAC5D,MAAM,UAAU,WAAW;EAC3B,IAAI,MAAM,UAAW,KAAM,KAAK,MAAM,MAAM,SAAS,EAAE,KAAM,KAAM,KAAK,OAAO,GAC3E,MAAM,MAAM,SAAS,MAAM;OAG3B,MAAM,KAAK,OAAO;CAE1B;CACA,OAAO;AACX;AAcA,SAAgB,WAAW,QAAQ,WAAW;CAC1C,IAAI,WACA,OAAO,qBAAqB,QAAQ,SAAS,EAAE;CAanD,IAAI;CACJ,KAAK,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAChC,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,GACrB;CAGR,OAAO,OAAO,UAAU,IAAI,CAAC;AACjC;AACA,SAAgB,UAAU,QAAQ,WAAW;CACzC,IAAI,WACA,OAAO,qBAAqB,QAAQ,SAAS,EAAE;CAGnD,MAAM,QAAQ,OAAO,MAAM,MAAM;CACjC,OAAO,QAAQ,MAAM,KAAK;AAC9B;AACA,SAAgB,qBAAqB,QAAQ,WAAW;CACpD,IAAI,CAAC,WACD,OAAO,CAAC,UAAU,MAAM,GAAG,WAAW,MAAM,CAAC;CAEjD,IAAI,UAAU,gBAAgB,EAAE,eAAe,QAC3C,MAAM,IAAI,MAAM,0DAAwD;CAE5E,MAAM,WAAW,QAAQ,QAAQ,SAAS;CAC1C,MAAM,WAAW,SAAS;CAC1B,MAAM,UAAU,SAAS,SAAS,SAAS;CAG3C,OAAO,CAFO,KAAM,KAAK,QAAQ,IAAI,WAAW,IAClC,KAAM,KAAK,OAAO,IAAI,UAAU,EAC5B;AACtB;;;ACjKA,MAAM,oBAAoB;AAyB1B,MAAM,8BAA8B,IAAI,OAAO,IAAI,kBAAkB,YAAY,kBAAkB,IAAI,IAAI;AAC3G,IAAM,WAAN,cAAuB,KAAK;CACxB,OAAO,MAAM,OAAO,SAAS;EACzB,IAAI,QAAQ,YAAY;GACpB,OAAO,KAAK,YAAY;GACxB,QAAQ,MAAM,YAAY;EAC9B;EACA,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK;CACtC;CACA,SAAS,OAAO,UAAU,CAAC,GAAG;EAC1B,IAAI;EACJ,IAAI,QAAQ,eAAe;GACvB,MAAM,YAAY,QAAQ;GAC1B,IAAI,UAAU,gBAAgB,EAAE,eAAe,QAC3C,MAAM,IAAI,MAAM,0DAAwD;GAO5E,QAAQ,QAAQ,OAAO,SAAS;EACpC,OAEI,QAAQ,MAAM,MAAM,2BAA2B,KAAK,CAAC;EAEzD,MAAM,SAAS,CAAC;EAChB,IAAI,WAAW;EACf,MAAM,SAAQ,SAAQ;GAClB,IAAK,KAAM,KAAK,IAAI,GAChB,IAAI,YAAY,MACZ,OAAO,KAAK,IAAI;QAGhB,OAAO,KAAK,OAAO,IAAI,IAAI,IAAI;QAGlC,IAAI,YAAY,QAAS,KAAM,KAAK,QAAQ,GAC7C,IAAI,OAAO,OAAO,SAAS,MAAM,UAC7B,OAAO,KAAK,OAAO,IAAI,IAAI,IAAI;QAG/B,OAAO,KAAK,WAAW,IAAI;QAI/B,OAAO,KAAK,IAAI;GAEpB,WAAW;EACf,CAAC;EACD,OAAO;CACX;CACA,KAAK,QAAQ;EAMT,OAAO,OAAO,KAAK,OAAO,MAAM;GAC5B,IAAI,KAAK,GACL,OAAO;QAGP,OAAO,MAAM,QAAS,QAAS,EAAE;EAEzC,CAAC,EAAE,KAAK,EAAE;CACd;CACA,YAAY,SAAS,SAAS;EAC1B,IAAI,CAAC,WAAW,QAAQ,mBACpB,OAAO;EAEX,IAAI,WAAW;EAGf,IAAI,YAAY;EAChB,IAAI,WAAW;EACf,QAAQ,SAAQ,WAAU;GACtB,IAAI,OAAO,OACP,YAAY;QAEX,IAAI,OAAO,SACZ,WAAW;QAEV;IACD,IAAI,aAAa,UACb,gCAAgC,UAAU,UAAU,WAAW,QAAQ,QAAQ,aAAa;IAEhG,WAAW;IACX,YAAY;IACZ,WAAW;GACf;EACJ,CAAC;EACD,IAAI,aAAa,UACb,gCAAgC,UAAU,UAAU,WAAW,MAAM,QAAQ,aAAa;EAE9F,OAAO;CACX;AACJ;AACwB,IAAI,SAAS;AAWrC,SAAS,gCAAgC,WAAW,UAAU,WAAW,SAAS,WAAW;CA0CzF,IAAI,YAAY,WAAW;EACvB,MAAM,CAAC,aAAa,eAAe,qBAAqB,SAAS,OAAO,SAAS;EACjF,MAAM,CAAC,aAAa,eAAe,qBAAqB,UAAU,OAAO,SAAS;EAClF,IAAI,WAAW;GACX,MAAM,iBAAiB,oBAAoB,aAAa,WAAW;GACnE,UAAU,QAAQ,cAAc,UAAU,OAAO,aAAa,cAAc;GAC5E,SAAS,QAAQ,aAAa,SAAS,OAAO,cAAc;GAC5D,UAAU,QAAQ,aAAa,UAAU,OAAO,cAAc;EAClE;EACA,IAAI,SAAS;GACT,MAAM,iBAAiB,oBAAoB,aAAa,WAAW;GACnE,QAAQ,QAAQ,cAAc,QAAQ,OAAO,aAAa,cAAc;GACxE,SAAS,QAAQ,aAAa,SAAS,OAAO,cAAc;GAC5D,UAAU,QAAQ,aAAa,UAAU,OAAO,cAAc;EAClE;CACJ,OACK,IAAI,WAAW;EAOhB,IAAI,WAAW;GACX,MAAM,KAAK,UAAU,UAAU,OAAO,SAAS;GAC/C,UAAU,QAAQ,UAAU,MAAM,UAAU,GAAG,MAAM;EACzD;EACA,IAAI,SAAS;GACT,MAAM,KAAK,UAAU,QAAQ,OAAO,SAAS;GAC7C,QAAQ,QAAQ,QAAQ,MAAM,UAAU,GAAG,MAAM;EACrD;CAEJ,OACK,IAAI,aAAa,SAAS;EAC3B,MAAM,YAAY,UAAU,QAAQ,OAAO,SAAS,GAAG,CAAC,YAAY,YAAY,qBAAqB,SAAS,OAAO,SAAS;EAG9H,MAAM,aAAa,oBAAoB,WAAW,UAAU;EAC5D,SAAS,QAAQ,aAAa,SAAS,OAAO,UAAU;EAIxD,MAAM,WAAW,oBAAoB,aAAa,WAAW,UAAU,GAAG,QAAQ;EAClF,SAAS,QAAQ,aAAa,SAAS,OAAO,QAAQ;EACtD,QAAQ,QAAQ,cAAc,QAAQ,OAAO,WAAW,QAAQ;EAGhE,UAAU,QAAQ,cAAc,UAAU,OAAO,WAAW,UAAU,MAAM,GAAG,UAAU,SAAS,SAAS,MAAM,CAAC;CACtH,OACK,IAAI,SAAS;EAId,MAAM,kBAAkB,UAAU,QAAQ,OAAO,SAAS;EAE1D,MAAM,UAAU,eADS,WAAW,SAAS,OAAO,SACN,GAAG,eAAe;EAChE,SAAS,QAAQ,aAAa,SAAS,OAAO,OAAO;CACzD,OACK,IAAI,WAAW;EAMhB,MAAM,UAAU,eAFU,WAAW,UAAU,OAAO,SAEP,GADtB,UAAU,SAAS,OAAO,SACc,CAAC;EAClE,SAAS,QAAQ,aAAa,SAAS,OAAO,OAAO;CACzD;AACJ;AACA,IAAM,qBAAN,cAAiC,KAAK;CAClC,SAAS,OAAO;EAMZ,MAAM,QAAQ,IAAI,OAAO,cAAc,kBAAkB,qBAAqB,kBAAkB,IAAI,IAAI;EACxG,OAAO,MAAM,MAAM,KAAK,KAAK,CAAC;CAClC;AACJ;AACkC,IAAI,mBAAmB;;;ACnRzD,IAAM,WAAN,cAAuB,KAAK;CACxB,cAAc;EACV,MAAM,GAAG,SAAS;EAClB,KAAK,WAAW;CACpB;CACA,OAAO,MAAM,OAAO,SAAS;EAQzB,IAAI,QAAQ,kBAAkB;GAC1B,IAAI,CAAC,QAAQ,kBAAkB,CAAC,KAAK,SAAS,IAAI,GAC9C,OAAO,KAAK,KAAK;GAErB,IAAI,CAAC,QAAQ,kBAAkB,CAAC,MAAM,SAAS,IAAI,GAC/C,QAAQ,MAAM,KAAK;EAE3B,OACK,IAAI,QAAQ,sBAAsB,CAAC,QAAQ,gBAAgB;GAC5D,IAAI,KAAK,SAAS,IAAI,GAClB,OAAO,KAAK,MAAM,GAAG,EAAE;GAE3B,IAAI,MAAM,SAAS,IAAI,GACnB,QAAQ,MAAM,MAAM,GAAG,EAAE;EAEjC;EACA,OAAO,MAAM,OAAO,MAAM,OAAO,OAAO;CAC5C;AACJ;AACA,MAAa,WAAW,IAAI,SAAS;AACrC,SAAgB,UAAU,QAAQ,QAAQ,SAAS;CAC/C,OAAO,SAAS,KAAK,QAAQ,QAAQ,OAAO;AAChD;AAMA,SAAgB,SAAS,OAAO,SAAS;CACrC,IAAI,QAAQ,iBAER,QAAQ,MAAM,QAAQ,SAAS,IAAI;CAEvC,MAAM,WAAW,CAAC,GAAG,mBAAmB,MAAM,MAAM,WAAW;CAE/D,IAAI,CAAC,iBAAiB,iBAAiB,SAAS,IAC5C,iBAAiB,IAAI;CAGzB,KAAK,IAAI,IAAI,GAAG,IAAI,iBAAiB,QAAQ,KAAK;EAC9C,MAAM,OAAO,iBAAiB;EAC9B,IAAI,IAAI,KAAK,CAAC,QAAQ,gBAClB,SAAS,SAAS,SAAS,MAAM;OAGjC,SAAS,KAAK,IAAI;CAE1B;CACA,OAAO;AACX;;;AC/DA,SAAS,mBAAmB,MAAM;CAC9B,OAAO,QAAQ,OAAO,QAAQ,OAAO,QAAQ;AACjD;AACA,IAAM,eAAN,cAA2B,KAAK;CAC5B,SAAS,OAAO;EACZ,IAAI;EAMJ,MAAM,SAAS,CAAC;EAChB,IAAI,cAAc;EAClB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACnC,IAAI,KAAK,MAAM,SAAS,GAAG;IACvB,OAAO,KAAK,MAAM,MAAM,WAAW,CAAC;IACpC;GACJ;GACA,IAAI,mBAAmB,MAAM,EAAE,KAAK,MAAM,IAAI,GAAG,MAAM,IAAI,GAAG;IAI1D,OAAO,KAAK,MAAM,MAAM,aAAa,IAAI,CAAC,CAAC;IAE3C,IAAI,cAAc,IAAI;IACtB,QAAQ,KAAK,MAAM,IAAI,QAAQ,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,MAAM,IAAI,GACzE;IAEJ,OAAO,KAAK,MAAM,MAAM,aAAa,IAAI,CAAC,CAAC;IAI3C,cAAc,IAAI;GACtB;EACJ;EACA,OAAO;CACX;AACJ;AAC4B,IAAI,aAAa;;;ACtC7C,IAAM,UAAN,cAAsB,KAAK;CACvB,SAAS,OAAO;EACZ,OAAO,MAAM,MAAM,eAAe;CACtC;AACJ;AACuB,IAAI,QAAQ;;;ACJnC,IAAM,WAAN,cAAuB,KAAK;CACxB,cAAc;EACV,MAAM,GAAG,SAAS;EAClB,KAAK,WAAW;CACpB;CACA,IAAI,kBAAkB;EAGlB,OAAO;CACX;CACA,UAAU,OAAO,SAAS;EACtB,MAAM,EAAE,sBAAsB,qBAAqB,GAAG,MAAM,OAAO,MAAM,cAAc,uBAAuB,MAAM;EACpH,OAAO,OAAO,UAAU,WAAW,QAAQ,KAAK,UAAU,aAAa,OAAO,MAAM,MAAM,iBAAiB,GAAG,MAAM,IAAI;CAC5H;CACA,OAAO,MAAM,OAAO,SAAS;EACzB,OAAO,MAAM,OAAO,KAAK,QAAQ,cAAc,IAAI,GAAG,MAAM,QAAQ,cAAc,IAAI,GAAG,OAAO;CACpG;AACJ;AACwB,IAAI,SAAS;AAMrC,SAAgB,aAAa,KAAK,OAAO,kBAAkB,UAAU,KAAK;CACtE,QAAQ,SAAS,CAAC;CAClB,mBAAmB,oBAAoB,CAAC;CACxC,IAAI,UACA,MAAM,SAAS,QAAQ,KAAA,IAAY,KAAK,KAAK,GAAG;CAEpD,IAAI;CACJ,KAAK,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAC/B,IAAI,MAAM,OAAO,KACb,OAAO,iBAAiB;CAGhC,IAAI;CACJ,IAAI,qBAAqB,OAAO,UAAU,SAAS,KAAK,GAAG,GAAG;EAC1D,MAAM,KAAK,GAAG;EACd,mBAAmB,IAAI,MAAM,IAAI,MAAM;EACvC,iBAAiB,KAAK,gBAAgB;EACtC,KAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,GAC7B,iBAAiB,KAAK,aAAa,IAAI,IAAI,OAAO,kBAAkB,UAAU,OAAO,CAAC,CAAC;EAE3F,MAAM,IAAI;EACV,iBAAiB,IAAI;EACrB,OAAO;CACX;CACA,IAAI,OAAO,IAAI,QACX,MAAM,IAAI,OAAO;CAErB,IAAI,OAAO,QAAQ,YAAY,QAAQ,MAAM;EACzC,MAAM,KAAK,GAAG;EACd,mBAAmB,CAAC;EACpB,iBAAiB,KAAK,gBAAgB;EACtC,MAAM,aAAa,CAAC;EACpB,IAAI;EACJ,KAAK,OAAO;;EAER,IAAI,OAAO,UAAU,eAAe,KAAK,KAAK,GAAG,GAC7C,WAAW,KAAK,GAAG;EAG3B,WAAW,KAAK;EAChB,KAAK,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK,GAAG;GACvC,MAAM,WAAW;GACjB,iBAAiB,OAAO,aAAa,IAAI,MAAM,OAAO,kBAAkB,UAAU,GAAG;EACzF;EACA,MAAM,IAAI;EACV,iBAAiB,IAAI;CACzB,OAEI,mBAAmB;CAEvB,OAAO;AACX;;;AC5EA,IAAM,YAAN,cAAwB,KAAK;CACzB,SAAS,OAAO;EACZ,OAAO,MAAM,MAAM;CACvB;CACA,KAAK,OAAO;EACR,OAAO;CACX;CACA,YAAY,OAAO;EACf,OAAO;CACX;AACJ;AACyB,IAAI,UAAU;;;ACXvC,MAAa,kBAAkB;CAC3B,cAAc;CACd,kBAAkB;CAClB,oBAAoB;AACxB;AAWA,SAAgB,gBAAgB,aAAa,aAAa,QAAQ,QAAQ,WAAW,WAAW,SAAS;CACrG,IAAI;CACJ,IAAI,CAAC,SACD,aAAa,CAAC;MAEb,IAAI,OAAO,YAAY,YACxB,aAAa,EAAE,UAAU,QAAQ;MAGjC,aAAa;CAEjB,IAAI,OAAO,WAAW,YAAY,aAC9B,WAAW,UAAU;CAIzB,MAAM,UAAU,WAAW;CAE3B,IAAI,WAAW,gBACX,MAAM,IAAI,MAAM,6FAA6F;CAEjH,IAAI,CAAC,WAAW,UACZ,OAAO,uBAAuB,UAAU,QAAQ,QAAQ,UAAU,CAAC;MAElE;EACD,MAAM,EAAE,aAAa;EACrB,UAAU,QAAQ,QAAQ,OAAO,OAAO,OAAO,OAAO,CAAC,GAAG,UAAU,GAAG,EAAE,WAAW,SAAS;GAIrF,SAHc,uBAAuB,IAGxB,CAAC;EAClB,EAAE,CAAC,CAAC;CACZ;CACA,SAAS,uBAAuB,MAAM;EAGlC,IAAI,CAAC,MACD;EAEJ,KAAK,KAAK;GAAE,OAAO;GAAI,OAAO,CAAC;EAAE,CAAC;EAClC,SAAS,aAAa,OAAO;GACzB,OAAO,MAAM,IAAI,SAAU,OAAO;IAAE,OAAO,MAAM;GAAO,CAAC;EAC7D;EACA,MAAM,QAAQ,CAAC;EACf,IAAI,gBAAgB,GAAG,gBAAgB,GAAG,WAAW,CAAC,GAAG,UAAU,GAAG,UAAU;EAChF,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GAClC,MAAM,UAAU,KAAK,IAAI,QAAQ,QAAQ,SAAS,WAAW,QAAQ,KAAK;GAC1E,QAAQ,QAAQ;GAChB,IAAI,QAAQ,SAAS,QAAQ,SAAS;IAElC,IAAI,CAAC,eAAe;KAChB,MAAM,OAAO,KAAK,IAAI;KACtB,gBAAgB;KAChB,gBAAgB;KAChB,IAAI,MAAM;MACN,WAAW,UAAU,IAAI,aAAa,KAAK,MAAM,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC;MACrE,iBAAiB,SAAS;MAC1B,iBAAiB,SAAS;KAC9B;IACJ;IAEA,KAAK,MAAM,QAAQ,OACf,SAAS,MAAM,QAAQ,QAAQ,MAAM,OAAO,IAAI;IAGpD,IAAI,QAAQ,OACR,WAAW,MAAM;SAGjB,WAAW,MAAM;GAEzB,OACK;IAED,IAAI,eAEA,IAAI,MAAM,UAAU,UAAU,KAAK,IAAI,KAAK,SAAS,GAEjD,KAAK,MAAM,QAAQ,aAAa,KAAK,GACjC,SAAS,KAAK,IAAI;SAGrB;KAED,MAAM,cAAc,KAAK,IAAI,MAAM,QAAQ,OAAO;KAClD,KAAK,MAAM,QAAQ,aAAa,MAAM,MAAM,GAAG,WAAW,CAAC,GACvD,SAAS,KAAK,IAAI;KAEtB,MAAM,OAAO;MACT,UAAU;MACV,UAAW,UAAU,gBAAgB;MACrC,UAAU;MACV,UAAW,UAAU,gBAAgB;MACrC,OAAO;KACX;KACA,MAAM,KAAK,IAAI;KACf,gBAAgB;KAChB,gBAAgB;KAChB,WAAW,CAAC;IAChB;IAEJ,WAAW,MAAM;IACjB,WAAW,MAAM;GACrB;EACJ;EAGA,KAAK,MAAM,QAAQ,OACf,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,KACnC,IAAI,KAAK,MAAM,GAAG,SAAS,IAAI,GAC3B,KAAK,MAAM,KAAK,KAAK,MAAM,GAAG,MAAM,GAAG,EAAE;OAExC;GACD,KAAK,MAAM,OAAO,IAAI,GAAG,GAAG,8BAA8B;GAC1D;EACJ;EAGR,OAAO;GACU;GAA0B;GAC5B;GAAsB;GAC1B;EACX;CACJ;AACJ;;;;;AAKA,SAAgB,YAAY,OAAO,eAAe;CAC9C,IAAI,CAAC,eACD,gBAAgB;CAEpB,IAAI,MAAM,QAAQ,KAAK,GAAG;EACtB,IAAI,MAAM,SAAS,KAAK,CAAC,cAAc,oBACnC,MAAM,IAAI,MAAM,qKAEwC;EAE5D,OAAO,MAAM,KAAI,MAAK,YAAY,GAAG,aAAa,CAAC,EAAE,KAAK,IAAI;CAClE;CACA,MAAM,MAAM,CAAC;CACb,IAAI,cAAc,gBAAgB,MAAM,eAAe,MAAM,aACzD,IAAI,KAAK,YAAY,MAAM,WAAW;CAE1C,IAAI,cAAc,kBACd,IAAI,KAAK,qEAAqE;CAElF,IAAI,cAAc,oBAAoB;EAClC,IAAI,KAAK,SAAS,MAAM,eAAe,OAAO,MAAM,cAAc,cAAc,KAAK,MAAO,MAAM,UAAU;EAC5G,IAAI,KAAK,SAAS,MAAM,eAAe,OAAO,MAAM,cAAc,cAAc,KAAK,MAAO,MAAM,UAAU;CAChH;CACA,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,MAAM,QAAQ,KAAK;EACzC,MAAM,OAAO,MAAM,MAAM;EAIzB,IAAI,KAAK,aAAa,GAClB,KAAK,YAAY;EAErB,IAAI,KAAK,aAAa,GAClB,KAAK,YAAY;EAErB,IAAI,KAAK,SAAS,KAAK,WAAW,MAAM,KAAK,WACvC,OAAO,KAAK,WAAW,MAAM,KAAK,WAClC,KAAK;EACX,KAAK,MAAM,QAAQ,KAAK,OACpB,IAAI,KAAK,IAAI;CAErB;CACA,OAAO,IAAI,KAAK,IAAI,IAAI;AAC5B;AACA,SAAgB,oBAAoB,aAAa,aAAa,QAAQ,QAAQ,WAAW,WAAW,SAAS;CACzG,IAAI,OAAO,YAAY,YACnB,UAAU,EAAE,UAAU,QAAQ;CAElC,IAAI,EAAE,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,WAAW;EACvE,MAAM,WAAW,gBAAgB,aAAa,aAAa,QAAQ,QAAQ,WAAW,WAAW,OAAO;EACxG,IAAI,CAAC,UACD;EAEJ,OAAO,YAAY,UAAU,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,aAAa;CACxG,OACK;EACD,MAAM,EAAE,aAAa;EACrB,gBAAgB,aAAa,aAAa,QAAQ,QAAQ,WAAW,WAAW,OAAO,OAAO,OAAO,OAAO,CAAC,GAAG,OAAO,GAAG,EAAE,WAAU,aAAY;GAC1I,IAAI,CAAC,UACD,SAAS,KAAA,CAAS;QAGlB,SAAS,YAAY,UAAU,QAAQ,aAAa,CAAC;EAE7D,EAAE,CAAC,CAAC;CACZ;AACJ;;;;AAOA,SAAS,WAAW,MAAM;CACtB,MAAM,gBAAgB,KAAK,SAAS,IAAI;CACxC,MAAM,SAAS,KAAK,MAAM,IAAI,EAAE,KAAI,SAAQ,OAAO,IAAI;CACvD,IAAI,eACA,OAAO,IAAI;MAGX,OAAO,KAAK,OAAO,IAAI,EAAE,MAAM,GAAG,EAAE,CAAC;CAEzC,OAAO;AACX;;;4ECnOmF;AACmE,IAAI,IAAE;CAAC,MAAK;CAAO,SAAQ;CAA6B,OAAM;CAA+B,SAAQ;EAAC;EAAyD;EAAqD;EAA+D;EAA6C;CAA8C;AAAC,GAAE,IAAE;CAAC,SAAQ;EAAC,OAAM;EAAI,MAAK;EAAU,MAAK;CAAS;CAAE,OAAM;EAAC,OAAM;EAAI,MAAK;EAAQ,MAAK;CAAS;CAAE,YAAW;EAAC,OAAM;EAAI,MAAK;EAAyB,MAAK;CAAS;CAAE,YAAW;EAAC,OAAM;EAAI,MAAK;EAAc,MAAK;CAAS;AAAC,GAAE,IAAE;CAAC,MAAK;CAAO,MAAM,QAAQ,GAAE,GAAE;EAAC,IAAGA,uBAAAA,EAAE,CAAC,GAAE,OAAOC,uBAAAA,EAAE,CAAC;EAAE,IAAI,IAAEC,uBAAAA,EAAE,QAAO,GAAE,CAAC;EAAE,IAAG,CAAC,EAAE,IAAG,OAAO,EAAE;EAAM,IAAI,IAAE,EAAE,OAAO,MAAM,OAAM,IAAE,EAAE,OAAO,MAAM,YAAW,IAAE,EAAE,OAAO,MAAM,YAAW,IAAE,EAAE,OAAO;EAAW,IAAG,EAAE,OAAO,MAAM,SAAQ,EAAE,SAAO,GAAE,OAAM;GAAC,QAAO;GAAG,QAAO;;GAC9+B,UAAS;EAAC;EAAE,IAAI,GAAEC,KAAE,CAAC,GAAEC,OAAG;EAAE,IAAG;GAAC,IAAE,MAAI,MAAIC,cAAAA,EAAE,EAAE,KAAK,IAAE,MAAM,EAAE,GAAG,SAAS,EAAE,GAAG,YAAY,EAAE,KAAI,CAAC,CAAC;EAAC,QAAM;GAAC,OAAM;IAAC,QAAO;IAAG,QAAO,SAAS,EAAE;;IAC7I,UAAS;GAAC;EAAC;EAAC,IAAG;GAAC,MAAED,QAAI,MAAIC,cAAAA,EAAE,EAAE,KAAK,IAAE,MAAM,EAAE,GAAG,SAAS,EAAE,GAAG,YAAY,EAAE,KAAID,GAAC,CAAC;EAAC,QAAM;GAAC,OAAM;IAAC,QAAO;IAAG,QAAO,SAASA,IAAE;;IAC7H,UAAS;GAAC;EAAC;EAAC,IAAI,IAAE,GAAE,IAAED;EAAE,OAAO,MAAI,IAAE,EAAE,YAAY,GAAE,IAAE,EAAE,YAAY,IAAG,MAAI,IAAE,IAAE;GAAC,QAAO,SAAS,EAAE,OAAOC,IAAE;;GAC5G,QAAO;GAAG,UAAS;EAAC,IAAE;GAAC,QAAO;GAAG,QAAO;GAAG,UAAS;EAAC,IAAE,IAAE;GAAC,QAAO,SAAS,EAAE,OAAOA,IAAE;;GACrF,QAAO;GAAG,UAAS;EAAC,IAAE;GAAC,QAAOE,oBAAsB,GAAEF,KAAE,GAAED,KAAE,IAAG,IAAG,EAAC,SAAQ,EAAC,CAAC;GAAE,QAAO;GAAG,UAAS;EAAC;CAAC;AAAC;;;4ECNpB"}
+{"version":3,"file":"diff-MWJFIG7X-DkKded0v.cjs","names":["p","u","c","s","o","a","g.createTwoFilesPatch"],"sources":["../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/base.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/character.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/util/string.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/word.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/line.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/sentence.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/css.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/json.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/diff/array.js","../../../node_modules/.pnpm/diff@8.0.4/node_modules/diff/libesm/patch/create.js","../../../node_modules/.pnpm/just-bash@3.0.1/node_modules/just-bash/dist/bundle/chunks/chunk-CBJVD2XA.js","../../../node_modules/.pnpm/just-bash@3.0.1/node_modules/just-bash/dist/bundle/chunks/diff-MWJFIG7X.js"],"sourcesContent":["export default class Diff {\n    diff(oldStr, newStr, \n    // Type below is not accurate/complete - see above for full possibilities - but it compiles\n    options = {}) {\n        let callback;\n        if (typeof options === 'function') {\n            callback = options;\n            options = {};\n        }\n        else if ('callback' in options) {\n            callback = options.callback;\n        }\n        // Allow subclasses to massage the input prior to running\n        const oldString = this.castInput(oldStr, options);\n        const newString = this.castInput(newStr, options);\n        const oldTokens = this.removeEmpty(this.tokenize(oldString, options));\n        const newTokens = this.removeEmpty(this.tokenize(newString, options));\n        return this.diffWithOptionsObj(oldTokens, newTokens, options, callback);\n    }\n    diffWithOptionsObj(oldTokens, newTokens, options, callback) {\n        var _a;\n        const done = (value) => {\n            value = this.postProcess(value, options);\n            if (callback) {\n                setTimeout(function () { callback(value); }, 0);\n                return undefined;\n            }\n            else {\n                return value;\n            }\n        };\n        const newLen = newTokens.length, oldLen = oldTokens.length;\n        let editLength = 1;\n        let maxEditLength = newLen + oldLen;\n        if (options.maxEditLength != null) {\n            maxEditLength = Math.min(maxEditLength, options.maxEditLength);\n        }\n        const maxExecutionTime = (_a = options.timeout) !== null && _a !== void 0 ? _a : Infinity;\n        const abortAfterTimestamp = Date.now() + maxExecutionTime;\n        const bestPath = [{ oldPos: -1, lastComponent: undefined }];\n        // Seed editLength = 0, i.e. the content starts with the same values\n        let newPos = this.extractCommon(bestPath[0], newTokens, oldTokens, 0, options);\n        if (bestPath[0].oldPos + 1 >= oldLen && newPos + 1 >= newLen) {\n            // Identity per the equality and tokenizer\n            return done(this.buildValues(bestPath[0].lastComponent, newTokens, oldTokens));\n        }\n        // Once we hit the right edge of the edit graph on some diagonal k, we can\n        // definitely reach the end of the edit graph in no more than k edits, so\n        // there's no point in considering any moves to diagonal k+1 any more (from\n        // which we're guaranteed to need at least k+1 more edits).\n        // Similarly, once we've reached the bottom of the edit graph, there's no\n        // point considering moves to lower diagonals.\n        // We record this fact by setting minDiagonalToConsider and\n        // maxDiagonalToConsider to some finite value once we've hit the edge of\n        // the edit graph.\n        // This optimization is not faithful to the original algorithm presented in\n        // Myers's paper, which instead pointlessly extends D-paths off the end of\n        // the edit graph - see page 7 of Myers's paper which notes this point\n        // explicitly and illustrates it with a diagram. This has major performance\n        // implications for some common scenarios. For instance, to compute a diff\n        // where the new text simply appends d characters on the end of the\n        // original text of length n, the true Myers algorithm will take O(n+d^2)\n        // time while this optimization needs only O(n+d) time.\n        let minDiagonalToConsider = -Infinity, maxDiagonalToConsider = Infinity;\n        // Main worker method. checks all permutations of a given edit length for acceptance.\n        const execEditLength = () => {\n            for (let diagonalPath = Math.max(minDiagonalToConsider, -editLength); diagonalPath <= Math.min(maxDiagonalToConsider, editLength); diagonalPath += 2) {\n                let basePath;\n                const removePath = bestPath[diagonalPath - 1], addPath = bestPath[diagonalPath + 1];\n                if (removePath) {\n                    // No one else is going to attempt to use this value, clear it\n                    // @ts-expect-error - perf optimisation. This type-violating value will never be read.\n                    bestPath[diagonalPath - 1] = undefined;\n                }\n                let canAdd = false;\n                if (addPath) {\n                    // what newPos will be after we do an insertion:\n                    const addPathNewPos = addPath.oldPos - diagonalPath;\n                    canAdd = addPath && 0 <= addPathNewPos && addPathNewPos < newLen;\n                }\n                const canRemove = removePath && removePath.oldPos + 1 < oldLen;\n                if (!canAdd && !canRemove) {\n                    // If this path is a terminal then prune\n                    // @ts-expect-error - perf optimisation. This type-violating value will never be read.\n                    bestPath[diagonalPath] = undefined;\n                    continue;\n                }\n                // Select the diagonal that we want to branch from. We select the prior\n                // path whose position in the old string is the farthest from the origin\n                // and does not pass the bounds of the diff graph\n                if (!canRemove || (canAdd && removePath.oldPos < addPath.oldPos)) {\n                    basePath = this.addToPath(addPath, true, false, 0, options);\n                }\n                else {\n                    basePath = this.addToPath(removePath, false, true, 1, options);\n                }\n                newPos = this.extractCommon(basePath, newTokens, oldTokens, diagonalPath, options);\n                if (basePath.oldPos + 1 >= oldLen && newPos + 1 >= newLen) {\n                    // If we have hit the end of both strings, then we are done\n                    return done(this.buildValues(basePath.lastComponent, newTokens, oldTokens)) || true;\n                }\n                else {\n                    bestPath[diagonalPath] = basePath;\n                    if (basePath.oldPos + 1 >= oldLen) {\n                        maxDiagonalToConsider = Math.min(maxDiagonalToConsider, diagonalPath - 1);\n                    }\n                    if (newPos + 1 >= newLen) {\n                        minDiagonalToConsider = Math.max(minDiagonalToConsider, diagonalPath + 1);\n                    }\n                }\n            }\n            editLength++;\n        };\n        // Performs the length of edit iteration. Is a bit fugly as this has to support the\n        // sync and async mode which is never fun. Loops over execEditLength until a value\n        // is produced, or until the edit length exceeds options.maxEditLength (if given),\n        // in which case it will return undefined.\n        if (callback) {\n            (function exec() {\n                setTimeout(function () {\n                    if (editLength > maxEditLength || Date.now() > abortAfterTimestamp) {\n                        return callback(undefined);\n                    }\n                    if (!execEditLength()) {\n                        exec();\n                    }\n                }, 0);\n            }());\n        }\n        else {\n            while (editLength <= maxEditLength && Date.now() <= abortAfterTimestamp) {\n                const ret = execEditLength();\n                if (ret) {\n                    return ret;\n                }\n            }\n        }\n    }\n    addToPath(path, added, removed, oldPosInc, options) {\n        const last = path.lastComponent;\n        if (last && !options.oneChangePerToken && last.added === added && last.removed === removed) {\n            return {\n                oldPos: path.oldPos + oldPosInc,\n                lastComponent: { count: last.count + 1, added: added, removed: removed, previousComponent: last.previousComponent }\n            };\n        }\n        else {\n            return {\n                oldPos: path.oldPos + oldPosInc,\n                lastComponent: { count: 1, added: added, removed: removed, previousComponent: last }\n            };\n        }\n    }\n    extractCommon(basePath, newTokens, oldTokens, diagonalPath, options) {\n        const newLen = newTokens.length, oldLen = oldTokens.length;\n        let oldPos = basePath.oldPos, newPos = oldPos - diagonalPath, commonCount = 0;\n        while (newPos + 1 < newLen && oldPos + 1 < oldLen && this.equals(oldTokens[oldPos + 1], newTokens[newPos + 1], options)) {\n            newPos++;\n            oldPos++;\n            commonCount++;\n            if (options.oneChangePerToken) {\n                basePath.lastComponent = { count: 1, previousComponent: basePath.lastComponent, added: false, removed: false };\n            }\n        }\n        if (commonCount && !options.oneChangePerToken) {\n            basePath.lastComponent = { count: commonCount, previousComponent: basePath.lastComponent, added: false, removed: false };\n        }\n        basePath.oldPos = oldPos;\n        return newPos;\n    }\n    equals(left, right, options) {\n        if (options.comparator) {\n            return options.comparator(left, right);\n        }\n        else {\n            return left === right\n                || (!!options.ignoreCase && left.toLowerCase() === right.toLowerCase());\n        }\n    }\n    removeEmpty(array) {\n        const ret = [];\n        for (let i = 0; i < array.length; i++) {\n            if (array[i]) {\n                ret.push(array[i]);\n            }\n        }\n        return ret;\n    }\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    castInput(value, options) {\n        return value;\n    }\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    tokenize(value, options) {\n        return Array.from(value);\n    }\n    join(chars) {\n        // Assumes ValueT is string, which is the case for most subclasses.\n        // When it's false, e.g. in diffArrays, this method needs to be overridden (e.g. with a no-op)\n        // Yes, the casts are verbose and ugly, because this pattern - of having the base class SORT OF\n        // assume tokens and values are strings, but not completely - is weird and janky.\n        return chars.join('');\n    }\n    postProcess(changeObjects, \n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    options) {\n        return changeObjects;\n    }\n    get useLongestToken() {\n        return false;\n    }\n    buildValues(lastComponent, newTokens, oldTokens) {\n        // First we convert our linked list of components in reverse order to an\n        // array in the right order:\n        const components = [];\n        let nextComponent;\n        while (lastComponent) {\n            components.push(lastComponent);\n            nextComponent = lastComponent.previousComponent;\n            delete lastComponent.previousComponent;\n            lastComponent = nextComponent;\n        }\n        components.reverse();\n        const componentLen = components.length;\n        let componentPos = 0, newPos = 0, oldPos = 0;\n        for (; componentPos < componentLen; componentPos++) {\n            const component = components[componentPos];\n            if (!component.removed) {\n                if (!component.added && this.useLongestToken) {\n                    let value = newTokens.slice(newPos, newPos + component.count);\n                    value = value.map(function (value, i) {\n                        const oldValue = oldTokens[oldPos + i];\n                        return oldValue.length > value.length ? oldValue : value;\n                    });\n                    component.value = this.join(value);\n                }\n                else {\n                    component.value = this.join(newTokens.slice(newPos, newPos + component.count));\n                }\n                newPos += component.count;\n                // Common case\n                if (!component.added) {\n                    oldPos += component.count;\n                }\n            }\n            else {\n                component.value = this.join(oldTokens.slice(oldPos, oldPos + component.count));\n                oldPos += component.count;\n            }\n        }\n        return components;\n    }\n}\n","import Diff from './base.js';\nclass CharacterDiff extends Diff {\n}\nexport const characterDiff = new CharacterDiff();\nexport function diffChars(oldStr, newStr, options) {\n    return characterDiff.diff(oldStr, newStr, options);\n}\n","export function longestCommonPrefix(str1, str2) {\n    let i;\n    for (i = 0; i < str1.length && i < str2.length; i++) {\n        if (str1[i] != str2[i]) {\n            return str1.slice(0, i);\n        }\n    }\n    return str1.slice(0, i);\n}\nexport function longestCommonSuffix(str1, str2) {\n    let i;\n    // Unlike longestCommonPrefix, we need a special case to handle all scenarios\n    // where we return the empty string since str1.slice(-0) will return the\n    // entire string.\n    if (!str1 || !str2 || str1[str1.length - 1] != str2[str2.length - 1]) {\n        return '';\n    }\n    for (i = 0; i < str1.length && i < str2.length; i++) {\n        if (str1[str1.length - (i + 1)] != str2[str2.length - (i + 1)]) {\n            return str1.slice(-i);\n        }\n    }\n    return str1.slice(-i);\n}\nexport function replacePrefix(string, oldPrefix, newPrefix) {\n    if (string.slice(0, oldPrefix.length) != oldPrefix) {\n        throw Error(`string ${JSON.stringify(string)} doesn't start with prefix ${JSON.stringify(oldPrefix)}; this is a bug`);\n    }\n    return newPrefix + string.slice(oldPrefix.length);\n}\nexport function replaceSuffix(string, oldSuffix, newSuffix) {\n    if (!oldSuffix) {\n        return string + newSuffix;\n    }\n    if (string.slice(-oldSuffix.length) != oldSuffix) {\n        throw Error(`string ${JSON.stringify(string)} doesn't end with suffix ${JSON.stringify(oldSuffix)}; this is a bug`);\n    }\n    return string.slice(0, -oldSuffix.length) + newSuffix;\n}\nexport function removePrefix(string, oldPrefix) {\n    return replacePrefix(string, oldPrefix, '');\n}\nexport function removeSuffix(string, oldSuffix) {\n    return replaceSuffix(string, oldSuffix, '');\n}\nexport function maximumOverlap(string1, string2) {\n    return string2.slice(0, overlapCount(string1, string2));\n}\n// Nicked from https://stackoverflow.com/a/60422853/1709587\nfunction overlapCount(a, b) {\n    // Deal with cases where the strings differ in length\n    let startA = 0;\n    if (a.length > b.length) {\n        startA = a.length - b.length;\n    }\n    let endB = b.length;\n    if (a.length < b.length) {\n        endB = a.length;\n    }\n    // Create a back-reference for each index\n    //   that should be followed in case of a mismatch.\n    //   We only need B to make these references:\n    const map = Array(endB);\n    let k = 0; // Index that lags behind j\n    map[0] = 0;\n    for (let j = 1; j < endB; j++) {\n        if (b[j] == b[k]) {\n            map[j] = map[k]; // skip over the same character (optional optimisation)\n        }\n        else {\n            map[j] = k;\n        }\n        while (k > 0 && b[j] != b[k]) {\n            k = map[k];\n        }\n        if (b[j] == b[k]) {\n            k++;\n        }\n    }\n    // Phase 2: use these references while iterating over A\n    k = 0;\n    for (let i = startA; i < a.length; i++) {\n        while (k > 0 && a[i] != b[k]) {\n            k = map[k];\n        }\n        if (a[i] == b[k]) {\n            k++;\n        }\n    }\n    return k;\n}\n/**\n * Returns true if the string consistently uses Windows line endings.\n */\nexport function hasOnlyWinLineEndings(string) {\n    return string.includes('\\r\\n') && !string.startsWith('\\n') && !string.match(/[^\\r]\\n/);\n}\n/**\n * Returns true if the string consistently uses Unix line endings.\n */\nexport function hasOnlyUnixLineEndings(string) {\n    return !string.includes('\\r\\n') && string.includes('\\n');\n}\n/**\n * Split a string into segments using a word segmenter, merging consecutive\n * segments if they are both whitespace segments. Whitespace segments can\n * appear adjacent to one another for two reasons:\n * - newlines always get their own segment\n * - where a diacritic is attached to a whitespace character in the text, the\n *   segment ends after the diacritic, so e.g. \" \\u0300 \" becomes two segments.\n * This function therefore runs the segmenter's .segment() method and then\n * merges consecutive segments of whitespace into a single part.\n */\nexport function segment(string, segmenter) {\n    const parts = [];\n    for (const segmentObj of Array.from(segmenter.segment(string))) {\n        const segment = segmentObj.segment;\n        if (parts.length && (/\\s/).test(parts[parts.length - 1]) && (/\\s/).test(segment)) {\n            parts[parts.length - 1] += segment;\n        }\n        else {\n            parts.push(segment);\n        }\n    }\n    return parts;\n}\n// The functions below take a `segmenter` argument so that, when called from\n// diffWords when it is using a segmenter, they can use a notion of what\n// constitutes \"whitespace\" that is consistent with the segmenter.\n//\n// USUALLY this will be identical to the result of the non-segmenter-based\n// logic, but it differs in at least one case: when whitespace characters are\n// modified by diacritics. A word segmenter considers these diacritics to be\n// part of the whitespace, whereas our non-segmenter-based logic does not.\n//\n// Because the segmenter-based approach necessarily requires segmenting the\n// entire string, we offer a leadingAndTrailingWs function to allow getting the\n// whitespace prefix AND whitespace suffix with a single call to the segmenter,\n// for efficiency's sake.\nexport function trailingWs(string, segmenter) {\n    if (segmenter) {\n        return leadingAndTrailingWs(string, segmenter)[1];\n    }\n    // Yes, this looks overcomplicated and dumb - why not replace the whole function with\n    //     return string.match(/\\s*$/)[0]\n    // you ask? Because:\n    // 1. the trap described at https://markamery.com/blog/quadratic-time-regexes/ would mean doing\n    //    this would cause this function to take O(n²) time in the worst case (specifically when\n    //    there is a massive run of NON-TRAILING whitespace in `string`), and\n    // 2. the fix proposed in the same blog post, of using a negative lookbehind, is incompatible\n    //    with old Safari versions that we'd like to not break if possible (see\n    //    https://github.com/kpdecker/jsdiff/pull/550)\n    // It feels absurd to do this with an explicit loop instead of a regex, but I really can't see a\n    // better way that doesn't result in broken behaviour.\n    let i;\n    for (i = string.length - 1; i >= 0; i--) {\n        if (!string[i].match(/\\s/)) {\n            break;\n        }\n    }\n    return string.substring(i + 1);\n}\nexport function leadingWs(string, segmenter) {\n    if (segmenter) {\n        return leadingAndTrailingWs(string, segmenter)[0];\n    }\n    // Thankfully the annoying considerations described in trailingWs don't apply here:\n    const match = string.match(/^\\s*/);\n    return match ? match[0] : '';\n}\nexport function leadingAndTrailingWs(string, segmenter) {\n    if (!segmenter) {\n        return [leadingWs(string), trailingWs(string)];\n    }\n    if (segmenter.resolvedOptions().granularity != 'word') {\n        throw new Error('The segmenter passed must have a granularity of \"word\"');\n    }\n    const segments = segment(string, segmenter);\n    const firstSeg = segments[0];\n    const lastSeg = segments[segments.length - 1];\n    const head = (/\\s/).test(firstSeg) ? firstSeg : '';\n    const tail = (/\\s/).test(lastSeg) ? lastSeg : '';\n    return [head, tail];\n}\n","import Diff from './base.js';\nimport { longestCommonPrefix, longestCommonSuffix, replacePrefix, replaceSuffix, removePrefix, removeSuffix, maximumOverlap, leadingWs, trailingWs, leadingAndTrailingWs, segment } from '../util/string.js';\n// Based on https://en.wikipedia.org/wiki/Latin_script_in_Unicode\n//\n// Chars/ranges counted as \"word\" characters by this regex are as follows:\n//\n// + U+00AD  Soft hyphen\n// + 00C0–00FF (letters with diacritics from the Latin-1 Supplement), except:\n//   - U+00D7  × Multiplication sign\n//   - U+00F7  ÷ Division sign\n// + Latin Extended-A, 0100–017F\n// + Latin Extended-B, 0180–024F\n// + IPA Extensions, 0250–02AF\n// + Spacing Modifier Letters, 02B0–02FF, except:\n//   - U+02C7  ˇ &#711;  Caron\n//   - U+02D8  ˘ &#728;  Breve\n//   - U+02D9  ˙ &#729;  Dot Above\n//   - U+02DA  ˚ &#730;  Ring Above\n//   - U+02DB  ˛ &#731;  Ogonek\n//   - U+02DC  ˜ &#732;  Small Tilde\n//   - U+02DD  ˝ &#733;  Double Acute Accent\n// + Latin Extended Additional, 1E00–1EFF\nconst extendedWordChars = 'a-zA-Z0-9_\\\\u{AD}\\\\u{C0}-\\\\u{D6}\\\\u{D8}-\\\\u{F6}\\\\u{F8}-\\\\u{2C6}\\\\u{2C8}-\\\\u{2D7}\\\\u{2DE}-\\\\u{2FF}\\\\u{1E00}-\\\\u{1EFF}';\n// Each token is one of the following:\n// - A punctuation mark plus the surrounding whitespace\n// - A word plus the surrounding whitespace\n// - Pure whitespace (but only in the special case where the entire text\n//   is just whitespace)\n//\n// We have to include surrounding whitespace in the tokens because the two\n// alternative approaches produce horribly broken results:\n// * If we just discard the whitespace, we can't fully reproduce the original\n//   text from the sequence of tokens and any attempt to render the diff will\n//   get the whitespace wrong.\n// * If we have separate tokens for whitespace, then in a typical text every\n//   second token will be a single space character. But this often results in\n//   the optimal diff between two texts being a perverse one that preserves\n//   the spaces between words but deletes and reinserts actual common words.\n//   See https://github.com/kpdecker/jsdiff/issues/160#issuecomment-1866099640\n//   for an example.\n//\n// Keeping the surrounding whitespace of course has implications for .equals\n// and .join, not just .tokenize.\n// This regex does NOT fully implement the tokenization rules described above.\n// Instead, it gives runs of whitespace their own \"token\". The tokenize method\n// then handles stitching whitespace tokens onto adjacent word or punctuation\n// tokens.\nconst tokenizeIncludingWhitespace = new RegExp(`[${extendedWordChars}]+|\\\\s+|[^${extendedWordChars}]`, 'ug');\nclass WordDiff extends Diff {\n    equals(left, right, options) {\n        if (options.ignoreCase) {\n            left = left.toLowerCase();\n            right = right.toLowerCase();\n        }\n        return left.trim() === right.trim();\n    }\n    tokenize(value, options = {}) {\n        let parts;\n        if (options.intlSegmenter) {\n            const segmenter = options.intlSegmenter;\n            if (segmenter.resolvedOptions().granularity != 'word') {\n                throw new Error('The segmenter passed must have a granularity of \"word\"');\n            }\n            // We want `parts` to be an array whose elements alternate between being\n            // pure whitespace and being pure non-whitespace. This is ALMOST what the\n            // segments returned by a word-based Intl.Segmenter already look like,\n            // but not quite - see explanation in the docs of our custom segment()\n            // function.\n            parts = segment(value, segmenter);\n        }\n        else {\n            parts = value.match(tokenizeIncludingWhitespace) || [];\n        }\n        const tokens = [];\n        let prevPart = null;\n        parts.forEach(part => {\n            if ((/\\s/).test(part)) {\n                if (prevPart == null) {\n                    tokens.push(part);\n                }\n                else {\n                    tokens.push(tokens.pop() + part);\n                }\n            }\n            else if (prevPart != null && (/\\s/).test(prevPart)) {\n                if (tokens[tokens.length - 1] == prevPart) {\n                    tokens.push(tokens.pop() + part);\n                }\n                else {\n                    tokens.push(prevPart + part);\n                }\n            }\n            else {\n                tokens.push(part);\n            }\n            prevPart = part;\n        });\n        return tokens;\n    }\n    join(tokens) {\n        // Tokens being joined here will always have appeared consecutively in the\n        // same text, so we can simply strip off the leading whitespace from all the\n        // tokens except the first (and except any whitespace-only tokens - but such\n        // a token will always be the first and only token anyway) and then join them\n        // and the whitespace around words and punctuation will end up correct.\n        return tokens.map((token, i) => {\n            if (i == 0) {\n                return token;\n            }\n            else {\n                return token.replace((/^\\s+/), '');\n            }\n        }).join('');\n    }\n    postProcess(changes, options) {\n        if (!changes || options.oneChangePerToken) {\n            return changes;\n        }\n        let lastKeep = null;\n        // Change objects representing any insertion or deletion since the last\n        // \"keep\" change object. There can be at most one of each.\n        let insertion = null;\n        let deletion = null;\n        changes.forEach(change => {\n            if (change.added) {\n                insertion = change;\n            }\n            else if (change.removed) {\n                deletion = change;\n            }\n            else {\n                if (insertion || deletion) { // May be false at start of text\n                    dedupeWhitespaceInChangeObjects(lastKeep, deletion, insertion, change, options.intlSegmenter);\n                }\n                lastKeep = change;\n                insertion = null;\n                deletion = null;\n            }\n        });\n        if (insertion || deletion) {\n            dedupeWhitespaceInChangeObjects(lastKeep, deletion, insertion, null, options.intlSegmenter);\n        }\n        return changes;\n    }\n}\nexport const wordDiff = new WordDiff();\nexport function diffWords(oldStr, newStr, options) {\n    // This option has never been documented and never will be (it's clearer to\n    // just call `diffWordsWithSpace` directly if you need that behavior), but\n    // has existed in jsdiff for a long time, so we retain support for it here\n    // for the sake of backwards compatibility.\n    if ((options === null || options === void 0 ? void 0 : options.ignoreWhitespace) != null && !options.ignoreWhitespace) {\n        return diffWordsWithSpace(oldStr, newStr, options);\n    }\n    return wordDiff.diff(oldStr, newStr, options);\n}\nfunction dedupeWhitespaceInChangeObjects(startKeep, deletion, insertion, endKeep, segmenter) {\n    // Before returning, we tidy up the leading and trailing whitespace of the\n    // change objects to eliminate cases where trailing whitespace in one object\n    // is repeated as leading whitespace in the next.\n    // Below are examples of the outcomes we want here to explain the code.\n    // I=insert, K=keep, D=delete\n    // 1. diffing 'foo bar baz' vs 'foo baz'\n    //    Prior to cleanup, we have K:'foo ' D:' bar ' K:' baz'\n    //    After cleanup, we want:   K:'foo ' D:'bar ' K:'baz'\n    //\n    // 2. Diffing 'foo bar baz' vs 'foo qux baz'\n    //    Prior to cleanup, we have K:'foo ' D:' bar ' I:' qux ' K:' baz'\n    //    After cleanup, we want K:'foo ' D:'bar' I:'qux' K:' baz'\n    //\n    // 3. Diffing 'foo\\nbar baz' vs 'foo baz'\n    //    Prior to cleanup, we have K:'foo ' D:'\\nbar ' K:' baz'\n    //    After cleanup, we want K'foo' D:'\\nbar' K:' baz'\n    //\n    // 4. Diffing 'foo baz' vs 'foo\\nbar baz'\n    //    Prior to cleanup, we have K:'foo\\n' I:'\\nbar ' K:' baz'\n    //    After cleanup, we ideally want K'foo' I:'\\nbar' K:' baz'\n    //    but don't actually manage this currently (the pre-cleanup change\n    //    objects don't contain enough information to make it possible).\n    //\n    // 5. Diffing 'foo   bar baz' vs 'foo  baz'\n    //    Prior to cleanup, we have K:'foo  ' D:'   bar ' K:'  baz'\n    //    After cleanup, we want K:'foo  ' D:' bar ' K:'baz'\n    //\n    // Our handling is unavoidably imperfect in the case where there's a single\n    // indel between keeps and the whitespace has changed. For instance, consider\n    // diffing 'foo\\tbar\\nbaz' vs 'foo baz'. Unless we create an extra change\n    // object to represent the insertion of the space character (which isn't even\n    // a token), we have no way to avoid losing information about the texts'\n    // original whitespace in the result we return. Still, we do our best to\n    // output something that will look sensible if we e.g. print it with\n    // insertions in green and deletions in red.\n    // Between two \"keep\" change objects (or before the first or after the last\n    // change object), we can have either:\n    // * A \"delete\" followed by an \"insert\"\n    // * Just an \"insert\"\n    // * Just a \"delete\"\n    // We handle the three cases separately.\n    if (deletion && insertion) {\n        const [oldWsPrefix, oldWsSuffix] = leadingAndTrailingWs(deletion.value, segmenter);\n        const [newWsPrefix, newWsSuffix] = leadingAndTrailingWs(insertion.value, segmenter);\n        if (startKeep) {\n            const commonWsPrefix = longestCommonPrefix(oldWsPrefix, newWsPrefix);\n            startKeep.value = replaceSuffix(startKeep.value, newWsPrefix, commonWsPrefix);\n            deletion.value = removePrefix(deletion.value, commonWsPrefix);\n            insertion.value = removePrefix(insertion.value, commonWsPrefix);\n        }\n        if (endKeep) {\n            const commonWsSuffix = longestCommonSuffix(oldWsSuffix, newWsSuffix);\n            endKeep.value = replacePrefix(endKeep.value, newWsSuffix, commonWsSuffix);\n            deletion.value = removeSuffix(deletion.value, commonWsSuffix);\n            insertion.value = removeSuffix(insertion.value, commonWsSuffix);\n        }\n    }\n    else if (insertion) {\n        // The whitespaces all reflect what was in the new text rather than\n        // the old, so we essentially have no information about whitespace\n        // insertion or deletion. We just want to dedupe the whitespace.\n        // We do that by having each change object keep its trailing\n        // whitespace and deleting duplicate leading whitespace where\n        // present.\n        if (startKeep) {\n            const ws = leadingWs(insertion.value, segmenter);\n            insertion.value = insertion.value.substring(ws.length);\n        }\n        if (endKeep) {\n            const ws = leadingWs(endKeep.value, segmenter);\n            endKeep.value = endKeep.value.substring(ws.length);\n        }\n        // otherwise we've got a deletion and no insertion\n    }\n    else if (startKeep && endKeep) {\n        const newWsFull = leadingWs(endKeep.value, segmenter), [delWsStart, delWsEnd] = leadingAndTrailingWs(deletion.value, segmenter);\n        // Any whitespace that comes straight after startKeep in both the old and\n        // new texts, assign to startKeep and remove from the deletion.\n        const newWsStart = longestCommonPrefix(newWsFull, delWsStart);\n        deletion.value = removePrefix(deletion.value, newWsStart);\n        // Any whitespace that comes straight before endKeep in both the old and\n        // new texts, and hasn't already been assigned to startKeep, assign to\n        // endKeep and remove from the deletion.\n        const newWsEnd = longestCommonSuffix(removePrefix(newWsFull, newWsStart), delWsEnd);\n        deletion.value = removeSuffix(deletion.value, newWsEnd);\n        endKeep.value = replacePrefix(endKeep.value, newWsFull, newWsEnd);\n        // If there's any whitespace from the new text that HASN'T already been\n        // assigned, assign it to the start:\n        startKeep.value = replaceSuffix(startKeep.value, newWsFull, newWsFull.slice(0, newWsFull.length - newWsEnd.length));\n    }\n    else if (endKeep) {\n        // We are at the start of the text. Preserve all the whitespace on\n        // endKeep, and just remove whitespace from the end of deletion to the\n        // extent that it overlaps with the start of endKeep.\n        const endKeepWsPrefix = leadingWs(endKeep.value, segmenter);\n        const deletionWsSuffix = trailingWs(deletion.value, segmenter);\n        const overlap = maximumOverlap(deletionWsSuffix, endKeepWsPrefix);\n        deletion.value = removeSuffix(deletion.value, overlap);\n    }\n    else if (startKeep) {\n        // We are at the END of the text. Preserve all the whitespace on\n        // startKeep, and just remove whitespace from the start of deletion to\n        // the extent that it overlaps with the end of startKeep.\n        const startKeepWsSuffix = trailingWs(startKeep.value, segmenter);\n        const deletionWsPrefix = leadingWs(deletion.value, segmenter);\n        const overlap = maximumOverlap(startKeepWsSuffix, deletionWsPrefix);\n        deletion.value = removePrefix(deletion.value, overlap);\n    }\n}\nclass WordsWithSpaceDiff extends Diff {\n    tokenize(value) {\n        // Slightly different to the tokenizeIncludingWhitespace regex used above in\n        // that this one treats each individual newline as a distinct token, rather\n        // than merging them into other surrounding whitespace. This was requested\n        // in https://github.com/kpdecker/jsdiff/issues/180 &\n        //    https://github.com/kpdecker/jsdiff/issues/211\n        const regex = new RegExp(`(\\\\r?\\\\n)|[${extendedWordChars}]+|[^\\\\S\\\\n\\\\r]+|[^${extendedWordChars}]`, 'ug');\n        return value.match(regex) || [];\n    }\n}\nexport const wordsWithSpaceDiff = new WordsWithSpaceDiff();\nexport function diffWordsWithSpace(oldStr, newStr, options) {\n    return wordsWithSpaceDiff.diff(oldStr, newStr, options);\n}\n","import Diff from './base.js';\nimport { generateOptions } from '../util/params.js';\nclass LineDiff extends Diff {\n    constructor() {\n        super(...arguments);\n        this.tokenize = tokenize;\n    }\n    equals(left, right, options) {\n        // If we're ignoring whitespace, we need to normalise lines by stripping\n        // whitespace before checking equality. (This has an annoying interaction\n        // with newlineIsToken that requires special handling: if newlines get their\n        // own token, then we DON'T want to trim the *newline* tokens down to empty\n        // strings, since this would cause us to treat whitespace-only line content\n        // as equal to a separator between lines, which would be weird and\n        // inconsistent with the documented behavior of the options.)\n        if (options.ignoreWhitespace) {\n            if (!options.newlineIsToken || !left.includes('\\n')) {\n                left = left.trim();\n            }\n            if (!options.newlineIsToken || !right.includes('\\n')) {\n                right = right.trim();\n            }\n        }\n        else if (options.ignoreNewlineAtEof && !options.newlineIsToken) {\n            if (left.endsWith('\\n')) {\n                left = left.slice(0, -1);\n            }\n            if (right.endsWith('\\n')) {\n                right = right.slice(0, -1);\n            }\n        }\n        return super.equals(left, right, options);\n    }\n}\nexport const lineDiff = new LineDiff();\nexport function diffLines(oldStr, newStr, options) {\n    return lineDiff.diff(oldStr, newStr, options);\n}\nexport function diffTrimmedLines(oldStr, newStr, options) {\n    options = generateOptions(options, { ignoreWhitespace: true });\n    return lineDiff.diff(oldStr, newStr, options);\n}\n// Exported standalone so it can be used from jsonDiff too.\nexport function tokenize(value, options) {\n    if (options.stripTrailingCr) {\n        // remove one \\r before \\n to match GNU diff's --strip-trailing-cr behavior\n        value = value.replace(/\\r\\n/g, '\\n');\n    }\n    const retLines = [], linesAndNewlines = value.split(/(\\n|\\r\\n)/);\n    // Ignore the final empty token that occurs if the string ends with a new line\n    if (!linesAndNewlines[linesAndNewlines.length - 1]) {\n        linesAndNewlines.pop();\n    }\n    // Merge the content and line separators into single tokens\n    for (let i = 0; i < linesAndNewlines.length; i++) {\n        const line = linesAndNewlines[i];\n        if (i % 2 && !options.newlineIsToken) {\n            retLines[retLines.length - 1] += line;\n        }\n        else {\n            retLines.push(line);\n        }\n    }\n    return retLines;\n}\n","import Diff from './base.js';\nfunction isSentenceEndPunct(char) {\n    return char == '.' || char == '!' || char == '?';\n}\nclass SentenceDiff extends Diff {\n    tokenize(value) {\n        var _a;\n        // If in future we drop support for environments that don't support lookbehinds, we can replace\n        // this entire function with:\n        //     return value.split(/(?<=[.!?])(\\s+|$)/);\n        // but until then, for similar reasons to the trailingWs function in string.ts, we are forced\n        // to do this verbosely \"by hand\" instead of using a regex.\n        const result = [];\n        let tokenStartI = 0;\n        for (let i = 0; i < value.length; i++) {\n            if (i == value.length - 1) {\n                result.push(value.slice(tokenStartI));\n                break;\n            }\n            if (isSentenceEndPunct(value[i]) && value[i + 1].match(/\\s/)) {\n                // We've hit a sentence break - i.e. a punctuation mark followed by whitespace.\n                // We now want to push TWO tokens to the result:\n                // 1. the sentence\n                result.push(value.slice(tokenStartI, i + 1));\n                // 2. the whitespace\n                i = tokenStartI = i + 1;\n                while ((_a = value[i + 1]) === null || _a === void 0 ? void 0 : _a.match(/\\s/)) {\n                    i++;\n                }\n                result.push(value.slice(tokenStartI, i + 1));\n                // Then the next token (a sentence) starts on the character after the whitespace.\n                // (It's okay if this is off the end of the string - then the outer loop will terminate\n                // here anyway.)\n                tokenStartI = i + 1;\n            }\n        }\n        return result;\n    }\n}\nexport const sentenceDiff = new SentenceDiff();\nexport function diffSentences(oldStr, newStr, options) {\n    return sentenceDiff.diff(oldStr, newStr, options);\n}\n","import Diff from './base.js';\nclass CssDiff extends Diff {\n    tokenize(value) {\n        return value.split(/([{}:;,]|\\s+)/);\n    }\n}\nexport const cssDiff = new CssDiff();\nexport function diffCss(oldStr, newStr, options) {\n    return cssDiff.diff(oldStr, newStr, options);\n}\n","import Diff from './base.js';\nimport { tokenize } from './line.js';\nclass JsonDiff extends Diff {\n    constructor() {\n        super(...arguments);\n        this.tokenize = tokenize;\n    }\n    get useLongestToken() {\n        // Discriminate between two lines of pretty-printed, serialized JSON where one of them has a\n        // dangling comma and the other doesn't. Turns out including the dangling comma yields the nicest output:\n        return true;\n    }\n    castInput(value, options) {\n        const { undefinedReplacement, stringifyReplacer = (k, v) => typeof v === 'undefined' ? undefinedReplacement : v } = options;\n        return typeof value === 'string' ? value : JSON.stringify(canonicalize(value, null, null, stringifyReplacer), null, '  ');\n    }\n    equals(left, right, options) {\n        return super.equals(left.replace(/,([\\r\\n])/g, '$1'), right.replace(/,([\\r\\n])/g, '$1'), options);\n    }\n}\nexport const jsonDiff = new JsonDiff();\nexport function diffJson(oldStr, newStr, options) {\n    return jsonDiff.diff(oldStr, newStr, options);\n}\n// This function handles the presence of circular references by bailing out when encountering an\n// object that is already on the \"stack\" of items being processed. Accepts an optional replacer\nexport function canonicalize(obj, stack, replacementStack, replacer, key) {\n    stack = stack || [];\n    replacementStack = replacementStack || [];\n    if (replacer) {\n        obj = replacer(key === undefined ? '' : key, obj);\n    }\n    let i;\n    for (i = 0; i < stack.length; i += 1) {\n        if (stack[i] === obj) {\n            return replacementStack[i];\n        }\n    }\n    let canonicalizedObj;\n    if ('[object Array]' === Object.prototype.toString.call(obj)) {\n        stack.push(obj);\n        canonicalizedObj = new Array(obj.length);\n        replacementStack.push(canonicalizedObj);\n        for (i = 0; i < obj.length; i += 1) {\n            canonicalizedObj[i] = canonicalize(obj[i], stack, replacementStack, replacer, String(i));\n        }\n        stack.pop();\n        replacementStack.pop();\n        return canonicalizedObj;\n    }\n    if (obj && obj.toJSON) {\n        obj = obj.toJSON();\n    }\n    if (typeof obj === 'object' && obj !== null) {\n        stack.push(obj);\n        canonicalizedObj = {};\n        replacementStack.push(canonicalizedObj);\n        const sortedKeys = [];\n        let key;\n        for (key in obj) {\n            /* istanbul ignore else */\n            if (Object.prototype.hasOwnProperty.call(obj, key)) {\n                sortedKeys.push(key);\n            }\n        }\n        sortedKeys.sort();\n        for (i = 0; i < sortedKeys.length; i += 1) {\n            key = sortedKeys[i];\n            canonicalizedObj[key] = canonicalize(obj[key], stack, replacementStack, replacer, key);\n        }\n        stack.pop();\n        replacementStack.pop();\n    }\n    else {\n        canonicalizedObj = obj;\n    }\n    return canonicalizedObj;\n}\n","import Diff from './base.js';\nclass ArrayDiff extends Diff {\n    tokenize(value) {\n        return value.slice();\n    }\n    join(value) {\n        return value;\n    }\n    removeEmpty(value) {\n        return value;\n    }\n}\nexport const arrayDiff = new ArrayDiff();\nexport function diffArrays(oldArr, newArr, options) {\n    return arrayDiff.diff(oldArr, newArr, options);\n}\n","import { diffLines } from '../diff/line.js';\nexport const INCLUDE_HEADERS = {\n    includeIndex: true,\n    includeUnderline: true,\n    includeFileHeaders: true\n};\nexport const FILE_HEADERS_ONLY = {\n    includeIndex: false,\n    includeUnderline: false,\n    includeFileHeaders: true\n};\nexport const OMIT_HEADERS = {\n    includeIndex: false,\n    includeUnderline: false,\n    includeFileHeaders: false\n};\nexport function structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options) {\n    let optionsObj;\n    if (!options) {\n        optionsObj = {};\n    }\n    else if (typeof options === 'function') {\n        optionsObj = { callback: options };\n    }\n    else {\n        optionsObj = options;\n    }\n    if (typeof optionsObj.context === 'undefined') {\n        optionsObj.context = 4;\n    }\n    // We copy this into its own variable to placate TypeScript, which thinks\n    // optionsObj.context might be undefined in the callbacks below.\n    const context = optionsObj.context;\n    // @ts-expect-error (runtime check for something that is correctly a static type error)\n    if (optionsObj.newlineIsToken) {\n        throw new Error('newlineIsToken may not be used with patch-generation functions, only with diffing functions');\n    }\n    if (!optionsObj.callback) {\n        return diffLinesResultToPatch(diffLines(oldStr, newStr, optionsObj));\n    }\n    else {\n        const { callback } = optionsObj;\n        diffLines(oldStr, newStr, Object.assign(Object.assign({}, optionsObj), { callback: (diff) => {\n                const patch = diffLinesResultToPatch(diff);\n                // TypeScript is unhappy without the cast because it does not understand that `patch` may\n                // be undefined here only if `callback` is StructuredPatchCallbackAbortable:\n                callback(patch);\n            } }));\n    }\n    function diffLinesResultToPatch(diff) {\n        // STEP 1: Build up the patch with no \"\\" lines and with the arrays\n        //         of lines containing trailing newline characters. We'll tidy up later...\n        if (!diff) {\n            return;\n        }\n        diff.push({ value: '', lines: [] }); // Append an empty value to make cleanup easier\n        function contextLines(lines) {\n            return lines.map(function (entry) { return ' ' + entry; });\n        }\n        const hunks = [];\n        let oldRangeStart = 0, newRangeStart = 0, curRange = [], oldLine = 1, newLine = 1;\n        for (let i = 0; i < diff.length; i++) {\n            const current = diff[i], lines = current.lines || splitLines(current.value);\n            current.lines = lines;\n            if (current.added || current.removed) {\n                // If we have previous context, start with that\n                if (!oldRangeStart) {\n                    const prev = diff[i - 1];\n                    oldRangeStart = oldLine;\n                    newRangeStart = newLine;\n                    if (prev) {\n                        curRange = context > 0 ? contextLines(prev.lines.slice(-context)) : [];\n                        oldRangeStart -= curRange.length;\n                        newRangeStart -= curRange.length;\n                    }\n                }\n                // Output our changes\n                for (const line of lines) {\n                    curRange.push((current.added ? '+' : '-') + line);\n                }\n                // Track the updated file position\n                if (current.added) {\n                    newLine += lines.length;\n                }\n                else {\n                    oldLine += lines.length;\n                }\n            }\n            else {\n                // Identical context lines. Track line changes\n                if (oldRangeStart) {\n                    // Close out any changes that have been output (or join overlapping)\n                    if (lines.length <= context * 2 && i < diff.length - 2) {\n                        // Overlapping\n                        for (const line of contextLines(lines)) {\n                            curRange.push(line);\n                        }\n                    }\n                    else {\n                        // end the range and output\n                        const contextSize = Math.min(lines.length, context);\n                        for (const line of contextLines(lines.slice(0, contextSize))) {\n                            curRange.push(line);\n                        }\n                        const hunk = {\n                            oldStart: oldRangeStart,\n                            oldLines: (oldLine - oldRangeStart + contextSize),\n                            newStart: newRangeStart,\n                            newLines: (newLine - newRangeStart + contextSize),\n                            lines: curRange\n                        };\n                        hunks.push(hunk);\n                        oldRangeStart = 0;\n                        newRangeStart = 0;\n                        curRange = [];\n                    }\n                }\n                oldLine += lines.length;\n                newLine += lines.length;\n            }\n        }\n        // Step 2: eliminate the trailing `\\n` from each line of each hunk, and, where needed, add\n        //         \"\\".\n        for (const hunk of hunks) {\n            for (let i = 0; i < hunk.lines.length; i++) {\n                if (hunk.lines[i].endsWith('\\n')) {\n                    hunk.lines[i] = hunk.lines[i].slice(0, -1);\n                }\n                else {\n                    hunk.lines.splice(i + 1, 0, '\\\');\n                    i++; // Skip the line we just added, then continue iterating\n                }\n            }\n        }\n        return {\n            oldFileName: oldFileName, newFileName: newFileName,\n            oldHeader: oldHeader, newHeader: newHeader,\n            hunks: hunks\n        };\n    }\n}\n/**\n * creates a unified diff patch.\n * @param patch either a single structured patch object (as returned by `structuredPatch`) or an array of them (as returned by `parsePatch`)\n */\nexport function formatPatch(patch, headerOptions) {\n    if (!headerOptions) {\n        headerOptions = INCLUDE_HEADERS;\n    }\n    if (Array.isArray(patch)) {\n        if (patch.length > 1 && !headerOptions.includeFileHeaders) {\n            throw new Error('Cannot omit file headers on a multi-file patch. '\n                + '(The result would be unparseable; how would a tool trying to apply '\n                + 'the patch know which changes are to which file?)');\n        }\n        return patch.map(p => formatPatch(p, headerOptions)).join('\\n');\n    }\n    const ret = [];\n    if (headerOptions.includeIndex && patch.oldFileName == patch.newFileName) {\n        ret.push('Index: ' + patch.oldFileName);\n    }\n    if (headerOptions.includeUnderline) {\n        ret.push('===================================================================');\n    }\n    if (headerOptions.includeFileHeaders) {\n        ret.push('--- ' + patch.oldFileName + (typeof patch.oldHeader === 'undefined' ? '' : '\\t' + patch.oldHeader));\n        ret.push('+++ ' + patch.newFileName + (typeof patch.newHeader === 'undefined' ? '' : '\\t' + patch.newHeader));\n    }\n    for (let i = 0; i < patch.hunks.length; i++) {\n        const hunk = patch.hunks[i];\n        // Unified Diff Format quirk: If the chunk size is 0,\n        // the first number is one lower than one would expect.\n        // https://www.artima.com/weblogs/viewpost.jsp?thread=164293\n        if (hunk.oldLines === 0) {\n            hunk.oldStart -= 1;\n        }\n        if (hunk.newLines === 0) {\n            hunk.newStart -= 1;\n        }\n        ret.push('@@ -' + hunk.oldStart + ',' + hunk.oldLines\n            + ' +' + hunk.newStart + ',' + hunk.newLines\n            + ' @@');\n        for (const line of hunk.lines) {\n            ret.push(line);\n        }\n    }\n    return ret.join('\\n') + '\\n';\n}\nexport function createTwoFilesPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options) {\n    if (typeof options === 'function') {\n        options = { callback: options };\n    }\n    if (!(options === null || options === void 0 ? void 0 : options.callback)) {\n        const patchObj = structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options);\n        if (!patchObj) {\n            return;\n        }\n        return formatPatch(patchObj, options === null || options === void 0 ? void 0 : options.headerOptions);\n    }\n    else {\n        const { callback } = options;\n        structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, Object.assign(Object.assign({}, options), { callback: patchObj => {\n                if (!patchObj) {\n                    callback(undefined);\n                }\n                else {\n                    callback(formatPatch(patchObj, options.headerOptions));\n                }\n            } }));\n    }\n}\nexport function createPatch(fileName, oldStr, newStr, oldHeader, newHeader, options) {\n    return createTwoFilesPatch(fileName, fileName, oldStr, newStr, oldHeader, newHeader, options);\n}\n/**\n * Split `text` into an array of lines, including the trailing newline character (where present)\n */\nfunction splitLines(text) {\n    const hasTrailingNl = text.endsWith('\\n');\n    const result = text.split('\\n').map(line => line + '\\n');\n    if (hasTrailingNl) {\n        result.pop();\n    }\n    else {\n        result.push(result.pop().slice(0, -1));\n    }\n    return result;\n}\n","import{createRequire} from\"node:module\";const require=createRequire(import.meta.url);\nimport{c as a}from\"./chunk-NRSASXYY.js\";import{a as c}from\"./chunk-QIQMJJZ4.js\";import{a as u,b as p}from\"./chunk-QAYAQNCG.js\";import*as g from\"diff\";var b={name:\"diff\",summary:\"compare files line by line\",usage:\"diff [OPTION]... FILE1 FILE2\",options:[\"-u, --unified     output unified diff format (default)\",\"-q, --brief       report only whether files differ\",\"-s, --report-identical-files  report when files are the same\",\"-i, --ignore-case  ignore case differences\",\"    --help        display this help and exit\"]},C={unified:{short:\"u\",long:\"unified\",type:\"boolean\"},brief:{short:\"q\",long:\"brief\",type:\"boolean\"},reportSame:{short:\"s\",long:\"report-identical-files\",type:\"boolean\"},ignoreCase:{short:\"i\",long:\"ignore-case\",type:\"boolean\"}},L={name:\"diff\",async execute(d,e){if(p(d))return u(b);let t=c(\"diff\",d,C);if(!t.ok)return t.error;let m=t.result.flags.brief,h=t.result.flags.reportSame,y=t.result.flags.ignoreCase,l=t.result.positional;if(t.result.flags.unified,l.length<2)return{stdout:\"\",stderr:`diff: missing operand\n`,exitCode:2};let i,s,[r,o]=l;try{i=r===\"-\"?a(e.stdin):await e.fs.readFile(e.fs.resolvePath(e.cwd,r))}catch{return{stdout:\"\",stderr:`diff: ${r}: No such file or directory\n`,exitCode:2}}try{s=o===\"-\"?a(e.stdin):await e.fs.readFile(e.fs.resolvePath(e.cwd,o))}catch{return{stdout:\"\",stderr:`diff: ${o}: No such file or directory\n`,exitCode:2}}let f=i,n=s;return y&&(f=f.toLowerCase(),n=n.toLowerCase()),f===n?h?{stdout:`Files ${r} and ${o} are identical\n`,stderr:\"\",exitCode:0}:{stdout:\"\",stderr:\"\",exitCode:0}:m?{stdout:`Files ${r} and ${o} differ\n`,stderr:\"\",exitCode:1}:{stdout:g.createTwoFilesPatch(r,o,i,s,\"\",\"\",{context:3}),stderr:\"\",exitCode:1}}},P={name:\"diff\",flags:[{flag:\"-u\",type:\"boolean\"},{flag:\"-q\",type:\"boolean\"},{flag:\"-s\",type:\"boolean\"},{flag:\"-i\",type:\"boolean\"}],needsArgs:!0,minArgs:2};export{L as a,P as b};\n","import{createRequire} from\"node:module\";const require=createRequire(import.meta.url);\nimport{a,b}from\"./chunk-CBJVD2XA.js\";import\"./chunk-NRSASXYY.js\";import\"./chunk-QIQMJJZ4.js\";import\"./chunk-QAYAQNCG.js\";import\"./chunk-BZUGFHVS.js\";export{a as diffCommand,b as flagsForFuzzing};\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11],"mappings":";;;;;;AAAA,IAAqB,OAArB,MAA0B;CACtB,KAAK,QAAQ,QAEb,UAAU,CAAC,GAAG;EACV,IAAI;EACJ,IAAI,OAAO,YAAY,YAAY;GAC/B,WAAW;GACX,UAAU,CAAC;EACf,OACK,IAAI,cAAc,SACnB,WAAW,QAAQ;EAGvB,MAAM,YAAY,KAAK,UAAU,QAAQ,OAAO;EAChD,MAAM,YAAY,KAAK,UAAU,QAAQ,OAAO;EAChD,MAAM,YAAY,KAAK,YAAY,KAAK,SAAS,WAAW,OAAO,CAAC;EACpE,MAAM,YAAY,KAAK,YAAY,KAAK,SAAS,WAAW,OAAO,CAAC;EACpE,OAAO,KAAK,mBAAmB,WAAW,WAAW,SAAS,QAAQ;CAC1E;CACA,mBAAmB,WAAW,WAAW,SAAS,UAAU;EACxD,IAAI;EACJ,MAAM,QAAQ,UAAU;GACpB,QAAQ,KAAK,YAAY,OAAO,OAAO;GACvC,IAAI,UAAU;IACV,WAAW,WAAY;KAAE,SAAS,KAAK;IAAG,GAAG,CAAC;IAC9C;GACJ,OAEI,OAAO;EAEf;EACA,MAAM,SAAS,UAAU,QAAQ,SAAS,UAAU;EACpD,IAAI,aAAa;EACjB,IAAI,gBAAgB,SAAS;EAC7B,IAAI,QAAQ,iBAAiB,MACzB,gBAAgB,KAAK,IAAI,eAAe,QAAQ,aAAa;EAEjE,MAAM,oBAAoB,KAAK,QAAQ,aAAa,QAAQ,OAAO,KAAK,IAAI,KAAK;EACjF,MAAM,sBAAsB,KAAK,IAAI,IAAI;EACzC,MAAM,WAAW,CAAC;GAAE,QAAQ;GAAI,eAAe,KAAA;EAAU,CAAC;EAE1D,IAAI,SAAS,KAAK,cAAc,SAAS,IAAI,WAAW,WAAW,GAAG,OAAO;EAC7E,IAAI,SAAS,GAAG,SAAS,KAAK,UAAU,SAAS,KAAK,QAElD,OAAO,KAAK,KAAK,YAAY,SAAS,GAAG,eAAe,WAAW,SAAS,CAAC;EAmBjF,IAAI,wBAAwB,WAAW,wBAAwB;EAE/D,MAAM,uBAAuB;GACzB,KAAK,IAAI,eAAe,KAAK,IAAI,uBAAuB,CAAC,UAAU,GAAG,gBAAgB,KAAK,IAAI,uBAAuB,UAAU,GAAG,gBAAgB,GAAG;IAClJ,IAAI;IACJ,MAAM,aAAa,SAAS,eAAe,IAAI,UAAU,SAAS,eAAe;IACjF,IAAI,YAGA,SAAS,eAAe,KAAK,KAAA;IAEjC,IAAI,SAAS;IACb,IAAI,SAAS;KAET,MAAM,gBAAgB,QAAQ,SAAS;KACvC,SAAS,WAAW,KAAK,iBAAiB,gBAAgB;IAC9D;IACA,MAAM,YAAY,cAAc,WAAW,SAAS,IAAI;IACxD,IAAI,CAAC,UAAU,CAAC,WAAW;KAGvB,SAAS,gBAAgB,KAAA;KACzB;IACJ;IAIA,IAAI,CAAC,aAAc,UAAU,WAAW,SAAS,QAAQ,QACrD,WAAW,KAAK,UAAU,SAAS,MAAM,OAAO,GAAG,OAAO;SAG1D,WAAW,KAAK,UAAU,YAAY,OAAO,MAAM,GAAG,OAAO;IAEjE,SAAS,KAAK,cAAc,UAAU,WAAW,WAAW,cAAc,OAAO;IACjF,IAAI,SAAS,SAAS,KAAK,UAAU,SAAS,KAAK,QAE/C,OAAO,KAAK,KAAK,YAAY,SAAS,eAAe,WAAW,SAAS,CAAC,KAAK;SAE9E;KACD,SAAS,gBAAgB;KACzB,IAAI,SAAS,SAAS,KAAK,QACvB,wBAAwB,KAAK,IAAI,uBAAuB,eAAe,CAAC;KAE5E,IAAI,SAAS,KAAK,QACd,wBAAwB,KAAK,IAAI,uBAAuB,eAAe,CAAC;IAEhF;GACJ;GACA;EACJ;EAKA,IAAI,UACA,CAAC,SAAS,OAAO;GACb,WAAW,WAAY;IACnB,IAAI,aAAa,iBAAiB,KAAK,IAAI,IAAI,qBAC3C,OAAO,SAAS,KAAA,CAAS;IAE7B,IAAI,CAAC,eAAe,GAChB,KAAK;GAEb,GAAG,CAAC;EACR,GAAE;OAGF,OAAO,cAAc,iBAAiB,KAAK,IAAI,KAAK,qBAAqB;GACrE,MAAM,MAAM,eAAe;GAC3B,IAAI,KACA,OAAO;EAEf;CAER;CACA,UAAU,MAAM,OAAO,SAAS,WAAW,SAAS;EAChD,MAAM,OAAO,KAAK;EAClB,IAAI,QAAQ,CAAC,QAAQ,qBAAqB,KAAK,UAAU,SAAS,KAAK,YAAY,SAC/E,OAAO;GACH,QAAQ,KAAK,SAAS;GACtB,eAAe;IAAE,OAAO,KAAK,QAAQ;IAAU;IAAgB;IAAS,mBAAmB,KAAK;GAAkB;EACtH;OAGA,OAAO;GACH,QAAQ,KAAK,SAAS;GACtB,eAAe;IAAE,OAAO;IAAU;IAAgB;IAAS,mBAAmB;GAAK;EACvF;CAER;CACA,cAAc,UAAU,WAAW,WAAW,cAAc,SAAS;EACjE,MAAM,SAAS,UAAU,QAAQ,SAAS,UAAU;EACpD,IAAI,SAAS,SAAS,QAAQ,SAAS,SAAS,cAAc,cAAc;EAC5E,OAAO,SAAS,IAAI,UAAU,SAAS,IAAI,UAAU,KAAK,OAAO,UAAU,SAAS,IAAI,UAAU,SAAS,IAAI,OAAO,GAAG;GACrH;GACA;GACA;GACA,IAAI,QAAQ,mBACR,SAAS,gBAAgB;IAAE,OAAO;IAAG,mBAAmB,SAAS;IAAe,OAAO;IAAO,SAAS;GAAM;EAErH;EACA,IAAI,eAAe,CAAC,QAAQ,mBACxB,SAAS,gBAAgB;GAAE,OAAO;GAAa,mBAAmB,SAAS;GAAe,OAAO;GAAO,SAAS;EAAM;EAE3H,SAAS,SAAS;EAClB,OAAO;CACX;CACA,OAAO,MAAM,OAAO,SAAS;EACzB,IAAI,QAAQ,YACR,OAAO,QAAQ,WAAW,MAAM,KAAK;OAGrC,OAAO,SAAS,SACR,CAAC,CAAC,QAAQ,cAAc,KAAK,YAAY,MAAM,MAAM,YAAY;CAEjF;CACA,YAAY,OAAO;EACf,MAAM,MAAM,CAAC;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAC9B,IAAI,MAAM,IACN,IAAI,KAAK,MAAM,EAAE;EAGzB,OAAO;CACX;CAEA,UAAU,OAAO,SAAS;EACtB,OAAO;CACX;CAEA,SAAS,OAAO,SAAS;EACrB,OAAO,MAAM,KAAK,KAAK;CAC3B;CACA,KAAK,OAAO;EAKR,OAAO,MAAM,KAAK,EAAE;CACxB;CACA,YAAY,eAEZ,SAAS;EACL,OAAO;CACX;CACA,IAAI,kBAAkB;EAClB,OAAO;CACX;CACA,YAAY,eAAe,WAAW,WAAW;EAG7C,MAAM,aAAa,CAAC;EACpB,IAAI;EACJ,OAAO,eAAe;GAClB,WAAW,KAAK,aAAa;GAC7B,gBAAgB,cAAc;GAC9B,OAAO,cAAc;GACrB,gBAAgB;EACpB;EACA,WAAW,QAAQ;EACnB,MAAM,eAAe,WAAW;EAChC,IAAI,eAAe,GAAG,SAAS,GAAG,SAAS;EAC3C,OAAO,eAAe,cAAc,gBAAgB;GAChD,MAAM,YAAY,WAAW;GAC7B,IAAI,CAAC,UAAU,SAAS;IACpB,IAAI,CAAC,UAAU,SAAS,KAAK,iBAAiB;KAC1C,IAAI,QAAQ,UAAU,MAAM,QAAQ,SAAS,UAAU,KAAK;KAC5D,QAAQ,MAAM,IAAI,SAAU,OAAO,GAAG;MAClC,MAAM,WAAW,UAAU,SAAS;MACpC,OAAO,SAAS,SAAS,MAAM,SAAS,WAAW;KACvD,CAAC;KACD,UAAU,QAAQ,KAAK,KAAK,KAAK;IACrC,OAEI,UAAU,QAAQ,KAAK,KAAK,UAAU,MAAM,QAAQ,SAAS,UAAU,KAAK,CAAC;IAEjF,UAAU,UAAU;IAEpB,IAAI,CAAC,UAAU,OACX,UAAU,UAAU;GAE5B,OACK;IACD,UAAU,QAAQ,KAAK,KAAK,UAAU,MAAM,QAAQ,SAAS,UAAU,KAAK,CAAC;IAC7E,UAAU,UAAU;GACxB;EACJ;EACA,OAAO;CACX;AACJ;;;AC3PA,IAAM,gBAAN,cAA4B,KAAK,CACjC;AAC6B,IAAI,cAAc;;;ACH/C,SAAgB,oBAAoB,MAAM,MAAM;CAC5C,IAAI;CACJ,KAAK,IAAI,GAAG,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ,KAC5C,IAAI,KAAK,MAAM,KAAK,IAChB,OAAO,KAAK,MAAM,GAAG,CAAC;CAG9B,OAAO,KAAK,MAAM,GAAG,CAAC;AAC1B;AACA,SAAgB,oBAAoB,MAAM,MAAM;CAC5C,IAAI;CAIJ,IAAI,CAAC,QAAQ,CAAC,QAAQ,KAAK,KAAK,SAAS,MAAM,KAAK,KAAK,SAAS,IAC9D,OAAO;CAEX,KAAK,IAAI,GAAG,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ,KAC5C,IAAI,KAAK,KAAK,UAAU,IAAI,OAAO,KAAK,KAAK,UAAU,IAAI,KACvD,OAAO,KAAK,MAAM,CAAC,CAAC;CAG5B,OAAO,KAAK,MAAM,CAAC,CAAC;AACxB;AACA,SAAgB,cAAc,QAAQ,WAAW,WAAW;CACxD,IAAI,OAAO,MAAM,GAAG,UAAU,MAAM,KAAK,WACrC,MAAM,MAAM,UAAU,KAAK,UAAU,MAAM,EAAE,6BAA6B,KAAK,UAAU,SAAS,EAAE,gBAAgB;CAExH,OAAO,YAAY,OAAO,MAAM,UAAU,MAAM;AACpD;AACA,SAAgB,cAAc,QAAQ,WAAW,WAAW;CACxD,IAAI,CAAC,WACD,OAAO,SAAS;CAEpB,IAAI,OAAO,MAAM,CAAC,UAAU,MAAM,KAAK,WACnC,MAAM,MAAM,UAAU,KAAK,UAAU,MAAM,EAAE,2BAA2B,KAAK,UAAU,SAAS,EAAE,gBAAgB;CAEtH,OAAO,OAAO,MAAM,GAAG,CAAC,UAAU,MAAM,IAAI;AAChD;AACA,SAAgB,aAAa,QAAQ,WAAW;CAC5C,OAAO,cAAc,QAAQ,WAAW,EAAE;AAC9C;AACA,SAAgB,aAAa,QAAQ,WAAW;CAC5C,OAAO,cAAc,QAAQ,WAAW,EAAE;AAC9C;AACA,SAAgB,eAAe,SAAS,SAAS;CAC7C,OAAO,QAAQ,MAAM,GAAG,aAAa,SAAS,OAAO,CAAC;AAC1D;AAEA,SAAS,aAAa,GAAG,GAAG;CAExB,IAAI,SAAS;CACb,IAAI,EAAE,SAAS,EAAE,QACb,SAAS,EAAE,SAAS,EAAE;CAE1B,IAAI,OAAO,EAAE;CACb,IAAI,EAAE,SAAS,EAAE,QACb,OAAO,EAAE;CAKb,MAAM,MAAM,MAAM,IAAI;CACtB,IAAI,IAAI;CACR,IAAI,KAAK;CACT,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;EAC3B,IAAI,EAAE,MAAM,EAAE,IACV,IAAI,KAAK,IAAI;OAGb,IAAI,KAAK;EAEb,OAAO,IAAI,KAAK,EAAE,MAAM,EAAE,IACtB,IAAI,IAAI;EAEZ,IAAI,EAAE,MAAM,EAAE,IACV;CAER;CAEA,IAAI;CACJ,KAAK,IAAI,IAAI,QAAQ,IAAI,EAAE,QAAQ,KAAK;EACpC,OAAO,IAAI,KAAK,EAAE,MAAM,EAAE,IACtB,IAAI,IAAI;EAEZ,IAAI,EAAE,MAAM,EAAE,IACV;CAER;CACA,OAAO;AACX;;;;;;;;;;;AAuBA,SAAgB,QAAQ,QAAQ,WAAW;CACvC,MAAM,QAAQ,CAAC;CACf,KAAK,MAAM,cAAc,MAAM,KAAK,UAAU,QAAQ,MAAM,CAAC,GAAG;EAC5D,MAAM,UAAU,WAAW;EAC3B,IAAI,MAAM,UAAW,KAAM,KAAK,MAAM,MAAM,SAAS,EAAE,KAAM,KAAM,KAAK,OAAO,GAC3E,MAAM,MAAM,SAAS,MAAM;OAG3B,MAAM,KAAK,OAAO;CAE1B;CACA,OAAO;AACX;AAcA,SAAgB,WAAW,QAAQ,WAAW;CAC1C,IAAI,WACA,OAAO,qBAAqB,QAAQ,SAAS,EAAE;CAanD,IAAI;CACJ,KAAK,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAChC,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,GACrB;CAGR,OAAO,OAAO,UAAU,IAAI,CAAC;AACjC;AACA,SAAgB,UAAU,QAAQ,WAAW;CACzC,IAAI,WACA,OAAO,qBAAqB,QAAQ,SAAS,EAAE;CAGnD,MAAM,QAAQ,OAAO,MAAM,MAAM;CACjC,OAAO,QAAQ,MAAM,KAAK;AAC9B;AACA,SAAgB,qBAAqB,QAAQ,WAAW;CACpD,IAAI,CAAC,WACD,OAAO,CAAC,UAAU,MAAM,GAAG,WAAW,MAAM,CAAC;CAEjD,IAAI,UAAU,gBAAgB,EAAE,eAAe,QAC3C,MAAM,IAAI,MAAM,0DAAwD;CAE5E,MAAM,WAAW,QAAQ,QAAQ,SAAS;CAC1C,MAAM,WAAW,SAAS;CAC1B,MAAM,UAAU,SAAS,SAAS,SAAS;CAG3C,OAAO,CAFO,KAAM,KAAK,QAAQ,IAAI,WAAW,IAClC,KAAM,KAAK,OAAO,IAAI,UAAU,EAC5B;AACtB;;;ACjKA,MAAM,oBAAoB;AAyB1B,MAAM,8BAA8B,IAAI,OAAO,IAAI,kBAAkB,YAAY,kBAAkB,IAAI,IAAI;AAC3G,IAAM,WAAN,cAAuB,KAAK;CACxB,OAAO,MAAM,OAAO,SAAS;EACzB,IAAI,QAAQ,YAAY;GACpB,OAAO,KAAK,YAAY;GACxB,QAAQ,MAAM,YAAY;EAC9B;EACA,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK;CACtC;CACA,SAAS,OAAO,UAAU,CAAC,GAAG;EAC1B,IAAI;EACJ,IAAI,QAAQ,eAAe;GACvB,MAAM,YAAY,QAAQ;GAC1B,IAAI,UAAU,gBAAgB,EAAE,eAAe,QAC3C,MAAM,IAAI,MAAM,0DAAwD;GAO5E,QAAQ,QAAQ,OAAO,SAAS;EACpC,OAEI,QAAQ,MAAM,MAAM,2BAA2B,KAAK,CAAC;EAEzD,MAAM,SAAS,CAAC;EAChB,IAAI,WAAW;EACf,MAAM,SAAQ,SAAQ;GAClB,IAAK,KAAM,KAAK,IAAI,GAChB,IAAI,YAAY,MACZ,OAAO,KAAK,IAAI;QAGhB,OAAO,KAAK,OAAO,IAAI,IAAI,IAAI;QAGlC,IAAI,YAAY,QAAS,KAAM,KAAK,QAAQ,GAC7C,IAAI,OAAO,OAAO,SAAS,MAAM,UAC7B,OAAO,KAAK,OAAO,IAAI,IAAI,IAAI;QAG/B,OAAO,KAAK,WAAW,IAAI;QAI/B,OAAO,KAAK,IAAI;GAEpB,WAAW;EACf,CAAC;EACD,OAAO;CACX;CACA,KAAK,QAAQ;EAMT,OAAO,OAAO,KAAK,OAAO,MAAM;GAC5B,IAAI,KAAK,GACL,OAAO;QAGP,OAAO,MAAM,QAAS,QAAS,EAAE;EAEzC,CAAC,EAAE,KAAK,EAAE;CACd;CACA,YAAY,SAAS,SAAS;EAC1B,IAAI,CAAC,WAAW,QAAQ,mBACpB,OAAO;EAEX,IAAI,WAAW;EAGf,IAAI,YAAY;EAChB,IAAI,WAAW;EACf,QAAQ,SAAQ,WAAU;GACtB,IAAI,OAAO,OACP,YAAY;QAEX,IAAI,OAAO,SACZ,WAAW;QAEV;IACD,IAAI,aAAa,UACb,gCAAgC,UAAU,UAAU,WAAW,QAAQ,QAAQ,aAAa;IAEhG,WAAW;IACX,YAAY;IACZ,WAAW;GACf;EACJ,CAAC;EACD,IAAI,aAAa,UACb,gCAAgC,UAAU,UAAU,WAAW,MAAM,QAAQ,aAAa;EAE9F,OAAO;CACX;AACJ;AACwB,IAAI,SAAS;AAWrC,SAAS,gCAAgC,WAAW,UAAU,WAAW,SAAS,WAAW;CA0CzF,IAAI,YAAY,WAAW;EACvB,MAAM,CAAC,aAAa,eAAe,qBAAqB,SAAS,OAAO,SAAS;EACjF,MAAM,CAAC,aAAa,eAAe,qBAAqB,UAAU,OAAO,SAAS;EAClF,IAAI,WAAW;GACX,MAAM,iBAAiB,oBAAoB,aAAa,WAAW;GACnE,UAAU,QAAQ,cAAc,UAAU,OAAO,aAAa,cAAc;GAC5E,SAAS,QAAQ,aAAa,SAAS,OAAO,cAAc;GAC5D,UAAU,QAAQ,aAAa,UAAU,OAAO,cAAc;EAClE;EACA,IAAI,SAAS;GACT,MAAM,iBAAiB,oBAAoB,aAAa,WAAW;GACnE,QAAQ,QAAQ,cAAc,QAAQ,OAAO,aAAa,cAAc;GACxE,SAAS,QAAQ,aAAa,SAAS,OAAO,cAAc;GAC5D,UAAU,QAAQ,aAAa,UAAU,OAAO,cAAc;EAClE;CACJ,OACK,IAAI,WAAW;EAOhB,IAAI,WAAW;GACX,MAAM,KAAK,UAAU,UAAU,OAAO,SAAS;GAC/C,UAAU,QAAQ,UAAU,MAAM,UAAU,GAAG,MAAM;EACzD;EACA,IAAI,SAAS;GACT,MAAM,KAAK,UAAU,QAAQ,OAAO,SAAS;GAC7C,QAAQ,QAAQ,QAAQ,MAAM,UAAU,GAAG,MAAM;EACrD;CAEJ,OACK,IAAI,aAAa,SAAS;EAC3B,MAAM,YAAY,UAAU,QAAQ,OAAO,SAAS,GAAG,CAAC,YAAY,YAAY,qBAAqB,SAAS,OAAO,SAAS;EAG9H,MAAM,aAAa,oBAAoB,WAAW,UAAU;EAC5D,SAAS,QAAQ,aAAa,SAAS,OAAO,UAAU;EAIxD,MAAM,WAAW,oBAAoB,aAAa,WAAW,UAAU,GAAG,QAAQ;EAClF,SAAS,QAAQ,aAAa,SAAS,OAAO,QAAQ;EACtD,QAAQ,QAAQ,cAAc,QAAQ,OAAO,WAAW,QAAQ;EAGhE,UAAU,QAAQ,cAAc,UAAU,OAAO,WAAW,UAAU,MAAM,GAAG,UAAU,SAAS,SAAS,MAAM,CAAC;CACtH,OACK,IAAI,SAAS;EAId,MAAM,kBAAkB,UAAU,QAAQ,OAAO,SAAS;EAE1D,MAAM,UAAU,eADS,WAAW,SAAS,OAAO,SACN,GAAG,eAAe;EAChE,SAAS,QAAQ,aAAa,SAAS,OAAO,OAAO;CACzD,OACK,IAAI,WAAW;EAMhB,MAAM,UAAU,eAFU,WAAW,UAAU,OAAO,SAEP,GADtB,UAAU,SAAS,OAAO,SACc,CAAC;EAClE,SAAS,QAAQ,aAAa,SAAS,OAAO,OAAO;CACzD;AACJ;AACA,IAAM,qBAAN,cAAiC,KAAK;CAClC,SAAS,OAAO;EAMZ,MAAM,QAAQ,IAAI,OAAO,cAAc,kBAAkB,qBAAqB,kBAAkB,IAAI,IAAI;EACxG,OAAO,MAAM,MAAM,KAAK,KAAK,CAAC;CAClC;AACJ;AACkC,IAAI,mBAAmB;;;ACnRzD,IAAM,WAAN,cAAuB,KAAK;CACxB,cAAc;EACV,MAAM,GAAG,SAAS;EAClB,KAAK,WAAW;CACpB;CACA,OAAO,MAAM,OAAO,SAAS;EAQzB,IAAI,QAAQ,kBAAkB;GAC1B,IAAI,CAAC,QAAQ,kBAAkB,CAAC,KAAK,SAAS,IAAI,GAC9C,OAAO,KAAK,KAAK;GAErB,IAAI,CAAC,QAAQ,kBAAkB,CAAC,MAAM,SAAS,IAAI,GAC/C,QAAQ,MAAM,KAAK;EAE3B,OACK,IAAI,QAAQ,sBAAsB,CAAC,QAAQ,gBAAgB;GAC5D,IAAI,KAAK,SAAS,IAAI,GAClB,OAAO,KAAK,MAAM,GAAG,EAAE;GAE3B,IAAI,MAAM,SAAS,IAAI,GACnB,QAAQ,MAAM,MAAM,GAAG,EAAE;EAEjC;EACA,OAAO,MAAM,OAAO,MAAM,OAAO,OAAO;CAC5C;AACJ;AACA,MAAa,WAAW,IAAI,SAAS;AACrC,SAAgB,UAAU,QAAQ,QAAQ,SAAS;CAC/C,OAAO,SAAS,KAAK,QAAQ,QAAQ,OAAO;AAChD;AAMA,SAAgB,SAAS,OAAO,SAAS;CACrC,IAAI,QAAQ,iBAER,QAAQ,MAAM,QAAQ,SAAS,IAAI;CAEvC,MAAM,WAAW,CAAC,GAAG,mBAAmB,MAAM,MAAM,WAAW;CAE/D,IAAI,CAAC,iBAAiB,iBAAiB,SAAS,IAC5C,iBAAiB,IAAI;CAGzB,KAAK,IAAI,IAAI,GAAG,IAAI,iBAAiB,QAAQ,KAAK;EAC9C,MAAM,OAAO,iBAAiB;EAC9B,IAAI,IAAI,KAAK,CAAC,QAAQ,gBAClB,SAAS,SAAS,SAAS,MAAM;OAGjC,SAAS,KAAK,IAAI;CAE1B;CACA,OAAO;AACX;;;AC/DA,SAAS,mBAAmB,MAAM;CAC9B,OAAO,QAAQ,OAAO,QAAQ,OAAO,QAAQ;AACjD;AACA,IAAM,eAAN,cAA2B,KAAK;CAC5B,SAAS,OAAO;EACZ,IAAI;EAMJ,MAAM,SAAS,CAAC;EAChB,IAAI,cAAc;EAClB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACnC,IAAI,KAAK,MAAM,SAAS,GAAG;IACvB,OAAO,KAAK,MAAM,MAAM,WAAW,CAAC;IACpC;GACJ;GACA,IAAI,mBAAmB,MAAM,EAAE,KAAK,MAAM,IAAI,GAAG,MAAM,IAAI,GAAG;IAI1D,OAAO,KAAK,MAAM,MAAM,aAAa,IAAI,CAAC,CAAC;IAE3C,IAAI,cAAc,IAAI;IACtB,QAAQ,KAAK,MAAM,IAAI,QAAQ,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,MAAM,IAAI,GACzE;IAEJ,OAAO,KAAK,MAAM,MAAM,aAAa,IAAI,CAAC,CAAC;IAI3C,cAAc,IAAI;GACtB;EACJ;EACA,OAAO;CACX;AACJ;AAC4B,IAAI,aAAa;;;ACtC7C,IAAM,UAAN,cAAsB,KAAK;CACvB,SAAS,OAAO;EACZ,OAAO,MAAM,MAAM,eAAe;CACtC;AACJ;AACuB,IAAI,QAAQ;;;ACJnC,IAAM,WAAN,cAAuB,KAAK;CACxB,cAAc;EACV,MAAM,GAAG,SAAS;EAClB,KAAK,WAAW;CACpB;CACA,IAAI,kBAAkB;EAGlB,OAAO;CACX;CACA,UAAU,OAAO,SAAS;EACtB,MAAM,EAAE,sBAAsB,qBAAqB,GAAG,MAAM,OAAO,MAAM,cAAc,uBAAuB,MAAM;EACpH,OAAO,OAAO,UAAU,WAAW,QAAQ,KAAK,UAAU,aAAa,OAAO,MAAM,MAAM,iBAAiB,GAAG,MAAM,IAAI;CAC5H;CACA,OAAO,MAAM,OAAO,SAAS;EACzB,OAAO,MAAM,OAAO,KAAK,QAAQ,cAAc,IAAI,GAAG,MAAM,QAAQ,cAAc,IAAI,GAAG,OAAO;CACpG;AACJ;AACwB,IAAI,SAAS;AAMrC,SAAgB,aAAa,KAAK,OAAO,kBAAkB,UAAU,KAAK;CACtE,QAAQ,SAAS,CAAC;CAClB,mBAAmB,oBAAoB,CAAC;CACxC,IAAI,UACA,MAAM,SAAS,QAAQ,KAAA,IAAY,KAAK,KAAK,GAAG;CAEpD,IAAI;CACJ,KAAK,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAC/B,IAAI,MAAM,OAAO,KACb,OAAO,iBAAiB;CAGhC,IAAI;CACJ,IAAI,qBAAqB,OAAO,UAAU,SAAS,KAAK,GAAG,GAAG;EAC1D,MAAM,KAAK,GAAG;EACd,mBAAmB,IAAI,MAAM,IAAI,MAAM;EACvC,iBAAiB,KAAK,gBAAgB;EACtC,KAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,GAC7B,iBAAiB,KAAK,aAAa,IAAI,IAAI,OAAO,kBAAkB,UAAU,OAAO,CAAC,CAAC;EAE3F,MAAM,IAAI;EACV,iBAAiB,IAAI;EACrB,OAAO;CACX;CACA,IAAI,OAAO,IAAI,QACX,MAAM,IAAI,OAAO;CAErB,IAAI,OAAO,QAAQ,YAAY,QAAQ,MAAM;EACzC,MAAM,KAAK,GAAG;EACd,mBAAmB,CAAC;EACpB,iBAAiB,KAAK,gBAAgB;EACtC,MAAM,aAAa,CAAC;EACpB,IAAI;EACJ,KAAK,OAAO;;EAER,IAAI,OAAO,UAAU,eAAe,KAAK,KAAK,GAAG,GAC7C,WAAW,KAAK,GAAG;EAG3B,WAAW,KAAK;EAChB,KAAK,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK,GAAG;GACvC,MAAM,WAAW;GACjB,iBAAiB,OAAO,aAAa,IAAI,MAAM,OAAO,kBAAkB,UAAU,GAAG;EACzF;EACA,MAAM,IAAI;EACV,iBAAiB,IAAI;CACzB,OAEI,mBAAmB;CAEvB,OAAO;AACX;;;AC5EA,IAAM,YAAN,cAAwB,KAAK;CACzB,SAAS,OAAO;EACZ,OAAO,MAAM,MAAM;CACvB;CACA,KAAK,OAAO;EACR,OAAO;CACX;CACA,YAAY,OAAO;EACf,OAAO;CACX;AACJ;AACyB,IAAI,UAAU;;;ACXvC,MAAa,kBAAkB;CAC3B,cAAc;CACd,kBAAkB;CAClB,oBAAoB;AACxB;AAWA,SAAgB,gBAAgB,aAAa,aAAa,QAAQ,QAAQ,WAAW,WAAW,SAAS;CACrG,IAAI;CACJ,IAAI,CAAC,SACD,aAAa,CAAC;MAEb,IAAI,OAAO,YAAY,YACxB,aAAa,EAAE,UAAU,QAAQ;MAGjC,aAAa;CAEjB,IAAI,OAAO,WAAW,YAAY,aAC9B,WAAW,UAAU;CAIzB,MAAM,UAAU,WAAW;CAE3B,IAAI,WAAW,gBACX,MAAM,IAAI,MAAM,6FAA6F;CAEjH,IAAI,CAAC,WAAW,UACZ,OAAO,uBAAuB,UAAU,QAAQ,QAAQ,UAAU,CAAC;MAElE;EACD,MAAM,EAAE,aAAa;EACrB,UAAU,QAAQ,QAAQ,OAAO,OAAO,OAAO,OAAO,CAAC,GAAG,UAAU,GAAG,EAAE,WAAW,SAAS;GAIrF,SAHc,uBAAuB,IAGxB,CAAC;EAClB,EAAE,CAAC,CAAC;CACZ;CACA,SAAS,uBAAuB,MAAM;EAGlC,IAAI,CAAC,MACD;EAEJ,KAAK,KAAK;GAAE,OAAO;GAAI,OAAO,CAAC;EAAE,CAAC;EAClC,SAAS,aAAa,OAAO;GACzB,OAAO,MAAM,IAAI,SAAU,OAAO;IAAE,OAAO,MAAM;GAAO,CAAC;EAC7D;EACA,MAAM,QAAQ,CAAC;EACf,IAAI,gBAAgB,GAAG,gBAAgB,GAAG,WAAW,CAAC,GAAG,UAAU,GAAG,UAAU;EAChF,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GAClC,MAAM,UAAU,KAAK,IAAI,QAAQ,QAAQ,SAAS,WAAW,QAAQ,KAAK;GAC1E,QAAQ,QAAQ;GAChB,IAAI,QAAQ,SAAS,QAAQ,SAAS;IAElC,IAAI,CAAC,eAAe;KAChB,MAAM,OAAO,KAAK,IAAI;KACtB,gBAAgB;KAChB,gBAAgB;KAChB,IAAI,MAAM;MACN,WAAW,UAAU,IAAI,aAAa,KAAK,MAAM,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC;MACrE,iBAAiB,SAAS;MAC1B,iBAAiB,SAAS;KAC9B;IACJ;IAEA,KAAK,MAAM,QAAQ,OACf,SAAS,MAAM,QAAQ,QAAQ,MAAM,OAAO,IAAI;IAGpD,IAAI,QAAQ,OACR,WAAW,MAAM;SAGjB,WAAW,MAAM;GAEzB,OACK;IAED,IAAI,eAEA,IAAI,MAAM,UAAU,UAAU,KAAK,IAAI,KAAK,SAAS,GAEjD,KAAK,MAAM,QAAQ,aAAa,KAAK,GACjC,SAAS,KAAK,IAAI;SAGrB;KAED,MAAM,cAAc,KAAK,IAAI,MAAM,QAAQ,OAAO;KAClD,KAAK,MAAM,QAAQ,aAAa,MAAM,MAAM,GAAG,WAAW,CAAC,GACvD,SAAS,KAAK,IAAI;KAEtB,MAAM,OAAO;MACT,UAAU;MACV,UAAW,UAAU,gBAAgB;MACrC,UAAU;MACV,UAAW,UAAU,gBAAgB;MACrC,OAAO;KACX;KACA,MAAM,KAAK,IAAI;KACf,gBAAgB;KAChB,gBAAgB;KAChB,WAAW,CAAC;IAChB;IAEJ,WAAW,MAAM;IACjB,WAAW,MAAM;GACrB;EACJ;EAGA,KAAK,MAAM,QAAQ,OACf,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,KACnC,IAAI,KAAK,MAAM,GAAG,SAAS,IAAI,GAC3B,KAAK,MAAM,KAAK,KAAK,MAAM,GAAG,MAAM,GAAG,EAAE;OAExC;GACD,KAAK,MAAM,OAAO,IAAI,GAAG,GAAG,8BAA8B;GAC1D;EACJ;EAGR,OAAO;GACU;GAA0B;GAC5B;GAAsB;GAC1B;EACX;CACJ;AACJ;;;;;AAKA,SAAgB,YAAY,OAAO,eAAe;CAC9C,IAAI,CAAC,eACD,gBAAgB;CAEpB,IAAI,MAAM,QAAQ,KAAK,GAAG;EACtB,IAAI,MAAM,SAAS,KAAK,CAAC,cAAc,oBACnC,MAAM,IAAI,MAAM,qKAEwC;EAE5D,OAAO,MAAM,KAAI,MAAK,YAAY,GAAG,aAAa,CAAC,EAAE,KAAK,IAAI;CAClE;CACA,MAAM,MAAM,CAAC;CACb,IAAI,cAAc,gBAAgB,MAAM,eAAe,MAAM,aACzD,IAAI,KAAK,YAAY,MAAM,WAAW;CAE1C,IAAI,cAAc,kBACd,IAAI,KAAK,qEAAqE;CAElF,IAAI,cAAc,oBAAoB;EAClC,IAAI,KAAK,SAAS,MAAM,eAAe,OAAO,MAAM,cAAc,cAAc,KAAK,MAAO,MAAM,UAAU;EAC5G,IAAI,KAAK,SAAS,MAAM,eAAe,OAAO,MAAM,cAAc,cAAc,KAAK,MAAO,MAAM,UAAU;CAChH;CACA,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,MAAM,QAAQ,KAAK;EACzC,MAAM,OAAO,MAAM,MAAM;EAIzB,IAAI,KAAK,aAAa,GAClB,KAAK,YAAY;EAErB,IAAI,KAAK,aAAa,GAClB,KAAK,YAAY;EAErB,IAAI,KAAK,SAAS,KAAK,WAAW,MAAM,KAAK,WACvC,OAAO,KAAK,WAAW,MAAM,KAAK,WAClC,KAAK;EACX,KAAK,MAAM,QAAQ,KAAK,OACpB,IAAI,KAAK,IAAI;CAErB;CACA,OAAO,IAAI,KAAK,IAAI,IAAI;AAC5B;AACA,SAAgB,oBAAoB,aAAa,aAAa,QAAQ,QAAQ,WAAW,WAAW,SAAS;CACzG,IAAI,OAAO,YAAY,YACnB,UAAU,EAAE,UAAU,QAAQ;CAElC,IAAI,EAAE,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,WAAW;EACvE,MAAM,WAAW,gBAAgB,aAAa,aAAa,QAAQ,QAAQ,WAAW,WAAW,OAAO;EACxG,IAAI,CAAC,UACD;EAEJ,OAAO,YAAY,UAAU,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,aAAa;CACxG,OACK;EACD,MAAM,EAAE,aAAa;EACrB,gBAAgB,aAAa,aAAa,QAAQ,QAAQ,WAAW,WAAW,OAAO,OAAO,OAAO,OAAO,CAAC,GAAG,OAAO,GAAG,EAAE,WAAU,aAAY;GAC1I,IAAI,CAAC,UACD,SAAS,KAAA,CAAS;QAGlB,SAAS,YAAY,UAAU,QAAQ,aAAa,CAAC;EAE7D,EAAE,CAAC,CAAC;CACZ;AACJ;;;;AAOA,SAAS,WAAW,MAAM;CACtB,MAAM,gBAAgB,KAAK,SAAS,IAAI;CACxC,MAAM,SAAS,KAAK,MAAM,IAAI,EAAE,KAAI,SAAQ,OAAO,IAAI;CACvD,IAAI,eACA,OAAO,IAAI;MAGX,OAAO,KAAK,OAAO,IAAI,EAAE,MAAM,GAAG,EAAE,CAAC;CAEzC,OAAO;AACX;;;4ECnOmF;AACmE,IAAI,IAAE;CAAC,MAAK;CAAO,SAAQ;CAA6B,OAAM;CAA+B,SAAQ;EAAC;EAAyD;EAAqD;EAA+D;EAA6C;CAA8C;AAAC,GAAE,IAAE;CAAC,SAAQ;EAAC,OAAM;EAAI,MAAK;EAAU,MAAK;CAAS;CAAE,OAAM;EAAC,OAAM;EAAI,MAAK;EAAQ,MAAK;CAAS;CAAE,YAAW;EAAC,OAAM;EAAI,MAAK;EAAyB,MAAK;CAAS;CAAE,YAAW;EAAC,OAAM;EAAI,MAAK;EAAc,MAAK;CAAS;AAAC,GAAE,IAAE;CAAC,MAAK;CAAO,MAAM,QAAQ,GAAE,GAAE;EAAC,IAAGA,uBAAAA,EAAE,CAAC,GAAE,OAAOC,uBAAAA,EAAE,CAAC;EAAE,IAAI,IAAEC,uBAAAA,EAAE,QAAO,GAAE,CAAC;EAAE,IAAG,CAAC,EAAE,IAAG,OAAO,EAAE;EAAM,IAAI,IAAE,EAAE,OAAO,MAAM,OAAM,IAAE,EAAE,OAAO,MAAM,YAAW,IAAE,EAAE,OAAO,MAAM,YAAW,IAAE,EAAE,OAAO;EAAW,IAAG,EAAE,OAAO,MAAM,SAAQ,EAAE,SAAO,GAAE,OAAM;GAAC,QAAO;GAAG,QAAO;;GAC9+B,UAAS;EAAC;EAAE,IAAI,GAAEC,KAAE,CAAC,GAAEC,OAAG;EAAE,IAAG;GAAC,IAAE,MAAI,MAAIC,cAAAA,EAAE,EAAE,KAAK,IAAE,MAAM,EAAE,GAAG,SAAS,EAAE,GAAG,YAAY,EAAE,KAAI,CAAC,CAAC;EAAC,QAAM;GAAC,OAAM;IAAC,QAAO;IAAG,QAAO,SAAS,EAAE;;IAC7I,UAAS;GAAC;EAAC;EAAC,IAAG;GAAC,MAAED,QAAI,MAAIC,cAAAA,EAAE,EAAE,KAAK,IAAE,MAAM,EAAE,GAAG,SAAS,EAAE,GAAG,YAAY,EAAE,KAAID,GAAC,CAAC;EAAC,QAAM;GAAC,OAAM;IAAC,QAAO;IAAG,QAAO,SAASA,IAAE;;IAC7H,UAAS;GAAC;EAAC;EAAC,IAAI,IAAE,GAAE,IAAED;EAAE,OAAO,MAAI,IAAE,EAAE,YAAY,GAAE,IAAE,EAAE,YAAY,IAAG,MAAI,IAAE,IAAE;GAAC,QAAO,SAAS,EAAE,OAAOC,IAAE;;GAC5G,QAAO;GAAG,UAAS;EAAC,IAAE;GAAC,QAAO;GAAG,QAAO;GAAG,UAAS;EAAC,IAAE,IAAE;GAAC,QAAO,SAAS,EAAE,OAAOA,IAAE;;GACrF,QAAO;GAAG,UAAS;EAAC,IAAE;GAAC,QAAOE,oBAAsB,GAAEF,KAAE,GAAED,KAAE,IAAG,IAAG,EAAC,SAAQ,EAAC,CAAC;GAAE,QAAO;GAAG,UAAS;EAAC;CAAC;AAAC;;;4ECNpB"}

package/dist/{dist-CeLVqJha.mjs → dist-Bc-S2RCv.mjs}

@@ -5694,6 +5694,43 @@ object({
 	details: array(ValidationErrorDetailSchema$1).optional()
 });
 object({ message: string() });
+const CHAT_ATTACHMENT_MAX_BYTES$1 = 10 * 1024 * 1024;
+[
+	{
+		mediaType: "image/png",
+		ext: "png"
+	},
+	{
+		mediaType: "image/jpeg",
+		ext: "jpg"
+	},
+	{
+		mediaType: "image/webp",
+		ext: "webp"
+	},
+	{
+		mediaType: "image/gif",
+		ext: "gif"
+	},
+	{
+		mediaType: "application/pdf",
+		ext: "pdf"
+	}
+].map((type) => type.mediaType);
+const ChatAttachmentInputSchema$1 = object({
+	storageKey: string().min(1),
+	mediaType: string().min(1),
+	filename: string().optional()
+});
+object({
+	contentType: string().min(1),
+	filename: string().min(1),
+	size: number$1().int().positive().max(CHAT_ATTACHMENT_MAX_BYTES$1)
+});
+object({
+	uploadUrl: string().url(),
+	storageKey: string().min(1)
+});
 const CredentialRunContextSchema$1 = object({
 	orgId: string().min(1).optional(),
 	projectId: string().min(1).optional(),
@@ -5711,12 +5748,13 @@ const ThinkingLevelSchema$1 = _enum([
 	"xhigh"
 ]);
 object({
-	message: string().min(1),
+	message: string(),
 	sessionId: string().min(1).optional(),
 	subscriptionId: string().min(1).optional(),
 	context: CredentialRunContextSchema$1.optional(),
-	thinkingLevel: ThinkingLevelSchema$1.optional()
-});
+	thinkingLevel: ThinkingLevelSchema$1.optional(),
+	files: array(ChatAttachmentInputSchema$1).max(5).optional()
+}).refine((data) => data.message.trim().length > 0 || (data.files?.length ?? 0) > 0, { message: "message or files is required" });
 object({
 	sessionId: string(),
 	messages: array(record(string(), unknown())),
@@ -6729,6 +6767,10 @@ const AgentSummarySchema$1 = object({
 	description: string().optional(),
 	sourcePath: string().min(1).optional(),
 	model: string().optional(),
+	capabilities: object({
+		images: boolean(),
+		files: boolean()
+	}).optional(),
 	systemPrompt: string().optional(),
 	toolCount: optionalCount$1,
 	credentialCount: optionalCount$1,
@@ -9567,6 +9609,52 @@ function validationErrorResponse(error, summary) {
 	};
 }
 z.object({ message: z.string() });
+const CHAT_ATTACHMENT_MAX_BYTES = 10 * 1024 * 1024;
+/** Single source of truth for supported chat attachment types and their file extension. */
+const CHAT_ATTACHMENT_TYPES = [
+	{
+		mediaType: "image/png",
+		ext: "png"
+	},
+	{
+		mediaType: "image/jpeg",
+		ext: "jpg"
+	},
+	{
+		mediaType: "image/webp",
+		ext: "webp"
+	},
+	{
+		mediaType: "image/gif",
+		ext: "gif"
+	},
+	{
+		mediaType: "application/pdf",
+		ext: "pdf"
+	}
+];
+CHAT_ATTACHMENT_TYPES.map((type) => type.mediaType);
+/** Canonical file extension for an allowed attachment media type. */
+function chatAttachmentExtension(mediaType) {
+	return CHAT_ATTACHMENT_TYPES.find((type) => type.mediaType === mediaType)?.ext;
+}
+const ChatAttachmentInputSchema = z.object({
+	storageKey: z.string().min(1),
+	mediaType: z.string().min(1),
+	filename: z.string().optional()
+});
+const PresignChatAttachmentRequestSchema = z.object({
+	contentType: z.string().min(1),
+	filename: z.string().min(1),
+	size: z.number().int().positive().max(CHAT_ATTACHMENT_MAX_BYTES)
+});
+const PresignChatAttachmentResponseSchema = z.object({
+	uploadUrl: z.string().url(),
+	storageKey: z.string().min(1)
+});
+function isAllowedChatAttachmentMediaType(mediaType) {
+	return chatAttachmentExtension(mediaType) !== void 0;
+}
 const CredentialRunContextSchema = z.object({
 	orgId: z.string().min(1).optional(),
 	projectId: z.string().min(1).optional(),
@@ -9584,12 +9672,13 @@ const ThinkingLevelSchema = z.enum([
 	"xhigh"
 ]);
 z.object({
-	message: z.string().min(1),
+	message: z.string(),
 	sessionId: z.string().min(1).optional(),
 	subscriptionId: z.string().min(1).optional(),
 	context: CredentialRunContextSchema.optional(),
-	thinkingLevel: ThinkingLevelSchema.optional()
-});
+	thinkingLevel: ThinkingLevelSchema.optional(),
+	files: z.array(ChatAttachmentInputSchema).max(5).optional()
+}).refine((data) => data.message.trim().length > 0 || (data.files?.length ?? 0) > 0, { message: "message or files is required" });
 z.object({
 	sessionId: z.string(),
 	messages: z.array(z.record(z.string(), z.unknown())),
@@ -10744,6 +10833,10 @@ const AgentSummarySchema = z.object({
 	description: z.string().optional(),
 	sourcePath: z.string().min(1).optional(),
 	model: z.string().optional(),
+	capabilities: z.object({
+		images: z.boolean(),
+		files: z.boolean()
+	}).optional(),
 	systemPrompt: z.string().optional(),
 	toolCount: optionalCount,
 	credentialCount: optionalCount,
@@ -43145,6 +43238,19 @@ function projectSourceBlobKey(projectId, hash) {
 	return `projects/${projectId}/sources/blobs/${hash}`;
 }
 const AVATAR_EXTENSION = /^[a-z0-9]+$/;
+/** Object key for a chat attachment in org-private storage. */
+function chatAttachmentStorageKey(projectId, id, ext) {
+	const normalizedExt = ext.replace(/^\./, "").toLowerCase();
+	if (!AVATAR_EXTENSION.test(normalizedExt)) throw new Error("Invalid chat attachment extension");
+	return `chat-attachments/${projectId}/${id}.${normalizedExt}`;
+}
+/** True when `key` is a chat attachment owned by `projectId`. */
+function isChatAttachmentStorageKey(key, projectId) {
+	const prefix = `chat-attachments/${projectId}/`;
+	if (!key.startsWith(prefix)) return false;
+	const remainder = key.slice(prefix.length);
+	return remainder.length > 0 && !remainder.includes("/");
+}
 /** Object key for a user's custom profile avatar in the shared keystroke-users bucket. */
 function userAvatarStorageKey(userId, extension) {
 	const ext = extension.replace(/^\./, "").toLowerCase();
@@ -43510,6 +43616,6 @@ function minioStoragePlugin(options = {}) {
 	};
 }
 //#endregion
-export { CreateProjectResponseSchema as $, parseStoredRouteManifest as $n, SkillSummaryListResponseSchema as $t, readCredentialInstanceSecret as A, WorkspaceTriggerFileSchema as An, McpDiscoverRequestSchema as At, AppSlugAvailabilityQuerySchema as B, mapOrganizationInvitation as Bn, PresignProjectSourceRequestSchema as Bt, completeMcpOAuthConnect as C, UserAvatarSchema as Cn, ListOrganizationMembersResponseSchema as Ct, discoverOpenApiApp as D, WorkflowSummaryListResponseSchema as Dn, ListProjectMembersResponseSchema as Dt, discoverMcpApp as E, WorkflowSummaryDetailResponseSchema as En, ListProjectFilesResponseSchema as Et, AgentMemoryFileSummarySchema as F, agentWorkspaceFileId as Fn, OrganizationSidebarBrandingSchema as Ft, CreateCredentialsRequestSchema as G, mapProjectMember as Gn, ProjectResponseSchema as Gt, CompleteProjectArtifactResponseSchema as H, mapProject as Hn, PresignUserAvatarRequestSchema as Ht, AgentSummaryDetailResponseSchema as I, buildCredentialInstanceLabel as In, PLATFORM_RESOURCE_UNSUPPORTED_TEXT as It, CreateCustomAppResponseSchema as J, mergeUserPreferences as Jn, ProjectSlugAvailabilityResponseSchema as Jt, CreateCredentialsResponseSchema as K, mapProjectSettings as Kn, ProjectSettingsResponseSchema as Kt, AgentSummaryListResponseSchema as L, deriveCredentialInstanceSlug as Ln, PROJECT_SLUG_TAKEN_MESSAGE as Lt, ACTIVE_ORG_HEADER as M, WorkspaceTriggerOverviewSchema as Mn, OpenApiDiscoverRequestSchema as Mt, AcceptOrganizationInvitationResponseSchema as N, WorkspaceTriggerRunListResponseSchema as Nn, OpenApiDiscoverResponseSchema as Nt, PublicHttpUrlError as O, WorkflowSummarySchema as On, ListProjectMetricsResponseSchema as Ot, ActiveOrganizationResponseSchema as P, agentMemoryFileId as Pn, OrganizationSidebarBrandingPatchSchema as Pt, CreateProjectRequestSchema as Q, parseAppSlug as Qn, SkillSummaryDetailResponseSchema as Qt, AgentSummarySchema as R, displayCredentialAppName as Rn, PresignOrgLogoRequestSchema as Rt, beginMcpOAuthConnect as S, UserAvatarPatchSchema as Sn, ListOrganizationInvitationsResponseSchema as St, discoverGraphqlApp as T, UserPreferencesSchema as Tn, ListProjectDeploymentsResponseSchema as Tt, CreateApiKeyRequestSchema as U, mapProjectArtifact as Un, PresignUserAvatarResponseSchema as Ut, AppSlugAvailabilityResponseSchema as V, mapOrganizationMember as Vn, PresignProjectSourceResponseSchema as Vt, CreateApiKeyResponseSchema as W, mapProjectDeployment as Wn, ProjectReachabilityResponseSchema as Wt, CreateOrganizationResponseSchema as X, organizationInvitationAcceptPath as Xn, RecentResourceListResponseSchema as Xt, CreateOrganizationRequestSchema as Y, normalizeUserPreferences as Yn, ProjectSourceResourcesSchema as Yt, CreateProjectArtifactResponseSchema as Z, organizationSlugErrorCodeFromMessage as Zn, RecentResourceSchema as Zt, projectSourceBlobKey as _, UpdateProjectMemberResponseSchema as _n, ListAgentMemoryFilesResponseSchema as _t, isKeystrokeAssetsAvatarPublicUrl as a, StoredProjectSourceManifestSchema as an, defaultHostingPlugin as ar, GetCredentialResponseSchema as at, createJobQueue as b, UploadProjectSourceManifestRequestSchema as bn, ListAppsResponseSchema as bt, isStorageBucketNotFoundError as c, SubmitTeamRequestRequestSchema as cn, __require as cr, GraphqlDiscoverResponseSchema as ct, keystrokeAssetsAvatarKeyFromPublicUrl as d, TriggerRunListQuerySchema as dn, HistoryRunListQuerySchema as dt, SkillSummarySchema as en, projectFileId as er, DEFAULT_TRIGGER_OVERVIEW_MODEL as et, keystrokeAssetsOrgLogoKeyFromPublicUrl as f, UpdateCredentialRequestSchema as fn, HistoryRunListResponseSchema as ft, projectArtifactKey as g, UpdateProjectMemberRequestSchema as gn, InviteProjectMembersResponseSchema as gt, orgLogoStorageKey as h, UpdateOrganizationRequestSchema as hn, InviteProjectMembersRequestSchema as ht, extractRouteManifestFromArtifact as i, StartMcpOAuthConnectionResultSchema as in, validationErrorResponse as ir, ErrorResponseSchema as it, setCredentialInstanceSecret as j, WorkspaceTriggerListResponseSchema as jn, McpDiscoverResponseSchema as jt, deleteCredentialInstanceSecret as k, WorkspaceTriggerDetailSchema as kn, ListProjectsResponseSchema as kt, isStorageNotFoundError as l, SubmitTeamRequestResponseSchema as ln, __toESM as lr, HistoryRunCancelResponseSchema as lt, minioStoragePlugin as m, UpdateOrganizationMemberResponseSchema as mn, InviteOrganizationMembersResponseSchema as mt, createAssetsStorageClient as n, SlugAvailabilityResponseSchema as nn, resolveUniqueCredentialInstanceLabel as nr, DownloadActiveProjectArtifactResponseSchema as nt, isKeystrokeAssetsOrgLogoPublicUrl as o, SubmitMarketingContactRequestSchema as on, pingProjectTarget as or, GetCustomAppResponseSchema as ot, loadProjectSourceFiles as p, UpdateOrganizationMemberRequestSchema as pn, InviteOrganizationMembersRequestSchema as pt, CreateCustomAppRequestSchema as q, mapUserOrganization as qn, ProjectSlugAvailabilityQuerySchema as qt, ensureKeystrokeAssetsBucket as r, StartMcpOAuthConnectionInputSchema as rn, validateCredentialValueAgainstFields as rr, DownloadActiveProjectSourceResponseSchema as rt, isOrgLogoStorageKey as s, SubmitMarketingContactResponseSchema as sn, __commonJSMin as sr, GraphqlDiscoverRequestSchema as st, RouteManifestNotFoundError as t, SlugAvailabilityQuerySchema as tn, resolveExternalPlatformOrigin as tr, DeclineOrganizationInvitationResponseSchema as tt, isUserAvatarStorageKey as u, TriggerAttachmentUpdateRequestSchema as un, HistoryRunDetailResponseSchema as ut, publicKeystrokeAssetsObjectUrl as v, UpdateProjectRequestSchema as vn, ListAgentWorkspaceFilesResponseSchema as vt, decodeOAuthState as w, UserPreferencesPatchSchema as wn, ListOrganizationsResponseSchema as wt, defaultSchedulerPlugin as x, UploadProjectSourceResponseSchema as xn, ListCredentialsResponseSchema as xt, userAvatarStorageKey as y, UpdateProjectSettingsRequestSchema as yn, ListApiKeysResponseSchema as yt, AgentWorkspaceFileSummarySchema as z, listenPortFromPublicUrl as zn, PresignOrgLogoResponseSchema as zt };
+export { CreateProjectArtifactResponseSchema as $, mapUserOrganization as $n, ProjectSourceResourcesSchema as $t, PublicHttpUrlError as A, WorkflowSummaryDetailResponseSchema as An, ListProjectMetricsResponseSchema as At, AgentSummarySchema as B, buildCredentialInstanceLabel as Bn, PresignChatAttachmentRequestSchema as Bt, defaultSchedulerPlugin as C, UpdateProjectSettingsRequestSchema as Cn, ListCredentialsResponseSchema as Ct, discoverGraphqlApp as D, UserAvatarSchema as Dn, ListProjectDeploymentsResponseSchema as Dt, decodeOAuthState as E, UserAvatarPatchSchema as En, ListOrganizationsResponseSchema as Et, AcceptOrganizationInvitationResponseSchema as F, WorkspaceTriggerListResponseSchema as Fn, OpenApiDiscoverResponseSchema as Ft, CreateApiKeyRequestSchema as G, listenPortFromPublicUrl as Gn, PresignProjectSourceResponseSchema as Gt, AppSlugAvailabilityQuerySchema as H, deriveCredentialInstanceSlug as Hn, PresignOrgLogoRequestSchema as Ht, ActiveOrganizationResponseSchema as I, WorkspaceTriggerOverviewSchema as In, OrganizationSidebarBrandingPatchSchema as It, CreateCredentialsResponseSchema as J, mapProject as Jn, ProjectReachabilityResponseSchema as Jt, CreateApiKeyResponseSchema as K, mapOrganizationInvitation as Kn, PresignUserAvatarRequestSchema as Kt, AgentMemoryFileSummarySchema as L, WorkspaceTriggerRunListResponseSchema as Ln, OrganizationSidebarBrandingSchema as Lt, readCredentialInstanceSecret as M, WorkflowSummarySchema as Mn, McpDiscoverRequestSchema as Mt, setCredentialInstanceSecret as N, WorkspaceTriggerDetailSchema as Nn, McpDiscoverResponseSchema as Nt, discoverMcpApp as O, UserPreferencesPatchSchema as On, ListProjectFilesResponseSchema as Ot, ACTIVE_ORG_HEADER as P, WorkspaceTriggerFileSchema as Pn, OpenApiDiscoverRequestSchema as Pt, CreateOrganizationResponseSchema as Q, mapProjectSettings as Qn, ProjectSlugAvailabilityResponseSchema as Qt, AgentSummaryDetailResponseSchema as R, agentMemoryFileId as Rn, PLATFORM_RESOURCE_UNSUPPORTED_TEXT as Rt, createJobQueue as S, UpdateProjectRequestSchema as Sn, ListAppsResponseSchema as St, completeMcpOAuthConnect as T, UploadProjectSourceResponseSchema as Tn, ListOrganizationMembersResponseSchema as Tt, AppSlugAvailabilityResponseSchema as U, displayCredentialAppName as Un, PresignOrgLogoResponseSchema as Ut, AgentWorkspaceFileSummarySchema as V, chatAttachmentExtension as Vn, PresignChatAttachmentResponseSchema as Vt, CompleteProjectArtifactResponseSchema as W, isAllowedChatAttachmentMediaType as Wn, PresignProjectSourceRequestSchema as Wt, CreateCustomAppResponseSchema as X, mapProjectDeployment as Xn, ProjectSettingsResponseSchema as Xt, CreateCustomAppRequestSchema as Y, mapProjectArtifact as Yn, ProjectResponseSchema as Yt, CreateOrganizationRequestSchema as Z, mapProjectMember as Zn, ProjectSlugAvailabilityQuerySchema as Zt, orgLogoStorageKey as _, UpdateOrganizationMemberRequestSchema as _n, InviteProjectMembersRequestSchema as _t, extractRouteManifestFromArtifact as a, SlugAvailabilityQuerySchema as an, parseStoredRouteManifest as ar, DownloadActiveProjectSourceResponseSchema as at, publicKeystrokeAssetsObjectUrl as b, UpdateProjectMemberRequestSchema as bn, ListAgentWorkspaceFilesResponseSchema as bt, isKeystrokeAssetsOrgLogoPublicUrl as c, StartMcpOAuthConnectionResultSchema as cn, resolveUniqueCredentialInstanceLabel as cr, GetCustomAppResponseSchema as ct, isStorageNotFoundError as d, SubmitMarketingContactResponseSchema as dn, defaultHostingPlugin as dr, HistoryRunCancelResponseSchema as dt, RecentResourceListResponseSchema as en, mergeUserPreferences as er, CreateProjectRequestSchema as et, isUserAvatarStorageKey as f, SubmitTeamRequestRequestSchema as fn, pingProjectTarget as fr, HistoryRunDetailResponseSchema as ft, minioStoragePlugin as g, UpdateCredentialRequestSchema as gn, InviteOrganizationMembersResponseSchema as gt, loadProjectSourceFiles as h, TriggerRunListQuerySchema as hn, __toESM as hr, InviteOrganizationMembersRequestSchema as ht, ensureKeystrokeAssetsBucket as i, SkillSummarySchema as in, parseAppSlug as ir, DownloadActiveProjectArtifactResponseSchema as it, deleteCredentialInstanceSecret as j, WorkflowSummaryListResponseSchema as jn, ListProjectsResponseSchema as jt, discoverOpenApiApp as k, UserPreferencesSchema as kn, ListProjectMembersResponseSchema as kt, isOrgLogoStorageKey as l, StoredProjectSourceManifestSchema as ln, validateCredentialValueAgainstFields as lr, GraphqlDiscoverRequestSchema as lt, keystrokeAssetsOrgLogoKeyFromPublicUrl as m, TriggerAttachmentUpdateRequestSchema as mn, __require as mr, HistoryRunListResponseSchema as mt, chatAttachmentStorageKey as n, SkillSummaryDetailResponseSchema as nn, organizationInvitationAcceptPath as nr, DEFAULT_TRIGGER_OVERVIEW_MODEL as nt, isChatAttachmentStorageKey as o, SlugAvailabilityResponseSchema as on, projectFileId as or, ErrorResponseSchema as ot, keystrokeAssetsAvatarKeyFromPublicUrl as p, SubmitTeamRequestResponseSchema as pn, __commonJSMin as pr, HistoryRunListQuerySchema as pt, CreateCredentialsRequestSchema as q, mapOrganizationMember as qn, PresignUserAvatarResponseSchema as qt, createAssetsStorageClient as r, SkillSummaryListResponseSchema as rn, organizationSlugErrorCodeFromMessage as rr, DeclineOrganizationInvitationResponseSchema as rt, isKeystrokeAssetsAvatarPublicUrl as s, StartMcpOAuthConnectionInputSchema as sn, resolveExternalPlatformOrigin as sr, GetCredentialResponseSchema as st, RouteManifestNotFoundError as t, RecentResourceSchema as tn, normalizeUserPreferences as tr, CreateProjectResponseSchema as tt, isStorageBucketNotFoundError as u, SubmitMarketingContactRequestSchema as un, validationErrorResponse as ur, GraphqlDiscoverResponseSchema as ut, projectArtifactKey as v, UpdateOrganizationMemberResponseSchema as vn, InviteProjectMembersResponseSchema as vt, beginMcpOAuthConnect as w, UploadProjectSourceManifestRequestSchema as wn, ListOrganizationInvitationsResponseSchema as wt, userAvatarStorageKey as x, UpdateProjectMemberResponseSchema as xn, ListApiKeysResponseSchema as xt, projectSourceBlobKey as y, UpdateOrganizationRequestSchema as yn, ListAgentMemoryFilesResponseSchema as yt, AgentSummaryListResponseSchema as z, agentWorkspaceFileId as zn, PROJECT_SLUG_TAKEN_MESSAGE as zt };
 
-//# sourceMappingURL=dist-CeLVqJha.mjs.map
+//# sourceMappingURL=dist-Bc-S2RCv.mjs.map