ciorent 1.0.7 → 1.0.9

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/index.d.ts CHANGED
@@ -38,9 +38,29 @@ export declare const sleep: (ms: number) => Promise<void>;
38
38
  * @param ms - Sleep duration in milliseconds
39
39
  */
40
40
  export declare const sleepSync: (ms: number) => void;
41
+ /**
42
+ * Async `Array.prototype.map`. Mutates the original array.
43
+ *
44
+ * @example
45
+ * await Promise.all(
46
+ * map([task1(), task2(), task3()], (taskResult) => taskResult.debug)
47
+ * );
48
+ *
49
+ * // Map without mutating the original array
50
+ * await Promise.all(
51
+ * map(taskPromises.slice(), (taskResult) => taskResult.debug)
52
+ * );
53
+ */
54
+ export declare const map: <
55
+ T,
56
+ R
57
+ >(arr: Promise<T>[], mapFn: (value: T) => R | Promise<R>) => Promise<R>[];
58
+ /**
59
+ * Async `Array.prototype.find`.
60
+ */
61
+ export declare const find: <T>(arr: Promise<T>[], findFn: (value: T) => boolean | Promise<boolean>) => Promise<T | undefined>;
41
62
  export * as deferred from "./deferred.js";
42
63
  export * as mutex from "./mutex.js";
43
64
  export * as limit from "./rate-limit.js";
44
65
  export * as semaphore from "./semaphore.js";
45
66
  export * as signal from "./signal.js";
46
- export * as iters from "./iterators.js";
package/index.js CHANGED
@@ -1 +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";export*as iters from"./iterators.js";
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)});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 CHANGED
@@ -1 +1 @@
1
- {"name":"ciorent","version":"1.0.7","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":{"./iterators":"./iterators.js",".":"./index.js","./utils":"./utils.js","./semaphore":"./semaphore.js","./rate-limit":"./rate-limit.js","./deferred":"./deferred.js","./mutex":"./mutex.js","./signal":"./signal.js"}}
1
+ {"name":"ciorent","version":"1.0.9","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","./deferred":"./deferred.js","./mutex":"./mutex.js","./signal":"./signal.js","./semaphore":"./semaphore.js"}}
package/semaphore.d.ts CHANGED
@@ -1,12 +1,8 @@
1
1
  import { type Extend } from "./utils.js";
2
- type QueueItem = () => void;
2
+ type QueueItem = (value: true) => void;
3
3
  type Queue = [(QueueItem | null)[], len: number, head: number, tail: number];
4
4
  export type Semaphore = [...Queue, remain: number];
5
5
  /**
6
- * Check whether the semaphore queue is full.
7
- */
8
- export declare const full: (qu: Extend<Semaphore>) => boolean;
9
- /**
10
6
  * Create a semaphore.
11
7
  *
12
8
  * @example
@@ -19,16 +15,14 @@ export declare const init: (permits: number, capacity: number) => Semaphore;
19
15
  *
20
16
  * @example
21
17
  *
22
- * if (semaphore.full(sem)) {
18
+ * if (!await semaphore.acquire(sem)) {
23
19
  * // Internal queue is full
24
20
  * }
25
21
  *
26
- * await semaphore.acquire(sem);
27
- *
28
22
  * // Do something and then release the permit.
29
23
  * semaphore.release(sem);
30
24
  */
31
- export declare const acquire: (sem: Extend<Semaphore>) => Promise<void> | void;
25
+ export declare const acquire: (sem: Extend<Semaphore>) => Promise<true> | boolean;
32
26
  /**
33
27
  * Release a permit.
34
28
  *
@@ -37,10 +31,15 @@ export declare const acquire: (sem: Extend<Semaphore>) => Promise<void> | void;
37
31
  */
38
32
  export declare const release: (sem: Extend<Semaphore>) => void;
39
33
  /**
40
- * @param task Task to limit
41
- * @param sem Target semaphore
42
- * @throws {Error} when `sem` internal queue is full
34
+ * Run a task with concurrency control.
35
+ *
36
+ * @param sem Semaphore to acquire from
37
+ * @param task Task to run
38
+ * @throws When `sem` internal queue is full
43
39
  * @returns The limited function
44
40
  */
45
- export declare const limit: <Fn extends (...args: any[]) => Promise<any>>(task: Fn, sem: Extend<Semaphore>) => Fn;
41
+ export declare const run: <
42
+ Args extends any[],
43
+ R
44
+ >(sem: Extend<Semaphore>, task: (...args: Args) => Promise<R>, ...args: Args) => Promise<R>;
46
45
  export {};
package/semaphore.js CHANGED
@@ -1 +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};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 full=qu=>qu[0].length+qu[4]<=0;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)()};export let limit=(task,sem)=>async(...args)=>{if(full(sem))throw new Error(`Semaphore internal queue is full`);if(--sem[4]<0){let promise=new Promise(loadResolve);push(sem,loadedResolve);await promise}try{return await task(...args)}finally{release(sem)}};
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};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 run=async(sem,task,...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)}};
package/iterators.d.ts DELETED
@@ -1,33 +0,0 @@
1
- /**
2
- * Describe an async iterator created by `race()`
3
- */
4
- export interface RaceIterator<T> extends AsyncIterator<T> {
5
- _: Promise<T>[];
6
- }
7
- /**
8
- * Race promises and return them in order
9
- */
10
- export declare const race: <T>(promises: Promise<T>[]) => RaceIterator<T>;
11
- /**
12
- * Describe an async iterator created by `map()`
13
- */
14
- export interface MapIterator<
15
- I,
16
- O
17
- > extends AsyncIterator<O> {
18
- _: AsyncIterator<I>;
19
- f: (value: I) => Promise<Awaited<O>>;
20
- }
21
- export declare const map: <
22
- I,
23
- O
24
- >(iterator: AsyncIterator<I>, mapFn: MapIterator<I, O>["f"]) => MapIterator<I, O>;
25
- /**
26
- * Describe an async iterator created by `filter()`
27
- */
28
- export interface FilterIterator<T> extends AsyncIterator<T> {
29
- _: AsyncIterator<T>;
30
- f: (value: T) => Promise<boolean> | boolean;
31
- }
32
- export declare const filter: <T>(iterator: AsyncIterator<T>, filterFn: FilterIterator<T>["f"]) => FilterIterator<T>;
33
- export declare const find: <T>(iterator: AsyncIterator<T>, findFn: (value: T) => Promise<boolean> | boolean) => Promise<T | undefined>;
package/iterators.js DELETED
@@ -1 +0,0 @@
1
- import{loadedResolve,loadResolve}from"./utils.ts";let iteratorDoneResult={done:true,value:undefined};let promiseIteratorDoneResult=Promise.resolve(iteratorDoneResult);let toIteratorResult=value=>({done:false,value});let resolveNext=async(p,resolvers)=>{try{let res=await p;resolvers.pop()(res)}catch{resolvers.pop()(p)}};function raceNext(){return this._.pop()?.then(toIteratorResult)??promiseIteratorDoneResult}export let race=promises=>{let last=promises.length-1;let waitingPromises=new Array(last+1);for(let i=0,resolvers=new Array(last+1);i<=last;i++){waitingPromises[last-i]=new Promise(loadResolve);resolvers[last-i]=loadedResolve;resolveNext(promises[i],resolvers)}return{next:raceNext,_:waitingPromises}};async function mapNext(){let p=await this._.next();if(p.done)return iteratorDoneResult;let res=this.f(p.value);return toIteratorResult(res instanceof Promise?await res:res)}export let map=(iterator,mapFn)=>({next:mapNext,_:iterator,f:mapFn});async function filterNext(){let p=await this._.next();while(!p.done){let res=this.f(p.value);if(res instanceof Promise?await res:res)return p;p=await this._.next()}return iteratorDoneResult}export let filter=(iterator,filterFn)=>({next:filterNext,_:iterator,f:filterFn});export let find=async(iterator,findFn)=>{let p=await iterator.next();while(!p.done){let res=findFn(p.value);if(res instanceof Promise?await res:res)return p.value;p=await iterator.next()}};