@loopstack/loopstack-studio 0.25.0 → 0.25.2

package/dist/node_modules/chevrotain/lib/src/scan/lexer.js

@@ -1,57 +1,34 @@
-import isFunction_default from "../../../../lodash-es/isFunction.js";
-import isArray_default from "../../../../lodash-es/isArray.js";
-import isEmpty_default from "../../../../lodash-es/isEmpty.js";
 import { BaseRegExpVisitor } from "../../../../@chevrotain/regexp-to-ast/lib/src/base-regexp-visitor.js";
 import "../../../../@chevrotain/regexp-to-ast/lib/src/api.js";
-import keys_default from "../../../../lodash-es/keys.js";
-import flatten_default from "../../../../lodash-es/flatten.js";
-import compact_default from "../../../../lodash-es/compact.js";
-import defaults_default from "../../../../lodash-es/defaults.js";
-import difference_default from "../../../../lodash-es/difference.js";
-import forEach_default from "../../../../lodash-es/forEach.js";
-import filter_default from "../../../../lodash-es/filter.js";
-import find_default from "../../../../lodash-es/find.js";
-import head_default from "../../../../lodash-es/head.js";
-import map_default from "../../../../lodash-es/map.js";
-import has_default from "../../../../lodash-es/has.js";
-import isString_default from "../../../../lodash-es/isString.js";
-import values_default from "../../../../lodash-es/values.js";
-import includes_default from "../../../../lodash-es/includes.js";
-import indexOf_default from "../../../../lodash-es/indexOf.js";
-import isRegExp_default from "../../../../lodash-es/isRegExp.js";
-import isUndefined_default from "../../../../lodash-es/isUndefined.js";
-import reduce_default from "../../../../lodash-es/reduce.js";
-import reject_default from "../../../../lodash-es/reject.js";
 import { PRINT_ERROR } from "../../../../@chevrotain/utils/lib/src/print.js";
 import { getRegExpAst } from "./reg_exp_parser.js";
 import { canMatchCharCode, failedOptimizationPrefixMsg, getOptimizedStartCodesIndices } from "./reg_exp.js";
 import { Lexer, LexerDefinitionErrorType } from "./lexer_public.js";
 var PATTERN = "PATTERN";
 const DEFAULT_MODE = "defaultMode";
-function analyzeTokenTypes(F, I) {
-	I = defaults_default(I, {
-		debug: !1,
+function analyzeTokenTypes(e, S) {
+	S = Object.assign({
 		safeMode: !1,
 		positionTracking: "full",
 		lineTerminatorCharacters: ["\r", "\n"],
-		tracer: (i, N) => N()
-	});
-	let L = I.tracer;
-	L("initCharCodeToOptimizedIndexMap", () => {
+		tracer: (e, x) => x()
+	}, S);
+	let D = S.tracer;
+	D("initCharCodeToOptimizedIndexMap", () => {
 		initCharCodeToOptimizedIndexMap();
 	});
-	let R;
-	L("Reject Lexer.NA", () => {
-		R = reject_default(F, (i) => i[PATTERN] === Lexer.NA);
+	let O;
+	D("Reject Lexer.NA", () => {
+		O = e.filter((e) => e[PATTERN] !== Lexer.NA);
 	});
-	let B = !1, V;
-	L("Transform Patterns", () => {
-		B = !1, V = map_default(R, (N) => {
-			let P = N[PATTERN];
+	let k = !1, A;
+	D("Transform Patterns", () => {
+		k = !1, A = O.map((e) => {
+			let x = e[PATTERN];
 			/* istanbul ignore else */
-			if (isRegExp_default(P)) {
-				let i = P.source;
-				return i.length === 1 && i !== "^" && i !== "$" && i !== "." && !P.ignoreCase ? i : i.length === 2 && i[0] === "\\" && !includes_default([
+			if (x instanceof RegExp) {
+				let e = x.source;
+				return e.length === 1 && e !== "^" && e !== "$" && e !== "." && !x.ignoreCase ? e : e.length === 2 && e[0] === "\\" && ![
 					"d",
 					"D",
 					"s",
@@ -68,256 +45,256 @@ function analyzeTokenTypes(F, I) {
 					"v",
 					"w",
 					"W"
-				], i[1]) ? i[1] : addStickyFlag(P);
-			} else if (isFunction_default(P)) return B = !0, { exec: P };
-			else if (typeof P == "object") return B = !0, P;
-			else if (typeof P == "string") {
-				if (P.length === 1) return P;
+				].includes(e[1]) ? e[1] : addStickyFlag(x);
+			} else if (typeof x == "function") return k = !0, { exec: x };
+			else if (typeof x == "object") return k = !0, x;
+			else if (typeof x == "string") {
+				if (x.length === 1) return x;
 				{
-					let i = P.replace(/[\\^$.*+?()[\]{}|]/g, "\\$&");
-					return addStickyFlag(new RegExp(i));
+					let e = x.replace(/[\\^$.*+?()[\]{}|]/g, "\\$&");
+					return addStickyFlag(new RegExp(e));
 				}
 			} else throw Error("non exhaustive match");
 		});
 	});
-	let H, U, W, G, K;
-	L("misc mapping", () => {
-		H = map_default(R, (i) => i.tokenTypeIdx), U = map_default(R, (i) => {
-			let N = i.GROUP;
-			if (N !== Lexer.SKIPPED) {
-				if (isString_default(N)) return N;
-				if (isUndefined_default(N)) return !1;
+	let j, M, N, P, F;
+	D("misc mapping", () => {
+		j = O.map((e) => e.tokenTypeIdx), M = O.map((e) => {
+			let x = e.GROUP;
+			if (x !== Lexer.SKIPPED) {
+				if (typeof x == "string") return x;
+				if (x === void 0) return !1;
 				throw Error("non exhaustive match");
 			}
-		}), W = map_default(R, (i) => {
-			let P = i.LONGER_ALT;
-			if (P) return isArray_default(P) ? map_default(P, (i) => indexOf_default(R, i)) : [indexOf_default(R, P)];
-		}), G = map_default(R, (i) => i.PUSH_MODE), K = map_default(R, (i) => has_default(i, "POP_MODE"));
+		}), N = O.map((e) => {
+			let x = e.LONGER_ALT;
+			if (x) return Array.isArray(x) ? x.map((e) => O.indexOf(e)) : [O.indexOf(x)];
+		}), P = O.map((e) => e.PUSH_MODE), F = O.map((e) => Object.hasOwn(e, "POP_MODE"));
 	});
-	let q;
-	L("Line Terminator Handling", () => {
-		let i = getCharCodes(I.lineTerminatorCharacters);
-		q = map_default(R, (i) => !1), I.positionTracking !== "onlyOffset" && (q = map_default(R, (N) => has_default(N, "LINE_BREAKS") ? !!N.LINE_BREAKS : checkLineBreaksIssues(N, i) === !1 && canMatchCharCode(i, N.PATTERN)));
+	let I;
+	D("Line Terminator Handling", () => {
+		let e = getCharCodes(S.lineTerminatorCharacters);
+		I = O.map((e) => !1), S.positionTracking !== "onlyOffset" && (I = O.map((x) => Object.hasOwn(x, "LINE_BREAKS") ? !!x.LINE_BREAKS : checkLineBreaksIssues(x, e) === !1 && canMatchCharCode(e, x.PATTERN)));
 	});
-	let J, Y, X, Z;
-	L("Misc Mapping #2", () => {
-		J = map_default(R, isCustomPattern), Y = map_default(V, isShortPattern), X = reduce_default(R, (i, N) => {
-			let P = N.GROUP;
-			return isString_default(P) && P !== Lexer.SKIPPED && (i[P] = []), i;
-		}, {}), Z = map_default(V, (i, N) => ({
-			pattern: V[N],
-			longerAlt: W[N],
-			canLineTerminator: q[N],
-			isCustom: J[N],
-			short: Y[N],
-			group: U[N],
-			push: G[N],
-			pop: K[N],
-			tokenTypeIdx: H[N],
-			tokenType: R[N]
+	let L, R, z, B;
+	D("Misc Mapping #2", () => {
+		L = O.map(isCustomPattern), R = A.map(isShortPattern), z = O.reduce((e, x) => {
+			let S = x.GROUP;
+			return typeof S == "string" && S !== Lexer.SKIPPED && (e[S] = []), e;
+		}, {}), B = A.map((e, x) => ({
+			pattern: A[x],
+			longerAlt: N[x],
+			canLineTerminator: I[x],
+			isCustom: L[x],
+			short: R[x],
+			group: M[x],
+			push: P[x],
+			pop: F[x],
+			tokenTypeIdx: j[x],
+			tokenType: O[x]
 		}));
 	});
-	let Q = !0, $ = [];
-	return I.safeMode || L("First Char Optimization", () => {
-		$ = reduce_default(R, (i, F, L) => {
-			if (typeof F.PATTERN == "string") addToMapOfArrays(i, charCodeToOptimizedIndex(F.PATTERN.charCodeAt(0)), Z[L]);
-			else if (isArray_default(F.START_CHARS_HINT)) {
-				let N;
-				forEach_default(F.START_CHARS_HINT, (P) => {
-					let F = charCodeToOptimizedIndex(typeof P == "string" ? P.charCodeAt(0) : P);
+	let V = !0, H = [];
+	return S.safeMode || D("First Char Optimization", () => {
+		H = O.reduce((e, C, E) => {
+			if (typeof C.PATTERN == "string") addToMapOfArrays(e, charCodeToOptimizedIndex(C.PATTERN.charCodeAt(0)), B[E]);
+			else if (Array.isArray(C.START_CHARS_HINT)) {
+				let x;
+				C.START_CHARS_HINT.forEach((S) => {
+					let C = charCodeToOptimizedIndex(typeof S == "string" ? S.charCodeAt(0) : S);
 					/* istanbul ignore else */
-					N !== F && (N = F, addToMapOfArrays(i, F, Z[L]));
+					x !== C && (x = C, addToMapOfArrays(e, C, B[E]));
 				});
-			} else if (isRegExp_default(F.PATTERN)) if (F.PATTERN.unicode) Q = !1, I.ensureOptimizations && PRINT_ERROR(`${failedOptimizationPrefixMsg}\tUnable to analyze < ${F.PATTERN.toString()} > pattern.\n	The regexp unicode flag is not currently supported by the regexp-to-ast library.
+			} else if (C.PATTERN instanceof RegExp) if (C.PATTERN.unicode) V = !1, S.ensureOptimizations && PRINT_ERROR(`${failedOptimizationPrefixMsg}\tUnable to analyze < ${C.PATTERN.toString()} > pattern.\n	The regexp unicode flag is not currently supported by the regexp-to-ast library.
 	This will disable the lexer's first char optimizations.
 	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNICODE_OPTIMIZE`);
 			else {
-				let N = getOptimizedStartCodesIndices(F.PATTERN, I.ensureOptimizations);
-				isEmpty_default(N) && (Q = !1), forEach_default(N, (N) => {
-					addToMapOfArrays(i, N, Z[L]);
+				let x = getOptimizedStartCodesIndices(C.PATTERN, S.ensureOptimizations);
+				x.length === 0 && (V = !1), x.forEach((x) => {
+					addToMapOfArrays(e, x, B[E]);
 				});
 			}
-			else I.ensureOptimizations && PRINT_ERROR(`${failedOptimizationPrefixMsg}\tTokenType: <${F.name}> is using a custom token pattern without providing <start_chars_hint> parameter.\n	This will disable the lexer's first char optimizations.
-	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_OPTIMIZE`), Q = !1;
-			return i;
+			else S.ensureOptimizations && PRINT_ERROR(`${failedOptimizationPrefixMsg}\tTokenType: <${C.name}> is using a custom token pattern without providing <start_chars_hint> parameter.\n	This will disable the lexer's first char optimizations.
+	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_OPTIMIZE`), V = !1;
+			return e;
 		}, []);
 	}), {
-		emptyGroups: X,
-		patternIdxToConfig: Z,
-		charCodeToPatternIdxToConfig: $,
-		hasCustom: B,
-		canBeOptimized: Q
+		emptyGroups: z,
+		patternIdxToConfig: B,
+		charCodeToPatternIdxToConfig: H,
+		hasCustom: k,
+		canBeOptimized: V
 	};
 }
-function validatePatterns(i, N) {
-	let P = [], F = findMissingPatterns(i);
-	P = P.concat(F.errors);
-	let I = findInvalidPatterns(F.valid), L = I.valid;
-	return P = P.concat(I.errors), P = P.concat(validateRegExpPattern(L)), P = P.concat(findInvalidGroupType(L)), P = P.concat(findModesThatDoNotExist(L, N)), P = P.concat(findUnreachablePatterns(L)), P;
+function validatePatterns(e, x) {
+	let S = [], C = findMissingPatterns(e);
+	S = S.concat(C.errors);
+	let w = findInvalidPatterns(C.valid), T = w.valid;
+	return S = S.concat(w.errors), S = S.concat(validateRegExpPattern(T)), S = S.concat(findInvalidGroupType(T)), S = S.concat(findModesThatDoNotExist(T, x)), S = S.concat(findUnreachablePatterns(T)), S;
 }
-function validateRegExpPattern(i) {
-	let N = [], P = filter_default(i, (i) => isRegExp_default(i[PATTERN]));
-	return N = N.concat(findEndOfInputAnchor(P)), N = N.concat(findStartOfInputAnchor(P)), N = N.concat(findUnsupportedFlags(P)), N = N.concat(findDuplicatePatterns(P)), N = N.concat(findEmptyMatchRegExps(P)), N;
+function validateRegExpPattern(e) {
+	let x = [], S = e.filter((e) => e[PATTERN] instanceof RegExp);
+	return x = x.concat(findEndOfInputAnchor(S)), x = x.concat(findStartOfInputAnchor(S)), x = x.concat(findUnsupportedFlags(S)), x = x.concat(findDuplicatePatterns(S)), x = x.concat(findEmptyMatchRegExps(S)), x;
 }
-function findMissingPatterns(i) {
-	let N = filter_default(i, (i) => !has_default(i, PATTERN));
+function findMissingPatterns(e) {
+	let x = e.filter((e) => !Object.hasOwn(e, PATTERN));
 	return {
-		errors: map_default(N, (i) => ({
-			message: "Token Type: ->" + i.name + "<- missing static 'PATTERN' property",
+		errors: x.map((e) => ({
+			message: "Token Type: ->" + e.name + "<- missing static 'PATTERN' property",
 			type: LexerDefinitionErrorType.MISSING_PATTERN,
-			tokenTypes: [i]
+			tokenTypes: [e]
 		})),
-		valid: difference_default(i, N)
+		valid: e.filter((e) => !x.includes(e))
 	};
 }
-function findInvalidPatterns(N) {
-	let P = filter_default(N, (N) => {
-		let P = N[PATTERN];
-		return !isRegExp_default(P) && !isFunction_default(P) && !has_default(P, "exec") && !isString_default(P);
+function findInvalidPatterns(e) {
+	let x = e.filter((e) => {
+		let x = e[PATTERN];
+		return !(x instanceof RegExp) && typeof x != "function" && !Object.hasOwn(x, "exec") && typeof x != "string";
 	});
 	return {
-		errors: map_default(P, (i) => ({
-			message: "Token Type: ->" + i.name + "<- static 'PATTERN' can only be a RegExp, a Function matching the {CustomPatternMatcherFunc} type or an Object matching the {ICustomPattern} interface.",
+		errors: x.map((e) => ({
+			message: "Token Type: ->" + e.name + "<- static 'PATTERN' can only be a RegExp, a Function matching the {CustomPatternMatcherFunc} type or an Object matching the {ICustomPattern} interface.",
 			type: LexerDefinitionErrorType.INVALID_PATTERN,
-			tokenTypes: [i]
+			tokenTypes: [e]
 		})),
-		valid: difference_default(N, P)
+		valid: e.filter((e) => !x.includes(e))
 	};
 }
 var end_of_input = /[^\\][$]/;
-function findEndOfInputAnchor(i) {
-	class N extends BaseRegExpVisitor {
+function findEndOfInputAnchor(x) {
+	class C extends BaseRegExpVisitor {
 		constructor() {
 			super(...arguments), this.found = !1;
 		}
-		visitEndAnchor(i) {
+		visitEndAnchor(e) {
 			this.found = !0;
 		}
 	}
-	return map_default(filter_default(i, (i) => {
-		let P = i.PATTERN;
+	return x.filter((e) => {
+		let x = e.PATTERN;
 		try {
-			let i = getRegExpAst(P), F = new N();
-			return F.visit(i), F.found;
+			let e = getRegExpAst(x), w = new C();
+			return w.visit(e), w.found;
 		} catch {
 			/* istanbul ignore next - cannot ensure an error in regexp-to-ast*/
-			return end_of_input.test(P.source);
+			return end_of_input.test(x.source);
 		}
-	}), (i) => ({
-		message: "Unexpected RegExp Anchor Error:\n	Token Type: ->" + i.name + "<- static 'PATTERN' cannot contain end of input anchor '$'\n	See chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS	for details.",
+	}).map((e) => ({
+		message: "Unexpected RegExp Anchor Error:\n	Token Type: ->" + e.name + "<- static 'PATTERN' cannot contain end of input anchor '$'\n	See chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS	for details.",
 		type: LexerDefinitionErrorType.EOI_ANCHOR_FOUND,
-		tokenTypes: [i]
+		tokenTypes: [e]
 	}));
 }
-function findEmptyMatchRegExps(i) {
-	return map_default(filter_default(i, (i) => i.PATTERN.test("")), (i) => ({
-		message: "Token Type: ->" + i.name + "<- static 'PATTERN' must not match an empty string",
+function findEmptyMatchRegExps(e) {
+	return e.filter((e) => e.PATTERN.test("")).map((e) => ({
+		message: "Token Type: ->" + e.name + "<- static 'PATTERN' must not match an empty string",
 		type: LexerDefinitionErrorType.EMPTY_MATCH_PATTERN,
-		tokenTypes: [i]
+		tokenTypes: [e]
 	}));
 }
 var start_of_input = /[^\\[][\^]|^\^/;
-function findStartOfInputAnchor(i) {
-	class N extends BaseRegExpVisitor {
+function findStartOfInputAnchor(x) {
+	class C extends BaseRegExpVisitor {
 		constructor() {
 			super(...arguments), this.found = !1;
 		}
-		visitStartAnchor(i) {
+		visitStartAnchor(e) {
 			this.found = !0;
 		}
 	}
-	return map_default(filter_default(i, (i) => {
-		let P = i.PATTERN;
+	return x.filter((e) => {
+		let x = e.PATTERN;
 		try {
-			let i = getRegExpAst(P), F = new N();
-			return F.visit(i), F.found;
+			let e = getRegExpAst(x), w = new C();
+			return w.visit(e), w.found;
 		} catch {
 			/* istanbul ignore next - cannot ensure an error in regexp-to-ast*/
-			return start_of_input.test(P.source);
+			return start_of_input.test(x.source);
 		}
-	}), (i) => ({
-		message: "Unexpected RegExp Anchor Error:\n	Token Type: ->" + i.name + "<- static 'PATTERN' cannot contain start of input anchor '^'\n	See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS	for details.",
+	}).map((e) => ({
+		message: "Unexpected RegExp Anchor Error:\n	Token Type: ->" + e.name + "<- static 'PATTERN' cannot contain start of input anchor '^'\n	See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS	for details.",
 		type: LexerDefinitionErrorType.SOI_ANCHOR_FOUND,
-		tokenTypes: [i]
+		tokenTypes: [e]
 	}));
 }
-function findUnsupportedFlags(i) {
-	return map_default(filter_default(i, (i) => {
-		let N = i[PATTERN];
-		return N instanceof RegExp && (N.multiline || N.global);
-	}), (i) => ({
-		message: "Token Type: ->" + i.name + "<- static 'PATTERN' may NOT contain global('g') or multiline('m')",
+function findUnsupportedFlags(e) {
+	return e.filter((e) => {
+		let x = e[PATTERN];
+		return x instanceof RegExp && (x.multiline || x.global);
+	}).map((e) => ({
+		message: "Token Type: ->" + e.name + "<- static 'PATTERN' may NOT contain global('g') or multiline('m')",
 		type: LexerDefinitionErrorType.UNSUPPORTED_FLAGS_FOUND,
-		tokenTypes: [i]
+		tokenTypes: [e]
 	}));
 }
-function findDuplicatePatterns(i) {
-	let N = [], P = map_default(i, (P) => reduce_default(i, (i, F) => P.PATTERN.source === F.PATTERN.source && !includes_default(N, F) && F.PATTERN !== Lexer.NA ? (N.push(F), i.push(F), i) : i, []));
-	return P = compact_default(P), map_default(filter_default(P, (i) => i.length > 1), (i) => {
-		let N = map_default(i, (i) => i.name);
+function findDuplicatePatterns(e) {
+	let x = [], S = e.map((S) => e.reduce((e, C) => S.PATTERN.source === C.PATTERN.source && !x.includes(C) && C.PATTERN !== Lexer.NA ? (x.push(C), e.push(C), e) : e, []));
+	return S = S.filter(Boolean), S.filter((e) => e.length > 1).map((e) => {
+		let x = e.map((e) => e.name);
 		return {
-			message: `The same RegExp pattern ->${head_default(i).PATTERN}<-has been used in all of the following Token Types: ${N.join(", ")} <-`,
+			message: `The same RegExp pattern ->${e[0].PATTERN}<-has been used in all of the following Token Types: ${x.join(", ")} <-`,
 			type: LexerDefinitionErrorType.DUPLICATE_PATTERNS_FOUND,
-			tokenTypes: i
+			tokenTypes: e
 		};
 	});
 }
-function findInvalidGroupType(i) {
-	return map_default(filter_default(i, (i) => {
-		if (!has_default(i, "GROUP")) return !1;
-		let N = i.GROUP;
-		return N !== Lexer.SKIPPED && N !== Lexer.NA && !isString_default(N);
-	}), (i) => ({
-		message: "Token Type: ->" + i.name + "<- static 'GROUP' can only be Lexer.SKIPPED/Lexer.NA/A String",
+function findInvalidGroupType(e) {
+	return e.filter((e) => {
+		if (!Object.hasOwn(e, "GROUP")) return !1;
+		let x = e.GROUP;
+		return x !== Lexer.SKIPPED && x !== Lexer.NA && typeof x != "string";
+	}).map((e) => ({
+		message: "Token Type: ->" + e.name + "<- static 'GROUP' can only be Lexer.SKIPPED/Lexer.NA/A String",
 		type: LexerDefinitionErrorType.INVALID_GROUP_TYPE_FOUND,
-		tokenTypes: [i]
+		tokenTypes: [e]
 	}));
 }
-function findModesThatDoNotExist(i, N) {
-	return map_default(filter_default(i, (i) => i.PUSH_MODE !== void 0 && !includes_default(N, i.PUSH_MODE)), (i) => ({
-		message: `Token Type: ->${i.name}<- static 'PUSH_MODE' value cannot refer to a Lexer Mode ->${i.PUSH_MODE}<-which does not exist`,
+function findModesThatDoNotExist(e, x) {
+	return e.filter((e) => e.PUSH_MODE !== void 0 && !x.includes(e.PUSH_MODE)).map((e) => ({
+		message: `Token Type: ->${e.name}<- static 'PUSH_MODE' value cannot refer to a Lexer Mode ->${e.PUSH_MODE}<-which does not exist`,
 		type: LexerDefinitionErrorType.PUSH_MODE_DOES_NOT_EXIST,
-		tokenTypes: [i]
+		tokenTypes: [e]
 	}));
 }
-function findUnreachablePatterns(i) {
-	let N = [], P = reduce_default(i, (i, N, P) => {
-		let F = N.PATTERN;
-		return F === Lexer.NA || (isString_default(F) ? i.push({
-			str: F,
-			idx: P,
-			tokenType: N
-		}) : isRegExp_default(F) && noMetaChar(F) && i.push({
-			str: F.source,
-			idx: P,
-			tokenType: N
-		})), i;
+function findUnreachablePatterns(e) {
+	let x = [], S = e.reduce((e, x, S) => {
+		let C = x.PATTERN;
+		return C === Lexer.NA || (typeof C == "string" ? e.push({
+			str: C,
+			idx: S,
+			tokenType: x
+		}) : C instanceof RegExp && noMetaChar(C) && e.push({
+			str: C.source,
+			idx: S,
+			tokenType: x
+		})), e;
 	}, []);
-	return forEach_default(i, (i, F) => {
-		forEach_default(P, ({ str: P, idx: I, tokenType: L }) => {
-			if (F < I && tryToMatchStrToPattern(P, i.PATTERN)) {
-				let P = `Token: ->${L.name}<- can never be matched.\nBecause it appears AFTER the Token Type ->${i.name}<-in the lexer's definition.\nSee https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
-				N.push({
-					message: P,
+	return e.forEach((e, C) => {
+		S.forEach(({ str: S, idx: w, tokenType: T }) => {
+			if (C < w && tryToMatchStrToPattern(S, e.PATTERN)) {
+				let S = `Token: ->${T.name}<- can never be matched.\nBecause it appears AFTER the Token Type ->${e.name}<-in the lexer's definition.\nSee https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
+				x.push({
+					message: S,
 					type: LexerDefinitionErrorType.UNREACHABLE_PATTERN,
-					tokenTypes: [i, L]
+					tokenTypes: [e, T]
 				});
 			}
 		});
-	}), N;
+	}), x;
 }
-function tryToMatchStrToPattern(N, P) {
-	if (isRegExp_default(P)) {
-		if (usesLookAheadOrBehind(P)) return !1;
-		let i = P.exec(N);
-		return i !== null && i.index === 0;
-	} else if (isFunction_default(P)) return P(N, 0, [], {});
-	else if (has_default(P, "exec")) return P.exec(N, 0, [], {});
-	else if (typeof P == "string") return P === N;
+function tryToMatchStrToPattern(e, x) {
+	if (x instanceof RegExp) {
+		if (usesLookAheadOrBehind(x)) return !1;
+		let S = x.exec(e);
+		return S !== null && S.index === 0;
+	} else if (typeof x == "function") return x(e, 0, [], {});
+	else if (Object.hasOwn(x, "exec")) return x.exec(e, 0, [], {});
+	else if (typeof x == "string") return x === e;
 	else throw Error("non exhaustive match");
 }
-function noMetaChar(i) {
-	return find_default([
+function noMetaChar(e) {
+	return [
 		".",
 		"\\",
 		"[",
@@ -331,129 +308,130 @@ function noMetaChar(i) {
 		"*",
 		"+",
 		"{"
-	], (N) => i.source.indexOf(N) !== -1) === void 0;
+	].find((x) => e.source.indexOf(x) !== -1) === void 0;
 }
-function usesLookAheadOrBehind(i) {
-	return /(\(\?=)|(\(\?!)|(\(\?<=)|(\(\?<!)/.test(i.source);
+function usesLookAheadOrBehind(e) {
+	return /(\(\?=)|(\(\?!)|(\(\?<=)|(\(\?<!)/.test(e.source);
 }
-function addStickyFlag(i) {
-	let N = i.ignoreCase ? "iy" : "y";
-	return RegExp(`${i.source}`, N);
+function addStickyFlag(e) {
+	let x = e.ignoreCase ? "iy" : "y";
+	return RegExp(`${e.source}`, x);
 }
-function performRuntimeChecks(i, P, F) {
-	let I = [];
-	return has_default(i, "defaultMode") || I.push({
+function performRuntimeChecks(e, x, S) {
+	let C = [];
+	return Object.hasOwn(e, "defaultMode") || C.push({
 		message: "A MultiMode Lexer cannot be initialized without a <" + DEFAULT_MODE + "> property in its definition\n",
 		type: LexerDefinitionErrorType.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE
-	}), has_default(i, "modes") || I.push({
+	}), Object.hasOwn(e, "modes") || C.push({
 		message: "A MultiMode Lexer cannot be initialized without a <modes> property in its definition\n",
 		type: LexerDefinitionErrorType.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY
-	}), has_default(i, "modes") && has_default(i, "defaultMode") && !has_default(i.modes, i.defaultMode) && I.push({
-		message: `A MultiMode Lexer cannot be initialized with a ${DEFAULT_MODE}: <${i.defaultMode}>which does not exist\n`,
+	}), Object.hasOwn(e, "modes") && Object.hasOwn(e, "defaultMode") && !Object.hasOwn(e.modes, e.defaultMode) && C.push({
+		message: `A MultiMode Lexer cannot be initialized with a ${DEFAULT_MODE}: <${e.defaultMode}>which does not exist\n`,
 		type: LexerDefinitionErrorType.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST
-	}), has_default(i, "modes") && forEach_default(i.modes, (i, P) => {
-		forEach_default(i, (F, L) => {
-			isUndefined_default(F) ? I.push({
-				message: `A Lexer cannot be initialized using an undefined Token Type. Mode:<${P}> at index: <${L}>\n`,
+	}), Object.hasOwn(e, "modes") && Object.keys(e.modes).forEach((x) => {
+		let S = e.modes[x];
+		S.forEach((e, w) => {
+			e === void 0 ? C.push({
+				message: `A Lexer cannot be initialized using an undefined Token Type. Mode:<${x}> at index: <${w}>\n`,
 				type: LexerDefinitionErrorType.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED
-			}) : has_default(F, "LONGER_ALT") && forEach_default(isArray_default(F.LONGER_ALT) ? F.LONGER_ALT : [F.LONGER_ALT], (N) => {
-				!isUndefined_default(N) && !includes_default(i, N) && I.push({
-					message: `A MultiMode Lexer cannot be initialized with a longer_alt <${N.name}> on token <${F.name}> outside of mode <${P}>\n`,
+			}) : Object.hasOwn(e, "LONGER_ALT") && (Array.isArray(e.LONGER_ALT) ? e.LONGER_ALT : [e.LONGER_ALT]).forEach((w) => {
+				w !== void 0 && !S.includes(w) && C.push({
+					message: `A MultiMode Lexer cannot be initialized with a longer_alt <${w.name}> on token <${e.name}> outside of mode <${x}>\n`,
 					type: LexerDefinitionErrorType.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE
 				});
 			});
 		});
-	}), I;
+	}), C;
 }
-function performWarningRuntimeChecks(i, N, P) {
-	let F = [], I = !1, z = reject_default(compact_default(flatten_default(values_default(i.modes))), (i) => i[PATTERN] === Lexer.NA), B = getCharCodes(P);
-	return N && forEach_default(z, (i) => {
-		let N = checkLineBreaksIssues(i, B);
-		if (N !== !1) {
-			let P = {
-				message: buildLineBreakIssueMessage(i, N),
-				type: N.issue,
-				tokenType: i
+function performWarningRuntimeChecks(e, x, S) {
+	let w = [], T = !1, O = Object.values(e.modes || {}).flat().filter(Boolean).filter((e) => e[PATTERN] !== Lexer.NA), k = getCharCodes(S);
+	return x && O.forEach((e) => {
+		let x = checkLineBreaksIssues(e, k);
+		if (x !== !1) {
+			let S = {
+				message: buildLineBreakIssueMessage(e, x),
+				type: x.issue,
+				tokenType: e
 			};
-			F.push(P);
-		} else has_default(i, "LINE_BREAKS") ? i.LINE_BREAKS === !0 && (I = !0) : canMatchCharCode(B, i.PATTERN) && (I = !0);
-	}), N && !I && F.push({
+			w.push(S);
+		} else Object.hasOwn(e, "LINE_BREAKS") ? e.LINE_BREAKS === !0 && (T = !0) : canMatchCharCode(k, e.PATTERN) && (T = !0);
+	}), x && !T && w.push({
 		message: "Warning: No LINE_BREAKS Found.\n	This Lexer has been defined to track line and column information,\n	But none of the Token Types can be identified as matching a line terminator.\n	See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#LINE_BREAKS \n	for details.",
 		type: LexerDefinitionErrorType.NO_LINE_BREAKS_FLAGS
-	}), F;
+	}), w;
 }
-function cloneEmptyGroups(i) {
-	let P = {};
-	return forEach_default(keys_default(i), (F) => {
-		let I = i[F];
+function cloneEmptyGroups(e) {
+	let x = {};
+	return Object.keys(e).forEach((S) => {
+		let C = e[S];
 		/* istanbul ignore else */
-		if (isArray_default(I)) P[F] = [];
+		if (Array.isArray(C)) x[S] = [];
 		else throw Error("non exhaustive match");
-	}), P;
+	}), x;
 }
-function isCustomPattern(N) {
-	let P = N.PATTERN;
+function isCustomPattern(e) {
+	let x = e.PATTERN;
 	/* istanbul ignore else */
-	if (isRegExp_default(P)) return !1;
-	if (isFunction_default(P) || has_default(P, "exec")) return !0;
-	if (isString_default(P)) return !1;
+	if (x instanceof RegExp) return !1;
+	if (typeof x == "function" || Object.hasOwn(x, "exec")) return !0;
+	if (typeof x == "string") return !1;
 	throw Error("non exhaustive match");
 }
-function isShortPattern(i) {
-	return isString_default(i) && i.length === 1 ? i.charCodeAt(0) : !1;
+function isShortPattern(e) {
+	return typeof e == "string" && e.length === 1 ? e.charCodeAt(0) : !1;
 }
 const LineTerminatorOptimizedTester = {
-	test: function(i) {
-		let N = i.length;
-		for (let P = this.lastIndex; P < N; P++) {
-			let N = i.charCodeAt(P);
-			if (N === 10) return this.lastIndex = P + 1, !0;
-			if (N === 13) return i.charCodeAt(P + 1) === 10 ? this.lastIndex = P + 2 : this.lastIndex = P + 1, !0;
+	test: function(e) {
+		let x = e.length;
+		for (let S = this.lastIndex; S < x; S++) {
+			let x = e.charCodeAt(S);
+			if (x === 10) return this.lastIndex = S + 1, !0;
+			if (x === 13) return e.charCodeAt(S + 1) === 10 ? this.lastIndex = S + 2 : this.lastIndex = S + 1, !0;
 		}
 		return !1;
 	},
 	lastIndex: 0
 };
-function checkLineBreaksIssues(i, N) {
-	if (has_default(i, "LINE_BREAKS")) return !1;
-	if (isRegExp_default(i.PATTERN)) {
+function checkLineBreaksIssues(e, x) {
+	if (Object.hasOwn(e, "LINE_BREAKS")) return !1;
+	if (e.PATTERN instanceof RegExp) {
 		try {
-			canMatchCharCode(N, i.PATTERN);
-		} catch (i) {
+			canMatchCharCode(x, e.PATTERN);
+		} catch (e) {
 			/* istanbul ignore next - to test this we would have to mock <canMatchCharCode> to throw an error */
 			return {
 				issue: LexerDefinitionErrorType.IDENTIFY_TERMINATOR,
-				errMsg: i.message
+				errMsg: e.message
 			};
 		}
 		return !1;
-	} else if (isString_default(i.PATTERN)) return !1;
-	else if (isCustomPattern(i)) return { issue: LexerDefinitionErrorType.CUSTOM_LINE_BREAK };
+	} else if (typeof e.PATTERN == "string") return !1;
+	else if (isCustomPattern(e)) return { issue: LexerDefinitionErrorType.CUSTOM_LINE_BREAK };
 	else throw Error("non exhaustive match");
 }
-function buildLineBreakIssueMessage(i, N) {
+function buildLineBreakIssueMessage(e, x) {
 	/* istanbul ignore else */
-	if (N.issue === LexerDefinitionErrorType.IDENTIFY_TERMINATOR) return `Warning: unable to identify line terminator usage in pattern.
-\tThe problem is in the <${i.name}> Token Type\n\t Root cause: ${N.errMsg}.\n	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#IDENTIFY_TERMINATOR`;
-	if (N.issue === LexerDefinitionErrorType.CUSTOM_LINE_BREAK) return `Warning: A Custom Token Pattern should specify the <line_breaks> option.
-\tThe problem is in the <${i.name}> Token Type\n	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_LINE_BREAK`;
+	if (x.issue === LexerDefinitionErrorType.IDENTIFY_TERMINATOR) return `Warning: unable to identify line terminator usage in pattern.
+\tThe problem is in the <${e.name}> Token Type\n\t Root cause: ${x.errMsg}.\n	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#IDENTIFY_TERMINATOR`;
+	if (x.issue === LexerDefinitionErrorType.CUSTOM_LINE_BREAK) return `Warning: A Custom Token Pattern should specify the <line_breaks> option.
+\tThe problem is in the <${e.name}> Token Type\n	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_LINE_BREAK`;
 	throw Error("non exhaustive match");
 }
-function getCharCodes(i) {
-	return map_default(i, (i) => isString_default(i) ? i.charCodeAt(0) : i);
+function getCharCodes(e) {
+	return e.map((e) => typeof e == "string" ? e.charCodeAt(0) : e);
 }
-function addToMapOfArrays(i, N, P) {
-	i[N] === void 0 ? i[N] = [P] : i[N].push(P);
+function addToMapOfArrays(e, x, S) {
+	e[x] === void 0 ? e[x] = [S] : e[x].push(S);
 }
 const minOptimizationVal = 256;
 var charCodeToOptimizedIdxMap = [];
-function charCodeToOptimizedIndex(i) {
-	return i < 256 ? i : charCodeToOptimizedIdxMap[i];
+function charCodeToOptimizedIndex(e) {
+	return e < 256 ? e : charCodeToOptimizedIdxMap[e];
 }
 function initCharCodeToOptimizedIndexMap() {
-	if (isEmpty_default(charCodeToOptimizedIdxMap)) {
+	if (charCodeToOptimizedIdxMap.length === 0) {
 		charCodeToOptimizedIdxMap = Array(65536);
-		for (let i = 0; i < 65536; i++) charCodeToOptimizedIdxMap[i] = i > 255 ? 255 + ~~(i / 255) : i;
+		for (let e = 0; e < 65536; e++) charCodeToOptimizedIdxMap[e] = e > 255 ? 255 + ~~(e / 255) : e;
 	}
 }
 export { DEFAULT_MODE, LineTerminatorOptimizedTester, analyzeTokenTypes, charCodeToOptimizedIndex, cloneEmptyGroups, minOptimizationVal, performRuntimeChecks, performWarningRuntimeChecks, validatePatterns };