@loopstack/loopstack-studio 0.24.0 → 0.25.1

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 { BaseRegExpVisitor as e } 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,
+import { PRINT_ERROR as t } from "../../../../@chevrotain/utils/lib/src/print.js";
+import { getRegExpAst as n } from "./reg_exp_parser.js";
+import { canMatchCharCode as r, failedOptimizationPrefixMsg as i, getOptimizedStartCodesIndices as a } from "./reg_exp.js";
+import { Lexer as o, LexerDefinitionErrorType as s } from "./lexer_public.js";
+//#region ../../node_modules/chevrotain/lib/src/scan/lexer.js
+var c = "PATTERN", l = "defaultMode", u = "modes";
+function d(e, n) {
+	n = Object.assign({
 		safeMode: !1,
 		positionTracking: "full",
 		lineTerminatorCharacters: ["\r", "\n"],
-		tracer: (i, N) => N()
+		tracer: (e, t) => t()
+	}, n);
+	let s = n.tracer;
+	s("initCharCodeToOptimizedIndexMap", () => {
+		H();
 	});
-	let L = I.tracer;
-	L("initCharCodeToOptimizedIndexMap", () => {
-		initCharCodeToOptimizedIndexMap();
+	let l;
+	s("Reject Lexer.NA", () => {
+		l = e.filter((e) => e[c] !== o.NA);
 	});
-	let R;
-	L("Reject Lexer.NA", () => {
-		R = reject_default(F, (i) => i[PATTERN] === Lexer.NA);
-	});
-	let B = !1, V;
-	L("Transform Patterns", () => {
-		B = !1, V = map_default(R, (N) => {
-			let P = N[PATTERN];
+	let u = !1, d;
+	s("Transform Patterns", () => {
+		u = !1, d = l.map((e) => {
+			let t = e[c];
 			/* 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 (t instanceof RegExp) {
+				let e = t.source;
+				return e.length === 1 && e !== "^" && e !== "$" && e !== "." && !t.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] : k(t);
+			} else if (typeof t == "function") return u = !0, { exec: t };
+			else if (typeof t == "object") return u = !0, t;
+			else if (typeof t == "string") {
+				if (t.length === 1) return t;
 				{
-					let i = P.replace(/[\\^$.*+?()[\]{}|]/g, "\\$&");
-					return addStickyFlag(new RegExp(i));
+					let e = t.replace(/[\\^$.*+?()[\]{}|]/g, "\\$&");
+					return k(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 f, p, m, h, g;
+	s("misc mapping", () => {
+		f = l.map((e) => e.tokenTypeIdx), p = l.map((e) => {
+			let t = e.GROUP;
+			if (t !== o.SKIPPED) {
+				if (typeof t == "string") return t;
+				if (t === 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"));
+		}), m = l.map((e) => {
+			let t = e.LONGER_ALT;
+			if (t) return Array.isArray(t) ? t.map((e) => l.indexOf(e)) : [l.indexOf(t)];
+		}), h = l.map((e) => e.PUSH_MODE), g = l.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 _;
+	s("Line Terminator Handling", () => {
+		let e = R(n.lineTerminatorCharacters);
+		_ = l.map((e) => !1), n.positionTracking !== "onlyOffset" && (_ = l.map((t) => Object.hasOwn(t, "LINE_BREAKS") ? !!t.LINE_BREAKS : I(t, e) === !1 && r(e, t.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 v, y, b, x;
+	s("Misc Mapping #2", () => {
+		v = l.map(N), y = d.map(P), b = l.reduce((e, t) => {
+			let n = t.GROUP;
+			return typeof n == "string" && n !== o.SKIPPED && (e[n] = []), e;
+		}, {}), x = d.map((e, t) => ({
+			pattern: d[t],
+			longerAlt: m[t],
+			canLineTerminator: _[t],
+			isCustom: v[t],
+			short: y[t],
+			group: p[t],
+			push: h[t],
+			pop: g[t],
+			tokenTypeIdx: f[t],
+			tokenType: l[t]
 		}));
 	});
-	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 S = !0, C = [];
+	return n.safeMode || s("First Char Optimization", () => {
+		C = l.reduce((e, r, o) => {
+			if (typeof r.PATTERN == "string") z(e, V(r.PATTERN.charCodeAt(0)), x[o]);
+			else if (Array.isArray(r.START_CHARS_HINT)) {
+				let t;
+				r.START_CHARS_HINT.forEach((n) => {
+					let r = V(typeof n == "string" ? n.charCodeAt(0) : n);
 					/* istanbul ignore else */
-					N !== F && (N = F, addToMapOfArrays(i, F, Z[L]));
+					t !== r && (t = r, z(e, r, x[o]));
 				});
-			} 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 (r.PATTERN instanceof RegExp) if (r.PATTERN.unicode) S = !1, n.ensureOptimizations && t(`${i}\tUnable to analyze < ${r.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 t = a(r.PATTERN, n.ensureOptimizations);
+				t.length === 0 && (S = !1), t.forEach((t) => {
+					z(e, t, x[o]);
 				});
 			}
-			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 n.ensureOptimizations && t(`${i}\tTokenType: <${r.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`), S = !1;
+			return e;
 		}, []);
 	}), {
-		emptyGroups: X,
-		patternIdxToConfig: Z,
-		charCodeToPatternIdxToConfig: $,
-		hasCustom: B,
-		canBeOptimized: Q
+		emptyGroups: b,
+		patternIdxToConfig: x,
+		charCodeToPatternIdxToConfig: C,
+		hasCustom: u,
+		canBeOptimized: S
 	};
 }
-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 f(e, t) {
+	let n = [], r = m(e);
+	n = n.concat(r.errors);
+	let i = h(r.valid), a = i.valid;
+	return n = n.concat(i.errors), n = n.concat(p(a)), n = n.concat(C(a)), n = n.concat(w(a, t)), n = n.concat(T(a)), n;
 }
-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 p(e) {
+	let t = [], n = e.filter((e) => e[c] instanceof RegExp);
+	return t = t.concat(_(n)), t = t.concat(b(n)), t = t.concat(x(n)), t = t.concat(S(n)), t = t.concat(v(n)), t;
 }
-function findMissingPatterns(i) {
-	let N = filter_default(i, (i) => !has_default(i, PATTERN));
+function m(e) {
+	let t = e.filter((e) => !Object.hasOwn(e, c));
 	return {
-		errors: map_default(N, (i) => ({
-			message: "Token Type: ->" + i.name + "<- missing static 'PATTERN' property",
-			type: LexerDefinitionErrorType.MISSING_PATTERN,
-			tokenTypes: [i]
+		errors: t.map((e) => ({
+			message: "Token Type: ->" + e.name + "<- missing static 'PATTERN' property",
+			type: s.MISSING_PATTERN,
+			tokenTypes: [e]
 		})),
-		valid: difference_default(i, N)
+		valid: e.filter((e) => !t.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 h(e) {
+	let t = e.filter((e) => {
+		let t = e[c];
+		return !(t instanceof RegExp) && typeof t != "function" && !Object.hasOwn(t, "exec") && typeof t != "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.",
-			type: LexerDefinitionErrorType.INVALID_PATTERN,
-			tokenTypes: [i]
+		errors: t.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: s.INVALID_PATTERN,
+			tokenTypes: [e]
 		})),
-		valid: difference_default(N, P)
+		valid: e.filter((e) => !t.includes(e))
 	};
 }
-var end_of_input = /[^\\][$]/;
-function findEndOfInputAnchor(i) {
-	class N extends BaseRegExpVisitor {
+var g = /[^\\][$]/;
+function _(t) {
+	class r extends e {
 		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 t.filter((e) => {
+		let t = e.PATTERN;
 		try {
-			let i = getRegExpAst(P), F = new N();
-			return F.visit(i), F.found;
+			let e = n(t), i = new r();
+			return i.visit(e), i.found;
 		} catch {
 			/* istanbul ignore next - cannot ensure an error in regexp-to-ast*/
-			return end_of_input.test(P.source);
+			return g.test(t.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.",
-		type: LexerDefinitionErrorType.EOI_ANCHOR_FOUND,
-		tokenTypes: [i]
+	}).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: s.EOI_ANCHOR_FOUND,
+		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",
-		type: LexerDefinitionErrorType.EMPTY_MATCH_PATTERN,
-		tokenTypes: [i]
+function v(e) {
+	return e.filter((e) => e.PATTERN.test("")).map((e) => ({
+		message: "Token Type: ->" + e.name + "<- static 'PATTERN' must not match an empty string",
+		type: s.EMPTY_MATCH_PATTERN,
+		tokenTypes: [e]
 	}));
 }
-var start_of_input = /[^\\[][\^]|^\^/;
-function findStartOfInputAnchor(i) {
-	class N extends BaseRegExpVisitor {
+var y = /[^\\[][\^]|^\^/;
+function b(t) {
+	class r extends e {
 		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 t.filter((e) => {
+		let t = e.PATTERN;
 		try {
-			let i = getRegExpAst(P), F = new N();
-			return F.visit(i), F.found;
+			let e = n(t), i = new r();
+			return i.visit(e), i.found;
 		} catch {
 			/* istanbul ignore next - cannot ensure an error in regexp-to-ast*/
-			return start_of_input.test(P.source);
+			return y.test(t.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.",
-		type: LexerDefinitionErrorType.SOI_ANCHOR_FOUND,
-		tokenTypes: [i]
+	}).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: s.SOI_ANCHOR_FOUND,
+		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')",
-		type: LexerDefinitionErrorType.UNSUPPORTED_FLAGS_FOUND,
-		tokenTypes: [i]
+function x(e) {
+	return e.filter((e) => {
+		let t = e[c];
+		return t instanceof RegExp && (t.multiline || t.global);
+	}).map((e) => ({
+		message: "Token Type: ->" + e.name + "<- static 'PATTERN' may NOT contain global('g') or multiline('m')",
+		type: s.UNSUPPORTED_FLAGS_FOUND,
+		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 S(e) {
+	let t = [], n = e.map((n) => e.reduce((e, r) => n.PATTERN.source === r.PATTERN.source && !t.includes(r) && r.PATTERN !== o.NA ? (t.push(r), e.push(r), e) : e, []));
+	return n = n.filter(Boolean), n.filter((e) => e.length > 1).map((e) => {
+		let t = 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(", ")} <-`,
-			type: LexerDefinitionErrorType.DUPLICATE_PATTERNS_FOUND,
-			tokenTypes: i
+			message: `The same RegExp pattern ->${e[0].PATTERN}<-has been used in all of the following Token Types: ${t.join(", ")} <-`,
+			type: s.DUPLICATE_PATTERNS_FOUND,
+			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",
-		type: LexerDefinitionErrorType.INVALID_GROUP_TYPE_FOUND,
-		tokenTypes: [i]
+function C(e) {
+	return e.filter((e) => {
+		if (!Object.hasOwn(e, "GROUP")) return !1;
+		let t = e.GROUP;
+		return t !== o.SKIPPED && t !== o.NA && typeof t != "string";
+	}).map((e) => ({
+		message: "Token Type: ->" + e.name + "<- static 'GROUP' can only be Lexer.SKIPPED/Lexer.NA/A String",
+		type: s.INVALID_GROUP_TYPE_FOUND,
+		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`,
-		type: LexerDefinitionErrorType.PUSH_MODE_DOES_NOT_EXIST,
-		tokenTypes: [i]
+function w(e, t) {
+	return e.filter((e) => e.PUSH_MODE !== void 0 && !t.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: s.PUSH_MODE_DOES_NOT_EXIST,
+		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 T(e) {
+	let t = [], n = e.reduce((e, t, n) => {
+		let r = t.PATTERN;
+		return r === o.NA || (typeof r == "string" ? e.push({
+			str: r,
+			idx: n,
+			tokenType: t
+		}) : r instanceof RegExp && D(r) && e.push({
+			str: r.source,
+			idx: n,
+			tokenType: t
+		})), 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,
-					type: LexerDefinitionErrorType.UNREACHABLE_PATTERN,
-					tokenTypes: [i, L]
+	return e.forEach((e, r) => {
+		n.forEach(({ str: n, idx: i, tokenType: a }) => {
+			if (r < i && E(n, e.PATTERN)) {
+				let n = `Token: ->${a.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`;
+				t.push({
+					message: n,
+					type: s.UNREACHABLE_PATTERN,
+					tokenTypes: [e, a]
 				});
 			}
 		});
-	}), N;
+	}), t;
 }
-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 E(e, t) {
+	if (t instanceof RegExp) {
+		if (O(t)) return !1;
+		let n = t.exec(e);
+		return n !== null && n.index === 0;
+	} else if (typeof t == "function") return t(e, 0, [], {});
+	else if (Object.hasOwn(t, "exec")) return t.exec(e, 0, [], {});
+	else if (typeof t == "string") return t === e;
 	else throw Error("non exhaustive match");
 }
-function noMetaChar(i) {
-	return find_default([
+function D(e) {
+	return [
 		".",
 		"\\",
 		"[",
@@ -331,129 +308,130 @@ function noMetaChar(i) {
 		"*",
 		"+",
 		"{"
-	], (N) => i.source.indexOf(N) !== -1) === void 0;
+	].find((t) => e.source.indexOf(t) !== -1) === void 0;
 }
-function usesLookAheadOrBehind(i) {
-	return /(\(\?=)|(\(\?!)|(\(\?<=)|(\(\?<!)/.test(i.source);
+function O(e) {
+	return /(\(\?=)|(\(\?!)|(\(\?<=)|(\(\?<!)/.test(e.source);
 }
-function addStickyFlag(i) {
-	let N = i.ignoreCase ? "iy" : "y";
-	return RegExp(`${i.source}`, N);
+function k(e) {
+	let t = e.ignoreCase ? "iy" : "y";
+	return RegExp(`${e.source}`, t);
 }
-function performRuntimeChecks(i, P, F) {
-	let I = [];
-	return has_default(i, "defaultMode") || I.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({
-		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`,
-		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`,
-				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`,
-					type: LexerDefinitionErrorType.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE
+function A(e, t, n) {
+	let r = [];
+	return Object.hasOwn(e, "defaultMode") || r.push({
+		message: "A MultiMode Lexer cannot be initialized without a <" + l + "> property in its definition\n",
+		type: s.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE
+	}), Object.hasOwn(e, "modes") || r.push({
+		message: "A MultiMode Lexer cannot be initialized without a <" + u + "> property in its definition\n",
+		type: s.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY
+	}), Object.hasOwn(e, "modes") && Object.hasOwn(e, "defaultMode") && !Object.hasOwn(e.modes, e.defaultMode) && r.push({
+		message: `A MultiMode Lexer cannot be initialized with a ${l}: <${e.defaultMode}>which does not exist\n`,
+		type: s.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST
+	}), Object.hasOwn(e, "modes") && Object.keys(e.modes).forEach((t) => {
+		let n = e.modes[t];
+		n.forEach((e, i) => {
+			e === void 0 ? r.push({
+				message: `A Lexer cannot be initialized using an undefined Token Type. Mode:<${t}> at index: <${i}>\n`,
+				type: s.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED
+			}) : Object.hasOwn(e, "LONGER_ALT") && (Array.isArray(e.LONGER_ALT) ? e.LONGER_ALT : [e.LONGER_ALT]).forEach((i) => {
+				i !== void 0 && !n.includes(i) && r.push({
+					message: `A MultiMode Lexer cannot be initialized with a longer_alt <${i.name}> on token <${e.name}> outside of mode <${t}>\n`,
+					type: s.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE
 				});
 			});
 		});
-	}), I;
+	}), r;
 }
-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 j(e, t, n) {
+	let i = [], a = !1, l = Object.values(e.modes || {}).flat().filter(Boolean).filter((e) => e[c] !== o.NA), u = R(n);
+	return t && l.forEach((e) => {
+		let t = I(e, u);
+		if (t !== !1) {
+			let n = {
+				message: L(e, t),
+				type: t.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({
+			i.push(n);
+		} else Object.hasOwn(e, "LINE_BREAKS") ? e.LINE_BREAKS === !0 && (a = !0) : r(u, e.PATTERN) && (a = !0);
+	}), t && !a && i.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;
+		type: s.NO_LINE_BREAKS_FLAGS
+	}), i;
 }
-function cloneEmptyGroups(i) {
-	let P = {};
-	return forEach_default(keys_default(i), (F) => {
-		let I = i[F];
+function M(e) {
+	let t = {};
+	return Object.keys(e).forEach((n) => {
+		let r = e[n];
 		/* istanbul ignore else */
-		if (isArray_default(I)) P[F] = [];
+		if (Array.isArray(r)) t[n] = [];
 		else throw Error("non exhaustive match");
-	}), P;
+	}), t;
 }
-function isCustomPattern(N) {
-	let P = N.PATTERN;
+function N(e) {
+	let t = 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 (t instanceof RegExp) return !1;
+	if (typeof t == "function" || Object.hasOwn(t, "exec")) return !0;
+	if (typeof t == "string") return !1;
 	throw Error("non exhaustive match");
 }
-function isShortPattern(i) {
-	return isString_default(i) && i.length === 1 ? i.charCodeAt(0) : !1;
+function P(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;
+var F = {
+	test: function(e) {
+		let t = e.length;
+		for (let n = this.lastIndex; n < t; n++) {
+			let t = e.charCodeAt(n);
+			if (t === 10) return this.lastIndex = n + 1, !0;
+			if (t === 13) return e.charCodeAt(n + 1) === 10 ? this.lastIndex = n + 2 : this.lastIndex = n + 1, !0;
 		}
 		return !1;
 	},
 	lastIndex: 0
 };
-function checkLineBreaksIssues(i, N) {
-	if (has_default(i, "LINE_BREAKS")) return !1;
-	if (isRegExp_default(i.PATTERN)) {
+function I(e, t) {
+	if (Object.hasOwn(e, "LINE_BREAKS")) return !1;
+	if (e.PATTERN instanceof RegExp) {
 		try {
-			canMatchCharCode(N, i.PATTERN);
-		} catch (i) {
+			r(t, 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
+				issue: s.IDENTIFY_TERMINATOR,
+				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 (N(e)) return { issue: s.CUSTOM_LINE_BREAK };
 	else throw Error("non exhaustive match");
 }
-function buildLineBreakIssueMessage(i, N) {
+function L(e, t) {
 	/* 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 (t.issue === s.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: ${t.errMsg}.\n	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#IDENTIFY_TERMINATOR`;
+	if (t.issue === s.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 R(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 z(e, t, n) {
+	e[t] === void 0 ? e[t] = [n] : e[t].push(n);
 }
-const minOptimizationVal = 256;
-var charCodeToOptimizedIdxMap = [];
-function charCodeToOptimizedIndex(i) {
-	return i < 256 ? i : charCodeToOptimizedIdxMap[i];
+var B = [];
+function V(e) {
+	return e < 256 ? e : B[e];
 }
-function initCharCodeToOptimizedIndexMap() {
-	if (isEmpty_default(charCodeToOptimizedIdxMap)) {
-		charCodeToOptimizedIdxMap = Array(65536);
-		for (let i = 0; i < 65536; i++) charCodeToOptimizedIdxMap[i] = i > 255 ? 255 + ~~(i / 255) : i;
+function H() {
+	if (B.length === 0) {
+		B = Array(65536);
+		for (let e = 0; e < 65536; e++) B[e] = e > 255 ? 255 + ~~(e / 255) : e;
 	}
 }
-export { DEFAULT_MODE, LineTerminatorOptimizedTester, analyzeTokenTypes, charCodeToOptimizedIndex, cloneEmptyGroups, minOptimizationVal, performRuntimeChecks, performWarningRuntimeChecks, validatePatterns };
+//#endregion
+export { l as DEFAULT_MODE, F as LineTerminatorOptimizedTester, d as analyzeTokenTypes, V as charCodeToOptimizedIndex, M as cloneEmptyGroups, A as performRuntimeChecks, j as performWarningRuntimeChecks, f as validatePatterns };