@mcp-b/chrome-devtools-mcp 1.1.2 → 1.1.3

package/build/node_modules/chrome-devtools-frontend/front_end/models/text_utils/Text.js

@@ -1,69 +0,0 @@
-// Copyright 2016 The Chromium Authors
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-import * as Platform from '../../core/platform/platform.js';
-import { TextCursor } from './TextCursor.js';
-import { SourceRange, TextRange } from './TextRange.js';
-export class Text {
-    #value;
-    #lineEndings;
-    constructor(value) {
-        this.#value = value;
-    }
-    lineEndings() {
-        if (!this.#lineEndings) {
-            this.#lineEndings = Platform.StringUtilities.findLineEndingIndexes(this.#value);
-        }
-        return this.#lineEndings;
-    }
-    value() {
-        return this.#value;
-    }
-    lineCount() {
-        const lineEndings = this.lineEndings();
-        return lineEndings.length;
-    }
-    offsetFromPosition(lineNumber, columnNumber) {
-        return (lineNumber ? this.lineEndings()[lineNumber - 1] + 1 : 0) + columnNumber;
-    }
-    positionFromOffset(offset) {
-        const lineEndings = this.lineEndings();
-        const lineNumber = Platform.ArrayUtilities.lowerBound(lineEndings, offset, Platform.ArrayUtilities.DEFAULT_COMPARATOR);
-        return { lineNumber, columnNumber: offset - (lineNumber && (lineEndings[lineNumber - 1] + 1)) };
-    }
-    lineAt(lineNumber) {
-        const lineEndings = this.lineEndings();
-        const lineStart = lineNumber > 0 ? lineEndings[lineNumber - 1] + 1 : 0;
-        const lineEnd = lineEndings[lineNumber];
-        let lineContent = this.#value.substring(lineStart, lineEnd);
-        if (lineContent.length > 0 && lineContent.charAt(lineContent.length - 1) === '\r') {
-            lineContent = lineContent.substring(0, lineContent.length - 1);
-        }
-        return lineContent;
-    }
-    toSourceRange(range) {
-        const start = this.offsetFromPosition(range.startLine, range.startColumn);
-        const end = this.offsetFromPosition(range.endLine, range.endColumn);
-        return new SourceRange(start, end - start);
-    }
-    toTextRange(sourceRange) {
-        const cursor = new TextCursor(this.lineEndings());
-        const result = TextRange.createFromLocation(0, 0);
-        cursor.resetTo(sourceRange.offset);
-        result.startLine = cursor.lineNumber();
-        result.startColumn = cursor.columnNumber();
-        cursor.advance(sourceRange.offset + sourceRange.length);
-        result.endLine = cursor.lineNumber();
-        result.endColumn = cursor.columnNumber();
-        return result;
-    }
-    replaceRange(range, replacement) {
-        const sourceRange = this.toSourceRange(range);
-        return this.#value.substring(0, sourceRange.offset) + replacement +
-            this.#value.substring(sourceRange.offset + sourceRange.length);
-    }
-    extract(range) {
-        const sourceRange = this.toSourceRange(range);
-        return this.#value.substr(sourceRange.offset, sourceRange.length);
-    }
-}

package/build/node_modules/chrome-devtools-frontend/front_end/models/text_utils/TextCursor.js

@@ -1,35 +0,0 @@
-// Copyright 2020 The Chromium Authors
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-import * as Platform from '../../core/platform/platform.js';
-export class TextCursor {
-    #lineEndings;
-    #offset = 0;
-    #lineNumber = 0;
-    #columnNumber = 0;
-    constructor(lineEndings) {
-        this.#lineEndings = lineEndings;
-    }
-    advance(offset) {
-        this.#offset = offset;
-        while (this.#lineNumber < this.#lineEndings.length && this.#lineEndings[this.#lineNumber] < this.#offset) {
-            ++this.#lineNumber;
-        }
-        this.#columnNumber = this.#lineNumber ? this.#offset - this.#lineEndings[this.#lineNumber - 1] - 1 : this.#offset;
-    }
-    offset() {
-        return this.#offset;
-    }
-    resetTo(offset) {
-        this.#offset = offset;
-        this.#lineNumber =
-            Platform.ArrayUtilities.lowerBound(this.#lineEndings, offset, Platform.ArrayUtilities.DEFAULT_COMPARATOR);
-        this.#columnNumber = this.#lineNumber ? this.#offset - this.#lineEndings[this.#lineNumber - 1] - 1 : this.#offset;
-    }
-    lineNumber() {
-        return this.#lineNumber;
-    }
-    columnNumber() {
-        return this.#columnNumber;
-    }
-}

package/build/node_modules/chrome-devtools-frontend/front_end/models/text_utils/TextRange.js

@@ -1,231 +0,0 @@
-// Copyright 2013 The Chromium Authors
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-import * as Platform from '../../core/platform/platform.js';
-const MAX_SAFE_INT32 = 2 ** 31 - 1;
-export class TextRange {
-    startLine;
-    startColumn;
-    endLine;
-    endColumn;
-    constructor(startLine, startColumn, endLine, endColumn) {
-        this.startLine = startLine;
-        this.startColumn = startColumn;
-        this.endLine = endLine;
-        this.endColumn = endColumn;
-    }
-    static createFromLocation(line, column) {
-        return new TextRange(line, column, line, column);
-    }
-    static createUnboundedFromLocation(line, column) {
-        return new TextRange(line, column, MAX_SAFE_INT32, MAX_SAFE_INT32);
-    }
-    static fromObject(serializedTextRange) {
-        return new TextRange(serializedTextRange.startLine, serializedTextRange.startColumn, serializedTextRange.endLine, serializedTextRange.endColumn);
-    }
-    static comparator(range1, range2) {
-        return range1.compareTo(range2);
-    }
-    static fromEdit(oldRange, newText) {
-        let endLine = oldRange.startLine;
-        let endColumn = oldRange.startColumn + newText.length;
-        const lineEndings = Platform.StringUtilities.findLineEndingIndexes(newText);
-        if (lineEndings.length > 1) {
-            endLine = oldRange.startLine + lineEndings.length - 1;
-            const len = lineEndings.length;
-            endColumn = lineEndings[len - 1] - lineEndings[len - 2] - 1;
-        }
-        return new TextRange(oldRange.startLine, oldRange.startColumn, endLine, endColumn);
-    }
-    isEmpty() {
-        return this.startLine === this.endLine && this.startColumn === this.endColumn;
-    }
-    immediatelyPrecedes(range) {
-        if (!range) {
-            return false;
-        }
-        return this.endLine === range.startLine && this.endColumn === range.startColumn;
-    }
-    immediatelyFollows(range) {
-        if (!range) {
-            return false;
-        }
-        return range.immediatelyPrecedes(this);
-    }
-    follows(range) {
-        return (range.endLine === this.startLine && range.endColumn <= this.startColumn) || range.endLine < this.startLine;
-    }
-    get linesCount() {
-        return this.endLine - this.startLine;
-    }
-    collapseToEnd() {
-        return new TextRange(this.endLine, this.endColumn, this.endLine, this.endColumn);
-    }
-    collapseToStart() {
-        return new TextRange(this.startLine, this.startColumn, this.startLine, this.startColumn);
-    }
-    normalize() {
-        if (this.startLine > this.endLine || (this.startLine === this.endLine && this.startColumn > this.endColumn)) {
-            return new TextRange(this.endLine, this.endColumn, this.startLine, this.startColumn);
-        }
-        return this.clone();
-    }
-    clone() {
-        return new TextRange(this.startLine, this.startColumn, this.endLine, this.endColumn);
-    }
-    serializeToObject() {
-        return {
-            startLine: this.startLine,
-            startColumn: this.startColumn,
-            endLine: this.endLine,
-            endColumn: this.endColumn,
-        };
-    }
-    compareTo(other) {
-        if (this.startLine > other.startLine) {
-            return 1;
-        }
-        if (this.startLine < other.startLine) {
-            return -1;
-        }
-        if (this.startColumn > other.startColumn) {
-            return 1;
-        }
-        if (this.startColumn < other.startColumn) {
-            return -1;
-        }
-        return 0;
-    }
-    compareToPosition(lineNumber, columnNumber) {
-        if (lineNumber < this.startLine || (lineNumber === this.startLine && columnNumber < this.startColumn)) {
-            return -1;
-        }
-        if (lineNumber > this.endLine || (lineNumber === this.endLine && columnNumber > this.endColumn)) {
-            return 1;
-        }
-        return 0;
-    }
-    equal(other) {
-        return this.startLine === other.startLine && this.endLine === other.endLine &&
-            this.startColumn === other.startColumn && this.endColumn === other.endColumn;
-    }
-    relativeTo(line, column) {
-        const relative = this.clone();
-        if (this.startLine === line) {
-            relative.startColumn -= column;
-        }
-        if (this.endLine === line) {
-            relative.endColumn -= column;
-        }
-        relative.startLine -= line;
-        relative.endLine -= line;
-        return relative;
-    }
-    relativeFrom(line, column) {
-        const relative = this.clone();
-        if (this.startLine === 0) {
-            relative.startColumn += column;
-        }
-        if (this.endLine === 0) {
-            relative.endColumn += column;
-        }
-        relative.startLine += line;
-        relative.endLine += line;
-        return relative;
-    }
-    rebaseAfterTextEdit(originalRange, editedRange) {
-        console.assert(originalRange.startLine === editedRange.startLine);
-        console.assert(originalRange.startColumn === editedRange.startColumn);
-        const rebase = this.clone();
-        if (!this.follows(originalRange)) {
-            return rebase;
-        }
-        const lineDelta = editedRange.endLine - originalRange.endLine;
-        const columnDelta = editedRange.endColumn - originalRange.endColumn;
-        rebase.startLine += lineDelta;
-        rebase.endLine += lineDelta;
-        if (rebase.startLine === editedRange.endLine) {
-            rebase.startColumn += columnDelta;
-        }
-        if (rebase.endLine === editedRange.endLine) {
-            rebase.endColumn += columnDelta;
-        }
-        return rebase;
-    }
-    toString() {
-        return JSON.stringify(this);
-    }
-    /**
-     * Checks whether this {@link TextRange} contains the location identified by the
-     * {@link lineNumber} and {@link columnNumber}. The beginning of the text range is
-     * considered inclusive while the end of the text range is considered exclusive
-     * for this comparison, meaning that for example a range `(0,1)-(1,4)` contains the
-     * location `(0,1)` but does not contain the location `(1,4)`.
-     *
-     * @param lineNumber the location's line offset.
-     * @param columnNumber the location's column offset.
-     * @returns `true` if the location identified by {@link lineNumber} and {@link columnNumber}
-     *          is contained within this text range.
-     */
-    containsLocation(lineNumber, columnNumber) {
-        if (this.startLine === this.endLine) {
-            return this.startLine === lineNumber && this.startColumn <= columnNumber && columnNumber < this.endColumn;
-        }
-        if (this.startLine === lineNumber) {
-            return this.startColumn <= columnNumber;
-        }
-        if (this.endLine === lineNumber) {
-            return columnNumber < this.endColumn;
-        }
-        return this.startLine < lineNumber && lineNumber < this.endLine;
-    }
-    get start() {
-        return { lineNumber: this.startLine, columnNumber: this.startColumn };
-    }
-    get end() {
-        return { lineNumber: this.endLine, columnNumber: this.endColumn };
-    }
-    /**
-     * Checks whether this and `that` {@link TextRange} overlap and if they do, computes the
-     * intersection range. If they don't overlap an empty text range is returned instead (for
-     * which {@link #isEmpty()} yields `true`).
-     *
-     * The beginning of text ranges is considered to be includes while the end of the text
-     * ranges is considered exclusive for the intersection, meaning that for example intersecting
-     * `(0,1)-(1,4)` and `(1,4)-(1,6)` yields an empty range.
-     *
-     * @param that the other text range.
-     * @returns the intersection of this and `that` text range, which might be empty if their don't
-     *          overlap.
-     */
-    intersection(that) {
-        let { startLine, startColumn } = this;
-        if (startLine < that.startLine) {
-            startLine = that.startLine;
-            startColumn = that.startColumn;
-        }
-        else if (startLine === that.startLine) {
-            startColumn = Math.max(startColumn, that.startColumn);
-        }
-        let { endLine, endColumn } = this;
-        if (endLine > that.endLine) {
-            endLine = that.endLine;
-            endColumn = that.endColumn;
-        }
-        else if (endLine === that.endLine) {
-            endColumn = Math.min(endColumn, that.endColumn);
-        }
-        if (startLine > endLine || (startLine === endLine && startColumn >= endColumn)) {
-            return new TextRange(0, 0, 0, 0);
-        }
-        return new TextRange(startLine, startColumn, endLine, endColumn);
-    }
-}
-export class SourceRange {
-    offset;
-    length;
-    constructor(offset, length) {
-        this.offset = offset;
-        this.length = length;
-    }
-}

package/build/node_modules/chrome-devtools-frontend/front_end/models/text_utils/TextUtils.js

@@ -1,355 +0,0 @@
-// Copyright 2013 The Chromium Authors
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-import * as Platform from '../../core/platform/platform.js';
-import { ContentData } from './ContentData.js';
-import { SearchMatch } from './ContentProvider.js';
-const KEY_VALUE_FILTER_REGEXP = /(?:^|\s)(\-)?([\w\-]+):([^\s]+)/;
-const REGEXP_FILTER_REGEXP = /(?:^|\s)(\-)?\/([^\/\\]+(\\.[^\/]*)*)\//;
-const TEXT_FILTER_REGEXP = /(?:^|\s)(\-)?([^\s]+)/;
-const SPACE_CHAR_REGEXP = /\s/;
-export const Utils = {
-    isSpaceChar: function (char) {
-        return SPACE_CHAR_REGEXP.test(char);
-    },
-    lineIndent: function (line) {
-        let indentation = 0;
-        while (indentation < line.length && Utils.isSpaceChar(line.charAt(indentation))) {
-            ++indentation;
-        }
-        return line.substr(0, indentation);
-    },
-    splitStringByRegexes(text, regexes) {
-        const matches = [];
-        const globalRegexes = [];
-        for (let i = 0; i < regexes.length; i++) {
-            const regex = regexes[i];
-            if (!regex.global) {
-                globalRegexes.push(new RegExp(regex.source, regex.flags ? regex.flags + 'g' : 'g'));
-            }
-            else {
-                globalRegexes.push(regex);
-            }
-        }
-        doSplit(text, 0, 0);
-        return matches;
-        function doSplit(text, regexIndex, startIndex) {
-            if (regexIndex >= globalRegexes.length) {
-                // Set regexIndex as -1 if text did not match with any regular expression
-                matches.push({ value: text, position: startIndex, regexIndex: -1, captureGroups: [] });
-                return;
-            }
-            const regex = globalRegexes[regexIndex];
-            let currentIndex = 0;
-            let result;
-            regex.lastIndex = 0;
-            while ((result = regex.exec(text)) !== null) {
-                const stringBeforeMatch = text.substring(currentIndex, result.index);
-                if (stringBeforeMatch) {
-                    doSplit(stringBeforeMatch, regexIndex + 1, startIndex + currentIndex);
-                }
-                const match = result[0];
-                matches.push({
-                    value: match,
-                    position: startIndex + result.index,
-                    regexIndex,
-                    captureGroups: result.slice(1),
-                });
-                currentIndex = result.index + match.length;
-            }
-            const stringAfterMatches = text.substring(currentIndex);
-            if (stringAfterMatches) {
-                doSplit(stringAfterMatches, regexIndex + 1, startIndex + currentIndex);
-            }
-        }
-    },
-};
-export class FilterParser {
-    keys;
-    constructor(keys) {
-        this.keys = keys;
-    }
-    static cloneFilter(filter) {
-        return { key: filter.key, text: filter.text, regex: filter.regex, negative: filter.negative };
-    }
-    parse(query) {
-        const splitFilters = Utils.splitStringByRegexes(query, [KEY_VALUE_FILTER_REGEXP, REGEXP_FILTER_REGEXP, TEXT_FILTER_REGEXP]);
-        const parsedFilters = [];
-        for (const { regexIndex, captureGroups } of splitFilters) {
-            if (regexIndex === -1) {
-                continue;
-            }
-            if (regexIndex === 0) {
-                const startsWithMinus = captureGroups[0];
-                const parsedKey = captureGroups[1];
-                const parsedValue = captureGroups[2];
-                if (this.keys.indexOf(parsedKey) !== -1) {
-                    parsedFilters.push({
-                        key: parsedKey,
-                        regex: undefined,
-                        text: parsedValue,
-                        negative: Boolean(startsWithMinus),
-                    });
-                }
-                else {
-                    parsedFilters.push({
-                        key: undefined,
-                        regex: undefined,
-                        text: `${parsedKey}:${parsedValue}`,
-                        negative: Boolean(startsWithMinus),
-                    });
-                }
-            }
-            else if (regexIndex === 1) {
-                const startsWithMinus = captureGroups[0];
-                const parsedRegex = captureGroups[1];
-                try {
-                    parsedFilters.push({
-                        key: undefined,
-                        regex: new RegExp(parsedRegex, 'im'),
-                        text: undefined,
-                        negative: Boolean(startsWithMinus),
-                    });
-                }
-                catch {
-                    parsedFilters.push({
-                        key: undefined,
-                        regex: undefined,
-                        text: `/${parsedRegex}/`,
-                        negative: Boolean(startsWithMinus),
-                    });
-                }
-            }
-            else if (regexIndex === 2) {
-                const startsWithMinus = captureGroups[0];
-                const parsedText = captureGroups[1];
-                parsedFilters.push({
-                    key: undefined,
-                    regex: undefined,
-                    text: parsedText,
-                    negative: Boolean(startsWithMinus),
-                });
-            }
-        }
-        return parsedFilters;
-    }
-}
-export class BalancedJSONTokenizer {
-    callback;
-    index;
-    balance;
-    buffer;
-    findMultiple;
-    closingDoubleQuoteRegex;
-    lastBalancedIndex;
-    constructor(callback, findMultiple) {
-        this.callback = callback;
-        this.index = 0;
-        this.balance = 0;
-        this.buffer = '';
-        this.findMultiple = findMultiple || false;
-        this.closingDoubleQuoteRegex = /[^\\](?:\\\\)*"/g;
-    }
-    write(chunk) {
-        this.buffer += chunk;
-        const lastIndex = this.buffer.length;
-        const buffer = this.buffer;
-        let index;
-        for (index = this.index; index < lastIndex; ++index) {
-            const character = buffer[index];
-            if (character === '"') {
-                this.closingDoubleQuoteRegex.lastIndex = index;
-                if (!this.closingDoubleQuoteRegex.test(buffer)) {
-                    break;
-                }
-                index = this.closingDoubleQuoteRegex.lastIndex - 1;
-            }
-            else if (character === '{') {
-                ++this.balance;
-            }
-            else if (character === '}') {
-                --this.balance;
-                if (this.balance < 0) {
-                    this.reportBalanced();
-                    return false;
-                }
-                if (!this.balance) {
-                    this.lastBalancedIndex = index + 1;
-                    if (!this.findMultiple) {
-                        break;
-                    }
-                }
-            }
-            else if (character === ']' && !this.balance) {
-                this.reportBalanced();
-                return false;
-            }
-        }
-        this.index = index;
-        this.reportBalanced();
-        return true;
-    }
-    reportBalanced() {
-        if (!this.lastBalancedIndex) {
-            return;
-        }
-        this.callback(this.buffer.slice(0, this.lastBalancedIndex));
-        this.buffer = this.buffer.slice(this.lastBalancedIndex);
-        this.index -= this.lastBalancedIndex;
-        this.lastBalancedIndex = 0;
-    }
-    remainder() {
-        return this.buffer;
-    }
-}
-/**
- * Detects the indentation used by a given text document, based on the _Comparing
- * lines_ approach suggested by Heather Arthur (and also found in Firefox DevTools).
- *
- * This implementation differs from the original proposal in that tab indentation
- * isn't detected by checking if at least 50% of the lines start with a tab, but
- * instead by comparing the number of lines that start with a tab to the frequency
- * of the other indentation patterns. This way we also detect small snippets with
- * long leading comments correctly, when tab indentation is used for the snippets
- * of code.
- *
- * @param lines The input document lines.
- * @returns The indentation detected for the lines as string or `null` if it's inconclusive.
- * @see https://heathermoor.medium.com/detecting-code-indentation-eff3ed0fb56b
- */
-export const detectIndentation = function (lines) {
-    const frequencies = [0, 0, 0, 0, 0, 0, 0, 0, 0];
-    let tabs = 0, previous = 0;
-    for (const line of lines) {
-        let current = 0;
-        if (line.length !== 0) {
-            let char = line.charAt(0);
-            if (char === '\t') {
-                tabs++;
-                continue;
-            }
-            while (char === ' ') {
-                char = line.charAt(++current);
-            }
-        }
-        if (current === line.length) {
-            // Don't consider empty lines.
-            previous = 0;
-            continue;
-        }
-        const delta = Math.abs(current - previous);
-        if (delta < frequencies.length) {
-            // Don't consider deltas above 8 characters.
-            frequencies[delta] = frequencies[delta] + 1;
-        }
-        previous = current;
-    }
-    // Find most frequent non-zero width difference between adjacent lines.
-    let mostFrequentDelta = 0, highestFrequency = 0;
-    for (let delta = 1; delta < frequencies.length; ++delta) {
-        const frequency = frequencies[delta];
-        if (frequency > highestFrequency) {
-            highestFrequency = frequency;
-            mostFrequentDelta = delta;
-        }
-    }
-    if (tabs > mostFrequentDelta) {
-        // If more lines start with tabs than any other indentation,
-        // we assume that the document was written with tab indentation
-        // in mind. This differs from the original algorithm.
-        return '\t';
-    }
-    if (!mostFrequentDelta) {
-        return null;
-    }
-    return ' '.repeat(mostFrequentDelta);
-};
-/**
- * Heuristic to check whether a given text was likely minified. Intended to
- * be used for HTML, CSS, and JavaScript inputs.
- *
- * A text is considered to be the result of minification if the average
- * line length for the whole text is 80 characters or more.
- *
- * @param text The input text to check.
- * @returns `true` if the heuristic considers `text` to be minified.
- */
-export const isMinified = function (text) {
-    let lineCount = 0;
-    for (let lastIndex = 0; lastIndex < text.length; ++lineCount) {
-        let eolIndex = text.indexOf('\n', lastIndex);
-        if (eolIndex < 0) {
-            eolIndex = text.length;
-        }
-        lastIndex = eolIndex + 1;
-    }
-    return (text.length - lineCount) / lineCount >= 80;
-};
-/**
- * Small wrapper around {@link performSearchInContent} to reduce boilerplate when searching
- * in {@link ContentDataOrError}.
- *
- * @returns empty search matches if `contentData` is an error or not text content.
- */
-export const performSearchInContentData = function (contentData, query, caseSensitive, isRegex) {
-    if (ContentData.isError(contentData) || !contentData.isTextContent) {
-        return [];
-    }
-    return performSearchInContent(contentData.textObj, query, caseSensitive, isRegex);
-};
-/**
- * @returns One {@link SearchMatch} per match. Multiple matches on the same line each
- * result in their own `SearchMatchExact` instance.
- */
-export const performSearchInContent = function (text, query, caseSensitive, isRegex) {
-    const regex = Platform.StringUtilities.createSearchRegex(query, caseSensitive, isRegex);
-    const result = [];
-    for (let i = 0; i < text.lineCount(); ++i) {
-        const lineContent = text.lineAt(i);
-        const matches = lineContent.matchAll(regex);
-        for (const match of matches) {
-            result.push(new SearchMatch(i, lineContent, match.index, match[0].length));
-        }
-    }
-    return result;
-};
-/**
- * Similar to {@link performSearchInContent} but doesn't search in a whole text but rather
- * finds the exact matches on a prelminiary search result (i.e. lines with known matches).
- * @param matches is deliberatedly typed as an object literal so we can pass the
- *                CDP search result type.
- */
-export const performSearchInSearchMatches = function (matches, query, caseSensitive, isRegex) {
-    const regex = Platform.StringUtilities.createSearchRegex(query, caseSensitive, isRegex);
-    const result = [];
-    for (const { lineNumber, lineContent } of matches) {
-        const matches = lineContent.matchAll(regex);
-        for (const match of matches) {
-            result.push(new SearchMatch(lineNumber, lineContent, match.index, match[0].length));
-        }
-    }
-    return result;
-};
-/**
- * Finds the longest overlapping string segment between the end of the first
- * string and the beginning of the second string.
- *
- * @param s1 The first string (whose suffix will be checked).
- * @param s2 The second string (whose prefix will be checked).
- * @returns The overlapping string segment, or an empty string ("")
- * if no overlap is found.
- */
-export const getOverlap = function (s1, s2) {
-    const minLen = Math.min(s1.length, s2.length);
-    // Check from longest possible overlap down to 1
-    for (let n = minLen; n > 0; n--) {
-        // slice(-n) gets the last 'n' chars
-        const suffix = s1.slice(-n);
-        // substring(0, n) gets the first 'n' chars
-        const prefix = s2.substring(0, n);
-        if (suffix === prefix) {
-            return suffix;
-        }
-    }
-    return null;
-};