typetify 2.1.0 → 2.4.0

package/dist/chunk-OEJK37LO.mjs

@@ -1,328 +0,0 @@
-import { __export } from './chunk-J5LGTIGS.mjs';
-
-// src/collection/index.ts
-var collection_exports = {};
-__export(collection_exports, {
-  chunk: () => chunk,
-  compact: () => compact,
-  countBy: () => countBy,
-  difference: () => difference,
-  drop: () => drop,
-  dropWhile: () => dropWhile,
-  findLast: () => findLast,
-  first: () => first,
-  flatten: () => flatten,
-  groupBy: () => groupBy,
-  head: () => head,
-  indexBy: () => indexBy,
-  init: () => init,
-  intersection: () => intersection,
-  last: () => last,
-  maxBy: () => maxBy,
-  minBy: () => minBy,
-  partition: () => partition,
-  range: () => range,
-  sample: () => sample,
-  shuffle: () => shuffle,
-  sortBy: () => sortBy,
-  sumBy: () => sumBy,
-  tail: () => tail,
-  take: () => take,
-  takeWhile: () => takeWhile,
-  unique: () => unique,
-  unzip: () => unzip,
-  zip: () => zip
-});
-
-// src/collection/unique.ts
-function unique(array, keyFn) {
-  if (!keyFn) {
-    return [...new Set(array)];
-  }
-  const seen = /* @__PURE__ */ new Set();
-  const result = [];
-  for (const item of array) {
-    const key = keyFn(item);
-    if (!seen.has(key)) {
-      seen.add(key);
-      result.push(item);
-    }
-  }
-  return result;
-}
-
-// src/collection/groupBy.ts
-function groupBy(array, keyFn) {
-  const result = {};
-  for (const item of array) {
-    const key = keyFn(item);
-    if (!(key in result)) {
-      result[key] = [];
-    }
-    result[key].push(item);
-  }
-  return result;
-}
-
-// src/collection/indexBy.ts
-function indexBy(array, keyFn) {
-  const result = {};
-  for (const item of array) {
-    const key = keyFn(item);
-    result[key] = item;
-  }
-  return result;
-}
-
-// src/collection/partition.ts
-function partition(array, predicate) {
-  const pass = [];
-  const fail = [];
-  for (const item of array) {
-    if (predicate(item)) {
-      pass.push(item);
-    } else {
-      fail.push(item);
-    }
-  }
-  return [pass, fail];
-}
-
-// src/collection/chunk.ts
-function chunk(array, size) {
-  if (size <= 0) {
-    throw new Error("Chunk size must be greater than 0");
-  }
-  const result = [];
-  for (let i = 0; i < array.length; i += size) {
-    result.push(array.slice(i, i + size));
-  }
-  return result;
-}
-
-// src/collection/compact.ts
-function compact(array) {
-  return array.filter((item) => item !== null && item !== void 0);
-}
-
-// src/collection/flatten.ts
-function flatten(array) {
-  const result = [];
-  for (const item of array) {
-    if (Array.isArray(item)) {
-      result.push(...item);
-    } else {
-      result.push(item);
-    }
-  }
-  return result;
-}
-
-// src/collection/sortBy.ts
-function sortBy(array, keyFn, order = "asc") {
-  const sorted = [...array].sort((a, b) => {
-    const keyA = keyFn(a);
-    const keyB = keyFn(b);
-    if (keyA < keyB) return -1;
-    if (keyA > keyB) return 1;
-    return 0;
-  });
-  return order === "desc" ? sorted.reverse() : sorted;
-}
-
-// src/collection/first.ts
-function first(array) {
-  return array[0];
-}
-
-// src/collection/last.ts
-function last(array) {
-  return array[array.length - 1];
-}
-
-// src/collection/range.ts
-function range(start, end, step = 1) {
-  if (step === 0) {
-    throw new Error("Step cannot be 0");
-  }
-  const result = [];
-  if (step > 0) {
-    for (let i = start; i < end; i += step) {
-      result.push(i);
-    }
-  } else {
-    for (let i = start; i > end; i += step) {
-      result.push(i);
-    }
-  }
-  return result;
-}
-
-// src/collection/shuffle.ts
-function shuffle(array) {
-  const result = [...array];
-  for (let i = result.length - 1; i > 0; i--) {
-    const j = Math.floor(Math.random() * (i + 1));
-    const temp = result[i];
-    result[i] = result[j];
-    result[j] = temp;
-  }
-  return result;
-}
-
-// src/collection/sample.ts
-function sample(array) {
-  if (array.length === 0) {
-    return void 0;
-  }
-  const index = Math.floor(Math.random() * array.length);
-  return array[index];
-}
-
-// src/collection/zip.ts
-function zip(a, b) {
-  const length = Math.min(a.length, b.length);
-  const result = [];
-  for (let i = 0; i < length; i++) {
-    result.push([a[i], b[i]]);
-  }
-  return result;
-}
-
-// src/collection/unzip.ts
-function unzip(array) {
-  const a = [];
-  const b = [];
-  for (const [first2, second] of array) {
-    a.push(first2);
-    b.push(second);
-  }
-  return [a, b];
-}
-
-// src/collection/difference.ts
-function difference(a, b) {
-  const setB = new Set(b);
-  return a.filter((item) => !setB.has(item));
-}
-
-// src/collection/intersection.ts
-function intersection(a, b) {
-  const setB = new Set(b);
-  return a.filter((item) => setB.has(item));
-}
-
-// src/collection/take.ts
-function take(arr, n) {
-  if (n <= 0) return [];
-  return arr.slice(0, n);
-}
-
-// src/collection/drop.ts
-function drop(arr, n) {
-  if (n <= 0) return [...arr];
-  return arr.slice(n);
-}
-
-// src/collection/takeWhile.ts
-function takeWhile(arr, predicate) {
-  const result = [];
-  for (let i = 0; i < arr.length; i++) {
-    const item = arr[i];
-    if (!predicate(item, i)) break;
-    result.push(item);
-  }
-  return result;
-}
-
-// src/collection/dropWhile.ts
-function dropWhile(arr, predicate) {
-  let startIndex = 0;
-  for (let i = 0; i < arr.length; i++) {
-    if (!predicate(arr[i], i)) {
-      startIndex = i;
-      break;
-    }
-    startIndex = arr.length;
-  }
-  return arr.slice(startIndex);
-}
-
-// src/collection/findLast.ts
-function findLast(arr, predicate) {
-  for (let i = arr.length - 1; i >= 0; i--) {
-    const item = arr[i];
-    if (predicate(item, i)) return item;
-  }
-  return void 0;
-}
-
-// src/collection/countBy.ts
-function countBy(arr, fn) {
-  const result = {};
-  for (const item of arr) {
-    const key = fn(item);
-    result[key] = (result[key] ?? 0) + 1;
-  }
-  return result;
-}
-
-// src/collection/maxBy.ts
-function maxBy(arr, fn) {
-  if (arr.length === 0) return void 0;
-  let maxItem = arr[0];
-  let maxValue = fn(maxItem);
-  for (let i = 1; i < arr.length; i++) {
-    const item = arr[i];
-    const value = fn(item);
-    if (value > maxValue) {
-      maxValue = value;
-      maxItem = item;
-    }
-  }
-  return maxItem;
-}
-
-// src/collection/minBy.ts
-function minBy(arr, fn) {
-  if (arr.length === 0) return void 0;
-  let minItem = arr[0];
-  let minValue = fn(minItem);
-  for (let i = 1; i < arr.length; i++) {
-    const item = arr[i];
-    const value = fn(item);
-    if (value < minValue) {
-      minValue = value;
-      minItem = item;
-    }
-  }
-  return minItem;
-}
-
-// src/collection/sumBy.ts
-function sumBy(arr, fn) {
-  let sum = 0;
-  for (const item of arr) {
-    sum += fn(item);
-  }
-  return sum;
-}
-
-// src/collection/head.ts
-function head(arr) {
-  return arr[0];
-}
-
-// src/collection/tail.ts
-function tail(arr) {
-  return arr.slice(1);
-}
-
-// src/collection/init.ts
-function init(arr) {
-  return arr.slice(0, -1);
-}
-
-export { chunk, collection_exports, compact, countBy, difference, drop, dropWhile, findLast, first, flatten, groupBy, head, indexBy, init, intersection, last, maxBy, minBy, partition, range, sample, shuffle, sortBy, sumBy, tail, take, takeWhile, unique, unzip, zip };
-//# sourceMappingURL=chunk-OEJK37LO.mjs.map
-//# sourceMappingURL=chunk-OEJK37LO.mjs.map

package/dist/chunk-OEJK37LO.mjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/collection/index.ts","../src/collection/unique.ts","../src/collection/groupBy.ts","../src/collection/indexBy.ts","../src/collection/partition.ts","../src/collection/chunk.ts","../src/collection/compact.ts","../src/collection/flatten.ts","../src/collection/sortBy.ts","../src/collection/first.ts","../src/collection/last.ts","../src/collection/range.ts","../src/collection/shuffle.ts","../src/collection/sample.ts","../src/collection/zip.ts","../src/collection/unzip.ts","../src/collection/difference.ts","../src/collection/intersection.ts","../src/collection/take.ts","../src/collection/drop.ts","../src/collection/takeWhile.ts","../src/collection/dropWhile.ts","../src/collection/findLast.ts","../src/collection/countBy.ts","../src/collection/maxBy.ts","../src/collection/minBy.ts","../src/collection/sumBy.ts","../src/collection/head.ts","../src/collection/tail.ts","../src/collection/init.ts"],"names":["first"],"mappings":";;;AAAA,IAAA,kBAAA,GAAA;AAAA,QAAA,CAAA,kBAAA,EAAA;AAAA,EAAA,KAAA,EAAA,MAAA,KAAA;AAAA,EAAA,OAAA,EAAA,MAAA,OAAA;AAAA,EAAA,OAAA,EAAA,MAAA,OAAA;AAAA,EAAA,UAAA,EAAA,MAAA,UAAA;AAAA,EAAA,IAAA,EAAA,MAAA,IAAA;AAAA,EAAA,SAAA,EAAA,MAAA,SAAA;AAAA,EAAA,QAAA,EAAA,MAAA,QAAA;AAAA,EAAA,KAAA,EAAA,MAAA,KAAA;AAAA,EAAA,OAAA,EAAA,MAAA,OAAA;AAAA,EAAA,OAAA,EAAA,MAAA,OAAA;AAAA,EAAA,IAAA,EAAA,MAAA,IAAA;AAAA,EAAA,OAAA,EAAA,MAAA,OAAA;AAAA,EAAA,IAAA,EAAA,MAAA,IAAA;AAAA,EAAA,YAAA,EAAA,MAAA,YAAA;AAAA,EAAA,IAAA,EAAA,MAAA,IAAA;AAAA,EAAA,KAAA,EAAA,MAAA,KAAA;AAAA,EAAA,KAAA,EAAA,MAAA,KAAA;AAAA,EAAA,SAAA,EAAA,MAAA,SAAA;AAAA,EAAA,KAAA,EAAA,MAAA,KAAA;AAAA,EAAA,MAAA,EAAA,MAAA,MAAA;AAAA,EAAA,OAAA,EAAA,MAAA,OAAA;AAAA,EAAA,MAAA,EAAA,MAAA,MAAA;AAAA,EAAA,KAAA,EAAA,MAAA,KAAA;AAAA,EAAA,IAAA,EAAA,MAAA,IAAA;AAAA,EAAA,IAAA,EAAA,MAAA,IAAA;AAAA,EAAA,SAAA,EAAA,MAAA,SAAA;AAAA,EAAA,MAAA,EAAA,MAAA,MAAA;AAAA,EAAA,KAAA,EAAA,MAAA,KAAA;AAAA,EAAA,GAAA,EAAA,MAAA;AAAA,CAAA,CAAA;;;ACaO,SAAS,MAAA,CACd,OACA,KAAA,EACK;AACL,EAAA,IAAI,CAAC,KAAA,EAAO;AACV,IAAA,OAAO,CAAC,GAAG,IAAI,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,EAC3B;AAEA,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAO;AACxB,EAAA,MAAM,SAAc,EAAC;AAErB,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,GAAA,GAAM,MAAM,IAAI,CAAA;AACtB,IAAA,IAAI,CAAC,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,EAAG;AAClB,MAAA,IAAA,CAAK,IAAI,GAAG,CAAA;AACZ,MAAA,MAAA,CAAO,KAAK,IAAI,CAAA;AAAA,IAClB;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;;;ACrBO,SAAS,OAAA,CACd,OACA,KAAA,EACgB;AAChB,EAAA,MAAM,SAAS,EAAC;AAEhB,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,GAAA,GAAM,MAAM,IAAI,CAAA;AACtB,IAAA,IAAI,EAAE,OAAO,MAAA,CAAA,EAAS;AACpB,MAAA,MAAA,CAAO,GAAG,IAAI,EAAC;AAAA,IACjB;AACA,IAAA,MAAA,CAAO,GAAG,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA;AAAA,EACvB;AAEA,EAAA,OAAO,MAAA;AACT;;;ACfO,SAAS,OAAA,CACd,OACA,KAAA,EACc;AACd,EAAA,MAAM,SAAS,EAAC;AAEhB,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,GAAA,GAAM,MAAM,IAAI,CAAA;AACtB,IAAA,MAAA,CAAO,GAAG,CAAA,GAAI,IAAA;AAAA,EAChB;AAEA,EAAA,OAAO,MAAA;AACT;;;AChBO,SAAS,SAAA,CACd,OACA,SAAA,EACY;AACZ,EAAA,MAAM,OAAY,EAAC;AACnB,EAAA,MAAM,OAAY,EAAC;AAEnB,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,SAAA,CAAU,IAAI,CAAA,EAAG;AACnB,MAAA,IAAA,CAAK,KAAK,IAAI,CAAA;AAAA,IAChB,CAAA,MAAO;AACL,MAAA,IAAA,CAAK,KAAK,IAAI,CAAA;AAAA,IAChB;AAAA,EACF;AAEA,EAAA,OAAO,CAAC,MAAM,IAAI,CAAA;AACpB;;;ACjBO,SAAS,KAAA,CAAS,OAAqB,IAAA,EAAqB;AACjE,EAAA,IAAI,QAAQ,CAAA,EAAG;AACb,IAAA,MAAM,IAAI,MAAM,mCAAmC,CAAA;AAAA,EACrD;AAEA,EAAA,MAAM,SAAgB,EAAC;AAEvB,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,MAAA,EAAQ,KAAK,IAAA,EAAM;AAC3C,IAAA,MAAA,CAAO,KAAK,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,CAAA,GAAI,IAAI,CAAC,CAAA;AAAA,EACtC;AAEA,EAAA,OAAO,MAAA;AACT;;;ACXO,SAAS,QAAW,KAAA,EAA+C;AACxE,EAAA,OAAO,MAAM,MAAA,CAAO,CAAC,SAAoB,IAAA,KAAS,IAAA,IAAQ,SAAS,MAAS,CAAA;AAC9E;;;ACHO,SAAS,QAAW,KAAA,EAA2C;AACpE,EAAA,MAAM,SAAc,EAAC;AAErB,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,EAAG;AACvB,MAAA,MAAA,CAAO,IAAA,CAAK,GAAG,IAAI,CAAA;AAAA,IACrB,CAAA,MAAO;AACL,MAAA,MAAA,CAAO,KAAK,IAAS,CAAA;AAAA,IACvB;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;;;ACXO,SAAS,MAAA,CACd,KAAA,EACA,KAAA,EACA,KAAA,GAAwB,KAAA,EACnB;AACL,EAAA,MAAM,MAAA,GAAS,CAAC,GAAG,KAAK,EAAE,IAAA,CAAK,CAAC,GAAG,CAAA,KAAM;AACvC,IAAA,MAAM,IAAA,GAAO,MAAM,CAAC,CAAA;AACpB,IAAA,MAAM,IAAA,GAAO,MAAM,CAAC,CAAA;AAEpB,IAAA,IAAI,IAAA,GAAO,MAAM,OAAO,EAAA;AACxB,IAAA,IAAI,IAAA,GAAO,MAAM,OAAO,CAAA;AACxB,IAAA,OAAO,CAAA;AAAA,EACT,CAAC,CAAA;AAED,EAAA,OAAO,KAAA,KAAU,MAAA,GAAS,MAAA,CAAO,OAAA,EAAQ,GAAI,MAAA;AAC/C;;;AChBO,SAAS,MAAS,KAAA,EAAoC;AAC3D,EAAA,OAAO,MAAM,CAAC,CAAA;AAChB;;;ACFO,SAAS,KAAQ,KAAA,EAAoC;AAC1D,EAAA,OAAO,KAAA,CAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AAC/B;;;ACFO,SAAS,KAAA,CAAM,KAAA,EAAe,GAAA,EAAa,IAAA,GAAe,CAAA,EAAa;AAC5E,EAAA,IAAI,SAAS,CAAA,EAAG;AACd,IAAA,MAAM,IAAI,MAAM,kBAAkB,CAAA;AAAA,EACpC;AAEA,EAAA,MAAM,SAAmB,EAAC;AAE1B,EAAA,IAAI,OAAO,CAAA,EAAG;AACZ,IAAA,KAAA,IAAS,CAAA,GAAI,KAAA,EAAO,CAAA,GAAI,GAAA,EAAK,KAAK,IAAA,EAAM;AACtC,MAAA,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,IACf;AAAA,EACF,CAAA,MAAO;AACL,IAAA,KAAA,IAAS,CAAA,GAAI,KAAA,EAAO,CAAA,GAAI,GAAA,EAAK,KAAK,IAAA,EAAM;AACtC,MAAA,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,IACf;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;;;ACjBO,SAAS,QAAW,KAAA,EAA0B;AACnD,EAAA,MAAM,MAAA,GAAS,CAAC,GAAG,KAAK,CAAA;AAExB,EAAA,KAAA,IAAS,IAAI,MAAA,CAAO,MAAA,GAAS,CAAA,EAAG,CAAA,GAAI,GAAG,CAAA,EAAA,EAAK;AAC1C,IAAA,MAAM,IAAI,IAAA,CAAK,KAAA,CAAM,KAAK,MAAA,EAAO,IAAK,IAAI,CAAA,CAAE,CAAA;AAC5C,IAAA,MAAM,IAAA,GAAO,OAAO,CAAC,CAAA;AACrB,IAAA,MAAA,CAAO,CAAC,CAAA,GAAI,MAAA,CAAO,CAAC,CAAA;AACpB,IAAA,MAAA,CAAO,CAAC,CAAA,GAAI,IAAA;AAAA,EACd;AAEA,EAAA,OAAO,MAAA;AACT;;;ACZO,SAAS,OAAU,KAAA,EAAoC;AAC5D,EAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACtB,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,QAAQ,IAAA,CAAK,KAAA,CAAM,KAAK,MAAA,EAAO,GAAI,MAAM,MAAM,CAAA;AACrD,EAAA,OAAO,MAAM,KAAK,CAAA;AACpB;;;ACNO,SAAS,GAAA,CAAU,GAAiB,CAAA,EAA2B;AACpE,EAAA,MAAM,SAAS,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,MAAA,EAAQ,EAAE,MAAM,CAAA;AAC1C,EAAA,MAAM,SAAmB,EAAC;AAE1B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,EAAQ,CAAA,EAAA,EAAK;AAC/B,IAAA,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,CAAE,CAAC,GAAI,CAAA,CAAE,CAAC,CAAE,CAAC,CAAA;AAAA,EAC5B;AAEA,EAAA,OAAO,MAAA;AACT;;;ACVO,SAAS,MAAY,KAAA,EAAiD;AAC3E,EAAA,MAAM,IAAS,EAAC;AAChB,EAAA,MAAM,IAAS,EAAC;AAEhB,EAAA,KAAA,MAAW,CAACA,MAAAA,EAAO,MAAM,CAAA,IAAK,KAAA,EAAO;AACnC,IAAA,CAAA,CAAE,KAAKA,MAAK,CAAA;AACZ,IAAA,CAAA,CAAE,KAAK,MAAM,CAAA;AAAA,EACf;AAEA,EAAA,OAAO,CAAC,GAAG,CAAC,CAAA;AACd;;;ACVO,SAAS,UAAA,CAAc,GAAiB,CAAA,EAAsB;AACnE,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,CAAC,CAAA;AACtB,EAAA,OAAO,CAAA,CAAE,OAAO,CAAC,IAAA,KAAS,CAAC,IAAA,CAAK,GAAA,CAAI,IAAI,CAAC,CAAA;AAC3C;;;ACHO,SAAS,YAAA,CAAgB,GAAiB,CAAA,EAAsB;AACrE,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,CAAC,CAAA;AACtB,EAAA,OAAO,EAAE,MAAA,CAAO,CAAC,SAAS,IAAA,CAAK,GAAA,CAAI,IAAI,CAAC,CAAA;AAC1C;;;ACHO,SAAS,IAAA,CAAQ,KAAmB,CAAA,EAAgB;AACzD,EAAA,IAAI,CAAA,IAAK,CAAA,EAAG,OAAO,EAAC;AACpB,EAAA,OAAO,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA;AACvB;;;ACHO,SAAS,IAAA,CAAQ,KAAmB,CAAA,EAAgB;AACzD,EAAA,IAAI,CAAA,IAAK,CAAA,EAAG,OAAO,CAAC,GAAG,GAAG,CAAA;AAC1B,EAAA,OAAO,GAAA,CAAI,MAAM,CAAC,CAAA;AACpB;;;ACHO,SAAS,SAAA,CACd,KACA,SAAA,EACK;AACL,EAAA,MAAM,SAAc,EAAC;AACrB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;AACnC,IAAA,MAAM,IAAA,GAAO,IAAI,CAAC,CAAA;AAClB,IAAA,IAAI,CAAC,SAAA,CAAU,IAAA,EAAM,CAAC,CAAA,EAAG;AACzB,IAAA,MAAA,CAAO,KAAK,IAAI,CAAA;AAAA,EAClB;AACA,EAAA,OAAO,MAAA;AACT;;;ACXO,SAAS,SAAA,CACd,KACA,SAAA,EACK;AACL,EAAA,IAAI,UAAA,GAAa,CAAA;AACjB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;AACnC,IAAA,IAAI,CAAC,SAAA,CAAU,GAAA,CAAI,CAAC,CAAA,EAAI,CAAC,CAAA,EAAG;AAC1B,MAAA,UAAA,GAAa,CAAA;AACb,MAAA;AAAA,IACF;AACA,IAAA,UAAA,GAAa,GAAA,CAAI,MAAA;AAAA,EACnB;AACA,EAAA,OAAO,GAAA,CAAI,MAAM,UAAU,CAAA;AAC7B;;;ACbO,SAAS,QAAA,CACd,KACA,SAAA,EACe;AACf,EAAA,KAAA,IAAS,IAAI,GAAA,CAAI,MAAA,GAAS,CAAA,EAAG,CAAA,IAAK,GAAG,CAAA,EAAA,EAAK;AACxC,IAAA,MAAM,IAAA,GAAO,IAAI,CAAC,CAAA;AAClB,IAAA,IAAI,SAAA,CAAU,IAAA,EAAM,CAAC,CAAA,EAAG,OAAO,IAAA;AAAA,EACjC;AACA,EAAA,OAAO,MAAA;AACT;;;ACNO,SAAS,OAAA,CACd,KACA,EAAA,EAC6B;AAC7B,EAAA,MAAM,SAAsC,EAAC;AAC7C,EAAA,KAAA,MAAW,QAAQ,GAAA,EAAK;AACtB,IAAA,MAAM,GAAA,GAAM,GAAG,IAAI,CAAA;AACnB,IAAA,MAAA,CAAO,GAAG,CAAA,GAAA,CAAK,MAAA,CAAO,GAAG,KAAK,CAAA,IAAK,CAAA;AAAA,EACrC;AACA,EAAA,OAAO,MAAA;AACT;;;ACXO,SAAS,KAAA,CACd,KACA,EAAA,EACe;AACf,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAE7B,EAAA,IAAI,OAAA,GAAU,IAAI,CAAC,CAAA;AACnB,EAAA,IAAI,QAAA,GAAW,GAAG,OAAO,CAAA;AAEzB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;AACnC,IAAA,MAAM,IAAA,GAAO,IAAI,CAAC,CAAA;AAClB,IAAA,MAAM,KAAA,GAAQ,GAAG,IAAI,CAAA;AACrB,IAAA,IAAI,QAAQ,QAAA,EAAU;AACpB,MAAA,QAAA,GAAW,KAAA;AACX,MAAA,OAAA,GAAU,IAAA;AAAA,IACZ;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;;;ACnBO,SAAS,KAAA,CACd,KACA,EAAA,EACe;AACf,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAE7B,EAAA,IAAI,OAAA,GAAU,IAAI,CAAC,CAAA;AACnB,EAAA,IAAI,QAAA,GAAW,GAAG,OAAO,CAAA;AAEzB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;AACnC,IAAA,MAAM,IAAA,GAAO,IAAI,CAAC,CAAA;AAClB,IAAA,MAAM,KAAA,GAAQ,GAAG,IAAI,CAAA;AACrB,IAAA,IAAI,QAAQ,QAAA,EAAU;AACpB,MAAA,QAAA,GAAW,KAAA;AACX,MAAA,OAAA,GAAU,IAAA;AAAA,IACZ;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;;;ACnBO,SAAS,KAAA,CACd,KACA,EAAA,EACQ;AACR,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,KAAA,MAAW,QAAQ,GAAA,EAAK;AACtB,IAAA,GAAA,IAAO,GAAG,IAAI,CAAA;AAAA,EAChB;AACA,EAAA,OAAO,GAAA;AACT;;;ACVO,SAAS,KAAQ,GAAA,EAAkC;AACxD,EAAA,OAAO,IAAI,CAAC,CAAA;AACd;;;ACFO,SAAS,KAAQ,GAAA,EAAwB;AAC9C,EAAA,OAAO,GAAA,CAAI,MAAM,CAAC,CAAA;AACpB;;;ACFO,SAAS,KAAQ,GAAA,EAAwB;AAC9C,EAAA,OAAO,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AACxB","file":"chunk-OEJK37LO.mjs","sourcesContent":["export { unique } from './unique'\nexport { groupBy } from './groupBy'\nexport { indexBy } from './indexBy'\nexport { partition } from './partition'\nexport { chunk } from './chunk'\nexport { compact } from './compact'\nexport { flatten } from './flatten'\nexport { sortBy } from './sortBy'\nexport { first } from './first'\nexport { last } from './last'\nexport { range } from './range'\nexport { shuffle } from './shuffle'\nexport { sample } from './sample'\nexport { zip } from './zip'\nexport { unzip } from './unzip'\nexport { difference } from './difference'\nexport { intersection } from './intersection'\nexport { take } from './take'\nexport { drop } from './drop'\nexport { takeWhile } from './takeWhile'\nexport { dropWhile } from './dropWhile'\nexport { findLast } from './findLast'\nexport { countBy } from './countBy'\nexport { maxBy } from './maxBy'\nexport { minBy } from './minBy'\nexport { sumBy } from './sumBy'\nexport { head } from './head'\nexport { tail } from './tail'\nexport { init } from './init'\n","/**\n * Returns an array with unique values.\n * Optionally accepts a key function to determine uniqueness.\n *\n * @example\n * unique([1, 2, 2, 3]) // [1, 2, 3]\n * unique([{ id: 1 }, { id: 1 }, { id: 2 }], item => item.id) // [{ id: 1 }, { id: 2 }]\n */\nexport function unique<T>(array: readonly T[]): T[]\nexport function unique<T, K>(\n  array: readonly T[],\n  keyFn: (item: T) => K\n): T[]\nexport function unique<T, K>(\n  array: readonly T[],\n  keyFn?: (item: T) => K\n): T[] {\n  if (!keyFn) {\n    return [...new Set(array)]\n  }\n\n  const seen = new Set<K>()\n  const result: T[] = []\n\n  for (const item of array) {\n    const key = keyFn(item)\n    if (!seen.has(key)) {\n      seen.add(key)\n      result.push(item)\n    }\n  }\n\n  return result\n}\n","/**\n * Groups array elements by a key function.\n *\n * @example\n * const users = [\n *   { name: 'Alice', role: 'admin' },\n *   { name: 'Bob', role: 'user' },\n *   { name: 'Charlie', role: 'admin' },\n * ]\n * groupBy(users, user => user.role)\n * // { admin: [{ name: 'Alice', ... }, { name: 'Charlie', ... }], user: [{ name: 'Bob', ... }] }\n */\nexport function groupBy<T, K extends PropertyKey>(\n  array: readonly T[],\n  keyFn: (item: T) => K\n): Record<K, T[]> {\n  const result = {} as Record<K, T[]>\n\n  for (const item of array) {\n    const key = keyFn(item)\n    if (!(key in result)) {\n      result[key] = []\n    }\n    result[key].push(item)\n  }\n\n  return result\n}\n","/**\n * Creates an object indexed by a key function.\n * If multiple items have the same key, the last one wins.\n *\n * @example\n * const users = [\n *   { id: 1, name: 'Alice' },\n *   { id: 2, name: 'Bob' },\n * ]\n * indexBy(users, user => user.id)\n * // { 1: { id: 1, name: 'Alice' }, 2: { id: 2, name: 'Bob' } }\n */\nexport function indexBy<T, K extends PropertyKey>(\n  array: readonly T[],\n  keyFn: (item: T) => K\n): Record<K, T> {\n  const result = {} as Record<K, T>\n\n  for (const item of array) {\n    const key = keyFn(item)\n    result[key] = item\n  }\n\n  return result\n}\n","/**\n * Splits an array into two arrays based on a predicate.\n * First array contains items that pass, second contains items that fail.\n *\n * @example\n * const [evens, odds] = partition([1, 2, 3, 4], n => n % 2 === 0)\n * // evens: [2, 4], odds: [1, 3]\n */\nexport function partition<T>(\n  array: readonly T[],\n  predicate: (item: T) => boolean\n): [T[], T[]] {\n  const pass: T[] = []\n  const fail: T[] = []\n\n  for (const item of array) {\n    if (predicate(item)) {\n      pass.push(item)\n    } else {\n      fail.push(item)\n    }\n  }\n\n  return [pass, fail]\n}\n","/**\n * Splits an array into chunks of the specified size.\n *\n * @example\n * chunk([1, 2, 3, 4, 5], 2)\n * // [[1, 2], [3, 4], [5]]\n */\nexport function chunk<T>(array: readonly T[], size: number): T[][] {\n  if (size <= 0) {\n    throw new Error('Chunk size must be greater than 0')\n  }\n\n  const result: T[][] = []\n\n  for (let i = 0; i < array.length; i += size) {\n    result.push(array.slice(i, i + size))\n  }\n\n  return result\n}\n","/**\n * Removes null and undefined values from an array.\n * Properly narrows the type.\n *\n * @example\n * compact([1, null, 2, undefined, 3])\n * // [1, 2, 3] with type number[]\n */\nexport function compact<T>(array: readonly (T | null | undefined)[]): T[] {\n  return array.filter((item): item is T => item !== null && item !== undefined)\n}\n","/**\n * Flattens an array one level deep.\n *\n * @example\n * flatten([[1, 2], [3, 4], [5]])\n * // [1, 2, 3, 4, 5]\n */\nexport function flatten<T>(array: readonly (T | readonly T[])[]): T[] {\n  const result: T[] = []\n\n  for (const item of array) {\n    if (Array.isArray(item)) {\n      result.push(...item)\n    } else {\n      result.push(item as T)\n    }\n  }\n\n  return result\n}\n","/**\n * Sorts an array by a key function. Returns a new array.\n *\n * @example\n * const users = [{ name: 'Bob' }, { name: 'Alice' }]\n * sortBy(users, user => user.name)\n * // [{ name: 'Alice' }, { name: 'Bob' }]\n */\nexport function sortBy<T>(\n  array: readonly T[],\n  keyFn: (item: T) => string | number,\n  order: 'asc' | 'desc' = 'asc'\n): T[] {\n  const sorted = [...array].sort((a, b) => {\n    const keyA = keyFn(a)\n    const keyB = keyFn(b)\n\n    if (keyA < keyB) return -1\n    if (keyA > keyB) return 1\n    return 0\n  })\n\n  return order === 'desc' ? sorted.reverse() : sorted\n}\n","/**\n * Returns the first element of an array, or undefined if empty.\n *\n * @example\n * first([1, 2, 3]) // 1\n * first([]) // undefined\n */\nexport function first<T>(array: readonly T[]): T | undefined {\n  return array[0]\n}\n","/**\n * Returns the last element of an array, or undefined if empty.\n *\n * @example\n * last([1, 2, 3]) // 3\n * last([]) // undefined\n */\nexport function last<T>(array: readonly T[]): T | undefined {\n  return array[array.length - 1]\n}\n","/**\n * Creates an array of numbers from start to end (exclusive).\n *\n * @example\n * range(0, 5) // [0, 1, 2, 3, 4]\n * range(1, 10, 2) // [1, 3, 5, 7, 9]\n */\nexport function range(start: number, end: number, step: number = 1): number[] {\n  if (step === 0) {\n    throw new Error('Step cannot be 0')\n  }\n\n  const result: number[] = []\n\n  if (step > 0) {\n    for (let i = start; i < end; i += step) {\n      result.push(i)\n    }\n  } else {\n    for (let i = start; i > end; i += step) {\n      result.push(i)\n    }\n  }\n\n  return result\n}\n","/**\n * Returns a new array with elements randomly shuffled.\n * Uses Fisher-Yates algorithm.\n *\n * @example\n * shuffle([1, 2, 3, 4, 5])\n * // [3, 1, 5, 2, 4] (random order)\n */\nexport function shuffle<T>(array: readonly T[]): T[] {\n  const result = [...array]\n\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = Math.floor(Math.random() * (i + 1))\n    const temp = result[i]\n    result[i] = result[j]!\n    result[j] = temp!\n  }\n\n  return result\n}\n","/**\n * Returns a random element from an array.\n *\n * @example\n * sample([1, 2, 3, 4, 5]) // random element\n * sample([]) // undefined\n */\nexport function sample<T>(array: readonly T[]): T | undefined {\n  if (array.length === 0) {\n    return undefined\n  }\n\n  const index = Math.floor(Math.random() * array.length)\n  return array[index]\n}\n","/**\n * Zips two arrays together into an array of tuples.\n * Stops at the shorter array.\n *\n * @example\n * zip([1, 2, 3], ['a', 'b', 'c'])\n * // [[1, 'a'], [2, 'b'], [3, 'c']]\n */\nexport function zip<A, B>(a: readonly A[], b: readonly B[]): [A, B][] {\n  const length = Math.min(a.length, b.length)\n  const result: [A, B][] = []\n\n  for (let i = 0; i < length; i++) {\n    result.push([a[i]!, b[i]!])\n  }\n\n  return result\n}\n","/**\n * Unzips an array of tuples into two arrays.\n *\n * @example\n * unzip([[1, 'a'], [2, 'b'], [3, 'c']])\n * // [[1, 2, 3], ['a', 'b', 'c']]\n */\nexport function unzip<A, B>(array: readonly (readonly [A, B])[]): [A[], B[]] {\n  const a: A[] = []\n  const b: B[] = []\n\n  for (const [first, second] of array) {\n    a.push(first)\n    b.push(second)\n  }\n\n  return [a, b]\n}\n","/**\n * Returns elements in the first array that are not in the second.\n *\n * @example\n * difference([1, 2, 3, 4], [2, 4])\n * // [1, 3]\n */\nexport function difference<T>(a: readonly T[], b: readonly T[]): T[] {\n  const setB = new Set(b)\n  return a.filter((item) => !setB.has(item))\n}\n","/**\n * Returns elements that exist in both arrays.\n *\n * @example\n * intersection([1, 2, 3], [2, 3, 4])\n * // [2, 3]\n */\nexport function intersection<T>(a: readonly T[], b: readonly T[]): T[] {\n  const setB = new Set(b)\n  return a.filter((item) => setB.has(item))\n}\n","/**\n * Returns the first n elements of an array.\n *\n * @example\n * take([1, 2, 3, 4, 5], 3) // [1, 2, 3]\n * take([1, 2], 5) // [1, 2]\n */\nexport function take<T>(arr: readonly T[], n: number): T[] {\n  if (n <= 0) return []\n  return arr.slice(0, n)\n}\n","/**\n * Returns all but the first n elements of an array.\n *\n * @example\n * drop([1, 2, 3, 4, 5], 2) // [3, 4, 5]\n * drop([1, 2], 5) // []\n */\nexport function drop<T>(arr: readonly T[], n: number): T[] {\n  if (n <= 0) return [...arr]\n  return arr.slice(n)\n}\n","/**\n * Returns elements from the beginning of an array while the predicate returns true.\n *\n * @example\n * takeWhile([1, 2, 3, 4, 1], n => n < 3) // [1, 2]\n * takeWhile([5, 1, 2], n => n < 3) // []\n */\nexport function takeWhile<T>(\n  arr: readonly T[],\n  predicate: (item: T, index: number) => boolean\n): T[] {\n  const result: T[] = []\n  for (let i = 0; i < arr.length; i++) {\n    const item = arr[i]!\n    if (!predicate(item, i)) break\n    result.push(item)\n  }\n  return result\n}\n","/**\n * Drops elements from the beginning of an array while the predicate returns true.\n *\n * @example\n * dropWhile([1, 2, 3, 4, 1], n => n < 3) // [3, 4, 1]\n * dropWhile([5, 1, 2], n => n < 3) // [5, 1, 2]\n */\nexport function dropWhile<T>(\n  arr: readonly T[],\n  predicate: (item: T, index: number) => boolean\n): T[] {\n  let startIndex = 0\n  for (let i = 0; i < arr.length; i++) {\n    if (!predicate(arr[i]!, i)) {\n      startIndex = i\n      break\n    }\n    startIndex = arr.length\n  }\n  return arr.slice(startIndex)\n}\n","/**\n * Returns the last element in an array that satisfies the predicate.\n *\n * @example\n * findLast([1, 2, 3, 4], n => n % 2 === 0) // 4\n * findLast([1, 3, 5], n => n % 2 === 0) // undefined\n */\nexport function findLast<T>(\n  arr: readonly T[],\n  predicate: (item: T, index: number) => boolean\n): T | undefined {\n  for (let i = arr.length - 1; i >= 0; i--) {\n    const item = arr[i]!\n    if (predicate(item, i)) return item\n  }\n  return undefined\n}\n","/**\n * Creates an object counting occurrences of each key returned by the function.\n *\n * @example\n * countBy([1, 2, 3, 4, 5], n => n % 2 === 0 ? 'even' : 'odd')\n * // { odd: 3, even: 2 }\n *\n * countBy(['one', 'two', 'three'], s => s.length)\n * // { 3: 2, 5: 1 }\n */\nexport function countBy<T>(\n  arr: readonly T[],\n  fn: (item: T) => PropertyKey\n): Record<PropertyKey, number> {\n  const result: Record<PropertyKey, number> = {}\n  for (const item of arr) {\n    const key = fn(item)\n    result[key] = (result[key] ?? 0) + 1\n  }\n  return result\n}\n","/**\n * Returns the element with the maximum value according to the function.\n *\n * @example\n * maxBy([{ age: 20 }, { age: 30 }, { age: 25 }], u => u.age)\n * // { age: 30 }\n *\n * maxBy([], u => u.age) // undefined\n */\nexport function maxBy<T>(\n  arr: readonly T[],\n  fn: (item: T) => number\n): T | undefined {\n  if (arr.length === 0) return undefined\n\n  let maxItem = arr[0]!\n  let maxValue = fn(maxItem)\n\n  for (let i = 1; i < arr.length; i++) {\n    const item = arr[i]!\n    const value = fn(item)\n    if (value > maxValue) {\n      maxValue = value\n      maxItem = item\n    }\n  }\n\n  return maxItem\n}\n","/**\n * Returns the element with the minimum value according to the function.\n *\n * @example\n * minBy([{ age: 20 }, { age: 30 }, { age: 25 }], u => u.age)\n * // { age: 20 }\n *\n * minBy([], u => u.age) // undefined\n */\nexport function minBy<T>(\n  arr: readonly T[],\n  fn: (item: T) => number\n): T | undefined {\n  if (arr.length === 0) return undefined\n\n  let minItem = arr[0]!\n  let minValue = fn(minItem)\n\n  for (let i = 1; i < arr.length; i++) {\n    const item = arr[i]!\n    const value = fn(item)\n    if (value < minValue) {\n      minValue = value\n      minItem = item\n    }\n  }\n\n  return minItem\n}\n","/**\n * Sums the values returned by the function for each element.\n *\n * @example\n * sumBy([{ price: 10 }, { price: 20 }, { price: 30 }], item => item.price)\n * // 60\n *\n * sumBy([], item => item.price) // 0\n */\nexport function sumBy<T>(\n  arr: readonly T[],\n  fn: (item: T) => number\n): number {\n  let sum = 0\n  for (const item of arr) {\n    sum += fn(item)\n  }\n  return sum\n}\n","/**\n * Returns the first element of an array, or undefined if empty.\n * Alias for first().\n *\n * @example\n * head([1, 2, 3]) // 1\n * head([]) // undefined\n */\nexport function head<T>(arr: readonly T[]): T | undefined {\n  return arr[0]\n}\n","/**\n * Returns all elements except the first.\n *\n * @example\n * tail([1, 2, 3]) // [2, 3]\n * tail([1]) // []\n * tail([]) // []\n */\nexport function tail<T>(arr: readonly T[]): T[] {\n  return arr.slice(1)\n}\n","/**\n * Returns all elements except the last.\n *\n * @example\n * init([1, 2, 3]) // [1, 2]\n * init([1]) // []\n * init([]) // []\n */\nexport function init<T>(arr: readonly T[]): T[] {\n  return arr.slice(0, -1)\n}\n"]}