ciorent 1.0.8 → 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/package.json +1 -1
- package/semaphore.d.ts +8 -3
- package/semaphore.js +1 -1
package/package.json
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"name":"ciorent","version":"1.0.
|
|
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
|
@@ -31,10 +31,15 @@ export declare const acquire: (sem: Extend<Semaphore>) => Promise<true> | boolea
|
|
|
31
31
|
*/
|
|
32
32
|
export declare const release: (sem: Extend<Semaphore>) => void;
|
|
33
33
|
/**
|
|
34
|
-
*
|
|
35
|
-
*
|
|
34
|
+
* Run a task with concurrency control.
|
|
35
|
+
*
|
|
36
|
+
* @param sem Semaphore to acquire from
|
|
37
|
+
* @param task Task to run
|
|
36
38
|
* @throws When `sem` internal queue is full
|
|
37
39
|
* @returns The limited function
|
|
38
40
|
*/
|
|
39
|
-
export declare const
|
|
41
|
+
export declare const run: <
|
|
42
|
+
Args extends any[],
|
|
43
|
+
R
|
|
44
|
+
>(sem: Extend<Semaphore>, task: (...args: Args) => Promise<R>, ...args: Args) => Promise<R>;
|
|
40
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 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
|
|
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)}};
|