@zag-js/utils 1.34.0 → 1.35.0

package/dist/array.d.mts

@@ -0,0 +1,27 @@
+declare function toArray<T>(v: T | T[] | undefined | null): T[];
+declare const fromLength: (length: number) => number[];
+declare const first: <T>(v: T[]) => T | undefined;
+declare const last: <T>(v: T[]) => T | undefined;
+declare const isEmpty: <T>(v: T[]) => boolean;
+declare const has: <T>(v: T[], t: T) => boolean;
+declare const add: <T>(v: T[], ...items: T[]) => T[];
+declare const remove: <T>(v: T[], ...items: T[]) => T[];
+declare const removeAt: <T>(v: T[], i: number) => T[];
+declare const insertAt: <T>(v: T[], i: number, ...items: T[]) => T[];
+declare const uniq: <T>(v: T[]) => T[];
+declare const diff: <T>(a: T[], b: T[]) => T[];
+declare const addOrRemove: <T>(v: T[], item: T) => T[];
+declare function clear<T>(v: T[]): T[];
+type IndexOptions = {
+    step?: number | undefined;
+    loop?: boolean | undefined;
+};
+declare function nextIndex<T>(v: T[], idx: number, opts?: IndexOptions): number;
+declare function next<T>(v: T[], idx: number, opts?: IndexOptions): T | undefined;
+declare function prevIndex<T>(v: T[], idx: number, opts?: IndexOptions): number;
+declare function prev<T>(v: T[], index: number, opts?: IndexOptions): T | undefined;
+declare function chunk<T>(v: T[], size: number): T[][];
+declare function flatArray<T>(arr: T[]): T[];
+declare function partition<T>(arr: T[], fn: (value: T) => boolean): [T[], T[]];
+
+export { type IndexOptions, add, addOrRemove, chunk, clear, diff, first, flatArray, fromLength, has, insertAt, isEmpty, last, next, nextIndex, partition, prev, prevIndex, remove, removeAt, toArray, uniq };

package/dist/array.d.ts

@@ -0,0 +1,27 @@
+declare function toArray<T>(v: T | T[] | undefined | null): T[];
+declare const fromLength: (length: number) => number[];
+declare const first: <T>(v: T[]) => T | undefined;
+declare const last: <T>(v: T[]) => T | undefined;
+declare const isEmpty: <T>(v: T[]) => boolean;
+declare const has: <T>(v: T[], t: T) => boolean;
+declare const add: <T>(v: T[], ...items: T[]) => T[];
+declare const remove: <T>(v: T[], ...items: T[]) => T[];
+declare const removeAt: <T>(v: T[], i: number) => T[];
+declare const insertAt: <T>(v: T[], i: number, ...items: T[]) => T[];
+declare const uniq: <T>(v: T[]) => T[];
+declare const diff: <T>(a: T[], b: T[]) => T[];
+declare const addOrRemove: <T>(v: T[], item: T) => T[];
+declare function clear<T>(v: T[]): T[];
+type IndexOptions = {
+    step?: number | undefined;
+    loop?: boolean | undefined;
+};
+declare function nextIndex<T>(v: T[], idx: number, opts?: IndexOptions): number;
+declare function next<T>(v: T[], idx: number, opts?: IndexOptions): T | undefined;
+declare function prevIndex<T>(v: T[], idx: number, opts?: IndexOptions): number;
+declare function prev<T>(v: T[], index: number, opts?: IndexOptions): T | undefined;
+declare function chunk<T>(v: T[], size: number): T[][];
+declare function flatArray<T>(arr: T[]): T[];
+declare function partition<T>(arr: T[], fn: (value: T) => boolean): [T[], T[]];
+
+export { type IndexOptions, add, addOrRemove, chunk, clear, diff, first, flatArray, fromLength, has, insertAt, isEmpty, last, next, nextIndex, partition, prev, prevIndex, remove, removeAt, toArray, uniq };

package/dist/array.js

@@ -0,0 +1,137 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/array.ts
+var array_exports = {};
+__export(array_exports, {
+  add: () => add,
+  addOrRemove: () => addOrRemove,
+  chunk: () => chunk,
+  clear: () => clear,
+  diff: () => diff,
+  first: () => first,
+  flatArray: () => flatArray,
+  fromLength: () => fromLength,
+  has: () => has,
+  insertAt: () => insertAt,
+  isEmpty: () => isEmpty,
+  last: () => last,
+  next: () => next,
+  nextIndex: () => nextIndex,
+  partition: () => partition,
+  prev: () => prev,
+  prevIndex: () => prevIndex,
+  remove: () => remove,
+  removeAt: () => removeAt,
+  toArray: () => toArray,
+  uniq: () => uniq
+});
+module.exports = __toCommonJS(array_exports);
+function toArray(v) {
+  if (v == null) return [];
+  return Array.isArray(v) ? v : [v];
+}
+var fromLength = (length) => Array.from(Array(length).keys());
+var first = (v) => v[0];
+var last = (v) => v[v.length - 1];
+var isEmpty = (v) => v.length === 0;
+var has = (v, t) => v.indexOf(t) !== -1;
+var add = (v, ...items) => v.concat(items);
+var remove = (v, ...items) => v.filter((t) => !items.includes(t));
+var removeAt = (v, i) => v.filter((_, idx) => idx !== i);
+var insertAt = (v, i, ...items) => [...v.slice(0, i), ...items, ...v.slice(i)];
+var uniq = (v) => Array.from(new Set(v));
+var diff = (a, b) => {
+  const set = new Set(b);
+  return a.filter((t) => !set.has(t));
+};
+var addOrRemove = (v, item) => has(v, item) ? remove(v, item) : add(v, item);
+function clear(v) {
+  while (v.length > 0) v.pop();
+  return v;
+}
+function nextIndex(v, idx, opts = {}) {
+  const { step = 1, loop = true } = opts;
+  const next2 = idx + step;
+  const len = v.length;
+  const last2 = len - 1;
+  if (idx === -1) return step > 0 ? 0 : last2;
+  if (next2 < 0) return loop ? last2 : 0;
+  if (next2 >= len) return loop ? 0 : idx > len ? len : idx;
+  return next2;
+}
+function next(v, idx, opts = {}) {
+  return v[nextIndex(v, idx, opts)];
+}
+function prevIndex(v, idx, opts = {}) {
+  const { step = 1, loop = true } = opts;
+  return nextIndex(v, idx, { step: -step, loop });
+}
+function prev(v, index, opts = {}) {
+  return v[prevIndex(v, index, opts)];
+}
+function chunk(v, size) {
+  return v.reduce((rows, value, index) => {
+    if (index % size === 0) rows.push([value]);
+    else last(rows)?.push(value);
+    return rows;
+  }, []);
+}
+function flatArray(arr) {
+  return arr.reduce((flat, item) => {
+    if (Array.isArray(item)) {
+      return flat.concat(flatArray(item));
+    }
+    return flat.concat(item);
+  }, []);
+}
+function partition(arr, fn) {
+  return arr.reduce(
+    ([pass, fail], value) => {
+      if (fn(value)) pass.push(value);
+      else fail.push(value);
+      return [pass, fail];
+    },
+    [[], []]
+  );
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  add,
+  addOrRemove,
+  chunk,
+  clear,
+  diff,
+  first,
+  flatArray,
+  fromLength,
+  has,
+  insertAt,
+  isEmpty,
+  last,
+  next,
+  nextIndex,
+  partition,
+  prev,
+  prevIndex,
+  remove,
+  removeAt,
+  toArray,
+  uniq
+});

package/dist/array.mjs

@@ -0,0 +1,94 @@
+import "./chunk-MXGZDBDQ.mjs";
+
+// src/array.ts
+function toArray(v) {
+  if (v == null) return [];
+  return Array.isArray(v) ? v : [v];
+}
+var fromLength = (length) => Array.from(Array(length).keys());
+var first = (v) => v[0];
+var last = (v) => v[v.length - 1];
+var isEmpty = (v) => v.length === 0;
+var has = (v, t) => v.indexOf(t) !== -1;
+var add = (v, ...items) => v.concat(items);
+var remove = (v, ...items) => v.filter((t) => !items.includes(t));
+var removeAt = (v, i) => v.filter((_, idx) => idx !== i);
+var insertAt = (v, i, ...items) => [...v.slice(0, i), ...items, ...v.slice(i)];
+var uniq = (v) => Array.from(new Set(v));
+var diff = (a, b) => {
+  const set = new Set(b);
+  return a.filter((t) => !set.has(t));
+};
+var addOrRemove = (v, item) => has(v, item) ? remove(v, item) : add(v, item);
+function clear(v) {
+  while (v.length > 0) v.pop();
+  return v;
+}
+function nextIndex(v, idx, opts = {}) {
+  const { step = 1, loop = true } = opts;
+  const next2 = idx + step;
+  const len = v.length;
+  const last2 = len - 1;
+  if (idx === -1) return step > 0 ? 0 : last2;
+  if (next2 < 0) return loop ? last2 : 0;
+  if (next2 >= len) return loop ? 0 : idx > len ? len : idx;
+  return next2;
+}
+function next(v, idx, opts = {}) {
+  return v[nextIndex(v, idx, opts)];
+}
+function prevIndex(v, idx, opts = {}) {
+  const { step = 1, loop = true } = opts;
+  return nextIndex(v, idx, { step: -step, loop });
+}
+function prev(v, index, opts = {}) {
+  return v[prevIndex(v, index, opts)];
+}
+function chunk(v, size) {
+  return v.reduce((rows, value, index) => {
+    if (index % size === 0) rows.push([value]);
+    else last(rows)?.push(value);
+    return rows;
+  }, []);
+}
+function flatArray(arr) {
+  return arr.reduce((flat, item) => {
+    if (Array.isArray(item)) {
+      return flat.concat(flatArray(item));
+    }
+    return flat.concat(item);
+  }, []);
+}
+function partition(arr, fn) {
+  return arr.reduce(
+    ([pass, fail], value) => {
+      if (fn(value)) pass.push(value);
+      else fail.push(value);
+      return [pass, fail];
+    },
+    [[], []]
+  );
+}
+export {
+  add,
+  addOrRemove,
+  chunk,
+  clear,
+  diff,
+  first,
+  flatArray,
+  fromLength,
+  has,
+  insertAt,
+  isEmpty,
+  last,
+  next,
+  nextIndex,
+  partition,
+  prev,
+  prevIndex,
+  remove,
+  removeAt,
+  toArray,
+  uniq
+};

package/dist/chunk-MXGZDBDQ.mjs

@@ -0,0 +1,15 @@
+var __defProp = Object.defineProperty;
+var __typeError = (msg) => {
+  throw TypeError(msg);
+};
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
+var __accessCheck = (obj, member, msg) => member.has(obj) || __typeError("Cannot " + msg);
+var __privateGet = (obj, member, getter) => (__accessCheck(obj, member, "read from private field"), getter ? getter.call(obj) : member.get(obj));
+var __privateAdd = (obj, member, value) => member.has(obj) ? __typeError("Cannot add the same private member more than once") : member instanceof WeakSet ? member.add(obj) : member.set(obj, value);
+
+export {
+  __publicField,
+  __privateGet,
+  __privateAdd
+};

package/dist/equal.d.mts

@@ -0,0 +1,3 @@
+declare const isEqual: (a: any, b: any) => boolean;
+
+export { isEqual };

package/dist/equal.d.ts

@@ -0,0 +1,3 @@
+declare const isEqual: (a: any, b: any) => boolean;
+
+export { isEqual };

package/dist/equal.js

@@ -0,0 +1,62 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/equal.ts
+var equal_exports = {};
+__export(equal_exports, {
+  isEqual: () => isEqual
+});
+module.exports = __toCommonJS(equal_exports);
+var isArrayLike = (value) => value?.constructor.name === "Array";
+var isArrayEqual = (a, b) => {
+  if (a.length !== b.length) return false;
+  for (let i = 0; i < a.length; i++) {
+    if (!isEqual(a[i], b[i])) return false;
+  }
+  return true;
+};
+var isEqual = (a, b) => {
+  if (Object.is(a, b)) return true;
+  if (a == null && b != null || a != null && b == null) return false;
+  if (typeof a?.isEqual === "function" && typeof b?.isEqual === "function") {
+    return a.isEqual(b);
+  }
+  if (typeof a === "function" && typeof b === "function") {
+    return a.toString() === b.toString();
+  }
+  if (isArrayLike(a) && isArrayLike(b)) {
+    return isArrayEqual(Array.from(a), Array.from(b));
+  }
+  if (!(typeof a === "object") || !(typeof b === "object")) return false;
+  const keys = Object.keys(b ?? /* @__PURE__ */ Object.create(null));
+  const length = keys.length;
+  for (let i = 0; i < length; i++) {
+    const hasKey = Reflect.has(a, keys[i]);
+    if (!hasKey) return false;
+  }
+  for (let i = 0; i < length; i++) {
+    const key = keys[i];
+    if (!isEqual(a[key], b[key])) return false;
+  }
+  return true;
+};
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  isEqual
+});

package/dist/equal.mjs

@@ -0,0 +1,39 @@
+import "./chunk-MXGZDBDQ.mjs";
+
+// src/equal.ts
+var isArrayLike = (value) => value?.constructor.name === "Array";
+var isArrayEqual = (a, b) => {
+  if (a.length !== b.length) return false;
+  for (let i = 0; i < a.length; i++) {
+    if (!isEqual(a[i], b[i])) return false;
+  }
+  return true;
+};
+var isEqual = (a, b) => {
+  if (Object.is(a, b)) return true;
+  if (a == null && b != null || a != null && b == null) return false;
+  if (typeof a?.isEqual === "function" && typeof b?.isEqual === "function") {
+    return a.isEqual(b);
+  }
+  if (typeof a === "function" && typeof b === "function") {
+    return a.toString() === b.toString();
+  }
+  if (isArrayLike(a) && isArrayLike(b)) {
+    return isArrayEqual(Array.from(a), Array.from(b));
+  }
+  if (!(typeof a === "object") || !(typeof b === "object")) return false;
+  const keys = Object.keys(b ?? /* @__PURE__ */ Object.create(null));
+  const length = keys.length;
+  for (let i = 0; i < length; i++) {
+    const hasKey = Reflect.has(a, keys[i]);
+    if (!hasKey) return false;
+  }
+  for (let i = 0; i < length; i++) {
+    const key = keys[i];
+    if (!isEqual(a[key], b[key])) return false;
+  }
+  return true;
+};
+export {
+  isEqual
+};

package/dist/functions.d.mts

@@ -0,0 +1,15 @@
+type MaybeFunction<T> = T | (() => T);
+type Nullable<T> = T | null | undefined;
+declare const runIfFn: <T>(v: T | undefined, ...a: T extends (...a: any[]) => void ? Parameters<T> : never) => T extends (...a: any[]) => void ? NonNullable<ReturnType<T>> : NonNullable<T>;
+declare const cast: <T>(v: unknown) => T;
+declare const identity: (v: VoidFunction) => void;
+declare const noop: () => void;
+declare const callAll: <T extends (...a: any[]) => void>(...fns: (T | null | undefined)[]) => (...a: Parameters<T>) => void;
+declare const uuid: () => string;
+declare function match<V extends string | number = string, R = unknown>(key: V, record: Record<V, R | ((...args: any[]) => R)>, ...args: any[]): R;
+declare const tryCatch: <R>(fn: () => R, fallback: () => R) => R;
+declare function throttle<T extends (...args: any[]) => void>(fn: T, wait?: number): T;
+declare function debounce<T extends (...args: any[]) => void>(fn: T, wait?: number): T;
+declare const hash: (value: string) => string;
+
+export { type MaybeFunction, type Nullable, callAll, cast, debounce, hash, identity, match, noop, runIfFn, throttle, tryCatch, uuid };

package/dist/functions.d.ts

@@ -0,0 +1,15 @@
+type MaybeFunction<T> = T | (() => T);
+type Nullable<T> = T | null | undefined;
+declare const runIfFn: <T>(v: T | undefined, ...a: T extends (...a: any[]) => void ? Parameters<T> : never) => T extends (...a: any[]) => void ? NonNullable<ReturnType<T>> : NonNullable<T>;
+declare const cast: <T>(v: unknown) => T;
+declare const identity: (v: VoidFunction) => void;
+declare const noop: () => void;
+declare const callAll: <T extends (...a: any[]) => void>(...fns: (T | null | undefined)[]) => (...a: Parameters<T>) => void;
+declare const uuid: () => string;
+declare function match<V extends string | number = string, R = unknown>(key: V, record: Record<V, R | ((...args: any[]) => R)>, ...args: any[]): R;
+declare const tryCatch: <R>(fn: () => R, fallback: () => R) => R;
+declare function throttle<T extends (...args: any[]) => void>(fn: T, wait?: number): T;
+declare function debounce<T extends (...args: any[]) => void>(fn: T, wait?: number): T;
+declare const hash: (value: string) => string;
+
+export { type MaybeFunction, type Nullable, callAll, cast, debounce, hash, identity, match, noop, runIfFn, throttle, tryCatch, uuid };

package/dist/functions.js

@@ -0,0 +1,136 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/functions.ts
+var functions_exports = {};
+__export(functions_exports, {
+  callAll: () => callAll,
+  cast: () => cast,
+  debounce: () => debounce,
+  hash: () => hash,
+  identity: () => identity,
+  match: () => match,
+  noop: () => noop,
+  runIfFn: () => runIfFn,
+  throttle: () => throttle,
+  tryCatch: () => tryCatch,
+  uuid: () => uuid
+});
+module.exports = __toCommonJS(functions_exports);
+var import_guard = require("./guard.cjs");
+var runIfFn = (v, ...a) => {
+  const res = typeof v === "function" ? v(...a) : v;
+  return res ?? void 0;
+};
+var cast = (v) => v;
+var identity = (v) => v();
+var noop = () => {
+};
+var callAll = (...fns) => (...a) => {
+  fns.forEach(function(fn) {
+    fn?.(...a);
+  });
+};
+var uuid = /* @__PURE__ */ (() => {
+  let id = 0;
+  return () => {
+    id++;
+    return id.toString(36);
+  };
+})();
+function match(key, record, ...args) {
+  if (key in record) {
+    const fn = record[key];
+    return (0, import_guard.isFunction)(fn) ? fn(...args) : fn;
+  }
+  const error = new Error(`No matching key: ${JSON.stringify(key)} in ${JSON.stringify(Object.keys(record))}`);
+  Error.captureStackTrace?.(error, match);
+  throw error;
+}
+var tryCatch = (fn, fallback) => {
+  try {
+    return fn();
+  } catch (error) {
+    if (error instanceof Error) {
+      Error.captureStackTrace?.(error, tryCatch);
+    }
+    return fallback?.();
+  }
+};
+function throttle(fn, wait = 0) {
+  let lastCall = 0;
+  let timeout = null;
+  return ((...args) => {
+    const now = Date.now();
+    const timeSinceLastCall = now - lastCall;
+    if (timeSinceLastCall >= wait) {
+      if (timeout) {
+        clearTimeout(timeout);
+        timeout = null;
+      }
+      fn(...args);
+      lastCall = now;
+    } else if (!timeout) {
+      timeout = setTimeout(() => {
+        fn(...args);
+        lastCall = Date.now();
+        timeout = null;
+      }, wait - timeSinceLastCall);
+    }
+  });
+}
+function debounce(fn, wait = 0) {
+  let timeout = null;
+  return ((...args) => {
+    if (timeout) {
+      clearTimeout(timeout);
+      timeout = null;
+    }
+    timeout = setTimeout(() => {
+      fn(...args);
+    }, wait);
+  });
+}
+var toChar = (code) => String.fromCharCode(code + (code > 25 ? 39 : 97));
+function toName(code) {
+  let name = "";
+  let x;
+  for (x = Math.abs(code); x > 52; x = x / 52 | 0) name = toChar(x % 52) + name;
+  return toChar(x % 52) + name;
+}
+function toPhash(h, x) {
+  let i = x.length;
+  while (i) h = h * 33 ^ x.charCodeAt(--i);
+  return h;
+}
+var hash = (value) => toName(toPhash(5381, value) >>> 0);
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  callAll,
+  cast,
+  debounce,
+  hash,
+  identity,
+  match,
+  noop,
+  runIfFn,
+  throttle,
+  tryCatch,
+  uuid
+});

package/dist/functions.mjs

@@ -0,0 +1,103 @@
+import "./chunk-MXGZDBDQ.mjs";
+
+// src/functions.ts
+import { isFunction } from "./guard.mjs";
+var runIfFn = (v, ...a) => {
+  const res = typeof v === "function" ? v(...a) : v;
+  return res ?? void 0;
+};
+var cast = (v) => v;
+var identity = (v) => v();
+var noop = () => {
+};
+var callAll = (...fns) => (...a) => {
+  fns.forEach(function(fn) {
+    fn?.(...a);
+  });
+};
+var uuid = /* @__PURE__ */ (() => {
+  let id = 0;
+  return () => {
+    id++;
+    return id.toString(36);
+  };
+})();
+function match(key, record, ...args) {
+  if (key in record) {
+    const fn = record[key];
+    return isFunction(fn) ? fn(...args) : fn;
+  }
+  const error = new Error(`No matching key: ${JSON.stringify(key)} in ${JSON.stringify(Object.keys(record))}`);
+  Error.captureStackTrace?.(error, match);
+  throw error;
+}
+var tryCatch = (fn, fallback) => {
+  try {
+    return fn();
+  } catch (error) {
+    if (error instanceof Error) {
+      Error.captureStackTrace?.(error, tryCatch);
+    }
+    return fallback?.();
+  }
+};
+function throttle(fn, wait = 0) {
+  let lastCall = 0;
+  let timeout = null;
+  return ((...args) => {
+    const now = Date.now();
+    const timeSinceLastCall = now - lastCall;
+    if (timeSinceLastCall >= wait) {
+      if (timeout) {
+        clearTimeout(timeout);
+        timeout = null;
+      }
+      fn(...args);
+      lastCall = now;
+    } else if (!timeout) {
+      timeout = setTimeout(() => {
+        fn(...args);
+        lastCall = Date.now();
+        timeout = null;
+      }, wait - timeSinceLastCall);
+    }
+  });
+}
+function debounce(fn, wait = 0) {
+  let timeout = null;
+  return ((...args) => {
+    if (timeout) {
+      clearTimeout(timeout);
+      timeout = null;
+    }
+    timeout = setTimeout(() => {
+      fn(...args);
+    }, wait);
+  });
+}
+var toChar = (code) => String.fromCharCode(code + (code > 25 ? 39 : 97));
+function toName(code) {
+  let name = "";
+  let x;
+  for (x = Math.abs(code); x > 52; x = x / 52 | 0) name = toChar(x % 52) + name;
+  return toChar(x % 52) + name;
+}
+function toPhash(h, x) {
+  let i = x.length;
+  while (i) h = h * 33 ^ x.charCodeAt(--i);
+  return h;
+}
+var hash = (value) => toName(toPhash(5381, value) >>> 0);
+export {
+  callAll,
+  cast,
+  debounce,
+  hash,
+  identity,
+  match,
+  noop,
+  runIfFn,
+  throttle,
+  tryCatch,
+  uuid
+};