npm - @abaplint/cli - Versions diffs - 2.90.0 → 2.90.1 - Mend

@abaplint/cli 2.90.0 → 2.90.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (2) hide show

package/build/cli.js +5 -5
package/package.json +3 -3

package/build/cli.js CHANGED Viewed

@@ -1996,7 +1996,7 @@ eval("\r\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\r\n
 /***/ ((__unused_webpack_module, exports, __webpack_require__) => {
 "use strict";
-eval("\r\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\r\nexports.SQLCompare = void 0;\r\nconst combi_1 = __webpack_require__(/*! ../combi */ \"./node_modules/@abaplint/core/build/src/abap/2_statements/combi.js\");\r\nconst _1 = __webpack_require__(/*! . */ \"./node_modules/@abaplint/core/build/src/abap/2_statements/expressions/index.js\");\r\nconst tokens_1 = __webpack_require__(/*! ../../1_lexer/tokens */ \"./node_modules/@abaplint/core/build/src/abap/1_lexer/tokens/index.js\");\r\nconst version_1 = __webpack_require__(/*! ../../../version */ \"./node_modules/@abaplint/core/build/src/version.js\");\r\nclass SQLCompare extends combi_1.Expression {\r\n    getRunnable() {\r\n        const val = new _1.SQLSource();\r\n        const list = (0, combi_1.seq)((0, combi_1.altPrio)((0, combi_1.tok)(tokens_1.WParenLeft), (0, combi_1.tok)(tokens_1.WParenLeftW)), val, (0, combi_1.starPrio)((0, combi_1.seq)(\",\", val)), \")\");\r\n        const subSelect = (0, combi_1.seq)(\"(\", _1.Select, \")\");\r\n        const inn = (0, combi_1.seq)(\"IN\", (0, combi_1.altPrio)(_1.SQLSource, list, subSelect));\r\n        const between = (0, combi_1.seq)(\"BETWEEN\", _1.SQLSource, \"AND\", _1.SQLSource);\r\n        const like = (0, combi_1.seq)(\"LIKE\", _1.SQLSource, (0, combi_1.optPrio)((0, combi_1.seq)(\"ESCAPE\", _1.SQLSource)));\r\n        const nul = (0, combi_1.seq)(\"IS\", (0, combi_1.optPrio)(\"NOT\"), (0, combi_1.altPrio)(\"NULL\", (0, combi_1.ver)(version_1.Version.v753, \"INITIAL\")));\r\n        const source = new _1.SQLSource();\r\n        const sub = (0, combi_1.seq)((0, combi_1.optPrio)((0, combi_1.altPrio)(\"ALL\", \"ANY\", \"SOME\")), subSelect);\r\n        const arith = (0, combi_1.ver)(version_1.Version.v750, (0, combi_1.plusPrio)((0, combi_1.seq)((0, combi_1.altPrio)(\"+\", \"-\", \"*\", \"/\"), _1.SQLFieldName)));\r\n        const rett = (0, combi_1.seq)((0, combi_1.altPrio)(_1.SQLFunction, (0, combi_1.seq)(_1.SQLFieldName, (0, combi_1.optPrio)(arith))), (0, combi_1.altPrio)((0, combi_1.seq)(_1.SQLCompareOperator, (0, combi_1.altPrio)(sub, source)), (0, combi_1.seq)((0, combi_1.optPrio)(\"NOT\"), (0, combi_1.altPrio)(inn, like, between)), nul));\r\n        const exists = (0, combi_1.seq)(\"EXISTS\", subSelect);\r\n        return (0, combi_1.altPrio)(exists, _1.Dynamic, rett);\r\n    }\r\n}\r\nexports.SQLCompare = SQLCompare;\r\n//# sourceMappingURL=sql_compare.js.map\n\n//# sourceURL=webpack://@abaplint/cli/./node_modules/@abaplint/core/build/src/abap/2_statements/expressions/sql_compare.js?");
+eval("\r\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\r\nexports.SQLCompare = void 0;\r\nconst combi_1 = __webpack_require__(/*! ../combi */ \"./node_modules/@abaplint/core/build/src/abap/2_statements/combi.js\");\r\nconst _1 = __webpack_require__(/*! . */ \"./node_modules/@abaplint/core/build/src/abap/2_statements/expressions/index.js\");\r\nconst tokens_1 = __webpack_require__(/*! ../../1_lexer/tokens */ \"./node_modules/@abaplint/core/build/src/abap/1_lexer/tokens/index.js\");\r\nconst version_1 = __webpack_require__(/*! ../../../version */ \"./node_modules/@abaplint/core/build/src/version.js\");\r\nclass SQLCompare extends combi_1.Expression {\r\n    getRunnable() {\r\n        const val = new _1.SQLSource();\r\n        const listOld = (0, combi_1.seq)((0, combi_1.tok)(tokens_1.WParenLeft), val, (0, combi_1.starPrio)((0, combi_1.seq)(\",\", val)), (0, combi_1.altPrio)((0, combi_1.tok)(tokens_1.ParenRight), (0, combi_1.tok)(tokens_1.ParenRightW), (0, combi_1.tok)(tokens_1.WParenRightW)));\r\n        const listNew = (0, combi_1.seq)((0, combi_1.tok)(tokens_1.WParenLeftW), val, (0, combi_1.starPrio)((0, combi_1.seq)(\",\", val)), (0, combi_1.altPrio)((0, combi_1.tok)(tokens_1.WParenRight), (0, combi_1.tok)(tokens_1.WParenRightW)));\r\n        const list = (0, combi_1.alt)(listOld, (0, combi_1.ver)(version_1.Version.v740sp02, listNew)); // version is a guess, https://github.com/abaplint/abaplint/issues/2530\r\n        const subSelect = (0, combi_1.seq)(\"(\", _1.Select, \")\");\r\n        const inn = (0, combi_1.seq)(\"IN\", (0, combi_1.altPrio)(_1.SQLSource, list, subSelect));\r\n        const between = (0, combi_1.seq)(\"BETWEEN\", _1.SQLSource, \"AND\", _1.SQLSource);\r\n        const like = (0, combi_1.seq)(\"LIKE\", _1.SQLSource, (0, combi_1.optPrio)((0, combi_1.seq)(\"ESCAPE\", _1.SQLSource)));\r\n        const nul = (0, combi_1.seq)(\"IS\", (0, combi_1.optPrio)(\"NOT\"), (0, combi_1.altPrio)(\"NULL\", (0, combi_1.ver)(version_1.Version.v753, \"INITIAL\")));\r\n        const source = new _1.SQLSource();\r\n        const sub = (0, combi_1.seq)((0, combi_1.optPrio)((0, combi_1.altPrio)(\"ALL\", \"ANY\", \"SOME\")), subSelect);\r\n        const arith = (0, combi_1.ver)(version_1.Version.v750, (0, combi_1.plusPrio)((0, combi_1.seq)((0, combi_1.altPrio)(\"+\", \"-\", \"*\", \"/\"), _1.SQLFieldName)));\r\n        const rett = (0, combi_1.seq)((0, combi_1.altPrio)(_1.SQLFunction, (0, combi_1.seq)(_1.SQLFieldName, (0, combi_1.optPrio)(arith))), (0, combi_1.altPrio)((0, combi_1.seq)(_1.SQLCompareOperator, (0, combi_1.altPrio)(sub, source)), (0, combi_1.seq)((0, combi_1.optPrio)(\"NOT\"), (0, combi_1.altPrio)(inn, like, between)), nul));\r\n        const exists = (0, combi_1.seq)(\"EXISTS\", subSelect);\r\n        return (0, combi_1.altPrio)(exists, _1.Dynamic, rett);\r\n    }\r\n}\r\nexports.SQLCompare = SQLCompare;\r\n//# sourceMappingURL=sql_compare.js.map\n\n//# sourceURL=webpack://@abaplint/cli/./node_modules/@abaplint/core/build/src/abap/2_statements/expressions/sql_compare.js?");
 /***/ }),
@@ -4273,7 +4273,7 @@ eval("\r\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\r\n
 /***/ ((__unused_webpack_module, exports, __webpack_require__) => {
 "use strict";
-eval("\r\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\r\nexports.InsertInternal = void 0;\r\nconst combi_1 = __webpack_require__(/*! ../combi */ \"./node_modules/@abaplint/core/build/src/abap/2_statements/combi.js\");\r\nconst version_1 = __webpack_require__(/*! ../../../version */ \"./node_modules/@abaplint/core/build/src/version.js\");\r\nconst expressions_1 = __webpack_require__(/*! ../expressions */ \"./node_modules/@abaplint/core/build/src/abap/2_statements/expressions/index.js\");\r\nclass InsertInternal {\r\n    getMatcher() {\r\n        const target = (0, combi_1.alt)(expressions_1.Source, expressions_1.Dynamic);\r\n        const assigning = (0, combi_1.seq)(\"ASSIGNING\", expressions_1.FSTarget);\r\n        const ref = (0, combi_1.seq)(\"REFERENCE INTO\", expressions_1.Target);\r\n        const index = (0, combi_1.seq)(\"INDEX\", expressions_1.Source);\r\n        const initial = (0, combi_1.str)(\"INITIAL LINE\");\r\n        const into = (0, combi_1.seq)(\"INTO\", (0, combi_1.opt)(\"TABLE\"), expressions_1.Target);\r\n        const to = (0, combi_1.seq)(\"TO\", expressions_1.Source);\r\n        const from = (0, combi_1.seq)(\"FROM\", expressions_1.Source);\r\n        const fromTo = (0, combi_1.seq)((0, combi_1.opt)(from), (0, combi_1.opt)(to));\r\n        const foo = (0, combi_1.per)(into, ref, index, assigning);\r\n        const lines = (0, combi_1.seq)(\"LINES OF\", target, (0, combi_1.opt)(fromTo));\r\n        const src = (0, combi_1.alt)((0, combi_1.ver)(version_1.Version.v740sp02, expressions_1.Source), expressions_1.SimpleSource1);\r\n        const tab = (0, combi_1.seq)(\"TABLE\", expressions_1.Source);\r\n        const ret = (0, combi_1.seq)(\"INSERT\", (0, combi_1.altPrio)(tab, (0, combi_1.seq)((0, combi_1.altPrio)(initial, lines, src), foo)));\r\n        return ret;\r\n    }\r\n}\r\nexports.InsertInternal = InsertInternal;\r\n//# sourceMappingURL=insert_internal.js.map\n\n//# sourceURL=webpack://@abaplint/cli/./node_modules/@abaplint/core/build/src/abap/2_statements/statements/insert_internal.js?");
+eval("\r\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\r\nexports.InsertInternal = void 0;\r\nconst combi_1 = __webpack_require__(/*! ../combi */ \"./node_modules/@abaplint/core/build/src/abap/2_statements/combi.js\");\r\nconst version_1 = __webpack_require__(/*! ../../../version */ \"./node_modules/@abaplint/core/build/src/version.js\");\r\nconst expressions_1 = __webpack_require__(/*! ../expressions */ \"./node_modules/@abaplint/core/build/src/abap/2_statements/expressions/index.js\");\r\nclass InsertInternal {\r\n    getMatcher() {\r\n        const target = (0, combi_1.alt)(expressions_1.Source, expressions_1.Dynamic);\r\n        const assigning = (0, combi_1.seq)(\"ASSIGNING\", expressions_1.FSTarget);\r\n        const ref = (0, combi_1.seq)(\"REFERENCE INTO\", expressions_1.Target);\r\n        const index = (0, combi_1.seq)(\"INDEX\", expressions_1.Source);\r\n        const initial = (0, combi_1.str)(\"INITIAL LINE\");\r\n        const into = (0, combi_1.seq)(\"INTO\", (0, combi_1.opt)(\"TABLE\"), expressions_1.Target);\r\n        const to = (0, combi_1.seq)(\"TO\", expressions_1.Source);\r\n        const from = (0, combi_1.seq)(\"FROM\", expressions_1.Source);\r\n        const fromTo = (0, combi_1.seq)((0, combi_1.opt)(from), (0, combi_1.opt)(to));\r\n        const foo = (0, combi_1.per)(into, ref, index, assigning);\r\n        const lines = (0, combi_1.seq)(\"LINES OF\", target, (0, combi_1.opt)(fromTo));\r\n        const src = (0, combi_1.alt)((0, combi_1.ver)(version_1.Version.v740sp02, expressions_1.Source), expressions_1.SimpleSource4);\r\n        const tab = (0, combi_1.seq)(\"TABLE\", expressions_1.Source);\r\n        const ret = (0, combi_1.seq)(\"INSERT\", (0, combi_1.altPrio)(tab, (0, combi_1.seq)((0, combi_1.altPrio)(initial, lines, src), foo)));\r\n        return ret;\r\n    }\r\n}\r\nexports.InsertInternal = InsertInternal;\r\n//# sourceMappingURL=insert_internal.js.map\n\n//# sourceURL=webpack://@abaplint/cli/./node_modules/@abaplint/core/build/src/abap/2_statements/statements/insert_internal.js?");
 /***/ }),
@@ -11269,7 +11269,7 @@ eval("\r\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\r\n
 /***/ ((__unused_webpack_module, exports, __webpack_require__) => {
 "use strict";
-eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.Registry = void 0;\nconst config_1 = __webpack_require__(/*! ./config */ \"./node_modules/@abaplint/core/build/src/config.js\");\nconst artifacts_objects_1 = __webpack_require__(/*! ./artifacts_objects */ \"./node_modules/@abaplint/core/build/src/artifacts_objects.js\");\nconst artifacts_rules_1 = __webpack_require__(/*! ./artifacts_rules */ \"./node_modules/@abaplint/core/build/src/artifacts_rules.js\");\nconst skip_logic_1 = __webpack_require__(/*! ./skip_logic */ \"./node_modules/@abaplint/core/build/src/skip_logic.js\");\nconst _abap_object_1 = __webpack_require__(/*! ./objects/_abap_object */ \"./node_modules/@abaplint/core/build/src/objects/_abap_object.js\");\nconst find_global_definitions_1 = __webpack_require__(/*! ./abap/5_syntax/global_definitions/find_global_definitions */ \"./node_modules/@abaplint/core/build/src/abap/5_syntax/global_definitions/find_global_definitions.js\");\nconst syntax_1 = __webpack_require__(/*! ./abap/5_syntax/syntax */ \"./node_modules/@abaplint/core/build/src/abap/5_syntax/syntax.js\");\nconst excludeHelper_1 = __webpack_require__(/*! ./utils/excludeHelper */ \"./node_modules/@abaplint/core/build/src/utils/excludeHelper.js\");\nconst ddic_references_1 = __webpack_require__(/*! ./ddic_references */ \"./node_modules/@abaplint/core/build/src/ddic_references.js\");\n// todo, this should really be an instance in case there are multiple Registry'ies\nclass ParsingPerformance {\n    static clear() {\n        this.results = [];\n        this.lexing = 0;\n        this.statements = 0;\n        this.structure = 0;\n    }\n    static push(obj, result) {\n        if (result.runtimeExtra) {\n            this.lexing += result.runtimeExtra.lexing;\n            this.statements += result.runtimeExtra.statements;\n            this.structure += result.runtimeExtra.structure;\n        }\n        if (result.runtime < 100) {\n            return;\n        }\n        if (this.results === undefined) {\n            this.results = [];\n        }\n        let extra = \"\";\n        if (result.runtimeExtra) {\n            extra = `\\t(lexing: ${result.runtimeExtra.lexing}ms, statements: ${result.runtimeExtra.statements}ms, structure: ${result.runtimeExtra.structure}ms)`;\n        }\n        this.results.push({\n            runtime: result.runtime,\n            extra,\n            name: obj.getType() + \" \" + obj.getName(),\n        });\n    }\n    static output() {\n        const MAX = 10;\n        this.results.sort((a, b) => { return b.runtime - a.runtime; });\n        for (let i = 0; i < MAX; i++) {\n            const row = this.results[i];\n            if (row === undefined) {\n                break;\n            }\n            process.stderr.write(`\\t${row.runtime}ms\\t${row.name} ${row.extra}\\n`);\n        }\n        process.stderr.write(`\\tTotal lexing:     ${this.lexing}ms\\n`);\n        process.stderr.write(`\\tTotal statements: ${this.statements}ms\\n`);\n        process.stderr.write(`\\tTotal structure:  ${this.structure}ms\\n`);\n    }\n}\n///////////////////////////////////////////////////////////////////////////////////////////////\nclass Registry {\n    constructor(conf) {\n        this.objects = {};\n        this.objectsByType = {};\n        /** object containing filenames of dependencies */\n        this.dependencies = {};\n        this.issues = [];\n        this.conf = conf ? conf : config_1.Config.getDefault();\n        this.references = new ddic_references_1.DDICReferences();\n    }\n    static abaplintVersion() {\n        // magic, see build script \"version.sh\"\n        return \"2.90.0\";\n    }\n    getDDICReferences() {\n        return this.references;\n    }\n    *getObjects() {\n        for (const name in this.objects) {\n            for (const type in this.objects[name]) {\n                yield this.objects[name][type];\n            }\n        }\n    }\n    *getObjectsByType(type) {\n        for (const name in this.objectsByType[type] || []) {\n            yield this.objectsByType[type][name];\n        }\n    }\n    *getFiles() {\n        for (const obj of this.getObjects()) {\n            for (const file of obj.getFiles()) {\n                yield file;\n            }\n        }\n    }\n    getFirstObject() {\n        for (const name in this.objects) {\n            for (const type in this.objects[name]) {\n                return this.objects[name][type];\n            }\n        }\n        return undefined;\n    }\n    getObjectCount(skipDependencies = true) {\n        let res = 0;\n        for (const o of this.getObjects()) {\n            if (skipDependencies === true && this.isDependency(o)) {\n                continue;\n            }\n            res = res + 1;\n        }\n        return res;\n    }\n    getFileByName(filename) {\n        const upper = filename.toUpperCase();\n        for (const o of this.getObjects()) {\n            for (const f of o.getFiles()) {\n                if (f.getFilename().toUpperCase() === upper) {\n                    return f;\n                }\n            }\n        }\n        return undefined;\n    }\n    getObject(type, name) {\n        if (type === undefined || name === undefined) {\n            return undefined;\n        }\n        const searchName = name.toUpperCase();\n        if (this.objects[searchName]) {\n            return this.objects[searchName][type];\n        }\n        return undefined;\n    }\n    getConfig() {\n        return this.conf;\n    }\n    // assumption: Config is immutable, and can only be changed via this method\n    setConfig(conf) {\n        for (const obj of this.getObjects()) {\n            obj.setDirty();\n        }\n        this.conf = conf;\n        return this;\n    }\n    inErrorNamespace(name) {\n        const reg = new RegExp(this.getConfig().getSyntaxSetttings().errorNamespace, \"i\");\n        return reg.test(name);\n    }\n    addFile(file) {\n        return this.addFiles([file]);\n    }\n    updateFile(file) {\n        const obj = this.find(file.getObjectName(), file.getObjectType());\n        obj.updateFile(file);\n        return this;\n    }\n    removeFile(file) {\n        const obj = this.find(file.getObjectName(), file.getObjectType());\n        obj.removeFile(file);\n        if (obj.getFiles().length === 0) {\n            this.references.clear(obj);\n            this.removeObject(obj);\n        }\n        return this;\n    }\n    addFiles(files) {\n        var _a;\n        const globalExclude = ((_a = this.conf.getGlobal().exclude) !== null && _a !== void 0 ? _a : [])\n            .map(pattern => new RegExp(pattern, \"i\"));\n        for (const f of files) {\n            const filename = f.getFilename();\n            const isNotAbapgitFile = filename.split(\".\").length <= 2;\n            if (isNotAbapgitFile || excludeHelper_1.ExcludeHelper.isExcluded(filename, globalExclude)) {\n                continue;\n            }\n            const found = this.findOrCreate(f.getObjectName(), f.getObjectType());\n            found.addFile(f);\n        }\n        return this;\n    }\n    addDependencies(files) {\n        for (const f of files) {\n            this.dependencies[f.getFilename().toUpperCase()] = true;\n        }\n        return this.addFiles(files);\n    }\n    addDependency(file) {\n        this.dependencies[file.getFilename().toUpperCase()] = true;\n        this.addFile(file);\n        return this;\n    }\n    isDependency(obj) {\n        const filename = obj.getFiles()[0].getFilename().toUpperCase();\n        return this.dependencies[filename] === true;\n    }\n    isFileDependency(filename) {\n        return this.dependencies[filename.toUpperCase()] === true;\n    }\n    // assumption: the file is already in the registry\n    findObjectForFile(file) {\n        const filename = file.getFilename();\n        for (const obj of this.getObjects()) {\n            for (const ofile of obj.getFiles()) {\n                if (ofile.getFilename() === filename) {\n                    return obj;\n                }\n            }\n        }\n        return undefined;\n    }\n    // todo, this will be changed to async sometime\n    findIssues(input) {\n        if (this.isDirty() === true) {\n            this.parse();\n        }\n        return this.runRules(input);\n    }\n    // todo, this will be changed to async sometime\n    findIssuesObject(iobj) {\n        if (this.isDirty() === true) {\n            this.parse();\n        }\n        return this.runRules(undefined, iobj);\n    }\n    // todo, this will be changed to async sometime\n    parse() {\n        if (this.isDirty() === false) {\n            return this;\n        }\n        ParsingPerformance.clear();\n        this.issues = [];\n        for (const o of this.getObjects()) {\n            this.parsePrivate(o);\n            this.issues.push(...o.getParsingIssues());\n        }\n        new find_global_definitions_1.FindGlobalDefinitions(this).run();\n        return this;\n    }\n    async parseAsync(input) {\n        var _a, _b;\n        if (this.isDirty() === false) {\n            return this;\n        }\n        ParsingPerformance.clear();\n        (_a = input === null || input === void 0 ? void 0 : input.progress) === null || _a === void 0 ? void 0 : _a.set(this.getObjectCount(false), \"Lexing and parsing\");\n        this.issues = [];\n        for (const o of this.getObjects()) {\n            await ((_b = input === null || input === void 0 ? void 0 : input.progress) === null || _b === void 0 ? void 0 : _b.tick(\"Lexing and parsing(\" + this.conf.getVersion() + \") - \" + o.getType() + \" \" + o.getName()));\n            this.parsePrivate(o);\n            this.issues.push(...o.getParsingIssues());\n        }\n        if ((input === null || input === void 0 ? void 0 : input.outputPerformance) === true) {\n            ParsingPerformance.output();\n        }\n        new find_global_definitions_1.FindGlobalDefinitions(this).run(input === null || input === void 0 ? void 0 : input.progress);\n        return this;\n    }\n    //////////////////////////////////////////\n    // todo, refactor, this is a mess, see where-used, a lot of the code should be in this method instead\n    parsePrivate(input) {\n        const config = this.getConfig();\n        const result = input.parse(config.getVersion(), config.getSyntaxSetttings().globalMacros, this);\n        ParsingPerformance.push(input, result);\n    }\n    isDirty() {\n        for (const o of this.getObjects()) {\n            const dirty = o.isDirty();\n            if (dirty === true) {\n                return true;\n            }\n        }\n        return false;\n    }\n    runRules(input, iobj) {\n        var _a, _b, _c, _d, _e, _f;\n        const rulePerformance = {};\n        const issues = this.issues.slice(0);\n        const objects = iobj ? [iobj] : this.getObjects();\n        const rules = this.conf.getEnabledRules();\n        const skipLogic = new skip_logic_1.SkipLogic(this);\n        (_a = input === null || input === void 0 ? void 0 : input.progress) === null || _a === void 0 ? void 0 : _a.set(iobj ? 1 : this.getObjectCount(false), \"Run Syntax\");\n        const check = [];\n        for (const obj of objects) {\n            (_b = input === null || input === void 0 ? void 0 : input.progress) === null || _b === void 0 ? void 0 : _b.tick(\"Run Syntax - \" + obj.getName());\n            if (skipLogic.skip(obj) || this.isDependency(obj)) {\n                continue;\n            }\n            if (obj instanceof _abap_object_1.ABAPObject) {\n                new syntax_1.SyntaxLogic(this, obj).run();\n            }\n            check.push(obj);\n        }\n        (_c = input === null || input === void 0 ? void 0 : input.progress) === null || _c === void 0 ? void 0 : _c.set(rules.length, \"Initialize Rules\");\n        for (const rule of rules) {\n            (_d = input === null || input === void 0 ? void 0 : input.progress) === null || _d === void 0 ? void 0 : _d.tick(\"Initialize Rules - \" + rule.getMetadata().key);\n            if (rule.initialize === undefined) {\n                throw new Error(rule.getMetadata().key + \" missing initialize method\");\n            }\n            rule.initialize(this);\n            rulePerformance[rule.getMetadata().key] = 0;\n        }\n        (_e = input === null || input === void 0 ? void 0 : input.progress) === null || _e === void 0 ? void 0 : _e.set(check.length, \"Finding Issues\");\n        for (const obj of check) {\n            (_f = input === null || input === void 0 ? void 0 : input.progress) === null || _f === void 0 ? void 0 : _f.tick(\"Finding Issues - \" + obj.getType() + \" \" + obj.getName());\n            for (const rule of rules) {\n                const before = Date.now();\n                issues.push(...rule.run(obj));\n                const runtime = Date.now() - before;\n                rulePerformance[rule.getMetadata().key] = rulePerformance[rule.getMetadata().key] + runtime;\n            }\n        }\n        if ((input === null || input === void 0 ? void 0 : input.outputPerformance) === true) {\n            const perf = [];\n            for (const p in rulePerformance) {\n                if (rulePerformance[p] > 100) { // ignore rules if it takes less than 100ms\n                    perf.push({ name: p, time: rulePerformance[p] });\n                }\n            }\n            perf.sort((a, b) => { return b.time - a.time; });\n            for (const p of perf) {\n                process.stderr.write(\"\\t\" + p.time + \"ms\\t\" + p.name + \"\\n\");\n            }\n        }\n        return this.excludeIssues(issues);\n    }\n    excludeIssues(issues) {\n        var _a;\n        const ret = issues;\n        const globalNoIssues = this.conf.getGlobal().noIssues || [];\n        const globalNoIssuesPatterns = globalNoIssues.map(x => new RegExp(x, \"i\"));\n        if (globalNoIssuesPatterns.length > 0) {\n            for (let i = ret.length - 1; i >= 0; i--) {\n                const filename = ret[i].getFilename();\n                if (excludeHelper_1.ExcludeHelper.isExcluded(filename, globalNoIssuesPatterns)) {\n                    ret.splice(i, 1);\n                }\n            }\n        }\n        // exclude issues, as now we know both the filename and issue key\n        for (const rule of artifacts_rules_1.ArtifactsRules.getRules()) {\n            const key = rule.getMetadata().key;\n            const ruleExclude = (_a = this.conf.readByKey(key, \"exclude\")) !== null && _a !== void 0 ? _a : [];\n            if (ruleExclude.length === 0) {\n                continue;\n            }\n            const ruleExcludePatterns = ruleExclude.map(x => new RegExp(x, \"i\"));\n            for (let i = ret.length - 1; i >= 0; i--) {\n                if (ret[i].getKey() !== key) {\n                    continue;\n                }\n                const filename = ret[i].getFilename();\n                if (excludeHelper_1.ExcludeHelper.isExcluded(filename, ruleExcludePatterns)) {\n                    ret.splice(i, 1);\n                }\n            }\n        }\n        return ret;\n    }\n    findOrCreate(name, type) {\n        try {\n            return this.find(name, type);\n        }\n        catch (_a) {\n            const newName = name.toUpperCase();\n            const newType = type ? type : \"UNKNOWN\";\n            const add = artifacts_objects_1.ArtifactsObjects.newObject(newName, newType);\n            if (this.objects[newName] === undefined) {\n                this.objects[newName] = {};\n            }\n            this.objects[newName][newType] = add;\n            if (this.objectsByType[newType] === undefined) {\n                this.objectsByType[newType] = {};\n            }\n            this.objectsByType[newType][newName] = add;\n            return add;\n        }\n    }\n    removeObject(remove) {\n        if (remove === undefined) {\n            return;\n        }\n        if (this.objects[remove.getName()][remove.getType()] === undefined) {\n            throw new Error(\"removeObject: object not found\");\n        }\n        if (Object.keys(this.objects[remove.getName()]).length === 1) {\n            delete this.objects[remove.getName()];\n        }\n        else {\n            delete this.objects[remove.getName()][remove.getType()];\n        }\n        if (Object.keys(this.objectsByType[remove.getType()]).length === 1) {\n            delete this.objectsByType[remove.getType()];\n        }\n        else {\n            delete this.objectsByType[remove.getType()][remove.getName()];\n        }\n    }\n    find(name, type) {\n        const searchType = type ? type : \"UNKNOWN\";\n        const searchName = name.toUpperCase();\n        if (this.objects[searchName] !== undefined\n            && this.objects[searchName][searchType]) {\n            return this.objects[searchName][searchType];\n        }\n        throw new Error(\"find: object not found, \" + type + \" \" + name);\n    }\n}\nexports.Registry = Registry;\n//# sourceMappingURL=registry.js.map\n\n//# sourceURL=webpack://@abaplint/cli/./node_modules/@abaplint/core/build/src/registry.js?");
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.Registry = void 0;\nconst config_1 = __webpack_require__(/*! ./config */ \"./node_modules/@abaplint/core/build/src/config.js\");\nconst artifacts_objects_1 = __webpack_require__(/*! ./artifacts_objects */ \"./node_modules/@abaplint/core/build/src/artifacts_objects.js\");\nconst artifacts_rules_1 = __webpack_require__(/*! ./artifacts_rules */ \"./node_modules/@abaplint/core/build/src/artifacts_rules.js\");\nconst skip_logic_1 = __webpack_require__(/*! ./skip_logic */ \"./node_modules/@abaplint/core/build/src/skip_logic.js\");\nconst _abap_object_1 = __webpack_require__(/*! ./objects/_abap_object */ \"./node_modules/@abaplint/core/build/src/objects/_abap_object.js\");\nconst find_global_definitions_1 = __webpack_require__(/*! ./abap/5_syntax/global_definitions/find_global_definitions */ \"./node_modules/@abaplint/core/build/src/abap/5_syntax/global_definitions/find_global_definitions.js\");\nconst syntax_1 = __webpack_require__(/*! ./abap/5_syntax/syntax */ \"./node_modules/@abaplint/core/build/src/abap/5_syntax/syntax.js\");\nconst excludeHelper_1 = __webpack_require__(/*! ./utils/excludeHelper */ \"./node_modules/@abaplint/core/build/src/utils/excludeHelper.js\");\nconst ddic_references_1 = __webpack_require__(/*! ./ddic_references */ \"./node_modules/@abaplint/core/build/src/ddic_references.js\");\n// todo, this should really be an instance in case there are multiple Registry'ies\nclass ParsingPerformance {\n    static clear() {\n        this.results = [];\n        this.lexing = 0;\n        this.statements = 0;\n        this.structure = 0;\n    }\n    static push(obj, result) {\n        if (result.runtimeExtra) {\n            this.lexing += result.runtimeExtra.lexing;\n            this.statements += result.runtimeExtra.statements;\n            this.structure += result.runtimeExtra.structure;\n        }\n        if (result.runtime < 100) {\n            return;\n        }\n        if (this.results === undefined) {\n            this.results = [];\n        }\n        let extra = \"\";\n        if (result.runtimeExtra) {\n            extra = `\\t(lexing: ${result.runtimeExtra.lexing}ms, statements: ${result.runtimeExtra.statements}ms, structure: ${result.runtimeExtra.structure}ms)`;\n        }\n        this.results.push({\n            runtime: result.runtime,\n            extra,\n            name: obj.getType() + \" \" + obj.getName(),\n        });\n    }\n    static output() {\n        const MAX = 10;\n        this.results.sort((a, b) => { return b.runtime - a.runtime; });\n        for (let i = 0; i < MAX; i++) {\n            const row = this.results[i];\n            if (row === undefined) {\n                break;\n            }\n            process.stderr.write(`\\t${row.runtime}ms\\t${row.name} ${row.extra}\\n`);\n        }\n        process.stderr.write(`\\tTotal lexing:     ${this.lexing}ms\\n`);\n        process.stderr.write(`\\tTotal statements: ${this.statements}ms\\n`);\n        process.stderr.write(`\\tTotal structure:  ${this.structure}ms\\n`);\n    }\n}\n///////////////////////////////////////////////////////////////////////////////////////////////\nclass Registry {\n    constructor(conf) {\n        this.objects = {};\n        this.objectsByType = {};\n        /** object containing filenames of dependencies */\n        this.dependencies = {};\n        this.issues = [];\n        this.conf = conf ? conf : config_1.Config.getDefault();\n        this.references = new ddic_references_1.DDICReferences();\n    }\n    static abaplintVersion() {\n        // magic, see build script \"version.sh\"\n        return \"2.90.1\";\n    }\n    getDDICReferences() {\n        return this.references;\n    }\n    *getObjects() {\n        for (const name in this.objects) {\n            for (const type in this.objects[name]) {\n                yield this.objects[name][type];\n            }\n        }\n    }\n    *getObjectsByType(type) {\n        for (const name in this.objectsByType[type] || []) {\n            yield this.objectsByType[type][name];\n        }\n    }\n    *getFiles() {\n        for (const obj of this.getObjects()) {\n            for (const file of obj.getFiles()) {\n                yield file;\n            }\n        }\n    }\n    getFirstObject() {\n        for (const name in this.objects) {\n            for (const type in this.objects[name]) {\n                return this.objects[name][type];\n            }\n        }\n        return undefined;\n    }\n    getObjectCount(skipDependencies = true) {\n        let res = 0;\n        for (const o of this.getObjects()) {\n            if (skipDependencies === true && this.isDependency(o)) {\n                continue;\n            }\n            res = res + 1;\n        }\n        return res;\n    }\n    getFileByName(filename) {\n        const upper = filename.toUpperCase();\n        for (const o of this.getObjects()) {\n            for (const f of o.getFiles()) {\n                if (f.getFilename().toUpperCase() === upper) {\n                    return f;\n                }\n            }\n        }\n        return undefined;\n    }\n    getObject(type, name) {\n        if (type === undefined || name === undefined) {\n            return undefined;\n        }\n        const searchName = name.toUpperCase();\n        if (this.objects[searchName]) {\n            return this.objects[searchName][type];\n        }\n        return undefined;\n    }\n    getConfig() {\n        return this.conf;\n    }\n    // assumption: Config is immutable, and can only be changed via this method\n    setConfig(conf) {\n        for (const obj of this.getObjects()) {\n            obj.setDirty();\n        }\n        this.conf = conf;\n        return this;\n    }\n    inErrorNamespace(name) {\n        const reg = new RegExp(this.getConfig().getSyntaxSetttings().errorNamespace, \"i\");\n        return reg.test(name);\n    }\n    addFile(file) {\n        return this.addFiles([file]);\n    }\n    updateFile(file) {\n        const obj = this.find(file.getObjectName(), file.getObjectType());\n        obj.updateFile(file);\n        return this;\n    }\n    removeFile(file) {\n        const obj = this.find(file.getObjectName(), file.getObjectType());\n        obj.removeFile(file);\n        if (obj.getFiles().length === 0) {\n            this.references.clear(obj);\n            this.removeObject(obj);\n        }\n        return this;\n    }\n    addFiles(files) {\n        var _a;\n        const globalExclude = ((_a = this.conf.getGlobal().exclude) !== null && _a !== void 0 ? _a : [])\n            .map(pattern => new RegExp(pattern, \"i\"));\n        for (const f of files) {\n            const filename = f.getFilename();\n            const isNotAbapgitFile = filename.split(\".\").length <= 2;\n            if (isNotAbapgitFile || excludeHelper_1.ExcludeHelper.isExcluded(filename, globalExclude)) {\n                continue;\n            }\n            const found = this.findOrCreate(f.getObjectName(), f.getObjectType());\n            found.addFile(f);\n        }\n        return this;\n    }\n    addDependencies(files) {\n        for (const f of files) {\n            this.dependencies[f.getFilename().toUpperCase()] = true;\n        }\n        return this.addFiles(files);\n    }\n    addDependency(file) {\n        this.dependencies[file.getFilename().toUpperCase()] = true;\n        this.addFile(file);\n        return this;\n    }\n    isDependency(obj) {\n        const filename = obj.getFiles()[0].getFilename().toUpperCase();\n        return this.dependencies[filename] === true;\n    }\n    isFileDependency(filename) {\n        return this.dependencies[filename.toUpperCase()] === true;\n    }\n    // assumption: the file is already in the registry\n    findObjectForFile(file) {\n        const filename = file.getFilename();\n        for (const obj of this.getObjects()) {\n            for (const ofile of obj.getFiles()) {\n                if (ofile.getFilename() === filename) {\n                    return obj;\n                }\n            }\n        }\n        return undefined;\n    }\n    // todo, this will be changed to async sometime\n    findIssues(input) {\n        if (this.isDirty() === true) {\n            this.parse();\n        }\n        return this.runRules(input);\n    }\n    // todo, this will be changed to async sometime\n    findIssuesObject(iobj) {\n        if (this.isDirty() === true) {\n            this.parse();\n        }\n        return this.runRules(undefined, iobj);\n    }\n    // todo, this will be changed to async sometime\n    parse() {\n        if (this.isDirty() === false) {\n            return this;\n        }\n        ParsingPerformance.clear();\n        this.issues = [];\n        for (const o of this.getObjects()) {\n            this.parsePrivate(o);\n            this.issues.push(...o.getParsingIssues());\n        }\n        new find_global_definitions_1.FindGlobalDefinitions(this).run();\n        return this;\n    }\n    async parseAsync(input) {\n        var _a, _b;\n        if (this.isDirty() === false) {\n            return this;\n        }\n        ParsingPerformance.clear();\n        (_a = input === null || input === void 0 ? void 0 : input.progress) === null || _a === void 0 ? void 0 : _a.set(this.getObjectCount(false), \"Lexing and parsing\");\n        this.issues = [];\n        for (const o of this.getObjects()) {\n            await ((_b = input === null || input === void 0 ? void 0 : input.progress) === null || _b === void 0 ? void 0 : _b.tick(\"Lexing and parsing(\" + this.conf.getVersion() + \") - \" + o.getType() + \" \" + o.getName()));\n            this.parsePrivate(o);\n            this.issues.push(...o.getParsingIssues());\n        }\n        if ((input === null || input === void 0 ? void 0 : input.outputPerformance) === true) {\n            ParsingPerformance.output();\n        }\n        new find_global_definitions_1.FindGlobalDefinitions(this).run(input === null || input === void 0 ? void 0 : input.progress);\n        return this;\n    }\n    //////////////////////////////////////////\n    // todo, refactor, this is a mess, see where-used, a lot of the code should be in this method instead\n    parsePrivate(input) {\n        const config = this.getConfig();\n        const result = input.parse(config.getVersion(), config.getSyntaxSetttings().globalMacros, this);\n        ParsingPerformance.push(input, result);\n    }\n    isDirty() {\n        for (const o of this.getObjects()) {\n            const dirty = o.isDirty();\n            if (dirty === true) {\n                return true;\n            }\n        }\n        return false;\n    }\n    runRules(input, iobj) {\n        var _a, _b, _c, _d, _e, _f;\n        const rulePerformance = {};\n        const issues = this.issues.slice(0);\n        const objects = iobj ? [iobj] : this.getObjects();\n        const rules = this.conf.getEnabledRules();\n        const skipLogic = new skip_logic_1.SkipLogic(this);\n        (_a = input === null || input === void 0 ? void 0 : input.progress) === null || _a === void 0 ? void 0 : _a.set(iobj ? 1 : this.getObjectCount(false), \"Run Syntax\");\n        const check = [];\n        for (const obj of objects) {\n            (_b = input === null || input === void 0 ? void 0 : input.progress) === null || _b === void 0 ? void 0 : _b.tick(\"Run Syntax - \" + obj.getName());\n            if (skipLogic.skip(obj) || this.isDependency(obj)) {\n                continue;\n            }\n            if (obj instanceof _abap_object_1.ABAPObject) {\n                new syntax_1.SyntaxLogic(this, obj).run();\n            }\n            check.push(obj);\n        }\n        (_c = input === null || input === void 0 ? void 0 : input.progress) === null || _c === void 0 ? void 0 : _c.set(rules.length, \"Initialize Rules\");\n        for (const rule of rules) {\n            (_d = input === null || input === void 0 ? void 0 : input.progress) === null || _d === void 0 ? void 0 : _d.tick(\"Initialize Rules - \" + rule.getMetadata().key);\n            if (rule.initialize === undefined) {\n                throw new Error(rule.getMetadata().key + \" missing initialize method\");\n            }\n            rule.initialize(this);\n            rulePerformance[rule.getMetadata().key] = 0;\n        }\n        (_e = input === null || input === void 0 ? void 0 : input.progress) === null || _e === void 0 ? void 0 : _e.set(check.length, \"Finding Issues\");\n        for (const obj of check) {\n            (_f = input === null || input === void 0 ? void 0 : input.progress) === null || _f === void 0 ? void 0 : _f.tick(\"Finding Issues - \" + obj.getType() + \" \" + obj.getName());\n            for (const rule of rules) {\n                const before = Date.now();\n                issues.push(...rule.run(obj));\n                const runtime = Date.now() - before;\n                rulePerformance[rule.getMetadata().key] = rulePerformance[rule.getMetadata().key] + runtime;\n            }\n        }\n        if ((input === null || input === void 0 ? void 0 : input.outputPerformance) === true) {\n            const perf = [];\n            for (const p in rulePerformance) {\n                if (rulePerformance[p] > 100) { // ignore rules if it takes less than 100ms\n                    perf.push({ name: p, time: rulePerformance[p] });\n                }\n            }\n            perf.sort((a, b) => { return b.time - a.time; });\n            for (const p of perf) {\n                process.stderr.write(\"\\t\" + p.time + \"ms\\t\" + p.name + \"\\n\");\n            }\n        }\n        return this.excludeIssues(issues);\n    }\n    excludeIssues(issues) {\n        var _a;\n        const ret = issues;\n        const globalNoIssues = this.conf.getGlobal().noIssues || [];\n        const globalNoIssuesPatterns = globalNoIssues.map(x => new RegExp(x, \"i\"));\n        if (globalNoIssuesPatterns.length > 0) {\n            for (let i = ret.length - 1; i >= 0; i--) {\n                const filename = ret[i].getFilename();\n                if (excludeHelper_1.ExcludeHelper.isExcluded(filename, globalNoIssuesPatterns)) {\n                    ret.splice(i, 1);\n                }\n            }\n        }\n        // exclude issues, as now we know both the filename and issue key\n        for (const rule of artifacts_rules_1.ArtifactsRules.getRules()) {\n            const key = rule.getMetadata().key;\n            const ruleExclude = (_a = this.conf.readByKey(key, \"exclude\")) !== null && _a !== void 0 ? _a : [];\n            if (ruleExclude.length === 0) {\n                continue;\n            }\n            const ruleExcludePatterns = ruleExclude.map(x => new RegExp(x, \"i\"));\n            for (let i = ret.length - 1; i >= 0; i--) {\n                if (ret[i].getKey() !== key) {\n                    continue;\n                }\n                const filename = ret[i].getFilename();\n                if (excludeHelper_1.ExcludeHelper.isExcluded(filename, ruleExcludePatterns)) {\n                    ret.splice(i, 1);\n                }\n            }\n        }\n        return ret;\n    }\n    findOrCreate(name, type) {\n        try {\n            return this.find(name, type);\n        }\n        catch (_a) {\n            const newName = name.toUpperCase();\n            const newType = type ? type : \"UNKNOWN\";\n            const add = artifacts_objects_1.ArtifactsObjects.newObject(newName, newType);\n            if (this.objects[newName] === undefined) {\n                this.objects[newName] = {};\n            }\n            this.objects[newName][newType] = add;\n            if (this.objectsByType[newType] === undefined) {\n                this.objectsByType[newType] = {};\n            }\n            this.objectsByType[newType][newName] = add;\n            return add;\n        }\n    }\n    removeObject(remove) {\n        if (remove === undefined) {\n            return;\n        }\n        if (this.objects[remove.getName()][remove.getType()] === undefined) {\n            throw new Error(\"removeObject: object not found\");\n        }\n        if (Object.keys(this.objects[remove.getName()]).length === 1) {\n            delete this.objects[remove.getName()];\n        }\n        else {\n            delete this.objects[remove.getName()][remove.getType()];\n        }\n        if (Object.keys(this.objectsByType[remove.getType()]).length === 1) {\n            delete this.objectsByType[remove.getType()];\n        }\n        else {\n            delete this.objectsByType[remove.getType()][remove.getName()];\n        }\n    }\n    find(name, type) {\n        const searchType = type ? type : \"UNKNOWN\";\n        const searchName = name.toUpperCase();\n        if (this.objects[searchName] !== undefined\n            && this.objects[searchName][searchType]) {\n            return this.objects[searchName][searchType];\n        }\n        throw new Error(\"find: object not found, \" + type + \" \" + name);\n    }\n}\nexports.Registry = Registry;\n//# sourceMappingURL=registry.js.map\n\n//# sourceURL=webpack://@abaplint/cli/./node_modules/@abaplint/core/build/src/registry.js?");
 /***/ }),
@@ -11698,7 +11698,7 @@ eval("\r\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\r\n
 /***/ ((__unused_webpack_module, exports, __webpack_require__) => {
 "use strict";
-eval("\r\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\r\nexports.DoubleSpace = exports.DoubleSpaceConf = void 0;\r\nconst issue_1 = __webpack_require__(/*! ../issue */ \"./node_modules/@abaplint/core/build/src/issue.js\");\r\nconst _abap_rule_1 = __webpack_require__(/*! ./_abap_rule */ \"./node_modules/@abaplint/core/build/src/rules/_abap_rule.js\");\r\nconst _basic_rule_config_1 = __webpack_require__(/*! ./_basic_rule_config */ \"./node_modules/@abaplint/core/build/src/rules/_basic_rule_config.js\");\r\nconst tokens_1 = __webpack_require__(/*! ../abap/1_lexer/tokens */ \"./node_modules/@abaplint/core/build/src/abap/1_lexer/tokens/index.js\");\r\nconst nodes_1 = __webpack_require__(/*! ../abap/nodes */ \"./node_modules/@abaplint/core/build/src/abap/nodes/index.js\");\r\nconst _statement_1 = __webpack_require__(/*! ../abap/2_statements/statements/_statement */ \"./node_modules/@abaplint/core/build/src/abap/2_statements/statements/_statement.js\");\r\nconst statements_1 = __webpack_require__(/*! ../abap/2_statements/statements */ \"./node_modules/@abaplint/core/build/src/abap/2_statements/statements/index.js\");\r\nconst position_1 = __webpack_require__(/*! ../position */ \"./node_modules/@abaplint/core/build/src/position.js\");\r\nconst edit_helper_1 = __webpack_require__(/*! ../edit_helper */ \"./node_modules/@abaplint/core/build/src/edit_helper.js\");\r\nconst _irule_1 = __webpack_require__(/*! ./_irule */ \"./node_modules/@abaplint/core/build/src/rules/_irule.js\");\r\nclass DoubleSpaceConf extends _basic_rule_config_1.BasicRuleConfig {\r\n    constructor() {\r\n        super(...arguments);\r\n        /** Check for double space after keywords */\r\n        this.keywords = true;\r\n        /** Check for double space after start parenthesis */\r\n        this.startParen = true;\r\n        /** Check for double space before end parenthesis */\r\n        this.endParen = true;\r\n        /** Check for double space after colon/chaining operator */\r\n        this.afterColon = true;\r\n    }\r\n}\r\nexports.DoubleSpaceConf = DoubleSpaceConf;\r\nclass DoubleSpace extends _abap_rule_1.ABAPRule {\r\n    constructor() {\r\n        super(...arguments);\r\n        this.conf = new DoubleSpaceConf();\r\n    }\r\n    getMetadata() {\r\n        return {\r\n            key: \"double_space\",\r\n            title: \"Double space\",\r\n            shortDescription: `Checks that only a single space follows certain common statements.`,\r\n            tags: [_irule_1.RuleTag.Whitespace, _irule_1.RuleTag.Quickfix, _irule_1.RuleTag.SingleFile],\r\n            badExample: `DATA  foo TYPE i.`,\r\n            goodExample: `DATA foo TYPE i.`,\r\n        };\r\n    }\r\n    getMessage() {\r\n        return \"Remove double space\";\r\n    }\r\n    getConfig() {\r\n        return this.conf;\r\n    }\r\n    setConfig(conf) {\r\n        this.conf = conf;\r\n    }\r\n    runParsed(file) {\r\n        let issues = [];\r\n        for (const s of file.getStatements()) {\r\n            if (this.conf.keywords === true\r\n                && !(s.get() instanceof _statement_1.Unknown)\r\n                && !(s.get() instanceof statements_1.MethodDef)\r\n                && !(s.get() instanceof _statement_1.MacroCall)\r\n                && !(s.get() instanceof statements_1.Events)\r\n                && !(s.get() instanceof _statement_1.MacroContent)) {\r\n                issues = issues.concat(this.checkKeywords(s, file));\r\n            }\r\n            issues = issues.concat(this.checkParen(s, file));\r\n        }\r\n        issues = issues.concat(this.checkAfterColon(file));\r\n        return issues;\r\n    }\r\n    checkAfterColon(file) {\r\n        const issues = [];\r\n        let cPosition = undefined;\r\n        if (this.conf.afterColon !== true) {\r\n            return [];\r\n        }\r\n        for (const s of file.getStatements()) {\r\n            const colon = s.getColon();\r\n            if (colon === undefined) {\r\n                continue;\r\n            }\r\n            else if (cPosition !== undefined && cPosition.getCol() === colon.getCol()) {\r\n                continue;\r\n            }\r\n            cPosition = colon.getStart();\r\n            for (const t of s.getTokens()) {\r\n                if (t.getRow() !== cPosition.getRow()) {\r\n                    return [];\r\n                }\r\n                else if (t.getCol() < cPosition.getCol()) {\r\n                    continue;\r\n                }\r\n                if (t.getCol() > cPosition.getCol() + 2) {\r\n                    const issueStartPos = new position_1.Position(cPosition.getRow(), cPosition.getCol() + 2);\r\n                    const issueEndPos = new position_1.Position(t.getRow(), t.getCol());\r\n                    const fix = edit_helper_1.EditHelper.deleteRange(file, issueStartPos, issueEndPos);\r\n                    issues.push(issue_1.Issue.atRange(file, issueStartPos, issueEndPos, this.getMessage(), this.getMetadata().key, this.conf.severity, fix));\r\n                }\r\n                break;\r\n            }\r\n        }\r\n        return issues;\r\n    }\r\n    checkParen(s, file) {\r\n        const issues = [];\r\n        let prev = undefined;\r\n        for (const t of s.getTokens()) {\r\n            if (prev === undefined) {\r\n                prev = t;\r\n                continue;\r\n            }\r\n            if (this.getConfig().startParen === true\r\n                && prev.getRow() === t.getRow()\r\n                && prev instanceof tokens_1.ParenLeftW\r\n                && !(t instanceof tokens_1.Comment)\r\n                && prev.getEnd().getCol() + 1 < t.getCol()) {\r\n                const issueStartPos = new position_1.Position(prev.getRow(), prev.getCol() + 2);\r\n                const issueEndPos = new position_1.Position(t.getRow(), t.getCol());\r\n                const fix = edit_helper_1.EditHelper.deleteRange(file, issueStartPos, issueEndPos);\r\n                issues.push(issue_1.Issue.atRange(file, issueStartPos, issueEndPos, this.getMessage(), this.getMetadata().key, this.conf.severity, fix));\r\n            }\r\n            if (this.getConfig().endParen === true\r\n                && prev.getRow() === t.getRow()\r\n                && !(prev instanceof tokens_1.ParenLeftW)\r\n                && (t instanceof tokens_1.WParenRightW || t instanceof tokens_1.WParenRight)\r\n                && prev.getEnd().getCol() + 1 < t.getCol()) {\r\n                const issueStartPos = new position_1.Position(prev.getEnd().getRow(), prev.getEnd().getCol() + 1);\r\n                const issueEndPos = new position_1.Position(t.getRow(), t.getCol());\r\n                const fix = edit_helper_1.EditHelper.deleteRange(file, issueStartPos, issueEndPos);\r\n                issues.push(issue_1.Issue.atRange(file, issueStartPos, issueEndPos, this.getMessage(), this.getMetadata().key, this.conf.severity, fix));\r\n            }\r\n            prev = t;\r\n        }\r\n        return issues;\r\n    }\r\n    checkKeywords(s, file) {\r\n        const issues = [];\r\n        let prev = undefined;\r\n        if (s.getColon() !== undefined || s.getPragmas().length > 0) {\r\n            // for chained statments just give up\r\n            return [];\r\n        }\r\n        for (const n of s.getTokenNodes()) {\r\n            if (prev === undefined) {\r\n                prev = n;\r\n                continue;\r\n            }\r\n            const upper = prev.get().getStr().toUpperCase();\r\n            if (prev instanceof nodes_1.TokenNodeRegex\r\n                || upper === \"(\"\r\n                || upper === \")\"\r\n                || upper === \"CHANGING\"\r\n                || upper === \"EXPORTING\"\r\n                || upper === \"OTHERS\") {\r\n                // not a keyword, continue\r\n                prev = n;\r\n                continue;\r\n            }\r\n            if (prev.get().getStart().getRow() === n.get().getStart().getRow()\r\n                && prev.get().getEnd().getCol() + 1 < n.get().getStart().getCol()) {\r\n                const issueStartPos = new position_1.Position(prev.get().getEnd().getRow(), prev.get().getEnd().getCol() + 1);\r\n                const issueEndPos = new position_1.Position(n.get().getRow(), n.get().getCol());\r\n                const fix = edit_helper_1.EditHelper.deleteRange(file, issueStartPos, issueEndPos);\r\n                issues.push(issue_1.Issue.atRange(file, issueStartPos, issueEndPos, this.getMessage(), this.getMetadata().key, this.conf.severity, fix));\r\n                return issues;\r\n            }\r\n            prev = n;\r\n        }\r\n        return [];\r\n    }\r\n}\r\nexports.DoubleSpace = DoubleSpace;\r\n//# sourceMappingURL=double_space.js.map\n\n//# sourceURL=webpack://@abaplint/cli/./node_modules/@abaplint/core/build/src/rules/double_space.js?");
+eval("\r\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\r\nexports.DoubleSpace = exports.DoubleSpaceConf = void 0;\r\nconst issue_1 = __webpack_require__(/*! ../issue */ \"./node_modules/@abaplint/core/build/src/issue.js\");\r\nconst _abap_rule_1 = __webpack_require__(/*! ./_abap_rule */ \"./node_modules/@abaplint/core/build/src/rules/_abap_rule.js\");\r\nconst _basic_rule_config_1 = __webpack_require__(/*! ./_basic_rule_config */ \"./node_modules/@abaplint/core/build/src/rules/_basic_rule_config.js\");\r\nconst tokens_1 = __webpack_require__(/*! ../abap/1_lexer/tokens */ \"./node_modules/@abaplint/core/build/src/abap/1_lexer/tokens/index.js\");\r\nconst nodes_1 = __webpack_require__(/*! ../abap/nodes */ \"./node_modules/@abaplint/core/build/src/abap/nodes/index.js\");\r\nconst _statement_1 = __webpack_require__(/*! ../abap/2_statements/statements/_statement */ \"./node_modules/@abaplint/core/build/src/abap/2_statements/statements/_statement.js\");\r\nconst statements_1 = __webpack_require__(/*! ../abap/2_statements/statements */ \"./node_modules/@abaplint/core/build/src/abap/2_statements/statements/index.js\");\r\nconst position_1 = __webpack_require__(/*! ../position */ \"./node_modules/@abaplint/core/build/src/position.js\");\r\nconst edit_helper_1 = __webpack_require__(/*! ../edit_helper */ \"./node_modules/@abaplint/core/build/src/edit_helper.js\");\r\nconst _irule_1 = __webpack_require__(/*! ./_irule */ \"./node_modules/@abaplint/core/build/src/rules/_irule.js\");\r\nclass DoubleSpaceConf extends _basic_rule_config_1.BasicRuleConfig {\r\n    constructor() {\r\n        super(...arguments);\r\n        /** Check for double space after keywords */\r\n        this.keywords = true;\r\n        /** Check for double space after start parenthesis */\r\n        this.startParen = true;\r\n        /** Check for double space before end parenthesis */\r\n        this.endParen = true;\r\n        /** Check for double space after colon/chaining operator */\r\n        this.afterColon = true;\r\n    }\r\n}\r\nexports.DoubleSpaceConf = DoubleSpaceConf;\r\nclass DoubleSpace extends _abap_rule_1.ABAPRule {\r\n    constructor() {\r\n        super(...arguments);\r\n        this.conf = new DoubleSpaceConf();\r\n    }\r\n    getMetadata() {\r\n        return {\r\n            key: \"double_space\",\r\n            title: \"Double space\",\r\n            shortDescription: `Checks that only a single space follows certain common statements.`,\r\n            tags: [_irule_1.RuleTag.Whitespace, _irule_1.RuleTag.Quickfix, _irule_1.RuleTag.SingleFile],\r\n            badExample: `DATA  foo TYPE i.`,\r\n            goodExample: `DATA foo TYPE i.`,\r\n        };\r\n    }\r\n    getMessage() {\r\n        return \"Remove double space\";\r\n    }\r\n    getConfig() {\r\n        return this.conf;\r\n    }\r\n    setConfig(conf) {\r\n        this.conf = conf;\r\n    }\r\n    runParsed(file) {\r\n        let issues = [];\r\n        for (const s of file.getStatements()) {\r\n            if (this.conf.keywords === true\r\n                && !(s.get() instanceof _statement_1.Unknown)\r\n                && !(s.get() instanceof statements_1.MethodDef)\r\n                && !(s.get() instanceof _statement_1.MacroCall)\r\n                && !(s.get() instanceof statements_1.Events)\r\n                && !(s.get() instanceof _statement_1.MacroContent)) {\r\n                issues = issues.concat(this.checkKeywords(s, file));\r\n            }\r\n            issues = issues.concat(this.checkParen(s, file));\r\n        }\r\n        issues = issues.concat(this.checkAfterColon(file));\r\n        return issues;\r\n    }\r\n    checkAfterColon(file) {\r\n        const issues = [];\r\n        let cPosition = undefined;\r\n        if (this.conf.afterColon !== true) {\r\n            return [];\r\n        }\r\n        for (const s of file.getStatements()) {\r\n            const colon = s.getColon();\r\n            if (colon === undefined) {\r\n                continue;\r\n            }\r\n            else if (cPosition !== undefined && cPosition.getCol() === colon.getCol()) {\r\n                continue;\r\n            }\r\n            cPosition = colon.getStart();\r\n            for (const t of s.getTokens()) {\r\n                if (t.getRow() !== cPosition.getRow()) {\r\n                    return [];\r\n                }\r\n                else if (t.getCol() < cPosition.getCol()) {\r\n                    continue;\r\n                }\r\n                if (t.getCol() > cPosition.getCol() + 2) {\r\n                    const issueStartPos = new position_1.Position(cPosition.getRow(), cPosition.getCol() + 2);\r\n                    const issueEndPos = new position_1.Position(t.getRow(), t.getCol());\r\n                    const fix = edit_helper_1.EditHelper.deleteRange(file, issueStartPos, issueEndPos);\r\n                    issues.push(issue_1.Issue.atRange(file, issueStartPos, issueEndPos, this.getMessage(), this.getMetadata().key, this.conf.severity, fix));\r\n                }\r\n                break;\r\n            }\r\n        }\r\n        return issues;\r\n    }\r\n    checkParen(s, file) {\r\n        const issues = [];\r\n        let prev = undefined;\r\n        for (const t of s.getTokens()) {\r\n            if (prev === undefined) {\r\n                prev = t;\r\n                continue;\r\n            }\r\n            if (this.getConfig().startParen === true\r\n                && prev.getRow() === t.getRow()\r\n                && prev instanceof tokens_1.ParenLeftW\r\n                && !(t instanceof tokens_1.Comment)\r\n                && prev.getEnd().getCol() + 1 < t.getCol()) {\r\n                const issueStartPos = new position_1.Position(prev.getRow(), prev.getCol() + 2);\r\n                const issueEndPos = new position_1.Position(t.getRow(), t.getCol());\r\n                const fix = edit_helper_1.EditHelper.deleteRange(file, issueStartPos, issueEndPos);\r\n                if (this.pragmaInRange(s.getPragmas(), issueStartPos, issueEndPos) === false) {\r\n                    issues.push(issue_1.Issue.atRange(file, issueStartPos, issueEndPos, this.getMessage(), this.getMetadata().key, this.conf.severity, fix));\r\n                }\r\n            }\r\n            if (this.getConfig().endParen === true\r\n                && prev.getRow() === t.getRow()\r\n                && !(prev instanceof tokens_1.ParenLeftW)\r\n                && (t instanceof tokens_1.WParenRightW || t instanceof tokens_1.WParenRight)\r\n                && prev.getEnd().getCol() + 1 < t.getCol()) {\r\n                const issueStartPos = new position_1.Position(prev.getEnd().getRow(), prev.getEnd().getCol() + 1);\r\n                const issueEndPos = new position_1.Position(t.getRow(), t.getCol());\r\n                const fix = edit_helper_1.EditHelper.deleteRange(file, issueStartPos, issueEndPos);\r\n                if (this.pragmaInRange(s.getPragmas(), issueStartPos, issueEndPos) === false) {\r\n                    issues.push(issue_1.Issue.atRange(file, issueStartPos, issueEndPos, this.getMessage(), this.getMetadata().key, this.conf.severity, fix));\r\n                }\r\n            }\r\n            prev = t;\r\n        }\r\n        return issues;\r\n    }\r\n    pragmaInRange(pragmas, start, end) {\r\n        let ret = false;\r\n        for (const p of pragmas) {\r\n            if (p.getStart().isBetween(start, end)) {\r\n                ret = true;\r\n            }\r\n        }\r\n        return ret;\r\n    }\r\n    checkKeywords(s, file) {\r\n        const issues = [];\r\n        let prev = undefined;\r\n        if (s.getColon() !== undefined || s.getPragmas().length > 0) {\r\n            // for chained statments just give up\r\n            return [];\r\n        }\r\n        for (const n of s.getTokenNodes()) {\r\n            if (prev === undefined) {\r\n                prev = n;\r\n                continue;\r\n            }\r\n            const upper = prev.get().getStr().toUpperCase();\r\n            if (prev instanceof nodes_1.TokenNodeRegex\r\n                || upper === \"(\"\r\n                || upper === \")\"\r\n                || upper === \"CHANGING\"\r\n                || upper === \"EXPORTING\"\r\n                || upper === \"OTHERS\") {\r\n                // not a keyword, continue\r\n                prev = n;\r\n                continue;\r\n            }\r\n            if (prev.get().getStart().getRow() === n.get().getStart().getRow()\r\n                && prev.get().getEnd().getCol() + 1 < n.get().getStart().getCol()) {\r\n                const issueStartPos = new position_1.Position(prev.get().getEnd().getRow(), prev.get().getEnd().getCol() + 1);\r\n                const issueEndPos = new position_1.Position(n.get().getRow(), n.get().getCol());\r\n                const fix = edit_helper_1.EditHelper.deleteRange(file, issueStartPos, issueEndPos);\r\n                issues.push(issue_1.Issue.atRange(file, issueStartPos, issueEndPos, this.getMessage(), this.getMetadata().key, this.conf.severity, fix));\r\n                return issues;\r\n            }\r\n            prev = n;\r\n        }\r\n        return [];\r\n    }\r\n}\r\nexports.DoubleSpace = DoubleSpace;\r\n//# sourceMappingURL=double_space.js.map\n\n//# sourceURL=webpack://@abaplint/cli/./node_modules/@abaplint/core/build/src/rules/double_space.js?");
 /***/ }),
@@ -13278,7 +13278,7 @@ eval("if (typeof Object.create === 'function') {\n  // implementation from stand
   \*********************************************/
 /***/ ((module, __unused_webpack_exports, __webpack_require__) => {
-eval("module.exports = minimatch\nminimatch.Minimatch = Minimatch\n\nvar path = { sep: '/' }\ntry {\n  path = __webpack_require__(/*! path */ \"path\")\n} catch (er) {}\n\nvar GLOBSTAR = minimatch.GLOBSTAR = Minimatch.GLOBSTAR = {}\nvar expand = __webpack_require__(/*! brace-expansion */ \"./node_modules/brace-expansion/index.js\")\n\nvar plTypes = {\n  '!': { open: '(?:(?!(?:', close: '))[^/]*?)'},\n  '?': { open: '(?:', close: ')?' },\n  '+': { open: '(?:', close: ')+' },\n  '*': { open: '(?:', close: ')*' },\n  '@': { open: '(?:', close: ')' }\n}\n\n// any single thing other than /\n// don't need to escape / when using new RegExp()\nvar qmark = '[^/]'\n\n// * => any number of characters\nvar star = qmark + '*?'\n\n// ** when dots are allowed.  Anything goes, except .. and .\n// not (^ or / followed by one or two dots followed by $ or /),\n// followed by anything, any number of times.\nvar twoStarDot = '(?:(?!(?:\\\\\\/|^)(?:\\\\.{1,2})($|\\\\\\/)).)*?'\n\n// not a ^ or / followed by a dot,\n// followed by anything, any number of times.\nvar twoStarNoDot = '(?:(?!(?:\\\\\\/|^)\\\\.).)*?'\n\n// characters that need to be escaped in RegExp.\nvar reSpecials = charSet('().*{}+?[]^$\\\\!')\n\n// \"abc\" -> { a:true, b:true, c:true }\nfunction charSet (s) {\n  return s.split('').reduce(function (set, c) {\n    set[c] = true\n    return set\n  }, {})\n}\n\n// normalizes slashes.\nvar slashSplit = /\\/+/\n\nminimatch.filter = filter\nfunction filter (pattern, options) {\n  options = options || {}\n  return function (p, i, list) {\n    return minimatch(p, pattern, options)\n  }\n}\n\nfunction ext (a, b) {\n  a = a || {}\n  b = b || {}\n  var t = {}\n  Object.keys(b).forEach(function (k) {\n    t[k] = b[k]\n  })\n  Object.keys(a).forEach(function (k) {\n    t[k] = a[k]\n  })\n  return t\n}\n\nminimatch.defaults = function (def) {\n  if (!def || !Object.keys(def).length) return minimatch\n\n  var orig = minimatch\n\n  var m = function minimatch (p, pattern, options) {\n    return orig.minimatch(p, pattern, ext(def, options))\n  }\n\n  m.Minimatch = function Minimatch (pattern, options) {\n    return new orig.Minimatch(pattern, ext(def, options))\n  }\n\n  return m\n}\n\nMinimatch.defaults = function (def) {\n  if (!def || !Object.keys(def).length) return Minimatch\n  return minimatch.defaults(def).Minimatch\n}\n\nfunction minimatch (p, pattern, options) {\n  if (typeof pattern !== 'string') {\n    throw new TypeError('glob pattern string required')\n  }\n\n  if (!options) options = {}\n\n  // shortcut: comments match nothing.\n  if (!options.nocomment && pattern.charAt(0) === '#') {\n    return false\n  }\n\n  // \"\" only matches \"\"\n  if (pattern.trim() === '') return p === ''\n\n  return new Minimatch(pattern, options).match(p)\n}\n\nfunction Minimatch (pattern, options) {\n  if (!(this instanceof Minimatch)) {\n    return new Minimatch(pattern, options)\n  }\n\n  if (typeof pattern !== 'string') {\n    throw new TypeError('glob pattern string required')\n  }\n\n  if (!options) options = {}\n  pattern = pattern.trim()\n\n  // windows support: need to use /, not \\\n  if (path.sep !== '/') {\n    pattern = pattern.split(path.sep).join('/')\n  }\n\n  this.options = options\n  this.set = []\n  this.pattern = pattern\n  this.regexp = null\n  this.negate = false\n  this.comment = false\n  this.empty = false\n\n  // make the set of regexps etc.\n  this.make()\n}\n\nMinimatch.prototype.debug = function () {}\n\nMinimatch.prototype.make = make\nfunction make () {\n  // don't do it more than once.\n  if (this._made) return\n\n  var pattern = this.pattern\n  var options = this.options\n\n  // empty patterns and comments match nothing.\n  if (!options.nocomment && pattern.charAt(0) === '#') {\n    this.comment = true\n    return\n  }\n  if (!pattern) {\n    this.empty = true\n    return\n  }\n\n  // step 1: figure out negation, etc.\n  this.parseNegate()\n\n  // step 2: expand braces\n  var set = this.globSet = this.braceExpand()\n\n  if (options.debug) this.debug = console.error\n\n  this.debug(this.pattern, set)\n\n  // step 3: now we have a set, so turn each one into a series of path-portion\n  // matching patterns.\n  // These will be regexps, except in the case of \"**\", which is\n  // set to the GLOBSTAR object for globstar behavior,\n  // and will not contain any / characters\n  set = this.globParts = set.map(function (s) {\n    return s.split(slashSplit)\n  })\n\n  this.debug(this.pattern, set)\n\n  // glob --> regexps\n  set = set.map(function (s, si, set) {\n    return s.map(this.parse, this)\n  }, this)\n\n  this.debug(this.pattern, set)\n\n  // filter out everything that didn't compile properly.\n  set = set.filter(function (s) {\n    return s.indexOf(false) === -1\n  })\n\n  this.debug(this.pattern, set)\n\n  this.set = set\n}\n\nMinimatch.prototype.parseNegate = parseNegate\nfunction parseNegate () {\n  var pattern = this.pattern\n  var negate = false\n  var options = this.options\n  var negateOffset = 0\n\n  if (options.nonegate) return\n\n  for (var i = 0, l = pattern.length\n    ; i < l && pattern.charAt(i) === '!'\n    ; i++) {\n    negate = !negate\n    negateOffset++\n  }\n\n  if (negateOffset) this.pattern = pattern.substr(negateOffset)\n  this.negate = negate\n}\n\n// Brace expansion:\n// a{b,c}d -> abd acd\n// a{b,}c -> abc ac\n// a{0..3}d -> a0d a1d a2d a3d\n// a{b,c{d,e}f}g -> abg acdfg acefg\n// a{b,c}d{e,f}g -> abdeg acdeg abdeg abdfg\n//\n// Invalid sets are not expanded.\n// a{2..}b -> a{2..}b\n// a{b}c -> a{b}c\nminimatch.braceExpand = function (pattern, options) {\n  return braceExpand(pattern, options)\n}\n\nMinimatch.prototype.braceExpand = braceExpand\n\nfunction braceExpand (pattern, options) {\n  if (!options) {\n    if (this instanceof Minimatch) {\n      options = this.options\n    } else {\n      options = {}\n    }\n  }\n\n  pattern = typeof pattern === 'undefined'\n    ? this.pattern : pattern\n\n  if (typeof pattern === 'undefined') {\n    throw new TypeError('undefined pattern')\n  }\n\n  if (options.nobrace ||\n    !pattern.match(/\\{.*\\}/)) {\n    // shortcut. no need to expand.\n    return [pattern]\n  }\n\n  return expand(pattern)\n}\n\n// parse a component of the expanded set.\n// At this point, no pattern may contain \"/\" in it\n// so we're going to return a 2d array, where each entry is the full\n// pattern, split on '/', and then turned into a regular expression.\n// A regexp is made at the end which joins each array with an\n// escaped /, and another full one which joins each regexp with |.\n//\n// Following the lead of Bash 4.1, note that \"**\" only has special meaning\n// when it is the *only* thing in a path portion.  Otherwise, any series\n// of * is equivalent to a single *.  Globstar behavior is enabled by\n// default, and can be disabled by setting options.noglobstar.\nMinimatch.prototype.parse = parse\nvar SUBPARSE = {}\nfunction parse (pattern, isSub) {\n  if (pattern.length > 1024 * 64) {\n    throw new TypeError('pattern is too long')\n  }\n\n  var options = this.options\n\n  // shortcuts\n  if (!options.noglobstar && pattern === '**') return GLOBSTAR\n  if (pattern === '') return ''\n\n  var re = ''\n  var hasMagic = !!options.nocase\n  var escaping = false\n  // ? => one single character\n  var patternListStack = []\n  var negativeLists = []\n  var stateChar\n  var inClass = false\n  var reClassStart = -1\n  var classStart = -1\n  // . and .. never match anything that doesn't start with .,\n  // even when options.dot is set.\n  var patternStart = pattern.charAt(0) === '.' ? '' // anything\n  // not (start or / followed by . or .. followed by / or end)\n  : options.dot ? '(?!(?:^|\\\\\\/)\\\\.{1,2}(?:$|\\\\\\/))'\n  : '(?!\\\\.)'\n  var self = this\n\n  function clearStateChar () {\n    if (stateChar) {\n      // we had some state-tracking character\n      // that wasn't consumed by this pass.\n      switch (stateChar) {\n        case '*':\n          re += star\n          hasMagic = true\n        break\n        case '?':\n          re += qmark\n          hasMagic = true\n        break\n        default:\n          re += '\\\\' + stateChar\n        break\n      }\n      self.debug('clearStateChar %j %j', stateChar, re)\n      stateChar = false\n    }\n  }\n\n  for (var i = 0, len = pattern.length, c\n    ; (i < len) && (c = pattern.charAt(i))\n    ; i++) {\n    this.debug('%s\\t%s %s %j', pattern, i, re, c)\n\n    // skip over any that are escaped.\n    if (escaping && reSpecials[c]) {\n      re += '\\\\' + c\n      escaping = false\n      continue\n    }\n\n    switch (c) {\n      case '/':\n        // completely not allowed, even escaped.\n        // Should already be path-split by now.\n        return false\n\n      case '\\\\':\n        clearStateChar()\n        escaping = true\n      continue\n\n      // the various stateChar values\n      // for the \"extglob\" stuff.\n      case '?':\n      case '*':\n      case '+':\n      case '@':\n      case '!':\n        this.debug('%s\\t%s %s %j <-- stateChar', pattern, i, re, c)\n\n        // all of those are literals inside a class, except that\n        // the glob [!a] means [^a] in regexp\n        if (inClass) {\n          this.debug('  in class')\n          if (c === '!' && i === classStart + 1) c = '^'\n          re += c\n          continue\n        }\n\n        // if we already have a stateChar, then it means\n        // that there was something like ** or +? in there.\n        // Handle the stateChar, then proceed with this one.\n        self.debug('call clearStateChar %j', stateChar)\n        clearStateChar()\n        stateChar = c\n        // if extglob is disabled, then +(asdf|foo) isn't a thing.\n        // just clear the statechar *now*, rather than even diving into\n        // the patternList stuff.\n        if (options.noext) clearStateChar()\n      continue\n\n      case '(':\n        if (inClass) {\n          re += '('\n          continue\n        }\n\n        if (!stateChar) {\n          re += '\\\\('\n          continue\n        }\n\n        patternListStack.push({\n          type: stateChar,\n          start: i - 1,\n          reStart: re.length,\n          open: plTypes[stateChar].open,\n          close: plTypes[stateChar].close\n        })\n        // negation is (?:(?!js)[^/]*)\n        re += stateChar === '!' ? '(?:(?!(?:' : '(?:'\n        this.debug('plType %j %j', stateChar, re)\n        stateChar = false\n      continue\n\n      case ')':\n        if (inClass || !patternListStack.length) {\n          re += '\\\\)'\n          continue\n        }\n\n        clearStateChar()\n        hasMagic = true\n        var pl = patternListStack.pop()\n        // negation is (?:(?!js)[^/]*)\n        // The others are (?:<pattern>)<type>\n        re += pl.close\n        if (pl.type === '!') {\n          negativeLists.push(pl)\n        }\n        pl.reEnd = re.length\n      continue\n\n      case '|':\n        if (inClass || !patternListStack.length || escaping) {\n          re += '\\\\|'\n          escaping = false\n          continue\n        }\n\n        clearStateChar()\n        re += '|'\n      continue\n\n      // these are mostly the same in regexp and glob\n      case '[':\n        // swallow any state-tracking char before the [\n        clearStateChar()\n\n        if (inClass) {\n          re += '\\\\' + c\n          continue\n        }\n\n        inClass = true\n        classStart = i\n        reClassStart = re.length\n        re += c\n      continue\n\n      case ']':\n        //  a right bracket shall lose its special\n        //  meaning and represent itself in\n        //  a bracket expression if it occurs\n        //  first in the list.  -- POSIX.2 2.8.3.2\n        if (i === classStart + 1 || !inClass) {\n          re += '\\\\' + c\n          escaping = false\n          continue\n        }\n\n        // handle the case where we left a class open.\n        // \"[z-a]\" is valid, equivalent to \"\\[z-a\\]\"\n        if (inClass) {\n          // split where the last [ was, make sure we don't have\n          // an invalid re. if so, re-walk the contents of the\n          // would-be class to re-translate any characters that\n          // were passed through as-is\n          // TODO: It would probably be faster to determine this\n          // without a try/catch and a new RegExp, but it's tricky\n          // to do safely.  For now, this is safe and works.\n          var cs = pattern.substring(classStart + 1, i)\n          try {\n            RegExp('[' + cs + ']')\n          } catch (er) {\n            // not a valid class!\n            var sp = this.parse(cs, SUBPARSE)\n            re = re.substr(0, reClassStart) + '\\\\[' + sp[0] + '\\\\]'\n            hasMagic = hasMagic || sp[1]\n            inClass = false\n            continue\n          }\n        }\n\n        // finish up the class.\n        hasMagic = true\n        inClass = false\n        re += c\n      continue\n\n      default:\n        // swallow any state char that wasn't consumed\n        clearStateChar()\n\n        if (escaping) {\n          // no need\n          escaping = false\n        } else if (reSpecials[c]\n          && !(c === '^' && inClass)) {\n          re += '\\\\'\n        }\n\n        re += c\n\n    } // switch\n  } // for\n\n  // handle the case where we left a class open.\n  // \"[abc\" is valid, equivalent to \"\\[abc\"\n  if (inClass) {\n    // split where the last [ was, and escape it\n    // this is a huge pita.  We now have to re-walk\n    // the contents of the would-be class to re-translate\n    // any characters that were passed through as-is\n    cs = pattern.substr(classStart + 1)\n    sp = this.parse(cs, SUBPARSE)\n    re = re.substr(0, reClassStart) + '\\\\[' + sp[0]\n    hasMagic = hasMagic || sp[1]\n  }\n\n  // handle the case where we had a +( thing at the *end*\n  // of the pattern.\n  // each pattern list stack adds 3 chars, and we need to go through\n  // and escape any | chars that were passed through as-is for the regexp.\n  // Go through and escape them, taking care not to double-escape any\n  // | chars that were already escaped.\n  for (pl = patternListStack.pop(); pl; pl = patternListStack.pop()) {\n    var tail = re.slice(pl.reStart + pl.open.length)\n    this.debug('setting tail', re, pl)\n    // maybe some even number of \\, then maybe 1 \\, followed by a |\n    tail = tail.replace(/((?:\\\\{2}){0,64})(\\\\?)\\|/g, function (_, $1, $2) {\n      if (!$2) {\n        // the | isn't already escaped, so escape it.\n        $2 = '\\\\'\n      }\n\n      // need to escape all those slashes *again*, without escaping the\n      // one that we need for escaping the | character.  As it works out,\n      // escaping an even number of slashes can be done by simply repeating\n      // it exactly after itself.  That's why this trick works.\n      //\n      // I am sorry that you have to see this.\n      return $1 + $1 + $2 + '|'\n    })\n\n    this.debug('tail=%j\\n   %s', tail, tail, pl, re)\n    var t = pl.type === '*' ? star\n      : pl.type === '?' ? qmark\n      : '\\\\' + pl.type\n\n    hasMagic = true\n    re = re.slice(0, pl.reStart) + t + '\\\\(' + tail\n  }\n\n  // handle trailing things that only matter at the very end.\n  clearStateChar()\n  if (escaping) {\n    // trailing \\\\\n    re += '\\\\\\\\'\n  }\n\n  // only need to apply the nodot start if the re starts with\n  // something that could conceivably capture a dot\n  var addPatternStart = false\n  switch (re.charAt(0)) {\n    case '.':\n    case '[':\n    case '(': addPatternStart = true\n  }\n\n  // Hack to work around lack of negative lookbehind in JS\n  // A pattern like: *.!(x).!(y|z) needs to ensure that a name\n  // like 'a.xyz.yz' doesn't match.  So, the first negative\n  // lookahead, has to look ALL the way ahead, to the end of\n  // the pattern.\n  for (var n = negativeLists.length - 1; n > -1; n--) {\n    var nl = negativeLists[n]\n\n    var nlBefore = re.slice(0, nl.reStart)\n    var nlFirst = re.slice(nl.reStart, nl.reEnd - 8)\n    var nlLast = re.slice(nl.reEnd - 8, nl.reEnd)\n    var nlAfter = re.slice(nl.reEnd)\n\n    nlLast += nlAfter\n\n    // Handle nested stuff like *(*.js|!(*.json)), where open parens\n    // mean that we should *not* include the ) in the bit that is considered\n    // \"after\" the negated section.\n    var openParensBefore = nlBefore.split('(').length - 1\n    var cleanAfter = nlAfter\n    for (i = 0; i < openParensBefore; i++) {\n      cleanAfter = cleanAfter.replace(/\\)[+*?]?/, '')\n    }\n    nlAfter = cleanAfter\n\n    var dollar = ''\n    if (nlAfter === '' && isSub !== SUBPARSE) {\n      dollar = '$'\n    }\n    var newRe = nlBefore + nlFirst + nlAfter + dollar + nlLast\n    re = newRe\n  }\n\n  // if the re is not \"\" at this point, then we need to make sure\n  // it doesn't match against an empty path part.\n  // Otherwise a/* will match a/, which it should not.\n  if (re !== '' && hasMagic) {\n    re = '(?=.)' + re\n  }\n\n  if (addPatternStart) {\n    re = patternStart + re\n  }\n\n  // parsing just a piece of a larger pattern.\n  if (isSub === SUBPARSE) {\n    return [re, hasMagic]\n  }\n\n  // skip the regexp for non-magical patterns\n  // unescape anything in it, though, so that it'll be\n  // an exact match against a file etc.\n  if (!hasMagic) {\n    return globUnescape(pattern)\n  }\n\n  var flags = options.nocase ? 'i' : ''\n  try {\n    var regExp = new RegExp('^' + re + '$', flags)\n  } catch (er) {\n    // If it was an invalid regular expression, then it can't match\n    // anything.  This trick looks for a character after the end of\n    // the string, which is of course impossible, except in multi-line\n    // mode, but it's not a /m regex.\n    return new RegExp('$.')\n  }\n\n  regExp._glob = pattern\n  regExp._src = re\n\n  return regExp\n}\n\nminimatch.makeRe = function (pattern, options) {\n  return new Minimatch(pattern, options || {}).makeRe()\n}\n\nMinimatch.prototype.makeRe = makeRe\nfunction makeRe () {\n  if (this.regexp || this.regexp === false) return this.regexp\n\n  // at this point, this.set is a 2d array of partial\n  // pattern strings, or \"**\".\n  //\n  // It's better to use .match().  This function shouldn't\n  // be used, really, but it's pretty convenient sometimes,\n  // when you just want to work with a regex.\n  var set = this.set\n\n  if (!set.length) {\n    this.regexp = false\n    return this.regexp\n  }\n  var options = this.options\n\n  var twoStar = options.noglobstar ? star\n    : options.dot ? twoStarDot\n    : twoStarNoDot\n  var flags = options.nocase ? 'i' : ''\n\n  var re = set.map(function (pattern) {\n    return pattern.map(function (p) {\n      return (p === GLOBSTAR) ? twoStar\n      : (typeof p === 'string') ? regExpEscape(p)\n      : p._src\n    }).join('\\\\\\/')\n  }).join('|')\n\n  // must match entire pattern\n  // ending in a * or ** will make it less strict.\n  re = '^(?:' + re + ')$'\n\n  // can match anything, as long as it's not this.\n  if (this.negate) re = '^(?!' + re + ').*$'\n\n  try {\n    this.regexp = new RegExp(re, flags)\n  } catch (ex) {\n    this.regexp = false\n  }\n  return this.regexp\n}\n\nminimatch.match = function (list, pattern, options) {\n  options = options || {}\n  var mm = new Minimatch(pattern, options)\n  list = list.filter(function (f) {\n    return mm.match(f)\n  })\n  if (mm.options.nonull && !list.length) {\n    list.push(pattern)\n  }\n  return list\n}\n\nMinimatch.prototype.match = match\nfunction match (f, partial) {\n  this.debug('match', f, this.pattern)\n  // short-circuit in the case of busted things.\n  // comments, etc.\n  if (this.comment) return false\n  if (this.empty) return f === ''\n\n  if (f === '/' && partial) return true\n\n  var options = this.options\n\n  // windows: need to use /, not \\\n  if (path.sep !== '/') {\n    f = f.split(path.sep).join('/')\n  }\n\n  // treat the test path as a set of pathparts.\n  f = f.split(slashSplit)\n  this.debug(this.pattern, 'split', f)\n\n  // just ONE of the pattern sets in this.set needs to match\n  // in order for it to be valid.  If negating, then just one\n  // match means that we have failed.\n  // Either way, return on the first hit.\n\n  var set = this.set\n  this.debug(this.pattern, 'set', set)\n\n  // Find the basename of the path by looking for the last non-empty segment\n  var filename\n  var i\n  for (i = f.length - 1; i >= 0; i--) {\n    filename = f[i]\n    if (filename) break\n  }\n\n  for (i = 0; i < set.length; i++) {\n    var pattern = set[i]\n    var file = f\n    if (options.matchBase && pattern.length === 1) {\n      file = [filename]\n    }\n    var hit = this.matchOne(file, pattern, partial)\n    if (hit) {\n      if (options.flipNegate) return true\n      return !this.negate\n    }\n  }\n\n  // didn't get any hits.  this is success if it's a negative\n  // pattern, failure otherwise.\n  if (options.flipNegate) return false\n  return this.negate\n}\n\n// set partial to true to test if, for example,\n// \"/a/b\" matches the start of \"/*/b/*/d\"\n// Partial means, if you run out of file before you run\n// out of pattern, then that's fine, as long as all\n// the parts match.\nMinimatch.prototype.matchOne = function (file, pattern, partial) {\n  var options = this.options\n\n  this.debug('matchOne',\n    { 'this': this, file: file, pattern: pattern })\n\n  this.debug('matchOne', file.length, pattern.length)\n\n  for (var fi = 0,\n      pi = 0,\n      fl = file.length,\n      pl = pattern.length\n      ; (fi < fl) && (pi < pl)\n      ; fi++, pi++) {\n    this.debug('matchOne loop')\n    var p = pattern[pi]\n    var f = file[fi]\n\n    this.debug(pattern, p, f)\n\n    // should be impossible.\n    // some invalid regexp stuff in the set.\n    if (p === false) return false\n\n    if (p === GLOBSTAR) {\n      this.debug('GLOBSTAR', [pattern, p, f])\n\n      // \"**\"\n      // a/**/b/**/c would match the following:\n      // a/b/x/y/z/c\n      // a/x/y/z/b/c\n      // a/b/x/b/x/c\n      // a/b/c\n      // To do this, take the rest of the pattern after\n      // the **, and see if it would match the file remainder.\n      // If so, return success.\n      // If not, the ** \"swallows\" a segment, and try again.\n      // This is recursively awful.\n      //\n      // a/**/b/**/c matching a/b/x/y/z/c\n      // - a matches a\n      // - doublestar\n      //   - matchOne(b/x/y/z/c, b/**/c)\n      //     - b matches b\n      //     - doublestar\n      //       - matchOne(x/y/z/c, c) -> no\n      //       - matchOne(y/z/c, c) -> no\n      //       - matchOne(z/c, c) -> no\n      //       - matchOne(c, c) yes, hit\n      var fr = fi\n      var pr = pi + 1\n      if (pr === pl) {\n        this.debug('** at the end')\n        // a ** at the end will just swallow the rest.\n        // We have found a match.\n        // however, it will not swallow /.x, unless\n        // options.dot is set.\n        // . and .. are *never* matched by **, for explosively\n        // exponential reasons.\n        for (; fi < fl; fi++) {\n          if (file[fi] === '.' || file[fi] === '..' ||\n            (!options.dot && file[fi].charAt(0) === '.')) return false\n        }\n        return true\n      }\n\n      // ok, let's see if we can swallow whatever we can.\n      while (fr < fl) {\n        var swallowee = file[fr]\n\n        this.debug('\\nglobstar while', file, fr, pattern, pr, swallowee)\n\n        // XXX remove this slice.  Just pass the start index.\n        if (this.matchOne(file.slice(fr), pattern.slice(pr), partial)) {\n          this.debug('globstar found match!', fr, fl, swallowee)\n          // found a match.\n          return true\n        } else {\n          // can't swallow \".\" or \"..\" ever.\n          // can only swallow \".foo\" when explicitly asked.\n          if (swallowee === '.' || swallowee === '..' ||\n            (!options.dot && swallowee.charAt(0) === '.')) {\n            this.debug('dot detected!', file, fr, pattern, pr)\n            break\n          }\n\n          // ** swallows a segment, and continue.\n          this.debug('globstar swallow a segment, and continue')\n          fr++\n        }\n      }\n\n      // no match was found.\n      // However, in partial mode, we can't say this is necessarily over.\n      // If there's more *pattern* left, then\n      if (partial) {\n        // ran out of file\n        this.debug('\\n>>> no match, partial?', file, fr, pattern, pr)\n        if (fr === fl) return true\n      }\n      return false\n    }\n\n    // something other than **\n    // non-magic patterns just have to match exactly\n    // patterns with magic have been turned into regexps.\n    var hit\n    if (typeof p === 'string') {\n      if (options.nocase) {\n        hit = f.toLowerCase() === p.toLowerCase()\n      } else {\n        hit = f === p\n      }\n      this.debug('string match', p, f, hit)\n    } else {\n      hit = f.match(p)\n      this.debug('pattern match', p, f, hit)\n    }\n\n    if (!hit) return false\n  }\n\n  // Note: ending in / means that we'll get a final \"\"\n  // at the end of the pattern.  This can only match a\n  // corresponding \"\" at the end of the file.\n  // If the file ends in /, then it can only match a\n  // a pattern that ends in /, unless the pattern just\n  // doesn't have any more for it. But, a/b/ should *not*\n  // match \"a/b/*\", even though \"\" matches against the\n  // [^/]*? pattern, except in partial mode, where it might\n  // simply not be reached yet.\n  // However, a/b/ should still satisfy a/*\n\n  // now either we fell off the end of the pattern, or we're done.\n  if (fi === fl && pi === pl) {\n    // ran out of pattern and filename at the same time.\n    // an exact hit!\n    return true\n  } else if (fi === fl) {\n    // ran out of file, but still had pattern left.\n    // this is ok if we're doing the match as part of\n    // a glob fs traversal.\n    return partial\n  } else if (pi === pl) {\n    // ran out of pattern, still have file left.\n    // this is only acceptable if we're on the very last\n    // empty segment of a file with a trailing slash.\n    // a/* should match a/b/\n    var emptyFileEnd = (fi === fl - 1) && (file[fi] === '')\n    return emptyFileEnd\n  }\n\n  // should be unreachable.\n  throw new Error('wtf?')\n}\n\n// replace stuff like \\* with *\nfunction globUnescape (s) {\n  return s.replace(/\\\\(.)/g, '$1')\n}\n\nfunction regExpEscape (s) {\n  return s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n}\n\n\n//# sourceURL=webpack://@abaplint/cli/./node_modules/minimatch/minimatch.js?");
+eval("module.exports = minimatch\nminimatch.Minimatch = Minimatch\n\nvar path = (function () { try { return __webpack_require__(/*! path */ \"path\") } catch (e) {}}()) || {\n  sep: '/'\n}\nminimatch.sep = path.sep\n\nvar GLOBSTAR = minimatch.GLOBSTAR = Minimatch.GLOBSTAR = {}\nvar expand = __webpack_require__(/*! brace-expansion */ \"./node_modules/brace-expansion/index.js\")\n\nvar plTypes = {\n  '!': { open: '(?:(?!(?:', close: '))[^/]*?)'},\n  '?': { open: '(?:', close: ')?' },\n  '+': { open: '(?:', close: ')+' },\n  '*': { open: '(?:', close: ')*' },\n  '@': { open: '(?:', close: ')' }\n}\n\n// any single thing other than /\n// don't need to escape / when using new RegExp()\nvar qmark = '[^/]'\n\n// * => any number of characters\nvar star = qmark + '*?'\n\n// ** when dots are allowed.  Anything goes, except .. and .\n// not (^ or / followed by one or two dots followed by $ or /),\n// followed by anything, any number of times.\nvar twoStarDot = '(?:(?!(?:\\\\\\/|^)(?:\\\\.{1,2})($|\\\\\\/)).)*?'\n\n// not a ^ or / followed by a dot,\n// followed by anything, any number of times.\nvar twoStarNoDot = '(?:(?!(?:\\\\\\/|^)\\\\.).)*?'\n\n// characters that need to be escaped in RegExp.\nvar reSpecials = charSet('().*{}+?[]^$\\\\!')\n\n// \"abc\" -> { a:true, b:true, c:true }\nfunction charSet (s) {\n  return s.split('').reduce(function (set, c) {\n    set[c] = true\n    return set\n  }, {})\n}\n\n// normalizes slashes.\nvar slashSplit = /\\/+/\n\nminimatch.filter = filter\nfunction filter (pattern, options) {\n  options = options || {}\n  return function (p, i, list) {\n    return minimatch(p, pattern, options)\n  }\n}\n\nfunction ext (a, b) {\n  b = b || {}\n  var t = {}\n  Object.keys(a).forEach(function (k) {\n    t[k] = a[k]\n  })\n  Object.keys(b).forEach(function (k) {\n    t[k] = b[k]\n  })\n  return t\n}\n\nminimatch.defaults = function (def) {\n  if (!def || typeof def !== 'object' || !Object.keys(def).length) {\n    return minimatch\n  }\n\n  var orig = minimatch\n\n  var m = function minimatch (p, pattern, options) {\n    return orig(p, pattern, ext(def, options))\n  }\n\n  m.Minimatch = function Minimatch (pattern, options) {\n    return new orig.Minimatch(pattern, ext(def, options))\n  }\n  m.Minimatch.defaults = function defaults (options) {\n    return orig.defaults(ext(def, options)).Minimatch\n  }\n\n  m.filter = function filter (pattern, options) {\n    return orig.filter(pattern, ext(def, options))\n  }\n\n  m.defaults = function defaults (options) {\n    return orig.defaults(ext(def, options))\n  }\n\n  m.makeRe = function makeRe (pattern, options) {\n    return orig.makeRe(pattern, ext(def, options))\n  }\n\n  m.braceExpand = function braceExpand (pattern, options) {\n    return orig.braceExpand(pattern, ext(def, options))\n  }\n\n  m.match = function (list, pattern, options) {\n    return orig.match(list, pattern, ext(def, options))\n  }\n\n  return m\n}\n\nMinimatch.defaults = function (def) {\n  return minimatch.defaults(def).Minimatch\n}\n\nfunction minimatch (p, pattern, options) {\n  assertValidPattern(pattern)\n\n  if (!options) options = {}\n\n  // shortcut: comments match nothing.\n  if (!options.nocomment && pattern.charAt(0) === '#') {\n    return false\n  }\n\n  return new Minimatch(pattern, options).match(p)\n}\n\nfunction Minimatch (pattern, options) {\n  if (!(this instanceof Minimatch)) {\n    return new Minimatch(pattern, options)\n  }\n\n  assertValidPattern(pattern)\n\n  if (!options) options = {}\n\n  pattern = pattern.trim()\n\n  // windows support: need to use /, not \\\n  if (!options.allowWindowsEscape && path.sep !== '/') {\n    pattern = pattern.split(path.sep).join('/')\n  }\n\n  this.options = options\n  this.set = []\n  this.pattern = pattern\n  this.regexp = null\n  this.negate = false\n  this.comment = false\n  this.empty = false\n  this.partial = !!options.partial\n\n  // make the set of regexps etc.\n  this.make()\n}\n\nMinimatch.prototype.debug = function () {}\n\nMinimatch.prototype.make = make\nfunction make () {\n  var pattern = this.pattern\n  var options = this.options\n\n  // empty patterns and comments match nothing.\n  if (!options.nocomment && pattern.charAt(0) === '#') {\n    this.comment = true\n    return\n  }\n  if (!pattern) {\n    this.empty = true\n    return\n  }\n\n  // step 1: figure out negation, etc.\n  this.parseNegate()\n\n  // step 2: expand braces\n  var set = this.globSet = this.braceExpand()\n\n  if (options.debug) this.debug = function debug() { console.error.apply(console, arguments) }\n\n  this.debug(this.pattern, set)\n\n  // step 3: now we have a set, so turn each one into a series of path-portion\n  // matching patterns.\n  // These will be regexps, except in the case of \"**\", which is\n  // set to the GLOBSTAR object for globstar behavior,\n  // and will not contain any / characters\n  set = this.globParts = set.map(function (s) {\n    return s.split(slashSplit)\n  })\n\n  this.debug(this.pattern, set)\n\n  // glob --> regexps\n  set = set.map(function (s, si, set) {\n    return s.map(this.parse, this)\n  }, this)\n\n  this.debug(this.pattern, set)\n\n  // filter out everything that didn't compile properly.\n  set = set.filter(function (s) {\n    return s.indexOf(false) === -1\n  })\n\n  this.debug(this.pattern, set)\n\n  this.set = set\n}\n\nMinimatch.prototype.parseNegate = parseNegate\nfunction parseNegate () {\n  var pattern = this.pattern\n  var negate = false\n  var options = this.options\n  var negateOffset = 0\n\n  if (options.nonegate) return\n\n  for (var i = 0, l = pattern.length\n    ; i < l && pattern.charAt(i) === '!'\n    ; i++) {\n    negate = !negate\n    negateOffset++\n  }\n\n  if (negateOffset) this.pattern = pattern.substr(negateOffset)\n  this.negate = negate\n}\n\n// Brace expansion:\n// a{b,c}d -> abd acd\n// a{b,}c -> abc ac\n// a{0..3}d -> a0d a1d a2d a3d\n// a{b,c{d,e}f}g -> abg acdfg acefg\n// a{b,c}d{e,f}g -> abdeg acdeg abdeg abdfg\n//\n// Invalid sets are not expanded.\n// a{2..}b -> a{2..}b\n// a{b}c -> a{b}c\nminimatch.braceExpand = function (pattern, options) {\n  return braceExpand(pattern, options)\n}\n\nMinimatch.prototype.braceExpand = braceExpand\n\nfunction braceExpand (pattern, options) {\n  if (!options) {\n    if (this instanceof Minimatch) {\n      options = this.options\n    } else {\n      options = {}\n    }\n  }\n\n  pattern = typeof pattern === 'undefined'\n    ? this.pattern : pattern\n\n  assertValidPattern(pattern)\n\n  // Thanks to Yeting Li <https://github.com/yetingli> for\n  // improving this regexp to avoid a ReDOS vulnerability.\n  if (options.nobrace || !/\\{(?:(?!\\{).)*\\}/.test(pattern)) {\n    // shortcut. no need to expand.\n    return [pattern]\n  }\n\n  return expand(pattern)\n}\n\nvar MAX_PATTERN_LENGTH = 1024 * 64\nvar assertValidPattern = function (pattern) {\n  if (typeof pattern !== 'string') {\n    throw new TypeError('invalid pattern')\n  }\n\n  if (pattern.length > MAX_PATTERN_LENGTH) {\n    throw new TypeError('pattern is too long')\n  }\n}\n\n// parse a component of the expanded set.\n// At this point, no pattern may contain \"/\" in it\n// so we're going to return a 2d array, where each entry is the full\n// pattern, split on '/', and then turned into a regular expression.\n// A regexp is made at the end which joins each array with an\n// escaped /, and another full one which joins each regexp with |.\n//\n// Following the lead of Bash 4.1, note that \"**\" only has special meaning\n// when it is the *only* thing in a path portion.  Otherwise, any series\n// of * is equivalent to a single *.  Globstar behavior is enabled by\n// default, and can be disabled by setting options.noglobstar.\nMinimatch.prototype.parse = parse\nvar SUBPARSE = {}\nfunction parse (pattern, isSub) {\n  assertValidPattern(pattern)\n\n  var options = this.options\n\n  // shortcuts\n  if (pattern === '**') {\n    if (!options.noglobstar)\n      return GLOBSTAR\n    else\n      pattern = '*'\n  }\n  if (pattern === '') return ''\n\n  var re = ''\n  var hasMagic = !!options.nocase\n  var escaping = false\n  // ? => one single character\n  var patternListStack = []\n  var negativeLists = []\n  var stateChar\n  var inClass = false\n  var reClassStart = -1\n  var classStart = -1\n  // . and .. never match anything that doesn't start with .,\n  // even when options.dot is set.\n  var patternStart = pattern.charAt(0) === '.' ? '' // anything\n  // not (start or / followed by . or .. followed by / or end)\n  : options.dot ? '(?!(?:^|\\\\\\/)\\\\.{1,2}(?:$|\\\\\\/))'\n  : '(?!\\\\.)'\n  var self = this\n\n  function clearStateChar () {\n    if (stateChar) {\n      // we had some state-tracking character\n      // that wasn't consumed by this pass.\n      switch (stateChar) {\n        case '*':\n          re += star\n          hasMagic = true\n        break\n        case '?':\n          re += qmark\n          hasMagic = true\n        break\n        default:\n          re += '\\\\' + stateChar\n        break\n      }\n      self.debug('clearStateChar %j %j', stateChar, re)\n      stateChar = false\n    }\n  }\n\n  for (var i = 0, len = pattern.length, c\n    ; (i < len) && (c = pattern.charAt(i))\n    ; i++) {\n    this.debug('%s\\t%s %s %j', pattern, i, re, c)\n\n    // skip over any that are escaped.\n    if (escaping && reSpecials[c]) {\n      re += '\\\\' + c\n      escaping = false\n      continue\n    }\n\n    switch (c) {\n      /* istanbul ignore next */\n      case '/': {\n        // completely not allowed, even escaped.\n        // Should already be path-split by now.\n        return false\n      }\n\n      case '\\\\':\n        clearStateChar()\n        escaping = true\n      continue\n\n      // the various stateChar values\n      // for the \"extglob\" stuff.\n      case '?':\n      case '*':\n      case '+':\n      case '@':\n      case '!':\n        this.debug('%s\\t%s %s %j <-- stateChar', pattern, i, re, c)\n\n        // all of those are literals inside a class, except that\n        // the glob [!a] means [^a] in regexp\n        if (inClass) {\n          this.debug('  in class')\n          if (c === '!' && i === classStart + 1) c = '^'\n          re += c\n          continue\n        }\n\n        // if we already have a stateChar, then it means\n        // that there was something like ** or +? in there.\n        // Handle the stateChar, then proceed with this one.\n        self.debug('call clearStateChar %j', stateChar)\n        clearStateChar()\n        stateChar = c\n        // if extglob is disabled, then +(asdf|foo) isn't a thing.\n        // just clear the statechar *now*, rather than even diving into\n        // the patternList stuff.\n        if (options.noext) clearStateChar()\n      continue\n\n      case '(':\n        if (inClass) {\n          re += '('\n          continue\n        }\n\n        if (!stateChar) {\n          re += '\\\\('\n          continue\n        }\n\n        patternListStack.push({\n          type: stateChar,\n          start: i - 1,\n          reStart: re.length,\n          open: plTypes[stateChar].open,\n          close: plTypes[stateChar].close\n        })\n        // negation is (?:(?!js)[^/]*)\n        re += stateChar === '!' ? '(?:(?!(?:' : '(?:'\n        this.debug('plType %j %j', stateChar, re)\n        stateChar = false\n      continue\n\n      case ')':\n        if (inClass || !patternListStack.length) {\n          re += '\\\\)'\n          continue\n        }\n\n        clearStateChar()\n        hasMagic = true\n        var pl = patternListStack.pop()\n        // negation is (?:(?!js)[^/]*)\n        // The others are (?:<pattern>)<type>\n        re += pl.close\n        if (pl.type === '!') {\n          negativeLists.push(pl)\n        }\n        pl.reEnd = re.length\n      continue\n\n      case '|':\n        if (inClass || !patternListStack.length || escaping) {\n          re += '\\\\|'\n          escaping = false\n          continue\n        }\n\n        clearStateChar()\n        re += '|'\n      continue\n\n      // these are mostly the same in regexp and glob\n      case '[':\n        // swallow any state-tracking char before the [\n        clearStateChar()\n\n        if (inClass) {\n          re += '\\\\' + c\n          continue\n        }\n\n        inClass = true\n        classStart = i\n        reClassStart = re.length\n        re += c\n      continue\n\n      case ']':\n        //  a right bracket shall lose its special\n        //  meaning and represent itself in\n        //  a bracket expression if it occurs\n        //  first in the list.  -- POSIX.2 2.8.3.2\n        if (i === classStart + 1 || !inClass) {\n          re += '\\\\' + c\n          escaping = false\n          continue\n        }\n\n        // handle the case where we left a class open.\n        // \"[z-a]\" is valid, equivalent to \"\\[z-a\\]\"\n        // split where the last [ was, make sure we don't have\n        // an invalid re. if so, re-walk the contents of the\n        // would-be class to re-translate any characters that\n        // were passed through as-is\n        // TODO: It would probably be faster to determine this\n        // without a try/catch and a new RegExp, but it's tricky\n        // to do safely.  For now, this is safe and works.\n        var cs = pattern.substring(classStart + 1, i)\n        try {\n          RegExp('[' + cs + ']')\n        } catch (er) {\n          // not a valid class!\n          var sp = this.parse(cs, SUBPARSE)\n          re = re.substr(0, reClassStart) + '\\\\[' + sp[0] + '\\\\]'\n          hasMagic = hasMagic || sp[1]\n          inClass = false\n          continue\n        }\n\n        // finish up the class.\n        hasMagic = true\n        inClass = false\n        re += c\n      continue\n\n      default:\n        // swallow any state char that wasn't consumed\n        clearStateChar()\n\n        if (escaping) {\n          // no need\n          escaping = false\n        } else if (reSpecials[c]\n          && !(c === '^' && inClass)) {\n          re += '\\\\'\n        }\n\n        re += c\n\n    } // switch\n  } // for\n\n  // handle the case where we left a class open.\n  // \"[abc\" is valid, equivalent to \"\\[abc\"\n  if (inClass) {\n    // split where the last [ was, and escape it\n    // this is a huge pita.  We now have to re-walk\n    // the contents of the would-be class to re-translate\n    // any characters that were passed through as-is\n    cs = pattern.substr(classStart + 1)\n    sp = this.parse(cs, SUBPARSE)\n    re = re.substr(0, reClassStart) + '\\\\[' + sp[0]\n    hasMagic = hasMagic || sp[1]\n  }\n\n  // handle the case where we had a +( thing at the *end*\n  // of the pattern.\n  // each pattern list stack adds 3 chars, and we need to go through\n  // and escape any | chars that were passed through as-is for the regexp.\n  // Go through and escape them, taking care not to double-escape any\n  // | chars that were already escaped.\n  for (pl = patternListStack.pop(); pl; pl = patternListStack.pop()) {\n    var tail = re.slice(pl.reStart + pl.open.length)\n    this.debug('setting tail', re, pl)\n    // maybe some even number of \\, then maybe 1 \\, followed by a |\n    tail = tail.replace(/((?:\\\\{2}){0,64})(\\\\?)\\|/g, function (_, $1, $2) {\n      if (!$2) {\n        // the | isn't already escaped, so escape it.\n        $2 = '\\\\'\n      }\n\n      // need to escape all those slashes *again*, without escaping the\n      // one that we need for escaping the | character.  As it works out,\n      // escaping an even number of slashes can be done by simply repeating\n      // it exactly after itself.  That's why this trick works.\n      //\n      // I am sorry that you have to see this.\n      return $1 + $1 + $2 + '|'\n    })\n\n    this.debug('tail=%j\\n   %s', tail, tail, pl, re)\n    var t = pl.type === '*' ? star\n      : pl.type === '?' ? qmark\n      : '\\\\' + pl.type\n\n    hasMagic = true\n    re = re.slice(0, pl.reStart) + t + '\\\\(' + tail\n  }\n\n  // handle trailing things that only matter at the very end.\n  clearStateChar()\n  if (escaping) {\n    // trailing \\\\\n    re += '\\\\\\\\'\n  }\n\n  // only need to apply the nodot start if the re starts with\n  // something that could conceivably capture a dot\n  var addPatternStart = false\n  switch (re.charAt(0)) {\n    case '[': case '.': case '(': addPatternStart = true\n  }\n\n  // Hack to work around lack of negative lookbehind in JS\n  // A pattern like: *.!(x).!(y|z) needs to ensure that a name\n  // like 'a.xyz.yz' doesn't match.  So, the first negative\n  // lookahead, has to look ALL the way ahead, to the end of\n  // the pattern.\n  for (var n = negativeLists.length - 1; n > -1; n--) {\n    var nl = negativeLists[n]\n\n    var nlBefore = re.slice(0, nl.reStart)\n    var nlFirst = re.slice(nl.reStart, nl.reEnd - 8)\n    var nlLast = re.slice(nl.reEnd - 8, nl.reEnd)\n    var nlAfter = re.slice(nl.reEnd)\n\n    nlLast += nlAfter\n\n    // Handle nested stuff like *(*.js|!(*.json)), where open parens\n    // mean that we should *not* include the ) in the bit that is considered\n    // \"after\" the negated section.\n    var openParensBefore = nlBefore.split('(').length - 1\n    var cleanAfter = nlAfter\n    for (i = 0; i < openParensBefore; i++) {\n      cleanAfter = cleanAfter.replace(/\\)[+*?]?/, '')\n    }\n    nlAfter = cleanAfter\n\n    var dollar = ''\n    if (nlAfter === '' && isSub !== SUBPARSE) {\n      dollar = '$'\n    }\n    var newRe = nlBefore + nlFirst + nlAfter + dollar + nlLast\n    re = newRe\n  }\n\n  // if the re is not \"\" at this point, then we need to make sure\n  // it doesn't match against an empty path part.\n  // Otherwise a/* will match a/, which it should not.\n  if (re !== '' && hasMagic) {\n    re = '(?=.)' + re\n  }\n\n  if (addPatternStart) {\n    re = patternStart + re\n  }\n\n  // parsing just a piece of a larger pattern.\n  if (isSub === SUBPARSE) {\n    return [re, hasMagic]\n  }\n\n  // skip the regexp for non-magical patterns\n  // unescape anything in it, though, so that it'll be\n  // an exact match against a file etc.\n  if (!hasMagic) {\n    return globUnescape(pattern)\n  }\n\n  var flags = options.nocase ? 'i' : ''\n  try {\n    var regExp = new RegExp('^' + re + '$', flags)\n  } catch (er) /* istanbul ignore next - should be impossible */ {\n    // If it was an invalid regular expression, then it can't match\n    // anything.  This trick looks for a character after the end of\n    // the string, which is of course impossible, except in multi-line\n    // mode, but it's not a /m regex.\n    return new RegExp('$.')\n  }\n\n  regExp._glob = pattern\n  regExp._src = re\n\n  return regExp\n}\n\nminimatch.makeRe = function (pattern, options) {\n  return new Minimatch(pattern, options || {}).makeRe()\n}\n\nMinimatch.prototype.makeRe = makeRe\nfunction makeRe () {\n  if (this.regexp || this.regexp === false) return this.regexp\n\n  // at this point, this.set is a 2d array of partial\n  // pattern strings, or \"**\".\n  //\n  // It's better to use .match().  This function shouldn't\n  // be used, really, but it's pretty convenient sometimes,\n  // when you just want to work with a regex.\n  var set = this.set\n\n  if (!set.length) {\n    this.regexp = false\n    return this.regexp\n  }\n  var options = this.options\n\n  var twoStar = options.noglobstar ? star\n    : options.dot ? twoStarDot\n    : twoStarNoDot\n  var flags = options.nocase ? 'i' : ''\n\n  var re = set.map(function (pattern) {\n    return pattern.map(function (p) {\n      return (p === GLOBSTAR) ? twoStar\n      : (typeof p === 'string') ? regExpEscape(p)\n      : p._src\n    }).join('\\\\\\/')\n  }).join('|')\n\n  // must match entire pattern\n  // ending in a * or ** will make it less strict.\n  re = '^(?:' + re + ')$'\n\n  // can match anything, as long as it's not this.\n  if (this.negate) re = '^(?!' + re + ').*$'\n\n  try {\n    this.regexp = new RegExp(re, flags)\n  } catch (ex) /* istanbul ignore next - should be impossible */ {\n    this.regexp = false\n  }\n  return this.regexp\n}\n\nminimatch.match = function (list, pattern, options) {\n  options = options || {}\n  var mm = new Minimatch(pattern, options)\n  list = list.filter(function (f) {\n    return mm.match(f)\n  })\n  if (mm.options.nonull && !list.length) {\n    list.push(pattern)\n  }\n  return list\n}\n\nMinimatch.prototype.match = function match (f, partial) {\n  if (typeof partial === 'undefined') partial = this.partial\n  this.debug('match', f, this.pattern)\n  // short-circuit in the case of busted things.\n  // comments, etc.\n  if (this.comment) return false\n  if (this.empty) return f === ''\n\n  if (f === '/' && partial) return true\n\n  var options = this.options\n\n  // windows: need to use /, not \\\n  if (path.sep !== '/') {\n    f = f.split(path.sep).join('/')\n  }\n\n  // treat the test path as a set of pathparts.\n  f = f.split(slashSplit)\n  this.debug(this.pattern, 'split', f)\n\n  // just ONE of the pattern sets in this.set needs to match\n  // in order for it to be valid.  If negating, then just one\n  // match means that we have failed.\n  // Either way, return on the first hit.\n\n  var set = this.set\n  this.debug(this.pattern, 'set', set)\n\n  // Find the basename of the path by looking for the last non-empty segment\n  var filename\n  var i\n  for (i = f.length - 1; i >= 0; i--) {\n    filename = f[i]\n    if (filename) break\n  }\n\n  for (i = 0; i < set.length; i++) {\n    var pattern = set[i]\n    var file = f\n    if (options.matchBase && pattern.length === 1) {\n      file = [filename]\n    }\n    var hit = this.matchOne(file, pattern, partial)\n    if (hit) {\n      if (options.flipNegate) return true\n      return !this.negate\n    }\n  }\n\n  // didn't get any hits.  this is success if it's a negative\n  // pattern, failure otherwise.\n  if (options.flipNegate) return false\n  return this.negate\n}\n\n// set partial to true to test if, for example,\n// \"/a/b\" matches the start of \"/*/b/*/d\"\n// Partial means, if you run out of file before you run\n// out of pattern, then that's fine, as long as all\n// the parts match.\nMinimatch.prototype.matchOne = function (file, pattern, partial) {\n  var options = this.options\n\n  this.debug('matchOne',\n    { 'this': this, file: file, pattern: pattern })\n\n  this.debug('matchOne', file.length, pattern.length)\n\n  for (var fi = 0,\n      pi = 0,\n      fl = file.length,\n      pl = pattern.length\n      ; (fi < fl) && (pi < pl)\n      ; fi++, pi++) {\n    this.debug('matchOne loop')\n    var p = pattern[pi]\n    var f = file[fi]\n\n    this.debug(pattern, p, f)\n\n    // should be impossible.\n    // some invalid regexp stuff in the set.\n    /* istanbul ignore if */\n    if (p === false) return false\n\n    if (p === GLOBSTAR) {\n      this.debug('GLOBSTAR', [pattern, p, f])\n\n      // \"**\"\n      // a/**/b/**/c would match the following:\n      // a/b/x/y/z/c\n      // a/x/y/z/b/c\n      // a/b/x/b/x/c\n      // a/b/c\n      // To do this, take the rest of the pattern after\n      // the **, and see if it would match the file remainder.\n      // If so, return success.\n      // If not, the ** \"swallows\" a segment, and try again.\n      // This is recursively awful.\n      //\n      // a/**/b/**/c matching a/b/x/y/z/c\n      // - a matches a\n      // - doublestar\n      //   - matchOne(b/x/y/z/c, b/**/c)\n      //     - b matches b\n      //     - doublestar\n      //       - matchOne(x/y/z/c, c) -> no\n      //       - matchOne(y/z/c, c) -> no\n      //       - matchOne(z/c, c) -> no\n      //       - matchOne(c, c) yes, hit\n      var fr = fi\n      var pr = pi + 1\n      if (pr === pl) {\n        this.debug('** at the end')\n        // a ** at the end will just swallow the rest.\n        // We have found a match.\n        // however, it will not swallow /.x, unless\n        // options.dot is set.\n        // . and .. are *never* matched by **, for explosively\n        // exponential reasons.\n        for (; fi < fl; fi++) {\n          if (file[fi] === '.' || file[fi] === '..' ||\n            (!options.dot && file[fi].charAt(0) === '.')) return false\n        }\n        return true\n      }\n\n      // ok, let's see if we can swallow whatever we can.\n      while (fr < fl) {\n        var swallowee = file[fr]\n\n        this.debug('\\nglobstar while', file, fr, pattern, pr, swallowee)\n\n        // XXX remove this slice.  Just pass the start index.\n        if (this.matchOne(file.slice(fr), pattern.slice(pr), partial)) {\n          this.debug('globstar found match!', fr, fl, swallowee)\n          // found a match.\n          return true\n        } else {\n          // can't swallow \".\" or \"..\" ever.\n          // can only swallow \".foo\" when explicitly asked.\n          if (swallowee === '.' || swallowee === '..' ||\n            (!options.dot && swallowee.charAt(0) === '.')) {\n            this.debug('dot detected!', file, fr, pattern, pr)\n            break\n          }\n\n          // ** swallows a segment, and continue.\n          this.debug('globstar swallow a segment, and continue')\n          fr++\n        }\n      }\n\n      // no match was found.\n      // However, in partial mode, we can't say this is necessarily over.\n      // If there's more *pattern* left, then\n      /* istanbul ignore if */\n      if (partial) {\n        // ran out of file\n        this.debug('\\n>>> no match, partial?', file, fr, pattern, pr)\n        if (fr === fl) return true\n      }\n      return false\n    }\n\n    // something other than **\n    // non-magic patterns just have to match exactly\n    // patterns with magic have been turned into regexps.\n    var hit\n    if (typeof p === 'string') {\n      hit = f === p\n      this.debug('string match', p, f, hit)\n    } else {\n      hit = f.match(p)\n      this.debug('pattern match', p, f, hit)\n    }\n\n    if (!hit) return false\n  }\n\n  // Note: ending in / means that we'll get a final \"\"\n  // at the end of the pattern.  This can only match a\n  // corresponding \"\" at the end of the file.\n  // If the file ends in /, then it can only match a\n  // a pattern that ends in /, unless the pattern just\n  // doesn't have any more for it. But, a/b/ should *not*\n  // match \"a/b/*\", even though \"\" matches against the\n  // [^/]*? pattern, except in partial mode, where it might\n  // simply not be reached yet.\n  // However, a/b/ should still satisfy a/*\n\n  // now either we fell off the end of the pattern, or we're done.\n  if (fi === fl && pi === pl) {\n    // ran out of pattern and filename at the same time.\n    // an exact hit!\n    return true\n  } else if (fi === fl) {\n    // ran out of file, but still had pattern left.\n    // this is ok if we're doing the match as part of\n    // a glob fs traversal.\n    return partial\n  } else /* istanbul ignore else */ if (pi === pl) {\n    // ran out of pattern, still have file left.\n    // this is only acceptable if we're on the very last\n    // empty segment of a file with a trailing slash.\n    // a/* should match a/b/\n    return (fi === fl - 1) && (file[fi] === '')\n  }\n\n  // should be unreachable.\n  /* istanbul ignore next */\n  throw new Error('wtf?')\n}\n\n// replace stuff like \\* with *\nfunction globUnescape (s) {\n  return s.replace(/\\\\(.)/g, '$1')\n}\n\nfunction regExpEscape (s) {\n  return s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n}\n\n\n//# sourceURL=webpack://@abaplint/cli/./node_modules/minimatch/minimatch.js?");
 /***/ }),

package/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
     "name": "@abaplint/cli",
-    "version": "2.90.0",
+    "version": "2.90.1",
     "description": "abaplint - Command Line Interface",
     "bin": {
         "abaplint": "./abaplint"
@@ -39,7 +39,7 @@
     },
     "homepage": "https://abaplint.org",
     "devDependencies": {
-        "@abaplint/core": "^2.90.0",
+        "@abaplint/core": "^2.90.1",
         "@types/chai": "^4.3.1",
         "@types/glob": "^7.2.0",
         "@types/minimist": "^1.2.2",
@@ -48,7 +48,7 @@
         "@types/progress": "^2.0.5",
         "chai": "^4.3.6",
         "chalk": "^5.0.1",
-        "eslint": "^8.14.0",
+        "eslint": "^8.15.0",
         "glob": "^7.2.0",
         "json5": "^2.2.1",
         "memfs": "^3.4.1",