moderndash 3.3.0 → 3.3.2

package/dist/index.d.ts

@@ -50,7 +50,7 @@ declare function count<TElem, TKey extends PropertyKey>(array: readonly TElem[],
  * @template TElem The type of the array elements.
  * @template TMinLength The minimum length of the array.
  */
-type ArrayMinLength<TElem, TMinLenght extends number> = BuildArrayMinLength<TElem, TMinLenght, []>;
+type ArrayMinLength<TElem, TMinLength extends number> = BuildArrayMinLength<TElem, TMinLength, []>;
 type BuildArrayMinLength<TElem, TMinLength extends number, Current extends TElem[]> = Current["length"] extends TMinLength ? [...Current, ...TElem[]] : BuildArrayMinLength<TElem, TMinLength, [...Current, TElem]>;
 
 type CompareFunction<TArrays extends ArrayMinLength<unknown[], 2>> = (a: TArrays[0][number], b: ArrayTail<TArrays>[number][number]) => boolean;
@@ -86,7 +86,7 @@ declare function difference<TArrays extends ArrayMinLength<unknown[], 2>>(...arr
 
 /**
  * Creates a slice of `array` excluding elements dropped from the end.
- * Elements are dropped until `predicate` returns falsey.
+ * Elements are dropped until `predicate` returns falsy.
  *
  * @example
  * const users = [
@@ -106,7 +106,7 @@ declare function dropRightWhile<TElem>(array: readonly TElem[], predicate: (valu
 
 /**
  * Creates a slice of `array` excluding elements dropped from the beginning.
- * Elements are dropped until `predicate` returns falsey.
+ * Elements are dropped until `predicate` returns falsy.
  *
  * @example
  * const users = [
@@ -233,7 +233,7 @@ declare function sort<TElem>(array: readonly TElem[], ...orders: {
 
 /**
  * Creates a slice of `array` with elements taken from the end.
- * Elements are taken until `predicate` returns falsey.
+ * Elements are taken until `predicate` returns falsy.
  *
  * @example
  * const users = [
@@ -253,7 +253,7 @@ declare function takeRightWhile<TElem>(array: readonly TElem[], predicate: (elem
 
 /**
  * Creates a slice of `array` with elements taken from the beginning.
- * Elements are taken until `predicate` returns falsey.
+ * Elements are taken until `predicate` returns falsy.
  *
  * @example
  * const users = [
@@ -431,7 +431,7 @@ declare function randomInt(min: number, max: number): number;
 declare function randomString(length: number, charSet?: string): string;
 
 /**
- * Debouces the decorated function. Only calling it after a specified amount of time has passed without any new calls.
+ * Debounces the decorated function. Only calling it after a specified amount of time has passed without any new calls.
  *
  * Look at {@link debounce} for the non-decorator version.
  *
@@ -453,7 +453,7 @@ 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): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
 
 /**
  * Only invokes the decorated function as long as it's called `<= n` times.
@@ -479,7 +479,7 @@ declare function decDebounce(wait: number): (target: unknown, key: string, descr
  * ```
  * @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): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
 
 type GenericFunction<TFunc extends (...args: any) => any> = (...args: Parameters<TFunc>) => ReturnType<TFunc>;
 
@@ -566,7 +566,7 @@ 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]): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
 
 /**
  * Only invokes the decorated function after it's called more than `n` times.
@@ -589,7 +589,7 @@ declare function decMemoize(options?: Parameters<typeof memoize>[1]): (target: u
  * ```
  * @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): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
 
 /**
  * The decorated function is invoked at most once per every `wait` milliseconds.
@@ -613,7 +613,7 @@ declare function decMinCalls(n: number): (target: unknown, key: string, descript
  * ```
  * @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): (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
 
 type Tail<T extends unknown[]> = T extends [infer _Head, ...infer Tail] ? Tail : never;
 /**
@@ -644,7 +644,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>>) => (_target: unknown, _key: string, descriptor: PropertyDescriptor) => void;
 
 /**
  * Creates a debounced version of a function. Only calling it after a specified amount of time has passed without any new calls.
@@ -961,9 +961,9 @@ declare class Queue {
      */
     constructor(maxConcurrent: number);
     /**
-     * Add aync functions or an array of async functions to the queue.
+     * Add async functions or an array of async functions to the queue.
      *
-     * @param asyncFn The aync function(s) to add to the queue.
+     * @param asyncFn The async function(s) to add to the queue.
      * @returns A promise that resolves when the added function(s) finishes.
      */
     add<TProm, TAsyncFn extends () => Promise<TProm>>(asyncFn: TAsyncFn): Promise<TProm>;
@@ -1217,7 +1217,7 @@ declare function snakeCase(str: string): string;
  * @param forceFallback Force the use of the positive lookahead fallback. Only used for testing.
  * @returns An array of words.
  */
-declare function splitWords(str: string, forceFallback?: boolean): string[];
+declare function splitWords(str: string): string[];
 
 /**
  * Converts a string to Title Case.

package/dist/index.js

@@ -263,7 +263,7 @@ function randomString(length, charSet = DEFAULT_CHARSET) {
 // src/decorator/toDecorator.ts
 function toDecorator(func) {
   return function(...args) {
-    return function(target, key, descriptor) {
+    return function(_target, _key, descriptor) {
       const creatorArgs = [descriptor.value, ...args];
       descriptor.value = func(...creatorArgs);
     };
@@ -646,25 +646,9 @@ async function tryCatch(promise) {
 }
 
 // src/string/splitWords.ts
-function splitWords(str, forceFallback = false) {
-  return lookbehindWordBoundary && !forceFallback ? str.split(lookbehindWordBoundary).filter(Boolean) : splitWordsFallback(str);
-}
-var wordBoundaryFallback = /[^\dA-Za-z]|(?=[A-Z][a-z])/;
-var lookbehindReplacement = /([a-z])([A-Z])/g;
-var lookbehindWordBoundary = tryLookbehindRegex();
-function tryLookbehindRegex() {
-  try {
-    return new RegExp(
-      "[^\\dA-Za-z]|(?<=[a-z])(?=[A-Z])|(?<=[A-Z])(?=[A-Z][a-z])"
-      // lookahead for an uppercase letter followed by a lowercase letter
-    );
-  } catch {
-    return void 0;
-  }
-}
-function splitWordsFallback(str) {
-  const modifiedStr = str.replace(lookbehindReplacement, (match, p1, p2) => p1 + "\0" + p2);
-  return modifiedStr.split(wordBoundaryFallback).filter(Boolean).map((word) => word.replace(/\u0000/g, ""));
+var wordsRegex = /(?:\d*[a-z]+)|(?:[A-Z][a-z]+)|(?:\d*[A-Z]+(?=[^a-z]|$))|\d+/g;
+function splitWords(str) {
+  return str.match(wordsRegex) ?? [];
 }
 
 // src/string/deburr.ts
@@ -703,9 +687,9 @@ function escapeHtml(str) {
 }
 
 // src/string/escapeRegExp.ts
-var escapleCharsRegex = /[$()*+.?[\\\]^{|}]/g;
+var escapeCharsRegex = /[$()*+.?[\\\]^{|}]/g;
 function escapeRegExp(str) {
-  return str.replace(escapleCharsRegex, "\\$&");
+  return str.replace(escapeCharsRegex, "\\$&");
 }
 
 // src/string/kebabCase.ts