radashi 12.1.0 → 12.2.0-beta.0dc9c8a

package/dist/esm/async.mjs

@@ -1,158 +0,0 @@
-import { list, fork, sort, range } from './array.mjs';
-import { isArray, isPromise } from './typed.mjs';
-
-const reduce = async (array, asyncReducer, initValue) => {
-  const initProvided = initValue !== void 0;
-  if (!initProvided && array?.length < 1) {
-    throw new Error("Cannot reduce empty array with no init value");
-  }
-  const iter = initProvided ? array : array.slice(1);
-  let value = initProvided ? initValue : array[0];
-  for (const [i, item] of iter.entries()) {
-    value = await asyncReducer(value, item, i);
-  }
-  return value;
-};
-const map = async (array, asyncMapFunc) => {
-  if (!array)
-    return [];
-  let result = [];
-  let index = 0;
-  for (const value of array) {
-    const newValue = await asyncMapFunc(value, index++);
-    result.push(newValue);
-  }
-  return result;
-};
-const defer = async (func) => {
-  const callbacks = [];
-  const register = (fn, options) => callbacks.push({
-    fn,
-    rethrow: options?.rethrow ?? false
-  });
-  const [err, response] = await tryit(func)(register);
-  for (const { fn, rethrow } of callbacks) {
-    const [rethrown] = await tryit(fn)(err);
-    if (rethrown && rethrow)
-      throw rethrown;
-  }
-  if (err)
-    throw err;
-  return response;
-};
-class AggregateError extends Error {
-  constructor(errors = []) {
-    super();
-    const name = errors.find((e) => e.name)?.name ?? "";
-    this.name = `AggregateError(${name}...)`;
-    this.message = `AggregateError with ${errors.length} errors`;
-    this.stack = errors.find((e) => e.stack)?.stack ?? this.stack;
-    this.errors = errors;
-  }
-}
-const parallel = async (limit, array, func) => {
-  const work = array.map((item, index) => ({
-    index,
-    item
-  }));
-  const processor = async (res) => {
-    const results2 = [];
-    while (true) {
-      const next = work.pop();
-      if (!next)
-        return res(results2);
-      const [error, result] = await tryit(func)(next.item);
-      results2.push({
-        error,
-        result,
-        index: next.index
-      });
-    }
-  };
-  const queues = list(1, limit).map(() => new Promise(processor));
-  const itemResults = await Promise.all(queues);
-  const [errors, results] = fork(
-    sort(itemResults.flat(), (r) => r.index),
-    (x) => !!x.error
-  );
-  if (errors.length > 0) {
-    throw new AggregateError(errors.map((error) => error.error));
-  }
-  return results.map((r) => r.result);
-};
-async function all(promises) {
-  const entries = isArray(promises) ? promises.map((p) => [null, p]) : Object.entries(promises);
-  const results = await Promise.all(
-    entries.map(
-      ([key, value]) => value.then((result) => ({ result, exc: null, key })).catch((exc) => ({ result: null, exc, key }))
-    )
-  );
-  const exceptions = results.filter((r) => r.exc);
-  if (exceptions.length > 0) {
-    throw new AggregateError(exceptions.map((e) => e.exc));
-  }
-  if (isArray(promises)) {
-    return results.map((r) => r.result);
-  }
-  return results.reduce(
-    (acc, item) => ({
-      ...acc,
-      [item.key]: item.result
-    }),
-    {}
-  );
-}
-const retry = async (options, func) => {
-  const times = options?.times ?? 3;
-  const delay = options?.delay;
-  const backoff = options?.backoff ?? null;
-  for (const i of range(1, times)) {
-    const [err, result] = await tryit(func)((err2) => {
-      throw { _exited: err2 };
-    });
-    if (!err)
-      return result;
-    if (err._exited)
-      throw err._exited;
-    if (i === times)
-      throw err;
-    if (delay)
-      await sleep(delay);
-    if (backoff)
-      await sleep(backoff(i));
-  }
-  return void 0;
-};
-const sleep = (milliseconds) => {
-  return new Promise((res) => setTimeout(res, milliseconds));
-};
-const tryit = (func) => {
-  return (...args) => {
-    try {
-      const result = func(...args);
-      if (isPromise(result)) {
-        return result.then((value) => [void 0, value]).catch((err) => [err, void 0]);
-      }
-      return [void 0, result];
-    } catch (err) {
-      return [err, void 0];
-    }
-  };
-};
-const guard = (func, shouldGuard) => {
-  const _guard = (err) => {
-    if (shouldGuard && !shouldGuard(err))
-      throw err;
-    return void 0;
-  };
-  const isPromise2 = (result) => result instanceof Promise;
-  try {
-    const result = func();
-    return isPromise2(result) ? result.catch(_guard) : result;
-  } catch (err) {
-    return _guard(err);
-  }
-};
-
-export { AggregateError, all, defer, guard, map, parallel, reduce, retry, sleep, tryit };
-//# sourceMappingURL=async.mjs.map

package/dist/esm/async.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"async.mjs","sources":["../../src/async.ts"],"sourcesContent":["import { fork, list, range, sort } from './array'\nimport { isArray, isPromise } from './typed'\n\ndeclare const setTimeout: (fn: () => void, ms: number) => unknown\n\n/**\n * An async reduce function. Works like the\n * built-in Array.reduce function but handles\n * an async reducer function\n */\nexport const reduce = async <T, K>(\n  array: readonly T[],\n  asyncReducer: (acc: K, item: T, index: number) => Promise<K>,\n  initValue?: K\n): Promise<K> => {\n  const initProvided = initValue !== undefined\n  if (!initProvided && array?.length < 1) {\n    throw new Error('Cannot reduce empty array with no init value')\n  }\n  const iter = initProvided ? array : array.slice(1)\n  let value: any = initProvided ? initValue : array[0]\n  for (const [i, item] of iter.entries()) {\n    value = await asyncReducer(value, item, i)\n  }\n  return value\n}\n\n/**\n * An async map function. Works like the\n * built-in Array.map function but handles\n * an async mapper function\n */\nexport const map = async <T, K>(\n  array: readonly T[],\n  asyncMapFunc: (item: T, index: number) => Promise<K>\n): Promise<K[]> => {\n  if (!array) return []\n  let result = []\n  let index = 0\n  for (const value of array) {\n    const newValue = await asyncMapFunc(value, index++)\n    result.push(newValue)\n  }\n  return result\n}\n\n/**\n * Useful when for script like things where cleanup\n * should be done on fail or sucess no matter.\n *\n * You can call defer many times to register many\n * defered functions that will all be called when\n * the function exits in any state.\n */\nexport const defer = async <TResponse>(\n  func: (\n    register: (\n      fn: (error?: any) => any,\n      options?: { rethrow?: boolean }\n    ) => void\n  ) => Promise<TResponse>\n): Promise<TResponse> => {\n  const callbacks: {\n    fn: (error?: any) => any\n    rethrow: boolean\n  }[] = []\n  const register = (\n    fn: (error?: any) => any,\n    options?: { rethrow?: boolean }\n  ) =>\n    callbacks.push({\n      fn,\n      rethrow: options?.rethrow ?? false\n    })\n  const [err, response] = await tryit(func)(register)\n  for (const { fn, rethrow } of callbacks) {\n    const [rethrown] = await tryit(fn)(err)\n    if (rethrown && rethrow) throw rethrown\n  }\n  if (err) throw err\n  return response\n}\n\ntype WorkItemResult<K> = {\n  index: number\n  result: K\n  error: any\n}\n\n/**\n * Support for the built-in AggregateError\n * is still new. Node < 15 doesn't have it\n * so patching here.\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/AggregateError#browser_compatibility\n */\nexport class AggregateError extends Error {\n  errors: Error[]\n  constructor(errors: Error[] = []) {\n    super()\n    const name = errors.find(e => e.name)?.name ?? ''\n    this.name = `AggregateError(${name}...)`\n    this.message = `AggregateError with ${errors.length} errors`\n    this.stack = errors.find(e => e.stack)?.stack ?? this.stack\n    this.errors = errors\n  }\n}\n\n/**\n * Executes many async functions in parallel. Returns the\n * results from all functions as an array. After all functions\n * have resolved, if any errors were thrown, they are rethrown\n * in an instance of AggregateError\n */\nexport const parallel = async <T, K>(\n  limit: number,\n  array: readonly T[],\n  func: (item: T) => Promise<K>\n): Promise<K[]> => {\n  const work = array.map((item, index) => ({\n    index,\n    item\n  }))\n  // Process array items\n  const processor = async (res: (value: WorkItemResult<K>[]) => void) => {\n    const results: WorkItemResult<K>[] = []\n    while (true) {\n      const next = work.pop()\n      if (!next) return res(results)\n      const [error, result] = await tryit(func)(next.item)\n      results.push({\n        error,\n        result: result as K,\n        index: next.index\n      })\n    }\n  }\n  // Create queues\n  const queues = list(1, limit).map(() => new Promise(processor))\n  // Wait for all queues to complete\n  const itemResults = (await Promise.all(queues)) as WorkItemResult<K>[][]\n  const [errors, results] = fork(\n    sort(itemResults.flat(), r => r.index),\n    x => !!x.error\n  )\n  if (errors.length > 0) {\n    throw new AggregateError(errors.map(error => error.error))\n  }\n  return results.map(r => r.result)\n}\n\ntype PromiseValues<T extends Promise<any>[]> = {\n  [K in keyof T]: T[K] extends Promise<infer U> ? U : never\n}\n\n/**\n * Functionally similar to Promise.all or Promise.allSettled. If any\n * errors are thrown, all errors are gathered and thrown in an\n * AggregateError.\n *\n * @example\n * const [user] = await all([\n *   api.users.create(...),\n *   s3.buckets.create(...),\n *   slack.customerSuccessChannel.sendMessage(...)\n * ])\n */\nexport async function all<T extends [Promise<any>, ...Promise<any>[]]>(\n  promises: T\n): Promise<PromiseValues<T>>\nexport async function all<T extends Promise<any>[]>(\n  promises: T\n): Promise<PromiseValues<T>>\n/**\n * Functionally similar to Promise.all or Promise.allSettled. If any\n * errors are thrown, all errors are gathered and thrown in an\n * AggregateError.\n *\n * @example\n * const { user } = await all({\n *   user: api.users.create(...),\n *   bucket: s3.buckets.create(...),\n *   message: slack.customerSuccessChannel.sendMessage(...)\n * })\n */\nexport async function all<T extends Record<string, Promise<any>>>(\n  promises: T\n): Promise<{ [K in keyof T]: Awaited<T[K]> }>\nexport async function all<\n  T extends Record<string, Promise<any>> | Promise<any>[]\n>(promises: T) {\n  const entries = isArray(promises)\n    ? promises.map(p => [null, p] as [null, Promise<any>])\n    : Object.entries(promises)\n\n  const results = await Promise.all(\n    entries.map(([key, value]) =>\n      value\n        .then(result => ({ result, exc: null, key }))\n        .catch(exc => ({ result: null, exc, key }))\n    )\n  )\n\n  const exceptions = results.filter(r => r.exc)\n  if (exceptions.length > 0) {\n    throw new AggregateError(exceptions.map(e => e.exc))\n  }\n\n  if (isArray(promises)) {\n    return results.map(r => r.result) as T extends Promise<any>[]\n      ? PromiseValues<T>\n      : unknown\n  }\n\n  return results.reduce(\n    (acc, item) => ({\n      ...acc,\n      [item.key!]: item.result\n    }),\n    {} as { [K in keyof T]: Awaited<T[K]> }\n  )\n}\n\n/**\n * Retries the given function the specified number\n * of times.\n */\nexport const retry = async <TResponse>(\n  options: {\n    times?: number\n    delay?: number | null\n    backoff?: (count: number) => number\n  },\n  func: (exit: (err: any) => void) => Promise<TResponse>\n): Promise<TResponse> => {\n  const times = options?.times ?? 3\n  const delay = options?.delay\n  const backoff = options?.backoff ?? null\n  for (const i of range(1, times)) {\n    const [err, result] = (await tryit(func)((err: any) => {\n      throw { _exited: err }\n    })) as [any, TResponse]\n    if (!err) return result\n    if (err._exited) throw err._exited\n    if (i === times) throw err\n    if (delay) await sleep(delay)\n    if (backoff) await sleep(backoff(i))\n  }\n  // Logically, we should never reach this\n  // code path. It makes the function meet\n  // strict mode requirements.\n  /* istanbul ignore next */\n  return undefined as unknown as TResponse\n}\n\n/**\n * Async wait\n */\nexport const sleep = (milliseconds: number) => {\n  return new Promise<void>(res => setTimeout(res, milliseconds))\n}\n\n/**\n * A helper to try an async function without forking\n * the control flow. Returns an error first callback _like_\n * array response as [Error, result]\n */\nexport const tryit = <Args extends any[], Return>(\n  func: (...args: Args) => Return\n) => {\n  return (\n    ...args: Args\n  ): Return extends Promise<any>\n    ? Promise<[Error, undefined] | [undefined, Awaited<Return>]>\n    : [Error, undefined] | [undefined, Return] => {\n    try {\n      const result = func(...args)\n      if (isPromise(result)) {\n        return result\n          .then(value => [undefined, value])\n          .catch(err => [err, undefined]) as Return extends Promise<any>\n          ? Promise<[Error, undefined] | [undefined, Awaited<Return>]>\n          : [Error, undefined] | [undefined, Return]\n      }\n      return [undefined, result] as Return extends Promise<any>\n        ? Promise<[Error, undefined] | [undefined, Awaited<Return>]>\n        : [Error, undefined] | [undefined, Return]\n    } catch (err) {\n      return [err as any, undefined] as Return extends Promise<any>\n        ? Promise<[Error, undefined] | [undefined, Awaited<Return>]>\n        : [Error, undefined] | [undefined, Return]\n    }\n  }\n}\n\n/**\n * A helper to try an async function that returns undefined\n * if it fails.\n *\n * e.g. const result = await guard(fetchUsers)() ?? [];\n */\nexport const guard = <TFunction extends () => any>(\n  func: TFunction,\n  shouldGuard?: (err: any) => boolean\n): ReturnType<TFunction> extends Promise<any>\n  ? Promise<Awaited<ReturnType<TFunction>> | undefined>\n  : ReturnType<TFunction> | undefined => {\n  const _guard = (err: any) => {\n    if (shouldGuard && !shouldGuard(err)) throw err\n    return undefined as any\n  }\n  const isPromise = (result: any): result is Promise<any> =>\n    result instanceof Promise\n  try {\n    const result = func()\n    return isPromise(result) ? result.catch(_guard) : result\n  } catch (err) {\n    return _guard(err)\n  }\n}\n"],"names":["results","err","isPromise"],"mappings":";;;AAUO,MAAM,MAAS,GAAA,OACpB,KACA,EAAA,YAAA,EACA,SACe,KAAA;AACf,EAAA,MAAM,eAAe,SAAc,KAAA,KAAA,CAAA,CAAA;AACnC,EAAA,IAAI,CAAC,YAAA,IAAgB,KAAO,EAAA,MAAA,GAAS,CAAG,EAAA;AACtC,IAAM,MAAA,IAAI,MAAM,8CAA8C,CAAA,CAAA;AAAA,GAChE;AACA,EAAA,MAAM,IAAO,GAAA,YAAA,GAAe,KAAQ,GAAA,KAAA,CAAM,MAAM,CAAC,CAAA,CAAA;AACjD,EAAA,IAAI,KAAa,GAAA,YAAA,GAAe,SAAY,GAAA,KAAA,CAAM,CAAC,CAAA,CAAA;AACnD,EAAA,KAAA,MAAW,CAAC,CAAG,EAAA,IAAI,CAAK,IAAA,IAAA,CAAK,SAAW,EAAA;AACtC,IAAA,KAAA,GAAQ,MAAM,YAAA,CAAa,KAAO,EAAA,IAAA,EAAM,CAAC,CAAA,CAAA;AAAA,GAC3C;AACA,EAAO,OAAA,KAAA,CAAA;AACT,EAAA;AAOa,MAAA,GAAA,GAAM,OACjB,KAAA,EACA,YACiB,KAAA;AACjB,EAAA,IAAI,CAAC,KAAA;AAAO,IAAA,OAAO,EAAC,CAAA;AACpB,EAAA,IAAI,SAAS,EAAC,CAAA;AACd,EAAA,IAAI,KAAQ,GAAA,CAAA,CAAA;AACZ,EAAA,KAAA,MAAW,SAAS,KAAO,EAAA;AACzB,IAAA,MAAM,QAAW,GAAA,MAAM,YAAa,CAAA,KAAA,EAAO,KAAO,EAAA,CAAA,CAAA;AAClD,IAAA,MAAA,CAAO,KAAK,QAAQ,CAAA,CAAA;AAAA,GACtB;AACA,EAAO,OAAA,MAAA,CAAA;AACT,EAAA;AAUa,MAAA,KAAA,GAAQ,OACnB,IAMuB,KAAA;AACvB,EAAA,MAAM,YAGA,EAAC,CAAA;AACP,EAAA,MAAM,QAAW,GAAA,CACf,EACA,EAAA,OAAA,KAEA,UAAU,IAAK,CAAA;AAAA,IACb,EAAA;AAAA,IACA,OAAA,EAAS,SAAS,OAAW,IAAA,KAAA;AAAA,GAC9B,CAAA,CAAA;AACH,EAAM,MAAA,CAAC,KAAK,QAAQ,CAAA,GAAI,MAAM,KAAM,CAAA,IAAI,EAAE,QAAQ,CAAA,CAAA;AAClD,EAAA,KAAA,MAAW,EAAE,EAAA,EAAI,OAAQ,EAAA,IAAK,SAAW,EAAA;AACvC,IAAA,MAAM,CAAC,QAAQ,CAAA,GAAI,MAAM,KAAM,CAAA,EAAE,EAAE,GAAG,CAAA,CAAA;AACtC,IAAA,IAAI,QAAY,IAAA,OAAA;AAAS,MAAM,MAAA,QAAA,CAAA;AAAA,GACjC;AACA,EAAI,IAAA,GAAA;AAAK,IAAM,MAAA,GAAA,CAAA;AACf,EAAO,OAAA,QAAA,CAAA;AACT,EAAA;AAcO,MAAM,uBAAuB,KAAM,CAAA;AAAA,EAExC,WAAA,CAAY,MAAkB,GAAA,EAAI,EAAA;AAChC,IAAM,KAAA,EAAA,CAAA;AACN,IAAA,MAAM,OAAO,MAAO,CAAA,IAAA,CAAK,OAAK,CAAE,CAAA,IAAI,GAAG,IAAQ,IAAA,EAAA,CAAA;AAC/C,IAAA,IAAA,CAAK,OAAO,CAAkB,eAAA,EAAA,IAAA,CAAA,IAAA,CAAA,CAAA;AAC9B,IAAK,IAAA,CAAA,OAAA,GAAU,uBAAuB,MAAO,CAAA,MAAA,CAAA,OAAA,CAAA,CAAA;AAC7C,IAAK,IAAA,CAAA,KAAA,GAAQ,OAAO,IAAK,CAAA,CAAA,CAAA,KAAK,EAAE,KAAK,CAAA,EAAG,SAAS,IAAK,CAAA,KAAA,CAAA;AACtD,IAAA,IAAA,CAAK,MAAS,GAAA,MAAA,CAAA;AAAA,GAChB;AACF,CAAA;AAQO,MAAM,QAAW,GAAA,OACtB,KACA,EAAA,KAAA,EACA,IACiB,KAAA;AACjB,EAAA,MAAM,IAAO,GAAA,KAAA,CAAM,GAAI,CAAA,CAAC,MAAM,KAAW,MAAA;AAAA,IACvC,KAAA;AAAA,IACA,IAAA;AAAA,GACA,CAAA,CAAA,CAAA;AAEF,EAAM,MAAA,SAAA,GAAY,OAAO,GAA8C,KAAA;AACrE,IAAA,MAAMA,WAA+B,EAAC,CAAA;AACtC,IAAA,OAAO,IAAM,EAAA;AACX,MAAM,MAAA,IAAA,GAAO,KAAK,GAAI,EAAA,CAAA;AACtB,MAAA,IAAI,CAAC,IAAA;AAAM,QAAA,OAAO,IAAIA,QAAO,CAAA,CAAA;AAC7B,MAAM,MAAA,CAAC,OAAO,MAAM,CAAA,GAAI,MAAM,KAAM,CAAA,IAAI,CAAE,CAAA,IAAA,CAAK,IAAI,CAAA,CAAA;AACnD,MAAAA,SAAQ,IAAK,CAAA;AAAA,QACX,KAAA;AAAA,QACA,MAAA;AAAA,QACA,OAAO,IAAK,CAAA,KAAA;AAAA,OACb,CAAA,CAAA;AAAA,KACH;AAAA,GACF,CAAA;AAEA,EAAM,MAAA,MAAA,GAAS,IAAK,CAAA,CAAA,EAAG,KAAK,CAAA,CAAE,IAAI,MAAM,IAAI,OAAQ,CAAA,SAAS,CAAC,CAAA,CAAA;AAE9D,EAAA,MAAM,WAAe,GAAA,MAAM,OAAQ,CAAA,GAAA,CAAI,MAAM,CAAA,CAAA;AAC7C,EAAM,MAAA,CAAC,MAAQ,EAAA,OAAO,CAAI,GAAA,IAAA;AAAA,IACxB,KAAK,WAAY,CAAA,IAAA,EAAQ,EAAA,CAAA,CAAA,KAAK,EAAE,KAAK,CAAA;AAAA,IACrC,CAAA,CAAA,KAAK,CAAC,CAAC,CAAE,CAAA,KAAA;AAAA,GACX,CAAA;AACA,EAAI,IAAA,MAAA,CAAO,SAAS,CAAG,EAAA;AACrB,IAAA,MAAM,IAAI,cAAe,CAAA,MAAA,CAAO,IAAI,CAAS,KAAA,KAAA,KAAA,CAAM,KAAK,CAAC,CAAA,CAAA;AAAA,GAC3D;AACA,EAAA,OAAO,OAAQ,CAAA,GAAA,CAAI,CAAK,CAAA,KAAA,CAAA,CAAE,MAAM,CAAA,CAAA;AAClC,EAAA;AAuCA,eAAsB,IAEpB,QAAa,EAAA;AACb,EAAA,MAAM,OAAU,GAAA,OAAA,CAAQ,QAAQ,CAAA,GAC5B,SAAS,GAAI,CAAA,CAAA,CAAA,KAAK,CAAC,IAAA,EAAM,CAAC,CAAyB,CACnD,GAAA,MAAA,CAAO,QAAQ,QAAQ,CAAA,CAAA;AAE3B,EAAM,MAAA,OAAA,GAAU,MAAM,OAAQ,CAAA,GAAA;AAAA,IAC5B,OAAQ,CAAA,GAAA;AAAA,MAAI,CAAC,CAAC,GAAK,EAAA,KAAK,MACtB,KACG,CAAA,IAAA,CAAK,CAAW,MAAA,MAAA,EAAE,MAAQ,EAAA,GAAA,EAAK,MAAM,GAAI,EAAA,CAAE,EAC3C,KAAM,CAAA,CAAA,GAAA,MAAQ,EAAE,MAAQ,EAAA,IAAA,EAAM,GAAK,EAAA,GAAA,EAAM,CAAA,CAAA;AAAA,KAC9C;AAAA,GACF,CAAA;AAEA,EAAA,MAAM,UAAa,GAAA,OAAA,CAAQ,MAAO,CAAA,CAAA,CAAA,KAAK,EAAE,GAAG,CAAA,CAAA;AAC5C,EAAI,IAAA,UAAA,CAAW,SAAS,CAAG,EAAA;AACzB,IAAA,MAAM,IAAI,cAAe,CAAA,UAAA,CAAW,IAAI,CAAK,CAAA,KAAA,CAAA,CAAE,GAAG,CAAC,CAAA,CAAA;AAAA,GACrD;AAEA,EAAI,IAAA,OAAA,CAAQ,QAAQ,CAAG,EAAA;AACrB,IAAA,OAAO,OAAQ,CAAA,GAAA,CAAI,CAAK,CAAA,KAAA,CAAA,CAAE,MAAM,CAAA,CAAA;AAAA,GAGlC;AAEA,EAAA,OAAO,OAAQ,CAAA,MAAA;AAAA,IACb,CAAC,KAAK,IAAU,MAAA;AAAA,MACd,GAAG,GAAA;AAAA,MACH,CAAC,IAAA,CAAK,GAAI,GAAG,IAAK,CAAA,MAAA;AAAA,KACpB,CAAA;AAAA,IACA,EAAC;AAAA,GACH,CAAA;AACF,CAAA;AAMa,MAAA,KAAA,GAAQ,OACnB,OAAA,EAKA,IACuB,KAAA;AACvB,EAAM,MAAA,KAAA,GAAQ,SAAS,KAAS,IAAA,CAAA,CAAA;AAChC,EAAA,MAAM,QAAQ,OAAS,EAAA,KAAA,CAAA;AACvB,EAAM,MAAA,OAAA,GAAU,SAAS,OAAW,IAAA,IAAA,CAAA;AACpC,EAAA,KAAA,MAAW,CAAK,IAAA,KAAA,CAAM,CAAG,EAAA,KAAK,CAAG,EAAA;AAC/B,IAAM,MAAA,CAAC,KAAK,MAAM,CAAA,GAAK,MAAM,KAAM,CAAA,IAAI,CAAE,CAAA,CAACC,IAAa,KAAA;AACrD,MAAM,MAAA,EAAE,SAASA,IAAI,EAAA,CAAA;AAAA,KACtB,CAAA,CAAA;AACD,IAAA,IAAI,CAAC,GAAA;AAAK,MAAO,OAAA,MAAA,CAAA;AACjB,IAAA,IAAI,GAAI,CAAA,OAAA;AAAS,MAAA,MAAM,GAAI,CAAA,OAAA,CAAA;AAC3B,IAAA,IAAI,CAAM,KAAA,KAAA;AAAO,MAAM,MAAA,GAAA,CAAA;AACvB,IAAI,IAAA,KAAA;AAAO,MAAA,MAAM,MAAM,KAAK,CAAA,CAAA;AAC5B,IAAI,IAAA,OAAA;AAAS,MAAM,MAAA,KAAA,CAAM,OAAQ,CAAA,CAAC,CAAC,CAAA,CAAA;AAAA,GACrC;AAKA,EAAO,OAAA,KAAA,CAAA,CAAA;AACT,EAAA;AAKa,MAAA,KAAA,GAAQ,CAAC,YAAyB,KAAA;AAC7C,EAAA,OAAO,IAAI,OAAc,CAAA,CAAA,GAAA,KAAO,UAAW,CAAA,GAAA,EAAK,YAAY,CAAC,CAAA,CAAA;AAC/D,EAAA;AAOa,MAAA,KAAA,GAAQ,CACnB,IACG,KAAA;AACH,EAAA,OAAO,IACF,IAG2C,KAAA;AAC9C,IAAI,IAAA;AACF,MAAM,MAAA,MAAA,GAAS,IAAK,CAAA,GAAG,IAAI,CAAA,CAAA;AAC3B,MAAI,IAAA,SAAA,CAAU,MAAM,CAAG,EAAA;AACrB,QAAA,OAAO,MACJ,CAAA,IAAA,CAAK,CAAS,KAAA,KAAA,CAAC,KAAW,CAAA,EAAA,KAAK,CAAC,CAAA,CAChC,KAAM,CAAA,CAAA,GAAA,KAAO,CAAC,GAAA,EAAK,MAAS,CAAC,CAAA,CAAA;AAAA,OAGlC;AACA,MAAO,OAAA,CAAC,QAAW,MAAM,CAAA,CAAA;AAAA,aAGlB,GAAP,EAAA;AACA,MAAO,OAAA,CAAC,KAAY,KAAS,CAAA,CAAA,CAAA;AAAA,KAG/B;AAAA,GACF,CAAA;AACF,EAAA;AAQa,MAAA,KAAA,GAAQ,CACnB,IAAA,EACA,WAGuC,KAAA;AACvC,EAAM,MAAA,MAAA,GAAS,CAAC,GAAa,KAAA;AAC3B,IAAI,IAAA,WAAA,IAAe,CAAC,WAAA,CAAY,GAAG,CAAA;AAAG,MAAM,MAAA,GAAA,CAAA;AAC5C,IAAO,OAAA,KAAA,CAAA,CAAA;AAAA,GACT,CAAA;AACA,EAAMC,MAAAA,UAAAA,GAAY,CAAC,MAAA,KACjB,MAAkB,YAAA,OAAA,CAAA;AACpB,EAAI,IAAA;AACF,IAAA,MAAM,SAAS,IAAK,EAAA,CAAA;AACpB,IAAA,OAAOA,WAAU,MAAM,CAAA,GAAI,MAAO,CAAA,KAAA,CAAM,MAAM,CAAI,GAAA,MAAA,CAAA;AAAA,WAC3C,GAAP,EAAA;AACA,IAAA,OAAO,OAAO,GAAG,CAAA,CAAA;AAAA,GACnB;AACF;;;;"}

package/dist/esm/curry.mjs

@@ -1,103 +0,0 @@
-function chain(...funcs) {
-  return (...args) => {
-    return funcs.slice(1).reduce((acc, fn) => fn(acc), funcs[0](...args));
-  };
-}
-function compose(...funcs) {
-  return funcs.reverse().reduce((acc, fn) => fn(acc));
-}
-const partial = (fn, ...args) => {
-  return (...rest) => fn(...[...args, ...rest]);
-};
-const partob = (fn, argobj) => {
-  return (restobj) => fn({
-    ...argobj,
-    ...restobj
-  });
-};
-const proxied = (handler) => {
-  return new Proxy(
-    {},
-    {
-      get: (target, propertyName) => handler(propertyName)
-    }
-  );
-};
-const memoize = (cache, func, keyFunc, ttl) => {
-  return function callWithMemo(...args) {
-    const key = keyFunc ? keyFunc(...args) : JSON.stringify({ args });
-    const existing = cache[key];
-    if (existing !== void 0) {
-      if (!existing.exp)
-        return existing.value;
-      if (existing.exp > new Date().getTime()) {
-        return existing.value;
-      }
-    }
-    const result = func(...args);
-    cache[key] = {
-      exp: ttl ? new Date().getTime() + ttl : null,
-      value: result
-    };
-    return result;
-  };
-};
-const memo = (func, options = {}) => {
-  return memoize({}, func, options.key ?? null, options.ttl ?? null);
-};
-const debounce = ({ delay }, func) => {
-  let timer = void 0;
-  let active = true;
-  const debounced = (...args) => {
-    if (active) {
-      clearTimeout(timer);
-      timer = setTimeout(() => {
-        active && func(...args);
-        timer = void 0;
-      }, delay);
-    } else {
-      func(...args);
-    }
-  };
-  debounced.isPending = () => {
-    return timer !== void 0;
-  };
-  debounced.cancel = () => {
-    active = false;
-  };
-  debounced.flush = (...args) => func(...args);
-  return debounced;
-};
-const throttle = ({ interval }, func) => {
-  let ready = true;
-  let timer = void 0;
-  const throttled = (...args) => {
-    if (!ready)
-      return;
-    func(...args);
-    ready = false;
-    timer = setTimeout(() => {
-      ready = true;
-      timer = void 0;
-    }, interval);
-  };
-  throttled.isThrottled = () => {
-    return timer !== void 0;
-  };
-  return throttled;
-};
-const callable = (obj, fn) => {
-  const FUNC = () => {
-  };
-  return new Proxy(Object.assign(FUNC, obj), {
-    get: (target, key) => target[key],
-    set: (target, key, value) => {
-      target[key] = value;
-      return true;
-    },
-    apply: (target, self, args) => fn(Object.assign({}, target))(...args)
-  });
-};
-
-export { callable, chain, compose, debounce, memo, partial, partob, proxied, throttle };
-//# sourceMappingURL=curry.mjs.map

package/dist/esm/curry.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"curry.mjs","sources":["../../src/curry.ts"],"sourcesContent":["declare const setTimeout: (fn: () => void, ms: number) => unknown\ndeclare const clearTimeout: (timer: unknown) => void\n\nexport function chain<T1 extends any[], T2, T3>(\n  f1: (...arg: T1) => T2,\n  f2: (arg: T2) => T3\n): (...arg: T1) => T3\nexport function chain<T1 extends any[], T2, T3, T4>(\n  f1: (...arg: T1) => T2,\n  f2: (arg: T2) => T3,\n  f3: (arg: T3) => T4\n): (...arg: T1) => T4\nexport function chain<T1 extends any[], T2, T3, T4, T5>(\n  f1: (...arg: T1) => T2,\n  f2: (arg: T2) => T3,\n  f3: (arg: T3) => T4,\n  f4: (arg: T3) => T5\n): (...arg: T1) => T5\nexport function chain<T1 extends any[], T2, T3, T4, T5, T6>(\n  f1: (...arg: T1) => T2,\n  f2: (arg: T2) => T3,\n  f3: (arg: T3) => T4,\n  f4: (arg: T3) => T5,\n  f5: (arg: T3) => T6\n): (...arg: T1) => T6\nexport function chain<T1 extends any[], T2, T3, T4, T5, T6, T7>(\n  f1: (...arg: T1) => T2,\n  f2: (arg: T2) => T3,\n  f3: (arg: T3) => T4,\n  f4: (arg: T3) => T5,\n  f5: (arg: T3) => T6,\n  f6: (arg: T3) => T7\n): (...arg: T1) => T7\nexport function chain<T1 extends any[], T2, T3, T4, T5, T6, T7, T8>(\n  f1: (...arg: T1) => T2,\n  f2: (arg: T2) => T3,\n  f3: (arg: T3) => T4,\n  f4: (arg: T3) => T5,\n  f5: (arg: T3) => T6,\n  f6: (arg: T3) => T7,\n  f7: (arg: T3) => T8\n): (...arg: T1) => T8\nexport function chain<T1 extends any[], T2, T3, T4, T5, T6, T7, T8, T9>(\n  f1: (...arg: T1) => T2,\n  f2: (arg: T2) => T3,\n  f3: (arg: T3) => T4,\n  f4: (arg: T3) => T5,\n  f5: (arg: T3) => T6,\n  f6: (arg: T3) => T7,\n  f7: (arg: T3) => T8,\n  f8: (arg: T3) => T9\n): (...arg: T1) => T9\nexport function chain<T1 extends any[], T2, T3, T4, T5, T6, T7, T8, T9, T10>(\n  f1: (...arg: T1) => T2,\n  f2: (arg: T2) => T3,\n  f3: (arg: T3) => T4,\n  f4: (arg: T3) => T5,\n  f5: (arg: T3) => T6,\n  f6: (arg: T3) => T7,\n  f7: (arg: T3) => T8,\n  f8: (arg: T3) => T9,\n  f9: (arg: T3) => T10\n): (...arg: T1) => T10\nexport function chain<\n  T1 extends any[],\n  T2,\n  T3,\n  T4,\n  T5,\n  T6,\n  T7,\n  T8,\n  T9,\n  T10,\n  T11\n>(\n  f1: (...arg: T1) => T2,\n  f2: (arg: T2) => T3,\n  f3: (arg: T3) => T4,\n  f4: (arg: T3) => T5,\n  f5: (arg: T3) => T6,\n  f6: (arg: T3) => T7,\n  f7: (arg: T3) => T8,\n  f8: (arg: T3) => T9,\n  f9: (arg: T3) => T10,\n  f10: (arg: T3) => T11\n): (...arg: T1) => T11\nexport function chain(...funcs: ((...args: any[]) => any)[]) {\n  return (...args: any[]) => {\n    return funcs.slice(1).reduce((acc, fn) => fn(acc), funcs[0](...args))\n  }\n}\n\nexport function compose<\n  F1Result,\n  F1Args extends any[],\n  F1NextArgs extends any[],\n  LastResult\n>(\n  f1: (\n    next: (...args: F1NextArgs) => LastResult\n  ) => (...args: F1Args) => F1Result,\n  last: (...args: F1NextArgs) => LastResult\n): (...args: F1Args) => F1Result\n\nexport function compose<\n  F1Result,\n  F1Args extends any[],\n  F1NextArgs extends any[],\n  F2Result,\n  F2NextArgs extends any[],\n  LastResult\n>(\n  f1: (\n    next: (...args: F1NextArgs) => F2Result\n  ) => (...args: F1Args) => F1Result,\n  f2: (\n    next: (...args: F2NextArgs) => LastResult\n  ) => (...args: F1NextArgs) => F2Result,\n  last: (...args: F2NextArgs) => LastResult\n): (...args: F1Args) => F1Result\n\nexport function compose<\n  F1Result,\n  F1Args extends any[],\n  F1NextArgs extends any[],\n  F2NextArgs extends any[],\n  F2Result,\n  F3NextArgs extends any[],\n  F3Result,\n  LastResult\n>(\n  f1: (\n    next: (...args: F1NextArgs) => F2Result\n  ) => (...args: F1Args) => F1Result,\n  f2: (\n    next: (...args: F2NextArgs) => F3Result\n  ) => (...args: F1NextArgs) => F2Result,\n  f3: (\n    next: (...args: F3NextArgs) => LastResult\n  ) => (...args: F2NextArgs) => F3Result,\n  last: (...args: F3NextArgs) => LastResult\n): (...args: F1Args) => F1Result\n\nexport function compose<\n  F1Result,\n  F1Args extends any[],\n  F1NextArgs extends any[],\n  F2NextArgs extends any[],\n  F2Result,\n  F3NextArgs extends any[],\n  F3Result,\n  F4NextArgs extends any[],\n  F4Result,\n  LastResult\n>(\n  f1: (\n    next: (...args: F1NextArgs) => F2Result\n  ) => (...args: F1Args) => F1Result,\n  f2: (\n    next: (...args: F2NextArgs) => F3Result\n  ) => (...args: F1NextArgs) => F2Result,\n  f3: (\n    next: (...args: F3NextArgs) => F4Result\n  ) => (...args: F2NextArgs) => F3Result,\n  f4: (\n    next: (...args: F4NextArgs) => LastResult\n  ) => (...args: F3NextArgs) => F4Result,\n  last: (...args: F4NextArgs) => LastResult\n): (...args: F1Args) => F1Result\n\nexport function compose<\n  F1Result,\n  F1Args extends any[],\n  F1NextArgs extends any[],\n  F2NextArgs extends any[],\n  F2Result,\n  F3NextArgs extends any[],\n  F3Result,\n  F4NextArgs extends any[],\n  F4Result,\n  F5NextArgs extends any[],\n  F5Result,\n  LastResult\n>(\n  f1: (\n    next: (...args: F1NextArgs) => F2Result\n  ) => (...args: F1Args) => F1Result,\n  f2: (\n    next: (...args: F2NextArgs) => F3Result\n  ) => (...args: F1NextArgs) => F2Result,\n  f3: (\n    next: (...args: F3NextArgs) => F4Result\n  ) => (...args: F2NextArgs) => F3Result,\n  f4: (\n    next: (...args: F4NextArgs) => F5Result\n  ) => (...args: F3NextArgs) => F4Result,\n  f5: (\n    next: (...args: F5NextArgs) => LastResult\n  ) => (...args: F4NextArgs) => F5Result,\n  last: (...args: F5NextArgs) => LastResult\n): (...args: F1Args) => F1Result\n\nexport function compose<\n  F1Result,\n  F1Args extends any[],\n  F1NextArgs extends any[],\n  F2NextArgs extends any[],\n  F2Result,\n  F3NextArgs extends any[],\n  F3Result,\n  F4NextArgs extends any[],\n  F4Result,\n  F5NextArgs extends any[],\n  F5Result,\n  F6NextArgs extends any[],\n  F6Result,\n  LastResult\n>(\n  f1: (\n    next: (...args: F1NextArgs) => F2Result\n  ) => (...args: F1Args) => F1Result,\n  f2: (\n    next: (...args: F2NextArgs) => F3Result\n  ) => (...args: F1NextArgs) => F2Result,\n  f3: (\n    next: (...args: F3NextArgs) => F4Result\n  ) => (...args: F2NextArgs) => F3Result,\n  f4: (\n    next: (...args: F4NextArgs) => F5Result\n  ) => (...args: F3NextArgs) => F4Result,\n  f5: (\n    next: (...args: F5NextArgs) => F6Result\n  ) => (...args: F4NextArgs) => F5Result,\n  f6: (\n    next: (...args: F6NextArgs) => LastResult\n  ) => (...args: F5NextArgs) => F6Result,\n  last: (...args: F6NextArgs) => LastResult\n): (...args: F1Args) => F1Result\n\nexport function compose<\n  F1Result,\n  F1Args extends any[],\n  F1NextArgs extends any[],\n  F2NextArgs extends any[],\n  F2Result,\n  F3NextArgs extends any[],\n  F3Result,\n  F4NextArgs extends any[],\n  F4Result,\n  F5NextArgs extends any[],\n  F5Result,\n  F6NextArgs extends any[],\n  F6Result,\n  F7NextArgs extends any[],\n  F7Result,\n  LastResult\n>(\n  f1: (\n    next: (...args: F1NextArgs) => F2Result\n  ) => (...args: F1Args) => F1Result,\n  f2: (\n    next: (...args: F2NextArgs) => F3Result\n  ) => (...args: F1NextArgs) => F2Result,\n  f3: (\n    next: (...args: F3NextArgs) => F4Result\n  ) => (...args: F2NextArgs) => F3Result,\n  f4: (\n    next: (...args: F4NextArgs) => F5Result\n  ) => (...args: F3NextArgs) => F4Result,\n  f5: (\n    next: (...args: F5NextArgs) => F6Result\n  ) => (...args: F4NextArgs) => F5Result,\n  f6: (\n    next: (...args: F6NextArgs) => F7Result\n  ) => (...args: F5NextArgs) => F6Result,\n  f7: (\n    next: (...args: F7NextArgs) => LastResult\n  ) => (...args: F6NextArgs) => F7Result,\n  last: (...args: F7NextArgs) => LastResult\n): (...args: F1Args) => F1Result\n\nexport function compose<\n  F1Result,\n  F1Args extends any[],\n  F1NextArgs extends any[],\n  F2NextArgs extends any[],\n  F2Result,\n  F3NextArgs extends any[],\n  F3Result,\n  F4NextArgs extends any[],\n  F4Result,\n  F5NextArgs extends any[],\n  F5Result,\n  F6NextArgs extends any[],\n  F6Result,\n  F7NextArgs extends any[],\n  F7Result,\n  F8NextArgs extends any[],\n  F8Result,\n  LastResult\n>(\n  f1: (\n    next: (...args: F1NextArgs) => F2Result\n  ) => (...args: F1Args) => F1Result,\n  f2: (\n    next: (...args: F2NextArgs) => F3Result\n  ) => (...args: F1NextArgs) => F2Result,\n  f3: (\n    next: (...args: F3NextArgs) => F4Result\n  ) => (...args: F2NextArgs) => F3Result,\n  f4: (\n    next: (...args: F4NextArgs) => F5Result\n  ) => (...args: F3NextArgs) => F4Result,\n  f5: (\n    next: (...args: F5NextArgs) => F6Result\n  ) => (...args: F4NextArgs) => F5Result,\n  f6: (\n    next: (...args: F6NextArgs) => F7Result\n  ) => (...args: F5NextArgs) => F6Result,\n  f7: (\n    next: (...args: F7NextArgs) => LastResult\n  ) => (...args: F6NextArgs) => F7Result,\n  f8: (\n    next: (...args: F8NextArgs) => LastResult\n  ) => (...args: F7NextArgs) => F8Result,\n  last: (...args: F8NextArgs) => LastResult\n): (...args: F1Args) => F1Result\n\nexport function compose<\n  F1Result,\n  F1Args extends any[],\n  F1NextArgs extends any[],\n  F2NextArgs extends any[],\n  F2Result,\n  F3NextArgs extends any[],\n  F3Result,\n  F4NextArgs extends any[],\n  F4Result,\n  F5NextArgs extends any[],\n  F5Result,\n  F6NextArgs extends any[],\n  F6Result,\n  F7NextArgs extends any[],\n  F7Result,\n  F8NextArgs extends any[],\n  F8Result,\n  F9NextArgs extends any[],\n  F9Result,\n  LastResult\n>(\n  f1: (\n    next: (...args: F1NextArgs) => F2Result\n  ) => (...args: F1Args) => F1Result,\n  f2: (\n    next: (...args: F2NextArgs) => F3Result\n  ) => (...args: F1NextArgs) => F2Result,\n  f3: (\n    next: (...args: F3NextArgs) => F4Result\n  ) => (...args: F2NextArgs) => F3Result,\n  f4: (\n    next: (...args: F4NextArgs) => F5Result\n  ) => (...args: F3NextArgs) => F4Result,\n  f5: (\n    next: (...args: F5NextArgs) => F6Result\n  ) => (...args: F4NextArgs) => F5Result,\n  f6: (\n    next: (...args: F6NextArgs) => F7Result\n  ) => (...args: F5NextArgs) => F6Result,\n  f7: (\n    next: (...args: F7NextArgs) => LastResult\n  ) => (...args: F6NextArgs) => F7Result,\n  f8: (\n    next: (...args: F8NextArgs) => LastResult\n  ) => (...args: F7NextArgs) => F8Result,\n  f9: (\n    next: (...args: F9NextArgs) => LastResult\n  ) => (...args: F8NextArgs) => F9Result,\n  last: (...args: F9NextArgs) => LastResult\n): (...args: F1Args) => F1Result\n\nexport function compose(...funcs: ((...args: any[]) => any)[]) {\n  return funcs.reverse().reduce((acc, fn) => fn(acc))\n}\n\n/**\n * This type produces the type array of TItems with all the type items\n * in TItemsToRemove removed from the start of the array type.\n *\n * @example\n * ```\n * RemoveItemsInFront<[number, number], [number]> = [number]\n * RemoveItemsInFront<[File, number, string], [File, number]> = [string]\n * ```\n */\ntype RemoveItemsInFront<\n  TItems extends any[],\n  TItemsToRemove extends any[]\n> = TItems extends [...TItemsToRemove, ...infer TRest] ? TRest : TItems\n\nexport const partial = <T extends any[], TA extends Partial<T>, R>(\n  fn: (...args: T) => R,\n  ...args: TA\n) => {\n  return (...rest: RemoveItemsInFront<T, TA>) =>\n    fn(...([...args, ...rest] as T))\n}\n/**\n * Like partial but for unary functions that accept\n * a single object argument\n */\nexport const partob = <T, K, PartialArgs extends Partial<T>>(\n  fn: (args: T) => K,\n  argobj: PartialArgs\n) => {\n  return (restobj: Omit<T, keyof PartialArgs>): K =>\n    fn({\n      ...(argobj as Partial<T>),\n      ...(restobj as Partial<T>)\n    } as T)\n}\n\n/**\n * Creates a Proxy object that will dynamically\n * call the handler argument when attributes are\n * accessed\n */\nexport const proxied = <T, K>(\n  handler: (propertyName: T) => K\n): Record<string, K> => {\n  return new Proxy(\n    {},\n    {\n      get: (target, propertyName: any) => handler(propertyName)\n    }\n  )\n}\n\ntype Cache<T> = Record<string, { exp: number | null; value: T }>\n\nconst memoize = <TArgs extends any[], TResult>(\n  cache: Cache<TResult>,\n  func: (...args: TArgs) => TResult,\n  keyFunc: ((...args: TArgs) => string) | null,\n  ttl: number | null\n) => {\n  return function callWithMemo(...args: any): TResult {\n    const key = keyFunc ? keyFunc(...args) : JSON.stringify({ args })\n    const existing = cache[key]\n    if (existing !== undefined) {\n      if (!existing.exp) return existing.value\n      if (existing.exp > new Date().getTime()) {\n        return existing.value\n      }\n    }\n    const result = func(...args)\n    cache[key] = {\n      exp: ttl ? new Date().getTime() + ttl : null,\n      value: result\n    }\n    return result\n  }\n}\n\n/**\n * Creates a memoized function. The returned function\n * will only execute the source function when no value\n * has previously been computed. If a ttl (milliseconds)\n * is given previously computed values will be checked\n * for expiration before being returned.\n */\nexport const memo = <TArgs extends any[], TResult>(\n  func: (...args: TArgs) => TResult,\n  options: {\n    key?: (...args: TArgs) => string\n    ttl?: number\n  } = {}\n) => {\n  return memoize({}, func, options.key ?? null, options.ttl ?? null) as (\n    ...args: TArgs\n  ) => TResult\n}\n\nexport type DebounceFunction<TArgs extends any[]> = {\n  (...args: TArgs): void\n  /**\n   * Cancels the debounced function\n   */\n  cancel(): void\n  /**\n   * Checks if there is any invocation debounced\n   */\n  isPending(): boolean\n  /**\n   * Runs the debounced function immediately\n   */\n  flush(...args: TArgs): void\n}\n\nexport type ThrottledFunction<TArgs extends any[]> = {\n  (...args: TArgs): void\n  /**\n   * Checks if there is any invocation throttled\n   */\n  isThrottled(): boolean\n}\n\n/**\n * Given a delay and a function returns a new function\n * that will only call the source function after delay\n * milliseconds have passed without any invocations.\n *\n * The debounce function comes with a `cancel` method\n * to cancel delayed `func` invocations and a `flush`\n * method to invoke them immediately\n */\nexport const debounce = <TArgs extends any[]>(\n  { delay }: { delay: number },\n  func: (...args: TArgs) => any\n) => {\n  let timer: unknown = undefined\n  let active = true\n\n  const debounced: DebounceFunction<TArgs> = (...args: TArgs) => {\n    if (active) {\n      clearTimeout(timer)\n      timer = setTimeout(() => {\n        active && func(...args)\n        timer = undefined\n      }, delay)\n    } else {\n      func(...args)\n    }\n  }\n  debounced.isPending = () => {\n    return timer !== undefined\n  }\n  debounced.cancel = () => {\n    active = false\n  }\n  debounced.flush = (...args: TArgs) => func(...args)\n\n  return debounced\n}\n\n/**\n * Given an interval and a function returns a new function\n * that will only call the source function if interval milliseconds\n * have passed since the last invocation\n */\nexport const throttle = <TArgs extends any[]>(\n  { interval }: { interval: number },\n  func: (...args: TArgs) => any\n) => {\n  let ready = true\n  let timer: unknown = undefined\n\n  const throttled: ThrottledFunction<TArgs> = (...args: TArgs) => {\n    if (!ready) return\n    func(...args)\n    ready = false\n    timer = setTimeout(() => {\n      ready = true\n      timer = undefined\n    }, interval)\n  }\n  throttled.isThrottled = () => {\n    return timer !== undefined\n  }\n  return throttled\n}\n\n/**\n * Make an object callable. Given an object and a function\n * the returned object will be a function with all the\n * objects properties.\n *\n * @example\n * ```typescript\n * const car = callable({\n *   wheels: 2\n * }, self => () => {\n *   return 'driving'\n * })\n *\n * car.wheels // => 2\n * car() // => 'driving'\n * ```\n */\nexport const callable = <\n  TValue,\n  TObj extends Record<string | number | symbol, TValue>,\n  TFunc extends (...args: any) => any\n>(\n  obj: TObj,\n  fn: (self: TObj) => TFunc\n): TObj & TFunc => {\n  /* istanbul ignore next */\n  const FUNC = () => {}\n  return new Proxy(Object.assign(FUNC, obj), {\n    get: (target, key: string) => target[key],\n    set: (target, key: string, value: any) => {\n      ;(target as any)[key] = value\n      return true\n    },\n    apply: (target, self, args) => fn(Object.assign({}, target))(...args)\n  }) as unknown as TObj & TFunc\n}\n"],"names":[],"mappings":"AAuFO,SAAS,SAAS,KAAoC,EAAA;AAC3D,EAAA,OAAO,IAAI,IAAgB,KAAA;AACzB,IAAA,OAAO,MAAM,KAAM,CAAA,CAAC,CAAE,CAAA,MAAA,CAAO,CAAC,GAAK,EAAA,EAAA,KAAO,EAAG,CAAA,GAAG,GAAG,KAAM,CAAA,CAAC,CAAE,CAAA,GAAG,IAAI,CAAC,CAAA,CAAA;AAAA,GACtE,CAAA;AACF,CAAA;AAkSO,SAAS,WAAW,KAAoC,EAAA;AAC7D,EAAO,OAAA,KAAA,CAAM,SAAU,CAAA,MAAA,CAAO,CAAC,GAAK,EAAA,EAAA,KAAO,EAAG,CAAA,GAAG,CAAC,CAAA,CAAA;AACpD,CAAA;AAiBa,MAAA,OAAA,GAAU,CACrB,EAAA,EAAA,GACG,IACA,KAAA;AACH,EAAO,OAAA,CAAA,GAAI,SACT,EAAG,CAAA,GAAI,CAAC,GAAG,IAAA,EAAM,GAAG,IAAI,CAAO,CAAA,CAAA;AACnC,EAAA;AAKa,MAAA,MAAA,GAAS,CACpB,EAAA,EACA,MACG,KAAA;AACH,EAAO,OAAA,CAAC,YACN,EAAG,CAAA;AAAA,IACD,GAAI,MAAA;AAAA,IACJ,GAAI,OAAA;AAAA,GACA,CAAA,CAAA;AACV,EAAA;AAOa,MAAA,OAAA,GAAU,CACrB,OACsB,KAAA;AACtB,EAAA,OAAO,IAAI,KAAA;AAAA,IACT,EAAC;AAAA,IACD;AAAA,MACE,GAAK,EAAA,CAAC,MAAQ,EAAA,YAAA,KAAsB,QAAQ,YAAY,CAAA;AAAA,KAC1D;AAAA,GACF,CAAA;AACF,EAAA;AAIA,MAAM,OAAU,GAAA,CACd,KACA,EAAA,IAAA,EACA,SACA,GACG,KAAA;AACH,EAAO,OAAA,SAAS,gBAAgB,IAAoB,EAAA;AAClD,IAAM,MAAA,GAAA,GAAM,OAAU,GAAA,OAAA,CAAQ,GAAG,IAAI,IAAI,IAAK,CAAA,SAAA,CAAU,EAAE,IAAA,EAAM,CAAA,CAAA;AAChE,IAAM,MAAA,QAAA,GAAW,MAAM,GAAG,CAAA,CAAA;AAC1B,IAAA,IAAI,aAAa,KAAW,CAAA,EAAA;AAC1B,MAAA,IAAI,CAAC,QAAS,CAAA,GAAA;AAAK,QAAA,OAAO,QAAS,CAAA,KAAA,CAAA;AACnC,MAAA,IAAI,SAAS,GAAM,GAAA,IAAI,IAAK,EAAA,CAAE,SAAW,EAAA;AACvC,QAAA,OAAO,QAAS,CAAA,KAAA,CAAA;AAAA,OAClB;AAAA,KACF;AACA,IAAM,MAAA,MAAA,GAAS,IAAK,CAAA,GAAG,IAAI,CAAA,CAAA;AAC3B,IAAA,KAAA,CAAM,GAAG,CAAI,GAAA;AAAA,MACX,KAAK,GAAM,GAAA,IAAI,MAAO,CAAA,OAAA,KAAY,GAAM,GAAA,IAAA;AAAA,MACxC,KAAO,EAAA,MAAA;AAAA,KACT,CAAA;AACA,IAAO,OAAA,MAAA,CAAA;AAAA,GACT,CAAA;AACF,CAAA,CAAA;AASO,MAAM,IAAO,GAAA,CAClB,IACA,EAAA,OAAA,GAGI,EACD,KAAA;AACH,EAAO,OAAA,OAAA,CAAQ,EAAI,EAAA,IAAA,EAAM,QAAQ,GAAO,IAAA,IAAA,EAAM,OAAQ,CAAA,GAAA,IAAO,IAAI,CAAA,CAAA;AAGnE,EAAA;AAmCO,MAAM,QAAW,GAAA,CACtB,EAAE,KAAA,IACF,IACG,KAAA;AACH,EAAA,IAAI,KAAiB,GAAA,KAAA,CAAA,CAAA;AACrB,EAAA,IAAI,MAAS,GAAA,IAAA,CAAA;AAEb,EAAM,MAAA,SAAA,GAAqC,IAAI,IAAgB,KAAA;AAC7D,IAAA,IAAI,MAAQ,EAAA;AACV,MAAA,YAAA,CAAa,KAAK,CAAA,CAAA;AAClB,MAAA,KAAA,GAAQ,WAAW,MAAM;AACvB,QAAU,MAAA,IAAA,IAAA,CAAK,GAAG,IAAI,CAAA,CAAA;AACtB,QAAQ,KAAA,GAAA,KAAA,CAAA,CAAA;AAAA,SACP,KAAK,CAAA,CAAA;AAAA,KACH,MAAA;AACL,MAAA,IAAA,CAAK,GAAG,IAAI,CAAA,CAAA;AAAA,KACd;AAAA,GACF,CAAA;AACA,EAAA,SAAA,CAAU,YAAY,MAAM;AAC1B,IAAA,OAAO,KAAU,KAAA,KAAA,CAAA,CAAA;AAAA,GACnB,CAAA;AACA,EAAA,SAAA,CAAU,SAAS,MAAM;AACvB,IAAS,MAAA,GAAA,KAAA,CAAA;AAAA,GACX,CAAA;AACA,EAAA,SAAA,CAAU,KAAQ,GAAA,CAAA,GAAI,IAAgB,KAAA,IAAA,CAAK,GAAG,IAAI,CAAA,CAAA;AAElD,EAAO,OAAA,SAAA,CAAA;AACT,EAAA;AAOO,MAAM,QAAW,GAAA,CACtB,EAAE,QAAA,IACF,IACG,KAAA;AACH,EAAA,IAAI,KAAQ,GAAA,IAAA,CAAA;AACZ,EAAA,IAAI,KAAiB,GAAA,KAAA,CAAA,CAAA;AAErB,EAAM,MAAA,SAAA,GAAsC,IAAI,IAAgB,KAAA;AAC9D,IAAA,IAAI,CAAC,KAAA;AAAO,MAAA,OAAA;AACZ,IAAA,IAAA,CAAK,GAAG,IAAI,CAAA,CAAA;AACZ,IAAQ,KAAA,GAAA,KAAA,CAAA;AACR,IAAA,KAAA,GAAQ,WAAW,MAAM;AACvB,MAAQ,KAAA,GAAA,IAAA,CAAA;AACR,MAAQ,KAAA,GAAA,KAAA,CAAA,CAAA;AAAA,OACP,QAAQ,CAAA,CAAA;AAAA,GACb,CAAA;AACA,EAAA,SAAA,CAAU,cAAc,MAAM;AAC5B,IAAA,OAAO,KAAU,KAAA,KAAA,CAAA,CAAA;AAAA,GACnB,CAAA;AACA,EAAO,OAAA,SAAA,CAAA;AACT,EAAA;AAmBa,MAAA,QAAA,GAAW,CAKtB,GAAA,EACA,EACiB,KAAA;AAEjB,EAAA,MAAM,OAAO,MAAM;AAAA,GAAC,CAAA;AACpB,EAAA,OAAO,IAAI,KAAM,CAAA,MAAA,CAAO,MAAO,CAAA,IAAA,EAAM,GAAG,CAAG,EAAA;AAAA,IACzC,GAAK,EAAA,CAAC,MAAQ,EAAA,GAAA,KAAgB,OAAO,GAAG,CAAA;AAAA,IACxC,GAAK,EAAA,CAAC,MAAQ,EAAA,GAAA,EAAa,KAAe,KAAA;AACvC,MAAC,MAAA,CAAe,GAAG,CAAI,GAAA,KAAA,CAAA;AACxB,MAAO,OAAA,IAAA,CAAA;AAAA,KACT;AAAA,IACA,KAAO,EAAA,CAAC,MAAQ,EAAA,IAAA,EAAM,SAAS,EAAG,CAAA,MAAA,CAAO,MAAO,CAAA,EAAI,EAAA,MAAM,CAAC,CAAA,CAAE,GAAG,IAAI,CAAA;AAAA,GACrE,CAAA,CAAA;AACH;;;;"}

package/dist/esm/index.mjs

@@ -1,10 +0,0 @@
-export { alphabetical, boil, cluster, counting, diff, first, flat, fork, group, intersects, iterate, last, list, max, merge, min, objectify, range, replace, replaceOrAppend, select, shift, sift, sort, sum, toggle, unique, zip, zipToObject } from './array.mjs';
-export { all, defer, guard, map, parallel, reduce, retry, sleep, tryit as try, tryit } from './async.mjs';
-export { callable, chain, compose, debounce, memo, partial, partob, proxied, throttle } from './curry.mjs';
-export { inRange, toFloat, toInt } from './number.mjs';
-export { assign, clone, construct, crush, get, invert, keys, listify, lowerize, mapEntries, mapKeys, mapValues, omit, pick, set, shake, upperize } from './object.mjs';
-export { draw, random, shuffle, uid } from './random.mjs';
-export { series } from './series.mjs';
-export { camel, capitalize, dash, pascal, snake, template, title, trim } from './string.mjs';
-export { isArray, isDate, isEmpty, isEqual, isFloat, isFunction, isInt, isNumber, isObject, isPrimitive, isPromise, isString, isSymbol } from './typed.mjs';
-//# sourceMappingURL=index.mjs.map

package/dist/esm/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;"}

package/dist/esm/number.mjs

@@ -1,30 +0,0 @@
-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;
-  }
-  return number >= Math.min(start, end) && number < Math.max(start, end);
-}
-const toFloat = (value, defaultValue) => {
-  const def = defaultValue === void 0 ? 0 : defaultValue;
-  if (value === null || value === void 0) {
-    return def;
-  }
-  const result = parseFloat(value);
-  return isNaN(result) ? def : result;
-};
-const toInt = (value, defaultValue) => {
-  const def = defaultValue === void 0 ? 0 : defaultValue;
-  if (value === null || value === void 0) {
-    return def;
-  }
-  const result = parseInt(value);
-  return isNaN(result) ? def : result;
-};
-
-export { inRange, toFloat, toInt };
-//# sourceMappingURL=number.mjs.map

package/dist/esm/number.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"number.mjs","sources":["../../src/number.ts"],"sourcesContent":["/**\n * Checks if the given number is between zero (0) and the ending number. 0 is inclusive.\n *\n * * Numbers can be negative or positive.\n * * Ending number is exclusive.\n *\n * @param {number} number The number to check.\n * @param {number} end The end of the range. Exclusive.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n */\nexport function inRange(number: number, end: number): boolean\n\n/**\n * Checks if the given number is between two numbers.\n *\n * * Numbers can be negative or positive.\n * * Starting number is inclusive.\n * * Ending number is exclusive.\n * * The start and the end of the range can be ascending OR descending order.\n *\n * @param {number} number The number to check.\n * @param {number} start The start of the range. Inclusive.\n * @param {number} end The end of the range. Exclusive.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n */\nexport function inRange(number: number, start: number, end: number): boolean\nexport function inRange(number: number, start: number, end?: number): boolean {\n  const isTypeSafe =\n    typeof number === 'number' &&\n    typeof start === 'number' &&\n    (typeof end === 'undefined' || typeof end === 'number')\n\n  if (!isTypeSafe) {\n    return false\n  }\n\n  if (typeof end === 'undefined') {\n    end = start\n    start = 0\n  }\n\n  return number >= Math.min(start, end) && number < Math.max(start, end)\n}\n\nexport const toFloat = <T extends number | null = number>(\n  value: any,\n  defaultValue?: T\n): number | T => {\n  const def = defaultValue === undefined ? 0.0 : defaultValue\n  if (value === null || value === undefined) {\n    return def\n  }\n  const result = parseFloat(value)\n  return isNaN(result) ? def : result\n}\n\nexport const toInt = <T extends number | null = number>(\n  value: any,\n  defaultValue?: T\n): number | T => {\n  const def = defaultValue === undefined ? 0 : defaultValue\n  if (value === null || value === undefined) {\n    return def\n  }\n  const result = parseInt(value)\n  return isNaN(result) ? def : result\n}\n"],"names":[],"mappings":"AA0BgB,SAAA,OAAA,CAAQ,MAAgB,EAAA,KAAA,EAAe,GAAuB,EAAA;AAC5E,EAAM,MAAA,UAAA,GACJ,OAAO,MAAA,KAAW,QAClB,IAAA,OAAO,KAAU,KAAA,QAAA,KAChB,OAAO,GAAA,KAAQ,WAAe,IAAA,OAAO,GAAQ,KAAA,QAAA,CAAA,CAAA;AAEhD,EAAA,IAAI,CAAC,UAAY,EAAA;AACf,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAEA,EAAI,IAAA,OAAO,QAAQ,WAAa,EAAA;AAC9B,IAAM,GAAA,GAAA,KAAA,CAAA;AACN,IAAQ,KAAA,GAAA,CAAA,CAAA;AAAA,GACV;AAEA,EAAO,OAAA,MAAA,IAAU,IAAK,CAAA,GAAA,CAAI,KAAO,EAAA,GAAG,KAAK,MAAS,GAAA,IAAA,CAAK,GAAI,CAAA,KAAA,EAAO,GAAG,CAAA,CAAA;AACvE,CAAA;AAEa,MAAA,OAAA,GAAU,CACrB,KAAA,EACA,YACe,KAAA;AACf,EAAM,MAAA,GAAA,GAAM,YAAiB,KAAA,KAAA,CAAA,GAAY,CAAM,GAAA,YAAA,CAAA;AAC/C,EAAI,IAAA,KAAA,KAAU,IAAQ,IAAA,KAAA,KAAU,KAAW,CAAA,EAAA;AACzC,IAAO,OAAA,GAAA,CAAA;AAAA,GACT;AACA,EAAM,MAAA,MAAA,GAAS,WAAW,KAAK,CAAA,CAAA;AAC/B,EAAO,OAAA,KAAA,CAAM,MAAM,CAAA,GAAI,GAAM,GAAA,MAAA,CAAA;AAC/B,EAAA;AAEa,MAAA,KAAA,GAAQ,CACnB,KAAA,EACA,YACe,KAAA;AACf,EAAM,MAAA,GAAA,GAAM,YAAiB,KAAA,KAAA,CAAA,GAAY,CAAI,GAAA,YAAA,CAAA;AAC7C,EAAI,IAAA,KAAA,KAAU,IAAQ,IAAA,KAAA,KAAU,KAAW,CAAA,EAAA;AACzC,IAAO,OAAA,GAAA,CAAA;AAAA,GACT;AACA,EAAM,MAAA,MAAA,GAAS,SAAS,KAAK,CAAA,CAAA;AAC7B,EAAO,OAAA,KAAA,CAAM,MAAM,CAAA,GAAI,GAAM,GAAA,MAAA,CAAA;AAC/B;;;;"}

package/dist/esm/object.mjs

@@ -1,186 +0,0 @@
-import { objectify } from './array.mjs';
-import { toInt } from './number.mjs';
-import { isPrimitive, isObject, isArray } from './typed.mjs';
-
-const shake = (obj, filter = (x) => x === void 0) => {
-  if (!obj)
-    return {};
-  const keys2 = Object.keys(obj);
-  return keys2.reduce((acc, key) => {
-    if (filter(obj[key])) {
-      return acc;
-    } else {
-      acc[key] = obj[key];
-      return acc;
-    }
-  }, {});
-};
-const mapKeys = (obj, mapFunc) => {
-  const keys2 = Object.keys(obj);
-  return keys2.reduce((acc, key) => {
-    acc[mapFunc(key, obj[key])] = obj[key];
-    return acc;
-  }, {});
-};
-const mapValues = (obj, mapFunc) => {
-  const keys2 = Object.keys(obj);
-  return keys2.reduce((acc, key) => {
-    acc[key] = mapFunc(obj[key], key);
-    return acc;
-  }, {});
-};
-const mapEntries = (obj, toEntry) => {
-  if (!obj)
-    return {};
-  return Object.entries(obj).reduce((acc, [key, value]) => {
-    const [newKey, newValue] = toEntry(key, value);
-    acc[newKey] = newValue;
-    return acc;
-  }, {});
-};
-const invert = (obj) => {
-  if (!obj)
-    return {};
-  const keys2 = Object.keys(obj);
-  return keys2.reduce((acc, key) => {
-    acc[obj[key]] = key;
-    return acc;
-  }, {});
-};
-const lowerize = (obj) => mapKeys(obj, (k) => k.toLowerCase());
-const upperize = (obj) => mapKeys(obj, (k) => k.toUpperCase());
-const clone = (obj) => {
-  if (isPrimitive(obj)) {
-    return obj;
-  }
-  if (typeof obj === "function") {
-    return obj.bind({});
-  }
-  const newObj = new obj.constructor();
-  Object.getOwnPropertyNames(obj).forEach((prop) => {
-    newObj[prop] = obj[prop];
-  });
-  return newObj;
-};
-const listify = (obj, toItem) => {
-  if (!obj)
-    return [];
-  const entries = Object.entries(obj);
-  if (entries.length === 0)
-    return [];
-  return entries.reduce((acc, entry) => {
-    acc.push(toItem(entry[0], entry[1]));
-    return acc;
-  }, []);
-};
-const pick = (obj, keys2) => {
-  if (!obj)
-    return {};
-  return keys2.reduce((acc, key) => {
-    if (Object.prototype.hasOwnProperty.call(obj, key))
-      acc[key] = obj[key];
-    return acc;
-  }, {});
-};
-const omit = (obj, keys2) => {
-  if (!obj)
-    return {};
-  if (!keys2 || keys2.length === 0)
-    return obj;
-  return keys2.reduce(
-    (acc, key) => {
-      delete acc[key];
-      return acc;
-    },
-    { ...obj }
-  );
-};
-const get = (value, path, defaultValue) => {
-  const segments = path.split(/[\.\[\]]/g);
-  let current = value;
-  for (const key of segments) {
-    if (current === null)
-      return defaultValue;
-    if (current === void 0)
-      return defaultValue;
-    const dequoted = key.replace(/['"]/g, "");
-    if (dequoted.trim() === "")
-      continue;
-    current = current[dequoted];
-  }
-  if (current === void 0)
-    return defaultValue;
-  return current;
-};
-const set = (initial, path, value) => {
-  if (!initial)
-    return {};
-  if (!path || value === void 0)
-    return initial;
-  const segments = path.split(/[\.\[\]]/g).filter((x) => !!x.trim());
-  const _set = (node) => {
-    if (segments.length > 1) {
-      const key = segments.shift();
-      const nextIsNum = toInt(segments[0], null) === null ? false : true;
-      node[key] = node[key] === void 0 ? nextIsNum ? [] : {} : node[key];
-      _set(node[key]);
-    } else {
-      node[segments[0]] = value;
-    }
-  };
-  const cloned = clone(initial);
-  _set(cloned);
-  return cloned;
-};
-const assign = (initial, override) => {
-  if (!initial || !override)
-    return initial ?? override ?? {};
-  return Object.entries({ ...initial, ...override }).reduce(
-    (acc, [key, value]) => {
-      return {
-        ...acc,
-        [key]: (() => {
-          if (isObject(initial[key]))
-            return assign(initial[key], value);
-          return value;
-        })()
-      };
-    },
-    {}
-  );
-};
-const keys = (value) => {
-  if (!value)
-    return [];
-  const getKeys = (nested, paths) => {
-    if (isObject(nested)) {
-      return Object.entries(nested).flatMap(
-        ([k, v]) => getKeys(v, [...paths, k])
-      );
-    }
-    if (isArray(nested)) {
-      return nested.flatMap((item, i) => getKeys(item, [...paths, `${i}`]));
-    }
-    return [paths.join(".")];
-  };
-  return getKeys(value, []);
-};
-const crush = (value) => {
-  if (!value)
-    return {};
-  return objectify(
-    keys(value),
-    (k) => k,
-    (k) => get(value, k)
-  );
-};
-const construct = (obj) => {
-  if (!obj)
-    return {};
-  return Object.keys(obj).reduce((acc, path) => {
-    return set(acc, path, obj[path]);
-  }, {});
-};
-
-export { assign, clone, construct, crush, get, invert, keys, listify, lowerize, mapEntries, mapKeys, mapValues, omit, pick, set, shake, upperize };
-//# sourceMappingURL=object.mjs.map

package/dist/esm/object.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"object.mjs","sources":["../../src/object.ts"],"sourcesContent":["import { objectify } from './array'\nimport { toInt } from './number'\nimport { isArray, isObject, isPrimitive } from './typed'\n\ntype LowercasedKeys<T extends Record<string, any>> = {\n  [P in keyof T & string as Lowercase<P>]: T[P]\n}\n\ntype UppercasedKeys<T extends Record<string, any>> = {\n  [P in keyof T & string as Uppercase<P>]: T[P]\n}\n\n/**\n * Removes (shakes out) undefined entries from an\n * object. Optional second argument shakes out values\n * by custom evaluation.\n */\nexport const shake = <RemovedKeys extends string, T>(\n  obj: T,\n  filter: (value: any) => boolean = x => x === undefined\n): Omit<T, RemovedKeys> => {\n  if (!obj) return {} as T\n  const keys = Object.keys(obj) as (keyof T)[]\n  return keys.reduce((acc, key) => {\n    if (filter(obj[key])) {\n      return acc\n    } else {\n      acc[key] = obj[key]\n      return acc\n    }\n  }, {} as T)\n}\n\n/**\n * Map over all the keys of an object to return\n * a new object\n */\nexport const mapKeys = <\n  TValue,\n  TKey extends string | number | symbol,\n  TNewKey extends string | number | symbol\n>(\n  obj: Record<TKey, TValue>,\n  mapFunc: (key: TKey, value: TValue) => TNewKey\n): Record<TNewKey, TValue> => {\n  const keys = Object.keys(obj) as TKey[]\n  return keys.reduce((acc, key) => {\n    acc[mapFunc(key as TKey, obj[key])] = obj[key]\n    return acc\n  }, {} as Record<TNewKey, TValue>)\n}\n\n/**\n * Map over all the keys to create a new object\n */\nexport const mapValues = <\n  TValue,\n  TKey extends string | number | symbol,\n  TNewValue\n>(\n  obj: Record<TKey, TValue>,\n  mapFunc: (value: TValue, key: TKey) => TNewValue\n): Record<TKey, TNewValue> => {\n  const keys = Object.keys(obj) as TKey[]\n  return keys.reduce((acc, key) => {\n    acc[key] = mapFunc(obj[key], key)\n    return acc\n  }, {} as Record<TKey, TNewValue>)\n}\n\n/**\n * Map over all the keys to create a new object\n */\nexport const mapEntries = <\n  TKey extends string | number | symbol,\n  TValue,\n  TNewKey extends string | number | symbol,\n  TNewValue\n>(\n  obj: Record<TKey, TValue>,\n  toEntry: (key: TKey, value: TValue) => [TNewKey, TNewValue]\n): Record<TNewKey, TNewValue> => {\n  if (!obj) return {} as Record<TNewKey, TNewValue>\n  return Object.entries(obj).reduce((acc, [key, value]) => {\n    const [newKey, newValue] = toEntry(key as TKey, value as TValue)\n    acc[newKey] = newValue\n    return acc\n  }, {} as Record<TNewKey, TNewValue>)\n}\n\n/**\n * Returns an object with { [keys]: value }\n * inverted as { [value]: key }\n */\nexport const invert = <\n  TKey extends string | number | symbol,\n  TValue extends string | number | symbol\n>(\n  obj: Record<TKey, TValue>\n): Record<TValue, TKey> => {\n  if (!obj) return {} as Record<TValue, TKey>\n  const keys = Object.keys(obj) as TKey[]\n  return keys.reduce((acc, key) => {\n    acc[obj[key]] = key\n    return acc\n  }, {} as Record<TValue, TKey>)\n}\n\n/**\n * Convert all keys in an object to lower case\n */\nexport const lowerize = <T extends Record<string, any>>(obj: T) =>\n  mapKeys(obj, k => k.toLowerCase()) as LowercasedKeys<T>\n\n/**\n * Convert all keys in an object to upper case\n */\nexport const upperize = <T extends Record<string, any>>(obj: T) =>\n  mapKeys(obj, k => k.toUpperCase()) as UppercasedKeys<T>\n\n/**\n * Creates a shallow copy of the given obejct/value.\n * @param {*} obj value to clone\n * @returns {*} shallow clone of the given value\n */\nexport const clone = <T>(obj: T): T => {\n  // Primitive values do not need cloning.\n  if (isPrimitive(obj)) {\n    return obj\n  }\n\n  // Binding a function to an empty object creates a\n  // copy function.\n  if (typeof obj === 'function') {\n    return obj.bind({})\n  }\n\n  // Access the constructor and create a new object.\n  // This method can create an array as well.\n  const newObj = new ((obj as object).constructor as { new (): T })()\n\n  // Assign the props.\n  Object.getOwnPropertyNames(obj).forEach(prop => {\n    // Bypass type checking since the primitive cases\n    // are already checked in the beginning\n    ;(newObj as any)[prop] = (obj as any)[prop]\n  })\n\n  return newObj\n}\n\n/**\n * Convert an object to a list, mapping each entry\n * into a list item\n */\nexport const listify = <TValue, TKey extends string | number | symbol, KResult>(\n  obj: Record<TKey, TValue>,\n  toItem: (key: TKey, value: TValue) => KResult\n) => {\n  if (!obj) return []\n  const entries = Object.entries(obj)\n  if (entries.length === 0) return []\n  return entries.reduce((acc, entry) => {\n    acc.push(toItem(entry[0] as TKey, entry[1] as TValue))\n    return acc\n  }, [] as KResult[])\n}\n\n/**\n * Pick a list of properties from an object\n * into a new object\n */\nexport const pick = <T extends object, TKeys extends keyof T>(\n  obj: T,\n  keys: TKeys[]\n): Pick<T, TKeys> => {\n  if (!obj) return {} as Pick<T, TKeys>\n  return keys.reduce((acc, key) => {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) acc[key] = obj[key]\n    return acc\n  }, {} as Pick<T, TKeys>)\n}\n\n/**\n * Omit a list of properties from an object\n * returning a new object with the properties\n * that remain\n */\nexport const omit = <T, TKeys extends keyof T>(\n  obj: T,\n  keys: TKeys[]\n): Omit<T, TKeys> => {\n  if (!obj) return {} as Omit<T, TKeys>\n  if (!keys || keys.length === 0) return obj as Omit<T, TKeys>\n  return keys.reduce(\n    (acc, key) => {\n      // Gross, I know, it's mutating the object, but we\n      // are allowing it in this very limited scope due\n      // to the performance implications of an omit func.\n      // Not a pattern or practice to use elsewhere.\n      delete acc[key]\n      return acc\n    },\n    { ...obj }\n  )\n}\n\n/**\n * Dynamically get a nested value from an array or\n * object with a string.\n *\n * @example get(person, 'friends[0].name')\n */\nexport const get = <TDefault = unknown>(\n  value: any,\n  path: string,\n  defaultValue?: TDefault\n): TDefault => {\n  const segments = path.split(/[\\.\\[\\]]/g)\n  let current: any = value\n  for (const key of segments) {\n    if (current === null) return defaultValue as TDefault\n    if (current === undefined) return defaultValue as TDefault\n    const dequoted = key.replace(/['\"]/g, '')\n    if (dequoted.trim() === '') continue\n    current = current[dequoted]\n  }\n  if (current === undefined) return defaultValue as TDefault\n  return current\n}\n\n/**\n * Opposite of get, dynamically set a nested value into\n * an object using a key path. Does not modify the given\n * initial object.\n *\n * @example\n * set({}, 'name', 'ra') // => { name: 'ra' }\n * set({}, 'cards[0].value', 2) // => { cards: [{ value: 2 }] }\n */\nexport const set = <T extends object, K>(\n  initial: T,\n  path: string,\n  value: K\n): T => {\n  if (!initial) return {} as T\n  if (!path || value === undefined) return initial\n  const segments = path.split(/[\\.\\[\\]]/g).filter(x => !!x.trim())\n  const _set = (node: any) => {\n    if (segments.length > 1) {\n      const key = segments.shift() as string\n      const nextIsNum = toInt(segments[0], null) === null ? false : true\n      node[key] = node[key] === undefined ? (nextIsNum ? [] : {}) : node[key]\n      _set(node[key])\n    } else {\n      node[segments[0]] = value\n    }\n  }\n  // NOTE: One day, when structuredClone has more\n  // compatability use it to clone the value\n  // https://developer.mozilla.org/en-US/docs/Web/API/structuredClone\n  const cloned = clone(initial)\n  _set(cloned)\n  return cloned\n}\n\n/**\n * Merges two objects together recursivly into a new\n * object applying values from right to left.\n * Recursion only applies to child object properties.\n */\nexport const assign = <X extends Record<string | symbol | number, any>>(\n  initial: X,\n  override: X\n): X => {\n  if (!initial || !override) return initial ?? override ?? {}\n\n  return Object.entries({ ...initial, ...override }).reduce(\n    (acc, [key, value]) => {\n      return {\n        ...acc,\n        [key]: (() => {\n          if (isObject(initial[key])) return assign(initial[key], value)\n          // if (isArray(value)) return value.map(x => assign)\n          return value\n        })()\n      }\n    },\n    {} as X\n  )\n}\n\n/**\n * Get a string list of all key names that exist in\n * an object (deep).\n *\n * @example\n * keys({ name: 'ra' }) // ['name']\n * keys({ name: 'ra', children: [{ name: 'hathor' }] }) // ['name', 'children.0.name']\n */\nexport const keys = <TValue extends object>(value: TValue): string[] => {\n  if (!value) return []\n  const getKeys = (nested: any, paths: string[]): string[] => {\n    if (isObject(nested)) {\n      return Object.entries(nested).flatMap(([k, v]) =>\n        getKeys(v, [...paths, k])\n      )\n    }\n    if (isArray(nested)) {\n      return nested.flatMap((item, i) => getKeys(item, [...paths, `${i}`]))\n    }\n    return [paths.join('.')]\n  }\n  return getKeys(value, [])\n}\n\n/**\n * Flattens a deep object to a single demension, converting\n * the keys to dot notation.\n *\n * @example\n * crush({ name: 'ra', children: [{ name: 'hathor' }] })\n * // { name: 'ra', 'children.0.name': 'hathor' }\n */\nexport const crush = <TValue extends object>(value: TValue): object => {\n  if (!value) return {}\n  return objectify(\n    keys(value),\n    k => k,\n    k => get(value, k)\n  )\n}\n\n/**\n * The opposite of crush, given an object that was\n * crushed into key paths and values will return\n * the original object reconstructed.\n *\n * @example\n * construct({ name: 'ra', 'children.0.name': 'hathor' })\n * // { name: 'ra', children: [{ name: 'hathor' }] }\n */\nexport const construct = <TObject extends object>(obj: TObject): object => {\n  if (!obj) return {}\n  return Object.keys(obj).reduce((acc, path) => {\n    return set(acc, path, (obj as any)[path])\n  }, {})\n}\n"],"names":["keys"],"mappings":";;;;AAiBO,MAAM,QAAQ,CACnB,GAAA,EACA,MAAkC,GAAA,CAAA,CAAA,KAAK,MAAM,KACpB,CAAA,KAAA;AACzB,EAAA,IAAI,CAAC,GAAA;AAAK,IAAA,OAAO,EAAC,CAAA;AAClB,EAAMA,MAAAA,KAAAA,GAAO,MAAO,CAAA,IAAA,CAAK,GAAG,CAAA,CAAA;AAC5B,EAAA,OAAOA,KAAK,CAAA,MAAA,CAAO,CAAC,GAAA,EAAK,GAAQ,KAAA;AAC/B,IAAA,IAAI,MAAO,CAAA,GAAA,CAAI,GAAG,CAAC,CAAG,EAAA;AACpB,MAAO,OAAA,GAAA,CAAA;AAAA,KACF,MAAA;AACL,MAAI,GAAA,CAAA,GAAG,CAAI,GAAA,GAAA,CAAI,GAAG,CAAA,CAAA;AAClB,MAAO,OAAA,GAAA,CAAA;AAAA,KACT;AAAA,GACF,EAAG,EAAO,CAAA,CAAA;AACZ,EAAA;AAMa,MAAA,OAAA,GAAU,CAKrB,GAAA,EACA,OAC4B,KAAA;AAC5B,EAAMA,MAAAA,KAAAA,GAAO,MAAO,CAAA,IAAA,CAAK,GAAG,CAAA,CAAA;AAC5B,EAAA,OAAOA,KAAK,CAAA,MAAA,CAAO,CAAC,GAAA,EAAK,GAAQ,KAAA;AAC/B,IAAI,GAAA,CAAA,OAAA,CAAQ,KAAa,GAAI,CAAA,GAAG,CAAC,CAAC,CAAA,GAAI,IAAI,GAAG,CAAA,CAAA;AAC7C,IAAO,OAAA,GAAA,CAAA;AAAA,GACT,EAAG,EAA6B,CAAA,CAAA;AAClC,EAAA;AAKa,MAAA,SAAA,GAAY,CAKvB,GAAA,EACA,OAC4B,KAAA;AAC5B,EAAMA,MAAAA,KAAAA,GAAO,MAAO,CAAA,IAAA,CAAK,GAAG,CAAA,CAAA;AAC5B,EAAA,OAAOA,KAAK,CAAA,MAAA,CAAO,CAAC,GAAA,EAAK,GAAQ,KAAA;AAC/B,IAAA,GAAA,CAAI,GAAG,CAAI,GAAA,OAAA,CAAQ,GAAI,CAAA,GAAG,GAAG,GAAG,CAAA,CAAA;AAChC,IAAO,OAAA,GAAA,CAAA;AAAA,GACT,EAAG,EAA6B,CAAA,CAAA;AAClC,EAAA;AAKa,MAAA,UAAA,GAAa,CAMxB,GAAA,EACA,OAC+B,KAAA;AAC/B,EAAA,IAAI,CAAC,GAAA;AAAK,IAAA,OAAO,EAAC,CAAA;AAClB,EAAO,OAAA,MAAA,CAAO,OAAQ,CAAA,GAAG,CAAE,CAAA,MAAA,CAAO,CAAC,GAAK,EAAA,CAAC,GAAK,EAAA,KAAK,CAAM,KAAA;AACvD,IAAA,MAAM,CAAC,MAAQ,EAAA,QAAQ,CAAI,GAAA,OAAA,CAAQ,KAAa,KAAe,CAAA,CAAA;AAC/D,IAAA,GAAA,CAAI,MAAM,CAAI,GAAA,QAAA,CAAA;AACd,IAAO,OAAA,GAAA,CAAA;AAAA,GACT,EAAG,EAAgC,CAAA,CAAA;AACrC,EAAA;AAMa,MAAA,MAAA,GAAS,CAIpB,GACyB,KAAA;AACzB,EAAA,IAAI,CAAC,GAAA;AAAK,IAAA,OAAO,EAAC,CAAA;AAClB,EAAMA,MAAAA,KAAAA,GAAO,MAAO,CAAA,IAAA,CAAK,GAAG,CAAA,CAAA;AAC5B,EAAA,OAAOA,KAAK,CAAA,MAAA,CAAO,CAAC,GAAA,EAAK,GAAQ,KAAA;AAC/B,IAAI,GAAA,CAAA,GAAA,CAAI,GAAG,CAAC,CAAI,GAAA,GAAA,CAAA;AAChB,IAAO,OAAA,GAAA,CAAA;AAAA,GACT,EAAG,EAA0B,CAAA,CAAA;AAC/B,EAAA;AAKa,MAAA,QAAA,GAAW,CAAgC,GACtD,KAAA,OAAA,CAAQ,KAAK,CAAK,CAAA,KAAA,CAAA,CAAE,aAAa,EAAA;AAKtB,MAAA,QAAA,GAAW,CAAgC,GACtD,KAAA,OAAA,CAAQ,KAAK,CAAK,CAAA,KAAA,CAAA,CAAE,aAAa,EAAA;AAOtB,MAAA,KAAA,GAAQ,CAAI,GAAc,KAAA;AAErC,EAAI,IAAA,WAAA,CAAY,GAAG,CAAG,EAAA;AACpB,IAAO,OAAA,GAAA,CAAA;AAAA,GACT;AAIA,EAAI,IAAA,OAAO,QAAQ,UAAY,EAAA;AAC7B,IAAO,OAAA,GAAA,CAAI,IAAK,CAAA,EAAE,CAAA,CAAA;AAAA,GACpB;AAIA,EAAM,MAAA,MAAA,GAAS,IAAM,GAAA,CAAe,WAA8B,EAAA,CAAA;AAGlE,EAAA,MAAA,CAAO,mBAAoB,CAAA,GAAG,CAAE,CAAA,OAAA,CAAQ,CAAQ,IAAA,KAAA;AAG7C,IAAC,MAAe,CAAA,IAAI,CAAK,GAAA,GAAA,CAAY,IAAI,CAAA,CAAA;AAAA,GAC3C,CAAA,CAAA;AAED,EAAO,OAAA,MAAA,CAAA;AACT,EAAA;AAMa,MAAA,OAAA,GAAU,CACrB,GAAA,EACA,MACG,KAAA;AACH,EAAA,IAAI,CAAC,GAAA;AAAK,IAAA,OAAO,EAAC,CAAA;AAClB,EAAM,MAAA,OAAA,GAAU,MAAO,CAAA,OAAA,CAAQ,GAAG,CAAA,CAAA;AAClC,EAAA,IAAI,QAAQ,MAAW,KAAA,CAAA;AAAG,IAAA,OAAO,EAAC,CAAA;AAClC,EAAA,OAAO,OAAQ,CAAA,MAAA,CAAO,CAAC,GAAA,EAAK,KAAU,KAAA;AACpC,IAAI,GAAA,CAAA,IAAA,CAAK,OAAO,KAAM,CAAA,CAAC,GAAW,KAAM,CAAA,CAAC,CAAW,CAAC,CAAA,CAAA;AACrD,IAAO,OAAA,GAAA,CAAA;AAAA,GACT,EAAG,EAAe,CAAA,CAAA;AACpB,EAAA;AAMa,MAAA,IAAA,GAAO,CAClB,GAAA,EACAA,KACmB,KAAA;AACnB,EAAA,IAAI,CAAC,GAAA;AAAK,IAAA,OAAO,EAAC,CAAA;AAClB,EAAA,OAAOA,KAAK,CAAA,MAAA,CAAO,CAAC,GAAA,EAAK,GAAQ,KAAA;AAC/B,IAAA,IAAI,MAAO,CAAA,SAAA,CAAU,cAAe,CAAA,IAAA,CAAK,KAAK,GAAG,CAAA;AAAG,MAAI,GAAA,CAAA,GAAG,CAAI,GAAA,GAAA,CAAI,GAAG,CAAA,CAAA;AACtE,IAAO,OAAA,GAAA,CAAA;AAAA,GACT,EAAG,EAAoB,CAAA,CAAA;AACzB,EAAA;AAOa,MAAA,IAAA,GAAO,CAClB,GAAA,EACAA,KACmB,KAAA;AACnB,EAAA,IAAI,CAAC,GAAA;AAAK,IAAA,OAAO,EAAC,CAAA;AAClB,EAAI,IAAA,CAACA,KAAQA,IAAAA,KAAAA,CAAK,MAAW,KAAA,CAAA;AAAG,IAAO,OAAA,GAAA,CAAA;AACvC,EAAA,OAAOA,KAAK,CAAA,MAAA;AAAA,IACV,CAAC,KAAK,GAAQ,KAAA;AAKZ,MAAA,OAAO,IAAI,GAAG,CAAA,CAAA;AACd,MAAO,OAAA,GAAA,CAAA;AAAA,KACT;AAAA,IACA,EAAE,GAAG,GAAI,EAAA;AAAA,GACX,CAAA;AACF,EAAA;AAQO,MAAM,GAAM,GAAA,CACjB,KACA,EAAA,IAAA,EACA,YACa,KAAA;AACb,EAAM,MAAA,QAAA,GAAW,IAAK,CAAA,KAAA,CAAM,WAAW,CAAA,CAAA;AACvC,EAAA,IAAI,OAAe,GAAA,KAAA,CAAA;AACnB,EAAA,KAAA,MAAW,OAAO,QAAU,EAAA;AAC1B,IAAA,IAAI,OAAY,KAAA,IAAA;AAAM,MAAO,OAAA,YAAA,CAAA;AAC7B,IAAA,IAAI,OAAY,KAAA,KAAA,CAAA;AAAW,MAAO,OAAA,YAAA,CAAA;AAClC,IAAA,MAAM,QAAW,GAAA,GAAA,CAAI,OAAQ,CAAA,OAAA,EAAS,EAAE,CAAA,CAAA;AACxC,IAAI,IAAA,QAAA,CAAS,MAAW,KAAA,EAAA;AAAI,MAAA,SAAA;AAC5B,IAAA,OAAA,GAAU,QAAQ,QAAQ,CAAA,CAAA;AAAA,GAC5B;AACA,EAAA,IAAI,OAAY,KAAA,KAAA,CAAA;AAAW,IAAO,OAAA,YAAA,CAAA;AAClC,EAAO,OAAA,OAAA,CAAA;AACT,EAAA;AAWO,MAAM,GAAM,GAAA,CACjB,OACA,EAAA,IAAA,EACA,KACM,KAAA;AACN,EAAA,IAAI,CAAC,OAAA;AAAS,IAAA,OAAO,EAAC,CAAA;AACtB,EAAI,IAAA,CAAC,QAAQ,KAAU,KAAA,KAAA,CAAA;AAAW,IAAO,OAAA,OAAA,CAAA;AACzC,EAAM,MAAA,QAAA,GAAW,IAAK,CAAA,KAAA,CAAM,WAAW,CAAA,CAAE,MAAO,CAAA,CAAA,CAAA,KAAK,CAAC,CAAC,CAAE,CAAA,IAAA,EAAM,CAAA,CAAA;AAC/D,EAAM,MAAA,IAAA,GAAO,CAAC,IAAc,KAAA;AAC1B,IAAI,IAAA,QAAA,CAAS,SAAS,CAAG,EAAA;AACvB,MAAM,MAAA,GAAA,GAAM,SAAS,KAAM,EAAA,CAAA;AAC3B,MAAM,MAAA,SAAA,GAAY,MAAM,QAAS,CAAA,CAAC,GAAG,IAAI,CAAA,KAAM,OAAO,KAAQ,GAAA,IAAA,CAAA;AAC9D,MAAA,IAAA,CAAK,GAAG,CAAA,GAAI,IAAK,CAAA,GAAG,CAAM,KAAA,KAAA,CAAA,GAAa,SAAY,GAAA,EAAK,GAAA,EAAM,GAAA,IAAA,CAAK,GAAG,CAAA,CAAA;AACtE,MAAK,IAAA,CAAA,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA;AAAA,KACT,MAAA;AACL,MAAK,IAAA,CAAA,QAAA,CAAS,CAAC,CAAC,CAAI,GAAA,KAAA,CAAA;AAAA,KACtB;AAAA,GACF,CAAA;AAIA,EAAM,MAAA,MAAA,GAAS,MAAM,OAAO,CAAA,CAAA;AAC5B,EAAA,IAAA,CAAK,MAAM,CAAA,CAAA;AACX,EAAO,OAAA,MAAA,CAAA;AACT,EAAA;AAOa,MAAA,MAAA,GAAS,CACpB,OAAA,EACA,QACM,KAAA;AACN,EAAI,IAAA,CAAC,WAAW,CAAC,QAAA;AAAU,IAAO,OAAA,OAAA,IAAW,YAAY,EAAC,CAAA;AAE1D,EAAO,OAAA,MAAA,CAAO,QAAQ,EAAE,GAAG,SAAS,GAAG,QAAA,EAAU,CAAE,CAAA,MAAA;AAAA,IACjD,CAAC,GAAA,EAAK,CAAC,GAAA,EAAK,KAAK,CAAM,KAAA;AACrB,MAAO,OAAA;AAAA,QACL,GAAG,GAAA;AAAA,QACH,CAAC,GAAG,GAAA,CAAI,MAAM;AACZ,UAAI,IAAA,QAAA,CAAS,OAAQ,CAAA,GAAG,CAAC,CAAA;AAAG,YAAA,OAAO,MAAO,CAAA,OAAA,CAAQ,GAAG,CAAA,EAAG,KAAK,CAAA,CAAA;AAE7D,UAAO,OAAA,KAAA,CAAA;AAAA,SACN,GAAA;AAAA,OACL,CAAA;AAAA,KACF;AAAA,IACA,EAAC;AAAA,GACH,CAAA;AACF,EAAA;AAUa,MAAA,IAAA,GAAO,CAAwB,KAA4B,KAAA;AACtE,EAAA,IAAI,CAAC,KAAA;AAAO,IAAA,OAAO,EAAC,CAAA;AACpB,EAAM,MAAA,OAAA,GAAU,CAAC,MAAA,EAAa,KAA8B,KAAA;AAC1D,IAAI,IAAA,QAAA,CAAS,MAAM,CAAG,EAAA;AACpB,MAAO,OAAA,MAAA,CAAO,OAAQ,CAAA,MAAM,CAAE,CAAA,OAAA;AAAA,QAAQ,CAAC,CAAC,CAAA,EAAG,CAAC,CAAA,KAC1C,OAAQ,CAAA,CAAA,EAAG,CAAC,GAAG,KAAO,EAAA,CAAC,CAAC,CAAA;AAAA,OAC1B,CAAA;AAAA,KACF;AACA,IAAI,IAAA,OAAA,CAAQ,MAAM,CAAG,EAAA;AACnB,MAAA,OAAO,MAAO,CAAA,OAAA,CAAQ,CAAC,IAAA,EAAM,CAAM,KAAA,OAAA,CAAQ,IAAM,EAAA,CAAC,GAAG,KAAA,EAAO,CAAG,EAAA,CAAA,CAAA,CAAG,CAAC,CAAC,CAAA,CAAA;AAAA,KACtE;AACA,IAAA,OAAO,CAAC,KAAA,CAAM,IAAK,CAAA,GAAG,CAAC,CAAA,CAAA;AAAA,GACzB,CAAA;AACA,EAAO,OAAA,OAAA,CAAQ,KAAO,EAAA,EAAE,CAAA,CAAA;AAC1B,EAAA;AAUa,MAAA,KAAA,GAAQ,CAAwB,KAA0B,KAAA;AACrE,EAAA,IAAI,CAAC,KAAA;AAAO,IAAA,OAAO,EAAC,CAAA;AACpB,EAAO,OAAA,SAAA;AAAA,IACL,KAAK,KAAK,CAAA;AAAA,IACV,CAAK,CAAA,KAAA,CAAA;AAAA,IACL,CAAA,CAAA,KAAK,GAAI,CAAA,KAAA,EAAO,CAAC,CAAA;AAAA,GACnB,CAAA;AACF,EAAA;AAWa,MAAA,SAAA,GAAY,CAAyB,GAAyB,KAAA;AACzE,EAAA,IAAI,CAAC,GAAA;AAAK,IAAA,OAAO,EAAC,CAAA;AAClB,EAAA,OAAO,OAAO,IAAK,CAAA,GAAG,EAAE,MAAO,CAAA,CAAC,KAAK,IAAS,KAAA;AAC5C,IAAA,OAAO,GAAI,CAAA,GAAA,EAAK,IAAO,EAAA,GAAA,CAAY,IAAI,CAAC,CAAA,CAAA;AAAA,GAC1C,EAAG,EAAE,CAAA,CAAA;AACP;;;;"}

package/dist/esm/random.mjs

@@ -1,29 +0,0 @@
-import { iterate } from './array.mjs';
-
-const random = (min, max) => {
-  return Math.floor(Math.random() * (max - min + 1) + min);
-};
-const draw = (array) => {
-  const max = array.length;
-  if (max === 0) {
-    return null;
-  }
-  const index = random(0, max - 1);
-  return array[index];
-};
-const shuffle = (array) => {
-  return array.map((a) => ({ rand: Math.random(), value: a })).sort((a, b) => a.rand - b.rand).map((a) => a.value);
-};
-const uid = (length, specials = "") => {
-  const characters = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789" + specials;
-  return iterate(
-    length,
-    (acc) => {
-      return acc + characters.charAt(random(0, characters.length - 1));
-    },
-    ""
-  );
-};
-
-export { draw, random, shuffle, uid };
-//# sourceMappingURL=random.mjs.map

package/dist/esm/random.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"random.mjs","sources":["../../src/random.ts"],"sourcesContent":["import { iterate } from './array'\n\n/**\n * Generates a random number between min and max\n */\nexport const random = (min: number, max: number) => {\n  return Math.floor(Math.random() * (max - min + 1) + min)\n}\n\n/**\n * Draw a random item from a list. Returns\n * null if the list is empty\n */\nexport const draw = <T>(array: readonly T[]): T | null => {\n  const max = array.length\n  if (max === 0) {\n    return null\n  }\n  const index = random(0, max - 1)\n  return array[index]\n}\n\nexport const shuffle = <T>(array: readonly T[]): T[] => {\n  return array\n    .map(a => ({ rand: Math.random(), value: a }))\n    .sort((a, b) => a.rand - b.rand)\n    .map(a => a.value)\n}\n\nexport const uid = (length: number, specials: string = '') => {\n  const characters =\n    'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789' + specials\n  return iterate(\n    length,\n    acc => {\n      return acc + characters.charAt(random(0, characters.length - 1))\n    },\n    ''\n  )\n}\n"],"names":[],"mappings":";;AAKa,MAAA,MAAA,GAAS,CAAC,GAAA,EAAa,GAAgB,KAAA;AAClD,EAAO,OAAA,IAAA,CAAK,MAAM,IAAK,CAAA,MAAA,MAAY,GAAM,GAAA,GAAA,GAAM,KAAK,GAAG,CAAA,CAAA;AACzD,EAAA;AAMa,MAAA,IAAA,GAAO,CAAI,KAAkC,KAAA;AACxD,EAAA,MAAM,MAAM,KAAM,CAAA,MAAA,CAAA;AAClB,EAAA,IAAI,QAAQ,CAAG,EAAA;AACb,IAAO,OAAA,IAAA,CAAA;AAAA,GACT;AACA,EAAA,MAAM,KAAQ,GAAA,MAAA,CAAO,CAAG,EAAA,GAAA,GAAM,CAAC,CAAA,CAAA;AAC/B,EAAA,OAAO,MAAM,KAAK,CAAA,CAAA;AACpB,EAAA;AAEa,MAAA,OAAA,GAAU,CAAI,KAA6B,KAAA;AACtD,EAAO,OAAA,KAAA,CACJ,GAAI,CAAA,CAAA,CAAA,MAAM,EAAE,IAAA,EAAM,KAAK,MAAO,EAAA,EAAG,KAAO,EAAA,CAAA,EAAI,CAAA,CAAA,CAC5C,KAAK,CAAC,CAAA,EAAG,CAAM,KAAA,CAAA,CAAE,IAAO,GAAA,CAAA,CAAE,IAAI,CAC9B,CAAA,GAAA,CAAI,CAAK,CAAA,KAAA,CAAA,CAAE,KAAK,CAAA,CAAA;AACrB,EAAA;AAEO,MAAM,GAAM,GAAA,CAAC,MAAgB,EAAA,QAAA,GAAmB,EAAO,KAAA;AAC5D,EAAA,MAAM,aACJ,gEAAmE,GAAA,QAAA,CAAA;AACrE,EAAO,OAAA,OAAA;AAAA,IACL,MAAA;AAAA,IACA,CAAO,GAAA,KAAA;AACL,MAAO,OAAA,GAAA,GAAM,WAAW,MAAO,CAAA,MAAA,CAAO,GAAG,UAAW,CAAA,MAAA,GAAS,CAAC,CAAC,CAAA,CAAA;AAAA,KACjE;AAAA,IACA,EAAA;AAAA,GACF,CAAA;AACF;;;;"}