@marimo-team/islands 0.23.2-dev7 → 0.23.2-dev70

package/dist/{chunk-TCCFYFTB-Clbl-fTg.js → chunk-TCCFYFTB-d3HOqL2I.js}

@@ -3,177 +3,18 @@ var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { en
 var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
 var _a, _b, _c, _d, _e;
 import { i as __reExport, r as __export, s as __toESM, t as __commonJSMin } from "./chunk-BNovOVIE.js";
-import { A as _baseAssignValue_default, B as isArray_default, C as isArrayLike_default, D as _copyObject_default, H as _baseGetTag_default, L as isFunction_default, O as _assignValue_default, R as identity_default, S as _isIterateeCall_default, T as _baseRest_default, V as isObjectLike_default, _ as _baseUnary_default, b as _isPrototype_default, g as _nodeUtil_default, t as isArrayLikeObject_default, x as _createAssigner_default, z as isObject_default } from "./isArrayLikeObject-LXbTYiBa.js";
-import { d as _arrayMap_default, r as _baseFlatten_default } from "./hasIn-DnfJcYpY.js";
-import { r as flatten_default, t as _basePickBy_default } from "./_basePickBy-Sow3pJjS.js";
-import { a as has_default, c as find_default, d as toInteger_default, i as isString_default, l as last_default, o as map_default, t as min_default, u as defaults_default } from "./min-Ds3gG0Ff.js";
-import { t as isEmpty_default } from "./isEmpty-B7FX9wKt.js";
-import { S as _baseIndexOf_default, a as filter_default, b as keys_default, f as _baseIteratee_default, g as _SetCache_default, h as _arraySome_default, i as values_default, l as _arrayIncludesWith_default, m as _cacheHas_default, n as reduce_default, o as _baseFilter_default, r as isUndefined_default, s as forEach_default, t as _baseUniq_default, u as _baseEach_default, v as _getAllKeysIn_default, w as noop_default, x as _arrayIncludes_default, y as _arrayFilter_default } from "./_baseUniq-C87CckHL.js";
-import { t as clone_default } from "./clone-DZFQCtFJ.js";
-import { i as init_main, n as Position, r as Range, t as require_main } from "./main-XimWhSi_.js";
-var hasOwnProperty$1 = Object.prototype.hasOwnProperty, assign_default = _createAssigner_default(function(e5, m) {
-  if (_isPrototype_default(m) || isArrayLike_default(m)) {
-    _copyObject_default(m, keys_default(m), e5);
-    return;
-  }
-  for (var h in m) hasOwnProperty$1.call(m, h) && _assignValue_default(e5, h, m[h]);
-});
-function baseSlice(e5, m, h) {
-  var g = -1, _ = e5.length;
-  m < 0 && (m = -m > _ ? 0 : _ + m), h = h > _ ? _ : h, h < 0 && (h += _), _ = m > h ? 0 : h - m >>> 0, m >>>= 0;
-  for (var v = Array(_); ++g < _; ) v[g] = e5[g + m];
-  return v;
-}
-var _baseSlice_default = baseSlice;
-function compact(e5) {
-  for (var m = -1, h = e5 == null ? 0 : e5.length, g = 0, _ = []; ++m < h; ) {
-    var v = e5[m];
-    v && (_[g++] = v);
-  }
-  return _;
-}
-var compact_default = compact;
-function arrayAggregator(e5, m, h, g) {
-  for (var _ = -1, v = e5 == null ? 0 : e5.length; ++_ < v; ) {
-    var y = e5[_];
-    m(g, y, h(y), e5);
-  }
-  return g;
-}
-var _arrayAggregator_default = arrayAggregator;
-function baseAggregator(e5, m, h, g) {
-  return _baseEach_default(e5, function(e6, _, v) {
-    m(g, e6, h(e6), v);
-  }), g;
-}
-var _baseAggregator_default = baseAggregator;
-function createAggregator(e5, m) {
-  return function(h, g) {
-    var _ = isArray_default(h) ? _arrayAggregator_default : _baseAggregator_default, y = m ? m() : {};
-    return _(h, e5, _baseIteratee_default(g, 2), y);
-  };
-}
-var _createAggregator_default = createAggregator, LARGE_ARRAY_SIZE = 200;
-function baseDifference(e5, m, h, g) {
-  var _ = -1, v = _arrayIncludes_default, y = true, b = e5.length, x = [], S = m.length;
-  if (!b) return x;
-  h && (m = _arrayMap_default(m, _baseUnary_default(h))), g ? (v = _arrayIncludesWith_default, y = false) : m.length >= LARGE_ARRAY_SIZE && (v = _cacheHas_default, y = false, m = new _SetCache_default(m));
-  outer: for (; ++_ < b; ) {
-    var C = e5[_], w = h == null ? C : h(C);
-    if (C = g || C !== 0 ? C : 0, y && w === w) {
-      for (var T = S; T--; ) if (m[T] === w) continue outer;
-      x.push(C);
-    } else v(m, w, g) || x.push(C);
-  }
-  return x;
-}
-var _baseDifference_default = baseDifference, difference_default = _baseRest_default(function(e5, m) {
-  return isArrayLikeObject_default(e5) ? _baseDifference_default(e5, _baseFlatten_default(m, 1, isArrayLikeObject_default, true)) : [];
-});
-function drop(e5, m, h) {
-  var g = e5 == null ? 0 : e5.length;
-  return g ? (m = h || m === void 0 ? 1 : toInteger_default(m), _baseSlice_default(e5, m < 0 ? 0 : m, g)) : [];
-}
-var drop_default = drop;
-function dropRight(e5, m, h) {
-  var g = e5 == null ? 0 : e5.length;
-  return g ? (m = h || m === void 0 ? 1 : toInteger_default(m), m = g - m, _baseSlice_default(e5, 0, m < 0 ? 0 : m)) : [];
-}
-var dropRight_default = dropRight;
-function arrayEvery(e5, m) {
-  for (var h = -1, g = e5 == null ? 0 : e5.length; ++h < g; ) if (!m(e5[h], h, e5)) return false;
-  return true;
-}
-var _arrayEvery_default = arrayEvery;
-function baseEvery(e5, m) {
-  var h = true;
-  return _baseEach_default(e5, function(e6, g, _) {
-    return h = !!m(e6, g, _), h;
-  }), h;
-}
-var _baseEvery_default = baseEvery;
-function every(e5, m, h) {
-  var g = isArray_default(e5) ? _arrayEvery_default : _baseEvery_default;
-  return h && _isIterateeCall_default(e5, m, h) && (m = void 0), g(e5, _baseIteratee_default(m, 3));
-}
-var every_default = every;
-function head(e5) {
-  return e5 && e5.length ? e5[0] : void 0;
-}
-var head_default = head;
-function flatMap(e5, m) {
-  return _baseFlatten_default(map_default(e5, m), 1);
-}
-var flatMap_default = flatMap, hasOwnProperty = Object.prototype.hasOwnProperty, groupBy_default = _createAggregator_default(function(e5, m, h) {
-  hasOwnProperty.call(e5, h) ? e5[h].push(m) : _baseAssignValue_default(e5, h, [m]);
-}), nativeMax$1 = Math.max;
-function includes(e5, m, h, g) {
-  e5 = isArrayLike_default(e5) ? e5 : values_default(e5), h = h && !g ? toInteger_default(h) : 0;
-  var _ = e5.length;
-  return h < 0 && (h = nativeMax$1(_ + h, 0)), isString_default(e5) ? h <= _ && e5.indexOf(m, h) > -1 : !!_ && _baseIndexOf_default(e5, m, h) > -1;
-}
-var includes_default = includes, nativeMax = Math.max;
-function indexOf(e5, m, h) {
-  var g = e5 == null ? 0 : e5.length;
-  if (!g) return -1;
-  var _ = h == null ? 0 : toInteger_default(h);
-  return _ < 0 && (_ = nativeMax(g + _, 0)), _baseIndexOf_default(e5, m, _);
-}
-var indexOf_default = indexOf, regexpTag = "[object RegExp]";
-function baseIsRegExp(e5) {
-  return isObjectLike_default(e5) && _baseGetTag_default(e5) == regexpTag;
-}
-var _baseIsRegExp_default = baseIsRegExp, nodeIsRegExp = _nodeUtil_default && _nodeUtil_default.isRegExp, isRegExp_default = nodeIsRegExp ? _baseUnary_default(nodeIsRegExp) : _baseIsRegExp_default, FUNC_ERROR_TEXT = "Expected a function";
-function negate(e5) {
-  if (typeof e5 != "function") throw TypeError(FUNC_ERROR_TEXT);
-  return function() {
-    var m = arguments;
-    switch (m.length) {
-      case 0:
-        return !e5.call(this);
-      case 1:
-        return !e5.call(this, m[0]);
-      case 2:
-        return !e5.call(this, m[0], m[1]);
-      case 3:
-        return !e5.call(this, m[0], m[1], m[2]);
-    }
-    return !e5.apply(this, m);
-  };
-}
-var negate_default = negate;
-function pickBy(e5, m) {
-  if (e5 == null) return {};
-  var h = _arrayMap_default(_getAllKeysIn_default(e5), function(e6) {
-    return [e6];
-  });
-  return m = _baseIteratee_default(m), _basePickBy_default(e5, h, function(e6, h2) {
-    return m(e6, h2[0]);
-  });
-}
-var pickBy_default = pickBy;
-function reject(e5, m) {
-  return (isArray_default(e5) ? _arrayFilter_default : _baseFilter_default)(e5, negate_default(_baseIteratee_default(m, 3)));
-}
-var reject_default = reject;
-function baseSome(e5, m) {
-  var h;
-  return _baseEach_default(e5, function(e6, g, _) {
-    return h = m(e6, g, _), !h;
-  }), !!h;
-}
-var _baseSome_default = baseSome;
-function some(e5, m, h) {
-  var g = isArray_default(e5) ? _arraySome_default : _baseSome_default;
-  return h && _isIterateeCall_default(e5, m, h) && (m = void 0), g(e5, _baseIteratee_default(m, 3));
-}
-var some_default = some;
-function uniq(e5) {
-  return e5 && e5.length ? _baseUniq_default(e5) : [];
-}
-var uniq_default = uniq;
+import { r as _baseFlatten_default$1 } from "./hasIn-COs6vImh.js";
+import { t as isEmpty_default } from "./isEmpty-Dd8mx_WL.js";
+import { c as _baseIteratee_default$1, i as forEach_default, n as reduce_default, r as filter_default, t as _baseUniq_default$1 } from "./_baseUniq-CxZRxRRo.js";
+import { t as flatten_default } from "./flatten-CzBvFdvC.js";
+import { i as map_default, t as min_default } from "./min-BNz2lZfk.js";
+import { i as init_main, n as Position, r as Range, t as require_main } from "./main-CThhXnXU.js";
+function flatMap$1(e5, m) {
+  return _baseFlatten_default$1(map_default(e5, m), 1);
+}
+var flatMap_default = flatMap$1;
 function uniqBy(e5, m) {
-  return e5 && e5.length ? _baseUniq_default(e5, _baseIteratee_default(m, 2)) : [];
+  return e5 && e5.length ? _baseUniq_default$1(e5, _baseIteratee_default$1(m, 2)) : [];
 }
 var uniqBy_default = uniqBy;
 function isAstNode(e5) {
@@ -308,7 +149,7 @@ var StreamImpl = class e {
   join(e5 = ",") {
     let m = this.iterator(), h = "", g, _ = false;
     do
-      g = m.next(), g.done || (_ && (h += e5), h += toString(g.value)), _ = true;
+      g = m.next(), g.done || (_ && (h += e5), h += toString$1(g.value)), _ = true;
     while (!g.done);
     return h;
   }
@@ -483,7 +324,7 @@ var StreamImpl = class e {
     });
   }
 };
-function toString(e5) {
+function toString$1(e5) {
   return typeof e5 == "string" ? e5 : e5 === void 0 ? "undefined" : typeof e5.toString == "function" ? e5.toString() : Object.prototype.toString.call(e5);
 }
 function isIterable(e5) {
@@ -3226,6 +3067,1372 @@ function createGrammarConfig(e5) {
     nameRegexp: DefaultNameRegexp
   };
 }
+var _freeGlobal_default = typeof global == "object" && global && global.Object === Object && global, freeSelf = typeof self == "object" && self && self.Object === Object && self, _root_default = _freeGlobal_default || freeSelf || Function("return this")(), _Symbol_default = _root_default.Symbol, objectProto$4 = Object.prototype, hasOwnProperty$16 = objectProto$4.hasOwnProperty, nativeObjectToString$1 = objectProto$4.toString, symToStringTag$1 = _Symbol_default ? _Symbol_default.toStringTag : void 0;
+function getRawTag(e5) {
+  var m = hasOwnProperty$16.call(e5, symToStringTag$1), h = e5[symToStringTag$1];
+  try {
+    e5[symToStringTag$1] = void 0;
+    var g = true;
+  } catch {
+  }
+  var _ = nativeObjectToString$1.call(e5);
+  return g && (m ? e5[symToStringTag$1] = h : delete e5[symToStringTag$1]), _;
+}
+var _getRawTag_default = getRawTag, nativeObjectToString = Object.prototype.toString;
+function objectToString(e5) {
+  return nativeObjectToString.call(e5);
+}
+var _objectToString_default = objectToString, nullTag = "[object Null]", undefinedTag = "[object Undefined]", symToStringTag = _Symbol_default ? _Symbol_default.toStringTag : void 0;
+function baseGetTag(e5) {
+  return e5 == null ? e5 === void 0 ? undefinedTag : nullTag : symToStringTag && symToStringTag in Object(e5) ? _getRawTag_default(e5) : _objectToString_default(e5);
+}
+var _baseGetTag_default = baseGetTag;
+function isObjectLike(e5) {
+  return typeof e5 == "object" && !!e5;
+}
+var isObjectLike_default = isObjectLike, symbolTag$3 = "[object Symbol]";
+function isSymbol(e5) {
+  return typeof e5 == "symbol" || isObjectLike_default(e5) && _baseGetTag_default(e5) == symbolTag$3;
+}
+var isSymbol_default = isSymbol;
+function arrayMap(e5, m) {
+  for (var h = -1, g = e5 == null ? 0 : e5.length, _ = Array(g); ++h < g; ) _[h] = m(e5[h], h, e5);
+  return _;
+}
+var _arrayMap_default = arrayMap, isArray_default = Array.isArray, INFINITY$2 = Infinity, symbolProto$2 = _Symbol_default ? _Symbol_default.prototype : void 0, symbolToString = symbolProto$2 ? symbolProto$2.toString : void 0;
+function baseToString(e5) {
+  if (typeof e5 == "string") return e5;
+  if (isArray_default(e5)) return _arrayMap_default(e5, baseToString) + "";
+  if (isSymbol_default(e5)) return symbolToString ? symbolToString.call(e5) : "";
+  var m = e5 + "";
+  return m == "0" && 1 / e5 == -INFINITY$2 ? "-0" : m;
+}
+var _baseToString_default = baseToString, reWhitespace = /\s/;
+function trimmedEndIndex(e5) {
+  for (var m = e5.length; m-- && reWhitespace.test(e5.charAt(m)); ) ;
+  return m;
+}
+var _trimmedEndIndex_default = trimmedEndIndex, reTrimStart = /^\s+/;
+function baseTrim(e5) {
+  return e5 && e5.slice(0, _trimmedEndIndex_default(e5) + 1).replace(reTrimStart, "");
+}
+var _baseTrim_default = baseTrim;
+function isObject(e5) {
+  var m = typeof e5;
+  return e5 != null && (m == "object" || m == "function");
+}
+var isObject_default = isObject, NAN = NaN, reIsBadHex = /^[-+]0x[0-9a-f]+$/i, reIsBinary = /^0b[01]+$/i, reIsOctal = /^0o[0-7]+$/i, freeParseInt = parseInt;
+function toNumber(e5) {
+  if (typeof e5 == "number") return e5;
+  if (isSymbol_default(e5)) return NAN;
+  if (isObject_default(e5)) {
+    var m = typeof e5.valueOf == "function" ? e5.valueOf() : e5;
+    e5 = isObject_default(m) ? m + "" : m;
+  }
+  if (typeof e5 != "string") return e5 === 0 ? e5 : +e5;
+  e5 = _baseTrim_default(e5);
+  var h = reIsBinary.test(e5);
+  return h || reIsOctal.test(e5) ? freeParseInt(e5.slice(2), h ? 2 : 8) : reIsBadHex.test(e5) ? NAN : +e5;
+}
+var toNumber_default = toNumber, INFINITY$1 = Infinity, MAX_INTEGER = 17976931348623157e292;
+function toFinite(e5) {
+  return e5 ? (e5 = toNumber_default(e5), e5 === INFINITY$1 || e5 === -INFINITY$1 ? (e5 < 0 ? -1 : 1) * MAX_INTEGER : e5 === e5 ? e5 : 0) : e5 === 0 ? e5 : 0;
+}
+var toFinite_default = toFinite;
+function toInteger(e5) {
+  var m = toFinite_default(e5), h = m % 1;
+  return m === m ? h ? m - h : m : 0;
+}
+var toInteger_default = toInteger;
+function identity(e5) {
+  return e5;
+}
+var identity_default = identity, asyncTag = "[object AsyncFunction]", funcTag$2 = "[object Function]", genTag$1 = "[object GeneratorFunction]", proxyTag = "[object Proxy]";
+function isFunction(e5) {
+  if (!isObject_default(e5)) return false;
+  var m = _baseGetTag_default(e5);
+  return m == funcTag$2 || m == genTag$1 || m == asyncTag || m == proxyTag;
+}
+var isFunction_default = isFunction, _coreJsData_default = _root_default["__core-js_shared__"], maskSrcKey = (function() {
+  var e5 = /[^.]+$/.exec(_coreJsData_default && _coreJsData_default.keys && _coreJsData_default.keys.IE_PROTO || "");
+  return e5 ? "Symbol(src)_1." + e5 : "";
+})();
+function isMasked(e5) {
+  return !!maskSrcKey && maskSrcKey in e5;
+}
+var _isMasked_default = isMasked, funcToString$1 = Function.prototype.toString;
+function toSource(e5) {
+  if (e5 != null) {
+    try {
+      return funcToString$1.call(e5);
+    } catch {
+    }
+    try {
+      return e5 + "";
+    } catch {
+    }
+  }
+  return "";
+}
+var _toSource_default = toSource, reRegExpChar = /[\\^$.*+?()[\]{}|]/g, reIsHostCtor = /^\[object .+?Constructor\]$/, funcProto = Function.prototype, objectProto$3 = Object.prototype, funcToString = funcProto.toString, hasOwnProperty$15 = objectProto$3.hasOwnProperty, reIsNative = RegExp("^" + funcToString.call(hasOwnProperty$15).replace(reRegExpChar, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$");
+function baseIsNative(e5) {
+  return !isObject_default(e5) || _isMasked_default(e5) ? false : (isFunction_default(e5) ? reIsNative : reIsHostCtor).test(_toSource_default(e5));
+}
+var _baseIsNative_default = baseIsNative;
+function getValue(e5, m) {
+  return e5 == null ? void 0 : e5[m];
+}
+var _getValue_default = getValue;
+function getNative(e5, m) {
+  var h = _getValue_default(e5, m);
+  return _baseIsNative_default(h) ? h : void 0;
+}
+var _getNative_default = getNative, _WeakMap_default = _getNative_default(_root_default, "WeakMap"), objectCreate = Object.create, _baseCreate_default = /* @__PURE__ */ (function() {
+  function e5() {
+  }
+  return function(m) {
+    if (!isObject_default(m)) return {};
+    if (objectCreate) return objectCreate(m);
+    e5.prototype = m;
+    var h = new e5();
+    return e5.prototype = void 0, h;
+  };
+})();
+function apply(e5, m, h) {
+  switch (h.length) {
+    case 0:
+      return e5.call(m);
+    case 1:
+      return e5.call(m, h[0]);
+    case 2:
+      return e5.call(m, h[0], h[1]);
+    case 3:
+      return e5.call(m, h[0], h[1], h[2]);
+  }
+  return e5.apply(m, h);
+}
+var _apply_default = apply;
+function noop() {
+}
+var noop_default = noop;
+function copyArray(e5, m) {
+  var h = -1, g = e5.length;
+  for (m || (m = Array(g)); ++h < g; ) m[h] = e5[h];
+  return m;
+}
+var _copyArray_default = copyArray, HOT_COUNT = 800, HOT_SPAN = 16, nativeNow = Date.now;
+function shortOut(e5) {
+  var m = 0, h = 0;
+  return function() {
+    var g = nativeNow(), _ = HOT_SPAN - (g - h);
+    if (h = g, _ > 0) {
+      if (++m >= HOT_COUNT) return arguments[0];
+    } else m = 0;
+    return e5.apply(void 0, arguments);
+  };
+}
+var _shortOut_default = shortOut;
+function constant(e5) {
+  return function() {
+    return e5;
+  };
+}
+var constant_default = constant, _defineProperty_default = (function() {
+  try {
+    var e5 = _getNative_default(Object, "defineProperty");
+    return e5({}, "", {}), e5;
+  } catch {
+  }
+})(), _setToString_default = _shortOut_default(_defineProperty_default ? function(e5, m) {
+  return _defineProperty_default(e5, "toString", {
+    configurable: true,
+    enumerable: false,
+    value: constant_default(m),
+    writable: true
+  });
+} : identity_default);
+function arrayEach(e5, m) {
+  for (var h = -1, g = e5 == null ? 0 : e5.length; ++h < g && m(e5[h], h, e5) !== false; ) ;
+  return e5;
+}
+var _arrayEach_default = arrayEach;
+function baseFindIndex(e5, m, h, g) {
+  for (var _ = e5.length, v = h + (g ? 1 : -1); g ? v-- : ++v < _; ) if (m(e5[v], v, e5)) return v;
+  return -1;
+}
+var _baseFindIndex_default = baseFindIndex;
+function baseIsNaN(e5) {
+  return e5 !== e5;
+}
+var _baseIsNaN_default = baseIsNaN;
+function strictIndexOf(e5, m, h) {
+  for (var g = h - 1, _ = e5.length; ++g < _; ) if (e5[g] === m) return g;
+  return -1;
+}
+var _strictIndexOf_default = strictIndexOf;
+function baseIndexOf(e5, m, h) {
+  return m === m ? _strictIndexOf_default(e5, m, h) : _baseFindIndex_default(e5, _baseIsNaN_default, h);
+}
+var _baseIndexOf_default = baseIndexOf;
+function arrayIncludes(e5, m) {
+  return !!(e5 != null && e5.length) && _baseIndexOf_default(e5, m, 0) > -1;
+}
+var _arrayIncludes_default = arrayIncludes, MAX_SAFE_INTEGER$1 = 9007199254740991, reIsUint = /^(?:0|[1-9]\d*)$/;
+function isIndex(e5, m) {
+  var h = typeof e5;
+  return m ?? (m = MAX_SAFE_INTEGER$1), !!m && (h == "number" || h != "symbol" && reIsUint.test(e5)) && e5 > -1 && e5 % 1 == 0 && e5 < m;
+}
+var _isIndex_default = isIndex;
+function baseAssignValue(e5, m, h) {
+  m == "__proto__" && _defineProperty_default ? _defineProperty_default(e5, m, {
+    configurable: true,
+    enumerable: true,
+    value: h,
+    writable: true
+  }) : e5[m] = h;
+}
+var _baseAssignValue_default = baseAssignValue;
+function eq(e5, m) {
+  return e5 === m || e5 !== e5 && m !== m;
+}
+var eq_default = eq, hasOwnProperty$14 = Object.prototype.hasOwnProperty;
+function assignValue(e5, m, h) {
+  var g = e5[m];
+  (!(hasOwnProperty$14.call(e5, m) && eq_default(g, h)) || h === void 0 && !(m in e5)) && _baseAssignValue_default(e5, m, h);
+}
+var _assignValue_default = assignValue;
+function copyObject(e5, m, h, g) {
+  var _ = !h;
+  h || (h = {});
+  for (var v = -1, y = m.length; ++v < y; ) {
+    var b = m[v], x = g ? g(h[b], e5[b], b, h, e5) : void 0;
+    x === void 0 && (x = e5[b]), _ ? _baseAssignValue_default(h, b, x) : _assignValue_default(h, b, x);
+  }
+  return h;
+}
+var _copyObject_default = copyObject, nativeMax$3 = Math.max;
+function overRest(e5, m, h) {
+  return m = nativeMax$3(m === void 0 ? e5.length - 1 : m, 0), function() {
+    for (var g = arguments, _ = -1, v = nativeMax$3(g.length - m, 0), y = Array(v); ++_ < v; ) y[_] = g[m + _];
+    _ = -1;
+    for (var b = Array(m + 1); ++_ < m; ) b[_] = g[_];
+    return b[m] = h(y), _apply_default(e5, this, b);
+  };
+}
+var _overRest_default = overRest;
+function baseRest(e5, m) {
+  return _setToString_default(_overRest_default(e5, m, identity_default), e5 + "");
+}
+var _baseRest_default = baseRest, MAX_SAFE_INTEGER = 9007199254740991;
+function isLength(e5) {
+  return typeof e5 == "number" && e5 > -1 && e5 % 1 == 0 && e5 <= MAX_SAFE_INTEGER;
+}
+var isLength_default = isLength;
+function isArrayLike(e5) {
+  return e5 != null && isLength_default(e5.length) && !isFunction_default(e5);
+}
+var isArrayLike_default = isArrayLike;
+function isIterateeCall(e5, m, h) {
+  if (!isObject_default(h)) return false;
+  var g = typeof m;
+  return (g == "number" ? isArrayLike_default(h) && _isIndex_default(m, h.length) : g == "string" && m in h) ? eq_default(h[m], e5) : false;
+}
+var _isIterateeCall_default = isIterateeCall;
+function createAssigner(e5) {
+  return _baseRest_default(function(m, h) {
+    var g = -1, _ = h.length, v = _ > 1 ? h[_ - 1] : void 0, y = _ > 2 ? h[2] : void 0;
+    for (v = e5.length > 3 && typeof v == "function" ? (_--, v) : void 0, y && _isIterateeCall_default(h[0], h[1], y) && (v = _ < 3 ? void 0 : v, _ = 1), m = Object(m); ++g < _; ) {
+      var b = h[g];
+      b && e5(m, b, g, v);
+    }
+    return m;
+  });
+}
+var _createAssigner_default = createAssigner, objectProto$2 = Object.prototype;
+function isPrototype(e5) {
+  var m = e5 && e5.constructor;
+  return e5 === (typeof m == "function" && m.prototype || objectProto$2);
+}
+var _isPrototype_default = isPrototype;
+function baseTimes(e5, m) {
+  for (var h = -1, g = Array(e5); ++h < e5; ) g[h] = m(h);
+  return g;
+}
+var _baseTimes_default = baseTimes, argsTag$3 = "[object Arguments]";
+function baseIsArguments(e5) {
+  return isObjectLike_default(e5) && _baseGetTag_default(e5) == argsTag$3;
+}
+var _baseIsArguments_default = baseIsArguments, objectProto$1 = Object.prototype, hasOwnProperty$13 = objectProto$1.hasOwnProperty, propertyIsEnumerable$1 = objectProto$1.propertyIsEnumerable, isArguments_default = _baseIsArguments_default(/* @__PURE__ */ (function() {
+  return arguments;
+})()) ? _baseIsArguments_default : function(e5) {
+  return isObjectLike_default(e5) && hasOwnProperty$13.call(e5, "callee") && !propertyIsEnumerable$1.call(e5, "callee");
+};
+function stubFalse() {
+  return false;
+}
+var stubFalse_default = stubFalse, freeExports$2 = typeof exports == "object" && exports && !exports.nodeType && exports, freeModule$2 = freeExports$2 && typeof module == "object" && module && !module.nodeType && module, Buffer$1 = freeModule$2 && freeModule$2.exports === freeExports$2 ? _root_default.Buffer : void 0, isBuffer_default = (Buffer$1 ? Buffer$1.isBuffer : void 0) || stubFalse_default, argsTag$2 = "[object Arguments]", arrayTag$2 = "[object Array]", boolTag$3 = "[object Boolean]", dateTag$3 = "[object Date]", errorTag$2 = "[object Error]", funcTag$1 = "[object Function]", mapTag$6 = "[object Map]", numberTag$3 = "[object Number]", objectTag$3 = "[object Object]", regexpTag$4 = "[object RegExp]", setTag$6 = "[object Set]", stringTag$4 = "[object String]", weakMapTag$2 = "[object WeakMap]", arrayBufferTag$3 = "[object ArrayBuffer]", dataViewTag$4 = "[object DataView]", float32Tag$2 = "[object Float32Array]", float64Tag$2 = "[object Float64Array]", int8Tag$2 = "[object Int8Array]", int16Tag$2 = "[object Int16Array]", int32Tag$2 = "[object Int32Array]", uint8Tag$2 = "[object Uint8Array]", uint8ClampedTag$2 = "[object Uint8ClampedArray]", uint16Tag$2 = "[object Uint16Array]", uint32Tag$2 = "[object Uint32Array]", typedArrayTags = {};
+typedArrayTags[float32Tag$2] = typedArrayTags[float64Tag$2] = typedArrayTags[int8Tag$2] = typedArrayTags[int16Tag$2] = typedArrayTags[int32Tag$2] = typedArrayTags[uint8Tag$2] = typedArrayTags[uint8ClampedTag$2] = typedArrayTags[uint16Tag$2] = typedArrayTags[uint32Tag$2] = true, typedArrayTags[argsTag$2] = typedArrayTags[arrayTag$2] = typedArrayTags[arrayBufferTag$3] = typedArrayTags[boolTag$3] = typedArrayTags[dataViewTag$4] = typedArrayTags[dateTag$3] = typedArrayTags[errorTag$2] = typedArrayTags[funcTag$1] = typedArrayTags[mapTag$6] = typedArrayTags[numberTag$3] = typedArrayTags[objectTag$3] = typedArrayTags[regexpTag$4] = typedArrayTags[setTag$6] = typedArrayTags[stringTag$4] = typedArrayTags[weakMapTag$2] = false;
+function baseIsTypedArray(e5) {
+  return isObjectLike_default(e5) && isLength_default(e5.length) && !!typedArrayTags[_baseGetTag_default(e5)];
+}
+var _baseIsTypedArray_default = baseIsTypedArray;
+function baseUnary(e5) {
+  return function(m) {
+    return e5(m);
+  };
+}
+var _baseUnary_default = baseUnary, freeExports$1 = typeof exports == "object" && exports && !exports.nodeType && exports, freeModule$1 = freeExports$1 && typeof module == "object" && module && !module.nodeType && module, freeProcess = freeModule$1 && freeModule$1.exports === freeExports$1 && _freeGlobal_default.process, _nodeUtil_default = (function() {
+  try {
+    return freeModule$1 && freeModule$1.require && freeModule$1.require("util").types || freeProcess && freeProcess.binding && freeProcess.binding("util");
+  } catch {
+  }
+})(), nodeIsTypedArray = _nodeUtil_default && _nodeUtil_default.isTypedArray, isTypedArray_default = nodeIsTypedArray ? _baseUnary_default(nodeIsTypedArray) : _baseIsTypedArray_default, hasOwnProperty$12 = Object.prototype.hasOwnProperty;
+function arrayLikeKeys(e5, m) {
+  var h = isArray_default(e5), g = !h && isArguments_default(e5), _ = !h && !g && isBuffer_default(e5), v = !h && !g && !_ && isTypedArray_default(e5), y = h || g || _ || v, b = y ? _baseTimes_default(e5.length, String) : [], x = b.length;
+  for (var S in e5) (m || hasOwnProperty$12.call(e5, S)) && !(y && (S == "length" || _ && (S == "offset" || S == "parent") || v && (S == "buffer" || S == "byteLength" || S == "byteOffset") || _isIndex_default(S, x))) && b.push(S);
+  return b;
+}
+var _arrayLikeKeys_default = arrayLikeKeys;
+function overArg(e5, m) {
+  return function(h) {
+    return e5(m(h));
+  };
+}
+var _overArg_default = overArg, _nativeKeys_default = _overArg_default(Object.keys, Object), hasOwnProperty$11 = Object.prototype.hasOwnProperty;
+function baseKeys(e5) {
+  if (!_isPrototype_default(e5)) return _nativeKeys_default(e5);
+  var m = [];
+  for (var h in Object(e5)) hasOwnProperty$11.call(e5, h) && h != "constructor" && m.push(h);
+  return m;
+}
+var _baseKeys_default = baseKeys;
+function keys(e5) {
+  return isArrayLike_default(e5) ? _arrayLikeKeys_default(e5) : _baseKeys_default(e5);
+}
+var keys_default = keys, hasOwnProperty$10 = Object.prototype.hasOwnProperty, assign_default = _createAssigner_default(function(e5, m) {
+  if (_isPrototype_default(m) || isArrayLike_default(m)) {
+    _copyObject_default(m, keys_default(m), e5);
+    return;
+  }
+  for (var h in m) hasOwnProperty$10.call(m, h) && _assignValue_default(e5, h, m[h]);
+});
+function nativeKeysIn(e5) {
+  var m = [];
+  if (e5 != null) for (var h in Object(e5)) m.push(h);
+  return m;
+}
+var _nativeKeysIn_default = nativeKeysIn, hasOwnProperty$9 = Object.prototype.hasOwnProperty;
+function baseKeysIn(e5) {
+  if (!isObject_default(e5)) return _nativeKeysIn_default(e5);
+  var m = _isPrototype_default(e5), h = [];
+  for (var g in e5) g == "constructor" && (m || !hasOwnProperty$9.call(e5, g)) || h.push(g);
+  return h;
+}
+var _baseKeysIn_default = baseKeysIn;
+function keysIn(e5) {
+  return isArrayLike_default(e5) ? _arrayLikeKeys_default(e5, true) : _baseKeysIn_default(e5);
+}
+var keysIn_default = keysIn, reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, reIsPlainProp = /^\w*$/;
+function isKey(e5, m) {
+  if (isArray_default(e5)) return false;
+  var h = typeof e5;
+  return h == "number" || h == "symbol" || h == "boolean" || e5 == null || isSymbol_default(e5) ? true : reIsPlainProp.test(e5) || !reIsDeepProp.test(e5) || m != null && e5 in Object(m);
+}
+var _isKey_default = isKey, _nativeCreate_default = _getNative_default(Object, "create");
+function hashClear() {
+  this.__data__ = _nativeCreate_default ? _nativeCreate_default(null) : {}, this.size = 0;
+}
+var _hashClear_default = hashClear;
+function hashDelete(e5) {
+  var m = this.has(e5) && delete this.__data__[e5];
+  return this.size -= m ? 1 : 0, m;
+}
+var _hashDelete_default = hashDelete, HASH_UNDEFINED$2 = "__lodash_hash_undefined__", hasOwnProperty$8 = Object.prototype.hasOwnProperty;
+function hashGet(e5) {
+  var m = this.__data__;
+  if (_nativeCreate_default) {
+    var h = m[e5];
+    return h === HASH_UNDEFINED$2 ? void 0 : h;
+  }
+  return hasOwnProperty$8.call(m, e5) ? m[e5] : void 0;
+}
+var _hashGet_default = hashGet, hasOwnProperty$7 = Object.prototype.hasOwnProperty;
+function hashHas(e5) {
+  var m = this.__data__;
+  return _nativeCreate_default ? m[e5] !== void 0 : hasOwnProperty$7.call(m, e5);
+}
+var _hashHas_default = hashHas, HASH_UNDEFINED$1 = "__lodash_hash_undefined__";
+function hashSet(e5, m) {
+  var h = this.__data__;
+  return this.size += this.has(e5) ? 0 : 1, h[e5] = _nativeCreate_default && m === void 0 ? HASH_UNDEFINED$1 : m, this;
+}
+var _hashSet_default = hashSet;
+function Hash(e5) {
+  var m = -1, h = e5 == null ? 0 : e5.length;
+  for (this.clear(); ++m < h; ) {
+    var g = e5[m];
+    this.set(g[0], g[1]);
+  }
+}
+Hash.prototype.clear = _hashClear_default, Hash.prototype.delete = _hashDelete_default, Hash.prototype.get = _hashGet_default, Hash.prototype.has = _hashHas_default, Hash.prototype.set = _hashSet_default;
+var _Hash_default = Hash;
+function listCacheClear() {
+  this.__data__ = [], this.size = 0;
+}
+var _listCacheClear_default = listCacheClear;
+function assocIndexOf(e5, m) {
+  for (var h = e5.length; h--; ) if (eq_default(e5[h][0], m)) return h;
+  return -1;
+}
+var _assocIndexOf_default = assocIndexOf, splice = Array.prototype.splice;
+function listCacheDelete(e5) {
+  var m = this.__data__, h = _assocIndexOf_default(m, e5);
+  return h < 0 ? false : (h == m.length - 1 ? m.pop() : splice.call(m, h, 1), --this.size, true);
+}
+var _listCacheDelete_default = listCacheDelete;
+function listCacheGet(e5) {
+  var m = this.__data__, h = _assocIndexOf_default(m, e5);
+  return h < 0 ? void 0 : m[h][1];
+}
+var _listCacheGet_default = listCacheGet;
+function listCacheHas(e5) {
+  return _assocIndexOf_default(this.__data__, e5) > -1;
+}
+var _listCacheHas_default = listCacheHas;
+function listCacheSet(e5, m) {
+  var h = this.__data__, g = _assocIndexOf_default(h, e5);
+  return g < 0 ? (++this.size, h.push([e5, m])) : h[g][1] = m, this;
+}
+var _listCacheSet_default = listCacheSet;
+function ListCache(e5) {
+  var m = -1, h = e5 == null ? 0 : e5.length;
+  for (this.clear(); ++m < h; ) {
+    var g = e5[m];
+    this.set(g[0], g[1]);
+  }
+}
+ListCache.prototype.clear = _listCacheClear_default, ListCache.prototype.delete = _listCacheDelete_default, ListCache.prototype.get = _listCacheGet_default, ListCache.prototype.has = _listCacheHas_default, ListCache.prototype.set = _listCacheSet_default;
+var _ListCache_default = ListCache, _Map_default = _getNative_default(_root_default, "Map");
+function mapCacheClear() {
+  this.size = 0, this.__data__ = {
+    hash: new _Hash_default(),
+    map: new (_Map_default || _ListCache_default)(),
+    string: new _Hash_default()
+  };
+}
+var _mapCacheClear_default = mapCacheClear;
+function isKeyable(e5) {
+  var m = typeof e5;
+  return m == "string" || m == "number" || m == "symbol" || m == "boolean" ? e5 !== "__proto__" : e5 === null;
+}
+var _isKeyable_default = isKeyable;
+function getMapData(e5, m) {
+  var h = e5.__data__;
+  return _isKeyable_default(m) ? h[typeof m == "string" ? "string" : "hash"] : h.map;
+}
+var _getMapData_default = getMapData;
+function mapCacheDelete(e5) {
+  var m = _getMapData_default(this, e5).delete(e5);
+  return this.size -= m ? 1 : 0, m;
+}
+var _mapCacheDelete_default = mapCacheDelete;
+function mapCacheGet(e5) {
+  return _getMapData_default(this, e5).get(e5);
+}
+var _mapCacheGet_default = mapCacheGet;
+function mapCacheHas(e5) {
+  return _getMapData_default(this, e5).has(e5);
+}
+var _mapCacheHas_default = mapCacheHas;
+function mapCacheSet(e5, m) {
+  var h = _getMapData_default(this, e5), g = h.size;
+  return h.set(e5, m), this.size += h.size == g ? 0 : 1, this;
+}
+var _mapCacheSet_default = mapCacheSet;
+function MapCache(e5) {
+  var m = -1, h = e5 == null ? 0 : e5.length;
+  for (this.clear(); ++m < h; ) {
+    var g = e5[m];
+    this.set(g[0], g[1]);
+  }
+}
+MapCache.prototype.clear = _mapCacheClear_default, MapCache.prototype.delete = _mapCacheDelete_default, MapCache.prototype.get = _mapCacheGet_default, MapCache.prototype.has = _mapCacheHas_default, MapCache.prototype.set = _mapCacheSet_default;
+var _MapCache_default = MapCache, FUNC_ERROR_TEXT$1 = "Expected a function";
+function memoize(e5, m) {
+  if (typeof e5 != "function" || m != null && typeof m != "function") throw TypeError(FUNC_ERROR_TEXT$1);
+  var h = function() {
+    var g = arguments, _ = m ? m.apply(this, g) : g[0], v = h.cache;
+    if (v.has(_)) return v.get(_);
+    var y = e5.apply(this, g);
+    return h.cache = v.set(_, y) || v, y;
+  };
+  return h.cache = new (memoize.Cache || _MapCache_default)(), h;
+}
+memoize.Cache = _MapCache_default;
+var memoize_default = memoize, MAX_MEMOIZE_SIZE = 500;
+function memoizeCapped(e5) {
+  var m = memoize_default(e5, function(e6) {
+    return h.size === MAX_MEMOIZE_SIZE && h.clear(), e6;
+  }), h = m.cache;
+  return m;
+}
+var _memoizeCapped_default = memoizeCapped, rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, reEscapeChar = /\\(\\)?/g, _stringToPath_default = _memoizeCapped_default(function(e5) {
+  var m = [];
+  return e5.charCodeAt(0) === 46 && m.push(""), e5.replace(rePropName, function(e6, h, g, _) {
+    m.push(g ? _.replace(reEscapeChar, "$1") : h || e6);
+  }), m;
+});
+function toString(e5) {
+  return e5 == null ? "" : _baseToString_default(e5);
+}
+var toString_default = toString;
+function castPath(e5, m) {
+  return isArray_default(e5) ? e5 : _isKey_default(e5, m) ? [e5] : _stringToPath_default(toString_default(e5));
+}
+var _castPath_default = castPath, INFINITY = Infinity;
+function toKey(e5) {
+  if (typeof e5 == "string" || isSymbol_default(e5)) return e5;
+  var m = e5 + "";
+  return m == "0" && 1 / e5 == -INFINITY ? "-0" : m;
+}
+var _toKey_default = toKey;
+function baseGet(e5, m) {
+  m = _castPath_default(m, e5);
+  for (var h = 0, g = m.length; e5 != null && h < g; ) e5 = e5[_toKey_default(m[h++])];
+  return h && h == g ? e5 : void 0;
+}
+var _baseGet_default = baseGet;
+function get(e5, m, h) {
+  var g = e5 == null ? void 0 : _baseGet_default(e5, m);
+  return g === void 0 ? h : g;
+}
+var get_default = get;
+function arrayPush(e5, m) {
+  for (var h = -1, g = m.length, _ = e5.length; ++h < g; ) e5[_ + h] = m[h];
+  return e5;
+}
+var _arrayPush_default = arrayPush, spreadableSymbol = _Symbol_default ? _Symbol_default.isConcatSpreadable : void 0;
+function isFlattenable(e5) {
+  return isArray_default(e5) || isArguments_default(e5) || !!(spreadableSymbol && e5 && e5[spreadableSymbol]);
+}
+var _isFlattenable_default = isFlattenable;
+function baseFlatten(e5, m, h, g, _) {
+  var v = -1, y = e5.length;
+  for (h || (h = _isFlattenable_default), _ || (_ = []); ++v < y; ) {
+    var b = e5[v];
+    m > 0 && h(b) ? m > 1 ? baseFlatten(b, m - 1, h, g, _) : _arrayPush_default(_, b) : g || (_[_.length] = b);
+  }
+  return _;
+}
+var _baseFlatten_default = baseFlatten;
+function flatten(e5) {
+  return e5 != null && e5.length ? _baseFlatten_default(e5, 1) : [];
+}
+var flatten_default$1 = flatten, _getPrototype_default = _overArg_default(Object.getPrototypeOf, Object);
+function baseSlice(e5, m, h) {
+  var g = -1, _ = e5.length;
+  m < 0 && (m = -m > _ ? 0 : _ + m), h = h > _ ? _ : h, h < 0 && (h += _), _ = m > h ? 0 : h - m >>> 0, m >>>= 0;
+  for (var v = Array(_); ++g < _; ) v[g] = e5[g + m];
+  return v;
+}
+var _baseSlice_default = baseSlice;
+function arrayReduce(e5, m, h, g) {
+  var _ = -1, v = e5 == null ? 0 : e5.length;
+  for (g && v && (h = e5[++_]); ++_ < v; ) h = m(h, e5[_], _, e5);
+  return h;
+}
+var _arrayReduce_default = arrayReduce;
+function stackClear() {
+  this.__data__ = new _ListCache_default(), this.size = 0;
+}
+var _stackClear_default = stackClear;
+function stackDelete(e5) {
+  var m = this.__data__, h = m.delete(e5);
+  return this.size = m.size, h;
+}
+var _stackDelete_default = stackDelete;
+function stackGet(e5) {
+  return this.__data__.get(e5);
+}
+var _stackGet_default = stackGet;
+function stackHas(e5) {
+  return this.__data__.has(e5);
+}
+var _stackHas_default = stackHas, LARGE_ARRAY_SIZE$2 = 200;
+function stackSet(e5, m) {
+  var h = this.__data__;
+  if (h instanceof _ListCache_default) {
+    var g = h.__data__;
+    if (!_Map_default || g.length < LARGE_ARRAY_SIZE$2 - 1) return g.push([e5, m]), this.size = ++h.size, this;
+    h = this.__data__ = new _MapCache_default(g);
+  }
+  return h.set(e5, m), this.size = h.size, this;
+}
+var _stackSet_default = stackSet;
+function Stack(e5) {
+  this.size = (this.__data__ = new _ListCache_default(e5)).size;
+}
+Stack.prototype.clear = _stackClear_default, Stack.prototype.delete = _stackDelete_default, Stack.prototype.get = _stackGet_default, Stack.prototype.has = _stackHas_default, Stack.prototype.set = _stackSet_default;
+var _Stack_default = Stack;
+function baseAssign(e5, m) {
+  return e5 && _copyObject_default(m, keys_default(m), e5);
+}
+var _baseAssign_default = baseAssign;
+function baseAssignIn(e5, m) {
+  return e5 && _copyObject_default(m, keysIn_default(m), e5);
+}
+var _baseAssignIn_default = baseAssignIn, freeExports = typeof exports == "object" && exports && !exports.nodeType && exports, freeModule = freeExports && typeof module == "object" && module && !module.nodeType && module, Buffer2 = freeModule && freeModule.exports === freeExports ? _root_default.Buffer : void 0, allocUnsafe = Buffer2 ? Buffer2.allocUnsafe : void 0;
+function cloneBuffer(e5, m) {
+  if (m) return e5.slice();
+  var h = e5.length, g = allocUnsafe ? allocUnsafe(h) : new e5.constructor(h);
+  return e5.copy(g), g;
+}
+var _cloneBuffer_default = cloneBuffer;
+function arrayFilter(e5, m) {
+  for (var h = -1, g = e5 == null ? 0 : e5.length, _ = 0, v = []; ++h < g; ) {
+    var y = e5[h];
+    m(y, h, e5) && (v[_++] = y);
+  }
+  return v;
+}
+var _arrayFilter_default = arrayFilter;
+function stubArray() {
+  return [];
+}
+var stubArray_default = stubArray, propertyIsEnumerable = Object.prototype.propertyIsEnumerable, nativeGetSymbols = Object.getOwnPropertySymbols, _getSymbols_default = nativeGetSymbols ? function(e5) {
+  return e5 == null ? [] : (e5 = Object(e5), _arrayFilter_default(nativeGetSymbols(e5), function(m) {
+    return propertyIsEnumerable.call(e5, m);
+  }));
+} : stubArray_default;
+function copySymbols(e5, m) {
+  return _copyObject_default(e5, _getSymbols_default(e5), m);
+}
+var _copySymbols_default = copySymbols, _getSymbolsIn_default = Object.getOwnPropertySymbols ? function(e5) {
+  for (var m = []; e5; ) _arrayPush_default(m, _getSymbols_default(e5)), e5 = _getPrototype_default(e5);
+  return m;
+} : stubArray_default;
+function copySymbolsIn(e5, m) {
+  return _copyObject_default(e5, _getSymbolsIn_default(e5), m);
+}
+var _copySymbolsIn_default = copySymbolsIn;
+function baseGetAllKeys(e5, m, h) {
+  var g = m(e5);
+  return isArray_default(e5) ? g : _arrayPush_default(g, h(e5));
+}
+var _baseGetAllKeys_default = baseGetAllKeys;
+function getAllKeys(e5) {
+  return _baseGetAllKeys_default(e5, keys_default, _getSymbols_default);
+}
+var _getAllKeys_default = getAllKeys;
+function getAllKeysIn(e5) {
+  return _baseGetAllKeys_default(e5, keysIn_default, _getSymbolsIn_default);
+}
+var _getAllKeysIn_default = getAllKeysIn, _DataView_default = _getNative_default(_root_default, "DataView"), _Promise_default = _getNative_default(_root_default, "Promise"), _Set_default = _getNative_default(_root_default, "Set"), mapTag$5 = "[object Map]", objectTag$2 = "[object Object]", promiseTag = "[object Promise]", setTag$5 = "[object Set]", weakMapTag$1 = "[object WeakMap]", dataViewTag$3 = "[object DataView]", dataViewCtorString = _toSource_default(_DataView_default), mapCtorString = _toSource_default(_Map_default), promiseCtorString = _toSource_default(_Promise_default), setCtorString = _toSource_default(_Set_default), weakMapCtorString = _toSource_default(_WeakMap_default), getTag = _baseGetTag_default;
+(_DataView_default && getTag(new _DataView_default(/* @__PURE__ */ new ArrayBuffer(1))) != dataViewTag$3 || _Map_default && getTag(new _Map_default()) != mapTag$5 || _Promise_default && getTag(_Promise_default.resolve()) != promiseTag || _Set_default && getTag(new _Set_default()) != setTag$5 || _WeakMap_default && getTag(new _WeakMap_default()) != weakMapTag$1) && (getTag = function(e5) {
+  var m = _baseGetTag_default(e5), h = m == objectTag$2 ? e5.constructor : void 0, g = h ? _toSource_default(h) : "";
+  if (g) switch (g) {
+    case dataViewCtorString:
+      return dataViewTag$3;
+    case mapCtorString:
+      return mapTag$5;
+    case promiseCtorString:
+      return promiseTag;
+    case setCtorString:
+      return setTag$5;
+    case weakMapCtorString:
+      return weakMapTag$1;
+  }
+  return m;
+});
+var _getTag_default = getTag, hasOwnProperty$6 = Object.prototype.hasOwnProperty;
+function initCloneArray(e5) {
+  var m = e5.length, h = new e5.constructor(m);
+  return m && typeof e5[0] == "string" && hasOwnProperty$6.call(e5, "index") && (h.index = e5.index, h.input = e5.input), h;
+}
+var _initCloneArray_default = initCloneArray, _Uint8Array_default = _root_default.Uint8Array;
+function cloneArrayBuffer(e5) {
+  var m = new e5.constructor(e5.byteLength);
+  return new _Uint8Array_default(m).set(new _Uint8Array_default(e5)), m;
+}
+var _cloneArrayBuffer_default = cloneArrayBuffer;
+function cloneDataView(e5, m) {
+  var h = m ? _cloneArrayBuffer_default(e5.buffer) : e5.buffer;
+  return new e5.constructor(h, e5.byteOffset, e5.byteLength);
+}
+var _cloneDataView_default = cloneDataView, reFlags = /\w*$/;
+function cloneRegExp(e5) {
+  var m = new e5.constructor(e5.source, reFlags.exec(e5));
+  return m.lastIndex = e5.lastIndex, m;
+}
+var _cloneRegExp_default = cloneRegExp, symbolProto$1 = _Symbol_default ? _Symbol_default.prototype : void 0, symbolValueOf$1 = symbolProto$1 ? symbolProto$1.valueOf : void 0;
+function cloneSymbol(e5) {
+  return symbolValueOf$1 ? Object(symbolValueOf$1.call(e5)) : {};
+}
+var _cloneSymbol_default = cloneSymbol;
+function cloneTypedArray(e5, m) {
+  var h = m ? _cloneArrayBuffer_default(e5.buffer) : e5.buffer;
+  return new e5.constructor(h, e5.byteOffset, e5.length);
+}
+var _cloneTypedArray_default = cloneTypedArray, boolTag$2 = "[object Boolean]", dateTag$2 = "[object Date]", mapTag$4 = "[object Map]", numberTag$2 = "[object Number]", regexpTag$3 = "[object RegExp]", setTag$4 = "[object Set]", stringTag$3 = "[object String]", symbolTag$2 = "[object Symbol]", arrayBufferTag$2 = "[object ArrayBuffer]", dataViewTag$2 = "[object DataView]", float32Tag$1 = "[object Float32Array]", float64Tag$1 = "[object Float64Array]", int8Tag$1 = "[object Int8Array]", int16Tag$1 = "[object Int16Array]", int32Tag$1 = "[object Int32Array]", uint8Tag$1 = "[object Uint8Array]", uint8ClampedTag$1 = "[object Uint8ClampedArray]", uint16Tag$1 = "[object Uint16Array]", uint32Tag$1 = "[object Uint32Array]";
+function initCloneByTag(e5, m, h) {
+  var g = e5.constructor;
+  switch (m) {
+    case arrayBufferTag$2:
+      return _cloneArrayBuffer_default(e5);
+    case boolTag$2:
+    case dateTag$2:
+      return new g(+e5);
+    case dataViewTag$2:
+      return _cloneDataView_default(e5, h);
+    case float32Tag$1:
+    case float64Tag$1:
+    case int8Tag$1:
+    case int16Tag$1:
+    case int32Tag$1:
+    case uint8Tag$1:
+    case uint8ClampedTag$1:
+    case uint16Tag$1:
+    case uint32Tag$1:
+      return _cloneTypedArray_default(e5, h);
+    case mapTag$4:
+      return new g();
+    case numberTag$2:
+    case stringTag$3:
+      return new g(e5);
+    case regexpTag$3:
+      return _cloneRegExp_default(e5);
+    case setTag$4:
+      return new g();
+    case symbolTag$2:
+      return _cloneSymbol_default(e5);
+  }
+}
+var _initCloneByTag_default = initCloneByTag;
+function initCloneObject(e5) {
+  return typeof e5.constructor == "function" && !_isPrototype_default(e5) ? _baseCreate_default(_getPrototype_default(e5)) : {};
+}
+var _initCloneObject_default = initCloneObject, mapTag$3 = "[object Map]";
+function baseIsMap(e5) {
+  return isObjectLike_default(e5) && _getTag_default(e5) == mapTag$3;
+}
+var _baseIsMap_default = baseIsMap, nodeIsMap = _nodeUtil_default && _nodeUtil_default.isMap, isMap_default = nodeIsMap ? _baseUnary_default(nodeIsMap) : _baseIsMap_default, setTag$3 = "[object Set]";
+function baseIsSet(e5) {
+  return isObjectLike_default(e5) && _getTag_default(e5) == setTag$3;
+}
+var _baseIsSet_default = baseIsSet, nodeIsSet = _nodeUtil_default && _nodeUtil_default.isSet, isSet_default = nodeIsSet ? _baseUnary_default(nodeIsSet) : _baseIsSet_default, CLONE_DEEP_FLAG = 1, CLONE_FLAT_FLAG = 2, CLONE_SYMBOLS_FLAG$1 = 4, argsTag$1 = "[object Arguments]", arrayTag$1 = "[object Array]", boolTag$1 = "[object Boolean]", dateTag$1 = "[object Date]", errorTag$1 = "[object Error]", funcTag = "[object Function]", genTag = "[object GeneratorFunction]", mapTag$2 = "[object Map]", numberTag$1 = "[object Number]", objectTag$1 = "[object Object]", regexpTag$2 = "[object RegExp]", setTag$2 = "[object Set]", stringTag$2 = "[object String]", symbolTag$1 = "[object Symbol]", weakMapTag = "[object WeakMap]", arrayBufferTag$1 = "[object ArrayBuffer]", dataViewTag$1 = "[object DataView]", float32Tag = "[object Float32Array]", float64Tag = "[object Float64Array]", int8Tag = "[object Int8Array]", int16Tag = "[object Int16Array]", int32Tag = "[object Int32Array]", uint8Tag = "[object Uint8Array]", uint8ClampedTag = "[object Uint8ClampedArray]", uint16Tag = "[object Uint16Array]", uint32Tag = "[object Uint32Array]", cloneableTags = {};
+cloneableTags[argsTag$1] = cloneableTags[arrayTag$1] = cloneableTags[arrayBufferTag$1] = cloneableTags[dataViewTag$1] = cloneableTags[boolTag$1] = cloneableTags[dateTag$1] = cloneableTags[float32Tag] = cloneableTags[float64Tag] = cloneableTags[int8Tag] = cloneableTags[int16Tag] = cloneableTags[int32Tag] = cloneableTags[mapTag$2] = cloneableTags[numberTag$1] = cloneableTags[objectTag$1] = cloneableTags[regexpTag$2] = cloneableTags[setTag$2] = cloneableTags[stringTag$2] = cloneableTags[symbolTag$1] = cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] = cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true, cloneableTags[errorTag$1] = cloneableTags[funcTag] = cloneableTags[weakMapTag] = false;
+function baseClone(e5, m, h, g, _, v) {
+  var y, b = m & CLONE_DEEP_FLAG, x = m & CLONE_FLAT_FLAG, S = m & CLONE_SYMBOLS_FLAG$1;
+  if (h && (y = _ ? h(e5, g, _, v) : h(e5)), y !== void 0) return y;
+  if (!isObject_default(e5)) return e5;
+  var C = isArray_default(e5);
+  if (C) {
+    if (y = _initCloneArray_default(e5), !b) return _copyArray_default(e5, y);
+  } else {
+    var w = _getTag_default(e5), T = w == funcTag || w == genTag;
+    if (isBuffer_default(e5)) return _cloneBuffer_default(e5, b);
+    if (w == objectTag$1 || w == argsTag$1 || T && !_) {
+      if (y = x || T ? {} : _initCloneObject_default(e5), !b) return x ? _copySymbolsIn_default(e5, _baseAssignIn_default(y, e5)) : _copySymbols_default(e5, _baseAssign_default(y, e5));
+    } else {
+      if (!cloneableTags[w]) return _ ? e5 : {};
+      y = _initCloneByTag_default(e5, w, b);
+    }
+  }
+  v || (v = new _Stack_default());
+  var E = v.get(e5);
+  if (E) return E;
+  v.set(e5, y), isSet_default(e5) ? e5.forEach(function(g2) {
+    y.add(baseClone(g2, m, h, g2, e5, v));
+  }) : isMap_default(e5) && e5.forEach(function(g2, _2) {
+    y.set(_2, baseClone(g2, m, h, _2, e5, v));
+  });
+  var D = C ? void 0 : (S ? x ? _getAllKeysIn_default : _getAllKeys_default : x ? keysIn_default : keys_default)(e5);
+  return _arrayEach_default(D || e5, function(g2, _2) {
+    D && (_2 = g2, g2 = e5[_2]), _assignValue_default(y, _2, baseClone(g2, m, h, _2, e5, v));
+  }), y;
+}
+var _baseClone_default = baseClone, CLONE_SYMBOLS_FLAG = 4;
+function clone(e5) {
+  return _baseClone_default(e5, CLONE_SYMBOLS_FLAG);
+}
+var clone_default = clone;
+function compact(e5) {
+  for (var m = -1, h = e5 == null ? 0 : e5.length, g = 0, _ = []; ++m < h; ) {
+    var v = e5[m];
+    v && (_[g++] = v);
+  }
+  return _;
+}
+var compact_default = compact, HASH_UNDEFINED = "__lodash_hash_undefined__";
+function setCacheAdd(e5) {
+  return this.__data__.set(e5, HASH_UNDEFINED), this;
+}
+var _setCacheAdd_default = setCacheAdd;
+function setCacheHas(e5) {
+  return this.__data__.has(e5);
+}
+var _setCacheHas_default = setCacheHas;
+function SetCache(e5) {
+  var m = -1, h = e5 == null ? 0 : e5.length;
+  for (this.__data__ = new _MapCache_default(); ++m < h; ) this.add(e5[m]);
+}
+SetCache.prototype.add = SetCache.prototype.push = _setCacheAdd_default, SetCache.prototype.has = _setCacheHas_default;
+var _SetCache_default = SetCache;
+function arraySome(e5, m) {
+  for (var h = -1, g = e5 == null ? 0 : e5.length; ++h < g; ) if (m(e5[h], h, e5)) return true;
+  return false;
+}
+var _arraySome_default = arraySome;
+function cacheHas(e5, m) {
+  return e5.has(m);
+}
+var _cacheHas_default = cacheHas, COMPARE_PARTIAL_FLAG$5 = 1, COMPARE_UNORDERED_FLAG$3 = 2;
+function equalArrays(e5, m, h, g, _, v) {
+  var y = h & COMPARE_PARTIAL_FLAG$5, b = e5.length, x = m.length;
+  if (b != x && !(y && x > b)) return false;
+  var S = v.get(e5), C = v.get(m);
+  if (S && C) return S == m && C == e5;
+  var w = -1, T = true, E = h & COMPARE_UNORDERED_FLAG$3 ? new _SetCache_default() : void 0;
+  for (v.set(e5, m), v.set(m, e5); ++w < b; ) {
+    var D = e5[w], O = m[w];
+    if (g) var k = y ? g(O, D, w, m, e5, v) : g(D, O, w, e5, m, v);
+    if (k !== void 0) {
+      if (k) continue;
+      T = false;
+      break;
+    }
+    if (E) {
+      if (!_arraySome_default(m, function(e6, m2) {
+        if (!_cacheHas_default(E, m2) && (D === e6 || _(D, e6, h, g, v))) return E.push(m2);
+      })) {
+        T = false;
+        break;
+      }
+    } else if (!(D === O || _(D, O, h, g, v))) {
+      T = false;
+      break;
+    }
+  }
+  return v.delete(e5), v.delete(m), T;
+}
+var _equalArrays_default = equalArrays;
+function mapToArray(e5) {
+  var m = -1, h = Array(e5.size);
+  return e5.forEach(function(e6, g) {
+    h[++m] = [g, e6];
+  }), h;
+}
+var _mapToArray_default = mapToArray;
+function setToArray(e5) {
+  var m = -1, h = Array(e5.size);
+  return e5.forEach(function(e6) {
+    h[++m] = e6;
+  }), h;
+}
+var _setToArray_default = setToArray, COMPARE_PARTIAL_FLAG$4 = 1, COMPARE_UNORDERED_FLAG$2 = 2, boolTag = "[object Boolean]", dateTag = "[object Date]", errorTag = "[object Error]", mapTag$1 = "[object Map]", numberTag = "[object Number]", regexpTag$1 = "[object RegExp]", setTag$1 = "[object Set]", stringTag$1 = "[object String]", symbolTag = "[object Symbol]", arrayBufferTag = "[object ArrayBuffer]", dataViewTag = "[object DataView]", symbolProto = _Symbol_default ? _Symbol_default.prototype : void 0, symbolValueOf = symbolProto ? symbolProto.valueOf : void 0;
+function equalByTag(e5, m, h, g, _, v, y) {
+  switch (h) {
+    case dataViewTag:
+      if (e5.byteLength != m.byteLength || e5.byteOffset != m.byteOffset) return false;
+      e5 = e5.buffer, m = m.buffer;
+    case arrayBufferTag:
+      return !(e5.byteLength != m.byteLength || !v(new _Uint8Array_default(e5), new _Uint8Array_default(m)));
+    case boolTag:
+    case dateTag:
+    case numberTag:
+      return eq_default(+e5, +m);
+    case errorTag:
+      return e5.name == m.name && e5.message == m.message;
+    case regexpTag$1:
+    case stringTag$1:
+      return e5 == m + "";
+    case mapTag$1:
+      var b = _mapToArray_default;
+    case setTag$1:
+      var x = g & COMPARE_PARTIAL_FLAG$4;
+      if (b || (b = _setToArray_default), e5.size != m.size && !x) return false;
+      var S = y.get(e5);
+      if (S) return S == m;
+      g |= COMPARE_UNORDERED_FLAG$2, y.set(e5, m);
+      var C = _equalArrays_default(b(e5), b(m), g, _, v, y);
+      return y.delete(e5), C;
+    case symbolTag:
+      if (symbolValueOf) return symbolValueOf.call(e5) == symbolValueOf.call(m);
+  }
+  return false;
+}
+var _equalByTag_default = equalByTag, COMPARE_PARTIAL_FLAG$3 = 1, hasOwnProperty$5 = Object.prototype.hasOwnProperty;
+function equalObjects(e5, m, h, g, _, v) {
+  var y = h & COMPARE_PARTIAL_FLAG$3, b = _getAllKeys_default(e5), x = b.length;
+  if (x != _getAllKeys_default(m).length && !y) return false;
+  for (var S = x; S--; ) {
+    var C = b[S];
+    if (!(y ? C in m : hasOwnProperty$5.call(m, C))) return false;
+  }
+  var w = v.get(e5), T = v.get(m);
+  if (w && T) return w == m && T == e5;
+  var E = true;
+  v.set(e5, m), v.set(m, e5);
+  for (var D = y; ++S < x; ) {
+    C = b[S];
+    var O = e5[C], k = m[C];
+    if (g) var A = y ? g(k, O, C, m, e5, v) : g(O, k, C, e5, m, v);
+    if (!(A === void 0 ? O === k || _(O, k, h, g, v) : A)) {
+      E = false;
+      break;
+    }
+    D || (D = C == "constructor");
+  }
+  if (E && !D) {
+    var j = e5.constructor, M = m.constructor;
+    j != M && "constructor" in e5 && "constructor" in m && !(typeof j == "function" && j instanceof j && typeof M == "function" && M instanceof M) && (E = false);
+  }
+  return v.delete(e5), v.delete(m), E;
+}
+var _equalObjects_default = equalObjects, COMPARE_PARTIAL_FLAG$2 = 1, argsTag = "[object Arguments]", arrayTag = "[object Array]", objectTag = "[object Object]", hasOwnProperty$4 = Object.prototype.hasOwnProperty;
+function baseIsEqualDeep(e5, m, h, g, _, v) {
+  var y = isArray_default(e5), b = isArray_default(m), x = y ? arrayTag : _getTag_default(e5), S = b ? arrayTag : _getTag_default(m);
+  x = x == argsTag ? objectTag : x, S = S == argsTag ? objectTag : S;
+  var C = x == objectTag, w = S == objectTag, T = x == S;
+  if (T && isBuffer_default(e5)) {
+    if (!isBuffer_default(m)) return false;
+    y = true, C = false;
+  }
+  if (T && !C) return v || (v = new _Stack_default()), y || isTypedArray_default(e5) ? _equalArrays_default(e5, m, h, g, _, v) : _equalByTag_default(e5, m, x, h, g, _, v);
+  if (!(h & COMPARE_PARTIAL_FLAG$2)) {
+    var E = C && hasOwnProperty$4.call(e5, "__wrapped__"), D = w && hasOwnProperty$4.call(m, "__wrapped__");
+    if (E || D) {
+      var O = E ? e5.value() : e5, k = D ? m.value() : m;
+      return v || (v = new _Stack_default()), _(O, k, h, g, v);
+    }
+  }
+  return T ? (v || (v = new _Stack_default()), _equalObjects_default(e5, m, h, g, _, v)) : false;
+}
+var _baseIsEqualDeep_default = baseIsEqualDeep;
+function baseIsEqual(e5, m, h, g, _) {
+  return e5 === m ? true : e5 == null || m == null || !isObjectLike_default(e5) && !isObjectLike_default(m) ? e5 !== e5 && m !== m : _baseIsEqualDeep_default(e5, m, h, g, baseIsEqual, _);
+}
+var _baseIsEqual_default = baseIsEqual, COMPARE_PARTIAL_FLAG$1 = 1, COMPARE_UNORDERED_FLAG$1 = 2;
+function baseIsMatch(e5, m, h, g) {
+  var _ = h.length, v = _, y = !g;
+  if (e5 == null) return !v;
+  for (e5 = Object(e5); _--; ) {
+    var b = h[_];
+    if (y && b[2] ? b[1] !== e5[b[0]] : !(b[0] in e5)) return false;
+  }
+  for (; ++_ < v; ) {
+    b = h[_];
+    var x = b[0], S = e5[x], C = b[1];
+    if (y && b[2]) {
+      if (S === void 0 && !(x in e5)) return false;
+    } else {
+      var w = new _Stack_default();
+      if (g) var T = g(S, C, x, e5, m, w);
+      if (!(T === void 0 ? _baseIsEqual_default(C, S, COMPARE_PARTIAL_FLAG$1 | COMPARE_UNORDERED_FLAG$1, g, w) : T)) return false;
+    }
+  }
+  return true;
+}
+var _baseIsMatch_default = baseIsMatch;
+function isStrictComparable(e5) {
+  return e5 === e5 && !isObject_default(e5);
+}
+var _isStrictComparable_default = isStrictComparable;
+function getMatchData(e5) {
+  for (var m = keys_default(e5), h = m.length; h--; ) {
+    var g = m[h], _ = e5[g];
+    m[h] = [
+      g,
+      _,
+      _isStrictComparable_default(_)
+    ];
+  }
+  return m;
+}
+var _getMatchData_default = getMatchData;
+function matchesStrictComparable(e5, m) {
+  return function(h) {
+    return h == null ? false : h[e5] === m && (m !== void 0 || e5 in Object(h));
+  };
+}
+var _matchesStrictComparable_default = matchesStrictComparable;
+function baseMatches(e5) {
+  var m = _getMatchData_default(e5);
+  return m.length == 1 && m[0][2] ? _matchesStrictComparable_default(m[0][0], m[0][1]) : function(h) {
+    return h === e5 || _baseIsMatch_default(h, e5, m);
+  };
+}
+var _baseMatches_default = baseMatches;
+function baseHasIn(e5, m) {
+  return e5 != null && m in Object(e5);
+}
+var _baseHasIn_default = baseHasIn;
+function hasPath(e5, m, h) {
+  m = _castPath_default(m, e5);
+  for (var g = -1, _ = m.length, v = false; ++g < _; ) {
+    var y = _toKey_default(m[g]);
+    if (!(v = e5 != null && h(e5, y))) break;
+    e5 = e5[y];
+  }
+  return v || ++g != _ ? v : (_ = e5 == null ? 0 : e5.length, !!_ && isLength_default(_) && _isIndex_default(y, _) && (isArray_default(e5) || isArguments_default(e5)));
+}
+var _hasPath_default = hasPath;
+function hasIn(e5, m) {
+  return e5 != null && _hasPath_default(e5, m, _baseHasIn_default);
+}
+var hasIn_default = hasIn, COMPARE_PARTIAL_FLAG = 1, COMPARE_UNORDERED_FLAG = 2;
+function baseMatchesProperty(e5, m) {
+  return _isKey_default(e5) && _isStrictComparable_default(m) ? _matchesStrictComparable_default(_toKey_default(e5), m) : function(h) {
+    var g = get_default(h, e5);
+    return g === void 0 && g === m ? hasIn_default(h, e5) : _baseIsEqual_default(m, g, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);
+  };
+}
+var _baseMatchesProperty_default = baseMatchesProperty;
+function baseProperty(e5) {
+  return function(m) {
+    return m == null ? void 0 : m[e5];
+  };
+}
+var _baseProperty_default = baseProperty;
+function basePropertyDeep(e5) {
+  return function(m) {
+    return _baseGet_default(m, e5);
+  };
+}
+var _basePropertyDeep_default = basePropertyDeep;
+function property(e5) {
+  return _isKey_default(e5) ? _baseProperty_default(_toKey_default(e5)) : _basePropertyDeep_default(e5);
+}
+var property_default = property;
+function baseIteratee(e5) {
+  return typeof e5 == "function" ? e5 : e5 == null ? identity_default : typeof e5 == "object" ? isArray_default(e5) ? _baseMatchesProperty_default(e5[0], e5[1]) : _baseMatches_default(e5) : property_default(e5);
+}
+var _baseIteratee_default = baseIteratee;
+function arrayAggregator(e5, m, h, g) {
+  for (var _ = -1, v = e5 == null ? 0 : e5.length; ++_ < v; ) {
+    var y = e5[_];
+    m(g, y, h(y), e5);
+  }
+  return g;
+}
+var _arrayAggregator_default = arrayAggregator;
+function createBaseFor(e5) {
+  return function(m, h, g) {
+    for (var _ = -1, v = Object(m), y = g(m), b = y.length; b--; ) {
+      var x = y[e5 ? b : ++_];
+      if (h(v[x], x, v) === false) break;
+    }
+    return m;
+  };
+}
+var _baseFor_default = createBaseFor();
+function baseForOwn(e5, m) {
+  return e5 && _baseFor_default(e5, m, keys_default);
+}
+var _baseForOwn_default = baseForOwn;
+function createBaseEach(e5, m) {
+  return function(h, g) {
+    if (h == null) return h;
+    if (!isArrayLike_default(h)) return e5(h, g);
+    for (var _ = h.length, v = m ? _ : -1, y = Object(h); (m ? v-- : ++v < _) && g(y[v], v, y) !== false; ) ;
+    return h;
+  };
+}
+var _baseEach_default = createBaseEach(_baseForOwn_default);
+function baseAggregator(e5, m, h, g) {
+  return _baseEach_default(e5, function(e6, _, v) {
+    m(g, e6, h(e6), v);
+  }), g;
+}
+var _baseAggregator_default = baseAggregator;
+function createAggregator(e5, m) {
+  return function(h, g) {
+    var _ = isArray_default(h) ? _arrayAggregator_default : _baseAggregator_default, v = m ? m() : {};
+    return _(h, e5, _baseIteratee_default(g, 2), v);
+  };
+}
+var _createAggregator_default = createAggregator, objectProto = Object.prototype, hasOwnProperty$3 = objectProto.hasOwnProperty, defaults_default = _baseRest_default(function(e5, m) {
+  e5 = Object(e5);
+  var h = -1, g = m.length, _ = g > 2 ? m[2] : void 0;
+  for (_ && _isIterateeCall_default(m[0], m[1], _) && (g = 1); ++h < g; ) for (var v = m[h], y = keysIn_default(v), b = -1, x = y.length; ++b < x; ) {
+    var S = y[b], C = e5[S];
+    (C === void 0 || eq_default(C, objectProto[S]) && !hasOwnProperty$3.call(e5, S)) && (e5[S] = v[S]);
+  }
+  return e5;
+});
+function isArrayLikeObject(e5) {
+  return isObjectLike_default(e5) && isArrayLike_default(e5);
+}
+var isArrayLikeObject_default = isArrayLikeObject;
+function arrayIncludesWith(e5, m, h) {
+  for (var g = -1, _ = e5 == null ? 0 : e5.length; ++g < _; ) if (h(m, e5[g])) return true;
+  return false;
+}
+var _arrayIncludesWith_default = arrayIncludesWith, LARGE_ARRAY_SIZE$1 = 200;
+function baseDifference(e5, m, h, g) {
+  var _ = -1, v = _arrayIncludes_default, y = true, b = e5.length, x = [], S = m.length;
+  if (!b) return x;
+  h && (m = _arrayMap_default(m, _baseUnary_default(h))), g ? (v = _arrayIncludesWith_default, y = false) : m.length >= LARGE_ARRAY_SIZE$1 && (v = _cacheHas_default, y = false, m = new _SetCache_default(m));
+  outer: for (; ++_ < b; ) {
+    var C = e5[_], w = h == null ? C : h(C);
+    if (C = g || C !== 0 ? C : 0, y && w === w) {
+      for (var T = S; T--; ) if (m[T] === w) continue outer;
+      x.push(C);
+    } else v(m, w, g) || x.push(C);
+  }
+  return x;
+}
+var _baseDifference_default = baseDifference, difference_default = _baseRest_default(function(e5, m) {
+  return isArrayLikeObject_default(e5) ? _baseDifference_default(e5, _baseFlatten_default(m, 1, isArrayLikeObject_default, true)) : [];
+});
+function last(e5) {
+  var m = e5 == null ? 0 : e5.length;
+  return m ? e5[m - 1] : void 0;
+}
+var last_default = last;
+function drop(e5, m, h) {
+  var g = e5 == null ? 0 : e5.length;
+  return g ? (m = h || m === void 0 ? 1 : toInteger_default(m), _baseSlice_default(e5, m < 0 ? 0 : m, g)) : [];
+}
+var drop_default = drop;
+function dropRight(e5, m, h) {
+  var g = e5 == null ? 0 : e5.length;
+  return g ? (m = h || m === void 0 ? 1 : toInteger_default(m), m = g - m, _baseSlice_default(e5, 0, m < 0 ? 0 : m)) : [];
+}
+var dropRight_default = dropRight;
+function castFunction(e5) {
+  return typeof e5 == "function" ? e5 : identity_default;
+}
+var _castFunction_default = castFunction;
+function forEach(e5, m) {
+  return (isArray_default(e5) ? _arrayEach_default : _baseEach_default)(e5, _castFunction_default(m));
+}
+var forEach_default$1 = forEach;
+function arrayEvery(e5, m) {
+  for (var h = -1, g = e5 == null ? 0 : e5.length; ++h < g; ) if (!m(e5[h], h, e5)) return false;
+  return true;
+}
+var _arrayEvery_default = arrayEvery;
+function baseEvery(e5, m) {
+  var h = true;
+  return _baseEach_default(e5, function(e6, g, _) {
+    return h = !!m(e6, g, _), h;
+  }), h;
+}
+var _baseEvery_default = baseEvery;
+function every(e5, m, h) {
+  var g = isArray_default(e5) ? _arrayEvery_default : _baseEvery_default;
+  return h && _isIterateeCall_default(e5, m, h) && (m = void 0), g(e5, _baseIteratee_default(m, 3));
+}
+var every_default = every;
+function baseFilter(e5, m) {
+  var h = [];
+  return _baseEach_default(e5, function(e6, g, _) {
+    m(e6, g, _) && h.push(e6);
+  }), h;
+}
+var _baseFilter_default = baseFilter;
+function filter(e5, m) {
+  return (isArray_default(e5) ? _arrayFilter_default : _baseFilter_default)(e5, _baseIteratee_default(m, 3));
+}
+var filter_default$1 = filter;
+function createFind(e5) {
+  return function(m, h, g) {
+    var _ = Object(m);
+    if (!isArrayLike_default(m)) {
+      var v = _baseIteratee_default(h, 3);
+      m = keys_default(m), h = function(e6) {
+        return v(_[e6], e6, _);
+      };
+    }
+    var y = e5(m, h, g);
+    return y > -1 ? _[v ? m[y] : y] : void 0;
+  };
+}
+var _createFind_default = createFind, nativeMax$2 = Math.max;
+function findIndex(e5, m, h) {
+  var g = e5 == null ? 0 : e5.length;
+  if (!g) return -1;
+  var _ = h == null ? 0 : toInteger_default(h);
+  return _ < 0 && (_ = nativeMax$2(g + _, 0)), _baseFindIndex_default(e5, _baseIteratee_default(m, 3), _);
+}
+var find_default = _createFind_default(findIndex);
+function head(e5) {
+  return e5 && e5.length ? e5[0] : void 0;
+}
+var head_default = head;
+function baseMap(e5, m) {
+  var h = -1, g = isArrayLike_default(e5) ? Array(e5.length) : [];
+  return _baseEach_default(e5, function(e6, _, v) {
+    g[++h] = m(e6, _, v);
+  }), g;
+}
+var _baseMap_default = baseMap;
+function map(e5, m) {
+  return (isArray_default(e5) ? _arrayMap_default : _baseMap_default)(e5, _baseIteratee_default(m, 3));
+}
+var map_default$1 = map;
+function flatMap(e5, m) {
+  return _baseFlatten_default(map_default$1(e5, m), 1);
+}
+var flatMap_default$1 = flatMap, hasOwnProperty$2 = Object.prototype.hasOwnProperty, groupBy_default = _createAggregator_default(function(e5, m, h) {
+  hasOwnProperty$2.call(e5, h) ? e5[h].push(m) : _baseAssignValue_default(e5, h, [m]);
+}), hasOwnProperty$1 = Object.prototype.hasOwnProperty;
+function baseHas(e5, m) {
+  return e5 != null && hasOwnProperty$1.call(e5, m);
+}
+var _baseHas_default = baseHas;
+function has(e5, m) {
+  return e5 != null && _hasPath_default(e5, m, _baseHas_default);
+}
+var has_default = has, stringTag = "[object String]";
+function isString(e5) {
+  return typeof e5 == "string" || !isArray_default(e5) && isObjectLike_default(e5) && _baseGetTag_default(e5) == stringTag;
+}
+var isString_default = isString;
+function baseValues(e5, m) {
+  return _arrayMap_default(m, function(m2) {
+    return e5[m2];
+  });
+}
+var _baseValues_default = baseValues;
+function values(e5) {
+  return e5 == null ? [] : _baseValues_default(e5, keys_default(e5));
+}
+var values_default = values, nativeMax$1 = Math.max;
+function includes(e5, m, h, g) {
+  e5 = isArrayLike_default(e5) ? e5 : values_default(e5), h = h && !g ? toInteger_default(h) : 0;
+  var _ = e5.length;
+  return h < 0 && (h = nativeMax$1(_ + h, 0)), isString_default(e5) ? h <= _ && e5.indexOf(m, h) > -1 : !!_ && _baseIndexOf_default(e5, m, h) > -1;
+}
+var includes_default = includes, nativeMax = Math.max;
+function indexOf(e5, m, h) {
+  var g = e5 == null ? 0 : e5.length;
+  if (!g) return -1;
+  var _ = h == null ? 0 : toInteger_default(h);
+  return _ < 0 && (_ = nativeMax(g + _, 0)), _baseIndexOf_default(e5, m, _);
+}
+var indexOf_default = indexOf, mapTag = "[object Map]", setTag = "[object Set]", hasOwnProperty = Object.prototype.hasOwnProperty;
+function isEmpty(e5) {
+  if (e5 == null) return true;
+  if (isArrayLike_default(e5) && (isArray_default(e5) || typeof e5 == "string" || typeof e5.splice == "function" || isBuffer_default(e5) || isTypedArray_default(e5) || isArguments_default(e5))) return !e5.length;
+  var m = _getTag_default(e5);
+  if (m == mapTag || m == setTag) return !e5.size;
+  if (_isPrototype_default(e5)) return !_baseKeys_default(e5).length;
+  for (var h in e5) if (hasOwnProperty.call(e5, h)) return false;
+  return true;
+}
+var isEmpty_default$1 = isEmpty, regexpTag = "[object RegExp]";
+function baseIsRegExp(e5) {
+  return isObjectLike_default(e5) && _baseGetTag_default(e5) == regexpTag;
+}
+var _baseIsRegExp_default = baseIsRegExp, nodeIsRegExp = _nodeUtil_default && _nodeUtil_default.isRegExp, isRegExp_default = nodeIsRegExp ? _baseUnary_default(nodeIsRegExp) : _baseIsRegExp_default;
+function isUndefined(e5) {
+  return e5 === void 0;
+}
+var isUndefined_default = isUndefined, FUNC_ERROR_TEXT = "Expected a function";
+function negate(e5) {
+  if (typeof e5 != "function") throw TypeError(FUNC_ERROR_TEXT);
+  return function() {
+    var m = arguments;
+    switch (m.length) {
+      case 0:
+        return !e5.call(this);
+      case 1:
+        return !e5.call(this, m[0]);
+      case 2:
+        return !e5.call(this, m[0], m[1]);
+      case 3:
+        return !e5.call(this, m[0], m[1], m[2]);
+    }
+    return !e5.apply(this, m);
+  };
+}
+var negate_default = negate;
+function baseSet(e5, m, h, g) {
+  if (!isObject_default(e5)) return e5;
+  m = _castPath_default(m, e5);
+  for (var _ = -1, v = m.length, y = v - 1, b = e5; b != null && ++_ < v; ) {
+    var x = _toKey_default(m[_]), S = h;
+    if (x === "__proto__" || x === "constructor" || x === "prototype") return e5;
+    if (_ != y) {
+      var C = b[x];
+      S = g ? g(C, x, b) : void 0, S === void 0 && (S = isObject_default(C) ? C : _isIndex_default(m[_ + 1]) ? [] : {});
+    }
+    _assignValue_default(b, x, S), b = b[x];
+  }
+  return e5;
+}
+var _baseSet_default = baseSet;
+function basePickBy(e5, m, h) {
+  for (var g = -1, _ = m.length, v = {}; ++g < _; ) {
+    var y = m[g], b = _baseGet_default(e5, y);
+    h(b, y) && _baseSet_default(v, _castPath_default(y, e5), b);
+  }
+  return v;
+}
+var _basePickBy_default = basePickBy;
+function pickBy(e5, m) {
+  if (e5 == null) return {};
+  var h = _arrayMap_default(_getAllKeysIn_default(e5), function(e6) {
+    return [e6];
+  });
+  return m = _baseIteratee_default(m), _basePickBy_default(e5, h, function(e6, h2) {
+    return m(e6, h2[0]);
+  });
+}
+var pickBy_default = pickBy;
+function baseReduce(e5, m, h, g, _) {
+  return _(e5, function(e6, _2, v) {
+    h = g ? (g = false, e6) : m(h, e6, _2, v);
+  }), h;
+}
+var _baseReduce_default = baseReduce;
+function reduce(e5, m, h) {
+  var g = isArray_default(e5) ? _arrayReduce_default : _baseReduce_default, _ = arguments.length < 3;
+  return g(e5, _baseIteratee_default(m, 4), h, _, _baseEach_default);
+}
+var reduce_default$1 = reduce;
+function reject(e5, m) {
+  return (isArray_default(e5) ? _arrayFilter_default : _baseFilter_default)(e5, negate_default(_baseIteratee_default(m, 3)));
+}
+var reject_default = reject;
+function baseSome(e5, m) {
+  var h;
+  return _baseEach_default(e5, function(e6, g, _) {
+    return h = m(e6, g, _), !h;
+  }), !!h;
+}
+var _baseSome_default = baseSome;
+function some(e5, m, h) {
+  var g = isArray_default(e5) ? _arraySome_default : _baseSome_default;
+  return h && _isIterateeCall_default(e5, m, h) && (m = void 0), g(e5, _baseIteratee_default(m, 3));
+}
+var some_default = some, _createSet_default = _Set_default && 1 / _setToArray_default(new _Set_default([, -0]))[1] == Infinity ? function(e5) {
+  return new _Set_default(e5);
+} : noop_default, LARGE_ARRAY_SIZE = 200;
+function baseUniq(e5, m, h) {
+  var g = -1, _ = _arrayIncludes_default, v = e5.length, y = true, b = [], x = b;
+  if (h) y = false, _ = _arrayIncludesWith_default;
+  else if (v >= LARGE_ARRAY_SIZE) {
+    var S = m ? null : _createSet_default(e5);
+    if (S) return _setToArray_default(S);
+    y = false, _ = _cacheHas_default, x = new _SetCache_default();
+  } else x = m ? [] : b;
+  outer: for (; ++g < v; ) {
+    var C = e5[g], w = m ? m(C) : C;
+    if (C = h || C !== 0 ? C : 0, y && w === w) {
+      for (var T = x.length; T--; ) if (x[T] === w) continue outer;
+      m && x.push(w), b.push(C);
+    } else _(x, w, h) || (x !== b && x.push(w), b.push(C));
+  }
+  return b;
+}
+var _baseUniq_default = baseUniq;
+function uniq(e5) {
+  return e5 && e5.length ? _baseUniq_default(e5) : [];
+}
+var uniq_default = uniq;
 function PRINT_ERROR(e5) {
   console && console.error && console.error(`Error: ${e5}`);
 }
@@ -3266,7 +4473,7 @@ var AbstractProduction = class {
     this._definition = e5;
   }
   accept(e5) {
-    e5.visit(this), forEach_default(this.definition, (m) => {
+    e5.visit(this), forEach_default$1(this.definition, (m) => {
       m.accept(e5);
     });
   }
@@ -3329,11 +4536,11 @@ var AbstractProduction = class {
   }
 };
 function serializeGrammar(e5) {
-  return map_default(e5, serializeProduction);
+  return map_default$1(e5, serializeProduction);
 }
 function serializeProduction(e5) {
   function m(e6) {
-    return map_default(e6, serializeProduction);
+    return map_default$1(e6, serializeProduction);
   }
   if (e5 instanceof NonTerminal) {
     let m2 = {
@@ -3477,7 +4684,7 @@ function getProductionDslName$1(e5) {
 }
 var RestWalker = class {
   walk(e5, m = []) {
-    forEach_default(e5.definition, (h, g) => {
+    forEach_default$1(e5.definition, (h, g) => {
       let _ = drop_default(e5.definition, g + 1);
       if (h instanceof NonTerminal) this.walkProdRef(h, _, m);
       else if (h instanceof Terminal) this.walkTerminal(h, _, m);
@@ -3521,7 +4728,7 @@ var RestWalker = class {
   }
   walkOr(e5, m, h) {
     let g = m.concat(h);
-    forEach_default(e5.definition, (e6) => {
+    forEach_default$1(e5.definition, (e6) => {
       let m2 = new Alternative({ definition: [e6] });
       this.walk(m2, g);
     });
@@ -3543,7 +4750,7 @@ function firstForSequence(e5) {
   return uniq_default(m);
 }
 function firstForBranching(e5) {
-  return uniq_default(flatten_default(map_default(e5.definition, (e6) => first(e6))));
+  return uniq_default(flatten_default$1(map_default$1(e5.definition, (e6) => first(e6))));
 }
 function firstForTerminal(e5) {
   return [e5.terminalType];
@@ -3565,7 +4772,7 @@ var ResyncFollowsWalker = class extends RestWalker {
 };
 function computeAllProdsFollows(e5) {
   let m = {};
-  return forEach_default(e5, (e6) => {
+  return forEach_default$1(e5, (e6) => {
     assign_default(m, new ResyncFollowsWalker(e6).startWalking());
   }), m;
 }
@@ -3633,7 +4840,7 @@ function firstCharOptimizedIndices(e5, m, h) {
             break;
           case "Set":
             if (v.complement === true) throw Error(complementErrorMessage);
-            forEach_default(v.value, (e7) => {
+            forEach_default$1(v.value, (e7) => {
               if (typeof e7 == "number") addOptimizedIdxToResult(e7, m, h);
               else {
                 let g2 = e7;
@@ -3749,9 +4956,9 @@ function analyzeTokenTypes(e5, m) {
   h("Reject Lexer.NA", () => {
     g = reject_default(e5, (e6) => e6[PATTERN] === Lexer.NA);
   });
-  let _ = false, y;
+  let _ = false, v;
   h("Transform Patterns", () => {
-    _ = false, y = map_default(g, (e6) => {
+    _ = false, v = map_default$1(g, (e6) => {
       let h2 = e6[PATTERN];
       if (isRegExp_default(h2)) {
         let e7 = h2.source;
@@ -3784,74 +4991,74 @@ function analyzeTokenTypes(e5, m) {
       } else throw Error("non exhaustive match");
     });
   });
-  let b, x, C, w, T;
+  let y, b, x, S, C;
   h("misc mapping", () => {
-    b = map_default(g, (e6) => e6.tokenTypeIdx), x = map_default(g, (e6) => {
+    y = map_default$1(g, (e6) => e6.tokenTypeIdx), b = map_default$1(g, (e6) => {
       let m2 = e6.GROUP;
       if (m2 !== Lexer.SKIPPED) {
         if (isString_default(m2)) return m2;
         if (isUndefined_default(m2)) return false;
         throw Error("non exhaustive match");
       }
-    }), C = map_default(g, (e6) => {
+    }), x = map_default$1(g, (e6) => {
       let m2 = e6.LONGER_ALT;
-      if (m2) return isArray_default(m2) ? map_default(m2, (e7) => indexOf_default(g, e7)) : [indexOf_default(g, m2)];
-    }), w = map_default(g, (e6) => e6.PUSH_MODE), T = map_default(g, (e6) => has_default(e6, "POP_MODE"));
+      if (m2) return isArray_default(m2) ? map_default$1(m2, (e7) => indexOf_default(g, e7)) : [indexOf_default(g, m2)];
+    }), S = map_default$1(g, (e6) => e6.PUSH_MODE), C = map_default$1(g, (e6) => has_default(e6, "POP_MODE"));
   });
-  let E;
+  let w;
   h("Line Terminator Handling", () => {
     let e6 = getCharCodes(m.lineTerminatorCharacters);
-    E = map_default(g, (e7) => false), m.positionTracking !== "onlyOffset" && (E = map_default(g, (m2) => has_default(m2, "LINE_BREAKS") ? !!m2.LINE_BREAKS : checkLineBreaksIssues(m2, e6) === false && canMatchCharCode(e6, m2.PATTERN)));
+    w = map_default$1(g, (e7) => false), m.positionTracking !== "onlyOffset" && (w = map_default$1(g, (m2) => has_default(m2, "LINE_BREAKS") ? !!m2.LINE_BREAKS : checkLineBreaksIssues(m2, e6) === false && canMatchCharCode(e6, m2.PATTERN)));
   });
-  let D, O, k, A;
+  let T, E, D, O;
   h("Misc Mapping #2", () => {
-    D = map_default(g, isCustomPattern), O = map_default(y, isShortPattern), k = reduce_default(g, (e6, m2) => {
+    T = map_default$1(g, isCustomPattern), E = map_default$1(v, isShortPattern), D = reduce_default$1(g, (e6, m2) => {
       let h2 = m2.GROUP;
       return isString_default(h2) && h2 !== Lexer.SKIPPED && (e6[h2] = []), e6;
-    }, {}), A = map_default(y, (e6, m2) => ({
-      pattern: y[m2],
-      longerAlt: C[m2],
-      canLineTerminator: E[m2],
-      isCustom: D[m2],
-      short: O[m2],
-      group: x[m2],
-      push: w[m2],
-      pop: T[m2],
-      tokenTypeIdx: b[m2],
+    }, {}), O = map_default$1(v, (e6, m2) => ({
+      pattern: v[m2],
+      longerAlt: x[m2],
+      canLineTerminator: w[m2],
+      isCustom: T[m2],
+      short: E[m2],
+      group: b[m2],
+      push: S[m2],
+      pop: C[m2],
+      tokenTypeIdx: y[m2],
       tokenType: g[m2]
     }));
   });
-  let j = true, M = [];
+  let k = true, A = [];
   return m.safeMode || h("First Char Optimization", () => {
-    M = reduce_default(g, (e6, h2, g2) => {
-      if (typeof h2.PATTERN == "string") addToMapOfArrays(e6, charCodeToOptimizedIndex(h2.PATTERN.charCodeAt(0)), A[g2]);
+    A = reduce_default$1(g, (e6, h2, g2) => {
+      if (typeof h2.PATTERN == "string") addToMapOfArrays(e6, charCodeToOptimizedIndex(h2.PATTERN.charCodeAt(0)), O[g2]);
       else if (isArray_default(h2.START_CHARS_HINT)) {
         let m2;
-        forEach_default(h2.START_CHARS_HINT, (h3) => {
+        forEach_default$1(h2.START_CHARS_HINT, (h3) => {
           let _2 = charCodeToOptimizedIndex(typeof h3 == "string" ? h3.charCodeAt(0) : h3);
-          m2 !== _2 && (m2 = _2, addToMapOfArrays(e6, _2, A[g2]));
+          m2 !== _2 && (m2 = _2, addToMapOfArrays(e6, _2, O[g2]));
         });
-      } else if (isRegExp_default(h2.PATTERN)) if (h2.PATTERN.unicode) j = false, m.ensureOptimizations && PRINT_ERROR(`${failedOptimizationPrefixMsg}	Unable to analyze < ${h2.PATTERN.toString()} > pattern.
+      } else if (isRegExp_default(h2.PATTERN)) if (h2.PATTERN.unicode) k = false, m.ensureOptimizations && PRINT_ERROR(`${failedOptimizationPrefixMsg}	Unable to analyze < ${h2.PATTERN.toString()} > pattern.
 	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 _2 = getOptimizedStartCodesIndices(h2.PATTERN, m.ensureOptimizations);
-        isEmpty_default(_2) && (j = false), forEach_default(_2, (m2) => {
-          addToMapOfArrays(e6, m2, A[g2]);
+        isEmpty_default$1(_2) && (k = false), forEach_default$1(_2, (m2) => {
+          addToMapOfArrays(e6, m2, O[g2]);
         });
       }
       else m.ensureOptimizations && PRINT_ERROR(`${failedOptimizationPrefixMsg}	TokenType: <${h2.name}> is using a custom token pattern without providing <start_chars_hint> parameter.
 	This will disable the lexer's first char optimizations.
-	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_OPTIMIZE`), j = false;
+	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_OPTIMIZE`), k = false;
       return e6;
     }, []);
   }), {
-    emptyGroups: k,
-    patternIdxToConfig: A,
-    charCodeToPatternIdxToConfig: M,
+    emptyGroups: D,
+    patternIdxToConfig: O,
+    charCodeToPatternIdxToConfig: A,
     hasCustom: _,
-    canBeOptimized: j
+    canBeOptimized: k
   };
 }
 function validatePatterns(e5, m) {
@@ -3861,13 +5068,13 @@ function validatePatterns(e5, m) {
   return h = h.concat(_.errors), h = h.concat(validateRegExpPattern(v)), h = h.concat(findInvalidGroupType(v)), h = h.concat(findModesThatDoNotExist(v, m)), h = h.concat(findUnreachablePatterns(v)), h;
 }
 function validateRegExpPattern(e5) {
-  let m = [], h = filter_default(e5, (e6) => isRegExp_default(e6[PATTERN]));
+  let m = [], h = filter_default$1(e5, (e6) => isRegExp_default(e6[PATTERN]));
   return m = m.concat(findEndOfInputAnchor(h)), m = m.concat(findStartOfInputAnchor(h)), m = m.concat(findUnsupportedFlags(h)), m = m.concat(findDuplicatePatterns(h)), m = m.concat(findEmptyMatchRegExps(h)), m;
 }
 function findMissingPatterns(e5) {
-  let m = filter_default(e5, (e6) => !has_default(e6, PATTERN));
+  let m = filter_default$1(e5, (e6) => !has_default(e6, PATTERN));
   return {
-    errors: map_default(m, (e6) => ({
+    errors: map_default$1(m, (e6) => ({
       message: "Token Type: ->" + e6.name + "<- missing static 'PATTERN' property",
       type: LexerDefinitionErrorType.MISSING_PATTERN,
       tokenTypes: [e6]
@@ -3876,12 +5083,12 @@ function findMissingPatterns(e5) {
   };
 }
 function findInvalidPatterns(e5) {
-  let m = filter_default(e5, (e6) => {
+  let m = filter_default$1(e5, (e6) => {
     let m2 = e6[PATTERN];
     return !isRegExp_default(m2) && !isFunction_default(m2) && !has_default(m2, "exec") && !isString_default(m2);
   });
   return {
-    errors: map_default(m, (e6) => ({
+    errors: map_default$1(m, (e6) => ({
       message: "Token Type: ->" + e6.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: [e6]
@@ -3899,7 +5106,7 @@ function findEndOfInputAnchor(e5) {
       this.found = true;
     }
   }
-  return map_default(filter_default(e5, (e6) => {
+  return map_default$1(filter_default$1(e5, (e6) => {
     let h = e6.PATTERN;
     try {
       let e7 = getRegExpAst(h), g = new m();
@@ -3914,7 +5121,7 @@ function findEndOfInputAnchor(e5) {
   }));
 }
 function findEmptyMatchRegExps(e5) {
-  return map_default(filter_default(e5, (e6) => e6.PATTERN.test("")), (e6) => ({
+  return map_default$1(filter_default$1(e5, (e6) => e6.PATTERN.test("")), (e6) => ({
     message: "Token Type: ->" + e6.name + "<- static 'PATTERN' must not match an empty string",
     type: LexerDefinitionErrorType.EMPTY_MATCH_PATTERN,
     tokenTypes: [e6]
@@ -3930,7 +5137,7 @@ function findStartOfInputAnchor(e5) {
       this.found = true;
     }
   }
-  return map_default(filter_default(e5, (e6) => {
+  return map_default$1(filter_default$1(e5, (e6) => {
     let h = e6.PATTERN;
     try {
       let e7 = getRegExpAst(h), g = new m();
@@ -3945,7 +5152,7 @@ function findStartOfInputAnchor(e5) {
   }));
 }
 function findUnsupportedFlags(e5) {
-  return map_default(filter_default(e5, (e6) => {
+  return map_default$1(filter_default$1(e5, (e6) => {
     let m = e6[PATTERN];
     return m instanceof RegExp && (m.multiline || m.global);
   }), (e6) => ({
@@ -3955,9 +5162,9 @@ function findUnsupportedFlags(e5) {
   }));
 }
 function findDuplicatePatterns(e5) {
-  let m = [], h = map_default(e5, (h2) => reduce_default(e5, (e6, g) => h2.PATTERN.source === g.PATTERN.source && !includes_default(m, g) && g.PATTERN !== Lexer.NA ? (m.push(g), e6.push(g), e6) : e6, []));
-  return h = compact_default(h), map_default(filter_default(h, (e6) => e6.length > 1), (e6) => {
-    let m2 = map_default(e6, (e7) => e7.name);
+  let m = [], h = map_default$1(e5, (h2) => reduce_default$1(e5, (e6, g) => h2.PATTERN.source === g.PATTERN.source && !includes_default(m, g) && g.PATTERN !== Lexer.NA ? (m.push(g), e6.push(g), e6) : e6, []));
+  return h = compact_default(h), map_default$1(filter_default$1(h, (e6) => e6.length > 1), (e6) => {
+    let m2 = map_default$1(e6, (e7) => e7.name);
     return {
       message: `The same RegExp pattern ->${head_default(e6).PATTERN}<-has been used in all of the following Token Types: ${m2.join(", ")} <-`,
       type: LexerDefinitionErrorType.DUPLICATE_PATTERNS_FOUND,
@@ -3966,7 +5173,7 @@ function findDuplicatePatterns(e5) {
   });
 }
 function findInvalidGroupType(e5) {
-  return map_default(filter_default(e5, (e6) => {
+  return map_default$1(filter_default$1(e5, (e6) => {
     if (!has_default(e6, "GROUP")) return false;
     let m = e6.GROUP;
     return m !== Lexer.SKIPPED && m !== Lexer.NA && !isString_default(m);
@@ -3977,14 +5184,14 @@ function findInvalidGroupType(e5) {
   }));
 }
 function findModesThatDoNotExist(e5, m) {
-  return map_default(filter_default(e5, (e6) => e6.PUSH_MODE !== void 0 && !includes_default(m, e6.PUSH_MODE)), (e6) => ({
+  return map_default$1(filter_default$1(e5, (e6) => e6.PUSH_MODE !== void 0 && !includes_default(m, e6.PUSH_MODE)), (e6) => ({
     message: `Token Type: ->${e6.name}<- static 'PUSH_MODE' value cannot refer to a Lexer Mode ->${e6.PUSH_MODE}<-which does not exist`,
     type: LexerDefinitionErrorType.PUSH_MODE_DOES_NOT_EXIST,
     tokenTypes: [e6]
   }));
 }
 function findUnreachablePatterns(e5) {
-  let m = [], h = reduce_default(e5, (e6, m2, h2) => {
+  let m = [], h = reduce_default$1(e5, (e6, m2, h2) => {
     let g = m2.PATTERN;
     return g === Lexer.NA || (isString_default(g) ? e6.push({
       str: g,
@@ -3996,8 +5203,8 @@ function findUnreachablePatterns(e5) {
       tokenType: m2
     })), e6;
   }, []);
-  return forEach_default(e5, (e6, g) => {
-    forEach_default(h, ({ str: h2, idx: _, tokenType: v }) => {
+  return forEach_default$1(e5, (e6, g) => {
+    forEach_default$1(h, ({ str: h2, idx: _, tokenType: v }) => {
       if (g < _ && tryToMatchStrToPattern(h2, e6.PATTERN)) {
         let h3 = `Token: ->${v.name}<- can never be matched.
 Because it appears AFTER the Token Type ->${e6.name}<-in the lexer's definition.
@@ -4061,13 +5268,13 @@ function performRuntimeChecks(e5, m, h) {
     message: `A MultiMode Lexer cannot be initialized with a ${DEFAULT_MODE}: <${e5.defaultMode}>which does not exist
 `,
     type: LexerDefinitionErrorType.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST
-  }), has_default(e5, "modes") && forEach_default(e5.modes, (e6, m2) => {
-    forEach_default(e6, (h2, _) => {
+  }), has_default(e5, "modes") && forEach_default$1(e5.modes, (e6, m2) => {
+    forEach_default$1(e6, (h2, _) => {
       isUndefined_default(h2) ? g.push({
         message: `A Lexer cannot be initialized using an undefined Token Type. Mode:<${m2}> at index: <${_}>
 `,
         type: LexerDefinitionErrorType.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED
-      }) : has_default(h2, "LONGER_ALT") && forEach_default(isArray_default(h2.LONGER_ALT) ? h2.LONGER_ALT : [h2.LONGER_ALT], (_2) => {
+      }) : has_default(h2, "LONGER_ALT") && forEach_default$1(isArray_default(h2.LONGER_ALT) ? h2.LONGER_ALT : [h2.LONGER_ALT], (_2) => {
         !isUndefined_default(_2) && !includes_default(e6, _2) && g.push({
           message: `A MultiMode Lexer cannot be initialized with a longer_alt <${_2.name}> on token <${h2.name}> outside of mode <${m2}>
 `,
@@ -4078,8 +5285,8 @@ function performRuntimeChecks(e5, m, h) {
   }), g;
 }
 function performWarningRuntimeChecks(e5, m, h) {
-  let g = [], _ = false, v = reject_default(compact_default(flatten_default(values_default(e5.modes))), (e6) => e6[PATTERN] === Lexer.NA), y = getCharCodes(h);
-  return m && forEach_default(v, (e6) => {
+  let g = [], _ = false, v = reject_default(compact_default(flatten_default$1(values_default(e5.modes))), (e6) => e6[PATTERN] === Lexer.NA), y = getCharCodes(h);
+  return m && forEach_default$1(v, (e6) => {
     let m2 = checkLineBreaksIssues(e6, y);
     if (m2 !== false) {
       let h2 = {
@@ -4096,7 +5303,7 @@ function performWarningRuntimeChecks(e5, m, h) {
 }
 function cloneEmptyGroups(e5) {
   let m = {};
-  return forEach_default(keys_default(e5), (h) => {
+  return forEach_default$1(keys_default(e5), (h) => {
     let g = e5[h];
     if (isArray_default(g)) m[h] = [];
     else throw Error("non exhaustive match");
@@ -4151,7 +5358,7 @@ function buildLineBreakIssueMessage(e5, m) {
   throw Error("non exhaustive match");
 }
 function getCharCodes(e5) {
-  return map_default(e5, (e6) => isString_default(e6) ? e6.charCodeAt(0) : e6);
+  return map_default$1(e5, (e6) => isString_default(e6) ? e6.charCodeAt(0) : e6);
 }
 function addToMapOfArrays(e5, m, h) {
   e5[m] === void 0 ? e5[m] = [h] : e5[m].push(h);
@@ -4161,7 +5368,7 @@ function charCodeToOptimizedIndex(e5) {
   return e5 < 256 ? e5 : charCodeToOptimizedIdxMap[e5];
 }
 function initCharCodeToOptimizedIndexMap() {
-  if (isEmpty_default(charCodeToOptimizedIdxMap)) {
+  if (isEmpty_default$1(charCodeToOptimizedIdxMap)) {
     charCodeToOptimizedIdxMap = Array(65536);
     for (let e5 = 0; e5 < 65536; e5++) charCodeToOptimizedIdxMap[e5] = e5 > 255 ? 255 + ~~(e5 / 255) : e5;
   }
@@ -4177,40 +5384,40 @@ let tokenShortNameIdx = 1;
 const tokenIdxToClass = {};
 function augmentTokenTypes(e5) {
   let m = expandCategories(e5);
-  assignTokenDefaultProps(m), assignCategoriesMapProp(m), assignCategoriesTokensProp(m), forEach_default(m, (e6) => {
+  assignTokenDefaultProps(m), assignCategoriesMapProp(m), assignCategoriesTokensProp(m), forEach_default$1(m, (e6) => {
     e6.isParent = e6.categoryMatches.length > 0;
   });
 }
 function expandCategories(e5) {
   let m = clone_default(e5), h = e5, g = true;
   for (; g; ) {
-    h = compact_default(flatten_default(map_default(h, (e7) => e7.CATEGORIES)));
+    h = compact_default(flatten_default$1(map_default$1(h, (e7) => e7.CATEGORIES)));
     let e6 = difference_default(h, m);
-    m = m.concat(e6), isEmpty_default(e6) ? g = false : h = e6;
+    m = m.concat(e6), isEmpty_default$1(e6) ? g = false : h = e6;
   }
   return m;
 }
 function assignTokenDefaultProps(e5) {
-  forEach_default(e5, (e6) => {
+  forEach_default$1(e5, (e6) => {
     hasShortKeyProperty(e6) || (tokenIdxToClass[tokenShortNameIdx] = e6, e6.tokenTypeIdx = tokenShortNameIdx++), hasCategoriesProperty(e6) && !isArray_default(e6.CATEGORIES) && (e6.CATEGORIES = [e6.CATEGORIES]), hasCategoriesProperty(e6) || (e6.CATEGORIES = []), hasExtendingTokensTypesProperty(e6) || (e6.categoryMatches = []), hasExtendingTokensTypesMapProperty(e6) || (e6.categoryMatchesMap = {});
   });
 }
 function assignCategoriesTokensProp(e5) {
-  forEach_default(e5, (e6) => {
-    e6.categoryMatches = [], forEach_default(e6.categoryMatchesMap, (m, h) => {
+  forEach_default$1(e5, (e6) => {
+    e6.categoryMatches = [], forEach_default$1(e6.categoryMatchesMap, (m, h) => {
       e6.categoryMatches.push(tokenIdxToClass[h].tokenTypeIdx);
     });
   });
 }
 function assignCategoriesMapProp(e5) {
-  forEach_default(e5, (e6) => {
+  forEach_default$1(e5, (e6) => {
     singleAssignCategoriesToksMap([], e6);
   });
 }
 function singleAssignCategoriesToksMap(e5, m) {
-  forEach_default(e5, (e6) => {
+  forEach_default$1(e5, (e6) => {
     m.categoryMatchesMap[e6.tokenTypeIdx] = true;
-  }), forEach_default(m.CATEGORIES, (h) => {
+  }), forEach_default$1(m.CATEGORIES, (h) => {
     let g = e5.concat(m);
     includes_default(g, h) || singleAssignCategoriesToksMap(g, h);
   });
@@ -4282,15 +5489,15 @@ var Lexer = class {
         this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(performRuntimeChecks(h2, this.trackStartLines, this.config.lineTerminatorCharacters));
       }), this.TRACE_INIT("performWarningRuntimeChecks", () => {
         this.lexerDefinitionWarning = this.lexerDefinitionWarning.concat(performWarningRuntimeChecks(h2, this.trackStartLines, this.config.lineTerminatorCharacters));
-      })), h2.modes = h2.modes ? h2.modes : {}, forEach_default(h2.modes, (e6, m2) => {
+      })), h2.modes = h2.modes ? h2.modes : {}, forEach_default$1(h2.modes, (e6, m2) => {
         h2.modes[m2] = reject_default(e6, (e7) => isUndefined_default(e7));
       });
       let _ = keys_default(h2.modes);
-      if (forEach_default(h2.modes, (e6, h3) => {
+      if (forEach_default$1(h2.modes, (e6, h3) => {
         this.TRACE_INIT(`Mode: <${h3}> processing`, () => {
           if (this.modes.push(h3), this.config.skipValidations === false && this.TRACE_INIT("validatePatterns", () => {
             this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(validatePatterns(e6, _));
-          }), isEmpty_default(this.lexerDefinitionErrors)) {
+          }), isEmpty_default$1(this.lexerDefinitionErrors)) {
             augmentTokenTypes(e6);
             let g2;
             this.TRACE_INIT("analyzeTokenTypes", () => {
@@ -4304,11 +5511,11 @@ var Lexer = class {
             }), this.patternIdxToConfig[h3] = g2.patternIdxToConfig, this.charCodeToPatternIdxToConfig[h3] = g2.charCodeToPatternIdxToConfig, this.emptyGroups = assign_default({}, this.emptyGroups, g2.emptyGroups), this.hasCustom = g2.hasCustom || this.hasCustom, this.canModeBeOptimized[h3] = g2.canBeOptimized;
           }
         });
-      }), this.defaultMode = h2.defaultMode, !isEmpty_default(this.lexerDefinitionErrors) && !this.config.deferDefinitionErrorsHandling) {
-        let e6 = map_default(this.lexerDefinitionErrors, (e7) => e7.message).join("-----------------------\n");
+      }), this.defaultMode = h2.defaultMode, !isEmpty_default$1(this.lexerDefinitionErrors) && !this.config.deferDefinitionErrorsHandling) {
+        let e6 = map_default$1(this.lexerDefinitionErrors, (e7) => e7.message).join("-----------------------\n");
         throw Error("Errors detected in definition of Lexer:\n" + e6);
       }
-      forEach_default(this.lexerDefinitionWarning, (e6) => {
+      forEach_default$1(this.lexerDefinitionWarning, (e6) => {
         PRINT_WARNING(e6.message);
       }), this.TRACE_INIT("Choosing sub-methods implementations", () => {
         if (SUPPORT_STICKY ? (this.chopInput = identity_default, this.match = this.matchWithTest) : (this.updateLastIndex = noop_default, this.match = this.matchWithExec), g && (this.handleModes = noop_default), this.trackStartLines === false && (this.computeNewColumn = identity_default), this.trackEndLines === false && (this.updateTokenEndLineColumnLocation = noop_default), /full/i.test(this.config.positionTracking)) this.createTokenInstance = this.createFullToken;
@@ -4317,8 +5524,8 @@ var Lexer = class {
         else throw Error(`Invalid <positionTracking> config option: "${this.config.positionTracking}"`);
         this.hasCustom ? (this.addToken = this.addTokenUsingPush, this.handlePayload = this.handlePayloadWithCustom) : (this.addToken = this.addTokenUsingMemberAccess, this.handlePayload = this.handlePayloadNoCustom);
       }), this.TRACE_INIT("Failed Optimization Warnings", () => {
-        let e6 = reduce_default(this.canModeBeOptimized, (e7, m2, h3) => (m2 === false && e7.push(h3), e7), []);
-        if (m.ensureOptimizations && !isEmpty_default(e6)) throw Error(`Lexer Modes: < ${e6.join(", ")} > cannot be optimized.
+        let e6 = reduce_default$1(this.canModeBeOptimized, (e7, m2, h3) => (m2 === false && e7.push(h3), e7), []);
+        if (m.ensureOptimizations && !isEmpty_default$1(e6)) throw Error(`Lexer Modes: < ${e6.join(", ")} > cannot be optimized.
 	 Disable the "ensureOptimizations" lexer config flag to silently ignore this and run the lexer in an un-optimized mode.
 	 Or inspect the console log for details on how to resolve these issues.`);
       }), this.TRACE_INIT("clearRegExpParserCache", () => {
@@ -4329,8 +5536,8 @@ var Lexer = class {
     });
   }
   tokenize(e5, m = this.defaultMode) {
-    if (!isEmpty_default(this.lexerDefinitionErrors)) {
-      let e6 = map_default(this.lexerDefinitionErrors, (e7) => e7.message).join("-----------------------\n");
+    if (!isEmpty_default$1(this.lexerDefinitionErrors)) {
+      let e6 = map_default$1(this.lexerDefinitionErrors, (e7) => e7.message).join("-----------------------\n");
       throw Error("Unable to Tokenize because Errors detected in definition of Lexer:\n" + e6);
     }
     return this.tokenizeInternal(e5, m);
@@ -4540,12 +5747,12 @@ const defaultParserErrorProvider = {
   buildNoViableAltMessage({ expectedPathsPerAlt: e5, actual: m, previous: h, customUserDescription: g, ruleName: _ }) {
     let v = "\nbut found: '" + head_default(m).image + "'";
     return g ? "Expecting: " + g + v : `Expecting: one of these possible Token sequences:
-${map_default(map_default(reduce_default(e5, (e6, m2) => e6.concat(m2), []), (e6) => `[${map_default(e6, (e7) => tokenLabel(e7)).join(", ")}]`), (e6, m2) => `  ${m2 + 1}. ${e6}`).join("\n")}` + v;
+${map_default$1(map_default$1(reduce_default$1(e5, (e6, m2) => e6.concat(m2), []), (e6) => `[${map_default$1(e6, (e7) => tokenLabel(e7)).join(", ")}]`), (e6, m2) => `  ${m2 + 1}. ${e6}`).join("\n")}` + v;
   },
   buildEarlyExitMessage({ expectedIterationPaths: e5, actual: m, customUserDescription: h, ruleName: g }) {
     let _ = "\nbut found: '" + head_default(m).image + "'";
     return h ? "Expecting: " + h + _ : `Expecting: expecting at least one iteration which starts with one of these possible Token sequences::
-  <${map_default(e5, (e6) => `[${map_default(e6, (e7) => tokenLabel(e7)).join(",")}]`).join(" ,")}>` + _;
+  <${map_default$1(e5, (e6) => `[${map_default$1(e6, (e7) => tokenLabel(e7)).join(",")}]`).join(" ,")}>` + _;
   }
 };
 Object.freeze(defaultParserErrorProvider);
@@ -4570,7 +5777,7 @@ This is easy to accomplish by using the convention that Terminal names start wit
 and Non-Terminal names start with a lower case letter.`;
   },
   buildAlternationPrefixAmbiguityError(e5) {
-    let m = map_default(e5.prefixPath, (e6) => tokenLabel(e6)).join(", "), h = e5.alternation.idx === 0 ? "" : e5.alternation.idx;
+    let m = map_default$1(e5.prefixPath, (e6) => tokenLabel(e6)).join(", "), h = e5.alternation.idx === 0 ? "" : e5.alternation.idx;
     return `Ambiguous alternatives: <${e5.ambiguityIndices.join(" ,")}> due to common lookahead prefix
 in <OR${h}> inside <${e5.topLevelRule.name}> Rule,
 <${m}> may appears as a prefix path in all these alternatives.
@@ -4578,7 +5785,7 @@ See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#COMMON_PREFI
 For Further details.`;
   },
   buildAlternationAmbiguityError(e5) {
-    let m = map_default(e5.prefixPath, (e6) => tokenLabel(e6)).join(", "), h = e5.alternation.idx === 0 ? "" : e5.alternation.idx, g = `Ambiguous Alternatives Detected: <${e5.ambiguityIndices.join(" ,")}> in <OR${h}> inside <${e5.topLevelRule.name}> Rule,
+    let m = map_default$1(e5.prefixPath, (e6) => tokenLabel(e6)).join(", "), h = e5.alternation.idx === 0 ? "" : e5.alternation.idx, g = `Ambiguous Alternatives Detected: <${e5.ambiguityIndices.join(" ,")}> in <OR${h}> inside <${e5.topLevelRule.name}> Rule,
 <${m}> may appears as a prefix path in all these alternatives.
 `;
     return g += "See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES\nFor Further details.", g;
@@ -4605,7 +5812,7 @@ Only the last alternative may be an empty alternative.`;
     return `Left Recursion found in grammar.
 rule: <${m}> can be invoked from itself (directly or indirectly)
 without consuming any Tokens. The grammar path that causes this is: 
- ${`${m} --> ${map_default(e5.leftRecursionPath, (e6) => e6.name).concat([m]).join(" --> ")}`}
+ ${`${m} --> ${map_default$1(e5.leftRecursionPath, (e6) => e6.name).concat([m]).join(" --> ")}`}
  To fix this refactor your grammar to remove the left recursion.
 see: https://en.wikipedia.org/wiki/LL_parser#Left_factoring.`;
   },
@@ -4626,7 +5833,7 @@ var GastRefResolverVisitor = class extends GAstVisitor {
     super(), this.nameToTopRule = e5, this.errMsgProvider = m, this.errors = [];
   }
   resolveRefs() {
-    forEach_default(values_default(this.nameToTopRule), (e5) => {
+    forEach_default$1(values_default(this.nameToTopRule), (e5) => {
       this.currTopLevel = e5, e5.accept(this);
     });
   }
@@ -4661,7 +5868,7 @@ var GastRefResolverVisitor = class extends GAstVisitor {
     }
   }
   updateExpectedNext() {
-    isEmpty_default(this.ruleStack) ? (this.nextProductionName = "", this.nextProductionOccurrence = 0, this.isAtEndOfPath = true) : (this.nextProductionName = this.ruleStack.pop(), this.nextProductionOccurrence = this.occurrenceStack.pop());
+    isEmpty_default$1(this.ruleStack) ? (this.nextProductionName = "", this.nextProductionOccurrence = 0, this.isAtEndOfPath = true) : (this.nextProductionName = this.ruleStack.pop(), this.nextProductionOccurrence = this.occurrenceStack.pop());
   }
 }, NextAfterTokenWalker = class extends AbstractNextPossibleTokensWalker {
   constructor(e5, m) {
@@ -4728,8 +5935,8 @@ function possiblePathsFrom(e5, m, h = []) {
     else if (m2 instanceof RepetitionMandatoryWithSeparator) return y([new Alternative({ definition: m2.definition }), new Repetition({ definition: [new Terminal({ terminalType: m2.separator })].concat(m2.definition) })]);
     else if (m2 instanceof RepetitionWithSeparator) g = y(m2.definition.concat([new Repetition({ definition: [new Terminal({ terminalType: m2.separator })].concat(m2.definition) })]));
     else if (m2 instanceof Repetition) g = y(m2.definition.concat([new Repetition({ definition: m2.definition })]));
-    else if (m2 instanceof Alternation) return forEach_default(m2.definition, (e6) => {
-      isEmpty_default(e6.definition) === false && (g = y(e6.definition));
+    else if (m2 instanceof Alternation) return forEach_default$1(m2.definition, (e6) => {
+      isEmpty_default$1(e6.definition) === false && (g = y(e6.definition));
     }), g;
     else if (m2 instanceof Terminal) h.push(m2.terminalType);
     else throw Error("non exhaustive match");
@@ -4747,14 +5954,14 @@ function nextPossibleTokensAfter(e5, m, h, g) {
     def: e5,
     ruleStack: [],
     occurrenceStack: []
-  }); !isEmpty_default(w); ) {
+  }); !isEmpty_default$1(w); ) {
     let e6 = w.pop();
     if (e6 === y) {
       b && last_default(w).idx <= S && w.pop();
       continue;
     }
     let g2 = e6.def, T = e6.idx, E = e6.ruleStack, D = e6.occurrenceStack;
-    if (isEmpty_default(g2)) continue;
+    if (isEmpty_default$1(g2)) continue;
     let O = g2[0];
     if (O === _) {
       let e7 = {
@@ -4927,7 +6134,7 @@ function buildLookaheadFuncForOptionalProd(e5, m, h, g, _, v) {
 function buildAlternativesLookAheadFunc(e5, m, h, g) {
   let _ = e5.length, v = every_default(e5, (e6) => every_default(e6, (e7) => e7.length === 1));
   if (m) return function(m2) {
-    let g2 = map_default(m2, (e6) => e6.GATE);
+    let g2 = map_default$1(m2, (e6) => e6.GATE);
     for (let m3 = 0; m3 < _; m3++) {
       let _2 = e5[m3], v2 = _2.length, y = g2[m3];
       if (!(y !== void 0 && y.call(this) === false)) nextPath: for (let e6 = 0; e6 < v2; e6++) {
@@ -4938,8 +6145,8 @@ function buildAlternativesLookAheadFunc(e5, m, h, g) {
     }
   };
   if (v && !g) {
-    let m2 = reduce_default(map_default(e5, (e6) => flatten_default(e6)), (e6, m3, h2) => (forEach_default(m3, (m4) => {
-      has_default(e6, m4.tokenTypeIdx) || (e6[m4.tokenTypeIdx] = h2), forEach_default(m4.categoryMatches, (m5) => {
+    let m2 = reduce_default$1(map_default$1(e5, (e6) => flatten_default$1(e6)), (e6, m3, h2) => (forEach_default$1(m3, (m4) => {
+      has_default(e6, m4.tokenTypeIdx) || (e6[m4.tokenTypeIdx] = h2), forEach_default$1(m4.categoryMatches, (m5) => {
         has_default(e6, m5) || (e6[m5] = h2);
       });
     }), e6), {});
@@ -4960,14 +6167,14 @@ function buildAlternativesLookAheadFunc(e5, m, h, g) {
 function buildSingleAlternativeLookaheadFunction(e5, m, h) {
   let g = every_default(e5, (e6) => e6.length === 1), _ = e5.length;
   if (g && !h) {
-    let m2 = flatten_default(e5);
-    if (m2.length === 1 && isEmpty_default(m2[0].categoryMatches)) {
+    let m2 = flatten_default$1(e5);
+    if (m2.length === 1 && isEmpty_default$1(m2[0].categoryMatches)) {
       let e6 = m2[0].tokenTypeIdx;
       return function() {
         return this.LA(1).tokenTypeIdx === e6;
       };
     } else {
-      let e6 = reduce_default(m2, (e7, m3, h2) => (e7[m3.tokenTypeIdx] = true, forEach_default(m3.categoryMatches, (m4) => {
+      let e6 = reduce_default$1(m2, (e7, m3, h2) => (e7[m3.tokenTypeIdx] = true, forEach_default$1(m3.categoryMatches, (m4) => {
         e7[m4] = true;
       }), e7), []);
       return function() {
@@ -5064,10 +6271,10 @@ function isUniquePrefixHash(e5, m, h) {
   return true;
 }
 function lookAheadSequenceFromAlternatives(e5, m) {
-  let h = map_default(e5, (e6) => possiblePathsFrom([e6], 1)), g = initializeArrayOfArrays(h.length), _ = map_default(h, (e6) => {
+  let h = map_default$1(e5, (e6) => possiblePathsFrom([e6], 1)), g = initializeArrayOfArrays(h.length), _ = map_default$1(h, (e6) => {
     let m2 = {};
-    return forEach_default(e6, (e7) => {
-      forEach_default(pathToHashKeys(e7.partialPath), (e8) => {
+    return forEach_default$1(e6, (e7) => {
+      forEach_default$1(pathToHashKeys(e7.partialPath), (e8) => {
         m2[e8] = true;
       });
     }), m2;
@@ -5079,7 +6286,7 @@ function lookAheadSequenceFromAlternatives(e5, m) {
       let b = h2[y];
       for (let h3 = 0; h3 < b.length; h3++) {
         let x = b[h3].partialPath, S = b[h3].suffixDef, C = pathToHashKeys(x);
-        if (isUniquePrefixHash(_, C, y) || isEmpty_default(S) || x.length === m) {
+        if (isUniquePrefixHash(_, C, y) || isEmpty_default$1(S) || x.length === m) {
           let e7 = g[y];
           if (containsPath(e7, x) === false) {
             e7.push(x);
@@ -5090,8 +6297,8 @@ function lookAheadSequenceFromAlternatives(e5, m) {
           }
         } else {
           let m2 = possiblePathsFrom(S, e6 + 1, x);
-          v[y] = v[y].concat(m2), forEach_default(m2, (e7) => {
-            forEach_default(pathToHashKeys(e7.partialPath), (e8) => {
+          v[y] = v[y].concat(m2), forEach_default$1(m2, (e7) => {
+            forEach_default$1(pathToHashKeys(e7.partialPath), (e8) => {
               _[y][e8] = true;
             });
           });
@@ -5131,24 +6338,24 @@ function isStrictPrefixOfPath(e5, m) {
   });
 }
 function areTokenCategoriesNotUsed(e5) {
-  return every_default(e5, (e6) => every_default(e6, (e7) => every_default(e7, (e8) => isEmpty_default(e8.categoryMatches))));
+  return every_default(e5, (e6) => every_default(e6, (e7) => every_default(e7, (e8) => isEmpty_default$1(e8.categoryMatches))));
 }
 function validateLookahead(e5) {
-  return map_default(e5.lookaheadStrategy.validate({
+  return map_default$1(e5.lookaheadStrategy.validate({
     rules: e5.rules,
     tokenTypes: e5.tokenTypes,
     grammarName: e5.grammarName
   }), (e6) => Object.assign({ type: ParserDefinitionErrorType.CUSTOM_LOOKAHEAD_VALIDATION }, e6));
 }
 function validateGrammar$1(e5, m, h, g) {
-  let _ = flatMap_default(e5, (e6) => validateDuplicateProductions(e6, h)), v = checkTerminalAndNoneTerminalsNameSpace(e5, m, h), y = flatMap_default(e5, (e6) => validateTooManyAlts(e6, h)), b = flatMap_default(e5, (m2) => validateRuleDoesNotAlreadyExist(m2, e5, g, h));
+  let _ = flatMap_default$1(e5, (e6) => validateDuplicateProductions(e6, h)), v = checkTerminalAndNoneTerminalsNameSpace(e5, m, h), y = flatMap_default$1(e5, (e6) => validateTooManyAlts(e6, h)), b = flatMap_default$1(e5, (m2) => validateRuleDoesNotAlreadyExist(m2, e5, g, h));
   return _.concat(v, y, b);
 }
 function validateDuplicateProductions(e5, m) {
   let h = new OccurrenceValidationCollector();
   e5.accept(h);
   let g = h.allProductions;
-  return map_default(values_default(pickBy_default(groupBy_default(g, identifyProductionForDuplicates), (e6) => e6.length > 1)), (h2) => {
+  return map_default$1(values_default(pickBy_default(groupBy_default(g, identifyProductionForDuplicates), (e6) => e6.length > 1)), (h2) => {
     let g2 = head_default(h2), _ = m.buildDuplicateFoundError(e5, h2), v = getProductionDslName$1(g2), y = {
       message: _,
       type: ParserDefinitionErrorType.DUPLICATE_PRODUCTIONS,
@@ -5196,7 +6403,7 @@ var OccurrenceValidationCollector = class extends GAstVisitor {
 };
 function validateRuleDoesNotAlreadyExist(e5, m, h, g) {
   let _ = [];
-  if (reduce_default(m, (m2, h2) => h2.name === e5.name ? m2 + 1 : m2, 0) > 1) {
+  if (reduce_default$1(m, (m2, h2) => h2.name === e5.name ? m2 + 1 : m2, 0) > 1) {
     let m2 = g.buildDuplicateRuleNameError({
       topLevelRule: e5,
       grammarName: h
@@ -5219,7 +6426,7 @@ function validateRuleIsOverridden(e5, m, h) {
 }
 function validateNoLeftRecursion(e5, m, h, g = []) {
   let _ = [], v = getFirstNoneTerminal(m.definition);
-  if (isEmpty_default(v)) return [];
+  if (isEmpty_default$1(v)) return [];
   {
     let m2 = e5.name;
     includes_default(v, e5) && _.push({
@@ -5230,7 +6437,7 @@ function validateNoLeftRecursion(e5, m, h, g = []) {
       type: ParserDefinitionErrorType.LEFT_RECURSION,
       ruleName: m2
     });
-    let y = flatMap_default(difference_default(v, g.concat([e5])), (m3) => {
+    let y = flatMap_default$1(difference_default(v, g.concat([e5])), (m3) => {
       let _2 = clone_default(g);
       return _2.push(m3), validateNoLeftRecursion(e5, m3, h, _2);
     });
@@ -5239,11 +6446,11 @@ function validateNoLeftRecursion(e5, m, h, g = []) {
 }
 function getFirstNoneTerminal(e5) {
   let m = [];
-  if (isEmpty_default(e5)) return m;
+  if (isEmpty_default$1(e5)) return m;
   let h = head_default(e5);
   if (h instanceof NonTerminal) m.push(h.referencedRule);
   else if (h instanceof Alternative || h instanceof Option$1 || h instanceof RepetitionMandatory || h instanceof RepetitionMandatoryWithSeparator || h instanceof RepetitionWithSeparator || h instanceof Repetition) m = m.concat(getFirstNoneTerminal(h.definition));
-  else if (h instanceof Alternation) m = flatten_default(map_default(h.definition, (e6) => getFirstNoneTerminal(e6.definition)));
+  else if (h instanceof Alternation) m = flatten_default$1(map_default$1(h.definition, (e6) => getFirstNoneTerminal(e6.definition)));
   else if (!(h instanceof Terminal)) throw Error("non exhaustive match");
   let g = isOptionalProd(h), _ = e5.length > 1;
   if (g && _) {
@@ -5263,7 +6470,7 @@ function validateEmptyOrAlternative(e5, m) {
   let h = new OrCollector();
   e5.accept(h);
   let g = h.alternations;
-  return flatMap_default(g, (h2) => flatMap_default(dropRight_default(h2.definition), (g2, _) => isEmpty_default(nextPossibleTokensAfter([g2], [], tokenStructuredMatcher, 1)) ? [{
+  return flatMap_default$1(g, (h2) => flatMap_default$1(dropRight_default(h2.definition), (g2, _) => isEmpty_default$1(nextPossibleTokensAfter([g2], [], tokenStructuredMatcher, 1)) ? [{
     message: m.buildEmptyAlternationError({
       topLevelRule: e5,
       alternation: h2,
@@ -5279,7 +6486,7 @@ function validateAmbiguousAlternationAlternatives(e5, m, h) {
   let g = new OrCollector();
   e5.accept(g);
   let _ = g.alternations;
-  return _ = reject_default(_, (e6) => e6.ignoreAmbiguities === true), flatMap_default(_, (g2) => {
+  return _ = reject_default(_, (e6) => e6.ignoreAmbiguities === true), flatMap_default$1(_, (g2) => {
     let _2 = g2.idx, v = getLookaheadPathsForOr(_2, e5, g2.maxLookahead || m, g2), y = checkAlternativesAmbiguities(v, g2, e5, h), b = checkPrefixAlternativesAmbiguities(v, g2, e5, h);
     return y.concat(b);
   });
@@ -5305,7 +6512,7 @@ function validateTooManyAlts(e5, m) {
   let h = new OrCollector();
   e5.accept(h);
   let g = h.alternations;
-  return flatMap_default(g, (h2) => h2.definition.length > 255 ? [{
+  return flatMap_default$1(g, (h2) => h2.definition.length > 255 ? [{
     message: m.buildTooManyAlternativesError({
       topLevelRule: e5,
       alternation: h2
@@ -5317,13 +6524,13 @@ function validateTooManyAlts(e5, m) {
 }
 function validateSomeNonEmptyLookaheadPath(e5, m, h) {
   let g = [];
-  return forEach_default(e5, (e6) => {
+  return forEach_default$1(e5, (e6) => {
     let _ = new RepetitionCollector();
     e6.accept(_);
     let v = _.allProductions;
-    forEach_default(v, (_2) => {
+    forEach_default$1(v, (_2) => {
       let v2 = getProdType$1(_2), y = _2.maxLookahead || m, b = _2.idx, x = getLookaheadPathsForOptionalProd(b, e6, v2, y)[0];
-      if (isEmpty_default(flatten_default(x))) {
+      if (isEmpty_default$1(flatten_default$1(x))) {
         let m2 = h.buildEmptyRepetitionError({
           topLevelRule: e6,
           repetition: _2
@@ -5339,16 +6546,16 @@ function validateSomeNonEmptyLookaheadPath(e5, m, h) {
 }
 function checkAlternativesAmbiguities(e5, m, h, g) {
   let _ = [];
-  return map_default(reduce_default(e5, (h2, g2, v) => (m.definition[v].ignoreAmbiguities === true || forEach_default(g2, (g3) => {
+  return map_default$1(reduce_default$1(e5, (h2, g2, v) => (m.definition[v].ignoreAmbiguities === true || forEach_default$1(g2, (g3) => {
     let y = [v];
-    forEach_default(e5, (e6, h3) => {
+    forEach_default$1(e5, (e6, h3) => {
       v !== h3 && containsPath(e6, g3) && m.definition[h3].ignoreAmbiguities !== true && y.push(h3);
     }), y.length > 1 && !containsPath(_, g3) && (_.push(g3), h2.push({
       alts: y,
       path: g3
     }));
   }), h2), []), (e6) => {
-    let _2 = map_default(e6.alts, (e7) => e7 + 1);
+    let _2 = map_default$1(e6.alts, (e7) => e7 + 1);
     return {
       message: g.buildAlternationAmbiguityError({
         topLevelRule: h,
@@ -5364,17 +6571,17 @@ function checkAlternativesAmbiguities(e5, m, h, g) {
   });
 }
 function checkPrefixAlternativesAmbiguities(e5, m, h, g) {
-  let _ = reduce_default(e5, (e6, m2, h2) => {
-    let g2 = map_default(m2, (e7) => ({
+  let _ = reduce_default$1(e5, (e6, m2, h2) => {
+    let g2 = map_default$1(m2, (e7) => ({
       idx: h2,
       path: e7
     }));
     return e6.concat(g2);
   }, []);
-  return compact_default(flatMap_default(_, (e6) => {
+  return compact_default(flatMap_default$1(_, (e6) => {
     if (m.definition[e6.idx].ignoreAmbiguities === true) return [];
     let v = e6.idx, y = e6.path;
-    return map_default(filter_default(_, (e7) => m.definition[e7.idx].ignoreAmbiguities !== true && e7.idx < v && isStrictPrefixOfPath(e7.path, y)), (e7) => {
+    return map_default$1(filter_default$1(_, (e7) => m.definition[e7.idx].ignoreAmbiguities !== true && e7.idx < v && isStrictPrefixOfPath(e7.path, y)), (e7) => {
       let _2 = [e7.idx + 1, v + 1], y2 = m.idx === 0 ? "" : m.idx;
       return {
         message: g.buildAlternationPrefixAmbiguityError({
@@ -5392,8 +6599,8 @@ function checkPrefixAlternativesAmbiguities(e5, m, h, g) {
   }));
 }
 function checkTerminalAndNoneTerminalsNameSpace(e5, m, h) {
-  let g = [], _ = map_default(m, (e6) => e6.name);
-  return forEach_default(e5, (e6) => {
+  let g = [], _ = map_default$1(m, (e6) => e6.name);
+  return forEach_default$1(e5, (e6) => {
     let m2 = e6.name;
     if (includes_default(_, m2)) {
       let _2 = h.buildNamespaceConflictError(e6);
@@ -5407,7 +6614,7 @@ function checkTerminalAndNoneTerminalsNameSpace(e5, m, h) {
 }
 function resolveGrammar(e5) {
   let m = defaults_default(e5, { errMsgProvider: defaultGrammarResolverErrorProvider }), h = {};
-  return forEach_default(e5.rules, (e6) => {
+  return forEach_default$1(e5.rules, (e6) => {
     h[e6.name] = e6;
   }), resolveGrammar$1(h, m.errMsgProvider);
 }
@@ -5502,7 +6709,7 @@ var InRuleRecoveryException = class extends Error {
     return this.canRecoverWithSingleTokenInsertion(e5, m) || this.canRecoverWithSingleTokenDeletion(e5);
   }
   canRecoverWithSingleTokenInsertion(e5, m) {
-    if (!this.canTokenTypeBeInsertedInRecovery(e5) || isEmpty_default(m)) return false;
+    if (!this.canTokenTypeBeInsertedInRecovery(e5) || isEmpty_default$1(m)) return false;
     let h = this.LA(1);
     return find_default(m, (e6) => this.tokenMatcher(h, e6)) !== void 0;
   }
@@ -5532,14 +6739,14 @@ var InRuleRecoveryException = class extends Error {
   }
   buildFullFollowKeyStack() {
     let e5 = this.RULE_STACK, m = this.RULE_OCCURRENCE_STACK;
-    return map_default(e5, (h, g) => g === 0 ? EOF_FOLLOW_KEY : {
+    return map_default$1(e5, (h, g) => g === 0 ? EOF_FOLLOW_KEY : {
       ruleName: this.shortRuleNameToFullName(h),
       idxInCallingRule: m[g],
       inRule: this.shortRuleNameToFullName(e5[g - 1])
     });
   }
   flattenFollowSet() {
-    return flatten_default(map_default(this.buildFullFollowKeyStack(), (e5) => this.getFollowSetFromFollowKey(e5)));
+    return flatten_default$1(map_default$1(this.buildFullFollowKeyStack(), (e5) => this.getFollowSetFromFollowKey(e5)));
   }
   getFollowSetFromFollowKey(e5) {
     if (e5 === EOF_FOLLOW_KEY) return [EOF];
@@ -5565,7 +6772,7 @@ var InRuleRecoveryException = class extends Error {
     };
   }
   getHumanReadableRuleStack() {
-    return map_default(this.RULE_STACK, (e5) => this.shortRuleNameToFullName(e5));
+    return map_default$1(this.RULE_STACK, (e5) => this.shortRuleNameToFullName(e5));
   }
 };
 function attemptInRepetitionRecovery(e5, m, h, g, _, v, y) {
@@ -5587,7 +6794,7 @@ var LLkLookaheadStrategy = class {
   }
   validate(e5) {
     let m = this.validateNoLeftRecursion(e5.rules);
-    if (isEmpty_default(m)) {
+    if (isEmpty_default$1(m)) {
       let h = this.validateEmptyOrAlternatives(e5.rules), g = this.validateAmbiguousAlternationAlternatives(e5.rules, this.maxLookahead), _ = this.validateSomeNonEmptyLookaheadPath(e5.rules, this.maxLookahead);
       return [
         ...m,
@@ -5599,13 +6806,13 @@ var LLkLookaheadStrategy = class {
     return m;
   }
   validateNoLeftRecursion(e5) {
-    return flatMap_default(e5, (e6) => validateNoLeftRecursion(e6, e6, defaultGrammarValidatorErrorProvider));
+    return flatMap_default$1(e5, (e6) => validateNoLeftRecursion(e6, e6, defaultGrammarValidatorErrorProvider));
   }
   validateEmptyOrAlternatives(e5) {
-    return flatMap_default(e5, (e6) => validateEmptyOrAlternative(e6, defaultGrammarValidatorErrorProvider));
+    return flatMap_default$1(e5, (e6) => validateEmptyOrAlternative(e6, defaultGrammarValidatorErrorProvider));
   }
   validateAmbiguousAlternationAlternatives(e5, m) {
-    return flatMap_default(e5, (e6) => validateAmbiguousAlternationAlternatives(e6, m, defaultGrammarValidatorErrorProvider));
+    return flatMap_default$1(e5, (e6) => validateAmbiguousAlternationAlternatives(e6, m, defaultGrammarValidatorErrorProvider));
   }
   validateSomeNonEmptyLookaheadPath(e5, m) {
     return validateSomeNonEmptyLookaheadPath(e5, m, defaultGrammarValidatorErrorProvider);
@@ -5621,10 +6828,10 @@ var LLkLookaheadStrategy = class {
     this.dynamicTokensEnabled = has_default(e5, "dynamicTokensEnabled") ? e5.dynamicTokensEnabled : DEFAULT_PARSER_CONFIG.dynamicTokensEnabled, this.maxLookahead = has_default(e5, "maxLookahead") ? e5.maxLookahead : DEFAULT_PARSER_CONFIG.maxLookahead, this.lookaheadStrategy = has_default(e5, "lookaheadStrategy") ? e5.lookaheadStrategy : new LLkLookaheadStrategy({ maxLookahead: this.maxLookahead }), this.lookAheadFuncsCache = /* @__PURE__ */ new Map();
   }
   preComputeLookaheadFunctions(e5) {
-    forEach_default(e5, (e6) => {
+    forEach_default$1(e5, (e6) => {
       this.TRACE_INIT(`${e6.name} Rule Lookahead`, () => {
         let { alternation: m, repetition: h, option: g, repetitionMandatory: _, repetitionMandatoryWithSeparator: v, repetitionWithSeparator: y } = collectMethods(e6);
-        forEach_default(m, (m2) => {
+        forEach_default$1(m, (m2) => {
           let h2 = m2.idx === 0 ? "" : m2.idx;
           this.TRACE_INIT(`${getProductionDslName$1(m2)}${h2}`, () => {
             let h3 = this.lookaheadStrategy.buildLookaheadForAlternation({
@@ -5636,15 +6843,15 @@ var LLkLookaheadStrategy = class {
             }), g2 = getKeyForAutomaticLookahead(this.fullRuleNameToShort[e6.name], 256, m2.idx);
             this.setLaFuncCache(g2, h3);
           });
-        }), forEach_default(h, (m2) => {
+        }), forEach_default$1(h, (m2) => {
           this.computeLookaheadFunc(e6, m2.idx, 768, "Repetition", m2.maxLookahead, getProductionDslName$1(m2));
-        }), forEach_default(g, (m2) => {
+        }), forEach_default$1(g, (m2) => {
           this.computeLookaheadFunc(e6, m2.idx, 512, "Option", m2.maxLookahead, getProductionDslName$1(m2));
-        }), forEach_default(_, (m2) => {
+        }), forEach_default$1(_, (m2) => {
           this.computeLookaheadFunc(e6, m2.idx, AT_LEAST_ONE_IDX, "RepetitionMandatory", m2.maxLookahead, getProductionDslName$1(m2));
-        }), forEach_default(v, (m2) => {
+        }), forEach_default$1(v, (m2) => {
           this.computeLookaheadFunc(e6, m2.idx, AT_LEAST_ONE_SEP_IDX, "RepetitionMandatoryWithSeparator", m2.maxLookahead, getProductionDslName$1(m2));
-        }), forEach_default(y, (m2) => {
+        }), forEach_default$1(y, (m2) => {
           this.computeLookaheadFunc(e6, m2.idx, MANY_SEP_IDX, "RepetitionWithSeparator", m2.maxLookahead, getProductionDslName$1(m2));
         });
       });
@@ -5757,8 +6964,8 @@ function createBaseSemanticVisitorConstructor(e5, m) {
     },
     validateVisitor: function() {
       let e6 = validateVisitor(this, m);
-      if (!isEmpty_default(e6)) {
-        let m2 = map_default(e6, (e7) => e7.msg);
+      if (!isEmpty_default$1(e6)) {
+        let m2 = map_default$1(e6, (e7) => e7.msg);
         throw Error(`Errors Detected in CST Visitor <${this.constructor.name}>:
 	${m2.join("\n\n").replace(/\n/g, "\n	")}`);
       }
@@ -5770,7 +6977,7 @@ function createBaseVisitorConstructorWithDefaults(e5, m, h) {
   };
   defineNameProp(g, e5 + "BaseSemanticsWithDefaults");
   let _ = Object.create(h.prototype);
-  return forEach_default(m, (e6) => {
+  return forEach_default$1(m, (e6) => {
     _[e6] = defaultVisit;
   }), g.prototype = _, g.prototype.constructor = g, g;
 }
@@ -5782,7 +6989,7 @@ function validateVisitor(e5, m) {
   return validateMissingCstMethods(e5, m);
 }
 function validateMissingCstMethods(e5, m) {
-  return compact_default(map_default(filter_default(m, (m2) => isFunction_default(e5[m2]) === false), (m2) => ({
+  return compact_default(map_default$1(filter_default$1(m, (m2) => isFunction_default(e5[m2]) === false), (m2) => ({
     msg: `Missing visitor method: <${m2}> on ${e5.constructor.name} CST Visitor.`,
     type: CstVisitorDefinitionError.MISSING_METHOD,
     methodName: m2
@@ -6225,14 +7432,14 @@ var TreeBuilder = class {
   initRecognizerEngine(e5, m) {
     if (this.className = this.constructor.name, this.shortRuleNameToFull = {}, this.fullRuleNameToShort = {}, this.ruleShortNameIdx = 256, this.tokenMatcher = tokenStructuredMatcherNoCategories, this.subruleIdx = 0, this.definedRulesNames = [], this.tokensMap = {}, this.isBackTrackingStack = [], this.RULE_STACK = [], this.RULE_OCCURRENCE_STACK = [], this.gastProductionsCache = {}, has_default(m, "serializedGrammar")) throw Error("The Parser's configuration can no longer contain a <serializedGrammar> property.\n	See: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_6-0-0\n	For Further details.");
     if (isArray_default(e5)) {
-      if (isEmpty_default(e5)) throw Error("A Token Vocabulary cannot be empty.\n	Note that the first argument for the parser constructor\n	is no longer a Token vector (since v4.0).");
+      if (isEmpty_default$1(e5)) throw Error("A Token Vocabulary cannot be empty.\n	Note that the first argument for the parser constructor\n	is no longer a Token vector (since v4.0).");
       if (typeof e5[0].startOffset == "number") throw Error("The Parser constructor no longer accepts a token vector as the first argument.\n	See: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_4-0-0\n	For Further details.");
     }
-    if (isArray_default(e5)) this.tokensMap = reduce_default(e5, (e6, m2) => (e6[m2.name] = m2, e6), {});
-    else if (has_default(e5, "modes") && every_default(flatten_default(values_default(e5.modes)), isTokenType)) this.tokensMap = reduce_default(uniq_default(flatten_default(values_default(e5.modes))), (e6, m2) => (e6[m2.name] = m2, e6), {});
+    if (isArray_default(e5)) this.tokensMap = reduce_default$1(e5, (e6, m2) => (e6[m2.name] = m2, e6), {});
+    else if (has_default(e5, "modes") && every_default(flatten_default$1(values_default(e5.modes)), isTokenType)) this.tokensMap = reduce_default$1(uniq_default(flatten_default$1(values_default(e5.modes))), (e6, m2) => (e6[m2.name] = m2, e6), {});
     else if (isObject_default(e5)) this.tokensMap = clone_default(e5);
     else throw Error("<tokensDictionary> argument must be An Array of Token constructors, A dictionary of Token constructors or an IMultiModeLexerDefinition");
-    this.tokensMap.EOF = EOF, this.tokenMatcher = every_default(has_default(e5, "modes") ? flatten_default(values_default(e5.modes)) : values_default(e5), (e6) => isEmpty_default(e6.categoryMatches)) ? tokenStructuredMatcherNoCategories : tokenStructuredMatcher, augmentTokenTypes(values_default(this.tokensMap));
+    this.tokensMap.EOF = EOF, this.tokenMatcher = every_default(has_default(e5, "modes") ? flatten_default$1(values_default(e5.modes)) : values_default(e5), (e6) => isEmpty_default$1(e6.categoryMatches)) ? tokenStructuredMatcherNoCategories : tokenStructuredMatcher, augmentTokenTypes(values_default(this.tokensMap));
   }
   defineRule(e5, m, h) {
     if (this.selfAnalysisDone) throw Error(`Grammar rule <${e5}> may not be defined after the 'performSelfAnalysis' method has been called'
@@ -6672,14 +7879,14 @@ function recordProd(e5, m, h, g = false) {
 }
 function recordOrProd(e5, m) {
   assertMethodIdxIsValid(m);
-  let h = last_default(this.recordingProdStack), g = isArray_default(e5) === false, _ = g === false ? e5 : e5.DEF, y = new Alternation({
+  let h = last_default(this.recordingProdStack), g = isArray_default(e5) === false, _ = g === false ? e5 : e5.DEF, v = new Alternation({
     definition: [],
     idx: m,
     ignoreAmbiguities: g && e5.IGNORE_AMBIGUITIES === true
   });
-  return has_default(e5, "MAX_LOOKAHEAD") && (y.maxLookahead = e5.MAX_LOOKAHEAD), y.hasPredicates = some_default(_, (e6) => isFunction_default(e6.GATE)), h.definition.push(y), forEach_default(_, (e6) => {
+  return has_default(e5, "MAX_LOOKAHEAD") && (v.maxLookahead = e5.MAX_LOOKAHEAD), v.hasPredicates = some_default(_, (e6) => isFunction_default(e6.GATE)), h.definition.push(v), forEach_default$1(_, (e6) => {
     let m2 = new Alternative({ definition: [] });
-    y.definition.push(m2), has_default(e6, "IGNORE_AMBIGUITIES") ? m2.ignoreAmbiguities = e6.IGNORE_AMBIGUITIES : has_default(e6, "GATE") && (m2.ignoreAmbiguities = true), this.recordingProdStack.push(m2), e6.ALT.call(this), this.recordingProdStack.pop();
+    v.definition.push(m2), has_default(e6, "IGNORE_AMBIGUITIES") ? m2.ignoreAmbiguities = e6.IGNORE_AMBIGUITIES : has_default(e6, "GATE") && (m2.ignoreAmbiguities = true), this.recordingProdStack.push(m2), e6.ALT.call(this), this.recordingProdStack.pop();
   }), RECORDING_NULL_OBJECT;
 }
 function getIdxSuffix(e5) {
@@ -6757,7 +7964,7 @@ var Parser = class e2 {
         toFastProperties(this);
       }), this.TRACE_INIT("Grammar Recording", () => {
         try {
-          this.enableRecording(), forEach_default(this.definedRulesNames, (e5) => {
+          this.enableRecording(), forEach_default$1(this.definedRulesNames, (e5) => {
             let m2 = this[e5].originalGrammarAction, h2;
             this.TRACE_INIT(`${e5} Rule`, () => {
               h2 = this.topLevelRuleRecord(e5, m2);
@@ -6771,7 +7978,7 @@ var Parser = class e2 {
       if (this.TRACE_INIT("Grammar Resolving", () => {
         g = resolveGrammar({ rules: values_default(this.gastProductionsCache) }), this.definitionErrors = this.definitionErrors.concat(g);
       }), this.TRACE_INIT("Grammar Validations", () => {
-        if (isEmpty_default(g) && this.skipValidations === false) {
+        if (isEmpty_default$1(g) && this.skipValidations === false) {
           let e5 = validateGrammar({
             rules: values_default(this.gastProductionsCache),
             tokenTypes: values_default(this.tokensMap),
@@ -6785,12 +7992,12 @@ var Parser = class e2 {
           });
           this.definitionErrors = this.definitionErrors.concat(e5, m2);
         }
-      }), isEmpty_default(this.definitionErrors) && (this.recoveryEnabled && this.TRACE_INIT("computeAllProdsFollows", () => {
+      }), isEmpty_default$1(this.definitionErrors) && (this.recoveryEnabled && this.TRACE_INIT("computeAllProdsFollows", () => {
         this.resyncFollows = computeAllProdsFollows(values_default(this.gastProductionsCache));
       }), this.TRACE_INIT("ComputeLookaheadFunctions", () => {
         var e5, m2;
         (m2 = (e5 = this.lookaheadStrategy).initialize) == null || m2.call(e5, { rules: values_default(this.gastProductionsCache) }), this.preComputeLookaheadFunctions(values_default(this.gastProductionsCache));
-      })), !e2.DEFER_DEFINITION_ERRORS_HANDLING && !isEmpty_default(this.definitionErrors)) throw m = map_default(this.definitionErrors, (e5) => e5.message), Error(`Parser Definition Errors detected:
+      })), !e2.DEFER_DEFINITION_ERRORS_HANDLING && !isEmpty_default$1(this.definitionErrors)) throw m = map_default$1(this.definitionErrors, (e5) => e5.message), Error(`Parser Definition Errors detected:
  ${m.join("\n-------------------------------\n")}`);
     });
   }
@@ -7077,14 +8284,14 @@ var PredicateSet = class {
     return [];
   }
   buildLookaheadForAlternation(e5) {
-    let { prodOccurrence: m, rule: h, hasPredicates: g, dynamicTokensEnabled: _ } = e5, v = this.dfas, y = this.logging, b = buildATNKey(h, "Alternation", m), x = this.atn.decisionMap[b].decision, S = map_default(getLookaheadPaths({
+    let { prodOccurrence: m, rule: h, hasPredicates: g, dynamicTokensEnabled: _ } = e5, v = this.dfas, y = this.logging, S = buildATNKey(h, "Alternation", m), C = this.atn.decisionMap[S].decision, w = map_default(getLookaheadPaths({
       maxLookahead: 1,
       occurrence: m,
       prodType: "Alternation",
       rule: h
     }), (e6) => map_default(e6, (e7) => e7[0]));
-    if (isLL1Sequence(S, false) && !_) {
-      let e6 = reduce_default(S, (e7, m2, h2) => (forEach_default(m2, (m3) => {
+    if (isLL1Sequence(w, false) && !_) {
+      let e6 = reduce_default(w, (e7, m2, h2) => (forEach_default(m2, (m3) => {
         m3 && (e7[m3.tokenTypeIdx] = h2, forEach_default(m3.categoryMatches, (m4) => {
           e7[m4] = h2;
         }));
@@ -7106,23 +8313,23 @@ var PredicateSet = class {
         let h3 = e6 == null ? void 0 : e6[g3].GATE;
         m2.set(g3, h3 === void 0 || h3.call(this));
       }
-      let g2 = adaptivePredict.call(this, v, x, m2, y);
+      let g2 = adaptivePredict.call(this, v, C, m2, y);
       return typeof g2 == "number" ? g2 : void 0;
     };
     else return function() {
-      let e6 = adaptivePredict.call(this, v, x, EMPTY_PREDICATES, y);
+      let e6 = adaptivePredict.call(this, v, C, EMPTY_PREDICATES, y);
       return typeof e6 == "number" ? e6 : void 0;
     };
   }
   buildLookaheadForOptional(e5) {
-    let { prodOccurrence: m, rule: h, prodType: g, dynamicTokensEnabled: _ } = e5, v = this.dfas, y = this.logging, b = buildATNKey(h, g, m), x = this.atn.decisionMap[b].decision, S = map_default(getLookaheadPaths({
+    let { prodOccurrence: m, rule: h, prodType: g, dynamicTokensEnabled: _ } = e5, y = this.dfas, S = this.logging, C = buildATNKey(h, g, m), E = this.atn.decisionMap[C].decision, D = map_default(getLookaheadPaths({
       maxLookahead: 1,
       occurrence: m,
       prodType: g,
       rule: h
     }), (e6) => map_default(e6, (e7) => e7[0]));
-    if (isLL1Sequence(S) && S[0][0] && !_) {
-      let e6 = S[0], m2 = flatten_default(e6);
+    if (isLL1Sequence(D) && D[0][0] && !_) {
+      let e6 = D[0], m2 = flatten_default(e6);
       if (m2.length === 1 && isEmpty_default(m2[0].categoryMatches)) {
         let e7 = m2[0].tokenTypeIdx;
         return function() {
@@ -7138,7 +8345,7 @@ var PredicateSet = class {
       }
     }
     return function() {
-      let e6 = adaptivePredict.call(this, v, x, EMPTY_PREDICATES, y);
+      let e6 = adaptivePredict.call(this, y, E, EMPTY_PREDICATES, S);
       return typeof e6 == "object" ? false : e6 === 0;
     };
   }