pjobs - npm Package Compare versions

Comparing version 1.1.3 to 1.1.5

dist/index.d.ts

@@ -27,3 +27,5 @@ // Generated by dts-bundle-generator v6.2.0
 	enqueue<T>(item: Job<T>): void;
+	enqueue<T>(items: Array<Job<T>>): void;
 	promise<T>(item: Job<T>): Promise<T>;
+	promise<T>(items: Array<Job<T>>): Promise<T[]>;
 	waitFor(): Promise<void>;
@@ -30,0 +32,0 @@ setConcurrency(concurrency: number): void;

dist/index.js

@@ -1,1 +0,1 @@
-var x=Object.defineProperty;var F=Object.getOwnPropertyDescriptor;var J=Object.getOwnPropertyNames;var S=Object.prototype.hasOwnProperty;var q=e=>x(e,"__esModule",{value:!0});var j=(e,r)=>{for(var i in r)x(e,i,{get:r[i],enumerable:!0})},M=(e,r,i,t)=>{if(r&&typeof r=="object"||typeof r=="function")for(let o of J(r))!S.call(e,o)&&(i||o!=="default")&&x(e,o,{get:()=>r[o],enumerable:!(t=F(r,o))||t.enumerable});return e};var k=(e=>(r,i)=>e&&e.get(r)||(i=M(q({}),r,1),e&&e.set(r,i),i))(typeof WeakMap!="undefined"?new WeakMap:0);var A={};j(A,{asap:()=>w,defer:()=>P,queuePromises:()=>O,sleep:()=>C});function C(e){return new Promise(r=>{setTimeout(r,e)})}function P(){let e,r;return{promise:new Promise((t,o)=>{e=t,r=o}),resolve(t){e&&e(t)},reject(t){r&&r(t)}}}function w(e){setTimeout(()=>e(),1)}function O(e){let r=Math.max(1,e?.concurrency||1),i=e?.onProgress,t=[],o=0,f=!0,u=[],m=0,T=0,y,h=0,p,d=0;return{state(){return f?"idle":D()},enqueue(n){t.push(n),o++,T=Date.now()+1e3,v()},promise(n){let s=P();return this.enqueue(()=>n().then(s.resolve,s.reject)),s.promise},waitFor(){return new Promise((n,s)=>{setTimeout(a,100);function a(){f?(p?s(p):n(),p=void 0):setTimeout(a,100)}})},setConcurrency(n){r=Math.max(n,1),v()},forceState(n){u=[[n.start,0]],T=n.canRate,o=n.size,d=n.runned}};function v(){f&&(u=[[Date.now(),0]],f=!1),t.length?R():m<1?(o=0,d=0,f=!0,b(),setTimeout(()=>{p=void 0},2e3)):b()}function b(){f||Date.now()>h?w(n):(y&&clearTimeout(y),y=setTimeout(b,1e3));function n(){Date.now()<h||i&&(h=Date.now()+1e3,o>0?i(D()):i("idle"))}}function R(){for(;m<r;){let n=t.shift();if(!n)break;m++,b(),n().catch(s=>{p=s}).finally(async()=>{d++,m--,b(),v()})}}function D(){return{get size(){return o},get running(){return m},get pending(){return t.length},get done(){return d},get percent(){return Math.round(d/o*1e3)/10},get rate(){return n()||"-"},get timeRemaining(){return s()}};function n(){let a=Date.now();if(a<T)return!1;let c=d+m,l=u[0][1],g=c-l;if(g<=0)return!1;for(u.push([a,c]);u.length>30;)u=u.slice(u.length-30);let Q=u[0][0],z=(a-Q)/1e3;return g/z}function s(){let a=n();if(a===!1)return"-";let c=(m+t.length)/a;if(c<2)return"one second";if(c<50)return c.toFixed(0)+" seconds";if(c<120)return"one minute";let l=c/60;if(l<60)return l.toFixed(0)+" minutes";let g=l/60;return l<120?"one hour":g.toFixed(0)+" hours"}}}module.exports=k(A);0&&(module.exports={asap,defer,queuePromises,sleep});
+var P=Object.defineProperty;var Q=Object.getOwnPropertyDescriptor;var z=Object.getOwnPropertyNames;var F=Object.prototype.hasOwnProperty;var S=r=>P(r,"__esModule",{value:!0});var q=(r,n)=>{for(var i in n)P(r,i,{get:n[i],enumerable:!0})},j=(r,n,i,t)=>{if(n&&typeof n=="object"||typeof n=="function")for(let o of z(n))!F.call(r,o)&&(i||o!=="default")&&P(r,o,{get:()=>n[o],enumerable:!(t=Q(n,o))||t.enumerable});return r};var M=(r=>(n,i)=>r&&r.get(n)||(i=j(S({}),n,1),r&&r.set(n,i),i))(typeof WeakMap!="undefined"?new WeakMap:0);var O={};q(O,{asap:()=>w,defer:()=>x,queuePromises:()=>C,sleep:()=>k});function k(r){return new Promise(n=>{setTimeout(n,r)})}function x(){let r,n;return{promise:new Promise((t,o)=>{r=t,n=o}),resolve(t){r&&r(t)},reject(t){n&&n(t)}}}function w(r){setTimeout(()=>r(),1)}function C(r){let n=Math.max(1,r?.concurrency||1),i=r?.onProgress,t=[],o=0,f=!0,u=[],m=0,y=0,g,h=0,p,l=0;return{state(){return f?"idle":J()},enqueue(e){Array.isArray(e)?(t.push(...e),o+=e.length):(t.push(e),o++),y=Date.now()+1e3,v()},promise(e){if(Array.isArray(e))return Promise.all(e.map(s=>this.promise(s)));{let s=x();return this.enqueue(()=>e().then(s.resolve,s.reject)),s.promise}},waitFor(){return new Promise((e,s)=>{setTimeout(a,100);function a(){f?(p?s(p):e(),p=void 0):setTimeout(a,100)}})},setConcurrency(e){n=Math.max(e,1),v()},forceState(e){u=[[e.start,0]],y=e.canRate,o=e.size,l=e.runned}};function v(){f&&(u=[[Date.now(),0]],f=!1),t.length?D():m<1?(o=0,l=0,f=!0,T(),setTimeout(()=>{p=void 0},2e3)):T()}function T(){f||Date.now()>h?w(e):(g&&clearTimeout(g),g=setTimeout(T,1e3));function e(){Date.now()<h||i&&(h=Date.now()+1e3,o>0?i(J()):i("idle"))}}function D(){for(;m<n;){let e=t.shift();if(!e)break;m++,T(),e().catch(s=>{p=s}).finally(async()=>{l++,m--,T(),v()})}}function J(){return{get size(){return o},get running(){return m},get pending(){return t.length},get done(){return l},get percent(){return Math.round(l/o*1e3)/10},get rate(){return e()||"-"},get timeRemaining(){return s()}};function e(){let a=Date.now();if(a<y)return!1;let c=l+m,d=u[0][1],b=c-d;if(b<=0)return!1;for(u.push([a,c]);u.length>30;)u=u.slice(u.length-30);let R=u[0][0],A=(a-R)/1e3;return b/A}function s(){let a=e();if(a===!1)return"-";let c=(m+t.length)/a;if(c<2)return"one second";if(c<50)return c.toFixed(0)+" seconds";if(c<120)return"one minute";let d=c/60;if(d<60)return d.toFixed(0)+" minutes";let b=d/60;return d<120?"one hour":b.toFixed(0)+" hours"}}}module.exports=M(O);0&&(module.exports={asap,defer,queuePromises,sleep});

package.json

 {
   "name": "pjobs",
+  "license": "GPL-3.0-or-later",
   "description": "A simple and efficient queue job executor using promises. And some promise's utilities.",
-  "version": "1.1.3",
+  "version": "1.1.5",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/teintinu/pjobs.git"
+  },
   "private": false,
@@ -16,7 +21,7 @@ "main": "dist/index.js",
     "esbuild-jest": "^0.5.0",
-    "eslint": "^8.5.0",
+    "eslint": "^7.32.0",
     "eslint-config-standard": "^16.0.3",
     "eslint-plugin-import": "^2.25.3",
     "eslint-plugin-node": "^11.1.0",
-    "eslint-plugin-promise": "^6.0.0",
+    "eslint-plugin-promise": "^4.3.1",
     "jest": "^27.4.5",
@@ -23,0 +28,0 @@ "source-map-support": "^0.5.21",

New alerts

Major refactor

Supply chain risk

Package has recently undergone a major refactor. It may be unstable or indicate significant internal changes. Use caution when updating to versions that include significant changes.

Found 1 instance in 1 package

Copyleft License

License

(Experimental) Copyleft license information was found

Found 1 instance in 1 package

SPDX disjunction

License

SPDX disjunction for an artifact's license information

Found 1 instance in 1 package

Mixed license

License

(Experimental) Package contains multiple licenses.

Found 1 instance in 1 package

Non-permissive License

License

(Experimental) A license not known to be considered permissive was found

Found 1 instance in 1 package

Fixed alerts

Major refactor

Supply chain risk

Package has recently undergone a major refactor. It may be unstable or indicate significant internal changes. Use caution when updating to versions that include significant changes.

Found 1 instance in 1 package

Copyleft License

License

(Experimental) Copyleft license information was found

Found 1 instance in 1 package

SPDX disjunction

License

SPDX disjunction for an artifact's license information

Found 1 instance in 1 package

No repository

Supply chain risk

Package does not have a linked source code repository. Without this field, a package will have no reference to the location of the source code use to generate the package.

Found 1 instance in 1 package

Non-permissive License

License

(Experimental) A license not known to be considered permissive was found

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

233038

increased by449.77%

Number of package files

46

increased by666.67%

Lines of code

1210

increased by1471.43%

Number of low supply chain risk alerts

0

decreased by-100%

Worsened metrics

Number of low license alerts

4

increased by33.33%

No dependency changes