@aifuxi/semi-ui-vue 1.2.0 → 2.0.2

package/dist/_shared/71b0c4fa60ae.js

@@ -1,4 +1,4 @@
-const jsContent = "var __webpack_modules__ = {\n    190 (__unused_rspack_module, __unused_rspack___webpack_exports__, __webpack_require__) {\n        __webpack_require__(97);\n        __webpack_require__(809);\n    },\n    97 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            G: ()=>format\n        });\n        var _scanner__rspack_import_0 = __webpack_require__(650);\n        var _string_intern__rspack_import_1 = __webpack_require__(316);\n        function format(documentText, range, options) {\n            let initialIndentLevel;\n            let formatText;\n            let formatTextStart;\n            let rangeStart;\n            let rangeEnd;\n            if (range) {\n                rangeStart = range.offset;\n                rangeEnd = rangeStart + range.length;\n                formatTextStart = rangeStart;\n                while(formatTextStart > 0 && !isEOL(documentText, formatTextStart - 1))formatTextStart--;\n                let endOffset = rangeEnd;\n                while(endOffset < documentText.length && !isEOL(documentText, endOffset))endOffset++;\n                formatText = documentText.substring(formatTextStart, endOffset);\n                initialIndentLevel = computeIndentLevel(formatText, options);\n            } else {\n                formatText = documentText;\n                initialIndentLevel = 0;\n                formatTextStart = 0;\n                rangeStart = 0;\n                rangeEnd = documentText.length;\n            }\n            const eol = getEOL(options, documentText);\n            const eolFastPathSupported = _string_intern__rspack_import_1.wf.includes(eol);\n            let numberLineBreaks = 0;\n            let indentLevel = 0;\n            let indentValue;\n            indentValue = options.insertSpaces ? _string_intern__rspack_import_1.QR[options.tabSize || 4] ?? repeat(_string_intern__rspack_import_1.QR[\"1\"], options.tabSize || 4) : '\\t';\n            const indentType = '\\t' === indentValue ? '\\t' : ' ';\n            let scanner = (0, _scanner__rspack_import_0.z)(formatText, false);\n            let hasError = false;\n            function newLinesAndIndent() {\n                if (numberLineBreaks > 1) return repeat(eol, numberLineBreaks) + repeat(indentValue, initialIndentLevel + indentLevel);\n                const amountOfSpaces = indentValue.length * (initialIndentLevel + indentLevel);\n                if (!eolFastPathSupported || amountOfSpaces > _string_intern__rspack_import_1.mX[indentType][eol].length) return eol + repeat(indentValue, initialIndentLevel + indentLevel);\n                if (amountOfSpaces <= 0) return eol;\n                return _string_intern__rspack_import_1.mX[indentType][eol][amountOfSpaces];\n            }\n            function scanNext() {\n                let token = scanner.scan();\n                numberLineBreaks = 0;\n                while(15 === token || 14 === token){\n                    if (14 === token && options.keepLines) numberLineBreaks += 1;\n                    else if (14 === token) numberLineBreaks = 1;\n                    token = scanner.scan();\n                }\n                hasError = 16 === token || 0 !== scanner.getTokenError();\n                return token;\n            }\n            const editOperations = [];\n            function addEdit(text, startOffset, endOffset) {\n                if (!hasError && (!range || startOffset < rangeEnd && endOffset > rangeStart) && documentText.substring(startOffset, endOffset) !== text) editOperations.push({\n                    offset: startOffset,\n                    length: endOffset - startOffset,\n                    content: text\n                });\n            }\n            let firstToken = scanNext();\n            if (options.keepLines && numberLineBreaks > 0) addEdit(repeat(eol, numberLineBreaks), 0, 0);\n            if (17 !== firstToken) {\n                let firstTokenStart = scanner.getTokenOffset() + formatTextStart;\n                let initialIndent = indentValue.length * initialIndentLevel < 20 && options.insertSpaces ? _string_intern__rspack_import_1.QR[indentValue.length * initialIndentLevel] : repeat(indentValue, initialIndentLevel);\n                addEdit(initialIndent, formatTextStart, firstTokenStart);\n            }\n            while(17 !== firstToken){\n                let firstTokenEnd = scanner.getTokenOffset() + scanner.getTokenLength() + formatTextStart;\n                let secondToken = scanNext();\n                let replaceContent = '';\n                let needsLineBreak = false;\n                while(0 === numberLineBreaks && (12 === secondToken || 13 === secondToken)){\n                    let commentTokenStart = scanner.getTokenOffset() + formatTextStart;\n                    addEdit(_string_intern__rspack_import_1.QR[\"1\"], firstTokenEnd, commentTokenStart);\n                    firstTokenEnd = scanner.getTokenOffset() + scanner.getTokenLength() + formatTextStart;\n                    needsLineBreak = 12 === secondToken;\n                    replaceContent = needsLineBreak ? newLinesAndIndent() : '';\n                    secondToken = scanNext();\n                }\n                if (2 === secondToken) {\n                    if (1 !== firstToken) indentLevel--;\n                    if (options.keepLines && numberLineBreaks > 0 || !options.keepLines && 1 !== firstToken) replaceContent = newLinesAndIndent();\n                    else if (options.keepLines) replaceContent = _string_intern__rspack_import_1.QR[\"1\"];\n                } else if (4 === secondToken) {\n                    if (3 !== firstToken) indentLevel--;\n                    if (options.keepLines && numberLineBreaks > 0 || !options.keepLines && 3 !== firstToken) replaceContent = newLinesAndIndent();\n                    else if (options.keepLines) replaceContent = _string_intern__rspack_import_1.QR[\"1\"];\n                } else {\n                    switch(firstToken){\n                        case 3:\n                        case 1:\n                            indentLevel++;\n                            replaceContent = options.keepLines && numberLineBreaks > 0 || !options.keepLines ? newLinesAndIndent() : _string_intern__rspack_import_1.QR[\"1\"];\n                            break;\n                        case 5:\n                            replaceContent = options.keepLines && numberLineBreaks > 0 || !options.keepLines ? newLinesAndIndent() : _string_intern__rspack_import_1.QR[\"1\"];\n                            break;\n                        case 12:\n                            replaceContent = newLinesAndIndent();\n                            break;\n                        case 13:\n                            if (numberLineBreaks > 0) replaceContent = newLinesAndIndent();\n                            else if (!needsLineBreak) replaceContent = _string_intern__rspack_import_1.QR[\"1\"];\n                            break;\n                        case 6:\n                            if (options.keepLines && numberLineBreaks > 0) replaceContent = newLinesAndIndent();\n                            else if (!needsLineBreak) replaceContent = _string_intern__rspack_import_1.QR[\"1\"];\n                            break;\n                        case 10:\n                            if (options.keepLines && numberLineBreaks > 0) replaceContent = newLinesAndIndent();\n                            else if (6 === secondToken && !needsLineBreak) replaceContent = '';\n                            break;\n                        case 7:\n                        case 8:\n                        case 9:\n                        case 11:\n                        case 2:\n                        case 4:\n                            if (options.keepLines && numberLineBreaks > 0) replaceContent = newLinesAndIndent();\n                            else if (12 !== secondToken && 13 !== secondToken || needsLineBreak) {\n                                if (5 !== secondToken && 17 !== secondToken) hasError = true;\n                            } else replaceContent = _string_intern__rspack_import_1.QR[\"1\"];\n                            break;\n                        case 16:\n                            hasError = true;\n                            break;\n                    }\n                    if (numberLineBreaks > 0 && (12 === secondToken || 13 === secondToken)) replaceContent = newLinesAndIndent();\n                }\n                if (17 === secondToken) replaceContent = options.keepLines && numberLineBreaks > 0 ? newLinesAndIndent() : options.insertFinalNewline ? eol : '';\n                const secondTokenStart = scanner.getTokenOffset() + formatTextStart;\n                addEdit(replaceContent, firstTokenEnd, secondTokenStart);\n                firstToken = secondToken;\n            }\n            return editOperations;\n        }\n        function repeat(s, count) {\n            let result = '';\n            for(let i = 0; i < count; i++)result += s;\n            return result;\n        }\n        function computeIndentLevel(content, options) {\n            let i = 0;\n            let nChars = 0;\n            const tabSize = options.tabSize || 4;\n            while(i < content.length){\n                let ch = content.charAt(i);\n                if (ch === _string_intern__rspack_import_1.QR[\"1\"]) nChars++;\n                else if ('\\t' === ch) nChars += tabSize;\n                else break;\n                i++;\n            }\n            return Math.floor(nChars / tabSize);\n        }\n        function getEOL(options, text) {\n            for(let i = 0; i < text.length; i++){\n                const ch = text.charAt(i);\n                if ('\\r' === ch) {\n                    if (i + 1 < text.length && '\\n' === text.charAt(i + 1)) return '\\r\\n';\n                    return '\\r';\n                }\n                if ('\\n' === ch) return '\\n';\n            }\n            return options && options.eol || '\\n';\n        }\n        function isEOL(text, offset) {\n            return -1 !== '\\r\\n'.indexOf(text.charAt(offset));\n        }\n    },\n    809 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            SM: ()=>findNodeAtOffset,\n            Wc: ()=>findNodeAtLocation,\n            YR: ()=>visit,\n            cZ: ()=>parseTree,\n            eY: ()=>getNodePath,\n            g$: ()=>getLocation,\n            nY: ()=>stripComments,\n            qg: ()=>parse,\n            yQ: ()=>getNodeValue\n        });\n        var _scanner__rspack_import_0 = __webpack_require__(650);\n        var ParseOptions;\n        (function(ParseOptions) {\n            ParseOptions.DEFAULT = {\n                allowTrailingComma: false\n            };\n        })(ParseOptions || (ParseOptions = {}));\n        function getLocation(text, position) {\n            const segments = [];\n            const earlyReturnException = new Object();\n            let previousNode;\n            const previousNodeInst = {\n                value: {},\n                offset: 0,\n                length: 0,\n                type: 'object',\n                parent: void 0\n            };\n            let isAtPropertyKey = false;\n            function setPreviousNode(value, offset, length, type) {\n                previousNodeInst.value = value;\n                previousNodeInst.offset = offset;\n                previousNodeInst.length = length;\n                previousNodeInst.type = type;\n                previousNodeInst.colonOffset = void 0;\n                previousNode = previousNodeInst;\n            }\n            try {\n                visit(text, {\n                    onObjectBegin: (offset, length)=>{\n                        if (position <= offset) throw earlyReturnException;\n                        previousNode = void 0;\n                        isAtPropertyKey = position > offset;\n                        segments.push('');\n                    },\n                    onObjectProperty: (name, offset, length)=>{\n                        if (position < offset) throw earlyReturnException;\n                        setPreviousNode(name, offset, length, 'property');\n                        segments[segments.length - 1] = name;\n                        if (position <= offset + length) throw earlyReturnException;\n                    },\n                    onObjectEnd: (offset, length)=>{\n                        if (position <= offset) throw earlyReturnException;\n                        previousNode = void 0;\n                        segments.pop();\n                    },\n                    onArrayBegin: (offset, length)=>{\n                        if (position <= offset) throw earlyReturnException;\n                        previousNode = void 0;\n                        segments.push(0);\n                    },\n                    onArrayEnd: (offset, length)=>{\n                        if (position <= offset) throw earlyReturnException;\n                        previousNode = void 0;\n                        segments.pop();\n                    },\n                    onLiteralValue: (value, offset, length)=>{\n                        if (position < offset) throw earlyReturnException;\n                        setPreviousNode(value, offset, length, getNodeType(value));\n                        if (position <= offset + length) throw earlyReturnException;\n                    },\n                    onSeparator: (sep, offset, length)=>{\n                        if (position <= offset) throw earlyReturnException;\n                        if (':' === sep && previousNode && 'property' === previousNode.type) {\n                            previousNode.colonOffset = offset;\n                            isAtPropertyKey = false;\n                            previousNode = void 0;\n                        } else if (',' === sep) {\n                            const last = segments[segments.length - 1];\n                            if ('number' == typeof last) segments[segments.length - 1] = last + 1;\n                            else {\n                                isAtPropertyKey = true;\n                                segments[segments.length - 1] = '';\n                            }\n                            previousNode = void 0;\n                        }\n                    }\n                });\n            } catch (e) {\n                if (e !== earlyReturnException) throw e;\n            }\n            return {\n                path: segments,\n                previousNode,\n                isAtPropertyKey,\n                matches: (pattern)=>{\n                    let k = 0;\n                    for(let i = 0; k < pattern.length && i < segments.length; i++)if (pattern[k] === segments[i] || '*' === pattern[k]) k++;\n                    else if ('**' !== pattern[k]) return false;\n                    return k === pattern.length;\n                }\n            };\n        }\n        function parse(text, errors = [], options = ParseOptions.DEFAULT) {\n            let currentProperty = null;\n            let currentParent = [];\n            const previousParents = [];\n            function onValue(value) {\n                if (Array.isArray(currentParent)) currentParent.push(value);\n                else if (null !== currentProperty) currentParent[currentProperty] = value;\n            }\n            const visitor = {\n                onObjectBegin: ()=>{\n                    const object = {};\n                    onValue(object);\n                    previousParents.push(currentParent);\n                    currentParent = object;\n                    currentProperty = null;\n                },\n                onObjectProperty: (name)=>{\n                    currentProperty = name;\n                },\n                onObjectEnd: ()=>{\n                    currentParent = previousParents.pop();\n                },\n                onArrayBegin: ()=>{\n                    const array = [];\n                    onValue(array);\n                    previousParents.push(currentParent);\n                    currentParent = array;\n                    currentProperty = null;\n                },\n                onArrayEnd: ()=>{\n                    currentParent = previousParents.pop();\n                },\n                onLiteralValue: onValue,\n                onError: (error, offset, length)=>{\n                    errors.push({\n                        error,\n                        offset,\n                        length\n                    });\n                }\n            };\n            visit(text, visitor, options);\n            return currentParent[0];\n        }\n        function parseTree(text, errors = [], options = ParseOptions.DEFAULT) {\n            let currentParent = {\n                type: 'array',\n                offset: -1,\n                length: -1,\n                children: [],\n                parent: void 0\n            };\n            function ensurePropertyComplete(endOffset) {\n                if ('property' === currentParent.type) {\n                    currentParent.length = endOffset - currentParent.offset;\n                    currentParent = currentParent.parent;\n                }\n            }\n            function onValue(valueNode) {\n                currentParent.children.push(valueNode);\n                return valueNode;\n            }\n            const visitor = {\n                onObjectBegin: (offset)=>{\n                    currentParent = onValue({\n                        type: 'object',\n                        offset,\n                        length: -1,\n                        parent: currentParent,\n                        children: []\n                    });\n                },\n                onObjectProperty: (name, offset, length)=>{\n                    currentParent = onValue({\n                        type: 'property',\n                        offset,\n                        length: -1,\n                        parent: currentParent,\n                        children: []\n                    });\n                    currentParent.children.push({\n                        type: 'string',\n                        value: name,\n                        offset,\n                        length,\n                        parent: currentParent\n                    });\n                },\n                onObjectEnd: (offset, length)=>{\n                    ensurePropertyComplete(offset + length);\n                    currentParent.length = offset + length - currentParent.offset;\n                    currentParent = currentParent.parent;\n                    ensurePropertyComplete(offset + length);\n                },\n                onArrayBegin: (offset, length)=>{\n                    currentParent = onValue({\n                        type: 'array',\n                        offset,\n                        length: -1,\n                        parent: currentParent,\n                        children: []\n                    });\n                },\n                onArrayEnd: (offset, length)=>{\n                    currentParent.length = offset + length - currentParent.offset;\n                    currentParent = currentParent.parent;\n                    ensurePropertyComplete(offset + length);\n                },\n                onLiteralValue: (value, offset, length)=>{\n                    onValue({\n                        type: getNodeType(value),\n                        offset,\n                        length,\n                        parent: currentParent,\n                        value\n                    });\n                    ensurePropertyComplete(offset + length);\n                },\n                onSeparator: (sep, offset, length)=>{\n                    if ('property' === currentParent.type) {\n                        if (':' === sep) currentParent.colonOffset = offset;\n                        else if (',' === sep) ensurePropertyComplete(offset);\n                    }\n                },\n                onError: (error, offset, length)=>{\n                    errors.push({\n                        error,\n                        offset,\n                        length\n                    });\n                }\n            };\n            visit(text, visitor, options);\n            const result = currentParent.children[0];\n            if (result) delete result.parent;\n            return result;\n        }\n        function findNodeAtLocation(root, path) {\n            if (!root) return;\n            let node = root;\n            for (let segment of path)if ('string' == typeof segment) {\n                if ('object' !== node.type || !Array.isArray(node.children)) return;\n                let found = false;\n                for (const propertyNode of node.children)if (Array.isArray(propertyNode.children) && propertyNode.children[0].value === segment && 2 === propertyNode.children.length) {\n                    node = propertyNode.children[1];\n                    found = true;\n                    break;\n                }\n                if (!found) return;\n            } else {\n                const index = segment;\n                if ('array' !== node.type || index < 0 || !Array.isArray(node.children) || index >= node.children.length) return;\n                node = node.children[index];\n            }\n            return node;\n        }\n        function getNodePath(node) {\n            if (!node.parent || !node.parent.children) return [];\n            const path = getNodePath(node.parent);\n            if ('property' === node.parent.type) {\n                const key = node.parent.children[0].value;\n                path.push(key);\n            } else if ('array' === node.parent.type) {\n                const index = node.parent.children.indexOf(node);\n                if (-1 !== index) path.push(index);\n            }\n            return path;\n        }\n        function getNodeValue(node) {\n            switch(node.type){\n                case 'array':\n                    return node.children.map(getNodeValue);\n                case 'object':\n                    const obj = Object.create(null);\n                    for (let prop of node.children){\n                        const valueNode = prop.children[1];\n                        if (valueNode) obj[prop.children[0].value] = getNodeValue(valueNode);\n                    }\n                    return obj;\n                case 'null':\n                case 'string':\n                case 'number':\n                case 'boolean':\n                    return node.value;\n                default:\n                    return;\n            }\n        }\n        function contains(node, offset, includeRightBound = false) {\n            return offset >= node.offset && offset < node.offset + node.length || includeRightBound && offset === node.offset + node.length;\n        }\n        function findNodeAtOffset(node, offset, includeRightBound = false) {\n            if (contains(node, offset, includeRightBound)) {\n                const children = node.children;\n                if (Array.isArray(children)) for(let i = 0; i < children.length && children[i].offset <= offset; i++){\n                    const item = findNodeAtOffset(children[i], offset, includeRightBound);\n                    if (item) return item;\n                }\n                return node;\n            }\n        }\n        function visit(text, visitor, options = ParseOptions.DEFAULT) {\n            const _scanner = (0, _scanner__rspack_import_0.z)(text, false);\n            const _jsonPath = [];\n            let suppressedCallbacks = 0;\n            function toNoArgVisit(visitFunction) {\n                return visitFunction ? ()=>0 === suppressedCallbacks && visitFunction(_scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter()) : ()=>true;\n            }\n            function toOneArgVisit(visitFunction) {\n                return visitFunction ? (arg)=>0 === suppressedCallbacks && visitFunction(arg, _scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter()) : ()=>true;\n            }\n            function toOneArgVisitWithPath(visitFunction) {\n                return visitFunction ? (arg)=>0 === suppressedCallbacks && visitFunction(arg, _scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter(), ()=>_jsonPath.slice()) : ()=>true;\n            }\n            function toBeginVisit(visitFunction) {\n                return visitFunction ? ()=>{\n                    if (suppressedCallbacks > 0) suppressedCallbacks++;\n                    else {\n                        let cbReturn = visitFunction(_scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter(), ()=>_jsonPath.slice());\n                        if (false === cbReturn) suppressedCallbacks = 1;\n                    }\n                } : ()=>true;\n            }\n            function toEndVisit(visitFunction) {\n                return visitFunction ? ()=>{\n                    if (suppressedCallbacks > 0) suppressedCallbacks--;\n                    if (0 === suppressedCallbacks) visitFunction(_scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter());\n                } : ()=>true;\n            }\n            const onObjectBegin = toBeginVisit(visitor.onObjectBegin), onObjectProperty = toOneArgVisitWithPath(visitor.onObjectProperty), onObjectEnd = toEndVisit(visitor.onObjectEnd), onArrayBegin = toBeginVisit(visitor.onArrayBegin), onArrayEnd = toEndVisit(visitor.onArrayEnd), onLiteralValue = toOneArgVisitWithPath(visitor.onLiteralValue), onSeparator = toOneArgVisit(visitor.onSeparator), onComment = toNoArgVisit(visitor.onComment), onError = toOneArgVisit(visitor.onError);\n            const disallowComments = options && options.disallowComments;\n            const allowTrailingComma = options && options.allowTrailingComma;\n            function scanNext() {\n                while(true){\n                    const token = _scanner.scan();\n                    switch(_scanner.getTokenError()){\n                        case 4:\n                            handleError(14);\n                            break;\n                        case 5:\n                            handleError(15);\n                            break;\n                        case 3:\n                            handleError(13);\n                            break;\n                        case 1:\n                            if (!disallowComments) handleError(11);\n                            break;\n                        case 2:\n                            handleError(12);\n                            break;\n                        case 6:\n                            handleError(16);\n                            break;\n                    }\n                    switch(token){\n                        case 12:\n                        case 13:\n                            if (disallowComments) handleError(10);\n                            else onComment();\n                            break;\n                        case 16:\n                            handleError(1);\n                            break;\n                        case 15:\n                        case 14:\n                            break;\n                        default:\n                            return token;\n                    }\n                }\n            }\n            function handleError(error, skipUntilAfter = [], skipUntil = []) {\n                onError(error);\n                if (skipUntilAfter.length + skipUntil.length > 0) {\n                    let token = _scanner.getToken();\n                    while(17 !== token){\n                        if (-1 !== skipUntilAfter.indexOf(token)) {\n                            scanNext();\n                            break;\n                        }\n                        if (-1 !== skipUntil.indexOf(token)) break;\n                        token = scanNext();\n                    }\n                }\n            }\n            function parseString(isValue) {\n                const value = _scanner.getTokenValue();\n                if (isValue) onLiteralValue(value);\n                else {\n                    onObjectProperty(value);\n                    _jsonPath.push(value);\n                }\n                scanNext();\n                return true;\n            }\n            function parseLiteral() {\n                switch(_scanner.getToken()){\n                    case 11:\n                        const tokenValue = _scanner.getTokenValue();\n                        let value = Number(tokenValue);\n                        if (isNaN(value)) {\n                            handleError(2);\n                            value = 0;\n                        }\n                        onLiteralValue(value);\n                        break;\n                    case 7:\n                        onLiteralValue(null);\n                        break;\n                    case 8:\n                        onLiteralValue(true);\n                        break;\n                    case 9:\n                        onLiteralValue(false);\n                        break;\n                    default:\n                        return false;\n                }\n                scanNext();\n                return true;\n            }\n            function parseProperty() {\n                if (10 !== _scanner.getToken()) {\n                    handleError(3, [], [\n                        2,\n                        5\n                    ]);\n                    return false;\n                }\n                parseString(false);\n                if (6 === _scanner.getToken()) {\n                    onSeparator(':');\n                    scanNext();\n                    if (!parseValue()) handleError(4, [], [\n                        2,\n                        5\n                    ]);\n                } else handleError(5, [], [\n                    2,\n                    5\n                ]);\n                _jsonPath.pop();\n                return true;\n            }\n            function parseObject() {\n                onObjectBegin();\n                scanNext();\n                let needsComma = false;\n                while(2 !== _scanner.getToken() && 17 !== _scanner.getToken()){\n                    if (5 === _scanner.getToken()) {\n                        if (!needsComma) handleError(4, [], []);\n                        onSeparator(',');\n                        scanNext();\n                        if (2 === _scanner.getToken() && allowTrailingComma) break;\n                    } else if (needsComma) handleError(6, [], []);\n                    if (!parseProperty()) handleError(4, [], [\n                        2,\n                        5\n                    ]);\n                    needsComma = true;\n                }\n                onObjectEnd();\n                if (2 !== _scanner.getToken()) handleError(7, [\n                    2\n                ], []);\n                else scanNext();\n                return true;\n            }\n            function parseArray() {\n                onArrayBegin();\n                scanNext();\n                let isFirstElement = true;\n                let needsComma = false;\n                while(4 !== _scanner.getToken() && 17 !== _scanner.getToken()){\n                    if (5 === _scanner.getToken()) {\n                        if (!needsComma) handleError(4, [], []);\n                        onSeparator(',');\n                        scanNext();\n                        if (4 === _scanner.getToken() && allowTrailingComma) break;\n                    } else if (needsComma) handleError(6, [], []);\n                    if (isFirstElement) {\n                        _jsonPath.push(0);\n                        isFirstElement = false;\n                    } else _jsonPath[_jsonPath.length - 1]++;\n                    if (!parseValue()) handleError(4, [], [\n                        4,\n                        5\n                    ]);\n                    needsComma = true;\n                }\n                onArrayEnd();\n                if (!isFirstElement) _jsonPath.pop();\n                if (4 !== _scanner.getToken()) handleError(8, [\n                    4\n                ], []);\n                else scanNext();\n                return true;\n            }\n            function parseValue() {\n                switch(_scanner.getToken()){\n                    case 3:\n                        return parseArray();\n                    case 1:\n                        return parseObject();\n                    case 10:\n                        return parseString(true);\n                    default:\n                        return parseLiteral();\n                }\n            }\n            scanNext();\n            if (17 === _scanner.getToken()) {\n                if (options.allowEmptyContent) return true;\n                handleError(4, [], []);\n                return false;\n            }\n            if (!parseValue()) {\n                handleError(4, [], []);\n                return false;\n            }\n            if (17 !== _scanner.getToken()) handleError(9, [], []);\n            return true;\n        }\n        function stripComments(text, replaceCh) {\n            let _scanner = (0, _scanner__rspack_import_0.z)(text), parts = [], kind, offset = 0, pos;\n            do {\n                pos = _scanner.getPosition();\n                kind = _scanner.scan();\n                switch(kind){\n                    case 12:\n                    case 13:\n                    case 17:\n                        if (offset !== pos) parts.push(text.substring(offset, pos));\n                        if (void 0 !== replaceCh) parts.push(_scanner.getTokenValue().replace(/[^\\r\\n]/g, replaceCh));\n                        offset = _scanner.getPosition();\n                        break;\n                }\n            }while (17 !== kind)\n            return parts.join('');\n        }\n        function getNodeType(value) {\n            switch(typeof value){\n                case 'boolean':\n                    return 'boolean';\n                case 'number':\n                    return 'number';\n                case 'string':\n                    return 'string';\n                case 'object':\n                    if (!value) return 'null';\n                    if (Array.isArray(value)) return 'array';\n                    return 'object';\n                default:\n                    return 'null';\n            }\n        }\n    },\n    650 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            z: ()=>createScanner\n        });\n        function createScanner(text, ignoreTrivia = false) {\n            const len = text.length;\n            let pos = 0, value = '', tokenOffset = 0, token = 16, lineNumber = 0, lineStartOffset = 0, tokenLineStartOffset = 0, prevTokenLineStartOffset = 0, scanError = 0;\n            function scanHexDigits(count, exact) {\n                let digits = 0;\n                let value = 0;\n                while(digits < count || !exact){\n                    let ch = text.charCodeAt(pos);\n                    if (ch >= 48 && ch <= 57) value = 16 * value + ch - 48;\n                    else if (ch >= 65 && ch <= 70) value = 16 * value + ch - 65 + 10;\n                    else if (ch >= 97 && ch <= 102) value = 16 * value + ch - 97 + 10;\n                    else break;\n                    pos++;\n                    digits++;\n                }\n                if (digits < count) value = -1;\n                return value;\n            }\n            function setPosition(newPosition) {\n                pos = newPosition;\n                value = '';\n                tokenOffset = 0;\n                token = 16;\n                scanError = 0;\n            }\n            function scanNumber() {\n                let start = pos;\n                if (48 === text.charCodeAt(pos)) pos++;\n                else {\n                    pos++;\n                    while(pos < text.length && isDigit(text.charCodeAt(pos)))pos++;\n                }\n                if (pos < text.length && 46 === text.charCodeAt(pos)) {\n                    pos++;\n                    if (pos < text.length && isDigit(text.charCodeAt(pos))) {\n                        pos++;\n                        while(pos < text.length && isDigit(text.charCodeAt(pos)))pos++;\n                    } else {\n                        scanError = 3;\n                        return text.substring(start, pos);\n                    }\n                }\n                let end = pos;\n                if (pos < text.length && (69 === text.charCodeAt(pos) || 101 === text.charCodeAt(pos))) {\n                    pos++;\n                    if (pos < text.length && 43 === text.charCodeAt(pos) || 45 === text.charCodeAt(pos)) pos++;\n                    if (pos < text.length && isDigit(text.charCodeAt(pos))) {\n                        pos++;\n                        while(pos < text.length && isDigit(text.charCodeAt(pos)))pos++;\n                        end = pos;\n                    } else scanError = 3;\n                }\n                return text.substring(start, end);\n            }\n            function scanString() {\n                let result = '', start = pos;\n                while(true){\n                    if (pos >= len) {\n                        result += text.substring(start, pos);\n                        scanError = 2;\n                        break;\n                    }\n                    const ch = text.charCodeAt(pos);\n                    if (34 === ch) {\n                        result += text.substring(start, pos);\n                        pos++;\n                        break;\n                    }\n                    if (92 === ch) {\n                        result += text.substring(start, pos);\n                        pos++;\n                        if (pos >= len) {\n                            scanError = 2;\n                            break;\n                        }\n                        const ch2 = text.charCodeAt(pos++);\n                        switch(ch2){\n                            case 34:\n                                result += '\\\"';\n                                break;\n                            case 92:\n                                result += '\\\\';\n                                break;\n                            case 47:\n                                result += '/';\n                                break;\n                            case 98:\n                                result += '\\b';\n                                break;\n                            case 102:\n                                result += '\\f';\n                                break;\n                            case 110:\n                                result += '\\n';\n                                break;\n                            case 114:\n                                result += '\\r';\n                                break;\n                            case 116:\n                                result += '\\t';\n                                break;\n                            case 117:\n                                const ch3 = scanHexDigits(4, true);\n                                if (ch3 >= 0) result += String.fromCharCode(ch3);\n                                else scanError = 4;\n                                break;\n                            default:\n                                scanError = 5;\n                        }\n                        start = pos;\n                        continue;\n                    }\n                    if (ch >= 0 && ch <= 0x1f) if (isLineBreak(ch)) {\n                        result += text.substring(start, pos);\n                        scanError = 2;\n                        break;\n                    } else scanError = 6;\n                    pos++;\n                }\n                return result;\n            }\n            function scanNext() {\n                value = '';\n                scanError = 0;\n                tokenOffset = pos;\n                lineStartOffset = lineNumber;\n                prevTokenLineStartOffset = tokenLineStartOffset;\n                if (pos >= len) {\n                    tokenOffset = len;\n                    return token = 17;\n                }\n                let code = text.charCodeAt(pos);\n                if (isWhiteSpace(code)) {\n                    do {\n                        pos++;\n                        value += String.fromCharCode(code);\n                        code = text.charCodeAt(pos);\n                    }while (isWhiteSpace(code))\n                    return token = 15;\n                }\n                if (isLineBreak(code)) {\n                    pos++;\n                    value += String.fromCharCode(code);\n                    if (13 === code && 10 === text.charCodeAt(pos)) {\n                        pos++;\n                        value += '\\n';\n                    }\n                    lineNumber++;\n                    tokenLineStartOffset = pos;\n                    return token = 14;\n                }\n                switch(code){\n                    case 123:\n                        pos++;\n                        return token = 1;\n                    case 125:\n                        pos++;\n                        return token = 2;\n                    case 91:\n                        pos++;\n                        return token = 3;\n                    case 93:\n                        pos++;\n                        return token = 4;\n                    case 58:\n                        pos++;\n                        return token = 6;\n                    case 44:\n                        pos++;\n                        return token = 5;\n                    case 34:\n                        pos++;\n                        value = scanString();\n                        return token = 10;\n                    case 47:\n                        const start = pos - 1;\n                        if (47 === text.charCodeAt(pos + 1)) {\n                            pos += 2;\n                            while(pos < len){\n                                if (isLineBreak(text.charCodeAt(pos))) break;\n                                pos++;\n                            }\n                            value = text.substring(start, pos);\n                            return token = 12;\n                        }\n                        if (42 === text.charCodeAt(pos + 1)) {\n                            pos += 2;\n                            const safeLength = len - 1;\n                            let commentClosed = false;\n                            while(pos < safeLength){\n                                const ch = text.charCodeAt(pos);\n                                if (42 === ch && 47 === text.charCodeAt(pos + 1)) {\n                                    pos += 2;\n                                    commentClosed = true;\n                                    break;\n                                }\n                                pos++;\n                                if (isLineBreak(ch)) {\n                                    if (13 === ch && 10 === text.charCodeAt(pos)) pos++;\n                                    lineNumber++;\n                                    tokenLineStartOffset = pos;\n                                }\n                            }\n                            if (!commentClosed) {\n                                pos++;\n                                scanError = 1;\n                            }\n                            value = text.substring(start, pos);\n                            return token = 13;\n                        }\n                        value += String.fromCharCode(code);\n                        pos++;\n                        return token = 16;\n                    case 45:\n                        value += String.fromCharCode(code);\n                        pos++;\n                        if (pos === len || !isDigit(text.charCodeAt(pos))) return token = 16;\n                    case 48:\n                    case 49:\n                    case 50:\n                    case 51:\n                    case 52:\n                    case 53:\n                    case 54:\n                    case 55:\n                    case 56:\n                    case 57:\n                        value += scanNumber();\n                        return token = 11;\n                    default:\n                        while(pos < len && isUnknownContentCharacter(code)){\n                            pos++;\n                            code = text.charCodeAt(pos);\n                        }\n                        if (tokenOffset !== pos) {\n                            value = text.substring(tokenOffset, pos);\n                            switch(value){\n                                case 'true':\n                                    return token = 8;\n                                case 'false':\n                                    return token = 9;\n                                case 'null':\n                                    return token = 7;\n                            }\n                            return token = 16;\n                        }\n                        value += String.fromCharCode(code);\n                        pos++;\n                        return token = 16;\n                }\n            }\n            function isUnknownContentCharacter(code) {\n                if (isWhiteSpace(code) || isLineBreak(code)) return false;\n                switch(code){\n                    case 125:\n                    case 93:\n                    case 123:\n                    case 91:\n                    case 34:\n                    case 58:\n                    case 44:\n                    case 47:\n                        return false;\n                }\n                return true;\n            }\n            function scanNextNonTrivia() {\n                let result;\n                do result = scanNext();\n                while (result >= 12 && result <= 15)\n                return result;\n            }\n            return {\n                setPosition: setPosition,\n                getPosition: ()=>pos,\n                scan: ignoreTrivia ? scanNextNonTrivia : scanNext,\n                getToken: ()=>token,\n                getTokenValue: ()=>value,\n                getTokenOffset: ()=>tokenOffset,\n                getTokenLength: ()=>pos - tokenOffset,\n                getTokenStartLine: ()=>lineStartOffset,\n                getTokenStartCharacter: ()=>tokenOffset - prevTokenLineStartOffset,\n                getTokenError: ()=>scanError\n            };\n        }\n        function isWhiteSpace(ch) {\n            return 32 === ch || 9 === ch;\n        }\n        function isLineBreak(ch) {\n            return 10 === ch || 13 === ch;\n        }\n        function isDigit(ch) {\n            return ch >= 48 && ch <= 57;\n        }\n        var CharacterCodes;\n        (function(CharacterCodes) {\n            CharacterCodes[CharacterCodes[\"lineFeed\"] = 10] = \"lineFeed\";\n            CharacterCodes[CharacterCodes[\"carriageReturn\"] = 13] = \"carriageReturn\";\n            CharacterCodes[CharacterCodes[\"space\"] = 32] = \"space\";\n            CharacterCodes[CharacterCodes[\"_0\"] = 48] = \"_0\";\n            CharacterCodes[CharacterCodes[\"_1\"] = 49] = \"_1\";\n            CharacterCodes[CharacterCodes[\"_2\"] = 50] = \"_2\";\n            CharacterCodes[CharacterCodes[\"_3\"] = 51] = \"_3\";\n            CharacterCodes[CharacterCodes[\"_4\"] = 52] = \"_4\";\n            CharacterCodes[CharacterCodes[\"_5\"] = 53] = \"_5\";\n            CharacterCodes[CharacterCodes[\"_6\"] = 54] = \"_6\";\n            CharacterCodes[CharacterCodes[\"_7\"] = 55] = \"_7\";\n            CharacterCodes[CharacterCodes[\"_8\"] = 56] = \"_8\";\n            CharacterCodes[CharacterCodes[\"_9\"] = 57] = \"_9\";\n            CharacterCodes[CharacterCodes[\"a\"] = 97] = \"a\";\n            CharacterCodes[CharacterCodes[\"b\"] = 98] = \"b\";\n            CharacterCodes[CharacterCodes[\"c\"] = 99] = \"c\";\n            CharacterCodes[CharacterCodes[\"d\"] = 100] = \"d\";\n            CharacterCodes[CharacterCodes[\"e\"] = 101] = \"e\";\n            CharacterCodes[CharacterCodes[\"f\"] = 102] = \"f\";\n            CharacterCodes[CharacterCodes[\"g\"] = 103] = \"g\";\n            CharacterCodes[CharacterCodes[\"h\"] = 104] = \"h\";\n            CharacterCodes[CharacterCodes[\"i\"] = 105] = \"i\";\n            CharacterCodes[CharacterCodes[\"j\"] = 106] = \"j\";\n            CharacterCodes[CharacterCodes[\"k\"] = 107] = \"k\";\n            CharacterCodes[CharacterCodes[\"l\"] = 108] = \"l\";\n            CharacterCodes[CharacterCodes[\"m\"] = 109] = \"m\";\n            CharacterCodes[CharacterCodes[\"n\"] = 110] = \"n\";\n            CharacterCodes[CharacterCodes[\"o\"] = 111] = \"o\";\n            CharacterCodes[CharacterCodes[\"p\"] = 112] = \"p\";\n            CharacterCodes[CharacterCodes[\"q\"] = 113] = \"q\";\n            CharacterCodes[CharacterCodes[\"r\"] = 114] = \"r\";\n            CharacterCodes[CharacterCodes[\"s\"] = 115] = \"s\";\n            CharacterCodes[CharacterCodes[\"t\"] = 116] = \"t\";\n            CharacterCodes[CharacterCodes[\"u\"] = 117] = \"u\";\n            CharacterCodes[CharacterCodes[\"v\"] = 118] = \"v\";\n            CharacterCodes[CharacterCodes[\"w\"] = 119] = \"w\";\n            CharacterCodes[CharacterCodes[\"x\"] = 120] = \"x\";\n            CharacterCodes[CharacterCodes[\"y\"] = 121] = \"y\";\n            CharacterCodes[CharacterCodes[\"z\"] = 122] = \"z\";\n            CharacterCodes[CharacterCodes[\"A\"] = 65] = \"A\";\n            CharacterCodes[CharacterCodes[\"B\"] = 66] = \"B\";\n            CharacterCodes[CharacterCodes[\"C\"] = 67] = \"C\";\n            CharacterCodes[CharacterCodes[\"D\"] = 68] = \"D\";\n            CharacterCodes[CharacterCodes[\"E\"] = 69] = \"E\";\n            CharacterCodes[CharacterCodes[\"F\"] = 70] = \"F\";\n            CharacterCodes[CharacterCodes[\"G\"] = 71] = \"G\";\n            CharacterCodes[CharacterCodes[\"H\"] = 72] = \"H\";\n            CharacterCodes[CharacterCodes[\"I\"] = 73] = \"I\";\n            CharacterCodes[CharacterCodes[\"J\"] = 74] = \"J\";\n            CharacterCodes[CharacterCodes[\"K\"] = 75] = \"K\";\n            CharacterCodes[CharacterCodes[\"L\"] = 76] = \"L\";\n            CharacterCodes[CharacterCodes[\"M\"] = 77] = \"M\";\n            CharacterCodes[CharacterCodes[\"N\"] = 78] = \"N\";\n            CharacterCodes[CharacterCodes[\"O\"] = 79] = \"O\";\n            CharacterCodes[CharacterCodes[\"P\"] = 80] = \"P\";\n            CharacterCodes[CharacterCodes[\"Q\"] = 81] = \"Q\";\n            CharacterCodes[CharacterCodes[\"R\"] = 82] = \"R\";\n            CharacterCodes[CharacterCodes[\"S\"] = 83] = \"S\";\n            CharacterCodes[CharacterCodes[\"T\"] = 84] = \"T\";\n            CharacterCodes[CharacterCodes[\"U\"] = 85] = \"U\";\n            CharacterCodes[CharacterCodes[\"V\"] = 86] = \"V\";\n            CharacterCodes[CharacterCodes[\"W\"] = 87] = \"W\";\n            CharacterCodes[CharacterCodes[\"X\"] = 88] = \"X\";\n            CharacterCodes[CharacterCodes[\"Y\"] = 89] = \"Y\";\n            CharacterCodes[CharacterCodes[\"Z\"] = 90] = \"Z\";\n            CharacterCodes[CharacterCodes[\"asterisk\"] = 42] = \"asterisk\";\n            CharacterCodes[CharacterCodes[\"backslash\"] = 92] = \"backslash\";\n            CharacterCodes[CharacterCodes[\"closeBrace\"] = 125] = \"closeBrace\";\n            CharacterCodes[CharacterCodes[\"closeBracket\"] = 93] = \"closeBracket\";\n            CharacterCodes[CharacterCodes[\"colon\"] = 58] = \"colon\";\n            CharacterCodes[CharacterCodes[\"comma\"] = 44] = \"comma\";\n            CharacterCodes[CharacterCodes[\"dot\"] = 46] = \"dot\";\n            CharacterCodes[CharacterCodes[\"doubleQuote\"] = 34] = \"doubleQuote\";\n            CharacterCodes[CharacterCodes[\"minus\"] = 45] = \"minus\";\n            CharacterCodes[CharacterCodes[\"openBrace\"] = 123] = \"openBrace\";\n            CharacterCodes[CharacterCodes[\"openBracket\"] = 91] = \"openBracket\";\n            CharacterCodes[CharacterCodes[\"plus\"] = 43] = \"plus\";\n            CharacterCodes[CharacterCodes[\"slash\"] = 47] = \"slash\";\n            CharacterCodes[CharacterCodes[\"formFeed\"] = 12] = \"formFeed\";\n            CharacterCodes[CharacterCodes[\"tab\"] = 9] = \"tab\";\n        })(CharacterCodes || (CharacterCodes = {}));\n    },\n    316 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            QR: ()=>cachedSpaces,\n            mX: ()=>cachedBreakLinesWithSpaces,\n            wf: ()=>supportedEols\n        });\n        const cachedSpaces = new Array(20).fill(0).map((_, index)=>' '.repeat(index));\n        const maxCachedValues = 200;\n        const cachedBreakLinesWithSpaces = {\n            ' ': {\n                '\\n': new Array(maxCachedValues).fill(0).map((_, index)=>'\\n' + ' '.repeat(index)),\n                '\\r': new Array(maxCachedValues).fill(0).map((_, index)=>'\\r' + ' '.repeat(index)),\n                '\\r\\n': new Array(maxCachedValues).fill(0).map((_, index)=>'\\r\\n' + ' '.repeat(index))\n            },\n            '\\t': {\n                '\\n': new Array(maxCachedValues).fill(0).map((_, index)=>'\\n' + '\\t'.repeat(index)),\n                '\\r': new Array(maxCachedValues).fill(0).map((_, index)=>'\\r' + '\\t'.repeat(index)),\n                '\\r\\n': new Array(maxCachedValues).fill(0).map((_, index)=>'\\r\\n' + '\\t'.repeat(index))\n            }\n        };\n        const supportedEols = [\n            '\\n',\n            '\\r',\n            '\\r\\n'\n        ];\n    },\n    508 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            GP: ()=>format,\n            SM: ()=>findNodeAtOffset,\n            a6: ()=>SyntaxKind,\n            sC: ()=>ScanError,\n            z1: ()=>createScanner\n        });\n        var _impl_format__rspack_import_0 = __webpack_require__(97);\n        __webpack_require__(190);\n        var _impl_scanner__rspack_import_2 = __webpack_require__(650);\n        var _impl_parser__rspack_import_3 = __webpack_require__(809);\n        const createScanner = _impl_scanner__rspack_import_2.z;\n        var ScanError;\n        (function(ScanError) {\n            ScanError[ScanError[\"None\"] = 0] = \"None\";\n            ScanError[ScanError[\"UnexpectedEndOfComment\"] = 1] = \"UnexpectedEndOfComment\";\n            ScanError[ScanError[\"UnexpectedEndOfString\"] = 2] = \"UnexpectedEndOfString\";\n            ScanError[ScanError[\"UnexpectedEndOfNumber\"] = 3] = \"UnexpectedEndOfNumber\";\n            ScanError[ScanError[\"InvalidUnicode\"] = 4] = \"InvalidUnicode\";\n            ScanError[ScanError[\"InvalidEscapeCharacter\"] = 5] = \"InvalidEscapeCharacter\";\n            ScanError[ScanError[\"InvalidCharacter\"] = 6] = \"InvalidCharacter\";\n        })(ScanError || (ScanError = {}));\n        var SyntaxKind;\n        (function(SyntaxKind) {\n            SyntaxKind[SyntaxKind[\"OpenBraceToken\"] = 1] = \"OpenBraceToken\";\n            SyntaxKind[SyntaxKind[\"CloseBraceToken\"] = 2] = \"CloseBraceToken\";\n            SyntaxKind[SyntaxKind[\"OpenBracketToken\"] = 3] = \"OpenBracketToken\";\n            SyntaxKind[SyntaxKind[\"CloseBracketToken\"] = 4] = \"CloseBracketToken\";\n            SyntaxKind[SyntaxKind[\"CommaToken\"] = 5] = \"CommaToken\";\n            SyntaxKind[SyntaxKind[\"ColonToken\"] = 6] = \"ColonToken\";\n            SyntaxKind[SyntaxKind[\"NullKeyword\"] = 7] = \"NullKeyword\";\n            SyntaxKind[SyntaxKind[\"TrueKeyword\"] = 8] = \"TrueKeyword\";\n            SyntaxKind[SyntaxKind[\"FalseKeyword\"] = 9] = \"FalseKeyword\";\n            SyntaxKind[SyntaxKind[\"StringLiteral\"] = 10] = \"StringLiteral\";\n            SyntaxKind[SyntaxKind[\"NumericLiteral\"] = 11] = \"NumericLiteral\";\n            SyntaxKind[SyntaxKind[\"LineCommentTrivia\"] = 12] = \"LineCommentTrivia\";\n            SyntaxKind[SyntaxKind[\"BlockCommentTrivia\"] = 13] = \"BlockCommentTrivia\";\n            SyntaxKind[SyntaxKind[\"LineBreakTrivia\"] = 14] = \"LineBreakTrivia\";\n            SyntaxKind[SyntaxKind[\"Trivia\"] = 15] = \"Trivia\";\n            SyntaxKind[SyntaxKind[\"Unknown\"] = 16] = \"Unknown\";\n            SyntaxKind[SyntaxKind[\"EOF\"] = 17] = \"EOF\";\n        })(SyntaxKind || (SyntaxKind = {}));\n        _impl_parser__rspack_import_3.g$;\n        _impl_parser__rspack_import_3.qg;\n        _impl_parser__rspack_import_3.cZ;\n        _impl_parser__rspack_import_3.Wc;\n        const findNodeAtOffset = _impl_parser__rspack_import_3.SM;\n        _impl_parser__rspack_import_3.eY;\n        _impl_parser__rspack_import_3.yQ;\n        _impl_parser__rspack_import_3.YR;\n        _impl_parser__rspack_import_3.nY;\n        var ParseErrorCode;\n        (function(ParseErrorCode) {\n            ParseErrorCode[ParseErrorCode[\"InvalidSymbol\"] = 1] = \"InvalidSymbol\";\n            ParseErrorCode[ParseErrorCode[\"InvalidNumberFormat\"] = 2] = \"InvalidNumberFormat\";\n            ParseErrorCode[ParseErrorCode[\"PropertyNameExpected\"] = 3] = \"PropertyNameExpected\";\n            ParseErrorCode[ParseErrorCode[\"ValueExpected\"] = 4] = \"ValueExpected\";\n            ParseErrorCode[ParseErrorCode[\"ColonExpected\"] = 5] = \"ColonExpected\";\n            ParseErrorCode[ParseErrorCode[\"CommaExpected\"] = 6] = \"CommaExpected\";\n            ParseErrorCode[ParseErrorCode[\"CloseBraceExpected\"] = 7] = \"CloseBraceExpected\";\n            ParseErrorCode[ParseErrorCode[\"CloseBracketExpected\"] = 8] = \"CloseBracketExpected\";\n            ParseErrorCode[ParseErrorCode[\"EndOfFileExpected\"] = 9] = \"EndOfFileExpected\";\n            ParseErrorCode[ParseErrorCode[\"InvalidCommentToken\"] = 10] = \"InvalidCommentToken\";\n            ParseErrorCode[ParseErrorCode[\"UnexpectedEndOfComment\"] = 11] = \"UnexpectedEndOfComment\";\n            ParseErrorCode[ParseErrorCode[\"UnexpectedEndOfString\"] = 12] = \"UnexpectedEndOfString\";\n            ParseErrorCode[ParseErrorCode[\"UnexpectedEndOfNumber\"] = 13] = \"UnexpectedEndOfNumber\";\n            ParseErrorCode[ParseErrorCode[\"InvalidUnicode\"] = 14] = \"InvalidUnicode\";\n            ParseErrorCode[ParseErrorCode[\"InvalidEscapeCharacter\"] = 15] = \"InvalidEscapeCharacter\";\n            ParseErrorCode[ParseErrorCode[\"InvalidCharacter\"] = 16] = \"InvalidCharacter\";\n        })(ParseErrorCode || (ParseErrorCode = {}));\n        function format(documentText, range, options) {\n            return _impl_format__rspack_import_0.G(documentText, range, options);\n        }\n    },\n    2 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            _: ()=>getJsonWorkerManager\n        });\n        function getJsonWorkerManager() {\n            throw new Error(\"Nested JsonViewer Worker is not supported\");\n        }\n    },\n    162 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            E: ()=>isInWorkerThread\n        });\n        function isInWorkerThread() {\n            return true;\n        }\n    },\n    241 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            u: ()=>getCurrentNameSpaceId\n        });\n        let currentNameSpaceId = 'default';\n        function getCurrentNameSpaceId() {\n            return currentNameSpaceId;\n        }\n    },\n    626 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            V: ()=>CharacterClassifier\n        });\n        var _uint__rspack_import_0 = __webpack_require__(298);\n        class CharacterClassifier {\n            _asciiMap;\n            _map;\n            _defaultValue;\n            constructor(_defaultValue){\n                const defaultValue = (0, _uint__rspack_import_0.W_)(_defaultValue);\n                this._defaultValue = defaultValue;\n                this._asciiMap = CharacterClassifier._createAsciiMap(defaultValue);\n                this._map = new Map();\n            }\n            static _createAsciiMap(defaultValue) {\n                const asciiMap = new Uint8Array(256);\n                asciiMap.fill(defaultValue);\n                return asciiMap;\n            }\n            set(charCode, _value) {\n                const value = (0, _uint__rspack_import_0.W_)(_value);\n                if (charCode >= 0 && charCode < 256) this._asciiMap[charCode] = value;\n                else this._map.set(charCode, value);\n            }\n            get(charCode) {\n                if (charCode >= 0 && charCode < 256) return this._asciiMap[charCode];\n                return this._map.get(charCode) || this._defaultValue;\n            }\n            clear() {\n                this._asciiMap.fill(this._defaultValue);\n                this._map.clear();\n            }\n        }\n    },\n    538 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            dB: ()=>getEmitter\n        });\n        var _nameSpace__rspack_import_0 = __webpack_require__(241);\n        const emitterMap = new Map();\n        class Emitter {\n            listeners = {};\n            on(event, listener) {\n                if (!this.listeners[event]) this.listeners[event] = [];\n                this.listeners[event]?.push(listener);\n            }\n            off(event, listener) {\n                if (!this.listeners[event]) return;\n                this.listeners[event] = this.listeners[event]?.filter((l)=>l !== listener);\n            }\n            dispose() {\n                this.listeners = {};\n            }\n            removeAllListeners() {\n                this.listeners = {};\n            }\n            emit(event, data) {\n                if (!this.listeners[event]) return;\n                for (const listener of this.listeners[event])listener(data);\n            }\n        }\n        const getEmitter = ()=>{\n            const currentNameSpaceId = (0, _nameSpace__rspack_import_0.u)();\n            if (!currentNameSpaceId) throw new Error('currentNameSpaceId is not set');\n            let emitter = emitterMap.get(currentNameSpaceId);\n            if (!emitter) {\n                emitter = new Emitter();\n                emitterMap.set(currentNameSpaceId, emitter);\n            }\n            return emitter;\n        };\n    },\n    269 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            qK: ()=>LRUCache\n        });\n        function _to_primitive(input, hint) {\n            if (\"object\" !== _type_of(input) || null === input) return input;\n            var prim = input[Symbol.toPrimitive];\n            if (void 0 !== prim) {\n                var res = prim.call(input, hint || \"default\");\n                if (\"object\" !== _type_of(res)) return res;\n                throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n            }\n            return (\"string\" === hint ? String : Number)(input);\n        }\n        function _to_property_key(arg) {\n            var key = _to_primitive(arg, \"string\");\n            return \"symbol\" === _type_of(key) ? key : String(key);\n        }\n        function _type_of(obj) {\n            return obj && \"u\" > typeof Symbol && obj.constructor === Symbol ? \"symbol\" : typeof obj;\n        }\n        let _computedKey, _computedKey1;\n        _computedKey = _to_property_key(Symbol.toStringTag), _computedKey1 = _to_property_key(Symbol.iterator);\n        class LinkedMap {\n            [_computedKey] = 'LinkedMap';\n            _map;\n            _head;\n            _tail;\n            _size;\n            _state;\n            constructor(){\n                this._map = new Map();\n                this._head = void 0;\n                this._tail = void 0;\n                this._size = 0;\n                this._state = 0;\n            }\n            clear() {\n                this._map.clear();\n                this._head = void 0;\n                this._tail = void 0;\n                this._size = 0;\n                this._state++;\n            }\n            isEmpty() {\n                return !this._head && !this._tail;\n            }\n            get size() {\n                return this._size;\n            }\n            get first() {\n                return this._head?.value;\n            }\n            get last() {\n                return this._tail?.value;\n            }\n            has(key) {\n                return this._map.has(key);\n            }\n            get(key, touch = 0) {\n                const item = this._map.get(key);\n                if (!item) return;\n                if (0 !== touch) this.touch(item, touch);\n                return item.value;\n            }\n            set(key, value, touch = 0) {\n                let item = this._map.get(key);\n                if (item) {\n                    item.value = value;\n                    if (0 !== touch) this.touch(item, touch);\n                } else {\n                    item = {\n                        key,\n                        value,\n                        next: void 0,\n                        previous: void 0\n                    };\n                    switch(touch){\n                        case 0:\n                            this.addItemLast(item);\n                            break;\n                        case 1:\n                            this.addItemFirst(item);\n                            break;\n                        case 2:\n                            this.addItemLast(item);\n                            break;\n                        default:\n                            this.addItemLast(item);\n                            break;\n                    }\n                    this._map.set(key, item);\n                    this._size++;\n                }\n                return this;\n            }\n            delete(key) {\n                return !!this.remove(key);\n            }\n            remove(key) {\n                const item = this._map.get(key);\n                if (!item) return;\n                this._map.delete(key);\n                this.removeItem(item);\n                this._size--;\n                return item.value;\n            }\n            shift() {\n                if (!this._head && !this._tail) return;\n                if (!this._head || !this._tail) throw new Error('Invalid list');\n                const item = this._head;\n                this._map.delete(item.key);\n                this.removeItem(item);\n                this._size--;\n                return item.value;\n            }\n            forEach(callbackfn, thisArg) {\n                const state = this._state;\n                let current = this._head;\n                while(current){\n                    if (thisArg) callbackfn.bind(thisArg)(current.value, current.key, this);\n                    else callbackfn(current.value, current.key, this);\n                    if (this._state !== state) throw new Error(\"LinkedMap got modified during iteration.\");\n                    current = current.next;\n                }\n            }\n            keys() {\n                const map = this;\n                const state = this._state;\n                let current = this._head;\n                const iterator = {\n                    [Symbol.iterator] () {\n                        return iterator;\n                    },\n                    next () {\n                        if (map._state !== state) throw new Error(\"LinkedMap got modified during iteration.\");\n                        if (!current) return {\n                            value: void 0,\n                            done: true\n                        };\n                        {\n                            const result = {\n                                value: current.key,\n                                done: false\n                            };\n                            current = current.next;\n                            return result;\n                        }\n                    }\n                };\n                return iterator;\n            }\n            values() {\n                const map = this;\n                const state = this._state;\n                let current = this._head;\n                const iterator = {\n                    [Symbol.iterator] () {\n                        return iterator;\n                    },\n                    next () {\n                        if (map._state !== state) throw new Error(\"LinkedMap got modified during iteration.\");\n                        if (!current) return {\n                            value: void 0,\n                            done: true\n                        };\n                        {\n                            const result = {\n                                value: current.value,\n                                done: false\n                            };\n                            current = current.next;\n                            return result;\n                        }\n                    }\n                };\n                return iterator;\n            }\n            entries() {\n                const map = this;\n                const state = this._state;\n                let current = this._head;\n                const iterator = {\n                    [Symbol.iterator] () {\n                        return iterator;\n                    },\n                    next () {\n                        if (map._state !== state) throw new Error(\"LinkedMap got modified during iteration.\");\n                        if (!current) return {\n                            value: void 0,\n                            done: true\n                        };\n                        {\n                            const result = {\n                                value: [\n                                    current.key,\n                                    current.value\n                                ],\n                                done: false\n                            };\n                            current = current.next;\n                            return result;\n                        }\n                    }\n                };\n                return iterator;\n            }\n            [_computedKey1]() {\n                return this.entries();\n            }\n            trimOld(newSize) {\n                if (newSize >= this.size) return;\n                if (0 === newSize) return void this.clear();\n                let current = this._head;\n                let currentSize = this.size;\n                while(current && currentSize > newSize){\n                    this._map.delete(current.key);\n                    current = current.next;\n                    currentSize--;\n                }\n                this._head = current;\n                this._size = currentSize;\n                if (current) current.previous = void 0;\n                this._state++;\n            }\n            trimNew(newSize) {\n                if (newSize >= this.size) return;\n                if (0 === newSize) return void this.clear();\n                let current = this._tail;\n                let currentSize = this.size;\n                while(current && currentSize > newSize){\n                    this._map.delete(current.key);\n                    current = current.previous;\n                    currentSize--;\n                }\n                this._tail = current;\n                this._size = currentSize;\n                if (current) current.next = void 0;\n                this._state++;\n            }\n            addItemFirst(item) {\n                if (this._head || this._tail) if (this._head) {\n                    item.next = this._head;\n                    this._head.previous = item;\n                } else throw new Error('Invalid list');\n                else this._tail = item;\n                this._head = item;\n                this._state++;\n            }\n            addItemLast(item) {\n                if (this._head || this._tail) if (this._tail) {\n                    item.previous = this._tail;\n                    this._tail.next = item;\n                } else throw new Error('Invalid list');\n                else this._head = item;\n                this._tail = item;\n                this._state++;\n            }\n            removeItem(item) {\n                if (item === this._head && item === this._tail) {\n                    this._head = void 0;\n                    this._tail = void 0;\n                } else if (item === this._head) {\n                    if (!item.next) throw new Error('Invalid list');\n                    item.next.previous = void 0;\n                    this._head = item.next;\n                } else if (item === this._tail) {\n                    if (!item.previous) throw new Error('Invalid list');\n                    item.previous.next = void 0;\n                    this._tail = item.previous;\n                } else {\n                    const next = item.next;\n                    const previous = item.previous;\n                    if (!next || !previous) throw new Error('Invalid list');\n                    next.previous = previous;\n                    previous.next = next;\n                }\n                item.next = void 0;\n                item.previous = void 0;\n                this._state++;\n            }\n            touch(item, touch) {\n                if (!this._head || !this._tail) throw new Error('Invalid list');\n                if (1 !== touch && 2 !== touch) return;\n                if (1 === touch) {\n                    if (item === this._head) return;\n                    const next = item.next;\n                    const previous = item.previous;\n                    if (item === this._tail) {\n                        previous.next = void 0;\n                        this._tail = previous;\n                    } else {\n                        next.previous = previous;\n                        previous.next = next;\n                    }\n                    item.previous = void 0;\n                    item.next = this._head;\n                    this._head.previous = item;\n                    this._head = item;\n                    this._state++;\n                } else if (2 === touch) {\n                    if (item === this._tail) return;\n                    const next = item.next;\n                    const previous = item.previous;\n                    if (item === this._head) {\n                        next.previous = void 0;\n                        this._head = next;\n                    } else {\n                        next.previous = previous;\n                        previous.next = next;\n                    }\n                    item.next = void 0;\n                    item.previous = this._tail;\n                    this._tail.next = item;\n                    this._tail = item;\n                    this._state++;\n                }\n            }\n            toJSON() {\n                const data = [];\n                this.forEach((value, key)=>{\n                    data.push([\n                        key,\n                        value\n                    ]);\n                });\n                return data;\n            }\n            fromJSON(data) {\n                this.clear();\n                for (const [key, value] of data)this.set(key, value);\n            }\n        }\n        class Cache extends LinkedMap {\n            _limit;\n            _ratio;\n            constructor(limit, ratio = 1){\n                super();\n                this._limit = limit;\n                this._ratio = Math.min(Math.max(0, ratio), 1);\n            }\n            get limit() {\n                return this._limit;\n            }\n            set limit(limit) {\n                this._limit = limit;\n                this.checkTrim();\n            }\n            get ratio() {\n                return this._ratio;\n            }\n            set ratio(ratio) {\n                this._ratio = Math.min(Math.max(0, ratio), 1);\n                this.checkTrim();\n            }\n            get(key, touch = 2) {\n                return super.get(key, touch);\n            }\n            peek(key) {\n                return super.get(key, 0);\n            }\n            set(key, value) {\n                super.set(key, value, 2);\n                return this;\n            }\n            checkTrim() {\n                if (this.size > this._limit) this.trim(Math.round(this._limit * this._ratio));\n            }\n        }\n        class LRUCache extends Cache {\n            constructor(limit, ratio = 1){\n                super(limit, ratio);\n            }\n            trim(newSize) {\n                this.trimOld(newSize);\n            }\n            set(key, value) {\n                super.set(key, value);\n                this.checkTrim();\n                return this;\n            }\n        }\n    },\n    753 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            Dg: ()=>FindMatch,\n            L5: ()=>SearchData\n        });\n        class FindMatch {\n            _findMatchBrand = void 0;\n            range;\n            matches;\n            constructor(range, matches){\n                this.range = range;\n                this.matches = matches;\n            }\n        }\n        class SearchData {\n            regex;\n            wordSeparators;\n            simpleSearch;\n            constructor(regex, wordSeparators, simpleSearch){\n                this.regex = regex;\n                this.wordSeparators = wordSeparators;\n                this.simpleSearch = simpleSearch;\n            }\n        }\n    },\n    833 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            y: ()=>Position\n        });\n        class Position {\n            lineNumber;\n            column;\n            constructor(lineNumber, column){\n                this.lineNumber = lineNumber;\n                this.column = column;\n            }\n        }\n    },\n    49 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            Q: ()=>Range\n        });\n        var _position__rspack_import_0 = __webpack_require__(833);\n        class Range {\n            startLineNumber;\n            startColumn;\n            endLineNumber;\n            endColumn;\n            constructor(startLineNumber, startColumn, endLineNumber, endColumn){\n                if (startLineNumber > endLineNumber || startLineNumber === endLineNumber && startColumn > endColumn) {\n                    this.startLineNumber = endLineNumber;\n                    this.startColumn = endColumn;\n                    this.endLineNumber = startLineNumber;\n                    this.endColumn = startColumn;\n                } else {\n                    this.startLineNumber = startLineNumber;\n                    this.startColumn = startColumn;\n                    this.endLineNumber = endLineNumber;\n                    this.endColumn = endColumn;\n                }\n            }\n            static create(start, end) {\n                return new Range(start.lineNumber, start.column, end.lineNumber, end.column);\n            }\n            static areIntersecting(a, b) {\n                if (a.endLineNumber < b.startLineNumber || a.endLineNumber === b.startLineNumber && a.endColumn <= b.startColumn) return false;\n                if (b.endLineNumber < a.startLineNumber || b.endLineNumber === a.startLineNumber && b.endColumn <= a.startColumn) return false;\n                return true;\n            }\n            plusRange(range) {\n                return Range.plusRange(this, range);\n            }\n            static plusRange(a, b) {\n                let startLineNumber;\n                let startColumn;\n                let endLineNumber;\n                let endColumn;\n                if (b.startLineNumber < a.startLineNumber) {\n                    startLineNumber = b.startLineNumber;\n                    startColumn = b.startColumn;\n                } else if (b.startLineNumber === a.startLineNumber) {\n                    startLineNumber = b.startLineNumber;\n                    startColumn = Math.min(b.startColumn, a.startColumn);\n                } else {\n                    startLineNumber = a.startLineNumber;\n                    startColumn = a.startColumn;\n                }\n                if (b.endLineNumber > a.endLineNumber) {\n                    endLineNumber = b.endLineNumber;\n                    endColumn = b.endColumn;\n                } else if (b.endLineNumber === a.endLineNumber) {\n                    endLineNumber = b.endLineNumber;\n                    endColumn = Math.max(b.endColumn, a.endColumn);\n                } else {\n                    endLineNumber = a.endLineNumber;\n                    endColumn = a.endColumn;\n                }\n                return new Range(startLineNumber, startColumn, endLineNumber, endColumn);\n            }\n            getStartPosition() {\n                return Range.getStartPosition(this);\n            }\n            static getStartPosition(range) {\n                return new _position__rspack_import_0.y(range.startLineNumber, range.startColumn);\n            }\n        }\n    },\n    982 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            OS: ()=>createRegExp,\n            Z5: ()=>getNextCodePoint\n        });\n        function escapeRegExpCharacters(value) {\n            return value.replace(/[\\\\\\{\\}\\*\\+\\?\\|\\^\\$\\.\\[\\]\\(\\)]/g, '\\\\$&');\n        }\n        function isHighSurrogate(charCode) {\n            return 0xd800 <= charCode && charCode <= 0xdbff;\n        }\n        function isLowSurrogate(charCode) {\n            return 0xdc00 <= charCode && charCode <= 0xdfff;\n        }\n        function computeCodePoint(highSurrogate, lowSurrogate) {\n            return (highSurrogate - 0xd800 << 10) + (lowSurrogate - 0xdc00) + 0x10000;\n        }\n        function getNextCodePoint(str, len, offset) {\n            const charCode = str.charCodeAt(offset);\n            if (isHighSurrogate(charCode) && offset + 1 < len) {\n                const nextCharCode = str.charCodeAt(offset + 1);\n                if (isLowSurrogate(nextCharCode)) return computeCodePoint(charCode, nextCharCode);\n            }\n            return charCode;\n        }\n        function createRegExp(searchString, isRegex, options = {}) {\n            if (!searchString) throw new Error('Cannot create regex from empty string');\n            if (!isRegex) searchString = escapeRegExpCharacters(searchString);\n            if (options.wholeWord) {\n                if (!/\\B/.test(searchString.charAt(0))) searchString = '\\\\b' + searchString;\n                if (!/\\B/.test(searchString.charAt(searchString.length - 1))) searchString += '\\\\b';\n            }\n            let modifiers = '';\n            if (options.global) modifiers += 'g';\n            if (!options.matchCase) modifiers += 'i';\n            if (options.multiline) modifiers += 'm';\n            if (options.unicode) modifiers += 'u';\n            return new RegExp(searchString, modifiers);\n        }\n    },\n    298 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            W_: ()=>toUint8\n        });\n        function toUint8(v) {\n            if (v < 0) return 0;\n            if (v > 255) return 255;\n            return 0 | v;\n        }\n    },\n    861 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            Et: ()=>isNumber,\n            Gv: ()=>isObject\n        });\n        function isObject(val) {\n            return 'object' == typeof val && null !== val && !Array.isArray(val);\n        }\n        function isNumber(val) {\n            return 'number' == typeof val;\n        }\n    },\n    942 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            SM: ()=>WordCharacterClass,\n            iJ: ()=>getMapForWordSeparators\n        });\n        var _map__rspack_import_2 = __webpack_require__(269);\n        var _characterClassifier__rspack_import_0 = __webpack_require__(626);\n        var WordCharacterClass = /*#__PURE__*/ function(WordCharacterClass) {\n            WordCharacterClass[WordCharacterClass[\"Regular\"] = 0] = \"Regular\";\n            WordCharacterClass[WordCharacterClass[\"Whitespace\"] = 1] = \"Whitespace\";\n            WordCharacterClass[WordCharacterClass[\"WordSeparator\"] = 2] = \"WordSeparator\";\n            return WordCharacterClass;\n        }({});\n        class WordCharacterClassifier extends _characterClassifier__rspack_import_0.V {\n            intlSegmenterLocales;\n            _segmenter = null;\n            _cachedLine = null;\n            _cachedSegments = [];\n            constructor(wordSeparators, intlSegmenterLocales){\n                super(0);\n                this.intlSegmenterLocales = intlSegmenterLocales;\n                if (this.intlSegmenterLocales.length > 0) this._segmenter = new Intl.Segmenter(this.intlSegmenterLocales, {\n                    granularity: 'word'\n                });\n                else this._segmenter = null;\n                for(let i = 0, len = wordSeparators.length; i < len; i++)this.set(wordSeparators.charCodeAt(i), 2);\n                this.set(32, 1);\n                this.set(9, 1);\n            }\n            findPrevIntlWordBeforeOrAtOffset(line, offset) {\n                let candidate = null;\n                for (const segment of this._getIntlSegmenterWordsOnLine(line)){\n                    if (segment.index > offset) break;\n                    candidate = segment;\n                }\n                return candidate;\n            }\n            findNextIntlWordAtOrAfterOffset(lineContent, offset) {\n                for (const segment of this._getIntlSegmenterWordsOnLine(lineContent))if (!(segment.index < offset)) return segment;\n                return null;\n            }\n            _getIntlSegmenterWordsOnLine(line) {\n                if (!this._segmenter) return [];\n                if (this._cachedLine === line) return this._cachedSegments;\n                this._cachedLine = line;\n                this._cachedSegments = this._filterWordSegments(this._segmenter.segment(line));\n                return this._cachedSegments;\n            }\n            _filterWordSegments(segments) {\n                const result = [];\n                for (const segment of segments)if (this._isWordLike(segment)) result.push(segment);\n                return result;\n            }\n            _isWordLike(segment) {\n                if (segment.isWordLike) return true;\n                return false;\n            }\n        }\n        const wordClassifierCache = new _map__rspack_import_2.qK(10);\n        function getMapForWordSeparators(wordSeparators, intlSegmenterLocales) {\n            const key = `${wordSeparators}/${intlSegmenterLocales.join(',')}`;\n            let result = wordClassifierCache.get(key);\n            if (!result) {\n                result = new WordCharacterClassifier(wordSeparators, intlSegmenterLocales);\n                wordClassifierCache.set(key, result);\n            }\n            return result;\n        }\n    },\n    575 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            Rj: ()=>DeleteCommand,\n            TX: ()=>InsertCommand,\n            fE: ()=>MultiCommand,\n            iu: ()=>ReplaceCommand\n        });\n        class BaseCommand {\n            model;\n            operation;\n            oldPos;\n            newPos;\n            constructor(model, operation){\n                this.model = model;\n                this.operation = operation;\n                this.oldPos = {\n                    ...model.lastChangeBufferPos\n                };\n                this.model.updateLastChangeBufferPos(operation);\n                this.newPos = {\n                    ...model.lastChangeBufferPos\n                };\n            }\n            updateBufferPos(isUndo) {\n                this.model.lastChangeBufferPos = {\n                    ...isUndo ? this.oldPos : this.newPos\n                };\n            }\n        }\n        class InsertCommand extends BaseCommand {\n            execute() {\n                this.model.pieceTree.insert(this.operation.rangeOffset, this.operation.newText);\n                this.updateBufferPos(false);\n            }\n            undo() {\n                this.model.pieceTree.delete(this.operation.rangeOffset, this.operation.newText.length);\n                this.updateBufferPos(true);\n            }\n        }\n        class DeleteCommand extends BaseCommand {\n            execute() {\n                this.model.pieceTree.delete(this.operation.rangeOffset, this.operation.rangeLength);\n                this.updateBufferPos(false);\n            }\n            undo() {\n                this.model.pieceTree.insert(this.operation.rangeOffset, this.operation.oldText);\n                this.updateBufferPos(true);\n            }\n        }\n        class ReplaceCommand extends BaseCommand {\n            execute() {\n                this.model.pieceTree.delete(this.operation.rangeOffset, this.operation.oldText.length);\n                this.model.pieceTree.insert(this.operation.rangeOffset, this.operation.newText);\n                this.updateBufferPos(false);\n            }\n            undo() {\n                this.model.pieceTree.delete(this.operation.rangeOffset, this.operation.newText.length);\n                this.model.pieceTree.insert(this.operation.rangeOffset, this.operation.oldText);\n                this.updateBufferPos(true);\n            }\n        }\n        class MultiCommand {\n            model;\n            operation;\n            oldPos;\n            newPos;\n            constructor(model, operation){\n                this.model = model;\n                this.operation = operation;\n                this.oldPos = {\n                    ...model.lastChangeBufferPos\n                };\n                this.newPos = {\n                    ...model.lastChangeBufferPos\n                };\n            }\n            execute() {\n                for(let i = 0; i < this.operation.length; i++){\n                    const op = this.operation[i];\n                    switch(op.type){\n                        case 'insert':\n                            this.model.pieceTree.insert(op.rangeOffset, op.newText);\n                            break;\n                        case 'delete':\n                            this.model.pieceTree.delete(op.rangeOffset, op.rangeLength);\n                            break;\n                        case 'replace':\n                            this.model.pieceTree.delete(op.rangeOffset, op.oldText.length);\n                            this.model.pieceTree.insert(op.rangeOffset, op.newText);\n                            break;\n                    }\n                }\n                this.model.lastChangeBufferPos = {\n                    ...this.newPos\n                };\n            }\n            undo() {\n                for(let i = this.operation.length - 1; i >= 0; i--){\n                    const op = this.operation[i];\n                    if (op.newText && op.oldText) {\n                        this.model.pieceTree.delete(op.rangeOffset, op.newText.length);\n                        this.model.pieceTree.insert(op.rangeOffset, op.oldText);\n                    } else if (op.newText) this.model.pieceTree.delete(op.rangeOffset, op.newText.length);\n                    else this.model.pieceTree.insert(op.rangeOffset, op.oldText);\n                }\n                this.model.lastChangeBufferPos = {\n                    ...this.oldPos\n                };\n            }\n        }\n    },\n    574 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            k: ()=>createModel\n        });\n        var _jsonModel__rspack_import_0 = __webpack_require__(701);\n        function createModel(text, normalizeEOL = true) {\n            return new _jsonModel__rspack_import_0.G(text, normalizeEOL);\n        }\n    },\n    701 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            G: ()=>JSONModel\n        });\n        var _pieceTreeTextBuffer__rspack_import_0 = __webpack_require__(120);\n        var _common_range__rspack_import_6 = __webpack_require__(49);\n        var _common_emitter__rspack_import_3 = __webpack_require__(538);\n        var _textModelSearch__rspack_import_7 = __webpack_require__(94);\n        var _worker_jsonWorkerManager__rspack_import_2 = __webpack_require__(2);\n        var _common_worker__rspack_import_1 = __webpack_require__(162);\n        var _command__rspack_import_4 = __webpack_require__(575);\n        class JSONModel {\n            _pieceTree;\n            _normalizeEOL;\n            _undoStack = [];\n            _redoStack = [];\n            MAX_STACK_SIZE = 20;\n            lastChangeBufferPos = {\n                lineNumber: 1,\n                column: 1\n            };\n            _jsonWorkerManager = null;\n            emitter = null;\n            constructor(value, normalizeEOL = true){\n                this._normalizeEOL = normalizeEOL;\n                this._pieceTree = this.createTextBuffer(value);\n                if (!(0, _common_worker__rspack_import_1.E)()) {\n                    this._jsonWorkerManager = (0, _worker_jsonWorkerManager__rspack_import_2._)();\n                    this.emitter = (0, _common_emitter__rspack_import_3.dB)();\n                }\n            }\n            get pieceTree() {\n                return this._pieceTree;\n            }\n            createTextBufferFactory(value) {\n                const builder = new _pieceTreeTextBuffer__rspack_import_0.xj();\n                builder.acceptChunk(value);\n                return builder.finish(this._normalizeEOL);\n            }\n            createTextBuffer(value) {\n                return this.createTextBufferFactory(value).create(1);\n            }\n            getLineCount() {\n                return this._pieceTree.getLineCount();\n            }\n            getLineContent(lineNumber) {\n                return this._pieceTree.getLineContent(lineNumber);\n            }\n            getLineLength(lineNumber) {\n                return this._pieceTree.getLineLength(lineNumber);\n            }\n            getOffsetAt(lineNumber, column) {\n                return this._pieceTree.getOffsetAt(lineNumber, column);\n            }\n            positionAt(offset) {\n                offset = Math.min(this._pieceTree.getLength(), Math.max(0, offset));\n                return this._pieceTree.getPositionAt(offset);\n            }\n            _createCommand(op) {\n                if (Array.isArray(op)) return new _command__rspack_import_4.fE(this, op);\n                switch(op.type){\n                    case 'insert':\n                        return new _command__rspack_import_4.TX(this, op);\n                    case 'delete':\n                        return new _command__rspack_import_4.Rj(this, op);\n                    case 'replace':\n                        return new _command__rspack_import_4.iu(this, op);\n                    default:\n                        throw new Error('Unknown operation type');\n                }\n            }\n            applyOperation(op) {\n                this._redoStack = [];\n                const command = this._createCommand(op);\n                this.pushUndoStack(command);\n                command.execute();\n                if (!(0, _common_worker__rspack_import_1.E)()) this.emitter?.emit('contentChanged', op);\n                if (this._jsonWorkerManager) this._jsonWorkerManager.updateModel(op).then((res)=>this._jsonWorkerManager?.validate()).then((result)=>{\n                    this.emitter?.emit('problemsChanged', {\n                        problems: result.problems,\n                        root: result.root\n                    });\n                });\n            }\n            updateLastChangeBufferPos(op) {\n                if (op.keepPosition) {\n                    this.lastChangeBufferPos = op.keepPosition;\n                    return;\n                }\n                const getEndPosition = (startLineNumber, startColumn, text)=>{\n                    const parts = text.split(/\\r\\n|\\r|\\n/);\n                    const lineBreakCount = parts.length - 1;\n                    if (0 === lineBreakCount) return {\n                        lineNumber: startLineNumber,\n                        column: startColumn + text.length\n                    };\n                    return {\n                        lineNumber: startLineNumber + lineBreakCount,\n                        column: parts[parts.length - 1].length + 1\n                    };\n                };\n                switch(op.type){\n                    case 'insert':\n                        this.lastChangeBufferPos = getEndPosition(op.range.startLineNumber, op.range.startColumn, op.newText);\n                        break;\n                    case 'delete':\n                        if (1 === this.lastChangeBufferPos.column) {\n                            this.lastChangeBufferPos.lineNumber -= 1;\n                            this.lastChangeBufferPos.column = this.getLineLength(this.lastChangeBufferPos.lineNumber) + 1;\n                        } else {\n                            const startColumn = op.range.startColumn;\n                            const newColumn = 1 === op.rangeLength ? startColumn - 1 : startColumn;\n                            this.lastChangeBufferPos.column = newColumn;\n                        }\n                        break;\n                    case 'replace':\n                        this.lastChangeBufferPos = getEndPosition(op.range.startLineNumber, op.range.startColumn, op.newText);\n                        break;\n                }\n            }\n            pushUndoStack(command) {\n                this._undoStack.push(command);\n                if (this._undoStack.length > this.MAX_STACK_SIZE) this._undoStack.shift();\n            }\n            pushRedoStack(command) {\n                this._redoStack.push(command);\n                if (this._redoStack.length > this.MAX_STACK_SIZE) this._redoStack.shift();\n            }\n            canUndo() {\n                return this._undoStack.length > 0;\n            }\n            canRedo() {\n                return this._redoStack.length > 0;\n            }\n            undo() {\n                if (!this.canUndo()) return;\n                const command = this._undoStack.pop();\n                command.undo();\n                this._redoStack.push(command);\n                if (!(0, _common_worker__rspack_import_1.E)()) this.emitter?.emit('contentChanged', command.operation);\n                if (this._jsonWorkerManager) this._jsonWorkerManager.undo().then((res)=>this._jsonWorkerManager?.validate()).then((result)=>{\n                    this.emitter?.emit('problemsChanged', {\n                        problems: result.problems,\n                        root: result.root\n                    });\n                });\n            }\n            redo() {\n                if (!this.canRedo()) return;\n                const command = this._redoStack.pop();\n                command.execute();\n                this._undoStack.push(command);\n                if (!(0, _common_worker__rspack_import_1.E)()) this.emitter?.emit('contentChanged', command.operation);\n                if (this._jsonWorkerManager) this._jsonWorkerManager.redo().then((res)=>this._jsonWorkerManager?.validate()).then((result)=>{\n                    this.emitter?.emit('problemsChanged', {\n                        problems: result.problems,\n                        root: result.root\n                    });\n                });\n            }\n            getValue() {\n                return this._pieceTree.getValueInRange({\n                    startLineNumber: 1,\n                    startColumn: 1,\n                    endLineNumber: this._pieceTree.getLineCount(),\n                    endColumn: this._pieceTree.getLineContent(this._pieceTree.getLineCount()).length + 1\n                });\n            }\n            setValue(value) {\n                const builder = new _pieceTreeTextBuffer__rspack_import_0.xj();\n                builder.acceptChunk(value);\n                this._pieceTree = builder.finish(this._normalizeEOL).create(1);\n            }\n            getEOL() {\n                return this._pieceTree.getEOL();\n            }\n            _getEndOfLine(eol) {\n                switch(eol){\n                    case 1:\n                        return '\\n';\n                    case 2:\n                        return '\\r\\n';\n                    case 0:\n                        return this.getEOL();\n                    default:\n                        throw new Error('Unknown EOL preference');\n                }\n            }\n            getValueInRange(range, eol = 0) {\n                return this._pieceTree.getValueInRange(range, this._getEndOfLine(eol));\n            }\n            getFullModelRange() {\n                const lineCount = this.getLineCount();\n                return new _common_range__rspack_import_6.Q(1, 1, lineCount, this.getLineLength(lineCount) + 1);\n            }\n            findMatchesLineByLine(searchRange, searchData, captureMatches, limitResultCount) {\n                return this._pieceTree.findMatchesLineByLine(searchRange, searchData, captureMatches, limitResultCount);\n            }\n            findMatches(searchString, rawSearchScope, isRegex, matchCase, wordSeparators, captureMatches, limitResultCount = 1 / 0) {\n                let searchRanges = null;\n                if (null === searchRanges) searchRanges = [\n                    this.getFullModelRange()\n                ];\n                searchRanges = searchRanges.sort((d1, d2)=>d1.startLineNumber - d2.startLineNumber || d1.startColumn - d2.startColumn);\n                const uniqueSearchRanges = [];\n                uniqueSearchRanges.push(searchRanges.reduce((prev, curr)=>{\n                    if (_common_range__rspack_import_6.Q.areIntersecting(prev, curr)) return prev.plusRange(curr);\n                    uniqueSearchRanges.push(prev);\n                    return curr;\n                }));\n                let matchMapper;\n                if (!isRegex && searchString.indexOf('\\n') < 0) {\n                    const searchParams = new _textModelSearch__rspack_import_7.lt(searchString, isRegex, matchCase, wordSeparators);\n                    const searchData = searchParams.parseSearchRequest();\n                    if (!searchData) return [];\n                    matchMapper = (searchRange)=>this.findMatchesLineByLine(searchRange, searchData, captureMatches, limitResultCount);\n                } else matchMapper = (searchRange)=>_textModelSearch__rspack_import_7.hB.findMatches(this, new _textModelSearch__rspack_import_7.lt(searchString, isRegex, matchCase, wordSeparators), searchRange, captureMatches, limitResultCount);\n                return uniqueSearchRanges.map(matchMapper).reduce((arr, matches)=>arr.concat(matches), []);\n            }\n            isStartPosition() {\n                const { lineNumber, column } = this.lastChangeBufferPos;\n                return 1 === lineNumber && 1 === column;\n            }\n        }\n    },\n    94 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            W5: ()=>Searcher,\n            dr: ()=>createFindMatch,\n            hB: ()=>TextModelSearch,\n            lt: ()=>SearchParams,\n            wC: ()=>isValidMatch\n        });\n        var _common_wordCharacterClassifier__rspack_import_4 = __webpack_require__(942);\n        var _common_model__rspack_import_1 = __webpack_require__(753);\n        var _common_range__rspack_import_2 = __webpack_require__(49);\n        var _common_strings__rspack_import_3 = __webpack_require__(982);\n        class LineFeedCounter {\n            _lineFeedsOffsets;\n            constructor(text){\n                const lineFeedsOffsets = [];\n                let lineFeedsOffsetsLen = 0;\n                for(let i = 0, textLen = text.length; i < textLen; i++)if (10 === text.charCodeAt(i)) lineFeedsOffsets[lineFeedsOffsetsLen++] = i;\n                this._lineFeedsOffsets = lineFeedsOffsets;\n            }\n            findLineFeedCountBeforeOffset(offset) {\n                const lineFeedsOffsets = this._lineFeedsOffsets;\n                let min = 0;\n                let max = lineFeedsOffsets.length - 1;\n                if (-1 === max) return 0;\n                if (offset <= lineFeedsOffsets[0]) return 0;\n                while(min < max){\n                    const mid = min + ((max - min) / 2 | 0);\n                    if (lineFeedsOffsets[mid] >= offset) max = mid - 1;\n                    else if (lineFeedsOffsets[mid + 1] >= offset) {\n                        min = mid;\n                        max = mid;\n                    } else min = mid + 1;\n                }\n                return min + 1;\n            }\n        }\n        class TextModelSearch {\n            static findMatches(model, searchParams, searchRange, captureMatches, limitResultCount) {\n                const searchData = searchParams.parseSearchRequest();\n                if (!searchData) return [];\n                if (searchData.regex.multiline) return this._doFindMatchesMultiline(model, searchRange, new Searcher(searchData.wordSeparators, searchData.regex), captureMatches, limitResultCount);\n                return this._doFindMatchesLineByLine(model, searchRange, searchData, captureMatches, limitResultCount);\n            }\n            static _doFindMatchesMultiline(model, searchRange, searcher, captureMatches, limitResultCount) {\n                const pos = searchRange.getStartPosition();\n                const deltaOffset = model.getOffsetAt(pos.lineNumber, pos.column);\n                const text = model.getValueInRange(searchRange, 1);\n                const lfCounter = '\\r\\n' === model.getEOL() ? new LineFeedCounter(text) : null;\n                const result = [];\n                let counter = 0;\n                let m;\n                searcher.reset(0);\n                while(m = searcher.next(text)){\n                    result[counter++] = createFindMatch(this._getMultilineMatchRange(model, deltaOffset, text, lfCounter, m.index, m[0]), m, captureMatches);\n                    if (counter >= limitResultCount) break;\n                }\n                return result;\n            }\n            static _getMultilineMatchRange(model, deltaOffset, text, lfCounter, matchIndex, match0) {\n                let startOffset;\n                let lineFeedCountBeforeMatch = 0;\n                if (lfCounter) {\n                    lineFeedCountBeforeMatch = lfCounter.findLineFeedCountBeforeOffset(matchIndex);\n                    startOffset = deltaOffset + matchIndex + lineFeedCountBeforeMatch;\n                } else startOffset = deltaOffset + matchIndex;\n                let endOffset;\n                if (lfCounter) {\n                    const lineFeedCountBeforeEndOfMatch = lfCounter.findLineFeedCountBeforeOffset(matchIndex + match0.length);\n                    const lineFeedCountInMatch = lineFeedCountBeforeEndOfMatch - lineFeedCountBeforeMatch;\n                    endOffset = startOffset + match0.length + lineFeedCountInMatch;\n                } else endOffset = startOffset + match0.length;\n                const startPosition = model.positionAt(startOffset);\n                const endPosition = model.positionAt(endOffset);\n                return new _common_range__rspack_import_2.Q(startPosition.lineNumber, startPosition.column, endPosition.lineNumber, endPosition.column);\n            }\n            static _doFindMatchesLineByLine(model, searchRange, searchData, captureMatches, limitResultCount) {\n                const res = [];\n                let resLen = 0;\n                if (searchRange.startLineNumber === searchRange.endLineNumber) {\n                    const text = model.getLineContent(searchRange.startLineNumber).substring(searchRange.startColumn - 1, searchRange.endColumn - 1);\n                    resLen = this._findMatchesInLine(searchData, text, searchRange.startLineNumber, searchRange.startColumn - 1, resLen, res, captureMatches, limitResultCount);\n                }\n                const text = model.getLineContent(searchRange.startLineNumber).substring(searchRange.startColumn - 1);\n                resLen = this._findMatchesInLine(searchData, text, searchRange.startLineNumber, searchRange.startColumn - 1, resLen, res, captureMatches, limitResultCount);\n                for(let lineNumber = searchRange.startLineNumber + 1; lineNumber < searchRange.endLineNumber && resLen < limitResultCount; lineNumber++)resLen = this._findMatchesInLine(searchData, model.getLineContent(lineNumber), lineNumber, 0, resLen, res, captureMatches, limitResultCount);\n                if (resLen < limitResultCount) {\n                    const text = model.getLineContent(searchRange.endLineNumber).substring(0, searchRange.endColumn - 1);\n                    resLen = this._findMatchesInLine(searchData, text, searchRange.endLineNumber, 0, resLen, res, captureMatches, limitResultCount);\n                }\n                return res;\n            }\n            static _findMatchesInLine(searchData, text, lineNumber, deltaOffset, resultLen, result, captureMatches, limitResultCount) {\n                const wordSeparators = searchData.wordSeparators;\n                if (!captureMatches && searchData.simpleSearch) {\n                    const searchString = searchData.simpleSearch;\n                    const searchStringLen = searchString.length;\n                    const textLength = text.length;\n                    let lastMatchIndex = -searchStringLen;\n                    while(-1 !== (lastMatchIndex = text.indexOf(searchString, lastMatchIndex + searchStringLen)))if (!wordSeparators || isValidMatch(wordSeparators, text, textLength, lastMatchIndex, searchStringLen)) {\n                        result[resultLen++] = new _common_model__rspack_import_1.Dg(new _common_range__rspack_import_2.Q(lineNumber, lastMatchIndex + 1 + deltaOffset, lineNumber, lastMatchIndex + 1 + searchStringLen + deltaOffset), null);\n                        if (resultLen >= limitResultCount) return resultLen;\n                    }\n                }\n                const searcher = new Searcher(searchData.wordSeparators, searchData.regex);\n                let m;\n                searcher.reset(0);\n                do {\n                    m = searcher.next(text);\n                    if (m) {\n                        result[resultLen++] = createFindMatch(new _common_range__rspack_import_2.Q(lineNumber, m.index + 1 + deltaOffset, lineNumber, m.index + 1 + m[0].length + deltaOffset), m, captureMatches);\n                        if (resultLen >= limitResultCount) break;\n                    }\n                }while (m)\n                return resultLen;\n            }\n        }\n        class SearchParams {\n            searchString;\n            isRegex;\n            matchCase;\n            wordSeparators;\n            constructor(searchString, isRegex, matchCase, wordSeparators){\n                this.searchString = searchString;\n                this.isRegex = isRegex;\n                this.matchCase = matchCase;\n                this.wordSeparators = wordSeparators;\n            }\n            parseSearchRequest() {\n                if ('' === this.searchString) return null;\n                let multiline;\n                multiline = this.isRegex ? isMultilineRegexSource(this.searchString) : this.searchString.indexOf('\\n') >= 0;\n                let regex = null;\n                try {\n                    regex = (0, _common_strings__rspack_import_3.OS)(this.searchString, this.isRegex, {\n                        matchCase: this.matchCase,\n                        wholeWord: false,\n                        multiline: multiline,\n                        global: true,\n                        unicode: true\n                    });\n                } catch (err) {\n                    return null;\n                }\n                if (!regex) return null;\n                let canUseSimpleSearch = !this.isRegex && !multiline;\n                if (canUseSimpleSearch && this.searchString.toLowerCase() !== this.searchString.toUpperCase()) canUseSimpleSearch = this.matchCase;\n                return new _common_model__rspack_import_1.L5(regex, this.wordSeparators ? (0, _common_wordCharacterClassifier__rspack_import_4.iJ)(this.wordSeparators, []) : null, canUseSimpleSearch ? this.searchString : null);\n            }\n        }\n        function isMultilineRegexSource(searchString) {\n            if (!searchString || 0 === searchString.length) return false;\n            for(let i = 0, len = searchString.length; i < len; i++){\n                const chCode = searchString.charCodeAt(i);\n                if (10 === chCode) return true;\n                if (92 === chCode) {\n                    i++;\n                    if (i >= len) break;\n                    const nextChCode = searchString.charCodeAt(i);\n                    if (110 === nextChCode || 114 === nextChCode || 87 === nextChCode) return true;\n                }\n            }\n            return false;\n        }\n        function leftIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength) {\n            if (0 === matchStartIndex) return true;\n            const charBefore = text.charCodeAt(matchStartIndex - 1);\n            if (0 !== wordSeparators.get(charBefore)) return true;\n            if (13 === charBefore || 10 === charBefore) return true;\n            if (matchLength > 0) {\n                const firstCharInMatch = text.charCodeAt(matchStartIndex);\n                if (0 !== wordSeparators.get(firstCharInMatch)) return true;\n            }\n            return false;\n        }\n        function rightIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength) {\n            if (matchStartIndex + matchLength === textLength) return true;\n            const charAfter = text.charCodeAt(matchStartIndex + matchLength);\n            if (0 !== wordSeparators.get(charAfter)) return true;\n            if (13 === charAfter || 10 === charAfter) return true;\n            if (matchLength > 0) {\n                const lastCharInMatch = text.charCodeAt(matchStartIndex + matchLength - 1);\n                if (0 !== wordSeparators.get(lastCharInMatch)) return true;\n            }\n            return false;\n        }\n        function isValidMatch(wordSeparators, text, textLength, matchStartIndex, matchLength) {\n            return leftIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength) && rightIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength);\n        }\n        class Searcher {\n            _wordSeparators;\n            _searchRegex;\n            _prevMatchStartIndex;\n            _prevMatchLength;\n            constructor(wordSeparators, searchRegex){\n                this._wordSeparators = wordSeparators;\n                this._searchRegex = searchRegex;\n                this._prevMatchStartIndex = -1;\n                this._prevMatchLength = 0;\n            }\n            reset(lastIndex) {\n                this._searchRegex.lastIndex = lastIndex;\n                this._prevMatchStartIndex = -1;\n                this._prevMatchLength = 0;\n            }\n            next(text) {\n                const textLength = text.length;\n                let m;\n                do {\n                    if (this._prevMatchStartIndex + this._prevMatchLength === textLength) break;\n                    m = this._searchRegex.exec(text);\n                    if (!m) break;\n                    const matchStartIndex = m.index;\n                    const matchLength = m[0].length;\n                    if (matchStartIndex === this._prevMatchStartIndex && matchLength === this._prevMatchLength) {\n                        if (0 === matchLength) {\n                            if ((0, _common_strings__rspack_import_3.Z5)(text, textLength, this._searchRegex.lastIndex) > 0xffff) this._searchRegex.lastIndex += 2;\n                            else this._searchRegex.lastIndex += 1;\n                            continue;\n                        }\n                        break;\n                    }\n                    this._prevMatchStartIndex = matchStartIndex;\n                    this._prevMatchLength = matchLength;\n                    if (!this._wordSeparators || isValidMatch(this._wordSeparators, text, textLength, matchStartIndex, matchLength)) return m;\n                }while (m)\n                return null;\n            }\n        }\n        function createFindMatch(range, rawMatches, captureMatches) {\n            if (!captureMatches) return new _common_model__rspack_import_1.Dg(range, null);\n            const matches = [];\n            for(let i = 0, len = rawMatches.length; i < len; i++)matches[i] = rawMatches[i];\n            return new _common_model__rspack_import_1.Dg(range, matches);\n        }\n    },\n    120 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            of: ()=>_pieceTreeTextBufferBuilder__rspack_import_0.of,\n            xj: ()=>_pieceTreeTextBufferBuilder__rspack_import_0.xj\n        });\n        var _pieceTreeTextBufferBuilder__rspack_import_0 = __webpack_require__(260);\n    },\n    891 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            CV: ()=>StringBuffer,\n            Ep: ()=>createLineStartsFast,\n            Ux: ()=>PieceTreeBase,\n            g4: ()=>createLineStarts\n        });\n        var _common_position__rspack_import_2 = __webpack_require__(833);\n        var _common_range__rspack_import_4 = __webpack_require__(49);\n        var _common_model__rspack_import_5 = __webpack_require__(753);\n        var _rbTreeBase__rspack_import_1 = __webpack_require__(267);\n        var _model_textModelSearch__rspack_import_3 = __webpack_require__(94);\n        const AverageBufferSize = 65535;\n        function createUintArray(arr) {\n            let r;\n            r = arr[arr.length - 1] < 65536 ? new Uint16Array(arr.length) : new Uint32Array(arr.length);\n            r.set(arr, 0);\n            return r;\n        }\n        class LineStarts {\n            lineStarts;\n            cr;\n            lf;\n            crlf;\n            isBasicASCII;\n            constructor(lineStarts, cr, lf, crlf, isBasicASCII){\n                this.lineStarts = lineStarts;\n                this.cr = cr;\n                this.lf = lf;\n                this.crlf = crlf;\n                this.isBasicASCII = isBasicASCII;\n            }\n        }\n        function createLineStartsFast(str, readonly = true) {\n            const r = [\n                0\n            ];\n            let rLength = 1;\n            for(let i = 0, len = str.length; i < len; i++){\n                const chr = str.charCodeAt(i);\n                if (13 === chr) if (i + 1 < len && 10 === str.charCodeAt(i + 1)) {\n                    r[rLength++] = i + 2;\n                    i++;\n                } else r[rLength++] = i + 1;\n                else if (10 === chr) r[rLength++] = i + 1;\n            }\n            if (readonly) return createUintArray(r);\n            return r;\n        }\n        function createLineStarts(r, str) {\n            r.length = 0;\n            r[0] = 0;\n            let rLength = 1;\n            let cr = 0, lf = 0, crlf = 0;\n            let isBasicASCII = true;\n            for(let i = 0, len = str.length; i < len; i++){\n                const chr = str.charCodeAt(i);\n                if (13 === chr) if (i + 1 < len && 10 === str.charCodeAt(i + 1)) {\n                    crlf++;\n                    r[rLength++] = i + 2;\n                    i++;\n                } else {\n                    cr++;\n                    r[rLength++] = i + 1;\n                }\n                else if (10 === chr) {\n                    lf++;\n                    r[rLength++] = i + 1;\n                } else if (isBasicASCII) {\n                    if (9 !== chr && (chr < 32 || chr > 126)) isBasicASCII = false;\n                }\n            }\n            const result = new LineStarts(createUintArray(r), cr, lf, crlf, isBasicASCII);\n            r.length = 0;\n            return result;\n        }\n        class Piece {\n            bufferIndex;\n            start;\n            end;\n            length;\n            lineFeedCnt;\n            constructor(bufferIndex, start, end, lineFeedCnt, length){\n                this.bufferIndex = bufferIndex;\n                this.start = start;\n                this.end = end;\n                this.lineFeedCnt = lineFeedCnt;\n                this.length = length;\n            }\n        }\n        class StringBuffer {\n            buffer;\n            lineStarts;\n            constructor(buffer, lineStarts){\n                this.buffer = buffer;\n                this.lineStarts = lineStarts;\n            }\n        }\n        class PieceTreeSnapshot {\n            _pieces;\n            _index;\n            _tree;\n            _BOM;\n            constructor(tree, BOM){\n                this._pieces = [];\n                this._tree = tree;\n                this._BOM = BOM;\n                this._index = 0;\n                if (tree.root !== _rbTreeBase__rspack_import_1.fd) tree.iterate(tree.root, (node)=>{\n                    if (node !== _rbTreeBase__rspack_import_1.fd) this._pieces.push(node.piece);\n                    return true;\n                });\n            }\n            read() {\n                if (0 === this._pieces.length) if (0 !== this._index) return null;\n                else {\n                    this._index++;\n                    return this._BOM;\n                }\n                if (this._index > this._pieces.length - 1) return null;\n                if (0 === this._index) return this._BOM + this._tree.getPieceContent(this._pieces[this._index++]);\n                return this._tree.getPieceContent(this._pieces[this._index++]);\n            }\n        }\n        class PieceTreeSearchCache {\n            _limit;\n            _cache;\n            constructor(limit){\n                this._limit = limit;\n                this._cache = [];\n            }\n            get(offset) {\n                for(let i = this._cache.length - 1; i >= 0; i--){\n                    const nodePos = this._cache[i];\n                    if (nodePos.nodeStartOffset <= offset && nodePos.nodeStartOffset + nodePos.node.piece.length >= offset) return nodePos;\n                }\n                return null;\n            }\n            get2(lineNumber) {\n                for(let i = this._cache.length - 1; i >= 0; i--){\n                    const nodePos = this._cache[i];\n                    if (nodePos.nodeStartLineNumber && nodePos.nodeStartLineNumber < lineNumber && nodePos.nodeStartLineNumber + nodePos.node.piece.lineFeedCnt >= lineNumber) return nodePos;\n                }\n                return null;\n            }\n            set(nodePosition) {\n                if (this._cache.length >= this._limit) this._cache.shift();\n                this._cache.push(nodePosition);\n            }\n            validate(offset) {\n                let hasInvalidVal = false;\n                const tmp = this._cache;\n                for(let i = 0; i < tmp.length; i++){\n                    const nodePos = tmp[i];\n                    if (null === nodePos.node.parent || nodePos.nodeStartOffset >= offset) {\n                        tmp[i] = null;\n                        hasInvalidVal = true;\n                        continue;\n                    }\n                }\n                if (hasInvalidVal) {\n                    const newArr = [];\n                    for (const entry of tmp)if (null !== entry) newArr.push(entry);\n                    this._cache = newArr;\n                }\n            }\n        }\n        class PieceTreeBase {\n            root;\n            _buffers;\n            _lineCnt;\n            _length;\n            _EOL;\n            _EOLLength;\n            _EOLNormalized;\n            _lastChangeBufferPos;\n            _searchCache;\n            _lastVisitedLine;\n            constructor(chunks, eol, eolNormalized){\n                this.create(chunks, eol, eolNormalized);\n            }\n            create(chunks, eol, eolNormalized) {\n                this._buffers = [\n                    new StringBuffer('', [\n                        0\n                    ])\n                ];\n                this._lastChangeBufferPos = {\n                    line: 0,\n                    column: 0\n                };\n                this.root = _rbTreeBase__rspack_import_1.fd;\n                this._lineCnt = 1;\n                this._length = 0;\n                this._EOL = eol;\n                this._EOLLength = eol.length;\n                this._EOLNormalized = eolNormalized;\n                let lastNode = null;\n                for(let i = 0, len = chunks.length; i < len; i++)if (chunks[i].buffer.length > 0) {\n                    if (!chunks[i].lineStarts) chunks[i].lineStarts = createLineStartsFast(chunks[i].buffer);\n                    const piece = new Piece(i + 1, {\n                        line: 0,\n                        column: 0\n                    }, {\n                        line: chunks[i].lineStarts.length - 1,\n                        column: chunks[i].buffer.length - chunks[i].lineStarts[chunks[i].lineStarts.length - 1]\n                    }, chunks[i].lineStarts.length - 1, chunks[i].buffer.length);\n                    this._buffers.push(chunks[i]);\n                    lastNode = this.rbInsertRight(lastNode, piece);\n                }\n                this._searchCache = new PieceTreeSearchCache(1);\n                this._lastVisitedLine = {\n                    lineNumber: 0,\n                    value: ''\n                };\n                this.computeBufferMetadata();\n            }\n            normalizeEOL(eol) {\n                const averageBufferSize = AverageBufferSize;\n                const min = averageBufferSize - Math.floor(averageBufferSize / 3);\n                const max = 2 * min;\n                let tempChunk = '';\n                let tempChunkLen = 0;\n                const chunks = [];\n                this.iterate(this.root, (node)=>{\n                    const str = this.getNodeContent(node);\n                    const len = str.length;\n                    if (tempChunkLen <= min || tempChunkLen + len < max) {\n                        tempChunk += str;\n                        tempChunkLen += len;\n                        return true;\n                    }\n                    const text = tempChunk.replace(/\\r\\n|\\r|\\n/g, eol);\n                    chunks.push(new StringBuffer(text, createLineStartsFast(text)));\n                    tempChunk = str;\n                    tempChunkLen = len;\n                    return true;\n                });\n                if (tempChunkLen > 0) {\n                    const text = tempChunk.replace(/\\r\\n|\\r|\\n/g, eol);\n                    chunks.push(new StringBuffer(text, createLineStartsFast(text)));\n                }\n                this.create(chunks, eol, true);\n            }\n            getEOL() {\n                return this._EOL;\n            }\n            setEOL(newEOL) {\n                this._EOL = newEOL;\n                this._EOLLength = this._EOL.length;\n                this.normalizeEOL(newEOL);\n            }\n            createSnapshot(BOM) {\n                return new PieceTreeSnapshot(this, BOM);\n            }\n            equal(other) {\n                if (this.getLength() !== other.getLength()) return false;\n                if (this.getLineCount() !== other.getLineCount()) return false;\n                let offset = 0;\n                const ret = this.iterate(this.root, (node)=>{\n                    if (node === _rbTreeBase__rspack_import_1.fd) return true;\n                    const str = this.getNodeContent(node);\n                    const len = str.length;\n                    const startPosition = other.nodeAt(offset);\n                    const endPosition = other.nodeAt(offset + len);\n                    const val = other.getValueInRange2(startPosition, endPosition);\n                    offset += len;\n                    return str === val;\n                });\n                return ret;\n            }\n            getOffsetAt(lineNumber, column) {\n                let leftLen = 0;\n                let x = this.root;\n                while(x !== _rbTreeBase__rspack_import_1.fd)if (x.left !== _rbTreeBase__rspack_import_1.fd && x.lf_left + 1 >= lineNumber) x = x.left;\n                else if (x.lf_left + x.piece.lineFeedCnt + 1 >= lineNumber) {\n                    leftLen += x.size_left;\n                    const accumualtedValInCurrentIndex = this.getAccumulatedValue(x, lineNumber - x.lf_left - 2);\n                    return leftLen + (accumualtedValInCurrentIndex + column - 1);\n                } else {\n                    lineNumber -= x.lf_left + x.piece.lineFeedCnt;\n                    leftLen += x.size_left + x.piece.length;\n                    x = x.right;\n                }\n                return leftLen;\n            }\n            getPositionAt(offset) {\n                offset = Math.floor(offset);\n                offset = Math.max(0, offset);\n                let x = this.root;\n                let lfCnt = 0;\n                const originalOffset = offset;\n                while(x !== _rbTreeBase__rspack_import_1.fd)if (0 !== x.size_left && x.size_left >= offset) x = x.left;\n                else if (x.size_left + x.piece.length >= offset) {\n                    const out = this.getIndexOf(x, offset - x.size_left);\n                    lfCnt += x.lf_left + out.index;\n                    if (0 === out.index) {\n                        const lineStartOffset = this.getOffsetAt(lfCnt + 1, 1);\n                        const column = originalOffset - lineStartOffset;\n                        return new _common_position__rspack_import_2.y(lfCnt + 1, column + 1);\n                    }\n                    return new _common_position__rspack_import_2.y(lfCnt + 1, out.remainder + 1);\n                } else {\n                    offset -= x.size_left + x.piece.length;\n                    lfCnt += x.lf_left + x.piece.lineFeedCnt;\n                    if (x.right === _rbTreeBase__rspack_import_1.fd) {\n                        const lineStartOffset = this.getOffsetAt(lfCnt + 1, 1);\n                        const column = originalOffset - offset - lineStartOffset;\n                        return new _common_position__rspack_import_2.y(lfCnt + 1, column + 1);\n                    }\n                    x = x.right;\n                }\n                return new _common_position__rspack_import_2.y(1, 1);\n            }\n            getValueInRange(range, eol) {\n                if (range.startLineNumber === range.endLineNumber && range.startColumn === range.endColumn) return '';\n                const startPosition = this.nodeAt2(range.startLineNumber, range.startColumn);\n                const endPosition = this.nodeAt2(range.endLineNumber, range.endColumn);\n                const value = this.getValueInRange2(startPosition, endPosition);\n                if (eol) {\n                    if (eol !== this._EOL || !this._EOLNormalized) return value.replace(/\\r\\n|\\r|\\n/g, eol);\n                    if (eol === this.getEOL() && this._EOLNormalized) return value;\n                    return value.replace(/\\r\\n|\\r|\\n/g, eol);\n                }\n                return value;\n            }\n            getValueInRange2(startPosition, endPosition) {\n                if (startPosition.node === endPosition.node) {\n                    const node = startPosition.node;\n                    const buffer = this._buffers[node.piece.bufferIndex].buffer;\n                    const startOffset = this.offsetInBuffer(node.piece.bufferIndex, node.piece.start);\n                    return buffer.substring(startOffset + startPosition.remainder, startOffset + endPosition.remainder);\n                }\n                let x = startPosition.node;\n                const buffer = this._buffers[x.piece.bufferIndex].buffer;\n                const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                let ret = buffer.substring(startOffset + startPosition.remainder, startOffset + x.piece.length);\n                x = x.next();\n                while(x !== _rbTreeBase__rspack_import_1.fd){\n                    const buffer = this._buffers[x.piece.bufferIndex].buffer;\n                    const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                    if (x === endPosition.node) {\n                        ret += buffer.substring(startOffset, startOffset + endPosition.remainder);\n                        break;\n                    }\n                    ret += buffer.substr(startOffset, x.piece.length);\n                    x = x.next();\n                }\n                return ret;\n            }\n            getLinesContent() {\n                const lines = [];\n                let linesLength = 0;\n                let currentLine = '';\n                let danglingCR = false;\n                this.iterate(this.root, (node)=>{\n                    if (node === _rbTreeBase__rspack_import_1.fd) return true;\n                    const piece = node.piece;\n                    let pieceLength = piece.length;\n                    if (0 === pieceLength) return true;\n                    const buffer = this._buffers[piece.bufferIndex].buffer;\n                    const lineStarts = this._buffers[piece.bufferIndex].lineStarts;\n                    const pieceStartLine = piece.start.line;\n                    const pieceEndLine = piece.end.line;\n                    let pieceStartOffset = lineStarts[pieceStartLine] + piece.start.column;\n                    if (danglingCR) {\n                        if (10 === buffer.charCodeAt(pieceStartOffset)) {\n                            pieceStartOffset++;\n                            pieceLength--;\n                        }\n                        lines[linesLength++] = currentLine;\n                        currentLine = '';\n                        danglingCR = false;\n                        if (0 === pieceLength) return true;\n                    }\n                    if (pieceStartLine === pieceEndLine) {\n                        if (this._EOLNormalized || 13 !== buffer.charCodeAt(pieceStartOffset + pieceLength - 1)) currentLine += buffer.substr(pieceStartOffset, pieceLength);\n                        else {\n                            danglingCR = true;\n                            currentLine += buffer.substr(pieceStartOffset, pieceLength - 1);\n                        }\n                        return true;\n                    }\n                    currentLine += this._EOLNormalized ? buffer.substring(pieceStartOffset, Math.max(pieceStartOffset, lineStarts[pieceStartLine + 1] - this._EOLLength)) : buffer.substring(pieceStartOffset, lineStarts[pieceStartLine + 1]).replace(/(\\r\\n|\\r|\\n)$/, '');\n                    lines[linesLength++] = currentLine;\n                    for(let line = pieceStartLine + 1; line < pieceEndLine; line++){\n                        currentLine = this._EOLNormalized ? buffer.substring(lineStarts[line], lineStarts[line + 1] - this._EOLLength) : buffer.substring(lineStarts[line], lineStarts[line + 1]).replace(/(\\r\\n|\\r|\\n)$/, '');\n                        lines[linesLength++] = currentLine;\n                    }\n                    if (this._EOLNormalized || 13 !== buffer.charCodeAt(lineStarts[pieceEndLine] + piece.end.column - 1)) currentLine = buffer.substr(lineStarts[pieceEndLine], piece.end.column);\n                    else {\n                        danglingCR = true;\n                        if (0 === piece.end.column) linesLength--;\n                        else currentLine = buffer.substr(lineStarts[pieceEndLine], piece.end.column - 1);\n                    }\n                    return true;\n                });\n                if (danglingCR) {\n                    lines[linesLength++] = currentLine;\n                    currentLine = '';\n                }\n                lines[linesLength++] = currentLine;\n                return lines;\n            }\n            getLength() {\n                return this._length;\n            }\n            getLineCount() {\n                return this._lineCnt;\n            }\n            getLineContent(lineNumber) {\n                if (this._lastVisitedLine.lineNumber === lineNumber) return this._lastVisitedLine.value;\n                this._lastVisitedLine.lineNumber = lineNumber;\n                if (lineNumber === this._lineCnt) this._lastVisitedLine.value = this.getLineRawContent(lineNumber);\n                else if (this._EOLNormalized) this._lastVisitedLine.value = this.getLineRawContent(lineNumber, this._EOLLength);\n                else this._lastVisitedLine.value = this.getLineRawContent(lineNumber).replace(/(\\r\\n|\\r|\\n)$/, '');\n                return this._lastVisitedLine.value;\n            }\n            _getCharCode(nodePos) {\n                if (nodePos.remainder === nodePos.node.piece.length) {\n                    const matchingNode = nodePos.node.next();\n                    if (!matchingNode) return 0;\n                    const buffer = this._buffers[matchingNode.piece.bufferIndex];\n                    const startOffset = this.offsetInBuffer(matchingNode.piece.bufferIndex, matchingNode.piece.start);\n                    return buffer.buffer.charCodeAt(startOffset);\n                }\n                {\n                    const buffer = this._buffers[nodePos.node.piece.bufferIndex];\n                    const startOffset = this.offsetInBuffer(nodePos.node.piece.bufferIndex, nodePos.node.piece.start);\n                    const targetOffset = startOffset + nodePos.remainder;\n                    return buffer.buffer.charCodeAt(targetOffset);\n                }\n            }\n            getLineCharCode(lineNumber, index) {\n                const nodePos = this.nodeAt2(lineNumber, index + 1);\n                return this._getCharCode(nodePos);\n            }\n            getLineLength(lineNumber) {\n                if (lineNumber === this.getLineCount()) {\n                    const startOffset = this.getOffsetAt(lineNumber, 1);\n                    return this.getLength() - startOffset;\n                }\n                return this.getOffsetAt(lineNumber + 1, 1) - this.getOffsetAt(lineNumber, 1) - this._EOLLength;\n            }\n            getCharCode(offset) {\n                const nodePos = this.nodeAt(offset);\n                return this._getCharCode(nodePos);\n            }\n            getNearestChunk(offset) {\n                const nodePos = this.nodeAt(offset);\n                if (nodePos.remainder === nodePos.node.piece.length) {\n                    const matchingNode = nodePos.node.next();\n                    if (!matchingNode || matchingNode === _rbTreeBase__rspack_import_1.fd) return '';\n                    const buffer = this._buffers[matchingNode.piece.bufferIndex];\n                    const startOffset = this.offsetInBuffer(matchingNode.piece.bufferIndex, matchingNode.piece.start);\n                    return buffer.buffer.substring(startOffset, startOffset + matchingNode.piece.length);\n                }\n                {\n                    const buffer = this._buffers[nodePos.node.piece.bufferIndex];\n                    const startOffset = this.offsetInBuffer(nodePos.node.piece.bufferIndex, nodePos.node.piece.start);\n                    const targetOffset = startOffset + nodePos.remainder;\n                    const targetEnd = startOffset + nodePos.node.piece.length;\n                    return buffer.buffer.substring(targetOffset, targetEnd);\n                }\n            }\n            findMatchesInNode(node, searcher, startLineNumber, startColumn, startCursor, endCursor, searchData, captureMatches, limitResultCount, resultLen, result) {\n                const buffer = this._buffers[node.piece.bufferIndex];\n                const startOffsetInBuffer = this.offsetInBuffer(node.piece.bufferIndex, node.piece.start);\n                const start = this.offsetInBuffer(node.piece.bufferIndex, startCursor);\n                const end = this.offsetInBuffer(node.piece.bufferIndex, endCursor);\n                let m;\n                const ret = {\n                    line: 0,\n                    column: 0\n                };\n                let searchText;\n                let offsetInBuffer;\n                if (searcher._wordSeparators) {\n                    searchText = buffer.buffer.substring(start, end);\n                    offsetInBuffer = (offset)=>offset + start;\n                    searcher.reset(0);\n                } else {\n                    searchText = buffer.buffer;\n                    offsetInBuffer = (offset)=>offset;\n                    searcher.reset(start);\n                }\n                do {\n                    m = searcher.next(searchText);\n                    if (m) {\n                        if (offsetInBuffer(m.index) >= end) return resultLen;\n                        this.positionInBuffer(node, offsetInBuffer(m.index) - startOffsetInBuffer, ret);\n                        const lineFeedCnt = this.getLineFeedCnt(node.piece.bufferIndex, startCursor, ret);\n                        const retStartColumn = ret.line === startCursor.line ? ret.column - startCursor.column + startColumn : ret.column + 1;\n                        const retEndColumn = retStartColumn + m[0].length;\n                        result[resultLen++] = (0, _model_textModelSearch__rspack_import_3.dr)(new _common_range__rspack_import_4.Q(startLineNumber + lineFeedCnt, retStartColumn, startLineNumber + lineFeedCnt, retEndColumn), m, captureMatches);\n                        if (offsetInBuffer(m.index) + m[0].length >= end) return resultLen;\n                        if (resultLen >= limitResultCount) break;\n                    }\n                }while (m)\n                return resultLen;\n            }\n            findMatchesLineByLine(searchRange, searchData, captureMatches, limitResultCount) {\n                const result = [];\n                let resultLen = 0;\n                const searcher = new _model_textModelSearch__rspack_import_3.W5(searchData.wordSeparators, searchData.regex);\n                let startPosition = this.nodeAt2(searchRange.startLineNumber, searchRange.startColumn);\n                if (null === startPosition) return [];\n                const endPosition = this.nodeAt2(searchRange.endLineNumber, searchRange.endColumn);\n                if (null === endPosition) return [];\n                let start = this.positionInBuffer(startPosition.node, startPosition.remainder);\n                const end = this.positionInBuffer(endPosition.node, endPosition.remainder);\n                if (startPosition.node === endPosition.node) {\n                    this.findMatchesInNode(startPosition.node, searcher, searchRange.startLineNumber, searchRange.startColumn, start, end, searchData, captureMatches, limitResultCount, resultLen, result);\n                    return result;\n                }\n                let startLineNumber = searchRange.startLineNumber;\n                let currentNode = startPosition.node;\n                while(currentNode !== endPosition.node){\n                    const lineBreakCnt = this.getLineFeedCnt(currentNode.piece.bufferIndex, start, currentNode.piece.end);\n                    if (lineBreakCnt >= 1) {\n                        const lineStarts = this._buffers[currentNode.piece.bufferIndex].lineStarts;\n                        const startOffsetInBuffer = this.offsetInBuffer(currentNode.piece.bufferIndex, currentNode.piece.start);\n                        const nextLineStartOffset = lineStarts[start.line + lineBreakCnt];\n                        const startColumn = startLineNumber === searchRange.startLineNumber ? searchRange.startColumn : 1;\n                        resultLen = this.findMatchesInNode(currentNode, searcher, startLineNumber, startColumn, start, this.positionInBuffer(currentNode, nextLineStartOffset - startOffsetInBuffer), searchData, captureMatches, limitResultCount, resultLen, result);\n                        if (resultLen >= limitResultCount) return result;\n                        startLineNumber += lineBreakCnt;\n                    }\n                    const startColumn = startLineNumber === searchRange.startLineNumber ? searchRange.startColumn - 1 : 0;\n                    if (startLineNumber === searchRange.endLineNumber) {\n                        const text = this.getLineContent(startLineNumber).substring(startColumn, searchRange.endColumn - 1);\n                        resultLen = this._findMatchesInLine(searchData, searcher, text, searchRange.endLineNumber, startColumn, resultLen, result, captureMatches, limitResultCount);\n                        return result;\n                    }\n                    resultLen = this._findMatchesInLine(searchData, searcher, this.getLineContent(startLineNumber).substr(startColumn), startLineNumber, startColumn, resultLen, result, captureMatches, limitResultCount);\n                    if (resultLen >= limitResultCount) return result;\n                    startLineNumber++;\n                    startPosition = this.nodeAt2(startLineNumber, 1);\n                    currentNode = startPosition.node;\n                    start = this.positionInBuffer(startPosition.node, startPosition.remainder);\n                }\n                if (startLineNumber === searchRange.endLineNumber) {\n                    const startColumn = startLineNumber === searchRange.startLineNumber ? searchRange.startColumn - 1 : 0;\n                    const text = this.getLineContent(startLineNumber).substring(startColumn, searchRange.endColumn - 1);\n                    resultLen = this._findMatchesInLine(searchData, searcher, text, searchRange.endLineNumber, startColumn, resultLen, result, captureMatches, limitResultCount);\n                    return result;\n                }\n                const startColumn = startLineNumber === searchRange.startLineNumber ? searchRange.startColumn : 1;\n                resultLen = this.findMatchesInNode(endPosition.node, searcher, startLineNumber, startColumn, start, end, searchData, captureMatches, limitResultCount, resultLen, result);\n                return result;\n            }\n            _findMatchesInLine(searchData, searcher, text, lineNumber, deltaOffset, resultLen, result, captureMatches, limitResultCount) {\n                const wordSeparators = searchData.wordSeparators;\n                if (!captureMatches && searchData.simpleSearch) {\n                    const searchString = searchData.simpleSearch;\n                    const searchStringLen = searchString.length;\n                    const textLength = text.length;\n                    let lastMatchIndex = -searchStringLen;\n                    while(-1 !== (lastMatchIndex = text.indexOf(searchString, lastMatchIndex + searchStringLen)))if (!wordSeparators || (0, _model_textModelSearch__rspack_import_3.wC)(wordSeparators, text, textLength, lastMatchIndex, searchStringLen)) {\n                        result[resultLen++] = new _common_model__rspack_import_5.Dg(new _common_range__rspack_import_4.Q(lineNumber, lastMatchIndex + 1 + deltaOffset, lineNumber, lastMatchIndex + 1 + searchStringLen + deltaOffset), null);\n                        if (resultLen >= limitResultCount) break;\n                    }\n                    return resultLen;\n                }\n                let m;\n                searcher.reset(0);\n                do {\n                    m = searcher.next(text);\n                    if (m) {\n                        result[resultLen++] = (0, _model_textModelSearch__rspack_import_3.dr)(new _common_range__rspack_import_4.Q(lineNumber, m.index + 1 + deltaOffset, lineNumber, m.index + 1 + m[0].length + deltaOffset), m, captureMatches);\n                        if (resultLen >= limitResultCount) break;\n                    }\n                }while (m)\n                return resultLen;\n            }\n            insert(offset, value, eolNormalized = false) {\n                this._EOLNormalized = this._EOLNormalized && eolNormalized;\n                this._lastVisitedLine.lineNumber = 0;\n                this._lastVisitedLine.value = '';\n                if (this.root !== _rbTreeBase__rspack_import_1.fd) {\n                    const { node, remainder, nodeStartOffset } = this.nodeAt(offset);\n                    const piece = node.piece;\n                    const bufferIndex = piece.bufferIndex;\n                    const insertPosInBuffer = this.positionInBuffer(node, remainder);\n                    if (0 === node.piece.bufferIndex && piece.end.line === this._lastChangeBufferPos.line && piece.end.column === this._lastChangeBufferPos.column && nodeStartOffset + piece.length === offset && value.length < AverageBufferSize) {\n                        this.appendToNode(node, value);\n                        this.computeBufferMetadata();\n                        return;\n                    }\n                    if (nodeStartOffset === offset) {\n                        this.insertContentToNodeLeft(value, node);\n                        this._searchCache.validate(offset);\n                    } else if (nodeStartOffset + node.piece.length > offset) {\n                        const nodesToDel = [];\n                        let newRightPiece = new Piece(piece.bufferIndex, insertPosInBuffer, piece.end, this.getLineFeedCnt(piece.bufferIndex, insertPosInBuffer, piece.end), this.offsetInBuffer(bufferIndex, piece.end) - this.offsetInBuffer(bufferIndex, insertPosInBuffer));\n                        if (this.shouldCheckCRLF() && this.endWithCR(value)) {\n                            const headOfRight = this.nodeCharCodeAt(node, remainder);\n                            if (10 === headOfRight) {\n                                const newStart = {\n                                    line: newRightPiece.start.line + 1,\n                                    column: 0\n                                };\n                                newRightPiece = new Piece(newRightPiece.bufferIndex, newStart, newRightPiece.end, this.getLineFeedCnt(newRightPiece.bufferIndex, newStart, newRightPiece.end), newRightPiece.length - 1);\n                                value += '\\n';\n                            }\n                        }\n                        if (this.shouldCheckCRLF() && this.startWithLF(value)) {\n                            const tailOfLeft = this.nodeCharCodeAt(node, remainder - 1);\n                            if (13 === tailOfLeft) {\n                                const previousPos = this.positionInBuffer(node, remainder - 1);\n                                this.deleteNodeTail(node, previousPos);\n                                value = '\\r' + value;\n                                if (0 === node.piece.length) nodesToDel.push(node);\n                            } else this.deleteNodeTail(node, insertPosInBuffer);\n                        } else this.deleteNodeTail(node, insertPosInBuffer);\n                        const newPieces = this.createNewPieces(value);\n                        if (newRightPiece.length > 0) this.rbInsertRight(node, newRightPiece);\n                        let tmpNode = node;\n                        for(let k = 0; k < newPieces.length; k++)tmpNode = this.rbInsertRight(tmpNode, newPieces[k]);\n                        this.deleteNodes(nodesToDel);\n                    } else this.insertContentToNodeRight(value, node);\n                } else {\n                    const pieces = this.createNewPieces(value);\n                    let node = this.rbInsertLeft(null, pieces[0]);\n                    for(let k = 1; k < pieces.length; k++)node = this.rbInsertRight(node, pieces[k]);\n                }\n                this.computeBufferMetadata();\n            }\n            delete(offset, cnt) {\n                this._lastVisitedLine.lineNumber = 0;\n                this._lastVisitedLine.value = '';\n                if (cnt <= 0 || this.root === _rbTreeBase__rspack_import_1.fd) return;\n                const startPosition = this.nodeAt(offset);\n                const endPosition = this.nodeAt(offset + cnt);\n                const startNode = startPosition.node;\n                const endNode = endPosition.node;\n                if (startNode === endNode) {\n                    const startSplitPosInBuffer = this.positionInBuffer(startNode, startPosition.remainder);\n                    const endSplitPosInBuffer = this.positionInBuffer(startNode, endPosition.remainder);\n                    if (startPosition.nodeStartOffset === offset) {\n                        if (cnt === startNode.piece.length) {\n                            const next = startNode.next();\n                            (0, _rbTreeBase__rspack_import_1.Ct)(this, startNode);\n                            this.validateCRLFWithPrevNode(next);\n                            this.computeBufferMetadata();\n                            return;\n                        }\n                        this.deleteNodeHead(startNode, endSplitPosInBuffer);\n                        this._searchCache.validate(offset);\n                        this.validateCRLFWithPrevNode(startNode);\n                        this.computeBufferMetadata();\n                        return;\n                    }\n                    if (startPosition.nodeStartOffset + startNode.piece.length === offset + cnt) {\n                        this.deleteNodeTail(startNode, startSplitPosInBuffer);\n                        this.validateCRLFWithNextNode(startNode);\n                        this.computeBufferMetadata();\n                        return;\n                    }\n                    this.shrinkNode(startNode, startSplitPosInBuffer, endSplitPosInBuffer);\n                    this.computeBufferMetadata();\n                    return;\n                }\n                const nodesToDel = [];\n                const startSplitPosInBuffer = this.positionInBuffer(startNode, startPosition.remainder);\n                this.deleteNodeTail(startNode, startSplitPosInBuffer);\n                this._searchCache.validate(offset);\n                if (0 === startNode.piece.length) nodesToDel.push(startNode);\n                const endSplitPosInBuffer = this.positionInBuffer(endNode, endPosition.remainder);\n                this.deleteNodeHead(endNode, endSplitPosInBuffer);\n                if (0 === endNode.piece.length) nodesToDel.push(endNode);\n                const secondNode = startNode.next();\n                for(let node = secondNode; node !== _rbTreeBase__rspack_import_1.fd && node !== endNode; node = node.next())nodesToDel.push(node);\n                const prev = 0 === startNode.piece.length ? startNode.prev() : startNode;\n                this.deleteNodes(nodesToDel);\n                this.validateCRLFWithNextNode(prev);\n                this.computeBufferMetadata();\n            }\n            insertContentToNodeLeft(value, node) {\n                const nodesToDel = [];\n                if (this.shouldCheckCRLF() && this.endWithCR(value) && this.startWithLF(node)) {\n                    const piece = node.piece;\n                    const newStart = {\n                        line: piece.start.line + 1,\n                        column: 0\n                    };\n                    const nPiece = new Piece(piece.bufferIndex, newStart, piece.end, this.getLineFeedCnt(piece.bufferIndex, newStart, piece.end), piece.length - 1);\n                    node.piece = nPiece;\n                    value += '\\n';\n                    (0, _rbTreeBase__rspack_import_1.rd)(this, node, -1, -1);\n                    if (0 === node.piece.length) nodesToDel.push(node);\n                }\n                const newPieces = this.createNewPieces(value);\n                let newNode = this.rbInsertLeft(node, newPieces[newPieces.length - 1]);\n                for(let k = newPieces.length - 2; k >= 0; k--)newNode = this.rbInsertLeft(newNode, newPieces[k]);\n                this.validateCRLFWithPrevNode(newNode);\n                this.deleteNodes(nodesToDel);\n            }\n            insertContentToNodeRight(value, node) {\n                if (this.adjustCarriageReturnFromNext(value, node)) value += '\\n';\n                const newPieces = this.createNewPieces(value);\n                const newNode = this.rbInsertRight(node, newPieces[0]);\n                let tmpNode = newNode;\n                for(let k = 1; k < newPieces.length; k++)tmpNode = this.rbInsertRight(tmpNode, newPieces[k]);\n                this.validateCRLFWithPrevNode(newNode);\n            }\n            positionInBuffer(node, remainder, ret) {\n                const piece = node.piece;\n                const bufferIndex = node.piece.bufferIndex;\n                const lineStarts = this._buffers[bufferIndex].lineStarts;\n                const startOffset = lineStarts[piece.start.line] + piece.start.column;\n                const offset = startOffset + remainder;\n                let low = piece.start.line;\n                let high = piece.end.line;\n                let mid = 0;\n                let midStop = 0;\n                let midStart = 0;\n                while(low <= high){\n                    mid = low + (high - low) / 2 | 0;\n                    midStart = lineStarts[mid];\n                    if (mid === high) break;\n                    midStop = lineStarts[mid + 1];\n                    if (offset < midStart) high = mid - 1;\n                    else if (offset >= midStop) low = mid + 1;\n                    else break;\n                }\n                if (ret) {\n                    ret.line = mid;\n                    ret.column = offset - midStart;\n                    return null;\n                }\n                return {\n                    line: mid,\n                    column: offset - midStart\n                };\n            }\n            getLineFeedCnt(bufferIndex, start, end) {\n                if (0 === end.column) return end.line - start.line;\n                const lineStarts = this._buffers[bufferIndex].lineStarts;\n                if (end.line === lineStarts.length - 1) return end.line - start.line;\n                const nextLineStartOffset = lineStarts[end.line + 1];\n                const endOffset = lineStarts[end.line] + end.column;\n                if (nextLineStartOffset > endOffset + 1) return end.line - start.line;\n                const previousCharOffset = endOffset - 1;\n                const buffer = this._buffers[bufferIndex].buffer;\n                if (13 === buffer.charCodeAt(previousCharOffset)) return end.line - start.line + 1;\n                return end.line - start.line;\n            }\n            offsetInBuffer(bufferIndex, cursor) {\n                const lineStarts = this._buffers[bufferIndex].lineStarts;\n                return lineStarts[cursor.line] + cursor.column;\n            }\n            deleteNodes(nodes) {\n                for(let i = 0; i < nodes.length; i++)(0, _rbTreeBase__rspack_import_1.Ct)(this, nodes[i]);\n            }\n            createNewPieces(text) {\n                if (text.length > AverageBufferSize) {\n                    const newPieces = [];\n                    while(text.length > AverageBufferSize){\n                        const lastChar = text.charCodeAt(AverageBufferSize - 1);\n                        let splitText;\n                        if (13 === lastChar || lastChar >= 0xd800 && lastChar <= 0xdbff) {\n                            splitText = text.substring(0, AverageBufferSize - 1);\n                            text = text.substring(AverageBufferSize - 1);\n                        } else {\n                            splitText = text.substring(0, AverageBufferSize);\n                            text = text.substring(AverageBufferSize);\n                        }\n                        const lineStarts = createLineStartsFast(splitText);\n                        newPieces.push(new Piece(this._buffers.length, {\n                            line: 0,\n                            column: 0\n                        }, {\n                            line: lineStarts.length - 1,\n                            column: splitText.length - lineStarts[lineStarts.length - 1]\n                        }, lineStarts.length - 1, splitText.length));\n                        this._buffers.push(new StringBuffer(splitText, lineStarts));\n                    }\n                    const lineStarts = createLineStartsFast(text);\n                    newPieces.push(new Piece(this._buffers.length, {\n                        line: 0,\n                        column: 0\n                    }, {\n                        line: lineStarts.length - 1,\n                        column: text.length - lineStarts[lineStarts.length - 1]\n                    }, lineStarts.length - 1, text.length));\n                    this._buffers.push(new StringBuffer(text, lineStarts));\n                    return newPieces;\n                }\n                let startOffset = this._buffers[0].buffer.length;\n                const lineStarts = createLineStartsFast(text, false);\n                let start = this._lastChangeBufferPos;\n                if (this._buffers[0].lineStarts[this._buffers[0].lineStarts.length - 1] === startOffset && 0 !== startOffset && this.startWithLF(text) && this.endWithCR(this._buffers[0].buffer)) {\n                    this._lastChangeBufferPos = {\n                        line: this._lastChangeBufferPos.line,\n                        column: this._lastChangeBufferPos.column + 1\n                    };\n                    start = this._lastChangeBufferPos;\n                    for(let i = 0; i < lineStarts.length; i++)lineStarts[i] += startOffset + 1;\n                    this._buffers[0].lineStarts = this._buffers[0].lineStarts.concat(lineStarts.slice(1));\n                    this._buffers[0].buffer += '_' + text;\n                    startOffset += 1;\n                } else {\n                    if (0 !== startOffset) for(let i = 0; i < lineStarts.length; i++)lineStarts[i] += startOffset;\n                    this._buffers[0].lineStarts = this._buffers[0].lineStarts.concat(lineStarts.slice(1));\n                    this._buffers[0].buffer += text;\n                }\n                const endOffset = this._buffers[0].buffer.length;\n                const endIndex = this._buffers[0].lineStarts.length - 1;\n                const endColumn = endOffset - this._buffers[0].lineStarts[endIndex];\n                const endPos = {\n                    line: endIndex,\n                    column: endColumn\n                };\n                const newPiece = new Piece(0, start, endPos, this.getLineFeedCnt(0, start, endPos), endOffset - startOffset);\n                this._lastChangeBufferPos = endPos;\n                return [\n                    newPiece\n                ];\n            }\n            getLinesRawContent() {\n                return this.getContentOfSubTree(this.root);\n            }\n            getLineRawContent(lineNumber, endOffset = 0) {\n                let x = this.root;\n                let ret = '';\n                const cache = this._searchCache.get2(lineNumber);\n                if (cache) {\n                    x = cache.node;\n                    const prevAccumulatedValue = this.getAccumulatedValue(x, lineNumber - cache.nodeStartLineNumber - 1);\n                    const buffer = this._buffers[x.piece.bufferIndex].buffer;\n                    const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                    if (cache.nodeStartLineNumber + x.piece.lineFeedCnt === lineNumber) ret = buffer.substring(startOffset + prevAccumulatedValue, startOffset + x.piece.length);\n                    else {\n                        const accumulatedValue = this.getAccumulatedValue(x, lineNumber - cache.nodeStartLineNumber);\n                        return buffer.substring(startOffset + prevAccumulatedValue, startOffset + accumulatedValue - endOffset);\n                    }\n                } else {\n                    let nodeStartOffset = 0;\n                    const originalLineNumber = lineNumber;\n                    while(x !== _rbTreeBase__rspack_import_1.fd)if (x.left !== _rbTreeBase__rspack_import_1.fd && x.lf_left >= lineNumber - 1) x = x.left;\n                    else if (x.lf_left + x.piece.lineFeedCnt > lineNumber - 1) {\n                        const prevAccumulatedValue = this.getAccumulatedValue(x, lineNumber - x.lf_left - 2);\n                        const accumulatedValue = this.getAccumulatedValue(x, lineNumber - x.lf_left - 1);\n                        const buffer = this._buffers[x.piece.bufferIndex].buffer;\n                        const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                        nodeStartOffset += x.size_left;\n                        this._searchCache.set({\n                            node: x,\n                            nodeStartOffset,\n                            nodeStartLineNumber: originalLineNumber - (lineNumber - 1 - x.lf_left)\n                        });\n                        return buffer.substring(startOffset + prevAccumulatedValue, startOffset + accumulatedValue - endOffset);\n                    } else if (x.lf_left + x.piece.lineFeedCnt === lineNumber - 1) {\n                        const prevAccumulatedValue = this.getAccumulatedValue(x, lineNumber - x.lf_left - 2);\n                        const buffer = this._buffers[x.piece.bufferIndex].buffer;\n                        const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                        ret = buffer.substring(startOffset + prevAccumulatedValue, startOffset + x.piece.length);\n                        break;\n                    } else {\n                        lineNumber -= x.lf_left + x.piece.lineFeedCnt;\n                        nodeStartOffset += x.size_left + x.piece.length;\n                        x = x.right;\n                    }\n                }\n                x = x.next();\n                while(x !== _rbTreeBase__rspack_import_1.fd){\n                    const buffer = this._buffers[x.piece.bufferIndex].buffer;\n                    if (x.piece.lineFeedCnt > 0) {\n                        const accumulatedValue = this.getAccumulatedValue(x, 0);\n                        const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                        ret += buffer.substring(startOffset, startOffset + accumulatedValue - endOffset);\n                        break;\n                    }\n                    {\n                        const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                        ret += buffer.substr(startOffset, x.piece.length);\n                    }\n                    x = x.next();\n                }\n                return ret;\n            }\n            computeBufferMetadata() {\n                let x = this.root;\n                let lfCnt = 1;\n                let len = 0;\n                while(x !== _rbTreeBase__rspack_import_1.fd){\n                    lfCnt += x.lf_left + x.piece.lineFeedCnt;\n                    len += x.size_left + x.piece.length;\n                    x = x.right;\n                }\n                this._lineCnt = lfCnt;\n                this._length = len;\n                this._searchCache.validate(this._length);\n            }\n            getIndexOf(node, accumulatedValue) {\n                const piece = node.piece;\n                const pos = this.positionInBuffer(node, accumulatedValue);\n                const lineCnt = pos.line - piece.start.line;\n                if (this.offsetInBuffer(piece.bufferIndex, piece.end) - this.offsetInBuffer(piece.bufferIndex, piece.start) === accumulatedValue) {\n                    const realLineCnt = this.getLineFeedCnt(node.piece.bufferIndex, piece.start, pos);\n                    if (realLineCnt !== lineCnt) return {\n                        index: realLineCnt,\n                        remainder: 0\n                    };\n                }\n                return {\n                    index: lineCnt,\n                    remainder: pos.column\n                };\n            }\n            getAccumulatedValue(node, index) {\n                if (index < 0) return 0;\n                const piece = node.piece;\n                const lineStarts = this._buffers[piece.bufferIndex].lineStarts;\n                const expectedLineStartIndex = piece.start.line + index + 1;\n                if (expectedLineStartIndex > piece.end.line) return lineStarts[piece.end.line] + piece.end.column - lineStarts[piece.start.line] - piece.start.column;\n                return lineStarts[expectedLineStartIndex] - lineStarts[piece.start.line] - piece.start.column;\n            }\n            deleteNodeTail(node, pos) {\n                const piece = node.piece;\n                const originalLFCnt = piece.lineFeedCnt;\n                const originalEndOffset = this.offsetInBuffer(piece.bufferIndex, piece.end);\n                const newEnd = pos;\n                const newEndOffset = this.offsetInBuffer(piece.bufferIndex, newEnd);\n                const newLineFeedCnt = this.getLineFeedCnt(piece.bufferIndex, piece.start, newEnd);\n                const lf_delta = newLineFeedCnt - originalLFCnt;\n                const size_delta = newEndOffset - originalEndOffset;\n                const newLength = piece.length + size_delta;\n                node.piece = new Piece(piece.bufferIndex, piece.start, newEnd, newLineFeedCnt, newLength);\n                (0, _rbTreeBase__rspack_import_1.rd)(this, node, size_delta, lf_delta);\n            }\n            deleteNodeHead(node, pos) {\n                const piece = node.piece;\n                const originalLFCnt = piece.lineFeedCnt;\n                const originalStartOffset = this.offsetInBuffer(piece.bufferIndex, piece.start);\n                const newStart = pos;\n                const newLineFeedCnt = this.getLineFeedCnt(piece.bufferIndex, newStart, piece.end);\n                const newStartOffset = this.offsetInBuffer(piece.bufferIndex, newStart);\n                const lf_delta = newLineFeedCnt - originalLFCnt;\n                const size_delta = originalStartOffset - newStartOffset;\n                const newLength = piece.length + size_delta;\n                node.piece = new Piece(piece.bufferIndex, newStart, piece.end, newLineFeedCnt, newLength);\n                (0, _rbTreeBase__rspack_import_1.rd)(this, node, size_delta, lf_delta);\n            }\n            shrinkNode(node, start, end) {\n                const piece = node.piece;\n                const originalStartPos = piece.start;\n                const originalEndPos = piece.end;\n                const oldLength = piece.length;\n                const oldLFCnt = piece.lineFeedCnt;\n                const newEnd = start;\n                const newLineFeedCnt = this.getLineFeedCnt(piece.bufferIndex, piece.start, newEnd);\n                const newLength = this.offsetInBuffer(piece.bufferIndex, start) - this.offsetInBuffer(piece.bufferIndex, originalStartPos);\n                node.piece = new Piece(piece.bufferIndex, piece.start, newEnd, newLineFeedCnt, newLength);\n                (0, _rbTreeBase__rspack_import_1.rd)(this, node, newLength - oldLength, newLineFeedCnt - oldLFCnt);\n                const newPiece = new Piece(piece.bufferIndex, end, originalEndPos, this.getLineFeedCnt(piece.bufferIndex, end, originalEndPos), this.offsetInBuffer(piece.bufferIndex, originalEndPos) - this.offsetInBuffer(piece.bufferIndex, end));\n                const newNode = this.rbInsertRight(node, newPiece);\n                this.validateCRLFWithPrevNode(newNode);\n            }\n            appendToNode(node, value) {\n                if (this.adjustCarriageReturnFromNext(value, node)) value += '\\n';\n                const hitCRLF = this.shouldCheckCRLF() && this.startWithLF(value) && this.endWithCR(node);\n                const startOffset = this._buffers[0].buffer.length;\n                this._buffers[0].buffer += value;\n                const lineStarts = createLineStartsFast(value, false);\n                for(let i = 0; i < lineStarts.length; i++)lineStarts[i] += startOffset;\n                if (hitCRLF) {\n                    const prevStartOffset = this._buffers[0].lineStarts[this._buffers[0].lineStarts.length - 2];\n                    this._buffers[0].lineStarts.pop();\n                    this._lastChangeBufferPos = {\n                        line: this._lastChangeBufferPos.line - 1,\n                        column: startOffset - prevStartOffset\n                    };\n                }\n                this._buffers[0].lineStarts = this._buffers[0].lineStarts.concat(lineStarts.slice(1));\n                const endIndex = this._buffers[0].lineStarts.length - 1;\n                const endColumn = this._buffers[0].buffer.length - this._buffers[0].lineStarts[endIndex];\n                const newEnd = {\n                    line: endIndex,\n                    column: endColumn\n                };\n                const newLength = node.piece.length + value.length;\n                const oldLineFeedCnt = node.piece.lineFeedCnt;\n                const newLineFeedCnt = this.getLineFeedCnt(0, node.piece.start, newEnd);\n                const lf_delta = newLineFeedCnt - oldLineFeedCnt;\n                node.piece = new Piece(node.piece.bufferIndex, node.piece.start, newEnd, newLineFeedCnt, newLength);\n                this._lastChangeBufferPos = newEnd;\n                (0, _rbTreeBase__rspack_import_1.rd)(this, node, value.length, lf_delta);\n            }\n            nodeAt(offset) {\n                let x = this.root;\n                const cache = this._searchCache.get(offset);\n                if (cache) return {\n                    node: cache.node,\n                    nodeStartOffset: cache.nodeStartOffset,\n                    remainder: offset - cache.nodeStartOffset\n                };\n                let nodeStartOffset = 0;\n                while(x !== _rbTreeBase__rspack_import_1.fd)if (x.size_left > offset) x = x.left;\n                else if (x.size_left + x.piece.length >= offset) {\n                    nodeStartOffset += x.size_left;\n                    const ret = {\n                        node: x,\n                        remainder: offset - x.size_left,\n                        nodeStartOffset\n                    };\n                    this._searchCache.set(ret);\n                    return ret;\n                } else {\n                    offset -= x.size_left + x.piece.length;\n                    nodeStartOffset += x.size_left + x.piece.length;\n                    x = x.right;\n                }\n                return null;\n            }\n            nodeAt2(lineNumber, column) {\n                let x = this.root;\n                let nodeStartOffset = 0;\n                while(x !== _rbTreeBase__rspack_import_1.fd)if (x.left !== _rbTreeBase__rspack_import_1.fd && x.lf_left >= lineNumber - 1) x = x.left;\n                else if (x.lf_left + x.piece.lineFeedCnt > lineNumber - 1) {\n                    const prevAccumualtedValue = this.getAccumulatedValue(x, lineNumber - x.lf_left - 2);\n                    const accumulatedValue = this.getAccumulatedValue(x, lineNumber - x.lf_left - 1);\n                    nodeStartOffset += x.size_left;\n                    return {\n                        node: x,\n                        remainder: Math.min(prevAccumualtedValue + column - 1, accumulatedValue),\n                        nodeStartOffset\n                    };\n                } else if (x.lf_left + x.piece.lineFeedCnt === lineNumber - 1) {\n                    const prevAccumualtedValue = this.getAccumulatedValue(x, lineNumber - x.lf_left - 2);\n                    if (prevAccumualtedValue + column - 1 <= x.piece.length) return {\n                        node: x,\n                        remainder: prevAccumualtedValue + column - 1,\n                        nodeStartOffset\n                    };\n                    column -= x.piece.length - prevAccumualtedValue;\n                    break;\n                } else {\n                    lineNumber -= x.lf_left + x.piece.lineFeedCnt;\n                    nodeStartOffset += x.size_left + x.piece.length;\n                    x = x.right;\n                }\n                x = x.next();\n                while(x !== _rbTreeBase__rspack_import_1.fd){\n                    if (x.piece.lineFeedCnt > 0) {\n                        const accumulatedValue = this.getAccumulatedValue(x, 0);\n                        const nodeStartOffset = this.offsetOfNode(x);\n                        return {\n                            node: x,\n                            remainder: Math.min(column - 1, accumulatedValue),\n                            nodeStartOffset\n                        };\n                    }\n                    if (x.piece.length >= column - 1) {\n                        const nodeStartOffset = this.offsetOfNode(x);\n                        return {\n                            node: x,\n                            remainder: column - 1,\n                            nodeStartOffset\n                        };\n                    }\n                    column -= x.piece.length;\n                    x = x.next();\n                }\n                return null;\n            }\n            nodeCharCodeAt(node, offset) {\n                if (node.piece.lineFeedCnt < 1) return -1;\n                const buffer = this._buffers[node.piece.bufferIndex];\n                const newOffset = this.offsetInBuffer(node.piece.bufferIndex, node.piece.start) + offset;\n                return buffer.buffer.charCodeAt(newOffset);\n            }\n            offsetOfNode(node) {\n                if (!node) return 0;\n                let pos = node.size_left;\n                while(node !== this.root){\n                    if (node.parent.right === node) pos += node.parent.size_left + node.parent.piece.length;\n                    node = node.parent;\n                }\n                return pos;\n            }\n            shouldCheckCRLF() {\n                return !(this._EOLNormalized && '\\n' === this._EOL);\n            }\n            startWithLF(val) {\n                if ('string' == typeof val) return 10 === val.charCodeAt(0);\n                if (val === _rbTreeBase__rspack_import_1.fd || 0 === val.piece.lineFeedCnt) return false;\n                const piece = val.piece;\n                const lineStarts = this._buffers[piece.bufferIndex].lineStarts;\n                const line = piece.start.line;\n                const startOffset = lineStarts[line] + piece.start.column;\n                if (line === lineStarts.length - 1) return false;\n                const nextLineOffset = lineStarts[line + 1];\n                if (nextLineOffset > startOffset + 1) return false;\n                return 10 === this._buffers[piece.bufferIndex].buffer.charCodeAt(startOffset);\n            }\n            endWithCR(val) {\n                if ('string' == typeof val) return 13 === val.charCodeAt(val.length - 1);\n                if (val === _rbTreeBase__rspack_import_1.fd || 0 === val.piece.lineFeedCnt) return false;\n                return 13 === this.nodeCharCodeAt(val, val.piece.length - 1);\n            }\n            validateCRLFWithPrevNode(nextNode) {\n                if (this.shouldCheckCRLF() && this.startWithLF(nextNode)) {\n                    const node = nextNode.prev();\n                    if (this.endWithCR(node)) this.fixCRLF(node, nextNode);\n                }\n            }\n            validateCRLFWithNextNode(node) {\n                if (this.shouldCheckCRLF() && this.endWithCR(node)) {\n                    const nextNode = node.next();\n                    if (this.startWithLF(nextNode)) this.fixCRLF(node, nextNode);\n                }\n            }\n            fixCRLF(prev, next) {\n                const nodesToDel = [];\n                const lineStarts = this._buffers[prev.piece.bufferIndex].lineStarts;\n                let newEnd;\n                newEnd = 0 === prev.piece.end.column ? {\n                    line: prev.piece.end.line - 1,\n                    column: lineStarts[prev.piece.end.line] - lineStarts[prev.piece.end.line - 1] - 1\n                } : {\n                    line: prev.piece.end.line,\n                    column: prev.piece.end.column - 1\n                };\n                const prevNewLength = prev.piece.length - 1;\n                const prevNewLFCnt = prev.piece.lineFeedCnt - 1;\n                prev.piece = new Piece(prev.piece.bufferIndex, prev.piece.start, newEnd, prevNewLFCnt, prevNewLength);\n                (0, _rbTreeBase__rspack_import_1.rd)(this, prev, -1, -1);\n                if (0 === prev.piece.length) nodesToDel.push(prev);\n                const newStart = {\n                    line: next.piece.start.line + 1,\n                    column: 0\n                };\n                const newLength = next.piece.length - 1;\n                const newLineFeedCnt = this.getLineFeedCnt(next.piece.bufferIndex, newStart, next.piece.end);\n                next.piece = new Piece(next.piece.bufferIndex, newStart, next.piece.end, newLineFeedCnt, newLength);\n                (0, _rbTreeBase__rspack_import_1.rd)(this, next, -1, -1);\n                if (0 === next.piece.length) nodesToDel.push(next);\n                const pieces = this.createNewPieces('\\r\\n');\n                this.rbInsertRight(prev, pieces[0]);\n                for(let i = 0; i < nodesToDel.length; i++)(0, _rbTreeBase__rspack_import_1.Ct)(this, nodesToDel[i]);\n            }\n            adjustCarriageReturnFromNext(value, node) {\n                if (this.shouldCheckCRLF() && this.endWithCR(value)) {\n                    const nextNode = node.next();\n                    if (this.startWithLF(nextNode)) {\n                        value += '\\n';\n                        if (1 === nextNode.piece.length) (0, _rbTreeBase__rspack_import_1.Ct)(this, nextNode);\n                        else {\n                            const piece = nextNode.piece;\n                            const newStart = {\n                                line: piece.start.line + 1,\n                                column: 0\n                            };\n                            const newLength = piece.length - 1;\n                            const newLineFeedCnt = this.getLineFeedCnt(piece.bufferIndex, newStart, piece.end);\n                            nextNode.piece = new Piece(piece.bufferIndex, newStart, piece.end, newLineFeedCnt, newLength);\n                            (0, _rbTreeBase__rspack_import_1.rd)(this, nextNode, -1, -1);\n                        }\n                        return true;\n                    }\n                }\n                return false;\n            }\n            iterate(node, callback) {\n                if (node === _rbTreeBase__rspack_import_1.fd) return callback(_rbTreeBase__rspack_import_1.fd);\n                const leftRet = this.iterate(node.left, callback);\n                if (!leftRet) return leftRet;\n                return callback(node) && this.iterate(node.right, callback);\n            }\n            getNodeContent(node) {\n                if (node === _rbTreeBase__rspack_import_1.fd) return '';\n                const buffer = this._buffers[node.piece.bufferIndex];\n                const piece = node.piece;\n                const startOffset = this.offsetInBuffer(piece.bufferIndex, piece.start);\n                const endOffset = this.offsetInBuffer(piece.bufferIndex, piece.end);\n                const currentContent = buffer.buffer.substring(startOffset, endOffset);\n                return currentContent;\n            }\n            getPieceContent(piece) {\n                const buffer = this._buffers[piece.bufferIndex];\n                const startOffset = this.offsetInBuffer(piece.bufferIndex, piece.start);\n                const endOffset = this.offsetInBuffer(piece.bufferIndex, piece.end);\n                const currentContent = buffer.buffer.substring(startOffset, endOffset);\n                return currentContent;\n            }\n            rbInsertRight(node, p) {\n                const z = new _rbTreeBase__rspack_import_1.nF(p, 1);\n                z.left = _rbTreeBase__rspack_import_1.fd;\n                z.right = _rbTreeBase__rspack_import_1.fd;\n                z.parent = _rbTreeBase__rspack_import_1.fd;\n                z.size_left = 0;\n                z.lf_left = 0;\n                const x = this.root;\n                if (x === _rbTreeBase__rspack_import_1.fd) {\n                    this.root = z;\n                    z.color = 0;\n                } else if (node.right === _rbTreeBase__rspack_import_1.fd) {\n                    node.right = z;\n                    z.parent = node;\n                } else {\n                    const nextNode = (0, _rbTreeBase__rspack_import_1.cL)(node.right);\n                    nextNode.left = z;\n                    z.parent = nextNode;\n                }\n                (0, _rbTreeBase__rspack_import_1.Z2)(this, z);\n                return z;\n            }\n            rbInsertLeft(node, p) {\n                const z = new _rbTreeBase__rspack_import_1.nF(p, 1);\n                z.left = _rbTreeBase__rspack_import_1.fd;\n                z.right = _rbTreeBase__rspack_import_1.fd;\n                z.parent = _rbTreeBase__rspack_import_1.fd;\n                z.size_left = 0;\n                z.lf_left = 0;\n                if (this.root === _rbTreeBase__rspack_import_1.fd) {\n                    this.root = z;\n                    z.color = 0;\n                } else if (node.left === _rbTreeBase__rspack_import_1.fd) {\n                    node.left = z;\n                    z.parent = node;\n                } else {\n                    const prevNode = (0, _rbTreeBase__rspack_import_1.r9)(node.left);\n                    prevNode.right = z;\n                    z.parent = prevNode;\n                }\n                (0, _rbTreeBase__rspack_import_1.Z2)(this, z);\n                return z;\n            }\n            getContentOfSubTree(node) {\n                let str = '';\n                this.iterate(node, (node)=>{\n                    str += this.getNodeContent(node);\n                    return true;\n                });\n                return str;\n            }\n        }\n    },\n    260 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            of: ()=>DefaultEndOfLine,\n            xj: ()=>PieceTreeTextBufferBuilder\n        });\n        var _pieceTreeBase__rspack_import_1 = __webpack_require__(891);\n        const UTF8_BOM_CHARACTER = String.fromCharCode(65279);\n        function startsWithUTF8BOM(str) {\n            return !!(str && str.length > 0 && 65279 === str.charCodeAt(0));\n        }\n        var DefaultEndOfLine = /*#__PURE__*/ function(DefaultEndOfLine) {\n            DefaultEndOfLine[DefaultEndOfLine[\"LF\"] = 1] = \"LF\";\n            DefaultEndOfLine[DefaultEndOfLine[\"CRLF\"] = 2] = \"CRLF\";\n            return DefaultEndOfLine;\n        }({});\n        class PieceTreeTextBufferFactory {\n            _chunks;\n            _bom;\n            _cr;\n            _lf;\n            _crlf;\n            _normalizeEOL;\n            constructor(_chunks, _bom, _cr, _lf, _crlf, _normalizeEOL){\n                this._chunks = _chunks;\n                this._bom = _bom;\n                this._cr = _cr;\n                this._lf = _lf;\n                this._crlf = _crlf;\n                this._normalizeEOL = _normalizeEOL;\n            }\n            _getEOL(defaultEOL) {\n                const totalEOLCount = this._cr + this._lf + this._crlf;\n                const totalCRCount = this._cr + this._crlf;\n                if (0 === totalEOLCount) return 1 === defaultEOL ? '\\n' : '\\r\\n';\n                if (totalCRCount > totalEOLCount / 2) return '\\r\\n';\n                return '\\n';\n            }\n            create(defaultEOL) {\n                const eol = this._getEOL(defaultEOL);\n                const chunks = this._chunks;\n                if (this._normalizeEOL && ('\\r\\n' === eol && (this._cr > 0 || this._lf > 0) || '\\n' === eol && (this._cr > 0 || this._crlf > 0))) for(let i = 0, len = chunks.length; i < len; i++){\n                    const str = chunks[i].buffer.replace(/\\r\\n|\\r|\\n/g, eol);\n                    const newLineStart = (0, _pieceTreeBase__rspack_import_1.Ep)(str);\n                    chunks[i] = new _pieceTreeBase__rspack_import_1.CV(str, newLineStart);\n                }\n                return new _pieceTreeBase__rspack_import_1.Ux(chunks, eol, this._normalizeEOL);\n            }\n            getFirstLineText(lengthLimit) {\n                return this._chunks[0].buffer.substr(0, 100).split(/\\r\\n|\\r|\\n/)[0];\n            }\n        }\n        class PieceTreeTextBufferBuilder {\n            chunks;\n            BOM;\n            _hasPreviousChar;\n            _previousChar;\n            _tmpLineStarts;\n            cr;\n            lf;\n            crlf;\n            constructor(){\n                this.chunks = [];\n                this.BOM = '';\n                this._hasPreviousChar = false;\n                this._previousChar = 0;\n                this._tmpLineStarts = [];\n                this.cr = 0;\n                this.lf = 0;\n                this.crlf = 0;\n            }\n            acceptChunk(chunk) {\n                if (0 === chunk.length) return;\n                if (0 === this.chunks.length) {\n                    if (startsWithUTF8BOM(chunk)) {\n                        this.BOM = UTF8_BOM_CHARACTER;\n                        chunk = chunk.substr(1);\n                    }\n                }\n                const lastChar = chunk.charCodeAt(chunk.length - 1);\n                if (13 === lastChar || lastChar >= 0xd800 && lastChar <= 0xdbff) {\n                    this._acceptChunk1(chunk.substr(0, chunk.length - 1), false);\n                    this._hasPreviousChar = true;\n                    this._previousChar = lastChar;\n                } else {\n                    this._acceptChunk1(chunk, false);\n                    this._hasPreviousChar = false;\n                    this._previousChar = lastChar;\n                }\n            }\n            _acceptChunk1(chunk, allowEmptyStrings) {\n                if (!allowEmptyStrings && 0 === chunk.length) return;\n                if (this._hasPreviousChar) this._acceptChunk2(String.fromCharCode(this._previousChar) + chunk);\n                else this._acceptChunk2(chunk);\n            }\n            _acceptChunk2(chunk) {\n                const lineStarts = (0, _pieceTreeBase__rspack_import_1.g4)(this._tmpLineStarts, chunk);\n                this.chunks.push(new _pieceTreeBase__rspack_import_1.CV(chunk, lineStarts.lineStarts));\n                this.cr += lineStarts.cr;\n                this.lf += lineStarts.lf;\n                this.crlf += lineStarts.crlf;\n            }\n            finish(normalizeEOL = true) {\n                this._finish();\n                return new PieceTreeTextBufferFactory(this.chunks, this.BOM, this.cr, this.lf, this.crlf, normalizeEOL);\n            }\n            _finish() {\n                if (0 === this.chunks.length) this._acceptChunk1('', true);\n                if (this._hasPreviousChar) {\n                    this._hasPreviousChar = false;\n                    const lastChunk = this.chunks[this.chunks.length - 1];\n                    lastChunk.buffer += String.fromCharCode(this._previousChar);\n                    const newLineStarts = (0, _pieceTreeBase__rspack_import_1.Ep)(lastChunk.buffer);\n                    lastChunk.lineStarts = newLineStarts;\n                    if (13 === this._previousChar) this.cr++;\n                }\n            }\n        }\n    },\n    267 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            Ct: ()=>rbDelete,\n            Z2: ()=>fixInsert,\n            cL: ()=>leftest,\n            fd: ()=>SENTINEL,\n            nF: ()=>TreeNode,\n            r9: ()=>righttest,\n            rd: ()=>updateTreeMetadata\n        });\n        class TreeNode {\n            parent;\n            left;\n            right;\n            color;\n            piece;\n            size_left;\n            lf_left;\n            constructor(piece, color){\n                this.piece = piece;\n                this.color = color;\n                this.size_left = 0;\n                this.lf_left = 0;\n                this.parent = this;\n                this.left = this;\n                this.right = this;\n            }\n            next() {\n                if (this.right !== SENTINEL) return leftest(this.right);\n                let node = this;\n                while(node.parent !== SENTINEL){\n                    if (node.parent.left === node) break;\n                    node = node.parent;\n                }\n                if (node.parent === SENTINEL) return SENTINEL;\n                return node.parent;\n            }\n            prev() {\n                if (this.left !== SENTINEL) return righttest(this.left);\n                let node = this;\n                while(node.parent !== SENTINEL){\n                    if (node.parent.right === node) break;\n                    node = node.parent;\n                }\n                if (node.parent === SENTINEL) return SENTINEL;\n                return node.parent;\n            }\n            detach() {\n                this.parent = null;\n                this.left = null;\n                this.right = null;\n            }\n        }\n        const SENTINEL = new TreeNode(null, 0);\n        SENTINEL.parent = SENTINEL;\n        SENTINEL.left = SENTINEL;\n        SENTINEL.right = SENTINEL;\n        SENTINEL.color = 0;\n        function leftest(node) {\n            while(node.left !== SENTINEL)node = node.left;\n            return node;\n        }\n        function righttest(node) {\n            while(node.right !== SENTINEL)node = node.right;\n            return node;\n        }\n        function calculateSize(node) {\n            if (node === SENTINEL) return 0;\n            return node.size_left + node.piece.length + calculateSize(node.right);\n        }\n        function calculateLF(node) {\n            if (node === SENTINEL) return 0;\n            return node.lf_left + node.piece.lineFeedCnt + calculateLF(node.right);\n        }\n        function resetSentinel() {\n            SENTINEL.parent = SENTINEL;\n        }\n        function leftRotate(tree, x) {\n            const y = x.right;\n            y.size_left += x.size_left + (x.piece ? x.piece.length : 0);\n            y.lf_left += x.lf_left + (x.piece ? x.piece.lineFeedCnt : 0);\n            x.right = y.left;\n            if (y.left !== SENTINEL) y.left.parent = x;\n            y.parent = x.parent;\n            if (x.parent === SENTINEL) tree.root = y;\n            else if (x.parent.left === x) x.parent.left = y;\n            else x.parent.right = y;\n            y.left = x;\n            x.parent = y;\n        }\n        function rightRotate(tree, y) {\n            const x = y.left;\n            y.left = x.right;\n            if (x.right !== SENTINEL) x.right.parent = y;\n            x.parent = y.parent;\n            y.size_left -= x.size_left + (x.piece ? x.piece.length : 0);\n            y.lf_left -= x.lf_left + (x.piece ? x.piece.lineFeedCnt : 0);\n            if (y.parent === SENTINEL) tree.root = x;\n            else if (y === y.parent.right) y.parent.right = x;\n            else y.parent.left = x;\n            x.right = y;\n            y.parent = x;\n        }\n        function rbDelete(tree, z) {\n            let x;\n            let y;\n            if (z.left === SENTINEL) {\n                y = z;\n                x = y.right;\n            } else if (z.right === SENTINEL) {\n                y = z;\n                x = y.left;\n            } else {\n                y = leftest(z.right);\n                x = y.right;\n            }\n            if (y === tree.root) {\n                tree.root = x;\n                x.color = 0;\n                z.detach();\n                resetSentinel();\n                tree.root.parent = SENTINEL;\n                return;\n            }\n            const yWasRed = 1 === y.color;\n            if (y === y.parent.left) y.parent.left = x;\n            else y.parent.right = x;\n            if (y === z) {\n                x.parent = y.parent;\n                recomputeTreeMetadata(tree, x);\n            } else {\n                if (y.parent === z) x.parent = y;\n                else x.parent = y.parent;\n                recomputeTreeMetadata(tree, x);\n                y.left = z.left;\n                y.right = z.right;\n                y.parent = z.parent;\n                y.color = z.color;\n                if (z === tree.root) tree.root = y;\n                else if (z === z.parent.left) z.parent.left = y;\n                else z.parent.right = y;\n                if (y.left !== SENTINEL) y.left.parent = y;\n                if (y.right !== SENTINEL) y.right.parent = y;\n                y.size_left = z.size_left;\n                y.lf_left = z.lf_left;\n                recomputeTreeMetadata(tree, y);\n            }\n            z.detach();\n            if (x.parent.left === x) {\n                const newSizeLeft = calculateSize(x);\n                const newLFLeft = calculateLF(x);\n                if (newSizeLeft !== x.parent.size_left || newLFLeft !== x.parent.lf_left) {\n                    const delta = newSizeLeft - x.parent.size_left;\n                    const lf_delta = newLFLeft - x.parent.lf_left;\n                    x.parent.size_left = newSizeLeft;\n                    x.parent.lf_left = newLFLeft;\n                    updateTreeMetadata(tree, x.parent, delta, lf_delta);\n                }\n            }\n            recomputeTreeMetadata(tree, x.parent);\n            if (yWasRed) return void resetSentinel();\n            let w;\n            while(x !== tree.root && 0 === x.color)if (x === x.parent.left) {\n                w = x.parent.right;\n                if (1 === w.color) {\n                    w.color = 0;\n                    x.parent.color = 1;\n                    leftRotate(tree, x.parent);\n                    w = x.parent.right;\n                }\n                if (0 === w.left.color && 0 === w.right.color) {\n                    w.color = 1;\n                    x = x.parent;\n                } else {\n                    if (0 === w.right.color) {\n                        w.left.color = 0;\n                        w.color = 1;\n                        rightRotate(tree, w);\n                        w = x.parent.right;\n                    }\n                    w.color = x.parent.color;\n                    x.parent.color = 0;\n                    w.right.color = 0;\n                    leftRotate(tree, x.parent);\n                    x = tree.root;\n                }\n            } else {\n                w = x.parent.left;\n                if (1 === w.color) {\n                    w.color = 0;\n                    x.parent.color = 1;\n                    rightRotate(tree, x.parent);\n                    w = x.parent.left;\n                }\n                if (0 === w.left.color && 0 === w.right.color) {\n                    w.color = 1;\n                    x = x.parent;\n                } else {\n                    if (0 === w.left.color) {\n                        w.right.color = 0;\n                        w.color = 1;\n                        leftRotate(tree, w);\n                        w = x.parent.left;\n                    }\n                    w.color = x.parent.color;\n                    x.parent.color = 0;\n                    w.left.color = 0;\n                    rightRotate(tree, x.parent);\n                    x = tree.root;\n                }\n            }\n            x.color = 0;\n            resetSentinel();\n        }\n        function fixInsert(tree, x) {\n            recomputeTreeMetadata(tree, x);\n            while(x !== tree.root && 1 === x.parent.color)if (x.parent === x.parent.parent.left) {\n                const y = x.parent.parent.right;\n                if (1 === y.color) {\n                    x.parent.color = 0;\n                    y.color = 0;\n                    x.parent.parent.color = 1;\n                    x = x.parent.parent;\n                } else {\n                    if (x === x.parent.right) {\n                        x = x.parent;\n                        leftRotate(tree, x);\n                    }\n                    x.parent.color = 0;\n                    x.parent.parent.color = 1;\n                    rightRotate(tree, x.parent.parent);\n                }\n            } else {\n                const y = x.parent.parent.left;\n                if (1 === y.color) {\n                    x.parent.color = 0;\n                    y.color = 0;\n                    x.parent.parent.color = 1;\n                    x = x.parent.parent;\n                } else {\n                    if (x === x.parent.left) {\n                        x = x.parent;\n                        rightRotate(tree, x);\n                    }\n                    x.parent.color = 0;\n                    x.parent.parent.color = 1;\n                    leftRotate(tree, x.parent.parent);\n                }\n            }\n            tree.root.color = 0;\n        }\n        function updateTreeMetadata(tree, x, delta, lineFeedCntDelta) {\n            while(x !== tree.root && x !== SENTINEL){\n                if (x.parent.left === x) {\n                    x.parent.size_left += delta;\n                    x.parent.lf_left += lineFeedCntDelta;\n                }\n                x = x.parent;\n            }\n        }\n        function recomputeTreeMetadata(tree, x) {\n            let delta = 0;\n            let lf_delta = 0;\n            if (x === tree.root) return;\n            while(x !== tree.root && x === x.parent.right)x = x.parent;\n            if (x === tree.root) return;\n            x = x.parent;\n            delta = calculateSize(x.left) - x.size_left;\n            lf_delta = calculateLF(x.left) - x.lf_left;\n            x.size_left += delta;\n            x.lf_left += lf_delta;\n            while(x !== tree.root && (0 !== delta || 0 !== lf_delta)){\n                if (x.parent.left === x) {\n                    x.parent.size_left += delta;\n                    x.parent.lf_left += lf_delta;\n                }\n                x = x.parent;\n            }\n        }\n    },\n    263 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            I: ()=>getFoldingRanges\n        });\n        var jsonc_parser__rspack_import_0 = __webpack_require__(508);\n        function getFoldingRanges(jsonModel) {\n            const ranges = [];\n            const stack = [];\n            let prevStart = -1;\n            const scanner = (0, jsonc_parser__rspack_import_0.z1)(jsonModel.getValue(), false);\n            let token = scanner.scan();\n            function addRange(range) {\n                ranges.push(range);\n            }\n            while(token !== jsonc_parser__rspack_import_0.a6.EOF){\n                switch(token){\n                    case jsonc_parser__rspack_import_0.a6.OpenBraceToken:\n                    case jsonc_parser__rspack_import_0.a6.OpenBracketToken:\n                        {\n                            const startLineNumber = jsonModel.positionAt(scanner.getPosition()).lineNumber;\n                            const range = {\n                                startLineNumber,\n                                type: token === jsonc_parser__rspack_import_0.a6.OpenBraceToken ? 'object' : 'array'\n                            };\n                            stack.push(range);\n                            break;\n                        }\n                    case jsonc_parser__rspack_import_0.a6.CloseBraceToken:\n                    case jsonc_parser__rspack_import_0.a6.CloseBracketToken:\n                        {\n                            const type = token === jsonc_parser__rspack_import_0.a6.CloseBraceToken ? 'object' : 'array';\n                            if (stack.length > 0 && stack[stack.length - 1].type === type) {\n                                const range = stack.pop();\n                                const endLineNumber = jsonModel.positionAt(scanner.getTokenOffset()).lineNumber;\n                                if (range && endLineNumber > range.startLineNumber + 1 && prevStart !== range.startLineNumber) {\n                                    const foldRange = {\n                                        startLineNumber: range.startLineNumber,\n                                        endLineNumber: endLineNumber - 1,\n                                        type: range.type,\n                                        isCollapsed: false,\n                                        source: 0\n                                    };\n                                    addRange(foldRange);\n                                    prevStart = range.startLineNumber;\n                                }\n                            }\n                            break;\n                        }\n                }\n                token = scanner.scan();\n            }\n            return ranges;\n        }\n    },\n    949 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            GD: ()=>parseJsonAst,\n            IB: ()=>formatJson,\n            uB: ()=>doValidate\n        });\n        var jsonc_parser__rspack_import_0 = __webpack_require__(508);\n        var _parse__rspack_import_1 = __webpack_require__(843);\n        function formatJson(jsonModel, options) {\n            const edits = (0, jsonc_parser__rspack_import_0.GP)(jsonModel.getValue(), void 0, options);\n            return edits;\n        }\n        function doValidate(jsonModel) {\n            const { root, problems } = (0, _parse__rspack_import_1.qF)(jsonModel);\n            return {\n                problems,\n                root\n            };\n        }\n        function parseJsonAst(jsonModel) {\n            return (0, _parse__rspack_import_1.qF)(jsonModel).root;\n        }\n    },\n    899 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            O4: ()=>ErrorCode,\n            PF: ()=>ErrRange,\n            oQ: ()=>Diagnostic\n        });\n        var ErrorCode = /*#__PURE__*/ function(ErrorCode) {\n            ErrorCode[ErrorCode[\"Undefined\"] = 0] = \"Undefined\";\n            ErrorCode[ErrorCode[\"EnumValueMismatch\"] = 1] = \"EnumValueMismatch\";\n            ErrorCode[ErrorCode[\"Deprecated\"] = 2] = \"Deprecated\";\n            ErrorCode[ErrorCode[\"UnexpectedEndOfComment\"] = 0x101] = \"UnexpectedEndOfComment\";\n            ErrorCode[ErrorCode[\"UnexpectedEndOfString\"] = 0x102] = \"UnexpectedEndOfString\";\n            ErrorCode[ErrorCode[\"UnexpectedEndOfNumber\"] = 0x103] = \"UnexpectedEndOfNumber\";\n            ErrorCode[ErrorCode[\"InvalidUnicode\"] = 0x104] = \"InvalidUnicode\";\n            ErrorCode[ErrorCode[\"InvalidEscapeCharacter\"] = 0x105] = \"InvalidEscapeCharacter\";\n            ErrorCode[ErrorCode[\"InvalidCharacter\"] = 0x106] = \"InvalidCharacter\";\n            ErrorCode[ErrorCode[\"PropertyExpected\"] = 0x201] = \"PropertyExpected\";\n            ErrorCode[ErrorCode[\"CommaExpected\"] = 0x202] = \"CommaExpected\";\n            ErrorCode[ErrorCode[\"ColonExpected\"] = 0x203] = \"ColonExpected\";\n            ErrorCode[ErrorCode[\"ValueExpected\"] = 0x204] = \"ValueExpected\";\n            ErrorCode[ErrorCode[\"CommaOrCloseBacketExpected\"] = 0x205] = \"CommaOrCloseBacketExpected\";\n            ErrorCode[ErrorCode[\"CommaOrCloseBraceExpected\"] = 0x206] = \"CommaOrCloseBraceExpected\";\n            ErrorCode[ErrorCode[\"TrailingComma\"] = 0x207] = \"TrailingComma\";\n            ErrorCode[ErrorCode[\"DuplicateKey\"] = 0x208] = \"DuplicateKey\";\n            ErrorCode[ErrorCode[\"CommentNotPermitted\"] = 0x209] = \"CommentNotPermitted\";\n            ErrorCode[ErrorCode[\"PropertyKeysMustBeDoublequoted\"] = 0x210] = \"PropertyKeysMustBeDoublequoted\";\n            ErrorCode[ErrorCode[\"SchemaResolveError\"] = 0x300] = \"SchemaResolveError\";\n            ErrorCode[ErrorCode[\"SchemaUnsupportedFeature\"] = 0x301] = \"SchemaUnsupportedFeature\";\n            return ErrorCode;\n        }({});\n        class Diagnostic {\n            message;\n            code;\n            range;\n            constructor(message, code, range){\n                this.message = message;\n                this.code = code;\n                this.range = range;\n            }\n            static create(message, code, range) {\n                return new Diagnostic(message, code, range);\n            }\n        }\n        class ErrRange {\n            start;\n            end;\n            constructor(start, end){\n                this.start = start;\n                this.end = end;\n            }\n            static create(start, end) {\n                return new ErrRange(start, end);\n            }\n        }\n        (function(CompletionItemKind) {\n            CompletionItemKind.Text = 1;\n            CompletionItemKind.Method = 2;\n            CompletionItemKind.Function = 3;\n            CompletionItemKind.Constructor = 4;\n            CompletionItemKind.Field = 5;\n            CompletionItemKind.Variable = 6;\n            CompletionItemKind.Class = 7;\n            CompletionItemKind.Interface = 8;\n            CompletionItemKind.Module = 9;\n            CompletionItemKind.Property = 10;\n            CompletionItemKind.Unit = 11;\n            CompletionItemKind.Value = 12;\n            CompletionItemKind.Enum = 13;\n            CompletionItemKind.Keyword = 14;\n            CompletionItemKind.Snippet = 15;\n            CompletionItemKind.Color = 16;\n            CompletionItemKind.File = 17;\n            CompletionItemKind.Reference = 18;\n            CompletionItemKind.Folder = 19;\n            CompletionItemKind.EnumMember = 20;\n            CompletionItemKind.Constant = 21;\n            CompletionItemKind.Struct = 22;\n            CompletionItemKind.Event = 23;\n            CompletionItemKind.Operator = 24;\n            CompletionItemKind.TypeParameter = 25;\n        })(CompletionItemKind || (CompletionItemKind = {}));\n        (function(InsertTextFormat) {\n            InsertTextFormat.PlainText = 1;\n            InsertTextFormat.Snippet = 2;\n        })(InsertTextFormat || (InsertTextFormat = {}));\n        (function(TextEdit) {\n            function replace(range, newText) {\n                return {\n                    range,\n                    newText\n                };\n            }\n            TextEdit.replace = replace;\n        })(TextEdit || (TextEdit = {}));\n        (function(CompletionItem) {\n            function create(label) {\n                return {\n                    label\n                };\n            }\n            CompletionItem.create = create;\n        })(CompletionItem || (CompletionItem = {}));\n        var CompletionItemKind, InsertTextFormat, TextEdit, CompletionItem;\n    },\n    843 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            qF: ()=>parseJson\n        });\n        var jsonc_parser__rspack_import_0 = __webpack_require__(508);\n        var _jsonTypes__rspack_import_1 = __webpack_require__(899);\n        var _common_utils__rspack_import_2 = __webpack_require__(861);\n        class ASTNodeImpl {\n            offset;\n            length;\n            parent;\n            constructor(parent, offset, length = 0){\n                this.offset = offset;\n                this.length = length;\n                this.parent = parent;\n            }\n            get children() {\n                return [];\n            }\n            toString() {\n                return 'type: ' + this.type + ' (' + this.offset + '/' + this.length + ')' + (this.parent ? ' parent: {' + this.parent.toString() + '}' : '');\n            }\n        }\n        class NullASTNodeImpl extends ASTNodeImpl {\n            type = 'null';\n            value = null;\n            constructor(parent, offset){\n                super(parent, offset);\n            }\n        }\n        class BooleanASTNodeImpl extends ASTNodeImpl {\n            type = 'boolean';\n            value;\n            constructor(parent, boolValue, offset){\n                super(parent, offset);\n                this.value = boolValue;\n            }\n        }\n        class ArrayASTNodeImpl extends ASTNodeImpl {\n            type = 'array';\n            items;\n            constructor(parent, offset){\n                super(parent, offset);\n                this.items = [];\n            }\n            get children() {\n                return this.items;\n            }\n        }\n        class NumberASTNodeImpl extends ASTNodeImpl {\n            type = 'number';\n            isInteger;\n            value;\n            constructor(parent, offset){\n                super(parent, offset);\n                this.isInteger = true;\n                this.value = 0 / 0;\n            }\n        }\n        class ObjectASTNodeImpl extends ASTNodeImpl {\n            type = 'object';\n            properties;\n            constructor(parent, offset){\n                super(parent, offset);\n                this.properties = [];\n            }\n            get children() {\n                return this.properties;\n            }\n        }\n        class StringASTNodeImpl extends ASTNodeImpl {\n            type = 'string';\n            value;\n            constructor(parent, offset, length){\n                super(parent, offset, length);\n                this.value = '';\n            }\n        }\n        class PropertyASTNodeImpl extends ASTNodeImpl {\n            type = 'property';\n            keyNode;\n            valueNode;\n            colonOffset;\n            constructor(parent, offset, keyNode){\n                super(parent, offset);\n                this.colonOffset = -1;\n                this.keyNode = keyNode;\n            }\n            get children() {\n                return this.valueNode ? [\n                    this.keyNode,\n                    this.valueNode\n                ] : [\n                    this.keyNode\n                ];\n            }\n        }\n        class JsonDocument {\n            root;\n            constructor(root){\n                this.root = root;\n            }\n            getNodeFromOffset(offset, includeRightBound = false) {\n                if (!this.root) return;\n                return jsonc_parser__rspack_import_0.SM(this.root, offset, includeRightBound);\n            }\n            visit(visitor) {\n                if (this.root) {\n                    const doVisit = (node)=>{\n                        let ctn = visitor(node);\n                        const children = node.children;\n                        if (Array.isArray(children)) for(let i = 0; i < children.length && ctn; i++)ctn = doVisit(children[i]);\n                        return ctn;\n                    };\n                    doVisit(this.root);\n                }\n            }\n        }\n        function parseJson(jsonModel) {\n            const problems = [];\n            let lastProblemOffset = -1;\n            const text = jsonModel.getValue();\n            const scanner = jsonc_parser__rspack_import_0.z1(text, false);\n            function _scanNext() {\n                while(true){\n                    const token = scanner.scan();\n                    _checkScanError();\n                    switch(token){\n                        case jsonc_parser__rspack_import_0.a6.LineBreakTrivia:\n                        case jsonc_parser__rspack_import_0.a6.Trivia:\n                            break;\n                        default:\n                            return token;\n                    }\n                }\n            }\n            function _checkScanError() {\n                switch(scanner.getTokenError()){\n                    case jsonc_parser__rspack_import_0.sC.InvalidUnicode:\n                        _error('Invalid unicode sequence in string.', _jsonTypes__rspack_import_1.O4.InvalidUnicode);\n                        return true;\n                    case jsonc_parser__rspack_import_0.sC.InvalidEscapeCharacter:\n                        _error('Invalid escape character in string.', _jsonTypes__rspack_import_1.O4.InvalidEscapeCharacter);\n                        return true;\n                    case jsonc_parser__rspack_import_0.sC.UnexpectedEndOfNumber:\n                        _error('Unexpected end of number.', _jsonTypes__rspack_import_1.O4.UnexpectedEndOfNumber);\n                        return true;\n                    case jsonc_parser__rspack_import_0.sC.UnexpectedEndOfComment:\n                        _error('Unexpected end of comment.', _jsonTypes__rspack_import_1.O4.UnexpectedEndOfComment);\n                        return true;\n                    case jsonc_parser__rspack_import_0.sC.UnexpectedEndOfString:\n                        _error('Unexpected end of string.', _jsonTypes__rspack_import_1.O4.UnexpectedEndOfString);\n                        return true;\n                    case jsonc_parser__rspack_import_0.sC.InvalidCharacter:\n                        _error('Invalid characters in string. Control characters must be escaped.', _jsonTypes__rspack_import_1.O4.InvalidCharacter);\n                        return true;\n                }\n                return false;\n            }\n            function _errorAtRange(message, code, startOffset, endOffset) {\n                if (0 === problems.length || startOffset !== lastProblemOffset) {\n                    const range = _jsonTypes__rspack_import_1.PF.create(jsonModel.positionAt(startOffset), jsonModel.positionAt(endOffset));\n                    problems.push(_jsonTypes__rspack_import_1.oQ.create(message, code, range));\n                    lastProblemOffset = startOffset;\n                }\n            }\n            function _finalize(node, scanNext) {\n                node.length = scanner.getTokenOffset() + scanner.getTokenLength() - node.offset;\n                if (scanNext) _scanNext();\n                return node;\n            }\n            function _error(message, code, node, skipUntilAfter = [], skipUntil = []) {\n                let start = scanner.getTokenOffset();\n                let end = scanner.getTokenOffset() + scanner.getTokenLength();\n                if (start === end && start > 0) {\n                    start--;\n                    while(start > 0 && /\\s/.test(text.charAt(start)))start--;\n                    end = start + 1;\n                }\n                _errorAtRange(message, code, start, end);\n                if (node) _finalize(node, false);\n                if (skipUntilAfter.length + skipUntil.length > 0) {\n                    let token = scanner.getToken();\n                    while(token !== jsonc_parser__rspack_import_0.a6.EOF){\n                        if (-1 !== skipUntilAfter.indexOf(token)) {\n                            _scanNext();\n                            break;\n                        }\n                        if (-1 !== skipUntil.indexOf(token)) break;\n                        token = _scanNext();\n                    }\n                }\n                return node;\n            }\n            function _parseArray(parent) {\n                if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.OpenBracketToken) return;\n                const node = new ArrayASTNodeImpl(parent, scanner.getTokenOffset());\n                _scanNext();\n                let needComma = false;\n                while(scanner.getToken() !== jsonc_parser__rspack_import_0.a6.CloseBracketToken && scanner.getToken() !== jsonc_parser__rspack_import_0.a6.EOF){\n                    if (scanner.getToken() === jsonc_parser__rspack_import_0.a6.CommaToken) {\n                        if (!needComma) _error('Value expected.', _jsonTypes__rspack_import_1.O4.ValueExpected);\n                        const commaOffset = scanner.getTokenOffset();\n                        _scanNext();\n                        if (scanner.getToken() === jsonc_parser__rspack_import_0.a6.CloseBracketToken) {\n                            if (needComma) _errorAtRange('Trailing comma', _jsonTypes__rspack_import_1.O4.TrailingComma, commaOffset, commaOffset + 1);\n                            continue;\n                        }\n                    } else if (needComma) {\n                        _error('Comma expected.', _jsonTypes__rspack_import_1.O4.CommaExpected, void 0, [], [\n                            jsonc_parser__rspack_import_0.a6.CloseBracketToken\n                        ]);\n                        break;\n                    }\n                    const item = _parseValue(node);\n                    if (item) node.items.push(item);\n                    else {\n                        _error('Value expected.', _jsonTypes__rspack_import_1.O4.ValueExpected, void 0, [], [\n                            jsonc_parser__rspack_import_0.a6.CloseBracketToken\n                        ]);\n                        break;\n                    }\n                    needComma = true;\n                }\n                if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.CloseBracketToken) return _error('Expected comma or closing bracket', _jsonTypes__rspack_import_1.O4.CommaOrCloseBraceExpected, node);\n                return _finalize(node, true);\n            }\n            const keyPlaceholder = new StringASTNodeImpl(void 0, 0, 0);\n            function _parseProperty(parent, keysSeen) {\n                const node = new PropertyASTNodeImpl(parent, scanner.getTokenOffset(), keyPlaceholder);\n                let key = _parseString(node);\n                if (!key) if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.Unknown) return;\n                else {\n                    _error('Property keys must be doublequoted', _jsonTypes__rspack_import_1.O4.PropertyKeysMustBeDoublequoted);\n                    const keyNode = new StringASTNodeImpl(node, scanner.getTokenOffset(), scanner.getTokenLength());\n                    keyNode.value = scanner.getTokenValue();\n                    key = keyNode;\n                    _scanNext();\n                }\n                node.keyNode = key;\n                if ('//' !== key.value) {\n                    const seen = keysSeen[key.value];\n                    if (seen) {\n                        _errorAtRange('Duplicate object key', _jsonTypes__rspack_import_1.O4.DuplicateKey, node.keyNode.offset, node.keyNode.offset + node.keyNode.length);\n                        if ((0, _common_utils__rspack_import_2.Gv)(seen)) _errorAtRange('Duplicate object key', _jsonTypes__rspack_import_1.O4.DuplicateKey, seen.keyNode.offset, seen.keyNode.offset + seen.keyNode.length);\n                        keysSeen[key.value] = true;\n                    } else keysSeen[key.value] = node;\n                }\n                if (scanner.getToken() === jsonc_parser__rspack_import_0.a6.ColonToken) {\n                    node.colonOffset = scanner.getTokenOffset();\n                    _scanNext();\n                } else {\n                    _error('Colon expected', _jsonTypes__rspack_import_1.O4.ColonExpected);\n                    if (scanner.getToken() === jsonc_parser__rspack_import_0.a6.StringLiteral && jsonModel.positionAt(key.offset + key.length).lineNumber < jsonModel.positionAt(scanner.getTokenOffset()).lineNumber) {\n                        node.length = key.length;\n                        return node;\n                    }\n                }\n                const value = _parseValue(node);\n                if (!value) return _error('Value expected', _jsonTypes__rspack_import_1.O4.ValueExpected, node, [], [\n                    jsonc_parser__rspack_import_0.a6.CloseBraceToken,\n                    jsonc_parser__rspack_import_0.a6.CommaToken\n                ]);\n                node.valueNode = value;\n                node.length = value.offset + value.length - node.offset;\n                return node;\n            }\n            function _parseObject(parent) {\n                if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.OpenBraceToken) return;\n                const node = new ObjectASTNodeImpl(parent, scanner.getTokenOffset());\n                const keysSeen = Object.create(null);\n                _scanNext();\n                let needsComma = false;\n                while(scanner.getToken() !== jsonc_parser__rspack_import_0.a6.CloseBraceToken && scanner.getToken() !== jsonc_parser__rspack_import_0.a6.EOF){\n                    if (scanner.getToken() === jsonc_parser__rspack_import_0.a6.CommaToken) {\n                        if (!needsComma) _error('Property expected', _jsonTypes__rspack_import_1.O4.PropertyExpected);\n                        const commaOffset = scanner.getTokenOffset();\n                        _scanNext();\n                        if (scanner.getToken() === jsonc_parser__rspack_import_0.a6.CloseBraceToken) {\n                            if (needsComma) _errorAtRange('Trailing comma', _jsonTypes__rspack_import_1.O4.TrailingComma, commaOffset, commaOffset + 1);\n                            continue;\n                        }\n                    } else if (needsComma) _error('Expected comma', _jsonTypes__rspack_import_1.O4.CommaExpected);\n                    const property = _parseProperty(node, keysSeen);\n                    if (property) node.properties.push(property);\n                    else _error('Property expected', _jsonTypes__rspack_import_1.O4.PropertyExpected, void 0, [], [\n                        jsonc_parser__rspack_import_0.a6.CloseBraceToken,\n                        jsonc_parser__rspack_import_0.a6.CommaToken\n                    ]);\n                    needsComma = true;\n                }\n                if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.CloseBraceToken) return _error('Expected comma or closing brace', _jsonTypes__rspack_import_1.O4.CommaOrCloseBraceExpected, node);\n                return _finalize(node, true);\n            }\n            function _parseString(parent) {\n                if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.StringLiteral) return;\n                const node = new StringASTNodeImpl(parent, scanner.getTokenOffset());\n                node.value = scanner.getTokenValue();\n                return _finalize(node, true);\n            }\n            function _parseNumber(parent) {\n                if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.NumericLiteral) return;\n                const node = new NumberASTNodeImpl(parent, scanner.getTokenOffset());\n                if (scanner.getTokenError() === jsonc_parser__rspack_import_0.sC.None) {\n                    const tokenValue = scanner.getTokenValue();\n                    try {\n                        const numberValue = JSON.parse(tokenValue);\n                        if (!(0, _common_utils__rspack_import_2.Et)(numberValue)) return _error('Invalid number format.', _jsonTypes__rspack_import_1.O4.Undefined, node);\n                        node.value = numberValue;\n                    } catch (e) {\n                        return _error('Invalid number format.', _jsonTypes__rspack_import_1.O4.Undefined, node);\n                    }\n                    node.isInteger = -1 === tokenValue.indexOf('.');\n                }\n                return _finalize(node, true);\n            }\n            function _parseLiteral(parent) {\n                switch(scanner.getToken()){\n                    case jsonc_parser__rspack_import_0.a6.NullKeyword:\n                        return _finalize(new NullASTNodeImpl(parent, scanner.getTokenOffset()), true);\n                    case jsonc_parser__rspack_import_0.a6.TrueKeyword:\n                        return _finalize(new BooleanASTNodeImpl(parent, true, scanner.getTokenOffset()), true);\n                    case jsonc_parser__rspack_import_0.a6.FalseKeyword:\n                        return _finalize(new BooleanASTNodeImpl(parent, false, scanner.getTokenOffset()), true);\n                    default:\n                        return;\n                }\n            }\n            function _parseValue(parent) {\n                return _parseArray(parent) || _parseObject(parent) || _parseString(parent) || _parseNumber(parent) || _parseLiteral(parent);\n            }\n            let _root;\n            const token = _scanNext();\n            if (token !== jsonc_parser__rspack_import_0.a6.EOF) {\n                _root = _parseValue(_root);\n                if (_root) {\n                    if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.EOF) _error('End of file expected.', _jsonTypes__rspack_import_1.O4.Undefined);\n                } else _error('Expected a JSON object, array or literal', _jsonTypes__rspack_import_1.O4.Undefined);\n            }\n            return {\n                problems,\n                root: new JsonDocument(_root)\n            };\n        }\n    },\n    261 (__unused_rspack_module, __unused_rspack___webpack_exports__, __webpack_require__) {\n        var _jsonWorker__rspack_import_0 = __webpack_require__(23);\n        let jsonWorker = null;\n        self.onmessage = (e)=>{\n            const { method, params, messageId } = e.data;\n            if ('init' === method) {\n                jsonWorker = new _jsonWorker__rspack_import_0.r(params.value);\n                self.postMessage({\n                    messageId,\n                    result: 'Worker initialized'\n                });\n                return;\n            }\n            if (!jsonWorker) return void self.postMessage({\n                messageId,\n                error: 'Worker not initialized'\n            });\n            let result;\n            switch(method){\n                case 'updateModel':\n                    jsonWorker.updateModel(params.op);\n                    break;\n                case 'undo':\n                    jsonWorker.undo();\n                    break;\n                case 'redo':\n                    jsonWorker.redo();\n                    break;\n                case 'format':\n                    result = jsonWorker.format(params.options);\n                    break;\n                case 'foldRange':\n                    result = jsonWorker.foldRange();\n                    break;\n                case 'validate':\n                    result = jsonWorker.validate();\n                    break;\n                default:\n                    result = {\n                        error: 'Unknown method'\n                    };\n            }\n            self.postMessage({\n                messageId,\n                result\n            });\n        };\n    },\n    23 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            r: ()=>JsonWorker\n        });\n        var _service_jsonService__rspack_import_1 = __webpack_require__(949);\n        var _service_jsonService__rspack_import_2 = __webpack_require__(263);\n        var _model__rspack_import_0 = __webpack_require__(574);\n        class JsonWorker {\n            _model = null;\n            constructor(value){\n                this._model = (0, _model__rspack_import_0.k)(value);\n            }\n            getModel() {\n                return this._model;\n            }\n            format(options) {\n                if (!this._model) throw new Error('Model not initialized');\n                return (0, _service_jsonService__rspack_import_1.IB)(this._model, options);\n            }\n            foldRange() {\n                if (!this._model) throw new Error('Model not initialized');\n                return (0, _service_jsonService__rspack_import_2.I)(this._model);\n            }\n            validate() {\n                if (!this._model) throw new Error('Model not initialized');\n                return (0, _service_jsonService__rspack_import_1.uB)(this._model);\n            }\n            updateModel(op) {\n                this._model?.applyOperation(op);\n                return op;\n            }\n            undo() {\n                this._model?.undo();\n            }\n            redo() {\n                this._model?.redo();\n            }\n            parse() {\n                if (!this._model) throw new Error('Model not initialized');\n                return (0, _service_jsonService__rspack_import_1.GD)(this._model);\n            }\n        }\n    }\n};\nvar __webpack_module_cache__ = {};\nfunction __webpack_require__(moduleId) {\n    var cachedModule = __webpack_module_cache__[moduleId];\n    if (void 0 !== cachedModule) return cachedModule.exports;\n    var module = __webpack_module_cache__[moduleId] = {\n        exports: {}\n    };\n    __webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n    return module.exports;\n}\n(()=>{\n    __webpack_require__.d = (exports, getters, values)=>{\n        var define = (defs, kind)=>{\n            for(var key in defs)if (__webpack_require__.o(defs, key) && !__webpack_require__.o(exports, key)) Object.defineProperty(exports, key, {\n                enumerable: true,\n                [kind]: defs[key]\n            });\n        };\n        define(getters, \"get\");\n        define(values, \"value\");\n    };\n})();\n(()=>{\n    __webpack_require__.o = (obj, prop)=>Object.prototype.hasOwnProperty.call(obj, prop);\n})();\n__webpack_require__(261);\n";
+const jsContent = "var __webpack_modules__ = {\n    190 (__unused_rspack_module, __unused_rspack___webpack_exports__, __webpack_require__) {\n        __webpack_require__(97);\n        __webpack_require__(809);\n    },\n    97 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            G: ()=>format\n        });\n        var _scanner__rspack_import_0 = __webpack_require__(650);\n        var _string_intern__rspack_import_1 = __webpack_require__(316);\n        function format(documentText, range, options) {\n            let initialIndentLevel;\n            let formatText;\n            let formatTextStart;\n            let rangeStart;\n            let rangeEnd;\n            if (range) {\n                rangeStart = range.offset;\n                rangeEnd = rangeStart + range.length;\n                formatTextStart = rangeStart;\n                while(formatTextStart > 0 && !isEOL(documentText, formatTextStart - 1))formatTextStart--;\n                let endOffset = rangeEnd;\n                while(endOffset < documentText.length && !isEOL(documentText, endOffset))endOffset++;\n                formatText = documentText.substring(formatTextStart, endOffset);\n                initialIndentLevel = computeIndentLevel(formatText, options);\n            } else {\n                formatText = documentText;\n                initialIndentLevel = 0;\n                formatTextStart = 0;\n                rangeStart = 0;\n                rangeEnd = documentText.length;\n            }\n            const eol = getEOL(options, documentText);\n            const eolFastPathSupported = _string_intern__rspack_import_1.wf.includes(eol);\n            let numberLineBreaks = 0;\n            let indentLevel = 0;\n            let indentValue;\n            indentValue = options.insertSpaces ? _string_intern__rspack_import_1.QR[options.tabSize || 4] ?? repeat(_string_intern__rspack_import_1.QR[\"1\"], options.tabSize || 4) : '\\t';\n            const indentType = '\\t' === indentValue ? '\\t' : ' ';\n            let scanner = (0, _scanner__rspack_import_0.z)(formatText, false);\n            let hasError = false;\n            function newLinesAndIndent() {\n                if (numberLineBreaks > 1) return repeat(eol, numberLineBreaks) + repeat(indentValue, initialIndentLevel + indentLevel);\n                const amountOfSpaces = indentValue.length * (initialIndentLevel + indentLevel);\n                if (!eolFastPathSupported || amountOfSpaces > _string_intern__rspack_import_1.mX[indentType][eol].length) return eol + repeat(indentValue, initialIndentLevel + indentLevel);\n                if (amountOfSpaces <= 0) return eol;\n                return _string_intern__rspack_import_1.mX[indentType][eol][amountOfSpaces];\n            }\n            function scanNext() {\n                let token = scanner.scan();\n                numberLineBreaks = 0;\n                while(15 === token || 14 === token){\n                    if (14 === token && options.keepLines) numberLineBreaks += 1;\n                    else if (14 === token) numberLineBreaks = 1;\n                    token = scanner.scan();\n                }\n                hasError = 16 === token || 0 !== scanner.getTokenError();\n                return token;\n            }\n            const editOperations = [];\n            function addEdit(text, startOffset, endOffset) {\n                if (!hasError && (!range || startOffset < rangeEnd && endOffset > rangeStart) && documentText.substring(startOffset, endOffset) !== text) editOperations.push({\n                    offset: startOffset,\n                    length: endOffset - startOffset,\n                    content: text\n                });\n            }\n            let firstToken = scanNext();\n            if (options.keepLines && numberLineBreaks > 0) addEdit(repeat(eol, numberLineBreaks), 0, 0);\n            if (17 !== firstToken) {\n                let firstTokenStart = scanner.getTokenOffset() + formatTextStart;\n                let initialIndent = indentValue.length * initialIndentLevel < 20 && options.insertSpaces ? _string_intern__rspack_import_1.QR[indentValue.length * initialIndentLevel] : repeat(indentValue, initialIndentLevel);\n                addEdit(initialIndent, formatTextStart, firstTokenStart);\n            }\n            while(17 !== firstToken){\n                let firstTokenEnd = scanner.getTokenOffset() + scanner.getTokenLength() + formatTextStart;\n                let secondToken = scanNext();\n                let replaceContent = '';\n                let needsLineBreak = false;\n                while(0 === numberLineBreaks && (12 === secondToken || 13 === secondToken)){\n                    let commentTokenStart = scanner.getTokenOffset() + formatTextStart;\n                    addEdit(_string_intern__rspack_import_1.QR[\"1\"], firstTokenEnd, commentTokenStart);\n                    firstTokenEnd = scanner.getTokenOffset() + scanner.getTokenLength() + formatTextStart;\n                    needsLineBreak = 12 === secondToken;\n                    replaceContent = needsLineBreak ? newLinesAndIndent() : '';\n                    secondToken = scanNext();\n                }\n                if (2 === secondToken) {\n                    if (1 !== firstToken) indentLevel--;\n                    if (options.keepLines && numberLineBreaks > 0 || !options.keepLines && 1 !== firstToken) replaceContent = newLinesAndIndent();\n                    else if (options.keepLines) replaceContent = _string_intern__rspack_import_1.QR[\"1\"];\n                } else if (4 === secondToken) {\n                    if (3 !== firstToken) indentLevel--;\n                    if (options.keepLines && numberLineBreaks > 0 || !options.keepLines && 3 !== firstToken) replaceContent = newLinesAndIndent();\n                    else if (options.keepLines) replaceContent = _string_intern__rspack_import_1.QR[\"1\"];\n                } else {\n                    switch(firstToken){\n                        case 3:\n                        case 1:\n                            indentLevel++;\n                            replaceContent = options.keepLines && numberLineBreaks > 0 || !options.keepLines ? newLinesAndIndent() : _string_intern__rspack_import_1.QR[\"1\"];\n                            break;\n                        case 5:\n                            replaceContent = options.keepLines && numberLineBreaks > 0 || !options.keepLines ? newLinesAndIndent() : _string_intern__rspack_import_1.QR[\"1\"];\n                            break;\n                        case 12:\n                            replaceContent = newLinesAndIndent();\n                            break;\n                        case 13:\n                            if (numberLineBreaks > 0) replaceContent = newLinesAndIndent();\n                            else if (!needsLineBreak) replaceContent = _string_intern__rspack_import_1.QR[\"1\"];\n                            break;\n                        case 6:\n                            if (options.keepLines && numberLineBreaks > 0) replaceContent = newLinesAndIndent();\n                            else if (!needsLineBreak) replaceContent = _string_intern__rspack_import_1.QR[\"1\"];\n                            break;\n                        case 10:\n                            if (options.keepLines && numberLineBreaks > 0) replaceContent = newLinesAndIndent();\n                            else if (6 === secondToken && !needsLineBreak) replaceContent = '';\n                            break;\n                        case 7:\n                        case 8:\n                        case 9:\n                        case 11:\n                        case 2:\n                        case 4:\n                            if (options.keepLines && numberLineBreaks > 0) replaceContent = newLinesAndIndent();\n                            else if (12 !== secondToken && 13 !== secondToken || needsLineBreak) {\n                                if (5 !== secondToken && 17 !== secondToken) hasError = true;\n                            } else replaceContent = _string_intern__rspack_import_1.QR[\"1\"];\n                            break;\n                        case 16:\n                            hasError = true;\n                            break;\n                    }\n                    if (numberLineBreaks > 0 && (12 === secondToken || 13 === secondToken)) replaceContent = newLinesAndIndent();\n                }\n                if (17 === secondToken) replaceContent = options.keepLines && numberLineBreaks > 0 ? newLinesAndIndent() : options.insertFinalNewline ? eol : '';\n                const secondTokenStart = scanner.getTokenOffset() + formatTextStart;\n                addEdit(replaceContent, firstTokenEnd, secondTokenStart);\n                firstToken = secondToken;\n            }\n            return editOperations;\n        }\n        function repeat(s, count) {\n            let result = '';\n            for(let i = 0; i < count; i++)result += s;\n            return result;\n        }\n        function computeIndentLevel(content, options) {\n            let i = 0;\n            let nChars = 0;\n            const tabSize = options.tabSize || 4;\n            while(i < content.length){\n                let ch = content.charAt(i);\n                if (ch === _string_intern__rspack_import_1.QR[\"1\"]) nChars++;\n                else if ('\\t' === ch) nChars += tabSize;\n                else break;\n                i++;\n            }\n            return Math.floor(nChars / tabSize);\n        }\n        function getEOL(options, text) {\n            for(let i = 0; i < text.length; i++){\n                const ch = text.charAt(i);\n                if ('\\r' === ch) {\n                    if (i + 1 < text.length && '\\n' === text.charAt(i + 1)) return '\\r\\n';\n                    return '\\r';\n                }\n                if ('\\n' === ch) return '\\n';\n            }\n            return options && options.eol || '\\n';\n        }\n        function isEOL(text, offset) {\n            return -1 !== '\\r\\n'.indexOf(text.charAt(offset));\n        }\n    },\n    809 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            SM: ()=>findNodeAtOffset,\n            Wc: ()=>findNodeAtLocation,\n            YR: ()=>visit,\n            cZ: ()=>parseTree,\n            eY: ()=>getNodePath,\n            g$: ()=>getLocation,\n            nY: ()=>stripComments,\n            qg: ()=>parse,\n            yQ: ()=>getNodeValue\n        });\n        var _scanner__rspack_import_0 = __webpack_require__(650);\n        var ParseOptions;\n        (function(ParseOptions) {\n            ParseOptions.DEFAULT = {\n                allowTrailingComma: false\n            };\n        })(ParseOptions || (ParseOptions = {}));\n        function getLocation(text, position) {\n            const segments = [];\n            const earlyReturnException = new Object();\n            let previousNode;\n            const previousNodeInst = {\n                value: {},\n                offset: 0,\n                length: 0,\n                type: 'object',\n                parent: void 0\n            };\n            let isAtPropertyKey = false;\n            function setPreviousNode(value, offset, length, type) {\n                previousNodeInst.value = value;\n                previousNodeInst.offset = offset;\n                previousNodeInst.length = length;\n                previousNodeInst.type = type;\n                previousNodeInst.colonOffset = void 0;\n                previousNode = previousNodeInst;\n            }\n            try {\n                visit(text, {\n                    onObjectBegin: (offset, length)=>{\n                        if (position <= offset) throw earlyReturnException;\n                        previousNode = void 0;\n                        isAtPropertyKey = position > offset;\n                        segments.push('');\n                    },\n                    onObjectProperty: (name, offset, length)=>{\n                        if (position < offset) throw earlyReturnException;\n                        setPreviousNode(name, offset, length, 'property');\n                        segments[segments.length - 1] = name;\n                        if (position <= offset + length) throw earlyReturnException;\n                    },\n                    onObjectEnd: (offset, length)=>{\n                        if (position <= offset) throw earlyReturnException;\n                        previousNode = void 0;\n                        segments.pop();\n                    },\n                    onArrayBegin: (offset, length)=>{\n                        if (position <= offset) throw earlyReturnException;\n                        previousNode = void 0;\n                        segments.push(0);\n                    },\n                    onArrayEnd: (offset, length)=>{\n                        if (position <= offset) throw earlyReturnException;\n                        previousNode = void 0;\n                        segments.pop();\n                    },\n                    onLiteralValue: (value, offset, length)=>{\n                        if (position < offset) throw earlyReturnException;\n                        setPreviousNode(value, offset, length, getNodeType(value));\n                        if (position <= offset + length) throw earlyReturnException;\n                    },\n                    onSeparator: (sep, offset, length)=>{\n                        if (position <= offset) throw earlyReturnException;\n                        if (':' === sep && previousNode && 'property' === previousNode.type) {\n                            previousNode.colonOffset = offset;\n                            isAtPropertyKey = false;\n                            previousNode = void 0;\n                        } else if (',' === sep) {\n                            const last = segments[segments.length - 1];\n                            if ('number' == typeof last) segments[segments.length - 1] = last + 1;\n                            else {\n                                isAtPropertyKey = true;\n                                segments[segments.length - 1] = '';\n                            }\n                            previousNode = void 0;\n                        }\n                    }\n                });\n            } catch (e) {\n                if (e !== earlyReturnException) throw e;\n            }\n            return {\n                path: segments,\n                previousNode,\n                isAtPropertyKey,\n                matches: (pattern)=>{\n                    let k = 0;\n                    for(let i = 0; k < pattern.length && i < segments.length; i++)if (pattern[k] === segments[i] || '*' === pattern[k]) k++;\n                    else if ('**' !== pattern[k]) return false;\n                    return k === pattern.length;\n                }\n            };\n        }\n        function parse(text, errors = [], options = ParseOptions.DEFAULT) {\n            let currentProperty = null;\n            let currentParent = [];\n            const previousParents = [];\n            function onValue(value) {\n                if (Array.isArray(currentParent)) currentParent.push(value);\n                else if (null !== currentProperty) currentParent[currentProperty] = value;\n            }\n            const visitor = {\n                onObjectBegin: ()=>{\n                    const object = {};\n                    onValue(object);\n                    previousParents.push(currentParent);\n                    currentParent = object;\n                    currentProperty = null;\n                },\n                onObjectProperty: (name)=>{\n                    currentProperty = name;\n                },\n                onObjectEnd: ()=>{\n                    currentParent = previousParents.pop();\n                },\n                onArrayBegin: ()=>{\n                    const array = [];\n                    onValue(array);\n                    previousParents.push(currentParent);\n                    currentParent = array;\n                    currentProperty = null;\n                },\n                onArrayEnd: ()=>{\n                    currentParent = previousParents.pop();\n                },\n                onLiteralValue: onValue,\n                onError: (error, offset, length)=>{\n                    errors.push({\n                        error,\n                        offset,\n                        length\n                    });\n                }\n            };\n            visit(text, visitor, options);\n            return currentParent[0];\n        }\n        function parseTree(text, errors = [], options = ParseOptions.DEFAULT) {\n            let currentParent = {\n                type: 'array',\n                offset: -1,\n                length: -1,\n                children: [],\n                parent: void 0\n            };\n            function ensurePropertyComplete(endOffset) {\n                if ('property' === currentParent.type) {\n                    currentParent.length = endOffset - currentParent.offset;\n                    currentParent = currentParent.parent;\n                }\n            }\n            function onValue(valueNode) {\n                currentParent.children.push(valueNode);\n                return valueNode;\n            }\n            const visitor = {\n                onObjectBegin: (offset)=>{\n                    currentParent = onValue({\n                        type: 'object',\n                        offset,\n                        length: -1,\n                        parent: currentParent,\n                        children: []\n                    });\n                },\n                onObjectProperty: (name, offset, length)=>{\n                    currentParent = onValue({\n                        type: 'property',\n                        offset,\n                        length: -1,\n                        parent: currentParent,\n                        children: []\n                    });\n                    currentParent.children.push({\n                        type: 'string',\n                        value: name,\n                        offset,\n                        length,\n                        parent: currentParent\n                    });\n                },\n                onObjectEnd: (offset, length)=>{\n                    ensurePropertyComplete(offset + length);\n                    currentParent.length = offset + length - currentParent.offset;\n                    currentParent = currentParent.parent;\n                    ensurePropertyComplete(offset + length);\n                },\n                onArrayBegin: (offset, length)=>{\n                    currentParent = onValue({\n                        type: 'array',\n                        offset,\n                        length: -1,\n                        parent: currentParent,\n                        children: []\n                    });\n                },\n                onArrayEnd: (offset, length)=>{\n                    currentParent.length = offset + length - currentParent.offset;\n                    currentParent = currentParent.parent;\n                    ensurePropertyComplete(offset + length);\n                },\n                onLiteralValue: (value, offset, length)=>{\n                    onValue({\n                        type: getNodeType(value),\n                        offset,\n                        length,\n                        parent: currentParent,\n                        value\n                    });\n                    ensurePropertyComplete(offset + length);\n                },\n                onSeparator: (sep, offset, length)=>{\n                    if ('property' === currentParent.type) {\n                        if (':' === sep) currentParent.colonOffset = offset;\n                        else if (',' === sep) ensurePropertyComplete(offset);\n                    }\n                },\n                onError: (error, offset, length)=>{\n                    errors.push({\n                        error,\n                        offset,\n                        length\n                    });\n                }\n            };\n            visit(text, visitor, options);\n            const result = currentParent.children[0];\n            if (result) delete result.parent;\n            return result;\n        }\n        function findNodeAtLocation(root, path) {\n            if (!root) return;\n            let node = root;\n            for (let segment of path)if ('string' == typeof segment) {\n                if ('object' !== node.type || !Array.isArray(node.children)) return;\n                let found = false;\n                for (const propertyNode of node.children)if (Array.isArray(propertyNode.children) && propertyNode.children[0].value === segment && 2 === propertyNode.children.length) {\n                    node = propertyNode.children[1];\n                    found = true;\n                    break;\n                }\n                if (!found) return;\n            } else {\n                const index = segment;\n                if ('array' !== node.type || index < 0 || !Array.isArray(node.children) || index >= node.children.length) return;\n                node = node.children[index];\n            }\n            return node;\n        }\n        function getNodePath(node) {\n            if (!node.parent || !node.parent.children) return [];\n            const path = getNodePath(node.parent);\n            if ('property' === node.parent.type) {\n                const key = node.parent.children[0].value;\n                path.push(key);\n            } else if ('array' === node.parent.type) {\n                const index = node.parent.children.indexOf(node);\n                if (-1 !== index) path.push(index);\n            }\n            return path;\n        }\n        function getNodeValue(node) {\n            switch(node.type){\n                case 'array':\n                    return node.children.map(getNodeValue);\n                case 'object':\n                    const obj = Object.create(null);\n                    for (let prop of node.children){\n                        const valueNode = prop.children[1];\n                        if (valueNode) obj[prop.children[0].value] = getNodeValue(valueNode);\n                    }\n                    return obj;\n                case 'null':\n                case 'string':\n                case 'number':\n                case 'boolean':\n                    return node.value;\n                default:\n                    return;\n            }\n        }\n        function contains(node, offset, includeRightBound = false) {\n            return offset >= node.offset && offset < node.offset + node.length || includeRightBound && offset === node.offset + node.length;\n        }\n        function findNodeAtOffset(node, offset, includeRightBound = false) {\n            if (contains(node, offset, includeRightBound)) {\n                const children = node.children;\n                if (Array.isArray(children)) for(let i = 0; i < children.length && children[i].offset <= offset; i++){\n                    const item = findNodeAtOffset(children[i], offset, includeRightBound);\n                    if (item) return item;\n                }\n                return node;\n            }\n        }\n        function visit(text, visitor, options = ParseOptions.DEFAULT) {\n            const _scanner = (0, _scanner__rspack_import_0.z)(text, false);\n            const _jsonPath = [];\n            let suppressedCallbacks = 0;\n            function toNoArgVisit(visitFunction) {\n                return visitFunction ? ()=>0 === suppressedCallbacks && visitFunction(_scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter()) : ()=>true;\n            }\n            function toOneArgVisit(visitFunction) {\n                return visitFunction ? (arg)=>0 === suppressedCallbacks && visitFunction(arg, _scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter()) : ()=>true;\n            }\n            function toOneArgVisitWithPath(visitFunction) {\n                return visitFunction ? (arg)=>0 === suppressedCallbacks && visitFunction(arg, _scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter(), ()=>_jsonPath.slice()) : ()=>true;\n            }\n            function toBeginVisit(visitFunction) {\n                return visitFunction ? ()=>{\n                    if (suppressedCallbacks > 0) suppressedCallbacks++;\n                    else {\n                        let cbReturn = visitFunction(_scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter(), ()=>_jsonPath.slice());\n                        if (false === cbReturn) suppressedCallbacks = 1;\n                    }\n                } : ()=>true;\n            }\n            function toEndVisit(visitFunction) {\n                return visitFunction ? ()=>{\n                    if (suppressedCallbacks > 0) suppressedCallbacks--;\n                    if (0 === suppressedCallbacks) visitFunction(_scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter());\n                } : ()=>true;\n            }\n            const onObjectBegin = toBeginVisit(visitor.onObjectBegin), onObjectProperty = toOneArgVisitWithPath(visitor.onObjectProperty), onObjectEnd = toEndVisit(visitor.onObjectEnd), onArrayBegin = toBeginVisit(visitor.onArrayBegin), onArrayEnd = toEndVisit(visitor.onArrayEnd), onLiteralValue = toOneArgVisitWithPath(visitor.onLiteralValue), onSeparator = toOneArgVisit(visitor.onSeparator), onComment = toNoArgVisit(visitor.onComment), onError = toOneArgVisit(visitor.onError);\n            const disallowComments = options && options.disallowComments;\n            const allowTrailingComma = options && options.allowTrailingComma;\n            function scanNext() {\n                while(true){\n                    const token = _scanner.scan();\n                    switch(_scanner.getTokenError()){\n                        case 4:\n                            handleError(14);\n                            break;\n                        case 5:\n                            handleError(15);\n                            break;\n                        case 3:\n                            handleError(13);\n                            break;\n                        case 1:\n                            if (!disallowComments) handleError(11);\n                            break;\n                        case 2:\n                            handleError(12);\n                            break;\n                        case 6:\n                            handleError(16);\n                            break;\n                    }\n                    switch(token){\n                        case 12:\n                        case 13:\n                            if (disallowComments) handleError(10);\n                            else onComment();\n                            break;\n                        case 16:\n                            handleError(1);\n                            break;\n                        case 15:\n                        case 14:\n                            break;\n                        default:\n                            return token;\n                    }\n                }\n            }\n            function handleError(error, skipUntilAfter = [], skipUntil = []) {\n                onError(error);\n                if (skipUntilAfter.length + skipUntil.length > 0) {\n                    let token = _scanner.getToken();\n                    while(17 !== token){\n                        if (-1 !== skipUntilAfter.indexOf(token)) {\n                            scanNext();\n                            break;\n                        }\n                        if (-1 !== skipUntil.indexOf(token)) break;\n                        token = scanNext();\n                    }\n                }\n            }\n            function parseString(isValue) {\n                const value = _scanner.getTokenValue();\n                if (isValue) onLiteralValue(value);\n                else {\n                    onObjectProperty(value);\n                    _jsonPath.push(value);\n                }\n                scanNext();\n                return true;\n            }\n            function parseLiteral() {\n                switch(_scanner.getToken()){\n                    case 11:\n                        const tokenValue = _scanner.getTokenValue();\n                        let value = Number(tokenValue);\n                        if (isNaN(value)) {\n                            handleError(2);\n                            value = 0;\n                        }\n                        onLiteralValue(value);\n                        break;\n                    case 7:\n                        onLiteralValue(null);\n                        break;\n                    case 8:\n                        onLiteralValue(true);\n                        break;\n                    case 9:\n                        onLiteralValue(false);\n                        break;\n                    default:\n                        return false;\n                }\n                scanNext();\n                return true;\n            }\n            function parseProperty() {\n                if (10 !== _scanner.getToken()) {\n                    handleError(3, [], [\n                        2,\n                        5\n                    ]);\n                    return false;\n                }\n                parseString(false);\n                if (6 === _scanner.getToken()) {\n                    onSeparator(':');\n                    scanNext();\n                    if (!parseValue()) handleError(4, [], [\n                        2,\n                        5\n                    ]);\n                } else handleError(5, [], [\n                    2,\n                    5\n                ]);\n                _jsonPath.pop();\n                return true;\n            }\n            function parseObject() {\n                onObjectBegin();\n                scanNext();\n                let needsComma = false;\n                while(2 !== _scanner.getToken() && 17 !== _scanner.getToken()){\n                    if (5 === _scanner.getToken()) {\n                        if (!needsComma) handleError(4, [], []);\n                        onSeparator(',');\n                        scanNext();\n                        if (2 === _scanner.getToken() && allowTrailingComma) break;\n                    } else if (needsComma) handleError(6, [], []);\n                    if (!parseProperty()) handleError(4, [], [\n                        2,\n                        5\n                    ]);\n                    needsComma = true;\n                }\n                onObjectEnd();\n                if (2 !== _scanner.getToken()) handleError(7, [\n                    2\n                ], []);\n                else scanNext();\n                return true;\n            }\n            function parseArray() {\n                onArrayBegin();\n                scanNext();\n                let isFirstElement = true;\n                let needsComma = false;\n                while(4 !== _scanner.getToken() && 17 !== _scanner.getToken()){\n                    if (5 === _scanner.getToken()) {\n                        if (!needsComma) handleError(4, [], []);\n                        onSeparator(',');\n                        scanNext();\n                        if (4 === _scanner.getToken() && allowTrailingComma) break;\n                    } else if (needsComma) handleError(6, [], []);\n                    if (isFirstElement) {\n                        _jsonPath.push(0);\n                        isFirstElement = false;\n                    } else _jsonPath[_jsonPath.length - 1]++;\n                    if (!parseValue()) handleError(4, [], [\n                        4,\n                        5\n                    ]);\n                    needsComma = true;\n                }\n                onArrayEnd();\n                if (!isFirstElement) _jsonPath.pop();\n                if (4 !== _scanner.getToken()) handleError(8, [\n                    4\n                ], []);\n                else scanNext();\n                return true;\n            }\n            function parseValue() {\n                switch(_scanner.getToken()){\n                    case 3:\n                        return parseArray();\n                    case 1:\n                        return parseObject();\n                    case 10:\n                        return parseString(true);\n                    default:\n                        return parseLiteral();\n                }\n            }\n            scanNext();\n            if (17 === _scanner.getToken()) {\n                if (options.allowEmptyContent) return true;\n                handleError(4, [], []);\n                return false;\n            }\n            if (!parseValue()) {\n                handleError(4, [], []);\n                return false;\n            }\n            if (17 !== _scanner.getToken()) handleError(9, [], []);\n            return true;\n        }\n        function stripComments(text, replaceCh) {\n            let _scanner = (0, _scanner__rspack_import_0.z)(text), parts = [], kind, offset = 0, pos;\n            do {\n                pos = _scanner.getPosition();\n                kind = _scanner.scan();\n                switch(kind){\n                    case 12:\n                    case 13:\n                    case 17:\n                        if (offset !== pos) parts.push(text.substring(offset, pos));\n                        if (void 0 !== replaceCh) parts.push(_scanner.getTokenValue().replace(/[^\\r\\n]/g, replaceCh));\n                        offset = _scanner.getPosition();\n                        break;\n                }\n            }while (17 !== kind)\n            return parts.join('');\n        }\n        function getNodeType(value) {\n            switch(typeof value){\n                case 'boolean':\n                    return 'boolean';\n                case 'number':\n                    return 'number';\n                case 'string':\n                    return 'string';\n                case 'object':\n                    if (!value) return 'null';\n                    if (Array.isArray(value)) return 'array';\n                    return 'object';\n                default:\n                    return 'null';\n            }\n        }\n    },\n    650 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            z: ()=>createScanner\n        });\n        function createScanner(text, ignoreTrivia = false) {\n            const len = text.length;\n            let pos = 0, value = '', tokenOffset = 0, token = 16, lineNumber = 0, lineStartOffset = 0, tokenLineStartOffset = 0, prevTokenLineStartOffset = 0, scanError = 0;\n            function scanHexDigits(count, exact) {\n                let digits = 0;\n                let value = 0;\n                while(digits < count || !exact){\n                    let ch = text.charCodeAt(pos);\n                    if (ch >= 48 && ch <= 57) value = 16 * value + ch - 48;\n                    else if (ch >= 65 && ch <= 70) value = 16 * value + ch - 65 + 10;\n                    else if (ch >= 97 && ch <= 102) value = 16 * value + ch - 97 + 10;\n                    else break;\n                    pos++;\n                    digits++;\n                }\n                if (digits < count) value = -1;\n                return value;\n            }\n            function setPosition(newPosition) {\n                pos = newPosition;\n                value = '';\n                tokenOffset = 0;\n                token = 16;\n                scanError = 0;\n            }\n            function scanNumber() {\n                let start = pos;\n                if (48 === text.charCodeAt(pos)) pos++;\n                else {\n                    pos++;\n                    while(pos < text.length && isDigit(text.charCodeAt(pos)))pos++;\n                }\n                if (pos < text.length && 46 === text.charCodeAt(pos)) {\n                    pos++;\n                    if (pos < text.length && isDigit(text.charCodeAt(pos))) {\n                        pos++;\n                        while(pos < text.length && isDigit(text.charCodeAt(pos)))pos++;\n                    } else {\n                        scanError = 3;\n                        return text.substring(start, pos);\n                    }\n                }\n                let end = pos;\n                if (pos < text.length && (69 === text.charCodeAt(pos) || 101 === text.charCodeAt(pos))) {\n                    pos++;\n                    if (pos < text.length && 43 === text.charCodeAt(pos) || 45 === text.charCodeAt(pos)) pos++;\n                    if (pos < text.length && isDigit(text.charCodeAt(pos))) {\n                        pos++;\n                        while(pos < text.length && isDigit(text.charCodeAt(pos)))pos++;\n                        end = pos;\n                    } else scanError = 3;\n                }\n                return text.substring(start, end);\n            }\n            function scanString() {\n                let result = '', start = pos;\n                while(true){\n                    if (pos >= len) {\n                        result += text.substring(start, pos);\n                        scanError = 2;\n                        break;\n                    }\n                    const ch = text.charCodeAt(pos);\n                    if (34 === ch) {\n                        result += text.substring(start, pos);\n                        pos++;\n                        break;\n                    }\n                    if (92 === ch) {\n                        result += text.substring(start, pos);\n                        pos++;\n                        if (pos >= len) {\n                            scanError = 2;\n                            break;\n                        }\n                        const ch2 = text.charCodeAt(pos++);\n                        switch(ch2){\n                            case 34:\n                                result += '\\\"';\n                                break;\n                            case 92:\n                                result += '\\\\';\n                                break;\n                            case 47:\n                                result += '/';\n                                break;\n                            case 98:\n                                result += '\\b';\n                                break;\n                            case 102:\n                                result += '\\f';\n                                break;\n                            case 110:\n                                result += '\\n';\n                                break;\n                            case 114:\n                                result += '\\r';\n                                break;\n                            case 116:\n                                result += '\\t';\n                                break;\n                            case 117:\n                                const ch3 = scanHexDigits(4, true);\n                                if (ch3 >= 0) result += String.fromCharCode(ch3);\n                                else scanError = 4;\n                                break;\n                            default:\n                                scanError = 5;\n                        }\n                        start = pos;\n                        continue;\n                    }\n                    if (ch >= 0 && ch <= 0x1f) if (isLineBreak(ch)) {\n                        result += text.substring(start, pos);\n                        scanError = 2;\n                        break;\n                    } else scanError = 6;\n                    pos++;\n                }\n                return result;\n            }\n            function scanNext() {\n                value = '';\n                scanError = 0;\n                tokenOffset = pos;\n                lineStartOffset = lineNumber;\n                prevTokenLineStartOffset = tokenLineStartOffset;\n                if (pos >= len) {\n                    tokenOffset = len;\n                    return token = 17;\n                }\n                let code = text.charCodeAt(pos);\n                if (isWhiteSpace(code)) {\n                    do {\n                        pos++;\n                        value += String.fromCharCode(code);\n                        code = text.charCodeAt(pos);\n                    }while (isWhiteSpace(code))\n                    return token = 15;\n                }\n                if (isLineBreak(code)) {\n                    pos++;\n                    value += String.fromCharCode(code);\n                    if (13 === code && 10 === text.charCodeAt(pos)) {\n                        pos++;\n                        value += '\\n';\n                    }\n                    lineNumber++;\n                    tokenLineStartOffset = pos;\n                    return token = 14;\n                }\n                switch(code){\n                    case 123:\n                        pos++;\n                        return token = 1;\n                    case 125:\n                        pos++;\n                        return token = 2;\n                    case 91:\n                        pos++;\n                        return token = 3;\n                    case 93:\n                        pos++;\n                        return token = 4;\n                    case 58:\n                        pos++;\n                        return token = 6;\n                    case 44:\n                        pos++;\n                        return token = 5;\n                    case 34:\n                        pos++;\n                        value = scanString();\n                        return token = 10;\n                    case 47:\n                        const start = pos - 1;\n                        if (47 === text.charCodeAt(pos + 1)) {\n                            pos += 2;\n                            while(pos < len){\n                                if (isLineBreak(text.charCodeAt(pos))) break;\n                                pos++;\n                            }\n                            value = text.substring(start, pos);\n                            return token = 12;\n                        }\n                        if (42 === text.charCodeAt(pos + 1)) {\n                            pos += 2;\n                            const safeLength = len - 1;\n                            let commentClosed = false;\n                            while(pos < safeLength){\n                                const ch = text.charCodeAt(pos);\n                                if (42 === ch && 47 === text.charCodeAt(pos + 1)) {\n                                    pos += 2;\n                                    commentClosed = true;\n                                    break;\n                                }\n                                pos++;\n                                if (isLineBreak(ch)) {\n                                    if (13 === ch && 10 === text.charCodeAt(pos)) pos++;\n                                    lineNumber++;\n                                    tokenLineStartOffset = pos;\n                                }\n                            }\n                            if (!commentClosed) {\n                                pos++;\n                                scanError = 1;\n                            }\n                            value = text.substring(start, pos);\n                            return token = 13;\n                        }\n                        value += String.fromCharCode(code);\n                        pos++;\n                        return token = 16;\n                    case 45:\n                        value += String.fromCharCode(code);\n                        pos++;\n                        if (pos === len || !isDigit(text.charCodeAt(pos))) return token = 16;\n                    case 48:\n                    case 49:\n                    case 50:\n                    case 51:\n                    case 52:\n                    case 53:\n                    case 54:\n                    case 55:\n                    case 56:\n                    case 57:\n                        value += scanNumber();\n                        return token = 11;\n                    default:\n                        while(pos < len && isUnknownContentCharacter(code)){\n                            pos++;\n                            code = text.charCodeAt(pos);\n                        }\n                        if (tokenOffset !== pos) {\n                            value = text.substring(tokenOffset, pos);\n                            switch(value){\n                                case 'true':\n                                    return token = 8;\n                                case 'false':\n                                    return token = 9;\n                                case 'null':\n                                    return token = 7;\n                            }\n                            return token = 16;\n                        }\n                        value += String.fromCharCode(code);\n                        pos++;\n                        return token = 16;\n                }\n            }\n            function isUnknownContentCharacter(code) {\n                if (isWhiteSpace(code) || isLineBreak(code)) return false;\n                switch(code){\n                    case 125:\n                    case 93:\n                    case 123:\n                    case 91:\n                    case 34:\n                    case 58:\n                    case 44:\n                    case 47:\n                        return false;\n                }\n                return true;\n            }\n            function scanNextNonTrivia() {\n                let result;\n                do result = scanNext();\n                while (result >= 12 && result <= 15)\n                return result;\n            }\n            return {\n                setPosition: setPosition,\n                getPosition: ()=>pos,\n                scan: ignoreTrivia ? scanNextNonTrivia : scanNext,\n                getToken: ()=>token,\n                getTokenValue: ()=>value,\n                getTokenOffset: ()=>tokenOffset,\n                getTokenLength: ()=>pos - tokenOffset,\n                getTokenStartLine: ()=>lineStartOffset,\n                getTokenStartCharacter: ()=>tokenOffset - prevTokenLineStartOffset,\n                getTokenError: ()=>scanError\n            };\n        }\n        function isWhiteSpace(ch) {\n            return 32 === ch || 9 === ch;\n        }\n        function isLineBreak(ch) {\n            return 10 === ch || 13 === ch;\n        }\n        function isDigit(ch) {\n            return ch >= 48 && ch <= 57;\n        }\n        var CharacterCodes;\n        (function(CharacterCodes) {\n            CharacterCodes[CharacterCodes[\"lineFeed\"] = 10] = \"lineFeed\";\n            CharacterCodes[CharacterCodes[\"carriageReturn\"] = 13] = \"carriageReturn\";\n            CharacterCodes[CharacterCodes[\"space\"] = 32] = \"space\";\n            CharacterCodes[CharacterCodes[\"_0\"] = 48] = \"_0\";\n            CharacterCodes[CharacterCodes[\"_1\"] = 49] = \"_1\";\n            CharacterCodes[CharacterCodes[\"_2\"] = 50] = \"_2\";\n            CharacterCodes[CharacterCodes[\"_3\"] = 51] = \"_3\";\n            CharacterCodes[CharacterCodes[\"_4\"] = 52] = \"_4\";\n            CharacterCodes[CharacterCodes[\"_5\"] = 53] = \"_5\";\n            CharacterCodes[CharacterCodes[\"_6\"] = 54] = \"_6\";\n            CharacterCodes[CharacterCodes[\"_7\"] = 55] = \"_7\";\n            CharacterCodes[CharacterCodes[\"_8\"] = 56] = \"_8\";\n            CharacterCodes[CharacterCodes[\"_9\"] = 57] = \"_9\";\n            CharacterCodes[CharacterCodes[\"a\"] = 97] = \"a\";\n            CharacterCodes[CharacterCodes[\"b\"] = 98] = \"b\";\n            CharacterCodes[CharacterCodes[\"c\"] = 99] = \"c\";\n            CharacterCodes[CharacterCodes[\"d\"] = 100] = \"d\";\n            CharacterCodes[CharacterCodes[\"e\"] = 101] = \"e\";\n            CharacterCodes[CharacterCodes[\"f\"] = 102] = \"f\";\n            CharacterCodes[CharacterCodes[\"g\"] = 103] = \"g\";\n            CharacterCodes[CharacterCodes[\"h\"] = 104] = \"h\";\n            CharacterCodes[CharacterCodes[\"i\"] = 105] = \"i\";\n            CharacterCodes[CharacterCodes[\"j\"] = 106] = \"j\";\n            CharacterCodes[CharacterCodes[\"k\"] = 107] = \"k\";\n            CharacterCodes[CharacterCodes[\"l\"] = 108] = \"l\";\n            CharacterCodes[CharacterCodes[\"m\"] = 109] = \"m\";\n            CharacterCodes[CharacterCodes[\"n\"] = 110] = \"n\";\n            CharacterCodes[CharacterCodes[\"o\"] = 111] = \"o\";\n            CharacterCodes[CharacterCodes[\"p\"] = 112] = \"p\";\n            CharacterCodes[CharacterCodes[\"q\"] = 113] = \"q\";\n            CharacterCodes[CharacterCodes[\"r\"] = 114] = \"r\";\n            CharacterCodes[CharacterCodes[\"s\"] = 115] = \"s\";\n            CharacterCodes[CharacterCodes[\"t\"] = 116] = \"t\";\n            CharacterCodes[CharacterCodes[\"u\"] = 117] = \"u\";\n            CharacterCodes[CharacterCodes[\"v\"] = 118] = \"v\";\n            CharacterCodes[CharacterCodes[\"w\"] = 119] = \"w\";\n            CharacterCodes[CharacterCodes[\"x\"] = 120] = \"x\";\n            CharacterCodes[CharacterCodes[\"y\"] = 121] = \"y\";\n            CharacterCodes[CharacterCodes[\"z\"] = 122] = \"z\";\n            CharacterCodes[CharacterCodes[\"A\"] = 65] = \"A\";\n            CharacterCodes[CharacterCodes[\"B\"] = 66] = \"B\";\n            CharacterCodes[CharacterCodes[\"C\"] = 67] = \"C\";\n            CharacterCodes[CharacterCodes[\"D\"] = 68] = \"D\";\n            CharacterCodes[CharacterCodes[\"E\"] = 69] = \"E\";\n            CharacterCodes[CharacterCodes[\"F\"] = 70] = \"F\";\n            CharacterCodes[CharacterCodes[\"G\"] = 71] = \"G\";\n            CharacterCodes[CharacterCodes[\"H\"] = 72] = \"H\";\n            CharacterCodes[CharacterCodes[\"I\"] = 73] = \"I\";\n            CharacterCodes[CharacterCodes[\"J\"] = 74] = \"J\";\n            CharacterCodes[CharacterCodes[\"K\"] = 75] = \"K\";\n            CharacterCodes[CharacterCodes[\"L\"] = 76] = \"L\";\n            CharacterCodes[CharacterCodes[\"M\"] = 77] = \"M\";\n            CharacterCodes[CharacterCodes[\"N\"] = 78] = \"N\";\n            CharacterCodes[CharacterCodes[\"O\"] = 79] = \"O\";\n            CharacterCodes[CharacterCodes[\"P\"] = 80] = \"P\";\n            CharacterCodes[CharacterCodes[\"Q\"] = 81] = \"Q\";\n            CharacterCodes[CharacterCodes[\"R\"] = 82] = \"R\";\n            CharacterCodes[CharacterCodes[\"S\"] = 83] = \"S\";\n            CharacterCodes[CharacterCodes[\"T\"] = 84] = \"T\";\n            CharacterCodes[CharacterCodes[\"U\"] = 85] = \"U\";\n            CharacterCodes[CharacterCodes[\"V\"] = 86] = \"V\";\n            CharacterCodes[CharacterCodes[\"W\"] = 87] = \"W\";\n            CharacterCodes[CharacterCodes[\"X\"] = 88] = \"X\";\n            CharacterCodes[CharacterCodes[\"Y\"] = 89] = \"Y\";\n            CharacterCodes[CharacterCodes[\"Z\"] = 90] = \"Z\";\n            CharacterCodes[CharacterCodes[\"asterisk\"] = 42] = \"asterisk\";\n            CharacterCodes[CharacterCodes[\"backslash\"] = 92] = \"backslash\";\n            CharacterCodes[CharacterCodes[\"closeBrace\"] = 125] = \"closeBrace\";\n            CharacterCodes[CharacterCodes[\"closeBracket\"] = 93] = \"closeBracket\";\n            CharacterCodes[CharacterCodes[\"colon\"] = 58] = \"colon\";\n            CharacterCodes[CharacterCodes[\"comma\"] = 44] = \"comma\";\n            CharacterCodes[CharacterCodes[\"dot\"] = 46] = \"dot\";\n            CharacterCodes[CharacterCodes[\"doubleQuote\"] = 34] = \"doubleQuote\";\n            CharacterCodes[CharacterCodes[\"minus\"] = 45] = \"minus\";\n            CharacterCodes[CharacterCodes[\"openBrace\"] = 123] = \"openBrace\";\n            CharacterCodes[CharacterCodes[\"openBracket\"] = 91] = \"openBracket\";\n            CharacterCodes[CharacterCodes[\"plus\"] = 43] = \"plus\";\n            CharacterCodes[CharacterCodes[\"slash\"] = 47] = \"slash\";\n            CharacterCodes[CharacterCodes[\"formFeed\"] = 12] = \"formFeed\";\n            CharacterCodes[CharacterCodes[\"tab\"] = 9] = \"tab\";\n        })(CharacterCodes || (CharacterCodes = {}));\n    },\n    316 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            QR: ()=>cachedSpaces,\n            mX: ()=>cachedBreakLinesWithSpaces,\n            wf: ()=>supportedEols\n        });\n        const cachedSpaces = new Array(20).fill(0).map((_, index)=>' '.repeat(index));\n        const maxCachedValues = 200;\n        const cachedBreakLinesWithSpaces = {\n            ' ': {\n                '\\n': new Array(maxCachedValues).fill(0).map((_, index)=>'\\n' + ' '.repeat(index)),\n                '\\r': new Array(maxCachedValues).fill(0).map((_, index)=>'\\r' + ' '.repeat(index)),\n                '\\r\\n': new Array(maxCachedValues).fill(0).map((_, index)=>'\\r\\n' + ' '.repeat(index))\n            },\n            '\\t': {\n                '\\n': new Array(maxCachedValues).fill(0).map((_, index)=>'\\n' + '\\t'.repeat(index)),\n                '\\r': new Array(maxCachedValues).fill(0).map((_, index)=>'\\r' + '\\t'.repeat(index)),\n                '\\r\\n': new Array(maxCachedValues).fill(0).map((_, index)=>'\\r\\n' + '\\t'.repeat(index))\n            }\n        };\n        const supportedEols = [\n            '\\n',\n            '\\r',\n            '\\r\\n'\n        ];\n    },\n    508 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            GP: ()=>format,\n            SM: ()=>findNodeAtOffset,\n            a6: ()=>SyntaxKind,\n            sC: ()=>ScanError,\n            z1: ()=>createScanner\n        });\n        var _impl_format__rspack_import_0 = __webpack_require__(97);\n        __webpack_require__(190);\n        var _impl_scanner__rspack_import_2 = __webpack_require__(650);\n        var _impl_parser__rspack_import_3 = __webpack_require__(809);\n        const createScanner = _impl_scanner__rspack_import_2.z;\n        var ScanError;\n        (function(ScanError) {\n            ScanError[ScanError[\"None\"] = 0] = \"None\";\n            ScanError[ScanError[\"UnexpectedEndOfComment\"] = 1] = \"UnexpectedEndOfComment\";\n            ScanError[ScanError[\"UnexpectedEndOfString\"] = 2] = \"UnexpectedEndOfString\";\n            ScanError[ScanError[\"UnexpectedEndOfNumber\"] = 3] = \"UnexpectedEndOfNumber\";\n            ScanError[ScanError[\"InvalidUnicode\"] = 4] = \"InvalidUnicode\";\n            ScanError[ScanError[\"InvalidEscapeCharacter\"] = 5] = \"InvalidEscapeCharacter\";\n            ScanError[ScanError[\"InvalidCharacter\"] = 6] = \"InvalidCharacter\";\n        })(ScanError || (ScanError = {}));\n        var SyntaxKind;\n        (function(SyntaxKind) {\n            SyntaxKind[SyntaxKind[\"OpenBraceToken\"] = 1] = \"OpenBraceToken\";\n            SyntaxKind[SyntaxKind[\"CloseBraceToken\"] = 2] = \"CloseBraceToken\";\n            SyntaxKind[SyntaxKind[\"OpenBracketToken\"] = 3] = \"OpenBracketToken\";\n            SyntaxKind[SyntaxKind[\"CloseBracketToken\"] = 4] = \"CloseBracketToken\";\n            SyntaxKind[SyntaxKind[\"CommaToken\"] = 5] = \"CommaToken\";\n            SyntaxKind[SyntaxKind[\"ColonToken\"] = 6] = \"ColonToken\";\n            SyntaxKind[SyntaxKind[\"NullKeyword\"] = 7] = \"NullKeyword\";\n            SyntaxKind[SyntaxKind[\"TrueKeyword\"] = 8] = \"TrueKeyword\";\n            SyntaxKind[SyntaxKind[\"FalseKeyword\"] = 9] = \"FalseKeyword\";\n            SyntaxKind[SyntaxKind[\"StringLiteral\"] = 10] = \"StringLiteral\";\n            SyntaxKind[SyntaxKind[\"NumericLiteral\"] = 11] = \"NumericLiteral\";\n            SyntaxKind[SyntaxKind[\"LineCommentTrivia\"] = 12] = \"LineCommentTrivia\";\n            SyntaxKind[SyntaxKind[\"BlockCommentTrivia\"] = 13] = \"BlockCommentTrivia\";\n            SyntaxKind[SyntaxKind[\"LineBreakTrivia\"] = 14] = \"LineBreakTrivia\";\n            SyntaxKind[SyntaxKind[\"Trivia\"] = 15] = \"Trivia\";\n            SyntaxKind[SyntaxKind[\"Unknown\"] = 16] = \"Unknown\";\n            SyntaxKind[SyntaxKind[\"EOF\"] = 17] = \"EOF\";\n        })(SyntaxKind || (SyntaxKind = {}));\n        _impl_parser__rspack_import_3.g$;\n        _impl_parser__rspack_import_3.qg;\n        _impl_parser__rspack_import_3.cZ;\n        _impl_parser__rspack_import_3.Wc;\n        const findNodeAtOffset = _impl_parser__rspack_import_3.SM;\n        _impl_parser__rspack_import_3.eY;\n        _impl_parser__rspack_import_3.yQ;\n        _impl_parser__rspack_import_3.YR;\n        _impl_parser__rspack_import_3.nY;\n        var ParseErrorCode;\n        (function(ParseErrorCode) {\n            ParseErrorCode[ParseErrorCode[\"InvalidSymbol\"] = 1] = \"InvalidSymbol\";\n            ParseErrorCode[ParseErrorCode[\"InvalidNumberFormat\"] = 2] = \"InvalidNumberFormat\";\n            ParseErrorCode[ParseErrorCode[\"PropertyNameExpected\"] = 3] = \"PropertyNameExpected\";\n            ParseErrorCode[ParseErrorCode[\"ValueExpected\"] = 4] = \"ValueExpected\";\n            ParseErrorCode[ParseErrorCode[\"ColonExpected\"] = 5] = \"ColonExpected\";\n            ParseErrorCode[ParseErrorCode[\"CommaExpected\"] = 6] = \"CommaExpected\";\n            ParseErrorCode[ParseErrorCode[\"CloseBraceExpected\"] = 7] = \"CloseBraceExpected\";\n            ParseErrorCode[ParseErrorCode[\"CloseBracketExpected\"] = 8] = \"CloseBracketExpected\";\n            ParseErrorCode[ParseErrorCode[\"EndOfFileExpected\"] = 9] = \"EndOfFileExpected\";\n            ParseErrorCode[ParseErrorCode[\"InvalidCommentToken\"] = 10] = \"InvalidCommentToken\";\n            ParseErrorCode[ParseErrorCode[\"UnexpectedEndOfComment\"] = 11] = \"UnexpectedEndOfComment\";\n            ParseErrorCode[ParseErrorCode[\"UnexpectedEndOfString\"] = 12] = \"UnexpectedEndOfString\";\n            ParseErrorCode[ParseErrorCode[\"UnexpectedEndOfNumber\"] = 13] = \"UnexpectedEndOfNumber\";\n            ParseErrorCode[ParseErrorCode[\"InvalidUnicode\"] = 14] = \"InvalidUnicode\";\n            ParseErrorCode[ParseErrorCode[\"InvalidEscapeCharacter\"] = 15] = \"InvalidEscapeCharacter\";\n            ParseErrorCode[ParseErrorCode[\"InvalidCharacter\"] = 16] = \"InvalidCharacter\";\n        })(ParseErrorCode || (ParseErrorCode = {}));\n        function format(documentText, range, options) {\n            return _impl_format__rspack_import_0.G(documentText, range, options);\n        }\n    },\n    78 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            _: ()=>getJsonWorkerManager\n        });\n        function getJsonWorkerManager() {\n            throw new Error(\"Nested JsonViewer Worker is not supported\");\n        }\n    },\n    830 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            E: ()=>isInWorkerThread\n        });\n        function isInWorkerThread() {\n            return true;\n        }\n    },\n    241 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            u: ()=>getCurrentNameSpaceId\n        });\n        let currentNameSpaceId = 'default';\n        function getCurrentNameSpaceId() {\n            return currentNameSpaceId;\n        }\n    },\n    626 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            V: ()=>CharacterClassifier\n        });\n        var _uint__rspack_import_0 = __webpack_require__(298);\n        class CharacterClassifier {\n            _asciiMap;\n            _map;\n            _defaultValue;\n            constructor(_defaultValue){\n                const defaultValue = (0, _uint__rspack_import_0.W_)(_defaultValue);\n                this._defaultValue = defaultValue;\n                this._asciiMap = CharacterClassifier._createAsciiMap(defaultValue);\n                this._map = new Map();\n            }\n            static _createAsciiMap(defaultValue) {\n                const asciiMap = new Uint8Array(256);\n                asciiMap.fill(defaultValue);\n                return asciiMap;\n            }\n            set(charCode, _value) {\n                const value = (0, _uint__rspack_import_0.W_)(_value);\n                if (charCode >= 0 && charCode < 256) this._asciiMap[charCode] = value;\n                else this._map.set(charCode, value);\n            }\n            get(charCode) {\n                if (charCode >= 0 && charCode < 256) return this._asciiMap[charCode];\n                return this._map.get(charCode) || this._defaultValue;\n            }\n            clear() {\n                this._asciiMap.fill(this._defaultValue);\n                this._map.clear();\n            }\n        }\n    },\n    538 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            dB: ()=>getEmitter\n        });\n        var _nameSpace__rspack_import_0 = __webpack_require__(241);\n        const emitterMap = new Map();\n        class Emitter {\n            listeners = {};\n            on(event, listener) {\n                if (!this.listeners[event]) this.listeners[event] = [];\n                this.listeners[event]?.push(listener);\n            }\n            off(event, listener) {\n                if (!this.listeners[event]) return;\n                this.listeners[event] = this.listeners[event]?.filter((l)=>l !== listener);\n            }\n            dispose() {\n                this.listeners = {};\n            }\n            removeAllListeners() {\n                this.listeners = {};\n            }\n            emit(event, data) {\n                if (!this.listeners[event]) return;\n                for (const listener of this.listeners[event])listener(data);\n            }\n        }\n        const getEmitter = ()=>{\n            const currentNameSpaceId = (0, _nameSpace__rspack_import_0.u)();\n            if (!currentNameSpaceId) throw new Error('currentNameSpaceId is not set');\n            let emitter = emitterMap.get(currentNameSpaceId);\n            if (!emitter) {\n                emitter = new Emitter();\n                emitterMap.set(currentNameSpaceId, emitter);\n            }\n            return emitter;\n        };\n    },\n    269 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            qK: ()=>LRUCache\n        });\n        function _to_primitive(input, hint) {\n            if (\"object\" !== _type_of(input) || null === input) return input;\n            var prim = input[Symbol.toPrimitive];\n            if (void 0 !== prim) {\n                var res = prim.call(input, hint || \"default\");\n                if (\"object\" !== _type_of(res)) return res;\n                throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n            }\n            return (\"string\" === hint ? String : Number)(input);\n        }\n        function _to_property_key(arg) {\n            var key = _to_primitive(arg, \"string\");\n            return \"symbol\" === _type_of(key) ? key : String(key);\n        }\n        function _type_of(obj) {\n            return obj && \"u\" > typeof Symbol && obj.constructor === Symbol ? \"symbol\" : typeof obj;\n        }\n        let _computedKey, _computedKey1;\n        _computedKey = _to_property_key(Symbol.toStringTag), _computedKey1 = _to_property_key(Symbol.iterator);\n        class LinkedMap {\n            [_computedKey] = 'LinkedMap';\n            _map;\n            _head;\n            _tail;\n            _size;\n            _state;\n            constructor(){\n                this._map = new Map();\n                this._head = void 0;\n                this._tail = void 0;\n                this._size = 0;\n                this._state = 0;\n            }\n            clear() {\n                this._map.clear();\n                this._head = void 0;\n                this._tail = void 0;\n                this._size = 0;\n                this._state++;\n            }\n            isEmpty() {\n                return !this._head && !this._tail;\n            }\n            get size() {\n                return this._size;\n            }\n            get first() {\n                return this._head?.value;\n            }\n            get last() {\n                return this._tail?.value;\n            }\n            has(key) {\n                return this._map.has(key);\n            }\n            get(key, touch = 0) {\n                const item = this._map.get(key);\n                if (!item) return;\n                if (0 !== touch) this.touch(item, touch);\n                return item.value;\n            }\n            set(key, value, touch = 0) {\n                let item = this._map.get(key);\n                if (item) {\n                    item.value = value;\n                    if (0 !== touch) this.touch(item, touch);\n                } else {\n                    item = {\n                        key,\n                        value,\n                        next: void 0,\n                        previous: void 0\n                    };\n                    switch(touch){\n                        case 0:\n                            this.addItemLast(item);\n                            break;\n                        case 1:\n                            this.addItemFirst(item);\n                            break;\n                        case 2:\n                            this.addItemLast(item);\n                            break;\n                        default:\n                            this.addItemLast(item);\n                            break;\n                    }\n                    this._map.set(key, item);\n                    this._size++;\n                }\n                return this;\n            }\n            delete(key) {\n                return !!this.remove(key);\n            }\n            remove(key) {\n                const item = this._map.get(key);\n                if (!item) return;\n                this._map.delete(key);\n                this.removeItem(item);\n                this._size--;\n                return item.value;\n            }\n            shift() {\n                if (!this._head && !this._tail) return;\n                if (!this._head || !this._tail) throw new Error('Invalid list');\n                const item = this._head;\n                this._map.delete(item.key);\n                this.removeItem(item);\n                this._size--;\n                return item.value;\n            }\n            forEach(callbackfn, thisArg) {\n                const state = this._state;\n                let current = this._head;\n                while(current){\n                    if (thisArg) callbackfn.bind(thisArg)(current.value, current.key, this);\n                    else callbackfn(current.value, current.key, this);\n                    if (this._state !== state) throw new Error(\"LinkedMap got modified during iteration.\");\n                    current = current.next;\n                }\n            }\n            keys() {\n                const map = this;\n                const state = this._state;\n                let current = this._head;\n                const iterator = {\n                    [Symbol.iterator] () {\n                        return iterator;\n                    },\n                    next () {\n                        if (map._state !== state) throw new Error(\"LinkedMap got modified during iteration.\");\n                        if (!current) return {\n                            value: void 0,\n                            done: true\n                        };\n                        {\n                            const result = {\n                                value: current.key,\n                                done: false\n                            };\n                            current = current.next;\n                            return result;\n                        }\n                    }\n                };\n                return iterator;\n            }\n            values() {\n                const map = this;\n                const state = this._state;\n                let current = this._head;\n                const iterator = {\n                    [Symbol.iterator] () {\n                        return iterator;\n                    },\n                    next () {\n                        if (map._state !== state) throw new Error(\"LinkedMap got modified during iteration.\");\n                        if (!current) return {\n                            value: void 0,\n                            done: true\n                        };\n                        {\n                            const result = {\n                                value: current.value,\n                                done: false\n                            };\n                            current = current.next;\n                            return result;\n                        }\n                    }\n                };\n                return iterator;\n            }\n            entries() {\n                const map = this;\n                const state = this._state;\n                let current = this._head;\n                const iterator = {\n                    [Symbol.iterator] () {\n                        return iterator;\n                    },\n                    next () {\n                        if (map._state !== state) throw new Error(\"LinkedMap got modified during iteration.\");\n                        if (!current) return {\n                            value: void 0,\n                            done: true\n                        };\n                        {\n                            const result = {\n                                value: [\n                                    current.key,\n                                    current.value\n                                ],\n                                done: false\n                            };\n                            current = current.next;\n                            return result;\n                        }\n                    }\n                };\n                return iterator;\n            }\n            [_computedKey1]() {\n                return this.entries();\n            }\n            trimOld(newSize) {\n                if (newSize >= this.size) return;\n                if (0 === newSize) return void this.clear();\n                let current = this._head;\n                let currentSize = this.size;\n                while(current && currentSize > newSize){\n                    this._map.delete(current.key);\n                    current = current.next;\n                    currentSize--;\n                }\n                this._head = current;\n                this._size = currentSize;\n                if (current) current.previous = void 0;\n                this._state++;\n            }\n            trimNew(newSize) {\n                if (newSize >= this.size) return;\n                if (0 === newSize) return void this.clear();\n                let current = this._tail;\n                let currentSize = this.size;\n                while(current && currentSize > newSize){\n                    this._map.delete(current.key);\n                    current = current.previous;\n                    currentSize--;\n                }\n                this._tail = current;\n                this._size = currentSize;\n                if (current) current.next = void 0;\n                this._state++;\n            }\n            addItemFirst(item) {\n                if (this._head || this._tail) if (this._head) {\n                    item.next = this._head;\n                    this._head.previous = item;\n                } else throw new Error('Invalid list');\n                else this._tail = item;\n                this._head = item;\n                this._state++;\n            }\n            addItemLast(item) {\n                if (this._head || this._tail) if (this._tail) {\n                    item.previous = this._tail;\n                    this._tail.next = item;\n                } else throw new Error('Invalid list');\n                else this._head = item;\n                this._tail = item;\n                this._state++;\n            }\n            removeItem(item) {\n                if (item === this._head && item === this._tail) {\n                    this._head = void 0;\n                    this._tail = void 0;\n                } else if (item === this._head) {\n                    if (!item.next) throw new Error('Invalid list');\n                    item.next.previous = void 0;\n                    this._head = item.next;\n                } else if (item === this._tail) {\n                    if (!item.previous) throw new Error('Invalid list');\n                    item.previous.next = void 0;\n                    this._tail = item.previous;\n                } else {\n                    const next = item.next;\n                    const previous = item.previous;\n                    if (!next || !previous) throw new Error('Invalid list');\n                    next.previous = previous;\n                    previous.next = next;\n                }\n                item.next = void 0;\n                item.previous = void 0;\n                this._state++;\n            }\n            touch(item, touch) {\n                if (!this._head || !this._tail) throw new Error('Invalid list');\n                if (1 !== touch && 2 !== touch) return;\n                if (1 === touch) {\n                    if (item === this._head) return;\n                    const next = item.next;\n                    const previous = item.previous;\n                    if (item === this._tail) {\n                        previous.next = void 0;\n                        this._tail = previous;\n                    } else {\n                        next.previous = previous;\n                        previous.next = next;\n                    }\n                    item.previous = void 0;\n                    item.next = this._head;\n                    this._head.previous = item;\n                    this._head = item;\n                    this._state++;\n                } else if (2 === touch) {\n                    if (item === this._tail) return;\n                    const next = item.next;\n                    const previous = item.previous;\n                    if (item === this._head) {\n                        next.previous = void 0;\n                        this._head = next;\n                    } else {\n                        next.previous = previous;\n                        previous.next = next;\n                    }\n                    item.next = void 0;\n                    item.previous = this._tail;\n                    this._tail.next = item;\n                    this._tail = item;\n                    this._state++;\n                }\n            }\n            toJSON() {\n                const data = [];\n                this.forEach((value, key)=>{\n                    data.push([\n                        key,\n                        value\n                    ]);\n                });\n                return data;\n            }\n            fromJSON(data) {\n                this.clear();\n                for (const [key, value] of data)this.set(key, value);\n            }\n        }\n        class Cache extends LinkedMap {\n            _limit;\n            _ratio;\n            constructor(limit, ratio = 1){\n                super();\n                this._limit = limit;\n                this._ratio = Math.min(Math.max(0, ratio), 1);\n            }\n            get limit() {\n                return this._limit;\n            }\n            set limit(limit) {\n                this._limit = limit;\n                this.checkTrim();\n            }\n            get ratio() {\n                return this._ratio;\n            }\n            set ratio(ratio) {\n                this._ratio = Math.min(Math.max(0, ratio), 1);\n                this.checkTrim();\n            }\n            get(key, touch = 2) {\n                return super.get(key, touch);\n            }\n            peek(key) {\n                return super.get(key, 0);\n            }\n            set(key, value) {\n                super.set(key, value, 2);\n                return this;\n            }\n            checkTrim() {\n                if (this.size > this._limit) this.trim(Math.round(this._limit * this._ratio));\n            }\n        }\n        class LRUCache extends Cache {\n            constructor(limit, ratio = 1){\n                super(limit, ratio);\n            }\n            trim(newSize) {\n                this.trimOld(newSize);\n            }\n            set(key, value) {\n                super.set(key, value);\n                this.checkTrim();\n                return this;\n            }\n        }\n    },\n    753 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            Dg: ()=>FindMatch,\n            L5: ()=>SearchData\n        });\n        class FindMatch {\n            _findMatchBrand = void 0;\n            range;\n            matches;\n            constructor(range, matches){\n                this.range = range;\n                this.matches = matches;\n            }\n        }\n        class SearchData {\n            regex;\n            wordSeparators;\n            simpleSearch;\n            constructor(regex, wordSeparators, simpleSearch){\n                this.regex = regex;\n                this.wordSeparators = wordSeparators;\n                this.simpleSearch = simpleSearch;\n            }\n        }\n    },\n    833 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            y: ()=>Position\n        });\n        class Position {\n            lineNumber;\n            column;\n            constructor(lineNumber, column){\n                this.lineNumber = lineNumber;\n                this.column = column;\n            }\n        }\n    },\n    49 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            Q: ()=>Range\n        });\n        var _position__rspack_import_0 = __webpack_require__(833);\n        class Range {\n            startLineNumber;\n            startColumn;\n            endLineNumber;\n            endColumn;\n            constructor(startLineNumber, startColumn, endLineNumber, endColumn){\n                if (startLineNumber > endLineNumber || startLineNumber === endLineNumber && startColumn > endColumn) {\n                    this.startLineNumber = endLineNumber;\n                    this.startColumn = endColumn;\n                    this.endLineNumber = startLineNumber;\n                    this.endColumn = startColumn;\n                } else {\n                    this.startLineNumber = startLineNumber;\n                    this.startColumn = startColumn;\n                    this.endLineNumber = endLineNumber;\n                    this.endColumn = endColumn;\n                }\n            }\n            static create(start, end) {\n                return new Range(start.lineNumber, start.column, end.lineNumber, end.column);\n            }\n            static areIntersecting(a, b) {\n                if (a.endLineNumber < b.startLineNumber || a.endLineNumber === b.startLineNumber && a.endColumn <= b.startColumn) return false;\n                if (b.endLineNumber < a.startLineNumber || b.endLineNumber === a.startLineNumber && b.endColumn <= a.startColumn) return false;\n                return true;\n            }\n            plusRange(range) {\n                return Range.plusRange(this, range);\n            }\n            static plusRange(a, b) {\n                let startLineNumber;\n                let startColumn;\n                let endLineNumber;\n                let endColumn;\n                if (b.startLineNumber < a.startLineNumber) {\n                    startLineNumber = b.startLineNumber;\n                    startColumn = b.startColumn;\n                } else if (b.startLineNumber === a.startLineNumber) {\n                    startLineNumber = b.startLineNumber;\n                    startColumn = Math.min(b.startColumn, a.startColumn);\n                } else {\n                    startLineNumber = a.startLineNumber;\n                    startColumn = a.startColumn;\n                }\n                if (b.endLineNumber > a.endLineNumber) {\n                    endLineNumber = b.endLineNumber;\n                    endColumn = b.endColumn;\n                } else if (b.endLineNumber === a.endLineNumber) {\n                    endLineNumber = b.endLineNumber;\n                    endColumn = Math.max(b.endColumn, a.endColumn);\n                } else {\n                    endLineNumber = a.endLineNumber;\n                    endColumn = a.endColumn;\n                }\n                return new Range(startLineNumber, startColumn, endLineNumber, endColumn);\n            }\n            getStartPosition() {\n                return Range.getStartPosition(this);\n            }\n            static getStartPosition(range) {\n                return new _position__rspack_import_0.y(range.startLineNumber, range.startColumn);\n            }\n        }\n    },\n    982 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            OS: ()=>createRegExp,\n            Z5: ()=>getNextCodePoint\n        });\n        function escapeRegExpCharacters(value) {\n            return value.replace(/[\\\\\\{\\}\\*\\+\\?\\|\\^\\$\\.\\[\\]\\(\\)]/g, '\\\\$&');\n        }\n        function isHighSurrogate(charCode) {\n            return 0xd800 <= charCode && charCode <= 0xdbff;\n        }\n        function isLowSurrogate(charCode) {\n            return 0xdc00 <= charCode && charCode <= 0xdfff;\n        }\n        function computeCodePoint(highSurrogate, lowSurrogate) {\n            return (highSurrogate - 0xd800 << 10) + (lowSurrogate - 0xdc00) + 0x10000;\n        }\n        function getNextCodePoint(str, len, offset) {\n            const charCode = str.charCodeAt(offset);\n            if (isHighSurrogate(charCode) && offset + 1 < len) {\n                const nextCharCode = str.charCodeAt(offset + 1);\n                if (isLowSurrogate(nextCharCode)) return computeCodePoint(charCode, nextCharCode);\n            }\n            return charCode;\n        }\n        function createRegExp(searchString, isRegex, options = {}) {\n            if (!searchString) throw new Error('Cannot create regex from empty string');\n            if (!isRegex) searchString = escapeRegExpCharacters(searchString);\n            if (options.wholeWord) {\n                if (!/\\B/.test(searchString.charAt(0))) searchString = '\\\\b' + searchString;\n                if (!/\\B/.test(searchString.charAt(searchString.length - 1))) searchString += '\\\\b';\n            }\n            let modifiers = '';\n            if (options.global) modifiers += 'g';\n            if (!options.matchCase) modifiers += 'i';\n            if (options.multiline) modifiers += 'm';\n            if (options.unicode) modifiers += 'u';\n            return new RegExp(searchString, modifiers);\n        }\n    },\n    298 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            W_: ()=>toUint8\n        });\n        function toUint8(v) {\n            if (v < 0) return 0;\n            if (v > 255) return 255;\n            return 0 | v;\n        }\n    },\n    861 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            Et: ()=>isNumber,\n            Gv: ()=>isObject\n        });\n        function isObject(val) {\n            return 'object' == typeof val && null !== val && !Array.isArray(val);\n        }\n        function isNumber(val) {\n            return 'number' == typeof val;\n        }\n    },\n    942 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            SM: ()=>WordCharacterClass,\n            iJ: ()=>getMapForWordSeparators\n        });\n        var _map__rspack_import_2 = __webpack_require__(269);\n        var _characterClassifier__rspack_import_0 = __webpack_require__(626);\n        var WordCharacterClass = /*#__PURE__*/ function(WordCharacterClass) {\n            WordCharacterClass[WordCharacterClass[\"Regular\"] = 0] = \"Regular\";\n            WordCharacterClass[WordCharacterClass[\"Whitespace\"] = 1] = \"Whitespace\";\n            WordCharacterClass[WordCharacterClass[\"WordSeparator\"] = 2] = \"WordSeparator\";\n            return WordCharacterClass;\n        }({});\n        class WordCharacterClassifier extends _characterClassifier__rspack_import_0.V {\n            intlSegmenterLocales;\n            _segmenter = null;\n            _cachedLine = null;\n            _cachedSegments = [];\n            constructor(wordSeparators, intlSegmenterLocales){\n                super(0);\n                this.intlSegmenterLocales = intlSegmenterLocales;\n                if (this.intlSegmenterLocales.length > 0) this._segmenter = new Intl.Segmenter(this.intlSegmenterLocales, {\n                    granularity: 'word'\n                });\n                else this._segmenter = null;\n                for(let i = 0, len = wordSeparators.length; i < len; i++)this.set(wordSeparators.charCodeAt(i), 2);\n                this.set(32, 1);\n                this.set(9, 1);\n            }\n            findPrevIntlWordBeforeOrAtOffset(line, offset) {\n                let candidate = null;\n                for (const segment of this._getIntlSegmenterWordsOnLine(line)){\n                    if (segment.index > offset) break;\n                    candidate = segment;\n                }\n                return candidate;\n            }\n            findNextIntlWordAtOrAfterOffset(lineContent, offset) {\n                for (const segment of this._getIntlSegmenterWordsOnLine(lineContent))if (!(segment.index < offset)) return segment;\n                return null;\n            }\n            _getIntlSegmenterWordsOnLine(line) {\n                if (!this._segmenter) return [];\n                if (this._cachedLine === line) return this._cachedSegments;\n                this._cachedLine = line;\n                this._cachedSegments = this._filterWordSegments(this._segmenter.segment(line));\n                return this._cachedSegments;\n            }\n            _filterWordSegments(segments) {\n                const result = [];\n                for (const segment of segments)if (this._isWordLike(segment)) result.push(segment);\n                return result;\n            }\n            _isWordLike(segment) {\n                if (segment.isWordLike) return true;\n                return false;\n            }\n        }\n        const wordClassifierCache = new _map__rspack_import_2.qK(10);\n        function getMapForWordSeparators(wordSeparators, intlSegmenterLocales) {\n            const key = `${wordSeparators}/${intlSegmenterLocales.join(',')}`;\n            let result = wordClassifierCache.get(key);\n            if (!result) {\n                result = new WordCharacterClassifier(wordSeparators, intlSegmenterLocales);\n                wordClassifierCache.set(key, result);\n            }\n            return result;\n        }\n    },\n    575 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            Rj: ()=>DeleteCommand,\n            TX: ()=>InsertCommand,\n            fE: ()=>MultiCommand,\n            iu: ()=>ReplaceCommand\n        });\n        class BaseCommand {\n            model;\n            operation;\n            oldPos;\n            newPos;\n            constructor(model, operation){\n                this.model = model;\n                this.operation = operation;\n                this.oldPos = {\n                    ...model.lastChangeBufferPos\n                };\n                this.model.updateLastChangeBufferPos(operation);\n                this.newPos = {\n                    ...model.lastChangeBufferPos\n                };\n            }\n            updateBufferPos(isUndo) {\n                this.model.lastChangeBufferPos = {\n                    ...isUndo ? this.oldPos : this.newPos\n                };\n            }\n        }\n        class InsertCommand extends BaseCommand {\n            execute() {\n                this.model.pieceTree.insert(this.operation.rangeOffset, this.operation.newText);\n                this.updateBufferPos(false);\n            }\n            undo() {\n                this.model.pieceTree.delete(this.operation.rangeOffset, this.operation.newText.length);\n                this.updateBufferPos(true);\n            }\n        }\n        class DeleteCommand extends BaseCommand {\n            execute() {\n                this.model.pieceTree.delete(this.operation.rangeOffset, this.operation.rangeLength);\n                this.updateBufferPos(false);\n            }\n            undo() {\n                this.model.pieceTree.insert(this.operation.rangeOffset, this.operation.oldText);\n                this.updateBufferPos(true);\n            }\n        }\n        class ReplaceCommand extends BaseCommand {\n            execute() {\n                this.model.pieceTree.delete(this.operation.rangeOffset, this.operation.oldText.length);\n                this.model.pieceTree.insert(this.operation.rangeOffset, this.operation.newText);\n                this.updateBufferPos(false);\n            }\n            undo() {\n                this.model.pieceTree.delete(this.operation.rangeOffset, this.operation.newText.length);\n                this.model.pieceTree.insert(this.operation.rangeOffset, this.operation.oldText);\n                this.updateBufferPos(true);\n            }\n        }\n        class MultiCommand {\n            model;\n            operation;\n            oldPos;\n            newPos;\n            constructor(model, operation){\n                this.model = model;\n                this.operation = operation;\n                this.oldPos = {\n                    ...model.lastChangeBufferPos\n                };\n                this.newPos = {\n                    ...model.lastChangeBufferPos\n                };\n            }\n            execute() {\n                for(let i = 0; i < this.operation.length; i++){\n                    const op = this.operation[i];\n                    switch(op.type){\n                        case 'insert':\n                            this.model.pieceTree.insert(op.rangeOffset, op.newText);\n                            break;\n                        case 'delete':\n                            this.model.pieceTree.delete(op.rangeOffset, op.rangeLength);\n                            break;\n                        case 'replace':\n                            this.model.pieceTree.delete(op.rangeOffset, op.oldText.length);\n                            this.model.pieceTree.insert(op.rangeOffset, op.newText);\n                            break;\n                    }\n                }\n                this.model.lastChangeBufferPos = {\n                    ...this.newPos\n                };\n            }\n            undo() {\n                for(let i = this.operation.length - 1; i >= 0; i--){\n                    const op = this.operation[i];\n                    if (op.newText && op.oldText) {\n                        this.model.pieceTree.delete(op.rangeOffset, op.newText.length);\n                        this.model.pieceTree.insert(op.rangeOffset, op.oldText);\n                    } else if (op.newText) this.model.pieceTree.delete(op.rangeOffset, op.newText.length);\n                    else this.model.pieceTree.insert(op.rangeOffset, op.oldText);\n                }\n                this.model.lastChangeBufferPos = {\n                    ...this.oldPos\n                };\n            }\n        }\n    },\n    574 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            k: ()=>createModel\n        });\n        var _jsonModel__rspack_import_0 = __webpack_require__(701);\n        function createModel(text, normalizeEOL = true) {\n            return new _jsonModel__rspack_import_0.G(text, normalizeEOL);\n        }\n    },\n    701 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            G: ()=>JSONModel\n        });\n        var _pieceTreeTextBuffer__rspack_import_0 = __webpack_require__(120);\n        var _common_range__rspack_import_6 = __webpack_require__(49);\n        var _common_emitter__rspack_import_3 = __webpack_require__(538);\n        var _textModelSearch__rspack_import_7 = __webpack_require__(94);\n        var _worker_jsonWorkerManager__rspack_import_2 = __webpack_require__(78);\n        var _common_worker__rspack_import_1 = __webpack_require__(830);\n        var _command__rspack_import_4 = __webpack_require__(575);\n        class JSONModel {\n            _pieceTree;\n            _normalizeEOL;\n            _undoStack = [];\n            _redoStack = [];\n            MAX_STACK_SIZE = 20;\n            lastChangeBufferPos = {\n                lineNumber: 1,\n                column: 1\n            };\n            _jsonWorkerManager = null;\n            emitter = null;\n            constructor(value, normalizeEOL = true){\n                this._normalizeEOL = normalizeEOL;\n                this._pieceTree = this.createTextBuffer(value);\n                if (!(0, _common_worker__rspack_import_1.E)()) {\n                    this._jsonWorkerManager = (0, _worker_jsonWorkerManager__rspack_import_2._)();\n                    this.emitter = (0, _common_emitter__rspack_import_3.dB)();\n                }\n            }\n            get pieceTree() {\n                return this._pieceTree;\n            }\n            createTextBufferFactory(value) {\n                const builder = new _pieceTreeTextBuffer__rspack_import_0.xj();\n                builder.acceptChunk(value);\n                return builder.finish(this._normalizeEOL);\n            }\n            createTextBuffer(value) {\n                return this.createTextBufferFactory(value).create(1);\n            }\n            getLineCount() {\n                return this._pieceTree.getLineCount();\n            }\n            getLineContent(lineNumber) {\n                return this._pieceTree.getLineContent(lineNumber);\n            }\n            getLineLength(lineNumber) {\n                return this._pieceTree.getLineLength(lineNumber);\n            }\n            getOffsetAt(lineNumber, column) {\n                return this._pieceTree.getOffsetAt(lineNumber, column);\n            }\n            positionAt(offset) {\n                offset = Math.min(this._pieceTree.getLength(), Math.max(0, offset));\n                return this._pieceTree.getPositionAt(offset);\n            }\n            _createCommand(op) {\n                if (Array.isArray(op)) return new _command__rspack_import_4.fE(this, op);\n                switch(op.type){\n                    case 'insert':\n                        return new _command__rspack_import_4.TX(this, op);\n                    case 'delete':\n                        return new _command__rspack_import_4.Rj(this, op);\n                    case 'replace':\n                        return new _command__rspack_import_4.iu(this, op);\n                    default:\n                        throw new Error('Unknown operation type');\n                }\n            }\n            applyOperation(op) {\n                this._redoStack = [];\n                const command = this._createCommand(op);\n                this.pushUndoStack(command);\n                command.execute();\n                if (!(0, _common_worker__rspack_import_1.E)()) this.emitter?.emit('contentChanged', op);\n                if (this._jsonWorkerManager) this._jsonWorkerManager.updateModel(op).then((res)=>this._jsonWorkerManager?.validate()).then((result)=>{\n                    this.emitter?.emit('problemsChanged', {\n                        problems: result.problems,\n                        root: result.root\n                    });\n                });\n            }\n            updateLastChangeBufferPos(op) {\n                if (op.keepPosition) {\n                    this.lastChangeBufferPos = op.keepPosition;\n                    return;\n                }\n                const getEndPosition = (startLineNumber, startColumn, text)=>{\n                    const parts = text.split(/\\r\\n|\\r|\\n/);\n                    const lineBreakCount = parts.length - 1;\n                    if (0 === lineBreakCount) return {\n                        lineNumber: startLineNumber,\n                        column: startColumn + text.length\n                    };\n                    return {\n                        lineNumber: startLineNumber + lineBreakCount,\n                        column: parts[parts.length - 1].length + 1\n                    };\n                };\n                switch(op.type){\n                    case 'insert':\n                        this.lastChangeBufferPos = getEndPosition(op.range.startLineNumber, op.range.startColumn, op.newText);\n                        break;\n                    case 'delete':\n                        if (1 === this.lastChangeBufferPos.column) {\n                            this.lastChangeBufferPos.lineNumber -= 1;\n                            this.lastChangeBufferPos.column = this.getLineLength(this.lastChangeBufferPos.lineNumber) + 1;\n                        } else {\n                            const startColumn = op.range.startColumn;\n                            const newColumn = 1 === op.rangeLength ? startColumn - 1 : startColumn;\n                            this.lastChangeBufferPos.column = newColumn;\n                        }\n                        break;\n                    case 'replace':\n                        this.lastChangeBufferPos = getEndPosition(op.range.startLineNumber, op.range.startColumn, op.newText);\n                        break;\n                }\n            }\n            pushUndoStack(command) {\n                this._undoStack.push(command);\n                if (this._undoStack.length > this.MAX_STACK_SIZE) this._undoStack.shift();\n            }\n            pushRedoStack(command) {\n                this._redoStack.push(command);\n                if (this._redoStack.length > this.MAX_STACK_SIZE) this._redoStack.shift();\n            }\n            canUndo() {\n                return this._undoStack.length > 0;\n            }\n            canRedo() {\n                return this._redoStack.length > 0;\n            }\n            undo() {\n                if (!this.canUndo()) return;\n                const command = this._undoStack.pop();\n                command.undo();\n                this._redoStack.push(command);\n                if (!(0, _common_worker__rspack_import_1.E)()) this.emitter?.emit('contentChanged', command.operation);\n                if (this._jsonWorkerManager) this._jsonWorkerManager.undo().then((res)=>this._jsonWorkerManager?.validate()).then((result)=>{\n                    this.emitter?.emit('problemsChanged', {\n                        problems: result.problems,\n                        root: result.root\n                    });\n                });\n            }\n            redo() {\n                if (!this.canRedo()) return;\n                const command = this._redoStack.pop();\n                command.execute();\n                this._undoStack.push(command);\n                if (!(0, _common_worker__rspack_import_1.E)()) this.emitter?.emit('contentChanged', command.operation);\n                if (this._jsonWorkerManager) this._jsonWorkerManager.redo().then((res)=>this._jsonWorkerManager?.validate()).then((result)=>{\n                    this.emitter?.emit('problemsChanged', {\n                        problems: result.problems,\n                        root: result.root\n                    });\n                });\n            }\n            getValue() {\n                return this._pieceTree.getValueInRange({\n                    startLineNumber: 1,\n                    startColumn: 1,\n                    endLineNumber: this._pieceTree.getLineCount(),\n                    endColumn: this._pieceTree.getLineContent(this._pieceTree.getLineCount()).length + 1\n                });\n            }\n            setValue(value) {\n                const builder = new _pieceTreeTextBuffer__rspack_import_0.xj();\n                builder.acceptChunk(value);\n                this._pieceTree = builder.finish(this._normalizeEOL).create(1);\n            }\n            getEOL() {\n                return this._pieceTree.getEOL();\n            }\n            _getEndOfLine(eol) {\n                switch(eol){\n                    case 1:\n                        return '\\n';\n                    case 2:\n                        return '\\r\\n';\n                    case 0:\n                        return this.getEOL();\n                    default:\n                        throw new Error('Unknown EOL preference');\n                }\n            }\n            getValueInRange(range, eol = 0) {\n                return this._pieceTree.getValueInRange(range, this._getEndOfLine(eol));\n            }\n            getFullModelRange() {\n                const lineCount = this.getLineCount();\n                return new _common_range__rspack_import_6.Q(1, 1, lineCount, this.getLineLength(lineCount) + 1);\n            }\n            findMatchesLineByLine(searchRange, searchData, captureMatches, limitResultCount) {\n                return this._pieceTree.findMatchesLineByLine(searchRange, searchData, captureMatches, limitResultCount);\n            }\n            findMatches(searchString, rawSearchScope, isRegex, matchCase, wordSeparators, captureMatches, limitResultCount = 1 / 0) {\n                let searchRanges = null;\n                if (null === searchRanges) searchRanges = [\n                    this.getFullModelRange()\n                ];\n                searchRanges = searchRanges.sort((d1, d2)=>d1.startLineNumber - d2.startLineNumber || d1.startColumn - d2.startColumn);\n                const uniqueSearchRanges = [];\n                uniqueSearchRanges.push(searchRanges.reduce((prev, curr)=>{\n                    if (_common_range__rspack_import_6.Q.areIntersecting(prev, curr)) return prev.plusRange(curr);\n                    uniqueSearchRanges.push(prev);\n                    return curr;\n                }));\n                let matchMapper;\n                if (!isRegex && searchString.indexOf('\\n') < 0) {\n                    const searchParams = new _textModelSearch__rspack_import_7.lt(searchString, isRegex, matchCase, wordSeparators);\n                    const searchData = searchParams.parseSearchRequest();\n                    if (!searchData) return [];\n                    matchMapper = (searchRange)=>this.findMatchesLineByLine(searchRange, searchData, captureMatches, limitResultCount);\n                } else matchMapper = (searchRange)=>_textModelSearch__rspack_import_7.hB.findMatches(this, new _textModelSearch__rspack_import_7.lt(searchString, isRegex, matchCase, wordSeparators), searchRange, captureMatches, limitResultCount);\n                return uniqueSearchRanges.map(matchMapper).reduce((arr, matches)=>arr.concat(matches), []);\n            }\n            isStartPosition() {\n                const { lineNumber, column } = this.lastChangeBufferPos;\n                return 1 === lineNumber && 1 === column;\n            }\n        }\n    },\n    94 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            W5: ()=>Searcher,\n            dr: ()=>createFindMatch,\n            hB: ()=>TextModelSearch,\n            lt: ()=>SearchParams,\n            wC: ()=>isValidMatch\n        });\n        var _common_wordCharacterClassifier__rspack_import_4 = __webpack_require__(942);\n        var _common_model__rspack_import_1 = __webpack_require__(753);\n        var _common_range__rspack_import_2 = __webpack_require__(49);\n        var _common_strings__rspack_import_3 = __webpack_require__(982);\n        class LineFeedCounter {\n            _lineFeedsOffsets;\n            constructor(text){\n                const lineFeedsOffsets = [];\n                let lineFeedsOffsetsLen = 0;\n                for(let i = 0, textLen = text.length; i < textLen; i++)if (10 === text.charCodeAt(i)) lineFeedsOffsets[lineFeedsOffsetsLen++] = i;\n                this._lineFeedsOffsets = lineFeedsOffsets;\n            }\n            findLineFeedCountBeforeOffset(offset) {\n                const lineFeedsOffsets = this._lineFeedsOffsets;\n                let min = 0;\n                let max = lineFeedsOffsets.length - 1;\n                if (-1 === max) return 0;\n                if (offset <= lineFeedsOffsets[0]) return 0;\n                while(min < max){\n                    const mid = min + ((max - min) / 2 | 0);\n                    if (lineFeedsOffsets[mid] >= offset) max = mid - 1;\n                    else if (lineFeedsOffsets[mid + 1] >= offset) {\n                        min = mid;\n                        max = mid;\n                    } else min = mid + 1;\n                }\n                return min + 1;\n            }\n        }\n        class TextModelSearch {\n            static findMatches(model, searchParams, searchRange, captureMatches, limitResultCount) {\n                const searchData = searchParams.parseSearchRequest();\n                if (!searchData) return [];\n                if (searchData.regex.multiline) return this._doFindMatchesMultiline(model, searchRange, new Searcher(searchData.wordSeparators, searchData.regex), captureMatches, limitResultCount);\n                return this._doFindMatchesLineByLine(model, searchRange, searchData, captureMatches, limitResultCount);\n            }\n            static _doFindMatchesMultiline(model, searchRange, searcher, captureMatches, limitResultCount) {\n                const pos = searchRange.getStartPosition();\n                const deltaOffset = model.getOffsetAt(pos.lineNumber, pos.column);\n                const text = model.getValueInRange(searchRange, 1);\n                const lfCounter = '\\r\\n' === model.getEOL() ? new LineFeedCounter(text) : null;\n                const result = [];\n                let counter = 0;\n                let m;\n                searcher.reset(0);\n                while(m = searcher.next(text)){\n                    result[counter++] = createFindMatch(this._getMultilineMatchRange(model, deltaOffset, text, lfCounter, m.index, m[0]), m, captureMatches);\n                    if (counter >= limitResultCount) break;\n                }\n                return result;\n            }\n            static _getMultilineMatchRange(model, deltaOffset, text, lfCounter, matchIndex, match0) {\n                let startOffset;\n                let lineFeedCountBeforeMatch = 0;\n                if (lfCounter) {\n                    lineFeedCountBeforeMatch = lfCounter.findLineFeedCountBeforeOffset(matchIndex);\n                    startOffset = deltaOffset + matchIndex + lineFeedCountBeforeMatch;\n                } else startOffset = deltaOffset + matchIndex;\n                let endOffset;\n                if (lfCounter) {\n                    const lineFeedCountBeforeEndOfMatch = lfCounter.findLineFeedCountBeforeOffset(matchIndex + match0.length);\n                    const lineFeedCountInMatch = lineFeedCountBeforeEndOfMatch - lineFeedCountBeforeMatch;\n                    endOffset = startOffset + match0.length + lineFeedCountInMatch;\n                } else endOffset = startOffset + match0.length;\n                const startPosition = model.positionAt(startOffset);\n                const endPosition = model.positionAt(endOffset);\n                return new _common_range__rspack_import_2.Q(startPosition.lineNumber, startPosition.column, endPosition.lineNumber, endPosition.column);\n            }\n            static _doFindMatchesLineByLine(model, searchRange, searchData, captureMatches, limitResultCount) {\n                const res = [];\n                let resLen = 0;\n                if (searchRange.startLineNumber === searchRange.endLineNumber) {\n                    const text = model.getLineContent(searchRange.startLineNumber).substring(searchRange.startColumn - 1, searchRange.endColumn - 1);\n                    resLen = this._findMatchesInLine(searchData, text, searchRange.startLineNumber, searchRange.startColumn - 1, resLen, res, captureMatches, limitResultCount);\n                }\n                const text = model.getLineContent(searchRange.startLineNumber).substring(searchRange.startColumn - 1);\n                resLen = this._findMatchesInLine(searchData, text, searchRange.startLineNumber, searchRange.startColumn - 1, resLen, res, captureMatches, limitResultCount);\n                for(let lineNumber = searchRange.startLineNumber + 1; lineNumber < searchRange.endLineNumber && resLen < limitResultCount; lineNumber++)resLen = this._findMatchesInLine(searchData, model.getLineContent(lineNumber), lineNumber, 0, resLen, res, captureMatches, limitResultCount);\n                if (resLen < limitResultCount) {\n                    const text = model.getLineContent(searchRange.endLineNumber).substring(0, searchRange.endColumn - 1);\n                    resLen = this._findMatchesInLine(searchData, text, searchRange.endLineNumber, 0, resLen, res, captureMatches, limitResultCount);\n                }\n                return res;\n            }\n            static _findMatchesInLine(searchData, text, lineNumber, deltaOffset, resultLen, result, captureMatches, limitResultCount) {\n                const wordSeparators = searchData.wordSeparators;\n                if (!captureMatches && searchData.simpleSearch) {\n                    const searchString = searchData.simpleSearch;\n                    const searchStringLen = searchString.length;\n                    const textLength = text.length;\n                    let lastMatchIndex = -searchStringLen;\n                    while(-1 !== (lastMatchIndex = text.indexOf(searchString, lastMatchIndex + searchStringLen)))if (!wordSeparators || isValidMatch(wordSeparators, text, textLength, lastMatchIndex, searchStringLen)) {\n                        result[resultLen++] = new _common_model__rspack_import_1.Dg(new _common_range__rspack_import_2.Q(lineNumber, lastMatchIndex + 1 + deltaOffset, lineNumber, lastMatchIndex + 1 + searchStringLen + deltaOffset), null);\n                        if (resultLen >= limitResultCount) return resultLen;\n                    }\n                }\n                const searcher = new Searcher(searchData.wordSeparators, searchData.regex);\n                let m;\n                searcher.reset(0);\n                do {\n                    m = searcher.next(text);\n                    if (m) {\n                        result[resultLen++] = createFindMatch(new _common_range__rspack_import_2.Q(lineNumber, m.index + 1 + deltaOffset, lineNumber, m.index + 1 + m[0].length + deltaOffset), m, captureMatches);\n                        if (resultLen >= limitResultCount) break;\n                    }\n                }while (m)\n                return resultLen;\n            }\n        }\n        class SearchParams {\n            searchString;\n            isRegex;\n            matchCase;\n            wordSeparators;\n            constructor(searchString, isRegex, matchCase, wordSeparators){\n                this.searchString = searchString;\n                this.isRegex = isRegex;\n                this.matchCase = matchCase;\n                this.wordSeparators = wordSeparators;\n            }\n            parseSearchRequest() {\n                if ('' === this.searchString) return null;\n                let multiline;\n                multiline = this.isRegex ? isMultilineRegexSource(this.searchString) : this.searchString.indexOf('\\n') >= 0;\n                let regex = null;\n                try {\n                    regex = (0, _common_strings__rspack_import_3.OS)(this.searchString, this.isRegex, {\n                        matchCase: this.matchCase,\n                        wholeWord: false,\n                        multiline: multiline,\n                        global: true,\n                        unicode: true\n                    });\n                } catch (err) {\n                    return null;\n                }\n                if (!regex) return null;\n                let canUseSimpleSearch = !this.isRegex && !multiline;\n                if (canUseSimpleSearch && this.searchString.toLowerCase() !== this.searchString.toUpperCase()) canUseSimpleSearch = this.matchCase;\n                return new _common_model__rspack_import_1.L5(regex, this.wordSeparators ? (0, _common_wordCharacterClassifier__rspack_import_4.iJ)(this.wordSeparators, []) : null, canUseSimpleSearch ? this.searchString : null);\n            }\n        }\n        function isMultilineRegexSource(searchString) {\n            if (!searchString || 0 === searchString.length) return false;\n            for(let i = 0, len = searchString.length; i < len; i++){\n                const chCode = searchString.charCodeAt(i);\n                if (10 === chCode) return true;\n                if (92 === chCode) {\n                    i++;\n                    if (i >= len) break;\n                    const nextChCode = searchString.charCodeAt(i);\n                    if (110 === nextChCode || 114 === nextChCode || 87 === nextChCode) return true;\n                }\n            }\n            return false;\n        }\n        function leftIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength) {\n            if (0 === matchStartIndex) return true;\n            const charBefore = text.charCodeAt(matchStartIndex - 1);\n            if (0 !== wordSeparators.get(charBefore)) return true;\n            if (13 === charBefore || 10 === charBefore) return true;\n            if (matchLength > 0) {\n                const firstCharInMatch = text.charCodeAt(matchStartIndex);\n                if (0 !== wordSeparators.get(firstCharInMatch)) return true;\n            }\n            return false;\n        }\n        function rightIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength) {\n            if (matchStartIndex + matchLength === textLength) return true;\n            const charAfter = text.charCodeAt(matchStartIndex + matchLength);\n            if (0 !== wordSeparators.get(charAfter)) return true;\n            if (13 === charAfter || 10 === charAfter) return true;\n            if (matchLength > 0) {\n                const lastCharInMatch = text.charCodeAt(matchStartIndex + matchLength - 1);\n                if (0 !== wordSeparators.get(lastCharInMatch)) return true;\n            }\n            return false;\n        }\n        function isValidMatch(wordSeparators, text, textLength, matchStartIndex, matchLength) {\n            return leftIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength) && rightIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength);\n        }\n        class Searcher {\n            _wordSeparators;\n            _searchRegex;\n            _prevMatchStartIndex;\n            _prevMatchLength;\n            constructor(wordSeparators, searchRegex){\n                this._wordSeparators = wordSeparators;\n                this._searchRegex = searchRegex;\n                this._prevMatchStartIndex = -1;\n                this._prevMatchLength = 0;\n            }\n            reset(lastIndex) {\n                this._searchRegex.lastIndex = lastIndex;\n                this._prevMatchStartIndex = -1;\n                this._prevMatchLength = 0;\n            }\n            next(text) {\n                const textLength = text.length;\n                let m;\n                do {\n                    if (this._prevMatchStartIndex + this._prevMatchLength === textLength) break;\n                    m = this._searchRegex.exec(text);\n                    if (!m) break;\n                    const matchStartIndex = m.index;\n                    const matchLength = m[0].length;\n                    if (matchStartIndex === this._prevMatchStartIndex && matchLength === this._prevMatchLength) {\n                        if (0 === matchLength) {\n                            if ((0, _common_strings__rspack_import_3.Z5)(text, textLength, this._searchRegex.lastIndex) > 0xffff) this._searchRegex.lastIndex += 2;\n                            else this._searchRegex.lastIndex += 1;\n                            continue;\n                        }\n                        break;\n                    }\n                    this._prevMatchStartIndex = matchStartIndex;\n                    this._prevMatchLength = matchLength;\n                    if (!this._wordSeparators || isValidMatch(this._wordSeparators, text, textLength, matchStartIndex, matchLength)) return m;\n                }while (m)\n                return null;\n            }\n        }\n        function createFindMatch(range, rawMatches, captureMatches) {\n            if (!captureMatches) return new _common_model__rspack_import_1.Dg(range, null);\n            const matches = [];\n            for(let i = 0, len = rawMatches.length; i < len; i++)matches[i] = rawMatches[i];\n            return new _common_model__rspack_import_1.Dg(range, matches);\n        }\n    },\n    120 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            of: ()=>_pieceTreeTextBufferBuilder__rspack_import_0.of,\n            xj: ()=>_pieceTreeTextBufferBuilder__rspack_import_0.xj\n        });\n        var _pieceTreeTextBufferBuilder__rspack_import_0 = __webpack_require__(260);\n    },\n    891 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            CV: ()=>StringBuffer,\n            Ep: ()=>createLineStartsFast,\n            Ux: ()=>PieceTreeBase,\n            g4: ()=>createLineStarts\n        });\n        var _common_position__rspack_import_2 = __webpack_require__(833);\n        var _common_range__rspack_import_4 = __webpack_require__(49);\n        var _common_model__rspack_import_5 = __webpack_require__(753);\n        var _rbTreeBase__rspack_import_1 = __webpack_require__(267);\n        var _model_textModelSearch__rspack_import_3 = __webpack_require__(94);\n        const AverageBufferSize = 65535;\n        function createUintArray(arr) {\n            let r;\n            r = arr[arr.length - 1] < 65536 ? new Uint16Array(arr.length) : new Uint32Array(arr.length);\n            r.set(arr, 0);\n            return r;\n        }\n        class LineStarts {\n            lineStarts;\n            cr;\n            lf;\n            crlf;\n            isBasicASCII;\n            constructor(lineStarts, cr, lf, crlf, isBasicASCII){\n                this.lineStarts = lineStarts;\n                this.cr = cr;\n                this.lf = lf;\n                this.crlf = crlf;\n                this.isBasicASCII = isBasicASCII;\n            }\n        }\n        function createLineStartsFast(str, readonly = true) {\n            const r = [\n                0\n            ];\n            let rLength = 1;\n            for(let i = 0, len = str.length; i < len; i++){\n                const chr = str.charCodeAt(i);\n                if (13 === chr) if (i + 1 < len && 10 === str.charCodeAt(i + 1)) {\n                    r[rLength++] = i + 2;\n                    i++;\n                } else r[rLength++] = i + 1;\n                else if (10 === chr) r[rLength++] = i + 1;\n            }\n            if (readonly) return createUintArray(r);\n            return r;\n        }\n        function createLineStarts(r, str) {\n            r.length = 0;\n            r[0] = 0;\n            let rLength = 1;\n            let cr = 0, lf = 0, crlf = 0;\n            let isBasicASCII = true;\n            for(let i = 0, len = str.length; i < len; i++){\n                const chr = str.charCodeAt(i);\n                if (13 === chr) if (i + 1 < len && 10 === str.charCodeAt(i + 1)) {\n                    crlf++;\n                    r[rLength++] = i + 2;\n                    i++;\n                } else {\n                    cr++;\n                    r[rLength++] = i + 1;\n                }\n                else if (10 === chr) {\n                    lf++;\n                    r[rLength++] = i + 1;\n                } else if (isBasicASCII) {\n                    if (9 !== chr && (chr < 32 || chr > 126)) isBasicASCII = false;\n                }\n            }\n            const result = new LineStarts(createUintArray(r), cr, lf, crlf, isBasicASCII);\n            r.length = 0;\n            return result;\n        }\n        class Piece {\n            bufferIndex;\n            start;\n            end;\n            length;\n            lineFeedCnt;\n            constructor(bufferIndex, start, end, lineFeedCnt, length){\n                this.bufferIndex = bufferIndex;\n                this.start = start;\n                this.end = end;\n                this.lineFeedCnt = lineFeedCnt;\n                this.length = length;\n            }\n        }\n        class StringBuffer {\n            buffer;\n            lineStarts;\n            constructor(buffer, lineStarts){\n                this.buffer = buffer;\n                this.lineStarts = lineStarts;\n            }\n        }\n        class PieceTreeSnapshot {\n            _pieces;\n            _index;\n            _tree;\n            _BOM;\n            constructor(tree, BOM){\n                this._pieces = [];\n                this._tree = tree;\n                this._BOM = BOM;\n                this._index = 0;\n                if (tree.root !== _rbTreeBase__rspack_import_1.fd) tree.iterate(tree.root, (node)=>{\n                    if (node !== _rbTreeBase__rspack_import_1.fd) this._pieces.push(node.piece);\n                    return true;\n                });\n            }\n            read() {\n                if (0 === this._pieces.length) if (0 !== this._index) return null;\n                else {\n                    this._index++;\n                    return this._BOM;\n                }\n                if (this._index > this._pieces.length - 1) return null;\n                if (0 === this._index) return this._BOM + this._tree.getPieceContent(this._pieces[this._index++]);\n                return this._tree.getPieceContent(this._pieces[this._index++]);\n            }\n        }\n        class PieceTreeSearchCache {\n            _limit;\n            _cache;\n            constructor(limit){\n                this._limit = limit;\n                this._cache = [];\n            }\n            get(offset) {\n                for(let i = this._cache.length - 1; i >= 0; i--){\n                    const nodePos = this._cache[i];\n                    if (nodePos.nodeStartOffset <= offset && nodePos.nodeStartOffset + nodePos.node.piece.length >= offset) return nodePos;\n                }\n                return null;\n            }\n            get2(lineNumber) {\n                for(let i = this._cache.length - 1; i >= 0; i--){\n                    const nodePos = this._cache[i];\n                    if (nodePos.nodeStartLineNumber && nodePos.nodeStartLineNumber < lineNumber && nodePos.nodeStartLineNumber + nodePos.node.piece.lineFeedCnt >= lineNumber) return nodePos;\n                }\n                return null;\n            }\n            set(nodePosition) {\n                if (this._cache.length >= this._limit) this._cache.shift();\n                this._cache.push(nodePosition);\n            }\n            validate(offset) {\n                let hasInvalidVal = false;\n                const tmp = this._cache;\n                for(let i = 0; i < tmp.length; i++){\n                    const nodePos = tmp[i];\n                    if (null === nodePos.node.parent || nodePos.nodeStartOffset >= offset) {\n                        tmp[i] = null;\n                        hasInvalidVal = true;\n                        continue;\n                    }\n                }\n                if (hasInvalidVal) {\n                    const newArr = [];\n                    for (const entry of tmp)if (null !== entry) newArr.push(entry);\n                    this._cache = newArr;\n                }\n            }\n        }\n        class PieceTreeBase {\n            root;\n            _buffers;\n            _lineCnt;\n            _length;\n            _EOL;\n            _EOLLength;\n            _EOLNormalized;\n            _lastChangeBufferPos;\n            _searchCache;\n            _lastVisitedLine;\n            constructor(chunks, eol, eolNormalized){\n                this.create(chunks, eol, eolNormalized);\n            }\n            create(chunks, eol, eolNormalized) {\n                this._buffers = [\n                    new StringBuffer('', [\n                        0\n                    ])\n                ];\n                this._lastChangeBufferPos = {\n                    line: 0,\n                    column: 0\n                };\n                this.root = _rbTreeBase__rspack_import_1.fd;\n                this._lineCnt = 1;\n                this._length = 0;\n                this._EOL = eol;\n                this._EOLLength = eol.length;\n                this._EOLNormalized = eolNormalized;\n                let lastNode = null;\n                for(let i = 0, len = chunks.length; i < len; i++)if (chunks[i].buffer.length > 0) {\n                    if (!chunks[i].lineStarts) chunks[i].lineStarts = createLineStartsFast(chunks[i].buffer);\n                    const piece = new Piece(i + 1, {\n                        line: 0,\n                        column: 0\n                    }, {\n                        line: chunks[i].lineStarts.length - 1,\n                        column: chunks[i].buffer.length - chunks[i].lineStarts[chunks[i].lineStarts.length - 1]\n                    }, chunks[i].lineStarts.length - 1, chunks[i].buffer.length);\n                    this._buffers.push(chunks[i]);\n                    lastNode = this.rbInsertRight(lastNode, piece);\n                }\n                this._searchCache = new PieceTreeSearchCache(1);\n                this._lastVisitedLine = {\n                    lineNumber: 0,\n                    value: ''\n                };\n                this.computeBufferMetadata();\n            }\n            normalizeEOL(eol) {\n                const averageBufferSize = AverageBufferSize;\n                const min = averageBufferSize - Math.floor(averageBufferSize / 3);\n                const max = 2 * min;\n                let tempChunk = '';\n                let tempChunkLen = 0;\n                const chunks = [];\n                this.iterate(this.root, (node)=>{\n                    const str = this.getNodeContent(node);\n                    const len = str.length;\n                    if (tempChunkLen <= min || tempChunkLen + len < max) {\n                        tempChunk += str;\n                        tempChunkLen += len;\n                        return true;\n                    }\n                    const text = tempChunk.replace(/\\r\\n|\\r|\\n/g, eol);\n                    chunks.push(new StringBuffer(text, createLineStartsFast(text)));\n                    tempChunk = str;\n                    tempChunkLen = len;\n                    return true;\n                });\n                if (tempChunkLen > 0) {\n                    const text = tempChunk.replace(/\\r\\n|\\r|\\n/g, eol);\n                    chunks.push(new StringBuffer(text, createLineStartsFast(text)));\n                }\n                this.create(chunks, eol, true);\n            }\n            getEOL() {\n                return this._EOL;\n            }\n            setEOL(newEOL) {\n                this._EOL = newEOL;\n                this._EOLLength = this._EOL.length;\n                this.normalizeEOL(newEOL);\n            }\n            createSnapshot(BOM) {\n                return new PieceTreeSnapshot(this, BOM);\n            }\n            equal(other) {\n                if (this.getLength() !== other.getLength()) return false;\n                if (this.getLineCount() !== other.getLineCount()) return false;\n                let offset = 0;\n                const ret = this.iterate(this.root, (node)=>{\n                    if (node === _rbTreeBase__rspack_import_1.fd) return true;\n                    const str = this.getNodeContent(node);\n                    const len = str.length;\n                    const startPosition = other.nodeAt(offset);\n                    const endPosition = other.nodeAt(offset + len);\n                    const val = other.getValueInRange2(startPosition, endPosition);\n                    offset += len;\n                    return str === val;\n                });\n                return ret;\n            }\n            getOffsetAt(lineNumber, column) {\n                let leftLen = 0;\n                let x = this.root;\n                while(x !== _rbTreeBase__rspack_import_1.fd)if (x.left !== _rbTreeBase__rspack_import_1.fd && x.lf_left + 1 >= lineNumber) x = x.left;\n                else if (x.lf_left + x.piece.lineFeedCnt + 1 >= lineNumber) {\n                    leftLen += x.size_left;\n                    const accumualtedValInCurrentIndex = this.getAccumulatedValue(x, lineNumber - x.lf_left - 2);\n                    return leftLen + (accumualtedValInCurrentIndex + column - 1);\n                } else {\n                    lineNumber -= x.lf_left + x.piece.lineFeedCnt;\n                    leftLen += x.size_left + x.piece.length;\n                    x = x.right;\n                }\n                return leftLen;\n            }\n            getPositionAt(offset) {\n                offset = Math.floor(offset);\n                offset = Math.max(0, offset);\n                let x = this.root;\n                let lfCnt = 0;\n                const originalOffset = offset;\n                while(x !== _rbTreeBase__rspack_import_1.fd)if (0 !== x.size_left && x.size_left >= offset) x = x.left;\n                else if (x.size_left + x.piece.length >= offset) {\n                    const out = this.getIndexOf(x, offset - x.size_left);\n                    lfCnt += x.lf_left + out.index;\n                    if (0 === out.index) {\n                        const lineStartOffset = this.getOffsetAt(lfCnt + 1, 1);\n                        const column = originalOffset - lineStartOffset;\n                        return new _common_position__rspack_import_2.y(lfCnt + 1, column + 1);\n                    }\n                    return new _common_position__rspack_import_2.y(lfCnt + 1, out.remainder + 1);\n                } else {\n                    offset -= x.size_left + x.piece.length;\n                    lfCnt += x.lf_left + x.piece.lineFeedCnt;\n                    if (x.right === _rbTreeBase__rspack_import_1.fd) {\n                        const lineStartOffset = this.getOffsetAt(lfCnt + 1, 1);\n                        const column = originalOffset - offset - lineStartOffset;\n                        return new _common_position__rspack_import_2.y(lfCnt + 1, column + 1);\n                    }\n                    x = x.right;\n                }\n                return new _common_position__rspack_import_2.y(1, 1);\n            }\n            getValueInRange(range, eol) {\n                if (range.startLineNumber === range.endLineNumber && range.startColumn === range.endColumn) return '';\n                const startPosition = this.nodeAt2(range.startLineNumber, range.startColumn);\n                const endPosition = this.nodeAt2(range.endLineNumber, range.endColumn);\n                const value = this.getValueInRange2(startPosition, endPosition);\n                if (eol) {\n                    if (eol !== this._EOL || !this._EOLNormalized) return value.replace(/\\r\\n|\\r|\\n/g, eol);\n                    if (eol === this.getEOL() && this._EOLNormalized) return value;\n                    return value.replace(/\\r\\n|\\r|\\n/g, eol);\n                }\n                return value;\n            }\n            getValueInRange2(startPosition, endPosition) {\n                if (startPosition.node === endPosition.node) {\n                    const node = startPosition.node;\n                    const buffer = this._buffers[node.piece.bufferIndex].buffer;\n                    const startOffset = this.offsetInBuffer(node.piece.bufferIndex, node.piece.start);\n                    return buffer.substring(startOffset + startPosition.remainder, startOffset + endPosition.remainder);\n                }\n                let x = startPosition.node;\n                const buffer = this._buffers[x.piece.bufferIndex].buffer;\n                const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                let ret = buffer.substring(startOffset + startPosition.remainder, startOffset + x.piece.length);\n                x = x.next();\n                while(x !== _rbTreeBase__rspack_import_1.fd){\n                    const buffer = this._buffers[x.piece.bufferIndex].buffer;\n                    const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                    if (x === endPosition.node) {\n                        ret += buffer.substring(startOffset, startOffset + endPosition.remainder);\n                        break;\n                    }\n                    ret += buffer.substr(startOffset, x.piece.length);\n                    x = x.next();\n                }\n                return ret;\n            }\n            getLinesContent() {\n                const lines = [];\n                let linesLength = 0;\n                let currentLine = '';\n                let danglingCR = false;\n                this.iterate(this.root, (node)=>{\n                    if (node === _rbTreeBase__rspack_import_1.fd) return true;\n                    const piece = node.piece;\n                    let pieceLength = piece.length;\n                    if (0 === pieceLength) return true;\n                    const buffer = this._buffers[piece.bufferIndex].buffer;\n                    const lineStarts = this._buffers[piece.bufferIndex].lineStarts;\n                    const pieceStartLine = piece.start.line;\n                    const pieceEndLine = piece.end.line;\n                    let pieceStartOffset = lineStarts[pieceStartLine] + piece.start.column;\n                    if (danglingCR) {\n                        if (10 === buffer.charCodeAt(pieceStartOffset)) {\n                            pieceStartOffset++;\n                            pieceLength--;\n                        }\n                        lines[linesLength++] = currentLine;\n                        currentLine = '';\n                        danglingCR = false;\n                        if (0 === pieceLength) return true;\n                    }\n                    if (pieceStartLine === pieceEndLine) {\n                        if (this._EOLNormalized || 13 !== buffer.charCodeAt(pieceStartOffset + pieceLength - 1)) currentLine += buffer.substr(pieceStartOffset, pieceLength);\n                        else {\n                            danglingCR = true;\n                            currentLine += buffer.substr(pieceStartOffset, pieceLength - 1);\n                        }\n                        return true;\n                    }\n                    currentLine += this._EOLNormalized ? buffer.substring(pieceStartOffset, Math.max(pieceStartOffset, lineStarts[pieceStartLine + 1] - this._EOLLength)) : buffer.substring(pieceStartOffset, lineStarts[pieceStartLine + 1]).replace(/(\\r\\n|\\r|\\n)$/, '');\n                    lines[linesLength++] = currentLine;\n                    for(let line = pieceStartLine + 1; line < pieceEndLine; line++){\n                        currentLine = this._EOLNormalized ? buffer.substring(lineStarts[line], lineStarts[line + 1] - this._EOLLength) : buffer.substring(lineStarts[line], lineStarts[line + 1]).replace(/(\\r\\n|\\r|\\n)$/, '');\n                        lines[linesLength++] = currentLine;\n                    }\n                    if (this._EOLNormalized || 13 !== buffer.charCodeAt(lineStarts[pieceEndLine] + piece.end.column - 1)) currentLine = buffer.substr(lineStarts[pieceEndLine], piece.end.column);\n                    else {\n                        danglingCR = true;\n                        if (0 === piece.end.column) linesLength--;\n                        else currentLine = buffer.substr(lineStarts[pieceEndLine], piece.end.column - 1);\n                    }\n                    return true;\n                });\n                if (danglingCR) {\n                    lines[linesLength++] = currentLine;\n                    currentLine = '';\n                }\n                lines[linesLength++] = currentLine;\n                return lines;\n            }\n            getLength() {\n                return this._length;\n            }\n            getLineCount() {\n                return this._lineCnt;\n            }\n            getLineContent(lineNumber) {\n                if (this._lastVisitedLine.lineNumber === lineNumber) return this._lastVisitedLine.value;\n                this._lastVisitedLine.lineNumber = lineNumber;\n                if (lineNumber === this._lineCnt) this._lastVisitedLine.value = this.getLineRawContent(lineNumber);\n                else if (this._EOLNormalized) this._lastVisitedLine.value = this.getLineRawContent(lineNumber, this._EOLLength);\n                else this._lastVisitedLine.value = this.getLineRawContent(lineNumber).replace(/(\\r\\n|\\r|\\n)$/, '');\n                return this._lastVisitedLine.value;\n            }\n            _getCharCode(nodePos) {\n                if (nodePos.remainder === nodePos.node.piece.length) {\n                    const matchingNode = nodePos.node.next();\n                    if (!matchingNode) return 0;\n                    const buffer = this._buffers[matchingNode.piece.bufferIndex];\n                    const startOffset = this.offsetInBuffer(matchingNode.piece.bufferIndex, matchingNode.piece.start);\n                    return buffer.buffer.charCodeAt(startOffset);\n                }\n                {\n                    const buffer = this._buffers[nodePos.node.piece.bufferIndex];\n                    const startOffset = this.offsetInBuffer(nodePos.node.piece.bufferIndex, nodePos.node.piece.start);\n                    const targetOffset = startOffset + nodePos.remainder;\n                    return buffer.buffer.charCodeAt(targetOffset);\n                }\n            }\n            getLineCharCode(lineNumber, index) {\n                const nodePos = this.nodeAt2(lineNumber, index + 1);\n                return this._getCharCode(nodePos);\n            }\n            getLineLength(lineNumber) {\n                if (lineNumber === this.getLineCount()) {\n                    const startOffset = this.getOffsetAt(lineNumber, 1);\n                    return this.getLength() - startOffset;\n                }\n                return this.getOffsetAt(lineNumber + 1, 1) - this.getOffsetAt(lineNumber, 1) - this._EOLLength;\n            }\n            getCharCode(offset) {\n                const nodePos = this.nodeAt(offset);\n                return this._getCharCode(nodePos);\n            }\n            getNearestChunk(offset) {\n                const nodePos = this.nodeAt(offset);\n                if (nodePos.remainder === nodePos.node.piece.length) {\n                    const matchingNode = nodePos.node.next();\n                    if (!matchingNode || matchingNode === _rbTreeBase__rspack_import_1.fd) return '';\n                    const buffer = this._buffers[matchingNode.piece.bufferIndex];\n                    const startOffset = this.offsetInBuffer(matchingNode.piece.bufferIndex, matchingNode.piece.start);\n                    return buffer.buffer.substring(startOffset, startOffset + matchingNode.piece.length);\n                }\n                {\n                    const buffer = this._buffers[nodePos.node.piece.bufferIndex];\n                    const startOffset = this.offsetInBuffer(nodePos.node.piece.bufferIndex, nodePos.node.piece.start);\n                    const targetOffset = startOffset + nodePos.remainder;\n                    const targetEnd = startOffset + nodePos.node.piece.length;\n                    return buffer.buffer.substring(targetOffset, targetEnd);\n                }\n            }\n            findMatchesInNode(node, searcher, startLineNumber, startColumn, startCursor, endCursor, searchData, captureMatches, limitResultCount, resultLen, result) {\n                const buffer = this._buffers[node.piece.bufferIndex];\n                const startOffsetInBuffer = this.offsetInBuffer(node.piece.bufferIndex, node.piece.start);\n                const start = this.offsetInBuffer(node.piece.bufferIndex, startCursor);\n                const end = this.offsetInBuffer(node.piece.bufferIndex, endCursor);\n                let m;\n                const ret = {\n                    line: 0,\n                    column: 0\n                };\n                let searchText;\n                let offsetInBuffer;\n                if (searcher._wordSeparators) {\n                    searchText = buffer.buffer.substring(start, end);\n                    offsetInBuffer = (offset)=>offset + start;\n                    searcher.reset(0);\n                } else {\n                    searchText = buffer.buffer;\n                    offsetInBuffer = (offset)=>offset;\n                    searcher.reset(start);\n                }\n                do {\n                    m = searcher.next(searchText);\n                    if (m) {\n                        if (offsetInBuffer(m.index) >= end) return resultLen;\n                        this.positionInBuffer(node, offsetInBuffer(m.index) - startOffsetInBuffer, ret);\n                        const lineFeedCnt = this.getLineFeedCnt(node.piece.bufferIndex, startCursor, ret);\n                        const retStartColumn = ret.line === startCursor.line ? ret.column - startCursor.column + startColumn : ret.column + 1;\n                        const retEndColumn = retStartColumn + m[0].length;\n                        result[resultLen++] = (0, _model_textModelSearch__rspack_import_3.dr)(new _common_range__rspack_import_4.Q(startLineNumber + lineFeedCnt, retStartColumn, startLineNumber + lineFeedCnt, retEndColumn), m, captureMatches);\n                        if (offsetInBuffer(m.index) + m[0].length >= end) return resultLen;\n                        if (resultLen >= limitResultCount) break;\n                    }\n                }while (m)\n                return resultLen;\n            }\n            findMatchesLineByLine(searchRange, searchData, captureMatches, limitResultCount) {\n                const result = [];\n                let resultLen = 0;\n                const searcher = new _model_textModelSearch__rspack_import_3.W5(searchData.wordSeparators, searchData.regex);\n                let startPosition = this.nodeAt2(searchRange.startLineNumber, searchRange.startColumn);\n                if (null === startPosition) return [];\n                const endPosition = this.nodeAt2(searchRange.endLineNumber, searchRange.endColumn);\n                if (null === endPosition) return [];\n                let start = this.positionInBuffer(startPosition.node, startPosition.remainder);\n                const end = this.positionInBuffer(endPosition.node, endPosition.remainder);\n                if (startPosition.node === endPosition.node) {\n                    this.findMatchesInNode(startPosition.node, searcher, searchRange.startLineNumber, searchRange.startColumn, start, end, searchData, captureMatches, limitResultCount, resultLen, result);\n                    return result;\n                }\n                let startLineNumber = searchRange.startLineNumber;\n                let currentNode = startPosition.node;\n                while(currentNode !== endPosition.node){\n                    const lineBreakCnt = this.getLineFeedCnt(currentNode.piece.bufferIndex, start, currentNode.piece.end);\n                    if (lineBreakCnt >= 1) {\n                        const lineStarts = this._buffers[currentNode.piece.bufferIndex].lineStarts;\n                        const startOffsetInBuffer = this.offsetInBuffer(currentNode.piece.bufferIndex, currentNode.piece.start);\n                        const nextLineStartOffset = lineStarts[start.line + lineBreakCnt];\n                        const startColumn = startLineNumber === searchRange.startLineNumber ? searchRange.startColumn : 1;\n                        resultLen = this.findMatchesInNode(currentNode, searcher, startLineNumber, startColumn, start, this.positionInBuffer(currentNode, nextLineStartOffset - startOffsetInBuffer), searchData, captureMatches, limitResultCount, resultLen, result);\n                        if (resultLen >= limitResultCount) return result;\n                        startLineNumber += lineBreakCnt;\n                    }\n                    const startColumn = startLineNumber === searchRange.startLineNumber ? searchRange.startColumn - 1 : 0;\n                    if (startLineNumber === searchRange.endLineNumber) {\n                        const text = this.getLineContent(startLineNumber).substring(startColumn, searchRange.endColumn - 1);\n                        resultLen = this._findMatchesInLine(searchData, searcher, text, searchRange.endLineNumber, startColumn, resultLen, result, captureMatches, limitResultCount);\n                        return result;\n                    }\n                    resultLen = this._findMatchesInLine(searchData, searcher, this.getLineContent(startLineNumber).substr(startColumn), startLineNumber, startColumn, resultLen, result, captureMatches, limitResultCount);\n                    if (resultLen >= limitResultCount) return result;\n                    startLineNumber++;\n                    startPosition = this.nodeAt2(startLineNumber, 1);\n                    currentNode = startPosition.node;\n                    start = this.positionInBuffer(startPosition.node, startPosition.remainder);\n                }\n                if (startLineNumber === searchRange.endLineNumber) {\n                    const startColumn = startLineNumber === searchRange.startLineNumber ? searchRange.startColumn - 1 : 0;\n                    const text = this.getLineContent(startLineNumber).substring(startColumn, searchRange.endColumn - 1);\n                    resultLen = this._findMatchesInLine(searchData, searcher, text, searchRange.endLineNumber, startColumn, resultLen, result, captureMatches, limitResultCount);\n                    return result;\n                }\n                const startColumn = startLineNumber === searchRange.startLineNumber ? searchRange.startColumn : 1;\n                resultLen = this.findMatchesInNode(endPosition.node, searcher, startLineNumber, startColumn, start, end, searchData, captureMatches, limitResultCount, resultLen, result);\n                return result;\n            }\n            _findMatchesInLine(searchData, searcher, text, lineNumber, deltaOffset, resultLen, result, captureMatches, limitResultCount) {\n                const wordSeparators = searchData.wordSeparators;\n                if (!captureMatches && searchData.simpleSearch) {\n                    const searchString = searchData.simpleSearch;\n                    const searchStringLen = searchString.length;\n                    const textLength = text.length;\n                    let lastMatchIndex = -searchStringLen;\n                    while(-1 !== (lastMatchIndex = text.indexOf(searchString, lastMatchIndex + searchStringLen)))if (!wordSeparators || (0, _model_textModelSearch__rspack_import_3.wC)(wordSeparators, text, textLength, lastMatchIndex, searchStringLen)) {\n                        result[resultLen++] = new _common_model__rspack_import_5.Dg(new _common_range__rspack_import_4.Q(lineNumber, lastMatchIndex + 1 + deltaOffset, lineNumber, lastMatchIndex + 1 + searchStringLen + deltaOffset), null);\n                        if (resultLen >= limitResultCount) break;\n                    }\n                    return resultLen;\n                }\n                let m;\n                searcher.reset(0);\n                do {\n                    m = searcher.next(text);\n                    if (m) {\n                        result[resultLen++] = (0, _model_textModelSearch__rspack_import_3.dr)(new _common_range__rspack_import_4.Q(lineNumber, m.index + 1 + deltaOffset, lineNumber, m.index + 1 + m[0].length + deltaOffset), m, captureMatches);\n                        if (resultLen >= limitResultCount) break;\n                    }\n                }while (m)\n                return resultLen;\n            }\n            insert(offset, value, eolNormalized = false) {\n                this._EOLNormalized = this._EOLNormalized && eolNormalized;\n                this._lastVisitedLine.lineNumber = 0;\n                this._lastVisitedLine.value = '';\n                if (this.root !== _rbTreeBase__rspack_import_1.fd) {\n                    const { node, remainder, nodeStartOffset } = this.nodeAt(offset);\n                    const piece = node.piece;\n                    const bufferIndex = piece.bufferIndex;\n                    const insertPosInBuffer = this.positionInBuffer(node, remainder);\n                    if (0 === node.piece.bufferIndex && piece.end.line === this._lastChangeBufferPos.line && piece.end.column === this._lastChangeBufferPos.column && nodeStartOffset + piece.length === offset && value.length < AverageBufferSize) {\n                        this.appendToNode(node, value);\n                        this.computeBufferMetadata();\n                        return;\n                    }\n                    if (nodeStartOffset === offset) {\n                        this.insertContentToNodeLeft(value, node);\n                        this._searchCache.validate(offset);\n                    } else if (nodeStartOffset + node.piece.length > offset) {\n                        const nodesToDel = [];\n                        let newRightPiece = new Piece(piece.bufferIndex, insertPosInBuffer, piece.end, this.getLineFeedCnt(piece.bufferIndex, insertPosInBuffer, piece.end), this.offsetInBuffer(bufferIndex, piece.end) - this.offsetInBuffer(bufferIndex, insertPosInBuffer));\n                        if (this.shouldCheckCRLF() && this.endWithCR(value)) {\n                            const headOfRight = this.nodeCharCodeAt(node, remainder);\n                            if (10 === headOfRight) {\n                                const newStart = {\n                                    line: newRightPiece.start.line + 1,\n                                    column: 0\n                                };\n                                newRightPiece = new Piece(newRightPiece.bufferIndex, newStart, newRightPiece.end, this.getLineFeedCnt(newRightPiece.bufferIndex, newStart, newRightPiece.end), newRightPiece.length - 1);\n                                value += '\\n';\n                            }\n                        }\n                        if (this.shouldCheckCRLF() && this.startWithLF(value)) {\n                            const tailOfLeft = this.nodeCharCodeAt(node, remainder - 1);\n                            if (13 === tailOfLeft) {\n                                const previousPos = this.positionInBuffer(node, remainder - 1);\n                                this.deleteNodeTail(node, previousPos);\n                                value = '\\r' + value;\n                                if (0 === node.piece.length) nodesToDel.push(node);\n                            } else this.deleteNodeTail(node, insertPosInBuffer);\n                        } else this.deleteNodeTail(node, insertPosInBuffer);\n                        const newPieces = this.createNewPieces(value);\n                        if (newRightPiece.length > 0) this.rbInsertRight(node, newRightPiece);\n                        let tmpNode = node;\n                        for(let k = 0; k < newPieces.length; k++)tmpNode = this.rbInsertRight(tmpNode, newPieces[k]);\n                        this.deleteNodes(nodesToDel);\n                    } else this.insertContentToNodeRight(value, node);\n                } else {\n                    const pieces = this.createNewPieces(value);\n                    let node = this.rbInsertLeft(null, pieces[0]);\n                    for(let k = 1; k < pieces.length; k++)node = this.rbInsertRight(node, pieces[k]);\n                }\n                this.computeBufferMetadata();\n            }\n            delete(offset, cnt) {\n                this._lastVisitedLine.lineNumber = 0;\n                this._lastVisitedLine.value = '';\n                if (cnt <= 0 || this.root === _rbTreeBase__rspack_import_1.fd) return;\n                const startPosition = this.nodeAt(offset);\n                const endPosition = this.nodeAt(offset + cnt);\n                const startNode = startPosition.node;\n                const endNode = endPosition.node;\n                if (startNode === endNode) {\n                    const startSplitPosInBuffer = this.positionInBuffer(startNode, startPosition.remainder);\n                    const endSplitPosInBuffer = this.positionInBuffer(startNode, endPosition.remainder);\n                    if (startPosition.nodeStartOffset === offset) {\n                        if (cnt === startNode.piece.length) {\n                            const next = startNode.next();\n                            (0, _rbTreeBase__rspack_import_1.Ct)(this, startNode);\n                            this.validateCRLFWithPrevNode(next);\n                            this.computeBufferMetadata();\n                            return;\n                        }\n                        this.deleteNodeHead(startNode, endSplitPosInBuffer);\n                        this._searchCache.validate(offset);\n                        this.validateCRLFWithPrevNode(startNode);\n                        this.computeBufferMetadata();\n                        return;\n                    }\n                    if (startPosition.nodeStartOffset + startNode.piece.length === offset + cnt) {\n                        this.deleteNodeTail(startNode, startSplitPosInBuffer);\n                        this.validateCRLFWithNextNode(startNode);\n                        this.computeBufferMetadata();\n                        return;\n                    }\n                    this.shrinkNode(startNode, startSplitPosInBuffer, endSplitPosInBuffer);\n                    this.computeBufferMetadata();\n                    return;\n                }\n                const nodesToDel = [];\n                const startSplitPosInBuffer = this.positionInBuffer(startNode, startPosition.remainder);\n                this.deleteNodeTail(startNode, startSplitPosInBuffer);\n                this._searchCache.validate(offset);\n                if (0 === startNode.piece.length) nodesToDel.push(startNode);\n                const endSplitPosInBuffer = this.positionInBuffer(endNode, endPosition.remainder);\n                this.deleteNodeHead(endNode, endSplitPosInBuffer);\n                if (0 === endNode.piece.length) nodesToDel.push(endNode);\n                const secondNode = startNode.next();\n                for(let node = secondNode; node !== _rbTreeBase__rspack_import_1.fd && node !== endNode; node = node.next())nodesToDel.push(node);\n                const prev = 0 === startNode.piece.length ? startNode.prev() : startNode;\n                this.deleteNodes(nodesToDel);\n                this.validateCRLFWithNextNode(prev);\n                this.computeBufferMetadata();\n            }\n            insertContentToNodeLeft(value, node) {\n                const nodesToDel = [];\n                if (this.shouldCheckCRLF() && this.endWithCR(value) && this.startWithLF(node)) {\n                    const piece = node.piece;\n                    const newStart = {\n                        line: piece.start.line + 1,\n                        column: 0\n                    };\n                    const nPiece = new Piece(piece.bufferIndex, newStart, piece.end, this.getLineFeedCnt(piece.bufferIndex, newStart, piece.end), piece.length - 1);\n                    node.piece = nPiece;\n                    value += '\\n';\n                    (0, _rbTreeBase__rspack_import_1.rd)(this, node, -1, -1);\n                    if (0 === node.piece.length) nodesToDel.push(node);\n                }\n                const newPieces = this.createNewPieces(value);\n                let newNode = this.rbInsertLeft(node, newPieces[newPieces.length - 1]);\n                for(let k = newPieces.length - 2; k >= 0; k--)newNode = this.rbInsertLeft(newNode, newPieces[k]);\n                this.validateCRLFWithPrevNode(newNode);\n                this.deleteNodes(nodesToDel);\n            }\n            insertContentToNodeRight(value, node) {\n                if (this.adjustCarriageReturnFromNext(value, node)) value += '\\n';\n                const newPieces = this.createNewPieces(value);\n                const newNode = this.rbInsertRight(node, newPieces[0]);\n                let tmpNode = newNode;\n                for(let k = 1; k < newPieces.length; k++)tmpNode = this.rbInsertRight(tmpNode, newPieces[k]);\n                this.validateCRLFWithPrevNode(newNode);\n            }\n            positionInBuffer(node, remainder, ret) {\n                const piece = node.piece;\n                const bufferIndex = node.piece.bufferIndex;\n                const lineStarts = this._buffers[bufferIndex].lineStarts;\n                const startOffset = lineStarts[piece.start.line] + piece.start.column;\n                const offset = startOffset + remainder;\n                let low = piece.start.line;\n                let high = piece.end.line;\n                let mid = 0;\n                let midStop = 0;\n                let midStart = 0;\n                while(low <= high){\n                    mid = low + (high - low) / 2 | 0;\n                    midStart = lineStarts[mid];\n                    if (mid === high) break;\n                    midStop = lineStarts[mid + 1];\n                    if (offset < midStart) high = mid - 1;\n                    else if (offset >= midStop) low = mid + 1;\n                    else break;\n                }\n                if (ret) {\n                    ret.line = mid;\n                    ret.column = offset - midStart;\n                    return null;\n                }\n                return {\n                    line: mid,\n                    column: offset - midStart\n                };\n            }\n            getLineFeedCnt(bufferIndex, start, end) {\n                if (0 === end.column) return end.line - start.line;\n                const lineStarts = this._buffers[bufferIndex].lineStarts;\n                if (end.line === lineStarts.length - 1) return end.line - start.line;\n                const nextLineStartOffset = lineStarts[end.line + 1];\n                const endOffset = lineStarts[end.line] + end.column;\n                if (nextLineStartOffset > endOffset + 1) return end.line - start.line;\n                const previousCharOffset = endOffset - 1;\n                const buffer = this._buffers[bufferIndex].buffer;\n                if (13 === buffer.charCodeAt(previousCharOffset)) return end.line - start.line + 1;\n                return end.line - start.line;\n            }\n            offsetInBuffer(bufferIndex, cursor) {\n                const lineStarts = this._buffers[bufferIndex].lineStarts;\n                return lineStarts[cursor.line] + cursor.column;\n            }\n            deleteNodes(nodes) {\n                for(let i = 0; i < nodes.length; i++)(0, _rbTreeBase__rspack_import_1.Ct)(this, nodes[i]);\n            }\n            createNewPieces(text) {\n                if (text.length > AverageBufferSize) {\n                    const newPieces = [];\n                    while(text.length > AverageBufferSize){\n                        const lastChar = text.charCodeAt(AverageBufferSize - 1);\n                        let splitText;\n                        if (13 === lastChar || lastChar >= 0xd800 && lastChar <= 0xdbff) {\n                            splitText = text.substring(0, AverageBufferSize - 1);\n                            text = text.substring(AverageBufferSize - 1);\n                        } else {\n                            splitText = text.substring(0, AverageBufferSize);\n                            text = text.substring(AverageBufferSize);\n                        }\n                        const lineStarts = createLineStartsFast(splitText);\n                        newPieces.push(new Piece(this._buffers.length, {\n                            line: 0,\n                            column: 0\n                        }, {\n                            line: lineStarts.length - 1,\n                            column: splitText.length - lineStarts[lineStarts.length - 1]\n                        }, lineStarts.length - 1, splitText.length));\n                        this._buffers.push(new StringBuffer(splitText, lineStarts));\n                    }\n                    const lineStarts = createLineStartsFast(text);\n                    newPieces.push(new Piece(this._buffers.length, {\n                        line: 0,\n                        column: 0\n                    }, {\n                        line: lineStarts.length - 1,\n                        column: text.length - lineStarts[lineStarts.length - 1]\n                    }, lineStarts.length - 1, text.length));\n                    this._buffers.push(new StringBuffer(text, lineStarts));\n                    return newPieces;\n                }\n                let startOffset = this._buffers[0].buffer.length;\n                const lineStarts = createLineStartsFast(text, false);\n                let start = this._lastChangeBufferPos;\n                if (this._buffers[0].lineStarts[this._buffers[0].lineStarts.length - 1] === startOffset && 0 !== startOffset && this.startWithLF(text) && this.endWithCR(this._buffers[0].buffer)) {\n                    this._lastChangeBufferPos = {\n                        line: this._lastChangeBufferPos.line,\n                        column: this._lastChangeBufferPos.column + 1\n                    };\n                    start = this._lastChangeBufferPos;\n                    for(let i = 0; i < lineStarts.length; i++)lineStarts[i] += startOffset + 1;\n                    this._buffers[0].lineStarts = this._buffers[0].lineStarts.concat(lineStarts.slice(1));\n                    this._buffers[0].buffer += '_' + text;\n                    startOffset += 1;\n                } else {\n                    if (0 !== startOffset) for(let i = 0; i < lineStarts.length; i++)lineStarts[i] += startOffset;\n                    this._buffers[0].lineStarts = this._buffers[0].lineStarts.concat(lineStarts.slice(1));\n                    this._buffers[0].buffer += text;\n                }\n                const endOffset = this._buffers[0].buffer.length;\n                const endIndex = this._buffers[0].lineStarts.length - 1;\n                const endColumn = endOffset - this._buffers[0].lineStarts[endIndex];\n                const endPos = {\n                    line: endIndex,\n                    column: endColumn\n                };\n                const newPiece = new Piece(0, start, endPos, this.getLineFeedCnt(0, start, endPos), endOffset - startOffset);\n                this._lastChangeBufferPos = endPos;\n                return [\n                    newPiece\n                ];\n            }\n            getLinesRawContent() {\n                return this.getContentOfSubTree(this.root);\n            }\n            getLineRawContent(lineNumber, endOffset = 0) {\n                let x = this.root;\n                let ret = '';\n                const cache = this._searchCache.get2(lineNumber);\n                if (cache) {\n                    x = cache.node;\n                    const prevAccumulatedValue = this.getAccumulatedValue(x, lineNumber - cache.nodeStartLineNumber - 1);\n                    const buffer = this._buffers[x.piece.bufferIndex].buffer;\n                    const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                    if (cache.nodeStartLineNumber + x.piece.lineFeedCnt === lineNumber) ret = buffer.substring(startOffset + prevAccumulatedValue, startOffset + x.piece.length);\n                    else {\n                        const accumulatedValue = this.getAccumulatedValue(x, lineNumber - cache.nodeStartLineNumber);\n                        return buffer.substring(startOffset + prevAccumulatedValue, startOffset + accumulatedValue - endOffset);\n                    }\n                } else {\n                    let nodeStartOffset = 0;\n                    const originalLineNumber = lineNumber;\n                    while(x !== _rbTreeBase__rspack_import_1.fd)if (x.left !== _rbTreeBase__rspack_import_1.fd && x.lf_left >= lineNumber - 1) x = x.left;\n                    else if (x.lf_left + x.piece.lineFeedCnt > lineNumber - 1) {\n                        const prevAccumulatedValue = this.getAccumulatedValue(x, lineNumber - x.lf_left - 2);\n                        const accumulatedValue = this.getAccumulatedValue(x, lineNumber - x.lf_left - 1);\n                        const buffer = this._buffers[x.piece.bufferIndex].buffer;\n                        const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                        nodeStartOffset += x.size_left;\n                        this._searchCache.set({\n                            node: x,\n                            nodeStartOffset,\n                            nodeStartLineNumber: originalLineNumber - (lineNumber - 1 - x.lf_left)\n                        });\n                        return buffer.substring(startOffset + prevAccumulatedValue, startOffset + accumulatedValue - endOffset);\n                    } else if (x.lf_left + x.piece.lineFeedCnt === lineNumber - 1) {\n                        const prevAccumulatedValue = this.getAccumulatedValue(x, lineNumber - x.lf_left - 2);\n                        const buffer = this._buffers[x.piece.bufferIndex].buffer;\n                        const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                        ret = buffer.substring(startOffset + prevAccumulatedValue, startOffset + x.piece.length);\n                        break;\n                    } else {\n                        lineNumber -= x.lf_left + x.piece.lineFeedCnt;\n                        nodeStartOffset += x.size_left + x.piece.length;\n                        x = x.right;\n                    }\n                }\n                x = x.next();\n                while(x !== _rbTreeBase__rspack_import_1.fd){\n                    const buffer = this._buffers[x.piece.bufferIndex].buffer;\n                    if (x.piece.lineFeedCnt > 0) {\n                        const accumulatedValue = this.getAccumulatedValue(x, 0);\n                        const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                        ret += buffer.substring(startOffset, startOffset + accumulatedValue - endOffset);\n                        break;\n                    }\n                    {\n                        const startOffset = this.offsetInBuffer(x.piece.bufferIndex, x.piece.start);\n                        ret += buffer.substr(startOffset, x.piece.length);\n                    }\n                    x = x.next();\n                }\n                return ret;\n            }\n            computeBufferMetadata() {\n                let x = this.root;\n                let lfCnt = 1;\n                let len = 0;\n                while(x !== _rbTreeBase__rspack_import_1.fd){\n                    lfCnt += x.lf_left + x.piece.lineFeedCnt;\n                    len += x.size_left + x.piece.length;\n                    x = x.right;\n                }\n                this._lineCnt = lfCnt;\n                this._length = len;\n                this._searchCache.validate(this._length);\n            }\n            getIndexOf(node, accumulatedValue) {\n                const piece = node.piece;\n                const pos = this.positionInBuffer(node, accumulatedValue);\n                const lineCnt = pos.line - piece.start.line;\n                if (this.offsetInBuffer(piece.bufferIndex, piece.end) - this.offsetInBuffer(piece.bufferIndex, piece.start) === accumulatedValue) {\n                    const realLineCnt = this.getLineFeedCnt(node.piece.bufferIndex, piece.start, pos);\n                    if (realLineCnt !== lineCnt) return {\n                        index: realLineCnt,\n                        remainder: 0\n                    };\n                }\n                return {\n                    index: lineCnt,\n                    remainder: pos.column\n                };\n            }\n            getAccumulatedValue(node, index) {\n                if (index < 0) return 0;\n                const piece = node.piece;\n                const lineStarts = this._buffers[piece.bufferIndex].lineStarts;\n                const expectedLineStartIndex = piece.start.line + index + 1;\n                if (expectedLineStartIndex > piece.end.line) return lineStarts[piece.end.line] + piece.end.column - lineStarts[piece.start.line] - piece.start.column;\n                return lineStarts[expectedLineStartIndex] - lineStarts[piece.start.line] - piece.start.column;\n            }\n            deleteNodeTail(node, pos) {\n                const piece = node.piece;\n                const originalLFCnt = piece.lineFeedCnt;\n                const originalEndOffset = this.offsetInBuffer(piece.bufferIndex, piece.end);\n                const newEnd = pos;\n                const newEndOffset = this.offsetInBuffer(piece.bufferIndex, newEnd);\n                const newLineFeedCnt = this.getLineFeedCnt(piece.bufferIndex, piece.start, newEnd);\n                const lf_delta = newLineFeedCnt - originalLFCnt;\n                const size_delta = newEndOffset - originalEndOffset;\n                const newLength = piece.length + size_delta;\n                node.piece = new Piece(piece.bufferIndex, piece.start, newEnd, newLineFeedCnt, newLength);\n                (0, _rbTreeBase__rspack_import_1.rd)(this, node, size_delta, lf_delta);\n            }\n            deleteNodeHead(node, pos) {\n                const piece = node.piece;\n                const originalLFCnt = piece.lineFeedCnt;\n                const originalStartOffset = this.offsetInBuffer(piece.bufferIndex, piece.start);\n                const newStart = pos;\n                const newLineFeedCnt = this.getLineFeedCnt(piece.bufferIndex, newStart, piece.end);\n                const newStartOffset = this.offsetInBuffer(piece.bufferIndex, newStart);\n                const lf_delta = newLineFeedCnt - originalLFCnt;\n                const size_delta = originalStartOffset - newStartOffset;\n                const newLength = piece.length + size_delta;\n                node.piece = new Piece(piece.bufferIndex, newStart, piece.end, newLineFeedCnt, newLength);\n                (0, _rbTreeBase__rspack_import_1.rd)(this, node, size_delta, lf_delta);\n            }\n            shrinkNode(node, start, end) {\n                const piece = node.piece;\n                const originalStartPos = piece.start;\n                const originalEndPos = piece.end;\n                const oldLength = piece.length;\n                const oldLFCnt = piece.lineFeedCnt;\n                const newEnd = start;\n                const newLineFeedCnt = this.getLineFeedCnt(piece.bufferIndex, piece.start, newEnd);\n                const newLength = this.offsetInBuffer(piece.bufferIndex, start) - this.offsetInBuffer(piece.bufferIndex, originalStartPos);\n                node.piece = new Piece(piece.bufferIndex, piece.start, newEnd, newLineFeedCnt, newLength);\n                (0, _rbTreeBase__rspack_import_1.rd)(this, node, newLength - oldLength, newLineFeedCnt - oldLFCnt);\n                const newPiece = new Piece(piece.bufferIndex, end, originalEndPos, this.getLineFeedCnt(piece.bufferIndex, end, originalEndPos), this.offsetInBuffer(piece.bufferIndex, originalEndPos) - this.offsetInBuffer(piece.bufferIndex, end));\n                const newNode = this.rbInsertRight(node, newPiece);\n                this.validateCRLFWithPrevNode(newNode);\n            }\n            appendToNode(node, value) {\n                if (this.adjustCarriageReturnFromNext(value, node)) value += '\\n';\n                const hitCRLF = this.shouldCheckCRLF() && this.startWithLF(value) && this.endWithCR(node);\n                const startOffset = this._buffers[0].buffer.length;\n                this._buffers[0].buffer += value;\n                const lineStarts = createLineStartsFast(value, false);\n                for(let i = 0; i < lineStarts.length; i++)lineStarts[i] += startOffset;\n                if (hitCRLF) {\n                    const prevStartOffset = this._buffers[0].lineStarts[this._buffers[0].lineStarts.length - 2];\n                    this._buffers[0].lineStarts.pop();\n                    this._lastChangeBufferPos = {\n                        line: this._lastChangeBufferPos.line - 1,\n                        column: startOffset - prevStartOffset\n                    };\n                }\n                this._buffers[0].lineStarts = this._buffers[0].lineStarts.concat(lineStarts.slice(1));\n                const endIndex = this._buffers[0].lineStarts.length - 1;\n                const endColumn = this._buffers[0].buffer.length - this._buffers[0].lineStarts[endIndex];\n                const newEnd = {\n                    line: endIndex,\n                    column: endColumn\n                };\n                const newLength = node.piece.length + value.length;\n                const oldLineFeedCnt = node.piece.lineFeedCnt;\n                const newLineFeedCnt = this.getLineFeedCnt(0, node.piece.start, newEnd);\n                const lf_delta = newLineFeedCnt - oldLineFeedCnt;\n                node.piece = new Piece(node.piece.bufferIndex, node.piece.start, newEnd, newLineFeedCnt, newLength);\n                this._lastChangeBufferPos = newEnd;\n                (0, _rbTreeBase__rspack_import_1.rd)(this, node, value.length, lf_delta);\n            }\n            nodeAt(offset) {\n                let x = this.root;\n                const cache = this._searchCache.get(offset);\n                if (cache) return {\n                    node: cache.node,\n                    nodeStartOffset: cache.nodeStartOffset,\n                    remainder: offset - cache.nodeStartOffset\n                };\n                let nodeStartOffset = 0;\n                while(x !== _rbTreeBase__rspack_import_1.fd)if (x.size_left > offset) x = x.left;\n                else if (x.size_left + x.piece.length >= offset) {\n                    nodeStartOffset += x.size_left;\n                    const ret = {\n                        node: x,\n                        remainder: offset - x.size_left,\n                        nodeStartOffset\n                    };\n                    this._searchCache.set(ret);\n                    return ret;\n                } else {\n                    offset -= x.size_left + x.piece.length;\n                    nodeStartOffset += x.size_left + x.piece.length;\n                    x = x.right;\n                }\n                return null;\n            }\n            nodeAt2(lineNumber, column) {\n                let x = this.root;\n                let nodeStartOffset = 0;\n                while(x !== _rbTreeBase__rspack_import_1.fd)if (x.left !== _rbTreeBase__rspack_import_1.fd && x.lf_left >= lineNumber - 1) x = x.left;\n                else if (x.lf_left + x.piece.lineFeedCnt > lineNumber - 1) {\n                    const prevAccumualtedValue = this.getAccumulatedValue(x, lineNumber - x.lf_left - 2);\n                    const accumulatedValue = this.getAccumulatedValue(x, lineNumber - x.lf_left - 1);\n                    nodeStartOffset += x.size_left;\n                    return {\n                        node: x,\n                        remainder: Math.min(prevAccumualtedValue + column - 1, accumulatedValue),\n                        nodeStartOffset\n                    };\n                } else if (x.lf_left + x.piece.lineFeedCnt === lineNumber - 1) {\n                    const prevAccumualtedValue = this.getAccumulatedValue(x, lineNumber - x.lf_left - 2);\n                    if (prevAccumualtedValue + column - 1 <= x.piece.length) return {\n                        node: x,\n                        remainder: prevAccumualtedValue + column - 1,\n                        nodeStartOffset\n                    };\n                    column -= x.piece.length - prevAccumualtedValue;\n                    break;\n                } else {\n                    lineNumber -= x.lf_left + x.piece.lineFeedCnt;\n                    nodeStartOffset += x.size_left + x.piece.length;\n                    x = x.right;\n                }\n                x = x.next();\n                while(x !== _rbTreeBase__rspack_import_1.fd){\n                    if (x.piece.lineFeedCnt > 0) {\n                        const accumulatedValue = this.getAccumulatedValue(x, 0);\n                        const nodeStartOffset = this.offsetOfNode(x);\n                        return {\n                            node: x,\n                            remainder: Math.min(column - 1, accumulatedValue),\n                            nodeStartOffset\n                        };\n                    }\n                    if (x.piece.length >= column - 1) {\n                        const nodeStartOffset = this.offsetOfNode(x);\n                        return {\n                            node: x,\n                            remainder: column - 1,\n                            nodeStartOffset\n                        };\n                    }\n                    column -= x.piece.length;\n                    x = x.next();\n                }\n                return null;\n            }\n            nodeCharCodeAt(node, offset) {\n                if (node.piece.lineFeedCnt < 1) return -1;\n                const buffer = this._buffers[node.piece.bufferIndex];\n                const newOffset = this.offsetInBuffer(node.piece.bufferIndex, node.piece.start) + offset;\n                return buffer.buffer.charCodeAt(newOffset);\n            }\n            offsetOfNode(node) {\n                if (!node) return 0;\n                let pos = node.size_left;\n                while(node !== this.root){\n                    if (node.parent.right === node) pos += node.parent.size_left + node.parent.piece.length;\n                    node = node.parent;\n                }\n                return pos;\n            }\n            shouldCheckCRLF() {\n                return !(this._EOLNormalized && '\\n' === this._EOL);\n            }\n            startWithLF(val) {\n                if ('string' == typeof val) return 10 === val.charCodeAt(0);\n                if (val === _rbTreeBase__rspack_import_1.fd || 0 === val.piece.lineFeedCnt) return false;\n                const piece = val.piece;\n                const lineStarts = this._buffers[piece.bufferIndex].lineStarts;\n                const line = piece.start.line;\n                const startOffset = lineStarts[line] + piece.start.column;\n                if (line === lineStarts.length - 1) return false;\n                const nextLineOffset = lineStarts[line + 1];\n                if (nextLineOffset > startOffset + 1) return false;\n                return 10 === this._buffers[piece.bufferIndex].buffer.charCodeAt(startOffset);\n            }\n            endWithCR(val) {\n                if ('string' == typeof val) return 13 === val.charCodeAt(val.length - 1);\n                if (val === _rbTreeBase__rspack_import_1.fd || 0 === val.piece.lineFeedCnt) return false;\n                return 13 === this.nodeCharCodeAt(val, val.piece.length - 1);\n            }\n            validateCRLFWithPrevNode(nextNode) {\n                if (this.shouldCheckCRLF() && this.startWithLF(nextNode)) {\n                    const node = nextNode.prev();\n                    if (this.endWithCR(node)) this.fixCRLF(node, nextNode);\n                }\n            }\n            validateCRLFWithNextNode(node) {\n                if (this.shouldCheckCRLF() && this.endWithCR(node)) {\n                    const nextNode = node.next();\n                    if (this.startWithLF(nextNode)) this.fixCRLF(node, nextNode);\n                }\n            }\n            fixCRLF(prev, next) {\n                const nodesToDel = [];\n                const lineStarts = this._buffers[prev.piece.bufferIndex].lineStarts;\n                let newEnd;\n                newEnd = 0 === prev.piece.end.column ? {\n                    line: prev.piece.end.line - 1,\n                    column: lineStarts[prev.piece.end.line] - lineStarts[prev.piece.end.line - 1] - 1\n                } : {\n                    line: prev.piece.end.line,\n                    column: prev.piece.end.column - 1\n                };\n                const prevNewLength = prev.piece.length - 1;\n                const prevNewLFCnt = prev.piece.lineFeedCnt - 1;\n                prev.piece = new Piece(prev.piece.bufferIndex, prev.piece.start, newEnd, prevNewLFCnt, prevNewLength);\n                (0, _rbTreeBase__rspack_import_1.rd)(this, prev, -1, -1);\n                if (0 === prev.piece.length) nodesToDel.push(prev);\n                const newStart = {\n                    line: next.piece.start.line + 1,\n                    column: 0\n                };\n                const newLength = next.piece.length - 1;\n                const newLineFeedCnt = this.getLineFeedCnt(next.piece.bufferIndex, newStart, next.piece.end);\n                next.piece = new Piece(next.piece.bufferIndex, newStart, next.piece.end, newLineFeedCnt, newLength);\n                (0, _rbTreeBase__rspack_import_1.rd)(this, next, -1, -1);\n                if (0 === next.piece.length) nodesToDel.push(next);\n                const pieces = this.createNewPieces('\\r\\n');\n                this.rbInsertRight(prev, pieces[0]);\n                for(let i = 0; i < nodesToDel.length; i++)(0, _rbTreeBase__rspack_import_1.Ct)(this, nodesToDel[i]);\n            }\n            adjustCarriageReturnFromNext(value, node) {\n                if (this.shouldCheckCRLF() && this.endWithCR(value)) {\n                    const nextNode = node.next();\n                    if (this.startWithLF(nextNode)) {\n                        value += '\\n';\n                        if (1 === nextNode.piece.length) (0, _rbTreeBase__rspack_import_1.Ct)(this, nextNode);\n                        else {\n                            const piece = nextNode.piece;\n                            const newStart = {\n                                line: piece.start.line + 1,\n                                column: 0\n                            };\n                            const newLength = piece.length - 1;\n                            const newLineFeedCnt = this.getLineFeedCnt(piece.bufferIndex, newStart, piece.end);\n                            nextNode.piece = new Piece(piece.bufferIndex, newStart, piece.end, newLineFeedCnt, newLength);\n                            (0, _rbTreeBase__rspack_import_1.rd)(this, nextNode, -1, -1);\n                        }\n                        return true;\n                    }\n                }\n                return false;\n            }\n            iterate(node, callback) {\n                if (node === _rbTreeBase__rspack_import_1.fd) return callback(_rbTreeBase__rspack_import_1.fd);\n                const leftRet = this.iterate(node.left, callback);\n                if (!leftRet) return leftRet;\n                return callback(node) && this.iterate(node.right, callback);\n            }\n            getNodeContent(node) {\n                if (node === _rbTreeBase__rspack_import_1.fd) return '';\n                const buffer = this._buffers[node.piece.bufferIndex];\n                const piece = node.piece;\n                const startOffset = this.offsetInBuffer(piece.bufferIndex, piece.start);\n                const endOffset = this.offsetInBuffer(piece.bufferIndex, piece.end);\n                const currentContent = buffer.buffer.substring(startOffset, endOffset);\n                return currentContent;\n            }\n            getPieceContent(piece) {\n                const buffer = this._buffers[piece.bufferIndex];\n                const startOffset = this.offsetInBuffer(piece.bufferIndex, piece.start);\n                const endOffset = this.offsetInBuffer(piece.bufferIndex, piece.end);\n                const currentContent = buffer.buffer.substring(startOffset, endOffset);\n                return currentContent;\n            }\n            rbInsertRight(node, p) {\n                const z = new _rbTreeBase__rspack_import_1.nF(p, 1);\n                z.left = _rbTreeBase__rspack_import_1.fd;\n                z.right = _rbTreeBase__rspack_import_1.fd;\n                z.parent = _rbTreeBase__rspack_import_1.fd;\n                z.size_left = 0;\n                z.lf_left = 0;\n                const x = this.root;\n                if (x === _rbTreeBase__rspack_import_1.fd) {\n                    this.root = z;\n                    z.color = 0;\n                } else if (node.right === _rbTreeBase__rspack_import_1.fd) {\n                    node.right = z;\n                    z.parent = node;\n                } else {\n                    const nextNode = (0, _rbTreeBase__rspack_import_1.cL)(node.right);\n                    nextNode.left = z;\n                    z.parent = nextNode;\n                }\n                (0, _rbTreeBase__rspack_import_1.Z2)(this, z);\n                return z;\n            }\n            rbInsertLeft(node, p) {\n                const z = new _rbTreeBase__rspack_import_1.nF(p, 1);\n                z.left = _rbTreeBase__rspack_import_1.fd;\n                z.right = _rbTreeBase__rspack_import_1.fd;\n                z.parent = _rbTreeBase__rspack_import_1.fd;\n                z.size_left = 0;\n                z.lf_left = 0;\n                if (this.root === _rbTreeBase__rspack_import_1.fd) {\n                    this.root = z;\n                    z.color = 0;\n                } else if (node.left === _rbTreeBase__rspack_import_1.fd) {\n                    node.left = z;\n                    z.parent = node;\n                } else {\n                    const prevNode = (0, _rbTreeBase__rspack_import_1.r9)(node.left);\n                    prevNode.right = z;\n                    z.parent = prevNode;\n                }\n                (0, _rbTreeBase__rspack_import_1.Z2)(this, z);\n                return z;\n            }\n            getContentOfSubTree(node) {\n                let str = '';\n                this.iterate(node, (node)=>{\n                    str += this.getNodeContent(node);\n                    return true;\n                });\n                return str;\n            }\n        }\n    },\n    260 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            of: ()=>DefaultEndOfLine,\n            xj: ()=>PieceTreeTextBufferBuilder\n        });\n        var _pieceTreeBase__rspack_import_1 = __webpack_require__(891);\n        const UTF8_BOM_CHARACTER = String.fromCharCode(65279);\n        function startsWithUTF8BOM(str) {\n            return !!(str && str.length > 0 && 65279 === str.charCodeAt(0));\n        }\n        var DefaultEndOfLine = /*#__PURE__*/ function(DefaultEndOfLine) {\n            DefaultEndOfLine[DefaultEndOfLine[\"LF\"] = 1] = \"LF\";\n            DefaultEndOfLine[DefaultEndOfLine[\"CRLF\"] = 2] = \"CRLF\";\n            return DefaultEndOfLine;\n        }({});\n        class PieceTreeTextBufferFactory {\n            _chunks;\n            _bom;\n            _cr;\n            _lf;\n            _crlf;\n            _normalizeEOL;\n            constructor(_chunks, _bom, _cr, _lf, _crlf, _normalizeEOL){\n                this._chunks = _chunks;\n                this._bom = _bom;\n                this._cr = _cr;\n                this._lf = _lf;\n                this._crlf = _crlf;\n                this._normalizeEOL = _normalizeEOL;\n            }\n            _getEOL(defaultEOL) {\n                const totalEOLCount = this._cr + this._lf + this._crlf;\n                const totalCRCount = this._cr + this._crlf;\n                if (0 === totalEOLCount) return 1 === defaultEOL ? '\\n' : '\\r\\n';\n                if (totalCRCount > totalEOLCount / 2) return '\\r\\n';\n                return '\\n';\n            }\n            create(defaultEOL) {\n                const eol = this._getEOL(defaultEOL);\n                const chunks = this._chunks;\n                if (this._normalizeEOL && ('\\r\\n' === eol && (this._cr > 0 || this._lf > 0) || '\\n' === eol && (this._cr > 0 || this._crlf > 0))) for(let i = 0, len = chunks.length; i < len; i++){\n                    const str = chunks[i].buffer.replace(/\\r\\n|\\r|\\n/g, eol);\n                    const newLineStart = (0, _pieceTreeBase__rspack_import_1.Ep)(str);\n                    chunks[i] = new _pieceTreeBase__rspack_import_1.CV(str, newLineStart);\n                }\n                return new _pieceTreeBase__rspack_import_1.Ux(chunks, eol, this._normalizeEOL);\n            }\n            getFirstLineText(lengthLimit) {\n                return this._chunks[0].buffer.substr(0, 100).split(/\\r\\n|\\r|\\n/)[0];\n            }\n        }\n        class PieceTreeTextBufferBuilder {\n            chunks;\n            BOM;\n            _hasPreviousChar;\n            _previousChar;\n            _tmpLineStarts;\n            cr;\n            lf;\n            crlf;\n            constructor(){\n                this.chunks = [];\n                this.BOM = '';\n                this._hasPreviousChar = false;\n                this._previousChar = 0;\n                this._tmpLineStarts = [];\n                this.cr = 0;\n                this.lf = 0;\n                this.crlf = 0;\n            }\n            acceptChunk(chunk) {\n                if (0 === chunk.length) return;\n                if (0 === this.chunks.length) {\n                    if (startsWithUTF8BOM(chunk)) {\n                        this.BOM = UTF8_BOM_CHARACTER;\n                        chunk = chunk.substr(1);\n                    }\n                }\n                const lastChar = chunk.charCodeAt(chunk.length - 1);\n                if (13 === lastChar || lastChar >= 0xd800 && lastChar <= 0xdbff) {\n                    this._acceptChunk1(chunk.substr(0, chunk.length - 1), false);\n                    this._hasPreviousChar = true;\n                    this._previousChar = lastChar;\n                } else {\n                    this._acceptChunk1(chunk, false);\n                    this._hasPreviousChar = false;\n                    this._previousChar = lastChar;\n                }\n            }\n            _acceptChunk1(chunk, allowEmptyStrings) {\n                if (!allowEmptyStrings && 0 === chunk.length) return;\n                if (this._hasPreviousChar) this._acceptChunk2(String.fromCharCode(this._previousChar) + chunk);\n                else this._acceptChunk2(chunk);\n            }\n            _acceptChunk2(chunk) {\n                const lineStarts = (0, _pieceTreeBase__rspack_import_1.g4)(this._tmpLineStarts, chunk);\n                this.chunks.push(new _pieceTreeBase__rspack_import_1.CV(chunk, lineStarts.lineStarts));\n                this.cr += lineStarts.cr;\n                this.lf += lineStarts.lf;\n                this.crlf += lineStarts.crlf;\n            }\n            finish(normalizeEOL = true) {\n                this._finish();\n                return new PieceTreeTextBufferFactory(this.chunks, this.BOM, this.cr, this.lf, this.crlf, normalizeEOL);\n            }\n            _finish() {\n                if (0 === this.chunks.length) this._acceptChunk1('', true);\n                if (this._hasPreviousChar) {\n                    this._hasPreviousChar = false;\n                    const lastChunk = this.chunks[this.chunks.length - 1];\n                    lastChunk.buffer += String.fromCharCode(this._previousChar);\n                    const newLineStarts = (0, _pieceTreeBase__rspack_import_1.Ep)(lastChunk.buffer);\n                    lastChunk.lineStarts = newLineStarts;\n                    if (13 === this._previousChar) this.cr++;\n                }\n            }\n        }\n    },\n    267 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            Ct: ()=>rbDelete,\n            Z2: ()=>fixInsert,\n            cL: ()=>leftest,\n            fd: ()=>SENTINEL,\n            nF: ()=>TreeNode,\n            r9: ()=>righttest,\n            rd: ()=>updateTreeMetadata\n        });\n        class TreeNode {\n            parent;\n            left;\n            right;\n            color;\n            piece;\n            size_left;\n            lf_left;\n            constructor(piece, color){\n                this.piece = piece;\n                this.color = color;\n                this.size_left = 0;\n                this.lf_left = 0;\n                this.parent = this;\n                this.left = this;\n                this.right = this;\n            }\n            next() {\n                if (this.right !== SENTINEL) return leftest(this.right);\n                let node = this;\n                while(node.parent !== SENTINEL){\n                    if (node.parent.left === node) break;\n                    node = node.parent;\n                }\n                if (node.parent === SENTINEL) return SENTINEL;\n                return node.parent;\n            }\n            prev() {\n                if (this.left !== SENTINEL) return righttest(this.left);\n                let node = this;\n                while(node.parent !== SENTINEL){\n                    if (node.parent.right === node) break;\n                    node = node.parent;\n                }\n                if (node.parent === SENTINEL) return SENTINEL;\n                return node.parent;\n            }\n            detach() {\n                this.parent = null;\n                this.left = null;\n                this.right = null;\n            }\n        }\n        const SENTINEL = new TreeNode(null, 0);\n        SENTINEL.parent = SENTINEL;\n        SENTINEL.left = SENTINEL;\n        SENTINEL.right = SENTINEL;\n        SENTINEL.color = 0;\n        function leftest(node) {\n            while(node.left !== SENTINEL)node = node.left;\n            return node;\n        }\n        function righttest(node) {\n            while(node.right !== SENTINEL)node = node.right;\n            return node;\n        }\n        function calculateSize(node) {\n            if (node === SENTINEL) return 0;\n            return node.size_left + node.piece.length + calculateSize(node.right);\n        }\n        function calculateLF(node) {\n            if (node === SENTINEL) return 0;\n            return node.lf_left + node.piece.lineFeedCnt + calculateLF(node.right);\n        }\n        function resetSentinel() {\n            SENTINEL.parent = SENTINEL;\n        }\n        function leftRotate(tree, x) {\n            const y = x.right;\n            y.size_left += x.size_left + (x.piece ? x.piece.length : 0);\n            y.lf_left += x.lf_left + (x.piece ? x.piece.lineFeedCnt : 0);\n            x.right = y.left;\n            if (y.left !== SENTINEL) y.left.parent = x;\n            y.parent = x.parent;\n            if (x.parent === SENTINEL) tree.root = y;\n            else if (x.parent.left === x) x.parent.left = y;\n            else x.parent.right = y;\n            y.left = x;\n            x.parent = y;\n        }\n        function rightRotate(tree, y) {\n            const x = y.left;\n            y.left = x.right;\n            if (x.right !== SENTINEL) x.right.parent = y;\n            x.parent = y.parent;\n            y.size_left -= x.size_left + (x.piece ? x.piece.length : 0);\n            y.lf_left -= x.lf_left + (x.piece ? x.piece.lineFeedCnt : 0);\n            if (y.parent === SENTINEL) tree.root = x;\n            else if (y === y.parent.right) y.parent.right = x;\n            else y.parent.left = x;\n            x.right = y;\n            y.parent = x;\n        }\n        function rbDelete(tree, z) {\n            let x;\n            let y;\n            if (z.left === SENTINEL) {\n                y = z;\n                x = y.right;\n            } else if (z.right === SENTINEL) {\n                y = z;\n                x = y.left;\n            } else {\n                y = leftest(z.right);\n                x = y.right;\n            }\n            if (y === tree.root) {\n                tree.root = x;\n                x.color = 0;\n                z.detach();\n                resetSentinel();\n                tree.root.parent = SENTINEL;\n                return;\n            }\n            const yWasRed = 1 === y.color;\n            if (y === y.parent.left) y.parent.left = x;\n            else y.parent.right = x;\n            if (y === z) {\n                x.parent = y.parent;\n                recomputeTreeMetadata(tree, x);\n            } else {\n                if (y.parent === z) x.parent = y;\n                else x.parent = y.parent;\n                recomputeTreeMetadata(tree, x);\n                y.left = z.left;\n                y.right = z.right;\n                y.parent = z.parent;\n                y.color = z.color;\n                if (z === tree.root) tree.root = y;\n                else if (z === z.parent.left) z.parent.left = y;\n                else z.parent.right = y;\n                if (y.left !== SENTINEL) y.left.parent = y;\n                if (y.right !== SENTINEL) y.right.parent = y;\n                y.size_left = z.size_left;\n                y.lf_left = z.lf_left;\n                recomputeTreeMetadata(tree, y);\n            }\n            z.detach();\n            if (x.parent.left === x) {\n                const newSizeLeft = calculateSize(x);\n                const newLFLeft = calculateLF(x);\n                if (newSizeLeft !== x.parent.size_left || newLFLeft !== x.parent.lf_left) {\n                    const delta = newSizeLeft - x.parent.size_left;\n                    const lf_delta = newLFLeft - x.parent.lf_left;\n                    x.parent.size_left = newSizeLeft;\n                    x.parent.lf_left = newLFLeft;\n                    updateTreeMetadata(tree, x.parent, delta, lf_delta);\n                }\n            }\n            recomputeTreeMetadata(tree, x.parent);\n            if (yWasRed) return void resetSentinel();\n            let w;\n            while(x !== tree.root && 0 === x.color)if (x === x.parent.left) {\n                w = x.parent.right;\n                if (1 === w.color) {\n                    w.color = 0;\n                    x.parent.color = 1;\n                    leftRotate(tree, x.parent);\n                    w = x.parent.right;\n                }\n                if (0 === w.left.color && 0 === w.right.color) {\n                    w.color = 1;\n                    x = x.parent;\n                } else {\n                    if (0 === w.right.color) {\n                        w.left.color = 0;\n                        w.color = 1;\n                        rightRotate(tree, w);\n                        w = x.parent.right;\n                    }\n                    w.color = x.parent.color;\n                    x.parent.color = 0;\n                    w.right.color = 0;\n                    leftRotate(tree, x.parent);\n                    x = tree.root;\n                }\n            } else {\n                w = x.parent.left;\n                if (1 === w.color) {\n                    w.color = 0;\n                    x.parent.color = 1;\n                    rightRotate(tree, x.parent);\n                    w = x.parent.left;\n                }\n                if (0 === w.left.color && 0 === w.right.color) {\n                    w.color = 1;\n                    x = x.parent;\n                } else {\n                    if (0 === w.left.color) {\n                        w.right.color = 0;\n                        w.color = 1;\n                        leftRotate(tree, w);\n                        w = x.parent.left;\n                    }\n                    w.color = x.parent.color;\n                    x.parent.color = 0;\n                    w.left.color = 0;\n                    rightRotate(tree, x.parent);\n                    x = tree.root;\n                }\n            }\n            x.color = 0;\n            resetSentinel();\n        }\n        function fixInsert(tree, x) {\n            recomputeTreeMetadata(tree, x);\n            while(x !== tree.root && 1 === x.parent.color)if (x.parent === x.parent.parent.left) {\n                const y = x.parent.parent.right;\n                if (1 === y.color) {\n                    x.parent.color = 0;\n                    y.color = 0;\n                    x.parent.parent.color = 1;\n                    x = x.parent.parent;\n                } else {\n                    if (x === x.parent.right) {\n                        x = x.parent;\n                        leftRotate(tree, x);\n                    }\n                    x.parent.color = 0;\n                    x.parent.parent.color = 1;\n                    rightRotate(tree, x.parent.parent);\n                }\n            } else {\n                const y = x.parent.parent.left;\n                if (1 === y.color) {\n                    x.parent.color = 0;\n                    y.color = 0;\n                    x.parent.parent.color = 1;\n                    x = x.parent.parent;\n                } else {\n                    if (x === x.parent.left) {\n                        x = x.parent;\n                        rightRotate(tree, x);\n                    }\n                    x.parent.color = 0;\n                    x.parent.parent.color = 1;\n                    leftRotate(tree, x.parent.parent);\n                }\n            }\n            tree.root.color = 0;\n        }\n        function updateTreeMetadata(tree, x, delta, lineFeedCntDelta) {\n            while(x !== tree.root && x !== SENTINEL){\n                if (x.parent.left === x) {\n                    x.parent.size_left += delta;\n                    x.parent.lf_left += lineFeedCntDelta;\n                }\n                x = x.parent;\n            }\n        }\n        function recomputeTreeMetadata(tree, x) {\n            let delta = 0;\n            let lf_delta = 0;\n            if (x === tree.root) return;\n            while(x !== tree.root && x === x.parent.right)x = x.parent;\n            if (x === tree.root) return;\n            x = x.parent;\n            delta = calculateSize(x.left) - x.size_left;\n            lf_delta = calculateLF(x.left) - x.lf_left;\n            x.size_left += delta;\n            x.lf_left += lf_delta;\n            while(x !== tree.root && (0 !== delta || 0 !== lf_delta)){\n                if (x.parent.left === x) {\n                    x.parent.size_left += delta;\n                    x.parent.lf_left += lf_delta;\n                }\n                x = x.parent;\n            }\n        }\n    },\n    263 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            I: ()=>getFoldingRanges\n        });\n        var jsonc_parser__rspack_import_0 = __webpack_require__(508);\n        function getFoldingRanges(jsonModel) {\n            const ranges = [];\n            const stack = [];\n            let prevStart = -1;\n            const scanner = (0, jsonc_parser__rspack_import_0.z1)(jsonModel.getValue(), false);\n            let token = scanner.scan();\n            function addRange(range) {\n                ranges.push(range);\n            }\n            while(token !== jsonc_parser__rspack_import_0.a6.EOF){\n                switch(token){\n                    case jsonc_parser__rspack_import_0.a6.OpenBraceToken:\n                    case jsonc_parser__rspack_import_0.a6.OpenBracketToken:\n                        {\n                            const startLineNumber = jsonModel.positionAt(scanner.getPosition()).lineNumber;\n                            const range = {\n                                startLineNumber,\n                                type: token === jsonc_parser__rspack_import_0.a6.OpenBraceToken ? 'object' : 'array'\n                            };\n                            stack.push(range);\n                            break;\n                        }\n                    case jsonc_parser__rspack_import_0.a6.CloseBraceToken:\n                    case jsonc_parser__rspack_import_0.a6.CloseBracketToken:\n                        {\n                            const type = token === jsonc_parser__rspack_import_0.a6.CloseBraceToken ? 'object' : 'array';\n                            if (stack.length > 0 && stack[stack.length - 1].type === type) {\n                                const range = stack.pop();\n                                const endLineNumber = jsonModel.positionAt(scanner.getTokenOffset()).lineNumber;\n                                if (range && endLineNumber > range.startLineNumber + 1 && prevStart !== range.startLineNumber) {\n                                    const foldRange = {\n                                        startLineNumber: range.startLineNumber,\n                                        endLineNumber: endLineNumber - 1,\n                                        type: range.type,\n                                        isCollapsed: false,\n                                        source: 0\n                                    };\n                                    addRange(foldRange);\n                                    prevStart = range.startLineNumber;\n                                }\n                            }\n                            break;\n                        }\n                }\n                token = scanner.scan();\n            }\n            return ranges;\n        }\n    },\n    949 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            GD: ()=>parseJsonAst,\n            IB: ()=>formatJson,\n            uB: ()=>doValidate\n        });\n        var jsonc_parser__rspack_import_0 = __webpack_require__(508);\n        var _parse__rspack_import_1 = __webpack_require__(843);\n        function formatJson(jsonModel, options) {\n            const edits = (0, jsonc_parser__rspack_import_0.GP)(jsonModel.getValue(), void 0, options);\n            return edits;\n        }\n        function doValidate(jsonModel) {\n            const { root, problems } = (0, _parse__rspack_import_1.qF)(jsonModel);\n            return {\n                problems,\n                root\n            };\n        }\n        function parseJsonAst(jsonModel) {\n            return (0, _parse__rspack_import_1.qF)(jsonModel).root;\n        }\n    },\n    899 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            O4: ()=>ErrorCode,\n            PF: ()=>ErrRange,\n            oQ: ()=>Diagnostic\n        });\n        var ErrorCode = /*#__PURE__*/ function(ErrorCode) {\n            ErrorCode[ErrorCode[\"Undefined\"] = 0] = \"Undefined\";\n            ErrorCode[ErrorCode[\"EnumValueMismatch\"] = 1] = \"EnumValueMismatch\";\n            ErrorCode[ErrorCode[\"Deprecated\"] = 2] = \"Deprecated\";\n            ErrorCode[ErrorCode[\"UnexpectedEndOfComment\"] = 0x101] = \"UnexpectedEndOfComment\";\n            ErrorCode[ErrorCode[\"UnexpectedEndOfString\"] = 0x102] = \"UnexpectedEndOfString\";\n            ErrorCode[ErrorCode[\"UnexpectedEndOfNumber\"] = 0x103] = \"UnexpectedEndOfNumber\";\n            ErrorCode[ErrorCode[\"InvalidUnicode\"] = 0x104] = \"InvalidUnicode\";\n            ErrorCode[ErrorCode[\"InvalidEscapeCharacter\"] = 0x105] = \"InvalidEscapeCharacter\";\n            ErrorCode[ErrorCode[\"InvalidCharacter\"] = 0x106] = \"InvalidCharacter\";\n            ErrorCode[ErrorCode[\"PropertyExpected\"] = 0x201] = \"PropertyExpected\";\n            ErrorCode[ErrorCode[\"CommaExpected\"] = 0x202] = \"CommaExpected\";\n            ErrorCode[ErrorCode[\"ColonExpected\"] = 0x203] = \"ColonExpected\";\n            ErrorCode[ErrorCode[\"ValueExpected\"] = 0x204] = \"ValueExpected\";\n            ErrorCode[ErrorCode[\"CommaOrCloseBacketExpected\"] = 0x205] = \"CommaOrCloseBacketExpected\";\n            ErrorCode[ErrorCode[\"CommaOrCloseBraceExpected\"] = 0x206] = \"CommaOrCloseBraceExpected\";\n            ErrorCode[ErrorCode[\"TrailingComma\"] = 0x207] = \"TrailingComma\";\n            ErrorCode[ErrorCode[\"DuplicateKey\"] = 0x208] = \"DuplicateKey\";\n            ErrorCode[ErrorCode[\"CommentNotPermitted\"] = 0x209] = \"CommentNotPermitted\";\n            ErrorCode[ErrorCode[\"PropertyKeysMustBeDoublequoted\"] = 0x210] = \"PropertyKeysMustBeDoublequoted\";\n            ErrorCode[ErrorCode[\"SchemaResolveError\"] = 0x300] = \"SchemaResolveError\";\n            ErrorCode[ErrorCode[\"SchemaUnsupportedFeature\"] = 0x301] = \"SchemaUnsupportedFeature\";\n            return ErrorCode;\n        }({});\n        class Diagnostic {\n            message;\n            code;\n            range;\n            constructor(message, code, range){\n                this.message = message;\n                this.code = code;\n                this.range = range;\n            }\n            static create(message, code, range) {\n                return new Diagnostic(message, code, range);\n            }\n        }\n        class ErrRange {\n            start;\n            end;\n            constructor(start, end){\n                this.start = start;\n                this.end = end;\n            }\n            static create(start, end) {\n                return new ErrRange(start, end);\n            }\n        }\n        (function(CompletionItemKind) {\n            CompletionItemKind.Text = 1;\n            CompletionItemKind.Method = 2;\n            CompletionItemKind.Function = 3;\n            CompletionItemKind.Constructor = 4;\n            CompletionItemKind.Field = 5;\n            CompletionItemKind.Variable = 6;\n            CompletionItemKind.Class = 7;\n            CompletionItemKind.Interface = 8;\n            CompletionItemKind.Module = 9;\n            CompletionItemKind.Property = 10;\n            CompletionItemKind.Unit = 11;\n            CompletionItemKind.Value = 12;\n            CompletionItemKind.Enum = 13;\n            CompletionItemKind.Keyword = 14;\n            CompletionItemKind.Snippet = 15;\n            CompletionItemKind.Color = 16;\n            CompletionItemKind.File = 17;\n            CompletionItemKind.Reference = 18;\n            CompletionItemKind.Folder = 19;\n            CompletionItemKind.EnumMember = 20;\n            CompletionItemKind.Constant = 21;\n            CompletionItemKind.Struct = 22;\n            CompletionItemKind.Event = 23;\n            CompletionItemKind.Operator = 24;\n            CompletionItemKind.TypeParameter = 25;\n        })(CompletionItemKind || (CompletionItemKind = {}));\n        (function(InsertTextFormat) {\n            InsertTextFormat.PlainText = 1;\n            InsertTextFormat.Snippet = 2;\n        })(InsertTextFormat || (InsertTextFormat = {}));\n        (function(TextEdit) {\n            function replace(range, newText) {\n                return {\n                    range,\n                    newText\n                };\n            }\n            TextEdit.replace = replace;\n        })(TextEdit || (TextEdit = {}));\n        (function(CompletionItem) {\n            function create(label) {\n                return {\n                    label\n                };\n            }\n            CompletionItem.create = create;\n        })(CompletionItem || (CompletionItem = {}));\n        var CompletionItemKind, InsertTextFormat, TextEdit, CompletionItem;\n    },\n    843 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            qF: ()=>parseJson\n        });\n        var jsonc_parser__rspack_import_0 = __webpack_require__(508);\n        var _jsonTypes__rspack_import_1 = __webpack_require__(899);\n        var _common_utils__rspack_import_2 = __webpack_require__(861);\n        class ASTNodeImpl {\n            offset;\n            length;\n            parent;\n            constructor(parent, offset, length = 0){\n                this.offset = offset;\n                this.length = length;\n                this.parent = parent;\n            }\n            get children() {\n                return [];\n            }\n            toString() {\n                return 'type: ' + this.type + ' (' + this.offset + '/' + this.length + ')' + (this.parent ? ' parent: {' + this.parent.toString() + '}' : '');\n            }\n        }\n        class NullASTNodeImpl extends ASTNodeImpl {\n            type = 'null';\n            value = null;\n            constructor(parent, offset){\n                super(parent, offset);\n            }\n        }\n        class BooleanASTNodeImpl extends ASTNodeImpl {\n            type = 'boolean';\n            value;\n            constructor(parent, boolValue, offset){\n                super(parent, offset);\n                this.value = boolValue;\n            }\n        }\n        class ArrayASTNodeImpl extends ASTNodeImpl {\n            type = 'array';\n            items;\n            constructor(parent, offset){\n                super(parent, offset);\n                this.items = [];\n            }\n            get children() {\n                return this.items;\n            }\n        }\n        class NumberASTNodeImpl extends ASTNodeImpl {\n            type = 'number';\n            isInteger;\n            value;\n            constructor(parent, offset){\n                super(parent, offset);\n                this.isInteger = true;\n                this.value = 0 / 0;\n            }\n        }\n        class ObjectASTNodeImpl extends ASTNodeImpl {\n            type = 'object';\n            properties;\n            constructor(parent, offset){\n                super(parent, offset);\n                this.properties = [];\n            }\n            get children() {\n                return this.properties;\n            }\n        }\n        class StringASTNodeImpl extends ASTNodeImpl {\n            type = 'string';\n            value;\n            constructor(parent, offset, length){\n                super(parent, offset, length);\n                this.value = '';\n            }\n        }\n        class PropertyASTNodeImpl extends ASTNodeImpl {\n            type = 'property';\n            keyNode;\n            valueNode;\n            colonOffset;\n            constructor(parent, offset, keyNode){\n                super(parent, offset);\n                this.colonOffset = -1;\n                this.keyNode = keyNode;\n            }\n            get children() {\n                return this.valueNode ? [\n                    this.keyNode,\n                    this.valueNode\n                ] : [\n                    this.keyNode\n                ];\n            }\n        }\n        class JsonDocument {\n            root;\n            constructor(root){\n                this.root = root;\n            }\n            getNodeFromOffset(offset, includeRightBound = false) {\n                if (!this.root) return;\n                return jsonc_parser__rspack_import_0.SM(this.root, offset, includeRightBound);\n            }\n            visit(visitor) {\n                if (this.root) {\n                    const doVisit = (node)=>{\n                        let ctn = visitor(node);\n                        const children = node.children;\n                        if (Array.isArray(children)) for(let i = 0; i < children.length && ctn; i++)ctn = doVisit(children[i]);\n                        return ctn;\n                    };\n                    doVisit(this.root);\n                }\n            }\n        }\n        function parseJson(jsonModel) {\n            const problems = [];\n            let lastProblemOffset = -1;\n            const text = jsonModel.getValue();\n            const scanner = jsonc_parser__rspack_import_0.z1(text, false);\n            function _scanNext() {\n                while(true){\n                    const token = scanner.scan();\n                    _checkScanError();\n                    switch(token){\n                        case jsonc_parser__rspack_import_0.a6.LineBreakTrivia:\n                        case jsonc_parser__rspack_import_0.a6.Trivia:\n                            break;\n                        default:\n                            return token;\n                    }\n                }\n            }\n            function _checkScanError() {\n                switch(scanner.getTokenError()){\n                    case jsonc_parser__rspack_import_0.sC.InvalidUnicode:\n                        _error('Invalid unicode sequence in string.', _jsonTypes__rspack_import_1.O4.InvalidUnicode);\n                        return true;\n                    case jsonc_parser__rspack_import_0.sC.InvalidEscapeCharacter:\n                        _error('Invalid escape character in string.', _jsonTypes__rspack_import_1.O4.InvalidEscapeCharacter);\n                        return true;\n                    case jsonc_parser__rspack_import_0.sC.UnexpectedEndOfNumber:\n                        _error('Unexpected end of number.', _jsonTypes__rspack_import_1.O4.UnexpectedEndOfNumber);\n                        return true;\n                    case jsonc_parser__rspack_import_0.sC.UnexpectedEndOfComment:\n                        _error('Unexpected end of comment.', _jsonTypes__rspack_import_1.O4.UnexpectedEndOfComment);\n                        return true;\n                    case jsonc_parser__rspack_import_0.sC.UnexpectedEndOfString:\n                        _error('Unexpected end of string.', _jsonTypes__rspack_import_1.O4.UnexpectedEndOfString);\n                        return true;\n                    case jsonc_parser__rspack_import_0.sC.InvalidCharacter:\n                        _error('Invalid characters in string. Control characters must be escaped.', _jsonTypes__rspack_import_1.O4.InvalidCharacter);\n                        return true;\n                }\n                return false;\n            }\n            function _errorAtRange(message, code, startOffset, endOffset) {\n                if (0 === problems.length || startOffset !== lastProblemOffset) {\n                    const range = _jsonTypes__rspack_import_1.PF.create(jsonModel.positionAt(startOffset), jsonModel.positionAt(endOffset));\n                    problems.push(_jsonTypes__rspack_import_1.oQ.create(message, code, range));\n                    lastProblemOffset = startOffset;\n                }\n            }\n            function _finalize(node, scanNext) {\n                node.length = scanner.getTokenOffset() + scanner.getTokenLength() - node.offset;\n                if (scanNext) _scanNext();\n                return node;\n            }\n            function _error(message, code, node, skipUntilAfter = [], skipUntil = []) {\n                let start = scanner.getTokenOffset();\n                let end = scanner.getTokenOffset() + scanner.getTokenLength();\n                if (start === end && start > 0) {\n                    start--;\n                    while(start > 0 && /\\s/.test(text.charAt(start)))start--;\n                    end = start + 1;\n                }\n                _errorAtRange(message, code, start, end);\n                if (node) _finalize(node, false);\n                if (skipUntilAfter.length + skipUntil.length > 0) {\n                    let token = scanner.getToken();\n                    while(token !== jsonc_parser__rspack_import_0.a6.EOF){\n                        if (-1 !== skipUntilAfter.indexOf(token)) {\n                            _scanNext();\n                            break;\n                        }\n                        if (-1 !== skipUntil.indexOf(token)) break;\n                        token = _scanNext();\n                    }\n                }\n                return node;\n            }\n            function _parseArray(parent) {\n                if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.OpenBracketToken) return;\n                const node = new ArrayASTNodeImpl(parent, scanner.getTokenOffset());\n                _scanNext();\n                let needComma = false;\n                while(scanner.getToken() !== jsonc_parser__rspack_import_0.a6.CloseBracketToken && scanner.getToken() !== jsonc_parser__rspack_import_0.a6.EOF){\n                    if (scanner.getToken() === jsonc_parser__rspack_import_0.a6.CommaToken) {\n                        if (!needComma) _error('Value expected.', _jsonTypes__rspack_import_1.O4.ValueExpected);\n                        const commaOffset = scanner.getTokenOffset();\n                        _scanNext();\n                        if (scanner.getToken() === jsonc_parser__rspack_import_0.a6.CloseBracketToken) {\n                            if (needComma) _errorAtRange('Trailing comma', _jsonTypes__rspack_import_1.O4.TrailingComma, commaOffset, commaOffset + 1);\n                            continue;\n                        }\n                    } else if (needComma) {\n                        _error('Comma expected.', _jsonTypes__rspack_import_1.O4.CommaExpected, void 0, [], [\n                            jsonc_parser__rspack_import_0.a6.CloseBracketToken\n                        ]);\n                        break;\n                    }\n                    const item = _parseValue(node);\n                    if (item) node.items.push(item);\n                    else {\n                        _error('Value expected.', _jsonTypes__rspack_import_1.O4.ValueExpected, void 0, [], [\n                            jsonc_parser__rspack_import_0.a6.CloseBracketToken\n                        ]);\n                        break;\n                    }\n                    needComma = true;\n                }\n                if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.CloseBracketToken) return _error('Expected comma or closing bracket', _jsonTypes__rspack_import_1.O4.CommaOrCloseBraceExpected, node);\n                return _finalize(node, true);\n            }\n            const keyPlaceholder = new StringASTNodeImpl(void 0, 0, 0);\n            function _parseProperty(parent, keysSeen) {\n                const node = new PropertyASTNodeImpl(parent, scanner.getTokenOffset(), keyPlaceholder);\n                let key = _parseString(node);\n                if (!key) if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.Unknown) return;\n                else {\n                    _error('Property keys must be doublequoted', _jsonTypes__rspack_import_1.O4.PropertyKeysMustBeDoublequoted);\n                    const keyNode = new StringASTNodeImpl(node, scanner.getTokenOffset(), scanner.getTokenLength());\n                    keyNode.value = scanner.getTokenValue();\n                    key = keyNode;\n                    _scanNext();\n                }\n                node.keyNode = key;\n                if ('//' !== key.value) {\n                    const seen = keysSeen[key.value];\n                    if (seen) {\n                        _errorAtRange('Duplicate object key', _jsonTypes__rspack_import_1.O4.DuplicateKey, node.keyNode.offset, node.keyNode.offset + node.keyNode.length);\n                        if ((0, _common_utils__rspack_import_2.Gv)(seen)) _errorAtRange('Duplicate object key', _jsonTypes__rspack_import_1.O4.DuplicateKey, seen.keyNode.offset, seen.keyNode.offset + seen.keyNode.length);\n                        keysSeen[key.value] = true;\n                    } else keysSeen[key.value] = node;\n                }\n                if (scanner.getToken() === jsonc_parser__rspack_import_0.a6.ColonToken) {\n                    node.colonOffset = scanner.getTokenOffset();\n                    _scanNext();\n                } else {\n                    _error('Colon expected', _jsonTypes__rspack_import_1.O4.ColonExpected);\n                    if (scanner.getToken() === jsonc_parser__rspack_import_0.a6.StringLiteral && jsonModel.positionAt(key.offset + key.length).lineNumber < jsonModel.positionAt(scanner.getTokenOffset()).lineNumber) {\n                        node.length = key.length;\n                        return node;\n                    }\n                }\n                const value = _parseValue(node);\n                if (!value) return _error('Value expected', _jsonTypes__rspack_import_1.O4.ValueExpected, node, [], [\n                    jsonc_parser__rspack_import_0.a6.CloseBraceToken,\n                    jsonc_parser__rspack_import_0.a6.CommaToken\n                ]);\n                node.valueNode = value;\n                node.length = value.offset + value.length - node.offset;\n                return node;\n            }\n            function _parseObject(parent) {\n                if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.OpenBraceToken) return;\n                const node = new ObjectASTNodeImpl(parent, scanner.getTokenOffset());\n                const keysSeen = Object.create(null);\n                _scanNext();\n                let needsComma = false;\n                while(scanner.getToken() !== jsonc_parser__rspack_import_0.a6.CloseBraceToken && scanner.getToken() !== jsonc_parser__rspack_import_0.a6.EOF){\n                    if (scanner.getToken() === jsonc_parser__rspack_import_0.a6.CommaToken) {\n                        if (!needsComma) _error('Property expected', _jsonTypes__rspack_import_1.O4.PropertyExpected);\n                        const commaOffset = scanner.getTokenOffset();\n                        _scanNext();\n                        if (scanner.getToken() === jsonc_parser__rspack_import_0.a6.CloseBraceToken) {\n                            if (needsComma) _errorAtRange('Trailing comma', _jsonTypes__rspack_import_1.O4.TrailingComma, commaOffset, commaOffset + 1);\n                            continue;\n                        }\n                    } else if (needsComma) _error('Expected comma', _jsonTypes__rspack_import_1.O4.CommaExpected);\n                    const property = _parseProperty(node, keysSeen);\n                    if (property) node.properties.push(property);\n                    else _error('Property expected', _jsonTypes__rspack_import_1.O4.PropertyExpected, void 0, [], [\n                        jsonc_parser__rspack_import_0.a6.CloseBraceToken,\n                        jsonc_parser__rspack_import_0.a6.CommaToken\n                    ]);\n                    needsComma = true;\n                }\n                if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.CloseBraceToken) return _error('Expected comma or closing brace', _jsonTypes__rspack_import_1.O4.CommaOrCloseBraceExpected, node);\n                return _finalize(node, true);\n            }\n            function _parseString(parent) {\n                if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.StringLiteral) return;\n                const node = new StringASTNodeImpl(parent, scanner.getTokenOffset());\n                node.value = scanner.getTokenValue();\n                return _finalize(node, true);\n            }\n            function _parseNumber(parent) {\n                if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.NumericLiteral) return;\n                const node = new NumberASTNodeImpl(parent, scanner.getTokenOffset());\n                if (scanner.getTokenError() === jsonc_parser__rspack_import_0.sC.None) {\n                    const tokenValue = scanner.getTokenValue();\n                    try {\n                        const numberValue = JSON.parse(tokenValue);\n                        if (!(0, _common_utils__rspack_import_2.Et)(numberValue)) return _error('Invalid number format.', _jsonTypes__rspack_import_1.O4.Undefined, node);\n                        node.value = numberValue;\n                    } catch (e) {\n                        return _error('Invalid number format.', _jsonTypes__rspack_import_1.O4.Undefined, node);\n                    }\n                    node.isInteger = -1 === tokenValue.indexOf('.');\n                }\n                return _finalize(node, true);\n            }\n            function _parseLiteral(parent) {\n                switch(scanner.getToken()){\n                    case jsonc_parser__rspack_import_0.a6.NullKeyword:\n                        return _finalize(new NullASTNodeImpl(parent, scanner.getTokenOffset()), true);\n                    case jsonc_parser__rspack_import_0.a6.TrueKeyword:\n                        return _finalize(new BooleanASTNodeImpl(parent, true, scanner.getTokenOffset()), true);\n                    case jsonc_parser__rspack_import_0.a6.FalseKeyword:\n                        return _finalize(new BooleanASTNodeImpl(parent, false, scanner.getTokenOffset()), true);\n                    default:\n                        return;\n                }\n            }\n            function _parseValue(parent) {\n                return _parseArray(parent) || _parseObject(parent) || _parseString(parent) || _parseNumber(parent) || _parseLiteral(parent);\n            }\n            let _root;\n            const token = _scanNext();\n            if (token !== jsonc_parser__rspack_import_0.a6.EOF) {\n                _root = _parseValue(_root);\n                if (_root) {\n                    if (scanner.getToken() !== jsonc_parser__rspack_import_0.a6.EOF) _error('End of file expected.', _jsonTypes__rspack_import_1.O4.Undefined);\n                } else _error('Expected a JSON object, array or literal', _jsonTypes__rspack_import_1.O4.Undefined);\n            }\n            return {\n                problems,\n                root: new JsonDocument(_root)\n            };\n        }\n    },\n    261 (__unused_rspack_module, __unused_rspack___webpack_exports__, __webpack_require__) {\n        var _jsonWorker__rspack_import_0 = __webpack_require__(23);\n        let jsonWorker = null;\n        self.onmessage = (e)=>{\n            const { method, params, messageId } = e.data;\n            if ('init' === method) {\n                jsonWorker = new _jsonWorker__rspack_import_0.r(params.value);\n                self.postMessage({\n                    messageId,\n                    result: 'Worker initialized'\n                });\n                return;\n            }\n            if (!jsonWorker) return void self.postMessage({\n                messageId,\n                error: 'Worker not initialized'\n            });\n            let result;\n            switch(method){\n                case 'updateModel':\n                    jsonWorker.updateModel(params.op);\n                    break;\n                case 'undo':\n                    jsonWorker.undo();\n                    break;\n                case 'redo':\n                    jsonWorker.redo();\n                    break;\n                case 'format':\n                    result = jsonWorker.format(params.options);\n                    break;\n                case 'foldRange':\n                    result = jsonWorker.foldRange();\n                    break;\n                case 'validate':\n                    result = jsonWorker.validate();\n                    break;\n                default:\n                    result = {\n                        error: 'Unknown method'\n                    };\n            }\n            self.postMessage({\n                messageId,\n                result\n            });\n        };\n    },\n    23 (__unused_rspack_module, __webpack_exports__, __webpack_require__) {\n        __webpack_require__.d(__webpack_exports__, {\n            r: ()=>JsonWorker\n        });\n        var _service_jsonService__rspack_import_1 = __webpack_require__(949);\n        var _service_jsonService__rspack_import_2 = __webpack_require__(263);\n        var _model__rspack_import_0 = __webpack_require__(574);\n        class JsonWorker {\n            _model = null;\n            constructor(value){\n                this._model = (0, _model__rspack_import_0.k)(value);\n            }\n            getModel() {\n                return this._model;\n            }\n            format(options) {\n                if (!this._model) throw new Error('Model not initialized');\n                return (0, _service_jsonService__rspack_import_1.IB)(this._model, options);\n            }\n            foldRange() {\n                if (!this._model) throw new Error('Model not initialized');\n                return (0, _service_jsonService__rspack_import_2.I)(this._model);\n            }\n            validate() {\n                if (!this._model) throw new Error('Model not initialized');\n                return (0, _service_jsonService__rspack_import_1.uB)(this._model);\n            }\n            updateModel(op) {\n                this._model?.applyOperation(op);\n                return op;\n            }\n            undo() {\n                this._model?.undo();\n            }\n            redo() {\n                this._model?.redo();\n            }\n            parse() {\n                if (!this._model) throw new Error('Model not initialized');\n                return (0, _service_jsonService__rspack_import_1.GD)(this._model);\n            }\n        }\n    }\n};\nvar __webpack_module_cache__ = {};\nfunction __webpack_require__(moduleId) {\n    var cachedModule = __webpack_module_cache__[moduleId];\n    if (void 0 !== cachedModule) return cachedModule.exports;\n    var module = __webpack_module_cache__[moduleId] = {\n        exports: {}\n    };\n    __webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n    return module.exports;\n}\n(()=>{\n    __webpack_require__.d = (exports, getters, values)=>{\n        var define = (defs, kind)=>{\n            for(var key in defs)if (__webpack_require__.o(defs, key) && !__webpack_require__.o(exports, key)) Object.defineProperty(exports, key, {\n                enumerable: true,\n                [kind]: defs[key]\n            });\n        };\n        define(getters, \"get\");\n        define(values, \"value\");\n    };\n})();\n(()=>{\n    __webpack_require__.o = (obj, prop)=>Object.prototype.hasOwnProperty.call(obj, prop);\n})();\n__webpack_require__(261);\n";
 const workerURL = "u" > typeof self && (self.URL || self.webkitURL);
 const blob = workerURL && self.Blob && new Blob([
     "URL.revokeObjectURL(import.meta.url);",