radashi 12.4.0 → 13.0.0-beta.f4c6a24

package/dist/radashi.cjs

@@ -2,9 +2,6 @@
 
 // src/array/alphabetical.ts
 function alphabetical(array, getter, direction = "asc") {
-  if (!array) {
-    return [];
-  }
   const asc = (a, b) => `${getter(a)}`.localeCompare(getter(b));
   const dsc = (a, b) => `${getter(b)}`.localeCompare(getter(a));
   return array.slice().sort(direction === "desc" ? dsc : asc);
@@ -12,10 +9,7 @@ function alphabetical(array, getter, direction = "asc") {
 
 // src/array/boil.ts
 function boil(array, compareFunc) {
-  if (!array || (array.length ?? 0) === 0) {
-    return null;
-  }
-  return array.reduce(compareFunc);
+  return array.length ? array.reduce(compareFunc) : null;
 }
 
 // src/array/cartesianProduct.ts
@@ -46,7 +40,7 @@ function castArrayIfExists(value) {
 }
 
 // src/array/cluster.ts
-function cluster(array, size = 2) {
+function cluster(array, size) {
   const clusters = [];
   for (let i = 0; i < array.length; i += size) {
     clusters.push(array.slice(i, i + size));
@@ -56,9 +50,6 @@ function cluster(array, size = 2) {
 
 // src/array/counting.ts
 function counting(array, identity) {
-  if (!array) {
-    return {};
-  }
   return array.reduce(
     (acc, item) => {
       const id = identity(item);
@@ -71,15 +62,6 @@ function counting(array, identity) {
 
 // src/array/diff.ts
 function diff(root, other, identity = (t) => t) {
-  if (!(root == null ? void 0 : root.length) && !(other == null ? void 0 : other.length)) {
-    return [];
-  }
-  if ((root == null ? void 0 : root.length) === void 0) {
-    return [...other];
-  }
-  if (!(other == null ? void 0 : other.length)) {
-    return [...root];
-  }
   const bKeys = other.reduce(
     (acc, item) => {
       acc[identity(item)] = true;
@@ -92,7 +74,7 @@ function diff(root, other, identity = (t) => t) {
 
 // src/array/first.ts
 function first(array, defaultValue) {
-  return (array == null ? void 0 : array.length) > 0 ? array[0] : defaultValue;
+  return array.length > 0 ? array[0] : defaultValue;
 }
 
 // src/array/flat.ts
@@ -106,10 +88,8 @@ function flat(lists) {
 // src/array/fork.ts
 function fork(array, condition) {
   const forked = [[], []];
-  if (array) {
-    for (const item of array) {
-      forked[condition(item) ? 0 : 1].push(item);
-    }
+  for (const item of array) {
+    forked[condition(item) ? 0 : 1].push(item);
   }
   return forked;
 }
@@ -131,9 +111,6 @@ function group(array, getGroupId) {
 
 // src/array/intersects.ts
 function intersects(listA, listB, identity) {
-  if (!listA || !listB) {
-    return false;
-  }
   if (identity) {
     const known = new Set(listA.map(identity));
     return listB.some((item) => known.has(identity(item)));
@@ -152,7 +129,7 @@ function iterate(count, func, initValue) {
 
 // src/array/last.ts
 function last(array, defaultValue) {
-  return (array == null ? void 0 : array.length) > 0 ? array[array.length - 1] : defaultValue;
+  return array.length > 0 ? array[array.length - 1] : defaultValue;
 }
 
 // src/array/list.ts
@@ -171,18 +148,6 @@ function mapify(array, getKey, getValue = (item) => item) {
 
 // src/array/merge.ts
 function merge(prev, array, toKey) {
-  if (!array && !prev) {
-    return [];
-  }
-  if (!array) {
-    return [...prev];
-  }
-  if (!prev) {
-    return [];
-  }
-  if (!toKey) {
-    return [...prev];
-  }
   const keys2 = /* @__PURE__ */ new Map();
   for (const item of array) {
     keys2.set(toKey(item), item);
@@ -211,9 +176,6 @@ function remove(array, predicate) {
 
 // src/array/replace.ts
 function replace(array, newItem, match) {
-  if (!array) {
-    return [];
-  }
   if (newItem === void 0) {
     return [...array];
   }
@@ -229,15 +191,9 @@ function replace(array, newItem, match) {
 
 // src/array/replaceOrAppend.ts
 function replaceOrAppend(array, newItem, match) {
-  if (!array && !newItem) {
-    return [];
-  }
-  if (!newItem) {
+  if (newItem === void 0) {
     return [...array];
   }
-  if (!array) {
-    return [newItem];
-  }
   const out = array.slice();
   for (let index = 0; index < array.length; index++) {
     if (match(array[index], index)) {
@@ -251,9 +207,6 @@ function replaceOrAppend(array, newItem, match) {
 
 // src/array/select.ts
 function select(array, mapper, condition) {
-  if (!array) {
-    return [];
-  }
   let mapped;
   return array.reduce((acc, item, index) => {
     if (condition) {
@@ -267,9 +220,6 @@ function select(array, mapper, condition) {
 
 // src/array/selectFirst.ts
 function selectFirst(array, mapper, condition) {
-  if (!array) {
-    return void 0;
-  }
   let foundIndex = -1;
   const found = array.find((item, index) => {
     foundIndex = index;
@@ -297,9 +247,6 @@ function sift(array) {
 
 // src/array/sort.ts
 function sort(array, getter, desc = false) {
-  if (!array) {
-    return [];
-  }
   const asc = (a, b) => getter(a) - getter(b);
   const dsc = (a, b) => getter(b) - getter(a);
   return array.slice().sort(desc === true ? dsc : asc);
@@ -307,9 +254,6 @@ function sort(array, getter, desc = false) {
 
 // src/array/toggle.ts
 function toggle(array, item, toKey, options) {
-  if (!array) {
-    return item !== void 0 ? [item] : [];
-  }
   if (item === void 0) {
     return [...array];
   }
@@ -345,9 +289,6 @@ function unique(array, toKey) {
 
 // src/array/unzip.ts
 function unzip(arrays) {
-  if (!arrays || !arrays.length) {
-    return [];
-  }
   const out = new Array(
     arrays.reduce((max2, arr) => Math.max(max2, arr.length), 0)
   );
@@ -366,9 +307,6 @@ function zip(...arrays) {
 
 // src/array/zipToObject.ts
 function zipToObject(keys2, values) {
-  if (!keys2 || !keys2.length) {
-    return {};
-  }
   const getValue = isFunction(values) ? values : isArray(values) ? (_k, i) => values[i] : (_k, _i) => values;
   return keys2.reduce(
     (acc, key, idx) => {
@@ -455,9 +393,6 @@ function guard(func, shouldGuard) {
 
 // src/async/map.ts
 async function map(array, asyncMapFunc) {
-  if (!array) {
-    return [];
-  }
   const result = [];
   let index = 0;
   for (const value of array) {
@@ -527,9 +462,6 @@ async function parallel(options, array, func) {
 
 // src/async/reduce.ts
 async function reduce(array, reducer, initialValue) {
-  if (!array) {
-    array = [];
-  }
   let index = 0;
   let acc = initialValue;
   if (acc === void 0 && arguments.length < 3) {
@@ -661,31 +593,30 @@ function compose(...funcs) {
 }
 
 // src/curry/debounce.ts
-function debounce({ delay, leading }, func) {
-  let timer = void 0;
-  let active = true;
+function debounce({ delay, leading }, callee) {
+  let timeout2;
   const debounced = (...args) => {
-    if (active) {
-      clearTimeout(timer);
-      timer = setTimeout(() => {
-        active && func(...args);
-        timer = void 0;
-      }, delay);
-      if (leading) {
-        func(...args);
-        leading = false;
-      }
+    clearTimeout(timeout2);
+    if (leading) {
+      leading = false;
+      callee(...args);
     } else {
-      func(...args);
+      timeout2 = setTimeout(
+        debounced.flush = () => {
+          debounced.flush = noop;
+          clearTimeout(timeout2);
+          callee(...args);
+        },
+        delay
+      );
     }
   };
-  debounced.isPending = () => {
-    return timer !== void 0;
-  };
+  debounced.callee = callee;
+  debounced.flush = noop;
   debounced.cancel = () => {
-    active = false;
+    debounced.flush = noop;
+    clearTimeout(timeout2);
   };
-  debounced.flush = (...args) => func(...args);
   return debounced;
 }
 
@@ -839,15 +770,7 @@ function clamp(n, min2, max2) {
 }
 
 // src/number/inRange.ts
-function inRange(number, start, end) {
-  const isTypeSafe = typeof number === "number" && typeof start === "number" && (typeof end === "undefined" || typeof end === "number");
-  if (!isTypeSafe) {
-    return false;
-  }
-  if (typeof end === "undefined") {
-    end = start;
-    start = 0;
-  }
+function inRange(number, start, end = 0) {
   return number >= Math.min(start, end) && number < Math.max(start, end);
 }
 
@@ -858,7 +781,7 @@ function lerp(from, to, amount) {
 
 // src/number/max.ts
 function max(array, getter) {
-  if (!array || (array.length ?? 0) === 0) {
+  if (!array.length) {
     return null;
   }
   const get2 = getter ?? ((v) => v);
@@ -867,7 +790,7 @@ function max(array, getter) {
 
 // src/number/min.ts
 function min(array, getter) {
-  if (!array || (array.length ?? 0) === 0) {
+  if (!array.length) {
     return null;
   }
   const get2 = getter ?? ((v) => v);
@@ -917,9 +840,6 @@ function toInt(value, defaultValue) {
 
 // src/object/assign.ts
 function assign(initial, override) {
-  if (!initial || !override) {
-    return initial ?? override ?? {};
-  }
   const proto = Object.getPrototypeOf(initial);
   const merged = proto ? { ...initial } : Object.assign(Object.create(proto), initial);
   for (const key of Object.keys(override)) {
@@ -930,12 +850,6 @@ function assign(initial, override) {
 
 // src/object/clone.ts
 function clone(obj) {
-  if (isPrimitive(obj)) {
-    return obj;
-  }
-  if (typeof obj === "function") {
-    return obj.bind({});
-  }
   const proto = Object.getPrototypeOf(obj);
   const newObj = typeof (proto == null ? void 0 : proto.constructor) === "function" ? new proto.constructor() : Object.create(proto);
   for (const key of Object.getOwnPropertyNames(obj)) {
@@ -1013,9 +927,6 @@ function cloneDeep(root, customStrategy) {
 
 // src/object/construct.ts
 function construct(obj) {
-  if (!obj) {
-    return {};
-  }
   return Object.keys(obj).reduce((acc, path) => {
     return set(acc, path, obj[path]);
   }, {});
@@ -1023,9 +934,6 @@ function construct(obj) {
 
 // src/object/crush.ts
 function crush(value) {
-  if (!value) {
-    return {};
-  }
   return function crushReducer(crushed, value2, path) {
     if (isObject(value2) || isArray(value2)) {
       for (const [prop, propValue] of Object.entries(value2)) {
@@ -1068,9 +976,6 @@ function get(value, path, defaultValue) {
 
 // src/object/invert.ts
 function invert(obj) {
-  if (!obj) {
-    return {};
-  }
   const keys2 = Object.keys(obj);
   return keys2.reduce(
     (acc, key) => {
@@ -1083,9 +988,6 @@ function invert(obj) {
 
 // src/object/keys.ts
 function keys(value) {
-  if (!value) {
-    return [];
-  }
   const keys2 = [];
   const keyPath = [];
   const recurse = (value2) => {
@@ -1111,14 +1013,7 @@ function keys(value) {
 
 // src/object/listify.ts
 function listify(obj, toItem) {
-  if (!obj) {
-    return [];
-  }
-  const entries = Object.entries(obj);
-  if (entries.length === 0) {
-    return [];
-  }
-  return entries.reduce((acc, entry) => {
+  return Object.entries(obj).reduce((acc, entry) => {
     acc.push(toItem(entry[0], entry[1]));
     return acc;
   }, []);
@@ -1131,9 +1026,6 @@ function lowerize(obj) {
 
 // src/object/mapEntries.ts
 function mapEntries(obj, toEntry) {
-  if (!obj) {
-    return {};
-  }
   return Object.entries(obj).reduce(
     (acc, [key, value]) => {
       const [newKey, newValue] = toEntry(key, value);
@@ -1169,10 +1061,7 @@ function mapValues(obj, mapFunc) {
 
 // src/object/omit.ts
 function omit(obj, keys2) {
-  if (!obj) {
-    return {};
-  }
-  if (!keys2 || keys2.length === 0) {
+  if (keys2.length === 0) {
     return obj;
   }
   return keys2.reduce(
@@ -1186,9 +1075,6 @@ function omit(obj, keys2) {
 
 // src/object/pick.ts
 function pick(obj, filter) {
-  if (!obj) {
-    return {};
-  }
   let keys2 = filter;
   if (isArray(filter)) {
     filter = null;
@@ -1205,28 +1091,20 @@ function pick(obj, filter) {
 
 // src/object/set.ts
 function set(initial, path, value) {
-  if (!initial) {
-    return {};
-  }
-  if (!path || value === void 0) {
+  if (value === void 0) {
     return initial;
   }
   const root = clone(initial);
   const keys2 = path.match(/[^.[\]]+/g);
-  if (keys2) {
-    keys2.reduce(
-      (object, key, i) => i < keys2.length - 1 ? object[key] ??= isIntString(keys2[i + 1]) ? [] : {} : object[key] = value,
-      root
-    );
-  }
+  keys2 == null ? void 0 : keys2.reduce(
+    (object, key, i) => i < keys2.length - 1 ? object[key] ??= isIntString(keys2[i + 1]) ? [] : {} : object[key] = value,
+    root
+  );
   return root;
 }
 
 // src/object/shake.ts
 function shake(obj, filter = (value) => value === void 0) {
-  if (!obj) {
-    return {};
-  }
   return Object.keys(obj).reduce((acc, key) => {
     if (!filter(obj[key])) {
       acc[key] = obj[key];
@@ -1433,14 +1311,7 @@ var series = (items, toKey = (item) => `${item}`) => {
 
 // src/string/camel.ts
 function camel(str) {
-  var _a;
-  const parts = ((_a = str == null ? void 0 : str.replace(/([A-Z])+/g, capitalize)) == null ? void 0 : _a.split(/(?=[A-Z])|[\.\-\s_]/).map((x) => x.toLowerCase())) ?? [];
-  if (parts.length === 0) {
-    return "";
-  }
-  if (parts.length === 1) {
-    return parts[0];
-  }
+  const parts = str.replace(/([A-Z])+/g, capitalize).split(/(?=[A-Z])|[\.\-\s_]/).map((x) => x.toLowerCase());
   return parts.reduce((acc, part) => {
     return `${acc}${part.charAt(0).toUpperCase()}${part.slice(1)}`;
   });
@@ -1448,23 +1319,13 @@ function camel(str) {
 
 // src/string/capitalize.ts
 function capitalize(str) {
-  if (!str || str.length === 0) {
-    return "";
-  }
   const lower = str.toLowerCase();
   return lower.substring(0, 1).toUpperCase() + lower.substring(1, lower.length);
 }
 
 // src/string/dash.ts
 function dash(str) {
-  var _a;
-  const parts = ((_a = str == null ? void 0 : str.replace(/([A-Z])+/g, capitalize)) == null ? void 0 : _a.split(/(?=[A-Z])|[\.\-\s_]/).map((x) => x.toLowerCase())) ?? [];
-  if (parts.length === 0) {
-    return "";
-  }
-  if (parts.length === 1) {
-    return parts[0];
-  }
+  const parts = str.replace(/([A-Z])+/g, capitalize).split(/(?=[A-Z])|[\.\-\s_]/).map((x) => x.toLowerCase());
   return parts.reduce((acc, part) => {
     return `${acc}-${part.toLowerCase()}`;
   });
@@ -1496,9 +1357,6 @@ function dedent(text, ...values) {
 
 // src/string/pascal.ts
 function pascal(str) {
-  if (!str) {
-    return "";
-  }
   const result = str.replace(
     /(?:[^\w\d]|_|\s)+(\w)([A-Z]+)?/g,
     (_, firstCharacter, capitalizedLetters) => {
@@ -1561,13 +1419,7 @@ function similarity(str1, str2) {
 
 // src/string/snake.ts
 function snake(str, options) {
-  const parts = (str == null ? void 0 : str.replace(/([A-Z])+/g, capitalize).split(/(?=[A-Z])|[\.\-\s_]/).map((x) => x.toLowerCase())) ?? [];
-  if (parts.length === 0) {
-    return "";
-  }
-  if (parts.length === 1) {
-    return parts[0];
-  }
+  const parts = str.replace(/([A-Z])+/g, capitalize).split(/(?=[A-Z])|[\.\-\s_]/).map((x) => x.toLowerCase());
   const result = parts.reduce((acc, part) => {
     return `${acc}_${part.toLowerCase()}`;
   });
@@ -1588,17 +1440,11 @@ function template(str, data, regex = /\{\{(.+?)\}\}/g) {
 
 // src/string/title.ts
 function title(str) {
-  if (!str) {
-    return "";
-  }
   return str.split(/(?=[A-Z])|[\.\-\s_]/).map((s) => s.trim()).filter((s) => !!s).map((s) => capitalize(s.toLowerCase())).join(" ");
 }
 
 // src/string/trim.ts
-function trim(str, charsToTrim = " ") {
-  if (!str) {
-    return "";
-  }
+function trim(str, charsToTrim) {
   const toTrim = charsToTrim.replace(/[\W]{1}/g, "\\$&");
   const regex = new RegExp(`^[${toTrim}]+|[${toTrim}]+$`, "g");
   return str.replace(regex, "");
@@ -1693,7 +1539,7 @@ function isError(value) {
 
 // src/typed/isFloat.ts
 function isFloat(value) {
-  return isNumber(value) && value % 1 !== 0;
+  return isNumber(value) && !Number.isNaN(value) && value % 1 !== 0;
 }
 
 // src/typed/isFunction.ts
@@ -1730,7 +1576,7 @@ function isNullish(value) {
 
 // src/typed/isNumber.ts
 function isNumber(value) {
-  return typeof value === "number" && !Number.isNaN(value);
+  return typeof value === "number";
 }
 
 // src/typed/isObject.ts

package/dist/radashi.d.cts

@@ -108,11 +108,14 @@ type CastArrayIfExists<T> = [T] extends [never] ? never[] : [unknown] extends [T
  * ```
  * @version 12.1.0
  */
-declare function cluster<T>(array: readonly T[], size?: number): T[][];
+declare function cluster<T>(array: readonly T[], size: number): T[][];
 
 /**
- * Counts the occurrences of each unique value returned by the `identity`
- * function when applied to each item in the array.
+ * Counts the occurrences of each unique value returned by the
+ * `identity` function when applied to each item in the array.
+ *
+ * If no occurrences are found, the key will not be present in the
+ * returned object.
  *
  * @see https://radashi.js.org/reference/array/counting
  * @example
@@ -122,7 +125,7 @@ declare function cluster<T>(array: readonly T[], size?: number): T[][];
  * ```
  * @version 12.1.0
  */
-declare function counting<T, TId extends string | number | symbol>(array: readonly T[], identity: (item: T) => TId): Record<TId, number>;
+declare function counting<T, TId extends string | number | symbol>(array: readonly T[], identity: (item: T) => TId): Partial<Record<TId, number>>;
 
 /**
  * Returns all items from the first list that do not exist in the
@@ -357,6 +360,7 @@ declare function objectify<T, Key extends string | number | symbol, Value = T>(a
  */
 declare function remove<T>(array: readonly T[], predicate: (value: T) => boolean): T[];
 
+type Defined$1<T> = T & ({} | null);
 /**
  * Replace an element in an array with a new item without modifying
  * the array and return the new value.
@@ -369,8 +373,9 @@ declare function remove<T>(array: readonly T[], predicate: (value: T) => boolean
  * ```
  * @version 12.1.0
  */
-declare function replace<T>(array: readonly T[], newItem: T, match: (item: T, idx: number) => boolean): T[];
+declare function replace<T, U>(array: readonly T[], newItem: U, match: (item: T, idx: number) => boolean): (T | Defined$1<U>)[];
 
+type Defined<T> = T & ({} | null);
 /**
  * Replace the first occurrence of an item in an array where the
  * `match` function returns true. If no items match, append the new
@@ -387,7 +392,7 @@ declare function replace<T>(array: readonly T[], newItem: T, match: (item: T, id
  * ```
  * @version 12.1.0
  */
-declare function replaceOrAppend<T>(array: readonly T[], newItem: T, match: (a: T, idx: number) => boolean): T[];
+declare function replaceOrAppend<T, U>(array: readonly T[], newItem: U, match: (a: T, idx: number) => boolean): (T | Defined<U>)[];
 
 /**
  * Select performs a filter and a mapper inside of a reduce, only
@@ -1717,7 +1722,7 @@ declare function compose<F1Result, F1Args extends any[], F1NextArgs extends any[
 declare function compose<F1Result, F1Args extends any[], F1NextArgs extends any[], F2NextArgs extends any[], F2Result, F3NextArgs extends any[], F3Result, F4NextArgs extends any[], F4Result, F5NextArgs extends any[], F5Result, F6NextArgs extends any[], F6Result, F7NextArgs extends any[], F7Result, F8NextArgs extends any[], F8Result, LastResult>(f1: (next: (...args: F1NextArgs) => F2Result) => (...args: F1Args) => F1Result, f2: (next: (...args: F2NextArgs) => F3Result) => (...args: F1NextArgs) => F2Result, f3: (next: (...args: F3NextArgs) => F4Result) => (...args: F2NextArgs) => F3Result, f4: (next: (...args: F4NextArgs) => F5Result) => (...args: F3NextArgs) => F4Result, f5: (next: (...args: F5NextArgs) => F6Result) => (...args: F4NextArgs) => F5Result, f6: (next: (...args: F6NextArgs) => F7Result) => (...args: F5NextArgs) => F6Result, f7: (next: (...args: F7NextArgs) => LastResult) => (...args: F6NextArgs) => F7Result, f8: (next: (...args: F8NextArgs) => LastResult) => (...args: F7NextArgs) => F8Result, last: (...args: F8NextArgs) => LastResult): (...args: F1Args) => F1Result;
 declare function compose<F1Result, F1Args extends any[], F1NextArgs extends any[], F2NextArgs extends any[], F2Result, F3NextArgs extends any[], F3Result, F4NextArgs extends any[], F4Result, F5NextArgs extends any[], F5Result, F6NextArgs extends any[], F6Result, F7NextArgs extends any[], F7Result, F8NextArgs extends any[], F8Result, F9NextArgs extends any[], F9Result, LastResult>(f1: (next: (...args: F1NextArgs) => F2Result) => (...args: F1Args) => F1Result, f2: (next: (...args: F2NextArgs) => F3Result) => (...args: F1NextArgs) => F2Result, f3: (next: (...args: F3NextArgs) => F4Result) => (...args: F2NextArgs) => F3Result, f4: (next: (...args: F4NextArgs) => F5Result) => (...args: F3NextArgs) => F4Result, f5: (next: (...args: F5NextArgs) => F6Result) => (...args: F4NextArgs) => F5Result, f6: (next: (...args: F6NextArgs) => F7Result) => (...args: F5NextArgs) => F6Result, f7: (next: (...args: F7NextArgs) => LastResult) => (...args: F6NextArgs) => F7Result, f8: (next: (...args: F8NextArgs) => LastResult) => (...args: F7NextArgs) => F8Result, f9: (next: (...args: F9NextArgs) => LastResult) => (...args: F8NextArgs) => F9Result, last: (...args: F9NextArgs) => LastResult): (...args: F1Args) => F1Result;
 
-type DebounceFunction<TArgs extends any[]> = {
+interface DebounceFunction<TArgs extends any[] = any> {
     (...args: TArgs): void;
     /**
      * When called, future invocations of the debounced function are
@@ -1725,15 +1730,15 @@ type DebounceFunction<TArgs extends any[]> = {
      */
     cancel(): void;
     /**
-     * Returns `true` if the underlying function is scheduled to be
-     * called once the delay has passed.
+     * If a debounced call is scheduled, this invokes it immediately.
+     * Otherwise, this equals Radashi's `noop` function.
      */
-    isPending(): boolean;
+    flush(): void;
     /**
-     * Invoke the underlying function immediately.
+     * The underlying function
      */
-    flush(...args: TArgs): void;
-};
+    readonly callee: (...args: TArgs) => unknown;
+}
 interface DebounceOptions {
     delay: number;
     /**
@@ -1746,11 +1751,11 @@ interface DebounceOptions {
     leading?: boolean;
 }
 /**
- * Returns a new function that will only call your callback after
- * `delay` milliseconds have passed without any invocations.
+ * Returns a new function that will only call the source function
+ * after `delay` milliseconds have passed without any invocations.
  *
- * The debounced function has a few methods, such as `cancel`,
- * `isPending`, and `flush`.
+ * See the documentation (or the `DebounceFunction` type) for details
+ * on the methods and properties available on the returned function.
  *
  * @see https://radashi.js.org/reference/curry/debounce
  * @example
@@ -1765,7 +1770,7 @@ interface DebounceOptions {
  * ```
  * @version 12.1.0
  */
-declare function debounce<TArgs extends any[]>({ delay, leading }: DebounceOptions, func: (...args: TArgs) => any): DebounceFunction<TArgs>;
+declare function debounce<TArgs extends any[]>({ delay, leading }: DebounceOptions, callee: (...args: TArgs) => unknown): DebounceFunction<TArgs>;
 
 /**
  * Flip the first two arguments of a function.
@@ -2436,7 +2441,7 @@ TOverride | (IsOptional extends true ? TInitial : never) : Extract<TOverride, ob
  * ```
  * @version 12.1.0
  */
-declare function clone<T>(obj: T): T;
+declare function clone<T extends object>(obj: T): T;
 
 /**
  * A strategy for cloning objects with `cloneDeep`.
@@ -3158,7 +3163,7 @@ declare function template(str: string, data: Record<string, any>, regex?: RegExp
  * ```
  * @version 12.1.0
  */
-declare function title(str: string | null | undefined): string;
+declare function title(str: string): string;
 
 /**
  * Trims all prefix and suffix characters from the given string. Like
@@ -3175,7 +3180,7 @@ declare function title(str: string | null | undefined): string;
  * ```
  * @version 12.1.0
  */
-declare function trim(str: string | null | undefined, charsToTrim?: string): string;
+declare function trim(str: string, charsToTrim: string): string;
 
 /**
  * Literally just `Array.isArray` but with better type inference.
@@ -3455,7 +3460,7 @@ declare function isNullish(value: unknown): value is null | undefined;
  * ```ts
  * isNumber(0) // => true
  * isNumber('0') // => false
- * isNumber(NaN) // => false
+ * isNumber(NaN) // => true
  * ```
  * @version 12.1.0
  */

package/dist/radashi.d.ts

@@ -108,11 +108,14 @@ type CastArrayIfExists<T> = [T] extends [never] ? never[] : [unknown] extends [T
  * ```
  * @version 12.1.0
  */
-declare function cluster<T>(array: readonly T[], size?: number): T[][];
+declare function cluster<T>(array: readonly T[], size: number): T[][];
 
 /**
- * Counts the occurrences of each unique value returned by the `identity`
- * function when applied to each item in the array.
+ * Counts the occurrences of each unique value returned by the
+ * `identity` function when applied to each item in the array.
+ *
+ * If no occurrences are found, the key will not be present in the
+ * returned object.
  *
  * @see https://radashi.js.org/reference/array/counting
  * @example
@@ -122,7 +125,7 @@ declare function cluster<T>(array: readonly T[], size?: number): T[][];
  * ```
  * @version 12.1.0
  */
-declare function counting<T, TId extends string | number | symbol>(array: readonly T[], identity: (item: T) => TId): Record<TId, number>;
+declare function counting<T, TId extends string | number | symbol>(array: readonly T[], identity: (item: T) => TId): Partial<Record<TId, number>>;
 
 /**
  * Returns all items from the first list that do not exist in the
@@ -357,6 +360,7 @@ declare function objectify<T, Key extends string | number | symbol, Value = T>(a
  */
 declare function remove<T>(array: readonly T[], predicate: (value: T) => boolean): T[];
 
+type Defined$1<T> = T & ({} | null);
 /**
  * Replace an element in an array with a new item without modifying
  * the array and return the new value.
@@ -369,8 +373,9 @@ declare function remove<T>(array: readonly T[], predicate: (value: T) => boolean
  * ```
  * @version 12.1.0
  */
-declare function replace<T>(array: readonly T[], newItem: T, match: (item: T, idx: number) => boolean): T[];
+declare function replace<T, U>(array: readonly T[], newItem: U, match: (item: T, idx: number) => boolean): (T | Defined$1<U>)[];
 
+type Defined<T> = T & ({} | null);
 /**
  * Replace the first occurrence of an item in an array where the
  * `match` function returns true. If no items match, append the new
@@ -387,7 +392,7 @@ declare function replace<T>(array: readonly T[], newItem: T, match: (item: T, id
  * ```
  * @version 12.1.0
  */
-declare function replaceOrAppend<T>(array: readonly T[], newItem: T, match: (a: T, idx: number) => boolean): T[];
+declare function replaceOrAppend<T, U>(array: readonly T[], newItem: U, match: (a: T, idx: number) => boolean): (T | Defined<U>)[];
 
 /**
  * Select performs a filter and a mapper inside of a reduce, only
@@ -1717,7 +1722,7 @@ declare function compose<F1Result, F1Args extends any[], F1NextArgs extends any[
 declare function compose<F1Result, F1Args extends any[], F1NextArgs extends any[], F2NextArgs extends any[], F2Result, F3NextArgs extends any[], F3Result, F4NextArgs extends any[], F4Result, F5NextArgs extends any[], F5Result, F6NextArgs extends any[], F6Result, F7NextArgs extends any[], F7Result, F8NextArgs extends any[], F8Result, LastResult>(f1: (next: (...args: F1NextArgs) => F2Result) => (...args: F1Args) => F1Result, f2: (next: (...args: F2NextArgs) => F3Result) => (...args: F1NextArgs) => F2Result, f3: (next: (...args: F3NextArgs) => F4Result) => (...args: F2NextArgs) => F3Result, f4: (next: (...args: F4NextArgs) => F5Result) => (...args: F3NextArgs) => F4Result, f5: (next: (...args: F5NextArgs) => F6Result) => (...args: F4NextArgs) => F5Result, f6: (next: (...args: F6NextArgs) => F7Result) => (...args: F5NextArgs) => F6Result, f7: (next: (...args: F7NextArgs) => LastResult) => (...args: F6NextArgs) => F7Result, f8: (next: (...args: F8NextArgs) => LastResult) => (...args: F7NextArgs) => F8Result, last: (...args: F8NextArgs) => LastResult): (...args: F1Args) => F1Result;
 declare function compose<F1Result, F1Args extends any[], F1NextArgs extends any[], F2NextArgs extends any[], F2Result, F3NextArgs extends any[], F3Result, F4NextArgs extends any[], F4Result, F5NextArgs extends any[], F5Result, F6NextArgs extends any[], F6Result, F7NextArgs extends any[], F7Result, F8NextArgs extends any[], F8Result, F9NextArgs extends any[], F9Result, LastResult>(f1: (next: (...args: F1NextArgs) => F2Result) => (...args: F1Args) => F1Result, f2: (next: (...args: F2NextArgs) => F3Result) => (...args: F1NextArgs) => F2Result, f3: (next: (...args: F3NextArgs) => F4Result) => (...args: F2NextArgs) => F3Result, f4: (next: (...args: F4NextArgs) => F5Result) => (...args: F3NextArgs) => F4Result, f5: (next: (...args: F5NextArgs) => F6Result) => (...args: F4NextArgs) => F5Result, f6: (next: (...args: F6NextArgs) => F7Result) => (...args: F5NextArgs) => F6Result, f7: (next: (...args: F7NextArgs) => LastResult) => (...args: F6NextArgs) => F7Result, f8: (next: (...args: F8NextArgs) => LastResult) => (...args: F7NextArgs) => F8Result, f9: (next: (...args: F9NextArgs) => LastResult) => (...args: F8NextArgs) => F9Result, last: (...args: F9NextArgs) => LastResult): (...args: F1Args) => F1Result;
 
-type DebounceFunction<TArgs extends any[]> = {
+interface DebounceFunction<TArgs extends any[] = any> {
     (...args: TArgs): void;
     /**
      * When called, future invocations of the debounced function are
@@ -1725,15 +1730,15 @@ type DebounceFunction<TArgs extends any[]> = {
      */
     cancel(): void;
     /**
-     * Returns `true` if the underlying function is scheduled to be
-     * called once the delay has passed.
+     * If a debounced call is scheduled, this invokes it immediately.
+     * Otherwise, this equals Radashi's `noop` function.
      */
-    isPending(): boolean;
+    flush(): void;
     /**
-     * Invoke the underlying function immediately.
+     * The underlying function
      */
-    flush(...args: TArgs): void;
-};
+    readonly callee: (...args: TArgs) => unknown;
+}
 interface DebounceOptions {
     delay: number;
     /**
@@ -1746,11 +1751,11 @@ interface DebounceOptions {
     leading?: boolean;
 }
 /**
- * Returns a new function that will only call your callback after
- * `delay` milliseconds have passed without any invocations.
+ * Returns a new function that will only call the source function
+ * after `delay` milliseconds have passed without any invocations.
  *
- * The debounced function has a few methods, such as `cancel`,
- * `isPending`, and `flush`.
+ * See the documentation (or the `DebounceFunction` type) for details
+ * on the methods and properties available on the returned function.
  *
  * @see https://radashi.js.org/reference/curry/debounce
  * @example
@@ -1765,7 +1770,7 @@ interface DebounceOptions {
  * ```
  * @version 12.1.0
  */
-declare function debounce<TArgs extends any[]>({ delay, leading }: DebounceOptions, func: (...args: TArgs) => any): DebounceFunction<TArgs>;
+declare function debounce<TArgs extends any[]>({ delay, leading }: DebounceOptions, callee: (...args: TArgs) => unknown): DebounceFunction<TArgs>;
 
 /**
  * Flip the first two arguments of a function.
@@ -2436,7 +2441,7 @@ TOverride | (IsOptional extends true ? TInitial : never) : Extract<TOverride, ob
  * ```
  * @version 12.1.0
  */
-declare function clone<T>(obj: T): T;
+declare function clone<T extends object>(obj: T): T;
 
 /**
  * A strategy for cloning objects with `cloneDeep`.
@@ -3158,7 +3163,7 @@ declare function template(str: string, data: Record<string, any>, regex?: RegExp
  * ```
  * @version 12.1.0
  */
-declare function title(str: string | null | undefined): string;
+declare function title(str: string): string;
 
 /**
  * Trims all prefix and suffix characters from the given string. Like
@@ -3175,7 +3180,7 @@ declare function title(str: string | null | undefined): string;
  * ```
  * @version 12.1.0
  */
-declare function trim(str: string | null | undefined, charsToTrim?: string): string;
+declare function trim(str: string, charsToTrim: string): string;
 
 /**
  * Literally just `Array.isArray` but with better type inference.
@@ -3455,7 +3460,7 @@ declare function isNullish(value: unknown): value is null | undefined;
  * ```ts
  * isNumber(0) // => true
  * isNumber('0') // => false
- * isNumber(NaN) // => false
+ * isNumber(NaN) // => true
  * ```
  * @version 12.1.0
  */

package/dist/radashi.js

@@ -1,8 +1,5 @@
 // src/array/alphabetical.ts
 function alphabetical(array, getter, direction = "asc") {
-  if (!array) {
-    return [];
-  }
   const asc = (a, b) => `${getter(a)}`.localeCompare(getter(b));
   const dsc = (a, b) => `${getter(b)}`.localeCompare(getter(a));
   return array.slice().sort(direction === "desc" ? dsc : asc);
@@ -10,10 +7,7 @@ function alphabetical(array, getter, direction = "asc") {
 
 // src/array/boil.ts
 function boil(array, compareFunc) {
-  if (!array || (array.length ?? 0) === 0) {
-    return null;
-  }
-  return array.reduce(compareFunc);
+  return array.length ? array.reduce(compareFunc) : null;
 }
 
 // src/array/cartesianProduct.ts
@@ -44,7 +38,7 @@ function castArrayIfExists(value) {
 }
 
 // src/array/cluster.ts
-function cluster(array, size = 2) {
+function cluster(array, size) {
   const clusters = [];
   for (let i = 0; i < array.length; i += size) {
     clusters.push(array.slice(i, i + size));
@@ -54,9 +48,6 @@ function cluster(array, size = 2) {
 
 // src/array/counting.ts
 function counting(array, identity) {
-  if (!array) {
-    return {};
-  }
   return array.reduce(
     (acc, item) => {
       const id = identity(item);
@@ -69,15 +60,6 @@ function counting(array, identity) {
 
 // src/array/diff.ts
 function diff(root, other, identity = (t) => t) {
-  if (!(root == null ? void 0 : root.length) && !(other == null ? void 0 : other.length)) {
-    return [];
-  }
-  if ((root == null ? void 0 : root.length) === void 0) {
-    return [...other];
-  }
-  if (!(other == null ? void 0 : other.length)) {
-    return [...root];
-  }
   const bKeys = other.reduce(
     (acc, item) => {
       acc[identity(item)] = true;
@@ -90,7 +72,7 @@ function diff(root, other, identity = (t) => t) {
 
 // src/array/first.ts
 function first(array, defaultValue) {
-  return (array == null ? void 0 : array.length) > 0 ? array[0] : defaultValue;
+  return array.length > 0 ? array[0] : defaultValue;
 }
 
 // src/array/flat.ts
@@ -104,10 +86,8 @@ function flat(lists) {
 // src/array/fork.ts
 function fork(array, condition) {
   const forked = [[], []];
-  if (array) {
-    for (const item of array) {
-      forked[condition(item) ? 0 : 1].push(item);
-    }
+  for (const item of array) {
+    forked[condition(item) ? 0 : 1].push(item);
   }
   return forked;
 }
@@ -129,9 +109,6 @@ function group(array, getGroupId) {
 
 // src/array/intersects.ts
 function intersects(listA, listB, identity) {
-  if (!listA || !listB) {
-    return false;
-  }
   if (identity) {
     const known = new Set(listA.map(identity));
     return listB.some((item) => known.has(identity(item)));
@@ -150,7 +127,7 @@ function iterate(count, func, initValue) {
 
 // src/array/last.ts
 function last(array, defaultValue) {
-  return (array == null ? void 0 : array.length) > 0 ? array[array.length - 1] : defaultValue;
+  return array.length > 0 ? array[array.length - 1] : defaultValue;
 }
 
 // src/array/list.ts
@@ -169,18 +146,6 @@ function mapify(array, getKey, getValue = (item) => item) {
 
 // src/array/merge.ts
 function merge(prev, array, toKey) {
-  if (!array && !prev) {
-    return [];
-  }
-  if (!array) {
-    return [...prev];
-  }
-  if (!prev) {
-    return [];
-  }
-  if (!toKey) {
-    return [...prev];
-  }
   const keys2 = /* @__PURE__ */ new Map();
   for (const item of array) {
     keys2.set(toKey(item), item);
@@ -209,9 +174,6 @@ function remove(array, predicate) {
 
 // src/array/replace.ts
 function replace(array, newItem, match) {
-  if (!array) {
-    return [];
-  }
   if (newItem === void 0) {
     return [...array];
   }
@@ -227,15 +189,9 @@ function replace(array, newItem, match) {
 
 // src/array/replaceOrAppend.ts
 function replaceOrAppend(array, newItem, match) {
-  if (!array && !newItem) {
-    return [];
-  }
-  if (!newItem) {
+  if (newItem === void 0) {
     return [...array];
   }
-  if (!array) {
-    return [newItem];
-  }
   const out = array.slice();
   for (let index = 0; index < array.length; index++) {
     if (match(array[index], index)) {
@@ -249,9 +205,6 @@ function replaceOrAppend(array, newItem, match) {
 
 // src/array/select.ts
 function select(array, mapper, condition) {
-  if (!array) {
-    return [];
-  }
   let mapped;
   return array.reduce((acc, item, index) => {
     if (condition) {
@@ -265,9 +218,6 @@ function select(array, mapper, condition) {
 
 // src/array/selectFirst.ts
 function selectFirst(array, mapper, condition) {
-  if (!array) {
-    return void 0;
-  }
   let foundIndex = -1;
   const found = array.find((item, index) => {
     foundIndex = index;
@@ -295,9 +245,6 @@ function sift(array) {
 
 // src/array/sort.ts
 function sort(array, getter, desc = false) {
-  if (!array) {
-    return [];
-  }
   const asc = (a, b) => getter(a) - getter(b);
   const dsc = (a, b) => getter(b) - getter(a);
   return array.slice().sort(desc === true ? dsc : asc);
@@ -305,9 +252,6 @@ function sort(array, getter, desc = false) {
 
 // src/array/toggle.ts
 function toggle(array, item, toKey, options) {
-  if (!array) {
-    return item !== void 0 ? [item] : [];
-  }
   if (item === void 0) {
     return [...array];
   }
@@ -343,9 +287,6 @@ function unique(array, toKey) {
 
 // src/array/unzip.ts
 function unzip(arrays) {
-  if (!arrays || !arrays.length) {
-    return [];
-  }
   const out = new Array(
     arrays.reduce((max2, arr) => Math.max(max2, arr.length), 0)
   );
@@ -364,9 +305,6 @@ function zip(...arrays) {
 
 // src/array/zipToObject.ts
 function zipToObject(keys2, values) {
-  if (!keys2 || !keys2.length) {
-    return {};
-  }
   const getValue = isFunction(values) ? values : isArray(values) ? (_k, i) => values[i] : (_k, _i) => values;
   return keys2.reduce(
     (acc, key, idx) => {
@@ -453,9 +391,6 @@ function guard(func, shouldGuard) {
 
 // src/async/map.ts
 async function map(array, asyncMapFunc) {
-  if (!array) {
-    return [];
-  }
   const result = [];
   let index = 0;
   for (const value of array) {
@@ -525,9 +460,6 @@ async function parallel(options, array, func) {
 
 // src/async/reduce.ts
 async function reduce(array, reducer, initialValue) {
-  if (!array) {
-    array = [];
-  }
   let index = 0;
   let acc = initialValue;
   if (acc === void 0 && arguments.length < 3) {
@@ -659,31 +591,30 @@ function compose(...funcs) {
 }
 
 // src/curry/debounce.ts
-function debounce({ delay, leading }, func) {
-  let timer = void 0;
-  let active = true;
+function debounce({ delay, leading }, callee) {
+  let timeout2;
   const debounced = (...args) => {
-    if (active) {
-      clearTimeout(timer);
-      timer = setTimeout(() => {
-        active && func(...args);
-        timer = void 0;
-      }, delay);
-      if (leading) {
-        func(...args);
-        leading = false;
-      }
+    clearTimeout(timeout2);
+    if (leading) {
+      leading = false;
+      callee(...args);
     } else {
-      func(...args);
+      timeout2 = setTimeout(
+        debounced.flush = () => {
+          debounced.flush = noop;
+          clearTimeout(timeout2);
+          callee(...args);
+        },
+        delay
+      );
     }
   };
-  debounced.isPending = () => {
-    return timer !== void 0;
-  };
+  debounced.callee = callee;
+  debounced.flush = noop;
   debounced.cancel = () => {
-    active = false;
+    debounced.flush = noop;
+    clearTimeout(timeout2);
   };
-  debounced.flush = (...args) => func(...args);
   return debounced;
 }
 
@@ -837,15 +768,7 @@ function clamp(n, min2, max2) {
 }
 
 // src/number/inRange.ts
-function inRange(number, start, end) {
-  const isTypeSafe = typeof number === "number" && typeof start === "number" && (typeof end === "undefined" || typeof end === "number");
-  if (!isTypeSafe) {
-    return false;
-  }
-  if (typeof end === "undefined") {
-    end = start;
-    start = 0;
-  }
+function inRange(number, start, end = 0) {
   return number >= Math.min(start, end) && number < Math.max(start, end);
 }
 
@@ -856,7 +779,7 @@ function lerp(from, to, amount) {
 
 // src/number/max.ts
 function max(array, getter) {
-  if (!array || (array.length ?? 0) === 0) {
+  if (!array.length) {
     return null;
   }
   const get2 = getter ?? ((v) => v);
@@ -865,7 +788,7 @@ function max(array, getter) {
 
 // src/number/min.ts
 function min(array, getter) {
-  if (!array || (array.length ?? 0) === 0) {
+  if (!array.length) {
     return null;
   }
   const get2 = getter ?? ((v) => v);
@@ -915,9 +838,6 @@ function toInt(value, defaultValue) {
 
 // src/object/assign.ts
 function assign(initial, override) {
-  if (!initial || !override) {
-    return initial ?? override ?? {};
-  }
   const proto = Object.getPrototypeOf(initial);
   const merged = proto ? { ...initial } : Object.assign(Object.create(proto), initial);
   for (const key of Object.keys(override)) {
@@ -928,12 +848,6 @@ function assign(initial, override) {
 
 // src/object/clone.ts
 function clone(obj) {
-  if (isPrimitive(obj)) {
-    return obj;
-  }
-  if (typeof obj === "function") {
-    return obj.bind({});
-  }
   const proto = Object.getPrototypeOf(obj);
   const newObj = typeof (proto == null ? void 0 : proto.constructor) === "function" ? new proto.constructor() : Object.create(proto);
   for (const key of Object.getOwnPropertyNames(obj)) {
@@ -1011,9 +925,6 @@ function cloneDeep(root, customStrategy) {
 
 // src/object/construct.ts
 function construct(obj) {
-  if (!obj) {
-    return {};
-  }
   return Object.keys(obj).reduce((acc, path) => {
     return set(acc, path, obj[path]);
   }, {});
@@ -1021,9 +932,6 @@ function construct(obj) {
 
 // src/object/crush.ts
 function crush(value) {
-  if (!value) {
-    return {};
-  }
   return function crushReducer(crushed, value2, path) {
     if (isObject(value2) || isArray(value2)) {
       for (const [prop, propValue] of Object.entries(value2)) {
@@ -1066,9 +974,6 @@ function get(value, path, defaultValue) {
 
 // src/object/invert.ts
 function invert(obj) {
-  if (!obj) {
-    return {};
-  }
   const keys2 = Object.keys(obj);
   return keys2.reduce(
     (acc, key) => {
@@ -1081,9 +986,6 @@ function invert(obj) {
 
 // src/object/keys.ts
 function keys(value) {
-  if (!value) {
-    return [];
-  }
   const keys2 = [];
   const keyPath = [];
   const recurse = (value2) => {
@@ -1109,14 +1011,7 @@ function keys(value) {
 
 // src/object/listify.ts
 function listify(obj, toItem) {
-  if (!obj) {
-    return [];
-  }
-  const entries = Object.entries(obj);
-  if (entries.length === 0) {
-    return [];
-  }
-  return entries.reduce((acc, entry) => {
+  return Object.entries(obj).reduce((acc, entry) => {
     acc.push(toItem(entry[0], entry[1]));
     return acc;
   }, []);
@@ -1129,9 +1024,6 @@ function lowerize(obj) {
 
 // src/object/mapEntries.ts
 function mapEntries(obj, toEntry) {
-  if (!obj) {
-    return {};
-  }
   return Object.entries(obj).reduce(
     (acc, [key, value]) => {
       const [newKey, newValue] = toEntry(key, value);
@@ -1167,10 +1059,7 @@ function mapValues(obj, mapFunc) {
 
 // src/object/omit.ts
 function omit(obj, keys2) {
-  if (!obj) {
-    return {};
-  }
-  if (!keys2 || keys2.length === 0) {
+  if (keys2.length === 0) {
     return obj;
   }
   return keys2.reduce(
@@ -1184,9 +1073,6 @@ function omit(obj, keys2) {
 
 // src/object/pick.ts
 function pick(obj, filter) {
-  if (!obj) {
-    return {};
-  }
   let keys2 = filter;
   if (isArray(filter)) {
     filter = null;
@@ -1203,28 +1089,20 @@ function pick(obj, filter) {
 
 // src/object/set.ts
 function set(initial, path, value) {
-  if (!initial) {
-    return {};
-  }
-  if (!path || value === void 0) {
+  if (value === void 0) {
     return initial;
   }
   const root = clone(initial);
   const keys2 = path.match(/[^.[\]]+/g);
-  if (keys2) {
-    keys2.reduce(
-      (object, key, i) => i < keys2.length - 1 ? object[key] ??= isIntString(keys2[i + 1]) ? [] : {} : object[key] = value,
-      root
-    );
-  }
+  keys2 == null ? void 0 : keys2.reduce(
+    (object, key, i) => i < keys2.length - 1 ? object[key] ??= isIntString(keys2[i + 1]) ? [] : {} : object[key] = value,
+    root
+  );
   return root;
 }
 
 // src/object/shake.ts
 function shake(obj, filter = (value) => value === void 0) {
-  if (!obj) {
-    return {};
-  }
   return Object.keys(obj).reduce((acc, key) => {
     if (!filter(obj[key])) {
       acc[key] = obj[key];
@@ -1431,14 +1309,7 @@ var series = (items, toKey = (item) => `${item}`) => {
 
 // src/string/camel.ts
 function camel(str) {
-  var _a;
-  const parts = ((_a = str == null ? void 0 : str.replace(/([A-Z])+/g, capitalize)) == null ? void 0 : _a.split(/(?=[A-Z])|[\.\-\s_]/).map((x) => x.toLowerCase())) ?? [];
-  if (parts.length === 0) {
-    return "";
-  }
-  if (parts.length === 1) {
-    return parts[0];
-  }
+  const parts = str.replace(/([A-Z])+/g, capitalize).split(/(?=[A-Z])|[\.\-\s_]/).map((x) => x.toLowerCase());
   return parts.reduce((acc, part) => {
     return `${acc}${part.charAt(0).toUpperCase()}${part.slice(1)}`;
   });
@@ -1446,23 +1317,13 @@ function camel(str) {
 
 // src/string/capitalize.ts
 function capitalize(str) {
-  if (!str || str.length === 0) {
-    return "";
-  }
   const lower = str.toLowerCase();
   return lower.substring(0, 1).toUpperCase() + lower.substring(1, lower.length);
 }
 
 // src/string/dash.ts
 function dash(str) {
-  var _a;
-  const parts = ((_a = str == null ? void 0 : str.replace(/([A-Z])+/g, capitalize)) == null ? void 0 : _a.split(/(?=[A-Z])|[\.\-\s_]/).map((x) => x.toLowerCase())) ?? [];
-  if (parts.length === 0) {
-    return "";
-  }
-  if (parts.length === 1) {
-    return parts[0];
-  }
+  const parts = str.replace(/([A-Z])+/g, capitalize).split(/(?=[A-Z])|[\.\-\s_]/).map((x) => x.toLowerCase());
   return parts.reduce((acc, part) => {
     return `${acc}-${part.toLowerCase()}`;
   });
@@ -1494,9 +1355,6 @@ function dedent(text, ...values) {
 
 // src/string/pascal.ts
 function pascal(str) {
-  if (!str) {
-    return "";
-  }
   const result = str.replace(
     /(?:[^\w\d]|_|\s)+(\w)([A-Z]+)?/g,
     (_, firstCharacter, capitalizedLetters) => {
@@ -1559,13 +1417,7 @@ function similarity(str1, str2) {
 
 // src/string/snake.ts
 function snake(str, options) {
-  const parts = (str == null ? void 0 : str.replace(/([A-Z])+/g, capitalize).split(/(?=[A-Z])|[\.\-\s_]/).map((x) => x.toLowerCase())) ?? [];
-  if (parts.length === 0) {
-    return "";
-  }
-  if (parts.length === 1) {
-    return parts[0];
-  }
+  const parts = str.replace(/([A-Z])+/g, capitalize).split(/(?=[A-Z])|[\.\-\s_]/).map((x) => x.toLowerCase());
   const result = parts.reduce((acc, part) => {
     return `${acc}_${part.toLowerCase()}`;
   });
@@ -1586,17 +1438,11 @@ function template(str, data, regex = /\{\{(.+?)\}\}/g) {
 
 // src/string/title.ts
 function title(str) {
-  if (!str) {
-    return "";
-  }
   return str.split(/(?=[A-Z])|[\.\-\s_]/).map((s) => s.trim()).filter((s) => !!s).map((s) => capitalize(s.toLowerCase())).join(" ");
 }
 
 // src/string/trim.ts
-function trim(str, charsToTrim = " ") {
-  if (!str) {
-    return "";
-  }
+function trim(str, charsToTrim) {
   const toTrim = charsToTrim.replace(/[\W]{1}/g, "\\$&");
   const regex = new RegExp(`^[${toTrim}]+|[${toTrim}]+$`, "g");
   return str.replace(regex, "");
@@ -1691,7 +1537,7 @@ function isError(value) {
 
 // src/typed/isFloat.ts
 function isFloat(value) {
-  return isNumber(value) && value % 1 !== 0;
+  return isNumber(value) && !Number.isNaN(value) && value % 1 !== 0;
 }
 
 // src/typed/isFunction.ts
@@ -1728,7 +1574,7 @@ function isNullish(value) {
 
 // src/typed/isNumber.ts
 function isNumber(value) {
-  return typeof value === "number" && !Number.isNaN(value);
+  return typeof value === "number";
 }
 
 // src/typed/isObject.ts

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "radashi",
-  "version": "12.4.0",
+  "version": "13.0.0-beta.f4c6a24",
   "type": "module",
   "description": "The modern, community-first TypeScript toolkit with all of the fast, readable, and minimal utility functions you need. Type-safe, dependency-free, tree-shakeable, fully tested.",
   "repository": {