es-toolkit 1.50.0 → 1.51.0-dev.2069

package/dist/compat/object/transform.mjs

@@ -23,7 +23,7 @@ The traversal is interrupted when the `iteratee` function returns `false`.
 * @example
 * // Transform an array
 * const array = [2, 3, 4];
-* transform(array, (acc, value) => { acc += value; return value % 2 === 0; }, 0) // => 5
+* transform(array, (acc, value) => { acc.sum += value; return value % 2 === 0; }, { sum: 0 }) // => { sum: 5 }
 *
 * @example
 * // Transform an object

package/dist/compat/object/updateWith.js

@@ -1,4 +1,3 @@
-const require_isUnsafeProperty = require("../../_internal/isUnsafeProperty.js");
 const require_toKey = require("../_internal/toKey.js");
 const require_toPath = require("../util/toPath.js");
 const require_get = require("./get.js");
@@ -6,6 +5,7 @@ const require_isObject = require("../predicate/isObject.js");
 const require_isIndex = require("../_internal/isIndex.js");
 const require_isKey = require("../_internal/isKey.js");
 const require_assignValue = require("../_internal/assignValue.js");
+const require_isUnsafeToWriteProperty = require("../../_internal/isUnsafeToWriteProperty.js");
 //#region src/compat/object/updateWith.ts
 /**
 * Updates the value at the specified path of the given object using an updater function and a customizer.
@@ -34,7 +34,7 @@ function updateWith(obj, path, updater, customizer) {
 	let current = obj;
 	for (let i = 0; i < resolvedPath.length && current != null; i++) {
 		const key = require_toKey.toKey(resolvedPath[i]);
-		if (require_isUnsafeProperty.isUnsafeProperty(key)) continue;
+		if (require_isUnsafeToWriteProperty.isUnsafeToWriteProperty(key)) return obj;
 		let newValue;
 		if (i === resolvedPath.length - 1) newValue = updateValue;
 		else {

package/dist/compat/object/updateWith.mjs

@@ -1,4 +1,3 @@
-import { isUnsafeProperty } from "../../_internal/isUnsafeProperty.mjs";
 import { toKey } from "../_internal/toKey.mjs";
 import { toPath } from "../util/toPath.mjs";
 import { get } from "./get.mjs";
@@ -6,6 +5,7 @@ import { isObject } from "../predicate/isObject.mjs";
 import { isIndex } from "../_internal/isIndex.mjs";
 import { isKey } from "../_internal/isKey.mjs";
 import { assignValue } from "../_internal/assignValue.mjs";
+import { isUnsafeToWriteProperty } from "../../_internal/isUnsafeToWriteProperty.mjs";
 //#region src/compat/object/updateWith.ts
 /**
 * Updates the value at the specified path of the given object using an updater function and a customizer.
@@ -34,7 +34,7 @@ function updateWith(obj, path, updater, customizer) {
 	let current = obj;
 	for (let i = 0; i < resolvedPath.length && current != null; i++) {
 		const key = toKey(resolvedPath[i]);
-		if (isUnsafeProperty(key)) continue;
+		if (isUnsafeToWriteProperty(key)) return obj;
 		let newValue;
 		if (i === resolvedPath.length - 1) newValue = updateValue;
 		else {

package/dist/compat/predicate/isMatchWith.js

@@ -1,4 +1,6 @@
 const require_isPrimitive = require("../../predicate/isPrimitive.js");
+const require_getTag = require("../_internal/getTag.js");
+require("../_internal/tags.js");
 const require_eq = require("../util/eq.js");
 const require_isObject = require("./isObject.js");
 //#region src/compat/predicate/isMatchWith.ts
@@ -19,7 +21,8 @@ const require_isObject = require("./isObject.js");
 * - **Primitives**: Matches using strict equality
 *
 * Special cases:
-* - Empty objects, arrays, Maps, and Sets always match any target
+* - Empty arrays, Maps, and Sets always match any target
+* - An empty object matches any target at the top level, but at nested levels it only matches object targets
 * - `null` and `undefined` source values have specific matching rules
 * - Circular references are handled using an internal stack to prevent infinite recursion
 *
@@ -82,7 +85,7 @@ function isMatchWith(target, source, compare) {
 function isMatchWithInternal(target, source, compare, stack, isRoot = false) {
 	if (source === target) return true;
 	switch (typeof source) {
-		case "object": return isObjectMatch(target, source, compare, stack);
+		case "object": return isObjectMatch(target, source, compare, stack, isRoot);
 		case "function":
 			if (Object.keys(source).length > 0) return isMatchWithInternal(target, { ...source }, compare, stack, isRoot);
 			return require_eq.eq(target, source);
@@ -95,20 +98,26 @@ function isMatchWithInternal(target, source, compare, stack, isRoot = false) {
 			return require_eq.eq(target, source);
 	}
 }
-function isObjectMatch(target, source, compare, stack) {
+function isObjectMatch(target, source, compare, stack, isRoot = false) {
 	if (source == null) return true;
 	if (Array.isArray(source)) return isArrayMatch(target, source, compare, stack);
 	if (source instanceof Map) return isMapMatch(target, source, compare, stack);
 	if (source instanceof Set) return isSetMatch(target, source, compare, stack);
 	const keys = Object.keys(source);
-	if (target == null || require_isPrimitive.isPrimitive(target)) return keys.length === 0;
+	if (target == null) return isRoot && keys.length === 0;
+	if (isRoot) {
+		if (require_isPrimitive.isPrimitive(target)) target = Object(target);
+	} else {
+		const tag = require_getTag.getTag(target);
+		if (tag !== "[object Object]" && tag !== "[object Arguments]") return false;
+	}
 	if (keys.length === 0) return true;
 	if (stack?.has(source)) return stack.get(source) === target;
 	stack?.set(source, target);
 	try {
 		for (let i = 0; i < keys.length; i++) {
 			const key = keys[i];
-			if (!require_isPrimitive.isPrimitive(target) && !(key in target)) return false;
+			if (!(key in target)) return false;
 			if (source[key] === void 0 && target[key] !== void 0) return false;
 			if (source[key] === null && target[key] !== null) return false;
 			if (!compare(target[key], source[key], key, target, source, stack)) return false;

package/dist/compat/predicate/isMatchWith.mjs

@@ -1,4 +1,6 @@
 import { isPrimitive } from "../../predicate/isPrimitive.mjs";
+import { getTag } from "../_internal/getTag.mjs";
+import "../_internal/tags.mjs";
 import { eq } from "../util/eq.mjs";
 import { isObject } from "./isObject.mjs";
 //#region src/compat/predicate/isMatchWith.ts
@@ -19,7 +21,8 @@ import { isObject } from "./isObject.mjs";
 * - **Primitives**: Matches using strict equality
 *
 * Special cases:
-* - Empty objects, arrays, Maps, and Sets always match any target
+* - Empty arrays, Maps, and Sets always match any target
+* - An empty object matches any target at the top level, but at nested levels it only matches object targets
 * - `null` and `undefined` source values have specific matching rules
 * - Circular references are handled using an internal stack to prevent infinite recursion
 *
@@ -82,7 +85,7 @@ function isMatchWith(target, source, compare) {
 function isMatchWithInternal(target, source, compare, stack, isRoot = false) {
 	if (source === target) return true;
 	switch (typeof source) {
-		case "object": return isObjectMatch(target, source, compare, stack);
+		case "object": return isObjectMatch(target, source, compare, stack, isRoot);
 		case "function":
 			if (Object.keys(source).length > 0) return isMatchWithInternal(target, { ...source }, compare, stack, isRoot);
 			return eq(target, source);
@@ -95,20 +98,26 @@ function isMatchWithInternal(target, source, compare, stack, isRoot = false) {
 			return eq(target, source);
 	}
 }
-function isObjectMatch(target, source, compare, stack) {
+function isObjectMatch(target, source, compare, stack, isRoot = false) {
 	if (source == null) return true;
 	if (Array.isArray(source)) return isArrayMatch(target, source, compare, stack);
 	if (source instanceof Map) return isMapMatch(target, source, compare, stack);
 	if (source instanceof Set) return isSetMatch(target, source, compare, stack);
 	const keys = Object.keys(source);
-	if (target == null || isPrimitive(target)) return keys.length === 0;
+	if (target == null) return isRoot && keys.length === 0;
+	if (isRoot) {
+		if (isPrimitive(target)) target = Object(target);
+	} else {
+		const tag = getTag(target);
+		if (tag !== "[object Object]" && tag !== "[object Arguments]") return false;
+	}
 	if (keys.length === 0) return true;
 	if (stack?.has(source)) return stack.get(source) === target;
 	stack?.set(source, target);
 	try {
 		for (let i = 0; i < keys.length; i++) {
 			const key = keys[i];
-			if (!isPrimitive(target) && !(key in target)) return false;
+			if (!(key in target)) return false;
 			if (source[key] === void 0 && target[key] !== void 0) return false;
 			if (source[key] === null && target[key] !== null) return false;
 			if (!compare(target[key], source[key], key, target, source, stack)) return false;

package/dist/compat/string/template.js

@@ -1,4 +1,5 @@
 const require_toString = require("../util/toString.js");
+const require_isIterateeCall = require("../_internal/isIterateeCall.js");
 const require_attempt = require("../function/attempt.js");
 const require_defaults = require("../object/defaults.js");
 const require_escape = require("./escape.js");
@@ -92,7 +93,7 @@ const templateSettings = {
 */
 function template(string, options, guard) {
 	string = require_toString.toString(string);
-	if (guard) options = templateSettings;
+	if (guard && require_isIterateeCall.isIterateeCall(string, options, guard)) options = templateSettings;
 	options = require_defaults.defaults({ ...options }, templateSettings);
 	const delimitersRegExp = new RegExp([
 		options.escape?.source ?? noMatchExp.source,

package/dist/compat/string/template.mjs

@@ -1,4 +1,5 @@
 import { toString } from "../util/toString.mjs";
+import { isIterateeCall } from "../_internal/isIterateeCall.mjs";
 import { attempt } from "../function/attempt.mjs";
 import { defaults } from "../object/defaults.mjs";
 import { escape } from "./escape.mjs";
@@ -92,7 +93,7 @@ const templateSettings = {
 */
 function template(string, options, guard) {
 	string = toString(string);
-	if (guard) options = templateSettings;
+	if (guard && isIterateeCall(string, options, guard)) options = templateSettings;
 	options = defaults({ ...options }, templateSettings);
 	const delimitersRegExp = new RegExp([
 		options.escape?.source ?? noMatchExp.source,

package/dist/compat/string/words.js

@@ -10,17 +10,21 @@ const rUnicodeOptContrUpper = "(?:['’](?:D|LL|M|RE|S|T|VE))?";
 const rUnicodeBreak = `[\\p{Z}\\p{P}${rNonCharLatin}]`;
 const rUnicodeMiscUpper = `(?:${rUnicodeUpper}|${rMisc})`;
 const rUnicodeMiscLower = `(?:${rUnicodeLower}|${rMisc})`;
-const rUnicodeWord = RegExp([
-	`${rUnicodeUpper}?${rUnicodeLower}+${rUnicodeOptContrLower}(?=${rUnicodeBreak}|${rUnicodeUpper}|$)`,
-	`${rUnicodeMiscUpper}+${rUnicodeOptContrUpper}(?=${rUnicodeBreak}|${rUnicodeUpper}${rUnicodeMiscLower}|$)`,
-	`${rUnicodeUpper}?${rUnicodeMiscLower}+${rUnicodeOptContrLower}`,
-	`${rUnicodeUpper}+${rUnicodeOptContrUpper}`,
-	`${rNumber}*(?:1ST|2ND|3RD|(?![123])${rNumber}TH)(?=\\b|[a-z_])`,
-	`${rNumber}*(?:1st|2nd|3rd|(?![123])${rNumber}th)(?=\\b|[A-Z_])`,
-	`${rNumber}+`,
-	"\\p{Emoji_Presentation}",
-	"\\p{Extended_Pictographic}"
-].join("|"), "gu");
+let rUnicodeWord;
+function getUnicodeWordPattern() {
+	if (rUnicodeWord == null) rUnicodeWord = RegExp([
+		`${rUnicodeUpper}?${rUnicodeLower}+${rUnicodeOptContrLower}(?=${rUnicodeBreak}|${rUnicodeUpper}|$)`,
+		`${rUnicodeMiscUpper}+${rUnicodeOptContrUpper}(?=${rUnicodeBreak}|${rUnicodeUpper}${rUnicodeMiscLower}|$)`,
+		`${rUnicodeUpper}?${rUnicodeMiscLower}+${rUnicodeOptContrLower}`,
+		`${rUnicodeUpper}+${rUnicodeOptContrUpper}`,
+		`${rNumber}*(?:1ST|2ND|3RD|(?![123])${rNumber}TH)(?=\\b|[a-z_])`,
+		`${rNumber}*(?:1st|2nd|3rd|(?![123])${rNumber}th)(?=\\b|[A-Z_])`,
+		`${rNumber}+`,
+		"\\p{Emoji_Presentation}",
+		"\\p{Extended_Pictographic}"
+	].join("|"), "gu");
+	return rUnicodeWord;
+}
 /**
 * Splits `string` into an array of its words.
 *
@@ -32,9 +36,9 @@ const rUnicodeWord = RegExp([
 * const wordsArray1 = words('fred, barney, & pebbles');
 * // => ['fred', 'barney', 'pebbles']
 */
-function words(str, pattern = rUnicodeWord, guard) {
+function words(str, pattern, guard) {
 	const input = require_toString.toString(str);
-	if (guard) pattern = rUnicodeWord;
+	if (guard || pattern === void 0) pattern = getUnicodeWordPattern();
 	if (typeof pattern === "number") pattern = pattern.toString();
 	return Array.from(input.match(pattern) ?? []).filter((x) => x !== "");
 }

package/dist/compat/string/words.mjs

@@ -10,17 +10,21 @@ const rUnicodeOptContrUpper = "(?:['’](?:D|LL|M|RE|S|T|VE))?";
 const rUnicodeBreak = `[\\p{Z}\\p{P}${rNonCharLatin}]`;
 const rUnicodeMiscUpper = `(?:${rUnicodeUpper}|${rMisc})`;
 const rUnicodeMiscLower = `(?:${rUnicodeLower}|${rMisc})`;
-const rUnicodeWord = RegExp([
-	`${rUnicodeUpper}?${rUnicodeLower}+${rUnicodeOptContrLower}(?=${rUnicodeBreak}|${rUnicodeUpper}|$)`,
-	`${rUnicodeMiscUpper}+${rUnicodeOptContrUpper}(?=${rUnicodeBreak}|${rUnicodeUpper}${rUnicodeMiscLower}|$)`,
-	`${rUnicodeUpper}?${rUnicodeMiscLower}+${rUnicodeOptContrLower}`,
-	`${rUnicodeUpper}+${rUnicodeOptContrUpper}`,
-	`${rNumber}*(?:1ST|2ND|3RD|(?![123])${rNumber}TH)(?=\\b|[a-z_])`,
-	`${rNumber}*(?:1st|2nd|3rd|(?![123])${rNumber}th)(?=\\b|[A-Z_])`,
-	`${rNumber}+`,
-	"\\p{Emoji_Presentation}",
-	"\\p{Extended_Pictographic}"
-].join("|"), "gu");
+let rUnicodeWord;
+function getUnicodeWordPattern() {
+	if (rUnicodeWord == null) rUnicodeWord = RegExp([
+		`${rUnicodeUpper}?${rUnicodeLower}+${rUnicodeOptContrLower}(?=${rUnicodeBreak}|${rUnicodeUpper}|$)`,
+		`${rUnicodeMiscUpper}+${rUnicodeOptContrUpper}(?=${rUnicodeBreak}|${rUnicodeUpper}${rUnicodeMiscLower}|$)`,
+		`${rUnicodeUpper}?${rUnicodeMiscLower}+${rUnicodeOptContrLower}`,
+		`${rUnicodeUpper}+${rUnicodeOptContrUpper}`,
+		`${rNumber}*(?:1ST|2ND|3RD|(?![123])${rNumber}TH)(?=\\b|[a-z_])`,
+		`${rNumber}*(?:1st|2nd|3rd|(?![123])${rNumber}th)(?=\\b|[A-Z_])`,
+		`${rNumber}+`,
+		"\\p{Emoji_Presentation}",
+		"\\p{Extended_Pictographic}"
+	].join("|"), "gu");
+	return rUnicodeWord;
+}
 /**
 * Splits `string` into an array of its words.
 *
@@ -32,9 +36,9 @@ const rUnicodeWord = RegExp([
 * const wordsArray1 = words('fred, barney, & pebbles');
 * // => ['fred', 'barney', 'pebbles']
 */
-function words(str, pattern = rUnicodeWord, guard) {
+function words(str, pattern, guard) {
 	const input = toString(str);
-	if (guard) pattern = rUnicodeWord;
+	if (guard || pattern === void 0) pattern = getUnicodeWordPattern();
 	if (typeof pattern === "number") pattern = pattern.toString();
 	return Array.from(input.match(pattern) ?? []).filter((x) => x !== "");
 }

package/dist/compat/util/iteratee.js

@@ -40,9 +40,7 @@ function iteratee(value) {
 		case "object":
 			if (Array.isArray(value) && value.length === 2) return require_matchesProperty.matchesProperty(value[0], value[1]);
 			return require_matches.matches(value);
-		case "string":
-		case "symbol":
-		case "number": return require_property.property(value);
+		default: return require_property.property(value);
 	}
 }
 //#endregion

package/dist/compat/util/iteratee.mjs

@@ -40,9 +40,7 @@ function iteratee(value) {
 		case "object":
 			if (Array.isArray(value) && value.length === 2) return matchesProperty(value[0], value[1]);
 			return matches(value);
-		case "string":
-		case "symbol":
-		case "number": return property(value);
+		default: return property(value);
 	}
 }
 //#endregion

package/dist/compat/util/toArray.d.mts

@@ -7,8 +7,8 @@
  * @returns Returns an array of the record's values or an empty array if null/undefined.
  *
  * @example
- * toArray({ 'a': 1, 'b': 2 }) // => returns [1, 2]
- * toArray(null) // => returns []
+ * toArray({ 'a': 1, 'b': 2 }) // => [1, 2]
+ * toArray(null) // => []
  */
 declare function toArray<T>(value: Record<string, T> | Record<number, T> | null | undefined): T[];
 /**
@@ -19,8 +19,8 @@ declare function toArray<T>(value: Record<string, T> | Record<number, T> | null
  * @returns Returns an array of the value's values.
  *
  * @example
- * toArray({ x: 10, y: 20 }) // => returns [10, 20]
- * toArray('abc') // => returns ['a', 'b', 'c']
+ * toArray({ x: 10, y: 20 }) // => [10, 20]
+ * toArray('abc') // => ['a', 'b', 'c']
  */
 declare function toArray<T>(value: T): Array<T[keyof T]>;
 /**
@@ -29,7 +29,7 @@ declare function toArray<T>(value: T): Array<T[keyof T]>;
  * @returns Returns an empty array.
  *
  * @example
- * toArray() // => returns []
+ * toArray() // => []
  */
 declare function toArray(): any[];
 //#endregion

package/dist/compat/util/toArray.d.ts

@@ -7,8 +7,8 @@
  * @returns Returns an array of the record's values or an empty array if null/undefined.
  *
  * @example
- * toArray({ 'a': 1, 'b': 2 }) // => returns [1, 2]
- * toArray(null) // => returns []
+ * toArray({ 'a': 1, 'b': 2 }) // => [1, 2]
+ * toArray(null) // => []
  */
 declare function toArray<T>(value: Record<string, T> | Record<number, T> | null | undefined): T[];
 /**
@@ -19,8 +19,8 @@ declare function toArray<T>(value: Record<string, T> | Record<number, T> | null
  * @returns Returns an array of the value's values.
  *
  * @example
- * toArray({ x: 10, y: 20 }) // => returns [10, 20]
- * toArray('abc') // => returns ['a', 'b', 'c']
+ * toArray({ x: 10, y: 20 }) // => [10, 20]
+ * toArray('abc') // => ['a', 'b', 'c']
  */
 declare function toArray<T>(value: T): Array<T[keyof T]>;
 /**
@@ -29,7 +29,7 @@ declare function toArray<T>(value: T): Array<T[keyof T]>;
  * @returns Returns an empty array.
  *
  * @example
- * toArray() // => returns []
+ * toArray() // => []
  */
 declare function toArray(): any[];
 //#endregion

package/dist/compat/util/toArray.js

@@ -1,3 +1,4 @@
+const require_isIterable = require("../../predicate/isIterable.js");
 const require_isArrayLike = require("../predicate/isArrayLike.js");
 const require_isMap = require("../predicate/isMap.js");
 const require_isSet = require("../predicate/isSet.js");
@@ -9,15 +10,18 @@ const require_isSet = require("../predicate/isSet.js");
 * @returns Returns the converted array.
 *
 * @example
-* toArray({ 'a': 1, 'b': 2 }) // => returns [1,2]
-* toArray('abc') // => returns ['a', 'b', 'c']
-* toArray(1) // => returns []
-* toArray(null) // => returns []
+* toArray({ 'a': 1, 'b': 2 }) // => [1,2]
+* toArray('abc') // => ['a', 'b', 'c']
+* toArray(1) // => []
+* toArray(null) // => []
 */
 function toArray(value) {
 	if (value == null) return [];
 	if (require_isArrayLike.isArrayLike(value) || require_isMap.isMap(value) || require_isSet.isSet(value)) return Array.from(value);
-	if (typeof value === "object") return Object.values(value);
+	if (typeof value === "object") {
+		if (require_isIterable.isIterable(value)) return Array.from(value);
+		return Object.values(value);
+	}
 	return [];
 }
 //#endregion

package/dist/compat/util/toArray.mjs

@@ -1,3 +1,4 @@
+import { isIterable } from "../../predicate/isIterable.mjs";
 import { isArrayLike } from "../predicate/isArrayLike.mjs";
 import { isMap } from "../predicate/isMap.mjs";
 import { isSet } from "../predicate/isSet.mjs";
@@ -9,15 +10,18 @@ import { isSet } from "../predicate/isSet.mjs";
 * @returns Returns the converted array.
 *
 * @example
-* toArray({ 'a': 1, 'b': 2 }) // => returns [1,2]
-* toArray('abc') // => returns ['a', 'b', 'c']
-* toArray(1) // => returns []
-* toArray(null) // => returns []
+* toArray({ 'a': 1, 'b': 2 }) // => [1,2]
+* toArray('abc') // => ['a', 'b', 'c']
+* toArray(1) // => []
+* toArray(null) // => []
 */
 function toArray(value) {
 	if (value == null) return [];
 	if (isArrayLike(value) || isMap(value) || isSet(value)) return Array.from(value);
-	if (typeof value === "object") return Object.values(value);
+	if (typeof value === "object") {
+		if (isIterable(value)) return Array.from(value);
+		return Object.values(value);
+	}
 	return [];
 }
 //#endregion

package/dist/compat/util/toPath.js

@@ -29,6 +29,8 @@ function toPath(deepKey) {
 	let key = "";
 	let quoteChar = "";
 	let bracket = false;
+	let bracketHadQuote = false;
+	const bracketNumberRegex = /^-?\d+(?:\.\d+)?$/;
 	if (deepKey.charCodeAt(0) === 46) result.push("");
 	while (index < length) {
 		const char = deepKey[index];
@@ -37,14 +39,20 @@ function toPath(deepKey) {
 			key += deepKey[index];
 		} else if (char === quoteChar) quoteChar = "";
 		else key += char;
-		else if (bracket) if (char === "\"" || char === "'") quoteChar = char;
-		else if (char === "]") {
+		else if (bracket) if (char === "\"" || char === "'") {
+			quoteChar = char;
+			bracketHadQuote = true;
+		} else if (char === "]") {
 			bracket = false;
-			result.push(key);
+			if (!bracketHadQuote && key.includes(".") && !bracketNumberRegex.test(key)) {
+				const segments = key.split(".");
+				for (let i = 0; i < segments.length; i++) if (segments[i] !== "") result.push(segments[i]);
+			} else result.push(key);
 			key = "";
 		} else key += char;
 		else if (char === "[") {
 			bracket = true;
+			bracketHadQuote = false;
 			if (key) {
 				result.push(key);
 				key = "";

package/dist/compat/util/toPath.mjs

@@ -29,6 +29,8 @@ function toPath(deepKey) {
 	let key = "";
 	let quoteChar = "";
 	let bracket = false;
+	let bracketHadQuote = false;
+	const bracketNumberRegex = /^-?\d+(?:\.\d+)?$/;
 	if (deepKey.charCodeAt(0) === 46) result.push("");
 	while (index < length) {
 		const char = deepKey[index];
@@ -37,14 +39,20 @@ function toPath(deepKey) {
 			key += deepKey[index];
 		} else if (char === quoteChar) quoteChar = "";
 		else key += char;
-		else if (bracket) if (char === "\"" || char === "'") quoteChar = char;
-		else if (char === "]") {
+		else if (bracket) if (char === "\"" || char === "'") {
+			quoteChar = char;
+			bracketHadQuote = true;
+		} else if (char === "]") {
 			bracket = false;
-			result.push(key);
+			if (!bracketHadQuote && key.includes(".") && !bracketNumberRegex.test(key)) {
+				const segments = key.split(".");
+				for (let i = 0; i < segments.length; i++) if (segments[i] !== "") result.push(segments[i]);
+			} else result.push(key);
 			key = "";
 		} else key += char;
 		else if (char === "[") {
 			bracket = true;
+			bracketHadQuote = false;
 			if (key) {
 				result.push(key);
 				key = "";

package/dist/compat/util/toString.js

@@ -17,8 +17,11 @@
 */
 function toString(value) {
 	if (value == null) return "";
+	return baseToString(value);
+}
+function baseToString(value) {
 	if (typeof value === "string") return value;
-	if (Array.isArray(value)) return value.map(toString).join(",");
+	if (Array.isArray(value)) return value.map(baseToString).join(",");
 	const result = String(value);
 	if (result === "0" && Object.is(Number(value), -0)) return "-0";
 	return result;

package/dist/compat/util/toString.mjs

@@ -17,8 +17,11 @@
 */
 function toString(value) {
 	if (value == null) return "";
+	return baseToString(value);
+}
+function baseToString(value) {
 	if (typeof value === "string") return value;
-	if (Array.isArray(value)) return value.map(toString).join(",");
+	if (Array.isArray(value)) return value.map(baseToString).join(",");
 	const result = String(value);
 	if (result === "0" && Object.is(Number(value), -0)) return "-0";
 	return result;

package/dist/fp/array/at.d.mts

@@ -15,6 +15,6 @@
  * pipe([10, 20, 30, 40], at([1, -1]));
  * // => [20, 40]
  */
-declare function at<T>(indices: number[]): (array: readonly T[]) => T[];
+declare function at<T>(indices: readonly number[]): (array: readonly T[]) => T[];
 //#endregion
 export { at };

package/dist/fp/array/at.d.ts

@@ -15,6 +15,6 @@
  * pipe([10, 20, 30, 40], at([1, -1]));
  * // => [20, 40]
  */
-declare function at<T>(indices: number[]): (array: readonly T[]) => T[];
+declare function at<T>(indices: readonly number[]): (array: readonly T[]) => T[];
 //#endregion
 export { at };

package/dist/fp/array/orderBy.d.mts

@@ -16,6 +16,6 @@
  * pipe([{ name: 'a', age: 2 }, { name: 'b', age: 1 }], orderBy(['age'], ['asc']));
  * // => [{ name: 'b', age: 1 }, { name: 'a', age: 2 }]
  */
-declare function orderBy<T extends object>(criteria: Array<((item: T) => unknown) | keyof T>, orders: Array<'asc' | 'desc'>): (array: readonly T[]) => T[];
+declare function orderBy<T extends object>(criteria: ReadonlyArray<((item: T) => unknown) | keyof T>, orders: ReadonlyArray<'asc' | 'desc'>): (array: readonly T[]) => T[];
 //#endregion
 export { orderBy };

package/dist/fp/array/orderBy.d.ts

@@ -16,6 +16,6 @@
  * pipe([{ name: 'a', age: 2 }, { name: 'b', age: 1 }], orderBy(['age'], ['asc']));
  * // => [{ name: 'b', age: 1 }, { name: 'a', age: 2 }]
  */
-declare function orderBy<T extends object>(criteria: Array<((item: T) => unknown) | keyof T>, orders: Array<'asc' | 'desc'>): (array: readonly T[]) => T[];
+declare function orderBy<T extends object>(criteria: ReadonlyArray<((item: T) => unknown) | keyof T>, orders: ReadonlyArray<'asc' | 'desc'>): (array: readonly T[]) => T[];
 //#endregion
 export { orderBy };

package/dist/fp/array/sortBy.d.mts

@@ -21,6 +21,6 @@
  * pipe(users, sortBy(['user', 'age']));
  * // => [{ user: 'bar', age: 7 }, { user: 'foo', age: 8 }, { user: 'foo', age: 24 }]
  */
-declare function sortBy<T extends object>(criteria: Array<((item: T) => unknown) | keyof T>): (array: readonly T[]) => T[];
+declare function sortBy<T extends object>(criteria: ReadonlyArray<((item: T) => unknown) | keyof T>): (array: readonly T[]) => T[];
 //#endregion
 export { sortBy };

package/dist/fp/array/sortBy.d.ts

@@ -21,6 +21,6 @@
  * pipe(users, sortBy(['user', 'age']));
  * // => [{ user: 'bar', age: 7 }, { user: 'foo', age: 8 }, { user: 'foo', age: 24 }]
  */
-declare function sortBy<T extends object>(criteria: Array<((item: T) => unknown) | keyof T>): (array: readonly T[]) => T[];
+declare function sortBy<T extends object>(criteria: ReadonlyArray<((item: T) => unknown) | keyof T>): (array: readonly T[]) => T[];
 //#endregion
 export { sortBy };

package/dist/fp/array/unzip.d.mts

@@ -6,6 +6,9 @@ type Unzip<K extends unknown[]> = { [I in keyof K]: Array<K[I]> };
  * The returned function is the data-last form of the main {@link unzip} utility.
  * Use it with {@link pipe}.
  *
+ * When the returned function is invoked, the result's length matches the longest nested array.
+ * Missing positions in shorter arrays are filled with `undefined`.
+ *
  * @template T - The tuple type inside the zipped array.
  * @returns A function that maps zipped tuples to arrays grouped by tuple position.
  *

package/dist/fp/array/unzip.d.ts

@@ -6,6 +6,9 @@ type Unzip<K extends unknown[]> = { [I in keyof K]: Array<K[I]> };
  * The returned function is the data-last form of the main {@link unzip} utility.
  * Use it with {@link pipe}.
  *
+ * When the returned function is invoked, the result's length matches the longest nested array.
+ * Missing positions in shorter arrays are filled with `undefined`.
+ *
  * @template T - The tuple type inside the zipped array.
  * @returns A function that maps zipped tuples to arrays grouped by tuple position.
  *

package/dist/fp/array/unzip.js

@@ -6,6 +6,9 @@ const require_unzip = require("../../array/unzip.js");
 * The returned function is the data-last form of the main {@link unzip} utility.
 * Use it with {@link pipe}.
 *
+* When the returned function is invoked, the result's length matches the longest nested array.
+* Missing positions in shorter arrays are filled with `undefined`.
+*
 * @template T - The tuple type inside the zipped array.
 * @returns A function that maps zipped tuples to arrays grouped by tuple position.
 *

package/dist/fp/array/unzip.mjs

@@ -6,6 +6,9 @@ import { unzip as unzip$1 } from "../../array/unzip.mjs";
 * The returned function is the data-last form of the main {@link unzip} utility.
 * Use it with {@link pipe}.
 *
+* When the returned function is invoked, the result's length matches the longest nested array.
+* Missing positions in shorter arrays are filled with `undefined`.
+*
 * @template T - The tuple type inside the zipped array.
 * @returns A function that maps zipped tuples to arrays grouped by tuple position.
 *