moderndash 3.12.0 → 4.0.1

package/dist/index.d.cts

@@ -1,4 +1,5 @@
-import { Call, Tuples, Objects } from 'hotscript';
+import { Paths as Paths$1 } from 'type-fest';
+import { Call, Objects } from 'hotscript';
 
 /**
  * Creates an array of elements split into groups the length of size. If array can't be split evenly, the final chunk will be the remaining elements.
@@ -59,11 +60,10 @@ type CompareFunction<TArrays extends ArrayMinLength<unknown[], 2>> = (a: TArrays
 type ArrayTail<TArray extends unknown[]> = TArray extends [unknown, ...infer U] ? U : never;
 
 /**
- * @deprecated **Deprecated: Use the native [Set.prototype.difference()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/difference) function instead.**
- *
  * Create a new array with values from the first array that are not present in the other arrays.
  * Optionally, use a compare function to determine the comparison of elements (default is `===`).
  *
+ * **Consider using the native [Set.prototype.difference()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/difference) function instead.**
  *
  * @example
  * difference([2, 1], [2, 3], [6])
@@ -80,6 +80,7 @@ type ArrayTail<TArray extends unknown[]> = TArray extends [unknown, ...infer U]
  *
  * difference(arr1, arr2, (a, b) => a.id === b.id)
  * // => [{ id: 1, name: 'Yeet' }]
+ *
  * @param arraysOrCompareFn Two or more arrays with an optional compare function at the end
  * @template TElem The type of the array elements
  * @template TArrays The type of the arrays provided
@@ -130,7 +131,9 @@ declare function dropWhile<TElem>(array: readonly TElem[], predicate: (value: TE
 
 /**
  * Creates an object with grouped items in the array.
- * @deprecated Use the javascript "Object.groupBy()" version instead.
+ *
+ * @deprecated
+ * **Deprecated: Use the native "Object.groupBy()" function instead.**
  *
  * @example
  * group([6.1, 4.2, 6.3], Math.floor)
@@ -147,13 +150,13 @@ declare function dropWhile<TElem>(array: readonly TElem[], predicate: (value: TE
 declare function group<TElem, TKey extends PropertyKey>(array: readonly TElem[], getGroupKey: (elem: TElem) => TKey): Record<TKey, TElem[]>;
 
 /**
- * @deprecated **Deprecated: Use the native [Set.prototype.intersection()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/intersection) function instead.**
- *
  * Create an array with unique values that are present in all arrays.
  * The order of the values is based on the first array.
  *
  * Optionally, use a compare function for element comparison (default is `===`).
  *
+ * **Consider using the native [Set.prototype.intersection()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/intersection) function instead.**
+ *
  * @example
  * intersection([2, 1], [2, 3], [6, 2])
  * // => [2]
@@ -466,8 +469,6 @@ declare function randomString(length: number, charSet?: string): string;
  *
  * Look at {@link debounce} for the non-decorator version.
  *
- * *Requires the [experimentalDecorators](https://www.typescriptlang.org/tsconfig#experimentalDecorators) flag to be set.*
- *
  * @example
  * ```typescript
  * class TestClass {
@@ -484,7 +485,11 @@ declare function randomString(length: number, charSet?: string): string;
  * ```
  * @param wait Milliseconds to wait before invoking the decorated function after the last invocation.
  */
-declare function decDebounce(wait: number): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
+declare function decDebounce(wait: number): (originalMethod: unknown, _context: ClassMethodDecoratorContext) => GenericFunction<any> & {
+    cancel: () => void;
+    flush: () => void;
+    pending: () => boolean;
+};
 
 /**
  * Only invokes the decorated function as long as it's called `<= n` times.
@@ -492,8 +497,6 @@ declare function decDebounce(wait: number): (_target: unknown, _key: string, des
  *
  * Look at {@link maxCalls} for the non-decorator version.
  *
- * *Requires the [experimentalDecorators](https://www.typescriptlang.org/tsconfig#experimentalDecorators) flag to be set.*
- *
  * @example
  * ```typescript
  * class TestClass {
@@ -510,7 +513,7 @@ declare function decDebounce(wait: number): (_target: unknown, _key: string, des
  * ```
  * @param n The number of calls before the cached result is returned.
  */
-declare function decMaxCalls(n: number): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
+declare function decMaxCalls(n: number): (originalMethod: unknown, _context: ClassMethodDecoratorContext) => GenericFunction<any>;
 
 type GenericFunction<TFunc extends (...args: any) => any> = (...args: Parameters<TFunc>) => ReturnType<TFunc>;
 
@@ -576,8 +579,6 @@ declare function memoize<TFunc extends GenericFunction<TFunc>, Cache extends Map
  *
  * Look at {@link memoize} for the non-decorator version.
  *
- * *Requires the [experimentalDecorators](https://www.typescriptlang.org/tsconfig#experimentalDecorators) flag to be set.*
- *
  * @example
  * ```typescript
  * class TestClass {
@@ -597,14 +598,15 @@ declare function memoize<TFunc extends GenericFunction<TFunc>, Cache extends Map
  * @param options.resolver - A function that determines the cache key for storing the result based on the arguments provided.
  * @param options.ttl - The time to live for the cache in milliseconds.
  */
-declare function decMemoize(options?: Parameters<typeof memoize>[1]): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
+declare function decMemoize(options?: Parameters<typeof memoize>[1]): (originalMethod: unknown, _context: ClassMethodDecoratorContext) => GenericFunction<GenericFunction<any>> & {
+    cache: Map<string, [any, number]>;
+};
 
 /**
  * Only invokes the decorated function after it's called more than `n` times.
  *
  * Look at {@link minCalls} for the non-decorator version.
  *
- * *Requires the [experimentalDecorators](https://www.typescriptlang.org/tsconfig#experimentalDecorators) flag to be set.*
  * @example
  * ```typescript
  * class TestClass {
@@ -620,15 +622,13 @@ declare function decMemoize(options?: Parameters<typeof memoize>[1]): (_target:
  * ```
  * @param n The number of calls before the decorated function is invoked.
  */
-declare function decMinCalls(n: number): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
+declare function decMinCalls(n: number): (originalMethod: unknown, _context: ClassMethodDecoratorContext) => (this: unknown, ...args: unknown[]) => any;
 
 /**
  * The decorated function is invoked at most once per every `wait` milliseconds.
  *
  * Look at {@link throttle} for the non-decorator version.
  *
- * *Requires the [experimentalDecorators](https://www.typescriptlang.org/tsconfig#experimentalDecorators) flag to be set.*
- *
  * @example
  * ```typescript
  * class TestClass {
@@ -644,7 +644,7 @@ declare function decMinCalls(n: number): (_target: unknown, _key: string, descri
  * ```
  * @param wait The number of milliseconds to wait between invocations.
  */
-declare function decThrottle(wait: number): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
+declare function decThrottle(wait: number): (originalMethod: unknown, _context: ClassMethodDecoratorContext) => GenericFunction<any>;
 
 type Tail<T extends unknown[]> = T extends [infer _Head, ...infer Tail] ? Tail : never;
 /**
@@ -675,7 +675,7 @@ type Tail<T extends unknown[]> = T extends [infer _Head, ...infer Tail] ? Tail :
  * @param func The function to transform.
  * @returns A decorator function that can be used to decorate a method.
  */
-declare function toDecorator<TFunc extends GenericFunction<TFunc>>(func: TFunc): (...args: Tail<Parameters<TFunc>>) => (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
+declare function toDecorator<TFunc extends GenericFunction<TFunc>>(func: TFunc): (...args: Tail<Parameters<TFunc>>) => (originalMethod: unknown, _context: ClassMethodDecoratorContext) => ReturnType<TFunc>;
 
 /**
  * Creates a debounced version of a function. Only calling it after a specified amount of time has passed without any new calls.
@@ -829,13 +829,15 @@ declare function round(number: number, precision?: number): number;
  * @param numbers The input array of numbers
  * @returns The sum of the input array
  */
-declare function sum(numbers: number[]): number;
-declare function sum<TNum extends readonly number[]>(numbers: TNum): Call<Tuples.Sum, TNum>;
+declare function sum(numbers: readonly number[]): number;
 
 type GenericObject = Record<PropertyKey, any>;
 
 type StringIfNever<Type> = [Type] extends [never] ? string : Type;
-type Paths$1<TObj> = StringIfNever<Call<Objects.AllPaths, TObj>>;
+type PathOrString<TObj> = StringIfNever<Paths$1<TObj, {
+    bracketNotation: true;
+    maxRecursionDepth: 20;
+}>>;
 /**
  * Flattens an object into a single level object.
  *
@@ -848,7 +850,7 @@ type Paths$1<TObj> = StringIfNever<Call<Objects.AllPaths, TObj>>;
  * @template TObj The type of the object to flatten.
  * @returns A new object with flattened keys.
  */
-declare function flatKeys<TObj extends GenericObject>(obj: TObj): Record<Paths$1<TObj>, unknown>;
+declare function flatKeys<TObj extends GenericObject>(obj: TObj): Record<PathOrString<TObj>, unknown>;
 
 /**
  * The type of a plain object.
@@ -1452,7 +1454,9 @@ declare function isPlainObject(value: unknown): value is PlainObject;
 
 /**
  * Checks if given string is a valid URL
- * @deprecated Use the native "URL.canParse" method instead.
+ *
+ * @deprecated
+ * **Deprecated: Use the native "URL.canParse" method instead.**
  *
  * @example
  * isUrl('https://google.com')

package/dist/index.d.ts

@@ -1,4 +1,5 @@
-import { Call, Tuples, Objects } from 'hotscript';
+import { Paths as Paths$1 } from 'type-fest';
+import { Call, Objects } from 'hotscript';
 
 /**
  * Creates an array of elements split into groups the length of size. If array can't be split evenly, the final chunk will be the remaining elements.
@@ -59,11 +60,10 @@ type CompareFunction<TArrays extends ArrayMinLength<unknown[], 2>> = (a: TArrays
 type ArrayTail<TArray extends unknown[]> = TArray extends [unknown, ...infer U] ? U : never;
 
 /**
- * @deprecated **Deprecated: Use the native [Set.prototype.difference()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/difference) function instead.**
- *
  * Create a new array with values from the first array that are not present in the other arrays.
  * Optionally, use a compare function to determine the comparison of elements (default is `===`).
  *
+ * **Consider using the native [Set.prototype.difference()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/difference) function instead.**
  *
  * @example
  * difference([2, 1], [2, 3], [6])
@@ -80,6 +80,7 @@ type ArrayTail<TArray extends unknown[]> = TArray extends [unknown, ...infer U]
  *
  * difference(arr1, arr2, (a, b) => a.id === b.id)
  * // => [{ id: 1, name: 'Yeet' }]
+ *
  * @param arraysOrCompareFn Two or more arrays with an optional compare function at the end
  * @template TElem The type of the array elements
  * @template TArrays The type of the arrays provided
@@ -130,7 +131,9 @@ declare function dropWhile<TElem>(array: readonly TElem[], predicate: (value: TE
 
 /**
  * Creates an object with grouped items in the array.
- * @deprecated Use the javascript "Object.groupBy()" version instead.
+ *
+ * @deprecated
+ * **Deprecated: Use the native "Object.groupBy()" function instead.**
  *
  * @example
  * group([6.1, 4.2, 6.3], Math.floor)
@@ -147,13 +150,13 @@ declare function dropWhile<TElem>(array: readonly TElem[], predicate: (value: TE
 declare function group<TElem, TKey extends PropertyKey>(array: readonly TElem[], getGroupKey: (elem: TElem) => TKey): Record<TKey, TElem[]>;
 
 /**
- * @deprecated **Deprecated: Use the native [Set.prototype.intersection()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/intersection) function instead.**
- *
  * Create an array with unique values that are present in all arrays.
  * The order of the values is based on the first array.
  *
  * Optionally, use a compare function for element comparison (default is `===`).
  *
+ * **Consider using the native [Set.prototype.intersection()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/intersection) function instead.**
+ *
  * @example
  * intersection([2, 1], [2, 3], [6, 2])
  * // => [2]
@@ -466,8 +469,6 @@ declare function randomString(length: number, charSet?: string): string;
  *
  * Look at {@link debounce} for the non-decorator version.
  *
- * *Requires the [experimentalDecorators](https://www.typescriptlang.org/tsconfig#experimentalDecorators) flag to be set.*
- *
  * @example
  * ```typescript
  * class TestClass {
@@ -484,7 +485,11 @@ declare function randomString(length: number, charSet?: string): string;
  * ```
  * @param wait Milliseconds to wait before invoking the decorated function after the last invocation.
  */
-declare function decDebounce(wait: number): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
+declare function decDebounce(wait: number): (originalMethod: unknown, _context: ClassMethodDecoratorContext) => GenericFunction<any> & {
+    cancel: () => void;
+    flush: () => void;
+    pending: () => boolean;
+};
 
 /**
  * Only invokes the decorated function as long as it's called `<= n` times.
@@ -492,8 +497,6 @@ declare function decDebounce(wait: number): (_target: unknown, _key: string, des
  *
  * Look at {@link maxCalls} for the non-decorator version.
  *
- * *Requires the [experimentalDecorators](https://www.typescriptlang.org/tsconfig#experimentalDecorators) flag to be set.*
- *
  * @example
  * ```typescript
  * class TestClass {
@@ -510,7 +513,7 @@ declare function decDebounce(wait: number): (_target: unknown, _key: string, des
  * ```
  * @param n The number of calls before the cached result is returned.
  */
-declare function decMaxCalls(n: number): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
+declare function decMaxCalls(n: number): (originalMethod: unknown, _context: ClassMethodDecoratorContext) => GenericFunction<any>;
 
 type GenericFunction<TFunc extends (...args: any) => any> = (...args: Parameters<TFunc>) => ReturnType<TFunc>;
 
@@ -576,8 +579,6 @@ declare function memoize<TFunc extends GenericFunction<TFunc>, Cache extends Map
  *
  * Look at {@link memoize} for the non-decorator version.
  *
- * *Requires the [experimentalDecorators](https://www.typescriptlang.org/tsconfig#experimentalDecorators) flag to be set.*
- *
  * @example
  * ```typescript
  * class TestClass {
@@ -597,14 +598,15 @@ declare function memoize<TFunc extends GenericFunction<TFunc>, Cache extends Map
  * @param options.resolver - A function that determines the cache key for storing the result based on the arguments provided.
  * @param options.ttl - The time to live for the cache in milliseconds.
  */
-declare function decMemoize(options?: Parameters<typeof memoize>[1]): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
+declare function decMemoize(options?: Parameters<typeof memoize>[1]): (originalMethod: unknown, _context: ClassMethodDecoratorContext) => GenericFunction<GenericFunction<any>> & {
+    cache: Map<string, [any, number]>;
+};
 
 /**
  * Only invokes the decorated function after it's called more than `n` times.
  *
  * Look at {@link minCalls} for the non-decorator version.
  *
- * *Requires the [experimentalDecorators](https://www.typescriptlang.org/tsconfig#experimentalDecorators) flag to be set.*
  * @example
  * ```typescript
  * class TestClass {
@@ -620,15 +622,13 @@ declare function decMemoize(options?: Parameters<typeof memoize>[1]): (_target:
  * ```
  * @param n The number of calls before the decorated function is invoked.
  */
-declare function decMinCalls(n: number): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
+declare function decMinCalls(n: number): (originalMethod: unknown, _context: ClassMethodDecoratorContext) => (this: unknown, ...args: unknown[]) => any;
 
 /**
  * The decorated function is invoked at most once per every `wait` milliseconds.
  *
  * Look at {@link throttle} for the non-decorator version.
  *
- * *Requires the [experimentalDecorators](https://www.typescriptlang.org/tsconfig#experimentalDecorators) flag to be set.*
- *
  * @example
  * ```typescript
  * class TestClass {
@@ -644,7 +644,7 @@ declare function decMinCalls(n: number): (_target: unknown, _key: string, descri
  * ```
  * @param wait The number of milliseconds to wait between invocations.
  */
-declare function decThrottle(wait: number): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
+declare function decThrottle(wait: number): (originalMethod: unknown, _context: ClassMethodDecoratorContext) => GenericFunction<any>;
 
 type Tail<T extends unknown[]> = T extends [infer _Head, ...infer Tail] ? Tail : never;
 /**
@@ -675,7 +675,7 @@ type Tail<T extends unknown[]> = T extends [infer _Head, ...infer Tail] ? Tail :
  * @param func The function to transform.
  * @returns A decorator function that can be used to decorate a method.
  */
-declare function toDecorator<TFunc extends GenericFunction<TFunc>>(func: TFunc): (...args: Tail<Parameters<TFunc>>) => (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
+declare function toDecorator<TFunc extends GenericFunction<TFunc>>(func: TFunc): (...args: Tail<Parameters<TFunc>>) => (originalMethod: unknown, _context: ClassMethodDecoratorContext) => ReturnType<TFunc>;
 
 /**
  * Creates a debounced version of a function. Only calling it after a specified amount of time has passed without any new calls.
@@ -829,13 +829,15 @@ declare function round(number: number, precision?: number): number;
  * @param numbers The input array of numbers
  * @returns The sum of the input array
  */
-declare function sum(numbers: number[]): number;
-declare function sum<TNum extends readonly number[]>(numbers: TNum): Call<Tuples.Sum, TNum>;
+declare function sum(numbers: readonly number[]): number;
 
 type GenericObject = Record<PropertyKey, any>;
 
 type StringIfNever<Type> = [Type] extends [never] ? string : Type;
-type Paths$1<TObj> = StringIfNever<Call<Objects.AllPaths, TObj>>;
+type PathOrString<TObj> = StringIfNever<Paths$1<TObj, {
+    bracketNotation: true;
+    maxRecursionDepth: 20;
+}>>;
 /**
  * Flattens an object into a single level object.
  *
@@ -848,7 +850,7 @@ type Paths$1<TObj> = StringIfNever<Call<Objects.AllPaths, TObj>>;
  * @template TObj The type of the object to flatten.
  * @returns A new object with flattened keys.
  */
-declare function flatKeys<TObj extends GenericObject>(obj: TObj): Record<Paths$1<TObj>, unknown>;
+declare function flatKeys<TObj extends GenericObject>(obj: TObj): Record<PathOrString<TObj>, unknown>;
 
 /**
  * The type of a plain object.
@@ -1452,7 +1454,9 @@ declare function isPlainObject(value: unknown): value is PlainObject;
 
 /**
  * Checks if given string is a valid URL
- * @deprecated Use the native "URL.canParse" method instead.
+ *
+ * @deprecated
+ * **Deprecated: Use the native "URL.canParse" method instead.**
  *
  * @example
  * isUrl('https://google.com')

package/dist/index.js

@@ -226,12 +226,10 @@ function randomInt(min, max) {
 // src/crypto/randomElem.ts
 function randomElem(array, multi) {
   if (multi === void 0) {
-    if (array.length === 0)
-      return void 0;
+    if (array.length === 0) return void 0;
     return getSingleElement(array);
   }
-  if (multi && array.length === 0)
-    return [];
+  if (multi && array.length === 0) return [];
   const result = new Array(multi);
   for (let i = 0; i < multi; i++) {
     result[i] = getSingleElement(array);
@@ -257,8 +255,7 @@ function randomFloat(min, max) {
 // src/crypto/randomString.ts
 var DEFAULT_CHARSET = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
 function randomString(length, charSet = DEFAULT_CHARSET) {
-  if (charSet.length <= 0)
-    return "";
+  if (charSet.length <= 0) return "";
   let result = "";
   for (let index = 0; index < length; index++) {
     const randomIndex = randomInt(0, charSet.length - 1);
@@ -270,9 +267,9 @@ function randomString(length, charSet = DEFAULT_CHARSET) {
 // src/decorator/toDecorator.ts
 function toDecorator(func) {
   return function(...args) {
-    return function(_target, _key, descriptor) {
-      const creatorArgs = [descriptor.value, ...args];
-      descriptor.value = func(...creatorArgs);
+    return function(originalMethod, _context) {
+      const funcArgs = [originalMethod, ...args];
+      return func(...funcArgs);
     };
   };
 }
@@ -457,6 +454,7 @@ function merge(target, ...sources) {
   const targetCopy = { ...target };
   for (const source of sources) {
     for (const [key, value] of Object.entries(source)) {
+      if (key === "__proto__") continue;
       targetCopy[key] = isPlainObject(value) && isPlainObject(targetCopy[key]) ? merge(targetCopy[key], value) : value;
     }
   }
@@ -490,6 +488,8 @@ function set(obj, path, value) {
   let currentObj = obj;
   for (let index = 0; index < pathParts.length; index++) {
     const key = pathParts[index].replace(matchBracketsRegex, "");
+    if (key === "__proto__")
+      return obj;
     if (index === pathParts.length - 1) {
       currentObj[key] = value;
       break;
@@ -682,8 +682,7 @@ function splitWords(str) {
 
 // src/string/capitalize.ts
 function capitalize(str) {
-  if (str === "")
-    return "";
+  if (str === "") return "";
   return str.charAt(0).toUpperCase() + str.slice(1).toLowerCase();
 }
 
@@ -695,12 +694,10 @@ function deburr(str) {
 
 // src/string/camelCase.ts
 function camelCase(str) {
-  if (str === "")
-    return "";
+  if (str === "") return "";
   str = deburr(str);
   const words = splitWords(str);
-  if (words.length === 0)
-    return "";
+  if (words.length === 0) return "";
   let camelCase2 = words[0].toLowerCase();
   for (let index = 1; index < words.length; index++) {
     const word = words[index];
@@ -730,8 +727,7 @@ function escapeRegExp(str) {
 
 // src/string/kebabCase.ts
 function kebabCase(str) {
-  if (str === "")
-    return "";
+  if (str === "") return "";
   str = deburr(str);
   const words = splitWords(str);
   let kebabCase2 = "";
@@ -743,8 +739,7 @@ function kebabCase(str) {
 
 // src/string/pascalCase.ts
 function pascalCase(str) {
-  if (str === "")
-    return "";
+  if (str === "") return "";
   str = deburr(str);
   const words = splitWords(str);
   let pascalCase2 = "";
@@ -764,8 +759,7 @@ function replaceLast(str, searchFor, replaceWith) {
 
 // src/string/snakeCase.ts
 function snakeCase(str) {
-  if (str === "")
-    return "";
+  if (str === "") return "";
   str = deburr(str);
   const words = splitWords(str);
   let snakeCase2 = "";
@@ -780,8 +774,7 @@ function snakeCase(str) {
 
 // src/string/titleCase.ts
 function titleCase(str) {
-  if (str === "")
-    return "";
+  if (str === "") return "";
   str = deburr(str);
   const words = splitWords(str);
   let titleCase2 = "";
@@ -825,8 +818,7 @@ function trimStart(str, chars) {
 // src/string/truncate.ts
 function truncate(str, options) {
   const { length = 30, ellipsis = "...", separator } = options ?? {};
-  if (str.length <= length)
-    return str;
+  if (str.length <= length) return str;
   const end = length - ellipsis.length;
   if (end < 1)
     return ellipsis;
@@ -870,10 +862,8 @@ function isEmpty(value) {
 
 // src/validate/isEqual.ts
 function isEqual(a, b) {
-  if (Object.is(a, b))
-    return true;
-  if (typeof a !== typeof b)
-    return false;
+  if (Object.is(a, b)) return true;
+  if (typeof a !== typeof b) return false;
   if (Array.isArray(a) && Array.isArray(b))
     return isSameArray(a, b);
   if (a instanceof Date && b instanceof Date)
@@ -887,8 +877,7 @@ function isEqual(a, b) {
   if (a instanceof DataView && b instanceof DataView)
     return dataViewsAreEqual(a, b);
   if (isTypedArray(a) && isTypedArray(b)) {
-    if (a.byteLength !== b.byteLength)
-      return false;
+    if (a.byteLength !== b.byteLength) return false;
     return isSameArray(a, b);
   }
   return false;
@@ -896,25 +885,20 @@ function isEqual(a, b) {
 function isSameObject(a, b) {
   const keys1 = Object.keys(a);
   const keys2 = Object.keys(b);
-  if (!isEqual(keys1, keys2))
-    return false;
+  if (!isEqual(keys1, keys2)) return false;
   for (const key of keys1) {
-    if (!isEqual(a[key], b[key]))
-      return false;
+    if (!isEqual(a[key], b[key])) return false;
   }
   return true;
 }
 function isSameArray(a, b) {
-  if (a.length !== b.length)
-    return false;
+  if (a.length !== b.length) return false;
   return a.every((element, index) => isEqual(element, b[index]));
 }
 function dataViewsAreEqual(a, b) {
-  if (a.byteLength !== b.byteLength)
-    return false;
+  if (a.byteLength !== b.byteLength) return false;
   for (let offset = 0; offset < a.byteLength; offset++) {
-    if (a.getUint8(offset) !== b.getUint8(offset))
-      return false;
+    if (a.getUint8(offset) !== b.getUint8(offset)) return false;
   }
   return true;
 }