@limitlesspc/std 0.21.1 → 0.23.0

package/dist/array.d.ts

@@ -161,9 +161,8 @@ declare function includesAny<T, U>(a: readonly T[], b: readonly U[]): boolean;
  */
 declare function includesAll<T, U>(a: readonly T[], b: readonly U[]): boolean;
 /**
- * Returns a new array with items with a unique key
+ * Returns the unique items from an array
  * @param array
- * @param key
  * @example
  * ```ts
  * const array = [
@@ -182,6 +181,24 @@ declare function includesAll<T, U>(a: readonly T[], b: readonly U[]): boolean;
  * // ]
  */
 declare function dedupe<T>(array: Iterable<T>): T[];
+/**
+ * Returns the unique items from an array defined by a function
+ * @param array
+ * @example
+ * ```ts
+ * const array = [
+ *   "cats",
+ *   "cat",
+ *   "dog",
+ *   "dogs",
+ * ];
+ * // Two items are considered the duplicated if they share the same first 3 letters
+ * console.log(dedupeBy(array, item => item.slice(0, 3))); // [
+ * // "cats",
+ * // "dog",
+ * // ]
+ */
+declare function dedupeBy<T>(array: Iterable<T>, key: (item: T) => any): T[];
 /**
  * Returns a new array with items with a unique key
  * @param array
@@ -226,6 +243,6 @@ declare function filterByKey<T>(array: readonly T[], key: keyof T): T[];
  * // ]
  * ```
  */
-declare function sortByKeys<T, K extends keyof T>(array: Iterable<T>, key: MaybeArray<K>, compare?: Compare<T[K]>): T[];
+declare function sortByKeys<T, K extends keyof T>(array: T[], key: MaybeArray<K>, compare?: Compare<T[K]>): T[];
 
-export { added, changes, dedupe, dedupeByKey, difference, equal, filterByKey, hasChange, includesAll, includesAny, intersection, remove, removed, sortByKeys, swap, union, unorderedRemove };
+export { added, changes, dedupe, dedupeBy, dedupeByKey, difference, equal, filterByKey, hasChange, includesAll, includesAny, intersection, remove, removed, sortByKeys, swap, union, unorderedRemove };

package/dist/array.js

@@ -2,6 +2,7 @@ import {
   added,
   changes,
   dedupe,
+  dedupeBy,
   dedupeByKey,
   difference,
   equal,
@@ -16,16 +17,16 @@ import {
   swap,
   union,
   unorderedRemove
-} from "./chunk-65SNM7MP.js";
-import "./chunk-WBSY6KRH.js";
-import "./chunk-MG5VQSTV.js";
-import "./chunk-6F4PWJZI.js";
+} from "./chunk-4POIKW4G.js";
+import "./chunk-CCBSTDYA.js";
+import "./chunk-NXILTE26.js";
 import "./chunk-TMLWLR46.js";
 import "./chunk-LJSF3QBT.js";
 export {
   added,
   changes,
   dedupe,
+  dedupeBy,
   dedupeByKey,
   difference,
   equal,

package/dist/async/index.d.ts

@@ -1,4 +1,4 @@
-import { uint, Awaitable, AnyFunction, Result } from '../types.js';
+import { Awaitable, uint, AnyFunction, Result } from '../types.js';
 
 type Task<T> = () => Awaitable<T>;
 interface TaskQueueItem<T> {

package/dist/async/index.js

@@ -1,13 +1,3 @@
-import {
-  Queue
-} from "../chunk-DYKZK6B5.js";
-import "../chunk-65SNM7MP.js";
-import "../chunk-WBSY6KRH.js";
-import "../chunk-MG5VQSTV.js";
-import "../chunk-6F4PWJZI.js";
-import "../chunk-TMLWLR46.js";
-import "../chunk-LJSF3QBT.js";
-
 // src/async/queue.ts
 var TaskQueue = class {
   constructor(tasks = []) {
@@ -95,12 +85,10 @@ function debounce(func, ms) {
 async function concurrently(funcs, max) {
   const tasks = [...funcs];
   const results = Array.from({ length: tasks.length });
-  const queue = new Queue(tasks);
-  const length = queue.size;
   let i = 0;
   return new Promise((resolve) => {
     const next = async () => {
-      const func = queue.dequeue();
+      const func = tasks.shift();
       if (func) {
         results[i++] = await func();
         void next();

package/dist/{chunk-65SNM7MP.js → chunk-4POIKW4G.js}

@@ -1,6 +1,6 @@
 import {
   zip
-} from "./chunk-WBSY6KRH.js";
+} from "./chunk-CCBSTDYA.js";
 import {
   ascend
 } from "./chunk-TMLWLR46.js";
@@ -90,21 +90,13 @@ function includesAll(a, b) {
   return b.every((item) => a.includes(item));
 }
 function dedupe(array) {
-  const result = [];
-  const seen = /* @__PURE__ */ new Set();
-  for (const item of array) {
-    if (!seen.has(item)) {
-      result.push(item);
-      seen.add(item);
-    }
-  }
-  return result;
+  return dedupeBy(array, (x) => x);
 }
-function dedupeByKey(array, key) {
+function dedupeBy(array, key) {
   const result = [];
   const seen = /* @__PURE__ */ new Set();
   for (const item of array) {
-    const value = item[key];
+    const value = key(item);
     if (!seen.has(value)) {
       result.push(item);
       seen.add(value);
@@ -112,11 +104,14 @@ function dedupeByKey(array, key) {
   }
   return result;
 }
+function dedupeByKey(array, key) {
+  return dedupeBy(array, (x) => x[key]);
+}
 function filterByKey(array, key) {
   return array.filter((item) => item[key]);
 }
 function sortByKeys(array, key, compare = ascend) {
-  return [...array].sort((a, b) => {
+  return array.toSorted((a, b) => {
     const keys = Array.isArray(key) ? key : [key];
     for (const key2 of keys) {
       const value1 = a[key2];
@@ -145,6 +140,7 @@ export {
   includesAny,
   includesAll,
   dedupe,
+  dedupeBy,
   dedupeByKey,
   filterByKey,
   sortByKeys

package/dist/{chunk-WBSY6KRH.js → chunk-CCBSTDYA.js}

@@ -1,6 +1,6 @@
 import {
   reverseCurry
-} from "./chunk-MG5VQSTV.js";
+} from "./chunk-NXILTE26.js";
 import {
   pickByKeys
 } from "./chunk-LJSF3QBT.js";