es-toolkit 1.52.0-dev.2139 → 1.52.0-dev.2141

package/dist/compat/_internal/isKey.js

@@ -1,5 +1,6 @@
+const require_hasOwn = require("./hasOwn.js");
 const require_isSymbol = require("../predicate/isSymbol.js");
-//#region src/compat/_internal/isKey.ts
+// src/compat/_internal/isKey.ts
 /**  Matches any deep property path. (e.g. `a.b[0].c`)*/
 const regexIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/;
 /**  Matches any word character (alphanumeric & underscore).*/
@@ -20,7 +21,6 @@ const regexIsPlainProp = /^\w*$/;
 function isKey(value, object) {
 	if (Array.isArray(value)) return false;
 	if (typeof value === "number" || typeof value === "boolean" || value == null || require_isSymbol.isSymbol(value)) return true;
-	return typeof value === "string" && (regexIsPlainProp.test(value) || !regexIsDeepProp.test(value)) || object != null && Object.hasOwn(object, value);
+	return typeof value === "string" && (regexIsPlainProp.test(value) || !regexIsDeepProp.test(value)) || object != null && require_hasOwn.hasOwn(object, value);
 }
-//#endregion
 exports.isKey = isKey;

package/dist/compat/_internal/isKey.mjs

@@ -1,5 +1,6 @@
+import { hasOwn } from "./hasOwn.mjs";
 import { isSymbol } from "../predicate/isSymbol.mjs";
-//#region src/compat/_internal/isKey.ts
+// src/compat/_internal/isKey.ts
 /**  Matches any deep property path. (e.g. `a.b[0].c`)*/
 const regexIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/;
 /**  Matches any word character (alphanumeric & underscore).*/
@@ -20,7 +21,6 @@ const regexIsPlainProp = /^\w*$/;
 function isKey(value, object) {
 	if (Array.isArray(value)) return false;
 	if (typeof value === "number" || typeof value === "boolean" || value == null || isSymbol(value)) return true;
-	return typeof value === "string" && (regexIsPlainProp.test(value) || !regexIsDeepProp.test(value)) || object != null && Object.hasOwn(object, value);
+	return typeof value === "string" && (regexIsPlainProp.test(value) || !regexIsDeepProp.test(value)) || object != null && hasOwn(object, value);
 }
-//#endregion
 export { isKey };

package/dist/compat/_internal/isPrototype.js

@@ -1,7 +1,6 @@
-//#region src/compat/_internal/isPrototype.ts
+// src/compat/_internal/isPrototype.ts
 function isPrototype(value) {
-	const constructor = value?.constructor;
+	const constructor = value === null || value === void 0 ? void 0 : value.constructor;
 	return value === (typeof constructor === "function" ? constructor.prototype : Object.prototype);
 }
-//#endregion
 exports.isPrototype = isPrototype;

package/dist/compat/_internal/isPrototype.mjs

@@ -1,7 +1,6 @@
-//#region src/compat/_internal/isPrototype.ts
+// src/compat/_internal/isPrototype.ts
 function isPrototype(value) {
-	const constructor = value?.constructor;
+	const constructor = value === null || value === void 0 ? void 0 : value.constructor;
 	return value === (typeof constructor === "function" ? constructor.prototype : Object.prototype);
 }
-//#endregion
 export { isPrototype };

package/dist/compat/_internal/mapToEntries.js

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/mapToEntries.ts
+// src/compat/_internal/mapToEntries.ts
 function mapToEntries(map) {
 	const arr = new Array(map.size);
 	const keys = map.keys();
@@ -6,5 +6,4 @@ function mapToEntries(map) {
 	for (let i = 0; i < arr.length; i++) arr[i] = [keys.next().value, values.next().value];
 	return arr;
 }
-//#endregion
 exports.mapToEntries = mapToEntries;

package/dist/compat/_internal/mapToEntries.mjs

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/mapToEntries.ts
+// src/compat/_internal/mapToEntries.ts
 function mapToEntries(map) {
 	const arr = new Array(map.size);
 	const keys = map.keys();
@@ -6,5 +6,4 @@ function mapToEntries(map) {
 	for (let i = 0; i < arr.length; i++) arr[i] = [keys.next().value, values.next().value];
 	return arr;
 }
-//#endregion
 export { mapToEntries };

package/dist/compat/_internal/normalizeForCase.js

@@ -1,8 +1,7 @@
 const require_toString = require("../util/toString.js");
-//#region src/compat/_internal/normalizeForCase.ts
+// src/compat/_internal/normalizeForCase.ts
 function normalizeForCase(str) {
 	if (typeof str !== "string") str = require_toString.toString(str);
 	return str.replace(/['\u2019]/g, "");
 }
-//#endregion
 exports.normalizeForCase = normalizeForCase;

package/dist/compat/_internal/normalizeForCase.mjs

@@ -1,8 +1,7 @@
 import { toString } from "../util/toString.mjs";
-//#region src/compat/_internal/normalizeForCase.ts
+// src/compat/_internal/normalizeForCase.ts
 function normalizeForCase(str) {
 	if (typeof str !== "string") str = toString(str);
 	return str.replace(/['\u2019]/g, "");
 }
-//#endregion
 export { normalizeForCase };

package/dist/compat/_internal/normalizeZero.js

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/normalizeZero.ts
+// src/compat/_internal/normalizeZero.ts
 /**
 * Normalizes `-0` to `0` to match Lodash, which normalizes `-0` to `+0` in the
 * results of functions like `uniq`, `union`, and `difference`.
@@ -9,5 +9,4 @@
 function normalizeZero(value) {
 	return value === 0 ? 0 : value;
 }
-//#endregion
 exports.normalizeZero = normalizeZero;

package/dist/compat/_internal/normalizeZero.mjs

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/normalizeZero.ts
+// src/compat/_internal/normalizeZero.ts
 /**
 * Normalizes `-0` to `0` to match Lodash, which normalizes `-0` to `+0` in the
 * results of functions like `uniq`, `union`, and `difference`.
@@ -9,5 +9,4 @@
 function normalizeZero(value) {
 	return value === 0 ? 0 : value;
 }
-//#endregion
 export { normalizeZero };

package/dist/compat/_internal/objectValues.js

@@ -0,0 +1,8 @@
+// src/compat/_internal/objectValues.ts
+function objectValues(object) {
+	const keys = Object.keys(object);
+	const result = new Array(keys.length);
+	for (let i = 0; i < keys.length; i++) result[i] = object[keys[i]];
+	return result;
+}
+exports.objectValues = objectValues;

package/dist/compat/_internal/objectValues.mjs

@@ -0,0 +1,8 @@
+// src/compat/_internal/objectValues.ts
+function objectValues(object) {
+	const keys = Object.keys(object);
+	const result = new Array(keys.length);
+	for (let i = 0; i < keys.length; i++) result[i] = object[keys[i]];
+	return result;
+}
+export { objectValues };

package/dist/compat/_internal/regexMultiByte.js

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/regexMultiByte.ts
+// src/compat/_internal/regexMultiByte.ts
 /**
 * Used to compose unicode character classes.
 * @link https://github.com/lodash/lodash/blob/4.17.21-es/_hasUnicode.js
@@ -7,5 +7,4 @@
 * @link http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/
 */
 const regexMultiByte = /* @__PURE__ */ new RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");
-//#endregion
 exports.regexMultiByte = regexMultiByte;

package/dist/compat/_internal/regexMultiByte.mjs

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/regexMultiByte.ts
+// src/compat/_internal/regexMultiByte.ts
 /**
 * Used to compose unicode character classes.
 * @link https://github.com/lodash/lodash/blob/4.17.21-es/_hasUnicode.js
@@ -7,5 +7,4 @@
 * @link http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/
 */
 const regexMultiByte = /* @__PURE__ */ new RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");
-//#endregion
 export { regexMultiByte };

package/dist/compat/_internal/setToEntries.js

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/setToEntries.ts
+// src/compat/_internal/setToEntries.ts
 function setToEntries(set) {
 	const arr = new Array(set.size);
 	const values = set.values();
@@ -8,5 +8,4 @@ function setToEntries(set) {
 	}
 	return arr;
 }
-//#endregion
 exports.setToEntries = setToEntries;

package/dist/compat/_internal/setToEntries.mjs

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/setToEntries.ts
+// src/compat/_internal/setToEntries.ts
 function setToEntries(set) {
 	const arr = new Array(set.size);
 	const values = set.values();
@@ -8,5 +8,4 @@ function setToEntries(set) {
 	}
 	return arr;
 }
-//#endregion
 export { setToEntries };

package/dist/compat/_internal/tags.js

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/tags.ts
+// src/compat/_internal/tags.ts
 const regexpTag = "[object RegExp]";
 const stringTag = "[object String]";
 const numberTag = "[object Number]";
@@ -25,7 +25,6 @@ const int32ArrayTag = "[object Int32Array]";
 const bigInt64ArrayTag = "[object BigInt64Array]";
 const float32ArrayTag = "[object Float32Array]";
 const float64ArrayTag = "[object Float64Array]";
-//#endregion
 exports.argumentsTag = argumentsTag;
 exports.arrayBufferTag = arrayBufferTag;
 exports.arrayTag = arrayTag;

package/dist/compat/_internal/tags.mjs

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/tags.ts
+// src/compat/_internal/tags.ts
 const regexpTag = "[object RegExp]";
 const stringTag = "[object String]";
 const numberTag = "[object Number]";
@@ -25,5 +25,4 @@ const int32ArrayTag = "[object Int32Array]";
 const bigInt64ArrayTag = "[object BigInt64Array]";
 const float32ArrayTag = "[object Float32Array]";
 const float64ArrayTag = "[object Float64Array]";
-//#endregion
 export { argumentsTag, arrayBufferTag, arrayTag, bigInt64ArrayTag, bigUint64ArrayTag, booleanTag, dataViewTag, dateTag, errorTag, float32ArrayTag, float64ArrayTag, functionTag, int16ArrayTag, int32ArrayTag, int8ArrayTag, mapTag, numberTag, objectTag, regexpTag, setTag, stringTag, symbolTag, uint16ArrayTag, uint32ArrayTag, uint8ArrayTag, uint8ClampedArrayTag };

package/dist/compat/_internal/toArray.js

@@ -1,6 +1,5 @@
-//#region src/compat/_internal/toArray.ts
+// src/compat/_internal/toArray.ts
 function toArray(value) {
 	return Array.isArray(value) ? value : Array.from(value);
 }
-//#endregion
 exports.toArray = toArray;

package/dist/compat/_internal/toArray.mjs

@@ -1,6 +1,5 @@
-//#region src/compat/_internal/toArray.ts
+// src/compat/_internal/toArray.ts
 function toArray(value) {
 	return Array.isArray(value) ? value : Array.from(value);
 }
-//#endregion
 export { toArray };

package/dist/compat/_internal/toKey.js

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/toKey.ts
+// src/compat/_internal/toKey.ts
 /**
 * Converts `value` to a string key if it's not a string or symbol.
 *
@@ -7,9 +7,9 @@
 * @returns {string|symbol} Returns the key.
 */
 function toKey(value) {
+	var _value$valueOf;
 	if (typeof value === "string" || typeof value === "symbol") return value;
-	if (Object.is(value?.valueOf?.(), -0)) return "-0";
+	if (Object.is(value === null || value === void 0 || (_value$valueOf = value.valueOf) === null || _value$valueOf === void 0 ? void 0 : _value$valueOf.call(value), -0)) return "-0";
 	return String(value);
 }
-//#endregion
 exports.toKey = toKey;

package/dist/compat/_internal/toKey.mjs

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/toKey.ts
+// src/compat/_internal/toKey.ts
 /**
 * Converts `value` to a string key if it's not a string or symbol.
 *
@@ -7,9 +7,9 @@
 * @returns {string|symbol} Returns the key.
 */
 function toKey(value) {
+	var _value$valueOf;
 	if (typeof value === "string" || typeof value === "symbol") return value;
-	if (Object.is(value?.valueOf?.(), -0)) return "-0";
+	if (Object.is(value === null || value === void 0 || (_value$valueOf = value.valueOf) === null || _value$valueOf === void 0 ? void 0 : _value$valueOf.call(value), -0)) return "-0";
 	return String(value);
 }
-//#endregion
 export { toKey };

package/dist/compat/_internal/unicodeSize.js

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/unicodeSize.ts
+// src/compat/_internal/unicodeSize.ts
 /**
 * Counts the number of visible symbols (grapheme clusters) in a Unicode `string`,
 * combining surrogate pairs, combining marks, variation selectors, Fitzpatrick
@@ -41,5 +41,4 @@ function unicodeSize(str) {
 	while (reUnicode.test(str)) ++result;
 	return result;
 }
-//#endregion
 exports.unicodeSize = unicodeSize;

package/dist/compat/_internal/unicodeSize.mjs

@@ -1,4 +1,4 @@
-//#region src/compat/_internal/unicodeSize.ts
+// src/compat/_internal/unicodeSize.ts
 /**
 * Counts the number of visible symbols (grapheme clusters) in a Unicode `string`,
 * combining surrogate pairs, combining marks, variation selectors, Fitzpatrick
@@ -41,5 +41,4 @@ function unicodeSize(str) {
 	while (reUnicode.test(str)) ++result;
 	return result;
 }
-//#endregion
 export { unicodeSize };

package/dist/compat/_internal/words.js

@@ -0,0 +1,93 @@
+// src/compat/_internal/words.ts
+/**
+* Splits strings into words for `words` and the case functions in `es-toolkit/compat`.
+*
+* The patterns are lodash's own. They only use ES5 regular expression features, so they also
+* work on engines without Unicode property escapes (`\p{...}`), such as Node.js 6.
+*
+* @link https://github.com/lodash/lodash/blob/4.17.21-es/_unicodeWords.js
+* @link https://github.com/lodash/lodash/blob/4.17.21-es/_asciiWords.js
+* @link https://github.com/lodash/lodash/blob/4.17.21-es/_hasUnicodeWord.js
+*/
+/** Used to compose unicode character classes. */
+const rsAstralRange = "\\ud800-\\udfff";
+const rsComboRange = "\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff";
+const rsDingbatRange = "\\u2700-\\u27bf";
+const rsLowerRange = "a-z\\xdf-\\xf6\\xf8-\\xff";
+const rsUpperRange = "A-Z\\xc0-\\xd6\\xd8-\\xde";
+const rsVarRange = "\\ufe0e\\ufe0f";
+const rsBreakRange = "\\xac\\xb1\\xd7\\xf7\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf\\u2000-\\u206f \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000";
+/** Used to compose unicode capture groups. */
+const rsApos = "['’]";
+const rsBreak = `[${rsBreakRange}]`;
+const rsCombo = `[${rsComboRange}]`;
+const rsDigits = "\\d+";
+const rsDingbat = `[${rsDingbatRange}]`;
+const rsLower = `[${rsLowerRange}]`;
+const rsMisc = `[^${rsAstralRange}${rsBreakRange}${rsDigits}${rsDingbatRange}${rsLowerRange}${rsUpperRange}]`;
+const rsModifier = `(?:${rsCombo}|\\ud83c[\\udffb-\\udfff])`;
+const rsNonAstral = `[^${rsAstralRange}]`;
+const rsRegional = "(?:\\ud83c[\\udde6-\\uddff]){2}";
+const rsSurrPair = "[\\ud800-\\udbff][\\udc00-\\udfff]";
+const rsUpper = `[${rsUpperRange}]`;
+const rsZWJ = "\\u200d";
+/** Used to compose unicode regexes. */
+const rsMiscLower = `(?:${rsLower}|${rsMisc})`;
+const rsMiscUpper = `(?:${rsUpper}|${rsMisc})`;
+const rsOptContrLower = `(?:${rsApos}(?:d|ll|m|re|s|t|ve))?`;
+const rsOptContrUpper = `(?:${rsApos}(?:D|LL|M|RE|S|T|VE))?`;
+const reOptMod = `${rsModifier}?`;
+const rsOptVar = `[${rsVarRange}]?`;
+const rsOptJoin = `(?:${rsZWJ}(?:${[
+	rsNonAstral,
+	rsRegional,
+	rsSurrPair
+].join("|")})${rsOptVar}${reOptMod})*`;
+const rsOrdLower = "\\d*(?:1st|2nd|3rd|(?![123])\\dth)(?=\\b|[A-Z_])";
+const rsOrdUpper = "\\d*(?:1ST|2ND|3RD|(?![123])\\dTH)(?=\\b|[a-z_])";
+const rsSeq = rsOptVar + reOptMod + rsOptJoin;
+const rsEmoji = `(?:${[
+	rsDingbat,
+	rsRegional,
+	rsSurrPair
+].join("|")})${rsSeq}`;
+/** Used to detect strings that need a more robust regexp to match words. */
+const reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;
+/** Used to match words composed of alphanumeric characters. */
+const reAsciiWord = /[^\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\x7f]+/g;
+let reUnicodeWord;
+/** Used to match complex or compound words. */
+function getUnicodeWordPattern() {
+	if (reUnicodeWord == null) reUnicodeWord = RegExp([
+		`${rsUpper}?${rsLower}+${rsOptContrLower}(?=${[
+			rsBreak,
+			rsUpper,
+			"$"
+		].join("|")})`,
+		`${rsMiscUpper}+${rsOptContrUpper}(?=${[
+			rsBreak,
+			rsUpper + rsMiscLower,
+			"$"
+		].join("|")})`,
+		`${rsUpper}?${rsMiscLower}+${rsOptContrLower}`,
+		`${rsUpper}+${rsOptContrUpper}`,
+		rsOrdUpper,
+		rsOrdLower,
+		rsDigits,
+		rsEmoji
+	].join("|"), "g");
+	return reUnicodeWord;
+}
+/**
+* Splits `string` into words with lodash's own word patterns, so that `words` and the case
+* functions match lodash exactly on every engine.
+*
+* @param string - The string to split.
+* @returns The words of `string`.
+*/
+function lodashWords(string) {
+	const pattern = reHasUnicodeWord.test(string) ? getUnicodeWordPattern() : reAsciiWord;
+	const matched = string.match(pattern);
+	return matched == null ? [] : Array.from(matched);
+}
+exports.lodashWords = lodashWords;

package/dist/compat/_internal/words.mjs

@@ -0,0 +1,93 @@
+// src/compat/_internal/words.ts
+/**
+* Splits strings into words for `words` and the case functions in `es-toolkit/compat`.
+*
+* The patterns are lodash's own. They only use ES5 regular expression features, so they also
+* work on engines without Unicode property escapes (`\p{...}`), such as Node.js 6.
+*
+* @link https://github.com/lodash/lodash/blob/4.17.21-es/_unicodeWords.js
+* @link https://github.com/lodash/lodash/blob/4.17.21-es/_asciiWords.js
+* @link https://github.com/lodash/lodash/blob/4.17.21-es/_hasUnicodeWord.js
+*/
+/** Used to compose unicode character classes. */
+const rsAstralRange = "\\ud800-\\udfff";
+const rsComboRange = "\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff";
+const rsDingbatRange = "\\u2700-\\u27bf";
+const rsLowerRange = "a-z\\xdf-\\xf6\\xf8-\\xff";
+const rsUpperRange = "A-Z\\xc0-\\xd6\\xd8-\\xde";
+const rsVarRange = "\\ufe0e\\ufe0f";
+const rsBreakRange = "\\xac\\xb1\\xd7\\xf7\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf\\u2000-\\u206f \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000";
+/** Used to compose unicode capture groups. */
+const rsApos = "['’]";
+const rsBreak = `[${rsBreakRange}]`;
+const rsCombo = `[${rsComboRange}]`;
+const rsDigits = "\\d+";
+const rsDingbat = `[${rsDingbatRange}]`;
+const rsLower = `[${rsLowerRange}]`;
+const rsMisc = `[^${rsAstralRange}${rsBreakRange}${rsDigits}${rsDingbatRange}${rsLowerRange}${rsUpperRange}]`;
+const rsModifier = `(?:${rsCombo}|\\ud83c[\\udffb-\\udfff])`;
+const rsNonAstral = `[^${rsAstralRange}]`;
+const rsRegional = "(?:\\ud83c[\\udde6-\\uddff]){2}";
+const rsSurrPair = "[\\ud800-\\udbff][\\udc00-\\udfff]";
+const rsUpper = `[${rsUpperRange}]`;
+const rsZWJ = "\\u200d";
+/** Used to compose unicode regexes. */
+const rsMiscLower = `(?:${rsLower}|${rsMisc})`;
+const rsMiscUpper = `(?:${rsUpper}|${rsMisc})`;
+const rsOptContrLower = `(?:${rsApos}(?:d|ll|m|re|s|t|ve))?`;
+const rsOptContrUpper = `(?:${rsApos}(?:D|LL|M|RE|S|T|VE))?`;
+const reOptMod = `${rsModifier}?`;
+const rsOptVar = `[${rsVarRange}]?`;
+const rsOptJoin = `(?:${rsZWJ}(?:${[
+	rsNonAstral,
+	rsRegional,
+	rsSurrPair
+].join("|")})${rsOptVar}${reOptMod})*`;
+const rsOrdLower = "\\d*(?:1st|2nd|3rd|(?![123])\\dth)(?=\\b|[A-Z_])";
+const rsOrdUpper = "\\d*(?:1ST|2ND|3RD|(?![123])\\dTH)(?=\\b|[a-z_])";
+const rsSeq = rsOptVar + reOptMod + rsOptJoin;
+const rsEmoji = `(?:${[
+	rsDingbat,
+	rsRegional,
+	rsSurrPair
+].join("|")})${rsSeq}`;
+/** Used to detect strings that need a more robust regexp to match words. */
+const reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;
+/** Used to match words composed of alphanumeric characters. */
+const reAsciiWord = /[^\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\x7f]+/g;
+let reUnicodeWord;
+/** Used to match complex or compound words. */
+function getUnicodeWordPattern() {
+	if (reUnicodeWord == null) reUnicodeWord = RegExp([
+		`${rsUpper}?${rsLower}+${rsOptContrLower}(?=${[
+			rsBreak,
+			rsUpper,
+			"$"
+		].join("|")})`,
+		`${rsMiscUpper}+${rsOptContrUpper}(?=${[
+			rsBreak,
+			rsUpper + rsMiscLower,
+			"$"
+		].join("|")})`,
+		`${rsUpper}?${rsMiscLower}+${rsOptContrLower}`,
+		`${rsUpper}+${rsOptContrUpper}`,
+		rsOrdUpper,
+		rsOrdLower,
+		rsDigits,
+		rsEmoji
+	].join("|"), "g");
+	return reUnicodeWord;
+}
+/**
+* Splits `string` into words with lodash's own word patterns, so that `words` and the case
+* functions match lodash exactly on every engine.
+*
+* @param string - The string to split.
+* @returns The words of `string`.
+*/
+function lodashWords(string) {
+	const pattern = reHasUnicodeWord.test(string) ? getUnicodeWordPattern() : reAsciiWord;
+	const matched = string.match(pattern);
+	return matched == null ? [] : Array.from(matched);
+}
+export { lodashWords };

package/dist/compat/array/castArray.d.mts

@@ -1,4 +1,3 @@
-//#region src/compat/array/castArray.d.ts
 /**
  * Casts value as an array if it's not one.
  *
@@ -25,6 +24,4 @@
  * const arr6 = castArray();
  * // Returns: []
  */
-declare function castArray<T>(value?: T | readonly T[]): T[];
-//#endregion
-export { castArray };
+export declare function castArray<T>(value?: T | readonly T[]): T[];

package/dist/compat/array/castArray.d.ts

@@ -1,4 +1,3 @@
-//#region src/compat/array/castArray.d.ts
 /**
  * Casts value as an array if it's not one.
  *
@@ -25,6 +24,4 @@
  * const arr6 = castArray();
  * // Returns: []
  */
-declare function castArray<T>(value?: T | readonly T[]): T[];
-//#endregion
-export { castArray };
+export declare function castArray<T>(value?: T | readonly T[]): T[];

package/dist/compat/array/castArray.js

@@ -1,4 +1,4 @@
-//#region src/compat/array/castArray.ts
+// src/compat/array/castArray.ts
 /**
 * Casts value as an array if it's not one.
 *
@@ -29,5 +29,4 @@ function castArray(value) {
 	if (arguments.length === 0) return [];
 	return Array.isArray(value) ? value : [value];
 }
-//#endregion
 exports.castArray = castArray;

package/dist/compat/array/castArray.mjs

@@ -1,4 +1,4 @@
-//#region src/compat/array/castArray.ts
+// src/compat/array/castArray.ts
 /**
 * Casts value as an array if it's not one.
 *
@@ -29,5 +29,4 @@ function castArray(value) {
 	if (arguments.length === 0) return [];
 	return Array.isArray(value) ? value : [value];
 }
-//#endregion
 export { castArray };

package/dist/compat/array/chunk.d.mts

@@ -1,4 +1,3 @@
-//#region src/compat/array/chunk.d.ts
 /**
  * Splits an array into smaller arrays of a specified length.
  *
@@ -21,6 +20,4 @@
  * chunk(['a', 'b', 'c', 'd', 'e', 'f', 'g'], 3);
  * // Returns: [['a', 'b', 'c'], ['d', 'e', 'f'], ['g']]
  */
-declare function chunk<T>(arr: ArrayLike<T> | null | undefined, size?: number): T[][];
-//#endregion
-export { chunk };
+export declare function chunk<T>(arr: ArrayLike<T> | null | undefined, size?: number): T[][];

package/dist/compat/array/chunk.d.ts

@@ -1,4 +1,3 @@
-//#region src/compat/array/chunk.d.ts
 /**
  * Splits an array into smaller arrays of a specified length.
  *
@@ -21,6 +20,4 @@
  * chunk(['a', 'b', 'c', 'd', 'e', 'f', 'g'], 3);
  * // Returns: [['a', 'b', 'c'], ['d', 'e', 'f'], ['g']]
  */
-declare function chunk<T>(arr: ArrayLike<T> | null | undefined, size?: number): T[][];
-//#endregion
-export { chunk };
+export declare function chunk<T>(arr: ArrayLike<T> | null | undefined, size?: number): T[][];

package/dist/compat/array/chunk.js

@@ -1,7 +1,7 @@
 const require_chunk = require("../../array/chunk.js");
 const require_toArray = require("../_internal/toArray.js");
 const require_isArrayLike = require("../predicate/isArrayLike.js");
-//#region src/compat/array/chunk.ts
+// src/compat/array/chunk.ts
 /**
 * Splits an array into smaller arrays of a specified length.
 *
@@ -32,5 +32,4 @@ function chunk(arr, size = 1) {
 	if (!isFinite(size)) return [array];
 	return require_chunk.chunk(array, size);
 }
-//#endregion
 exports.chunk = chunk;

package/dist/compat/array/chunk.mjs

@@ -1,7 +1,7 @@
 import { chunk as chunk$1 } from "../../array/chunk.mjs";
 import { toArray } from "../_internal/toArray.mjs";
 import { isArrayLike } from "../predicate/isArrayLike.mjs";
-//#region src/compat/array/chunk.ts
+// src/compat/array/chunk.ts
 /**
 * Splits an array into smaller arrays of a specified length.
 *
@@ -32,5 +32,4 @@ function chunk(arr, size = 1) {
 	if (!isFinite(size)) return [array];
 	return chunk$1(array, size);
 }
-//#endregion
 export { chunk };

package/dist/compat/array/compact.d.mts

@@ -1,4 +1,3 @@
-//#region src/compat/array/compact.d.ts
 type Falsey = false | null | 0 | 0n | '' | undefined;
 /**
  * Removes falsey values (false, null, 0, 0n, '', undefined, NaN) from an array.
@@ -11,6 +10,5 @@ type Falsey = false | null | 0 | 0n | '' | undefined;
  * compact([0, 0n, 1, false, 2, '', 3, null, undefined, 4, NaN, 5]);
  * Returns: [1, 2, 3, 4, 5]
  */
-declare function compact<T>(arr: ArrayLike<T | Falsey> | null | undefined): T[];
-//#endregion
-export { compact };
+export declare function compact<T>(arr: ArrayLike<T | Falsey> | null | undefined): T[];
+export {};

package/dist/compat/array/compact.d.ts

@@ -1,4 +1,3 @@
-//#region src/compat/array/compact.d.ts
 type Falsey = false | null | 0 | 0n | '' | undefined;
 /**
  * Removes falsey values (false, null, 0, 0n, '', undefined, NaN) from an array.
@@ -11,6 +10,5 @@ type Falsey = false | null | 0 | 0n | '' | undefined;
  * compact([0, 0n, 1, false, 2, '', 3, null, undefined, 4, NaN, 5]);
  * Returns: [1, 2, 3, 4, 5]
  */
-declare function compact<T>(arr: ArrayLike<T | Falsey> | null | undefined): T[];
-//#endregion
-export { compact };
+export declare function compact<T>(arr: ArrayLike<T | Falsey> | null | undefined): T[];
+export {};

package/dist/compat/array/compact.js

@@ -1,6 +1,6 @@
 const require_compact = require("../../array/compact.js");
 const require_isArrayLike = require("../predicate/isArrayLike.js");
-//#region src/compat/array/compact.ts
+// src/compat/array/compact.ts
 /**
 * Removes falsey values (false, null, 0, 0n, '', undefined, NaN) from an array.
 *
@@ -16,5 +16,4 @@ function compact(arr) {
 	if (!require_isArrayLike.isArrayLike(arr)) return [];
 	return require_compact.compact(Array.from(arr));
 }
-//#endregion
 exports.compact = compact;