ciorent 1.0.6 → 1.0.8

package/index.d.ts

@@ -38,6 +38,27 @@ export declare const sleep: (ms: number) => Promise<void>;
 * @param ms - Sleep duration in milliseconds
 */
 export declare const sleepSync: (ms: number) => void;
+/**
+* Async `Array.prototype.map`. Mutates the original array.
+*
+* @example
+* await Promise.all(
+*   map([task1(), task2(), task3()], (taskResult) => taskResult.debug)
+* );
+*
+* // Map without mutating the original array
+* await Promise.all(
+*   map(taskPromises.slice(), (taskResult) => taskResult.debug)
+* );
+*/
+export declare const map: <
+	T,
+	R
+>(arr: Promise<T>[], mapFn: (value: T) => R | Promise<R>) => Promise<R>[];
+/**
+* Async `Array.prototype.find`.
+*/
+export declare const find: <T>(arr: Promise<T>[], findFn: (value: T) => boolean | Promise<boolean>) => Promise<T | undefined>;
 export * as deferred from "./deferred.js";
 export * as mutex from "./mutex.js";
 export * as limit from "./rate-limit.js";

package/index.js

@@ -1 +1 @@
-import{loadedReject,loadedResolve,loadResolve,loadResolvers}from"./utils.js";export let nextTick=Promise.resolve();let getFinishedState=async(s,p)=>{try{await p;s[0]=1}catch(e){s[0]=0;return p}};export let state=async p=>{let res=[2];getFinishedState(res,p);await nextTick;return res[0]};export let isThenable=p=>p!==null&&typeof p===`object`&&!Array.isArray(p)&&typeof p.then===`function`;export let timeout=(p,ms)=>{let promise=new Promise(loadResolvers);setTimeout(loadedResolve,ms);p.then(loadedResolve,loadedReject);return promise};export let sleep=globalThis.Bun?.sleep??globalThis.process?.getBuiltinModule?.(`timers/promises`).setTimeout??(ms=>{let promise=new Promise(loadResolve);setTimeout(loadedResolve,ms);return promise});let sharedBuf=new Int32Array(new SharedArrayBuffer(4));export let sleepSync=globalThis.Bun?.sleepSync??(ms=>{Atomics.wait(sharedBuf,0,0,ms)});export*as deferred from"./deferred.js";export*as mutex from"./mutex.js";export*as limit from"./rate-limit.js";export*as semaphore from"./semaphore.js";export*as signal from"./signal.js";
+import{loadedReject,loadedResolve,loadResolve,loadResolvers}from"./utils.js";export let nextTick=Promise.resolve();let getFinishedState=async(s,p)=>{try{await p;s[0]=1}catch(e){s[0]=0;return p}};export let state=async p=>{let res=[2];getFinishedState(res,p);await nextTick;return res[0]};export let isThenable=p=>p!==null&&typeof p===`object`&&!Array.isArray(p)&&typeof p.then===`function`;export let timeout=(p,ms)=>{let promise=new Promise(loadResolvers);setTimeout(loadedResolve,ms);p.then(loadedResolve,loadedReject);return promise};export let sleep=globalThis.Bun?.sleep??globalThis.process?.getBuiltinModule?.(`timers/promises`).setTimeout??(ms=>{let promise=new Promise(loadResolve);setTimeout(loadedResolve,ms);return promise});let sharedBuf=new Int32Array(new SharedArrayBuffer(4));export let sleepSync=globalThis.Bun?.sleepSync??(ms=>{Atomics.wait(sharedBuf,0,0,ms)});let resolveFind=async(resolve,findFn,promise,counter)=>{try{if(await promise.then(findFn))return resolve(promise);counter[0]--;return}catch{if(--counter[0]===0)resolve();return promise}};export let map=(arr,mapFn)=>{for(let i=0;i<arr.length;i++)arr[i]=arr[i].then(mapFn);return arr};export let find=(arr,findFn)=>{let promise=new Promise(loadResolve);let counter=[arr.length];for(let i=0;i<arr.length;i++)resolveFind(loadedResolve,findFn,arr[i],counter);return promise};export*as deferred from"./deferred.js";export*as mutex from"./mutex.js";export*as limit from"./rate-limit.js";export*as semaphore from"./semaphore.js";export*as signal from"./signal.js";

package/package.json

@@ -1 +1 @@
-{"name":"ciorent","version":"1.0.6","description":"A lightweight, low-overhead concurrency library","homepage":"https://re-utils.pages.dev/concurrency","repository":{"type":"git","url":"git+https://github.com/re-utils/ciorent.git"},"keywords":["low-overhead","lightweight","concurrency","cross-runtime"],"license":"MIT","type":"module","exports":{"./utils":"./utils.js","./rate-limit":"./rate-limit.js","./signal":"./signal.js","./mutex":"./mutex.js","./deferred":"./deferred.js",".":"./index.js","./semaphore":"./semaphore.js"}}
+{"name":"ciorent","version":"1.0.8","description":"A lightweight, low-overhead concurrency library","homepage":"https://re-utils.pages.dev/concurrency","repository":{"type":"git","url":"git+https://github.com/re-utils/ciorent.git"},"keywords":["low-overhead","lightweight","concurrency","cross-runtime"],"license":"MIT","type":"module","exports":{"./utils":"./utils.js",".":"./index.js","./rate-limit":"./rate-limit.js","./semaphore":"./semaphore.js","./deferred":"./deferred.js","./signal":"./signal.js","./mutex":"./mutex.js"}}

package/semaphore.d.ts

@@ -1,10 +1,6 @@
 import { type Extend } from "./utils.js";
-type QueueItem = () => void;
+type QueueItem = (value: true) => void;
 type Queue = [(QueueItem | null)[], len: number, head: number, tail: number];
-/**
-* Check whether the semaphore queue is full.
-*/
-export declare const full: (qu: Extend<Queue>) => boolean;
 export type Semaphore = [...Queue, remain: number];
 /**
 * Create a semaphore.
@@ -19,16 +15,14 @@ export declare const init: (permits: number, capacity: number) => Semaphore;
 *
 * @example
 *
-* if (semaphore.full(sem)) {
+* if (!await semaphore.acquire(sem)) {
 *   // Internal queue is full
 * }
 *
-* await semaphore.acquire(sem);
-*
 * // Do something and then release the permit.
 * semaphore.release(sem);
 */
-export declare const acquire: (sem: Extend<Semaphore>) => Promise<void> | void;
+export declare const acquire: (sem: Extend<Semaphore>) => Promise<true> | boolean;
 /**
 * Release a permit.
 *
@@ -36,4 +30,11 @@ export declare const acquire: (sem: Extend<Semaphore>) => Promise<void> | void;
 * semaphore.release(sem);
 */
 export declare const release: (sem: Extend<Semaphore>) => void;
+/**
+* @param task Task to limit
+* @param sem Target semaphore
+* @throws When `sem` internal queue is full
+* @returns The limited function
+*/
+export declare const limit: <Fn extends (...args: any[]) => Promise<any>>(task: Fn, sem: Extend<Semaphore>) => Fn;
 export {};

package/semaphore.js

@@ -1 +1 @@
-import{loadedResolve,loadResolve}from"./utils.js";let push=(qu,item)=>{let tail=qu[3];qu[3]=tail+1===qu[1]?0:tail+1;qu[0][tail]=item};export let full=qu=>qu[2]===qu[3]&&qu[0][qu[2]]!==null;let pop=qu=>{let head=qu[2];qu[2]=head+1===qu[1]?0:head+1;let val=qu[0][head];qu[0][head]=null;return val};export let init=(permits,capacity)=>[new Array(capacity).fill(null),capacity,0,0,permits];export let acquire=sem=>{if(--sem[4]<0){let promise=new Promise(loadResolve);push(sem,loadedResolve);return promise}};export let release=sem=>{sem[4]++<0&&pop(sem)()};
+import{loadedResolve,loadResolve}from"./utils.js";let push=(qu,item)=>{let tail=qu[3];qu[3]=tail+1===qu[1]?0:tail+1;qu[0][tail]=item};let pop=qu=>{let head=qu[2];qu[2]=head+1===qu[1]?0:head+1;let val=qu[0][head];qu[0][head]=null;return val};export let init=(permits,capacity)=>[new Array(capacity).fill(null),capacity,0,0,permits];export let acquire=sem=>{if(--sem[4]<0){if(sem[0].length+sem[4]<0){sem[4]++;return false}let promise=new Promise(loadResolve);push(sem,loadedResolve);return promise}return true};export let release=sem=>{sem[4]++<0&&pop(sem)(true)};export let limit=(task,sem)=>async(...args)=>{if(--sem[4]<0){if(sem[0].length+sem[4]<0){sem[4]++;return Promise.reject(new Error(`Semaphore internal queue is full`))}let promise=new Promise(loadResolve);push(sem,loadedResolve);await promise}try{return await task(...args)}finally{release(sem)}};