UNPKG

seventh

Version:

A lean Promises and Async lib for ES6/ES7

228 lines (160 loc) 6.66 kB
/* Seventh Copyright (c) 2017 - 2020 Cédric Ronvel The MIT License (MIT) Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ "use strict" ; const Promise = require( './seventh.js' ) ; function Queue( jobRunner , concurrency = 4 ) { this.jobRunner = jobRunner ; this.jobs = new Map() ; // all jobs this.pendingJobs = new Map() ; // only pending jobs (not run) this.runningJobs = new Map() ; // only running jobs (not done) this.errorJobs = new Map() ; // jobs that have failed this.jobsDone = new Map() ; // jobs that finished successfully this.concurrency = + concurrency || 1 ; // Internal this.isQueueRunning = true ; this.isLoopRunning = false ; this.canLoopAgain = false ; this.ready = Promise.resolved ; // Misc this.startTime = null ; // timestamp at the first time the loop is run this.endTime = null ; // timestamp at the last time the loop exited // External API, resolved when there is no jobs anymore in the queue, a new Promise is created when new element are injected this.drained = Promise.resolved ; // External API, resolved when the Queue has nothing to do: either it's drained or the pending jobs have dependencies that cannot be solved this.idle = Promise.resolved ; } Promise.Queue = Queue ; function Job( id , dependencies = null , data = undefined ) { this.id = id ; this.dependencies = dependencies === null ? null : [ ... dependencies ] ; this.data = data === undefined ? id : data ; this.error = null ; this.startTime = null ; this.endTime = null ; } Queue.Job = Job ; Queue.prototype.setConcurrency = function( concurrency ) { this.concurrency = + concurrency || 1 ; } ; Queue.prototype.stop = Queue.prototype.pause = function() { this.isQueueRunning = false ; } ; Queue.prototype.has = function( id ) { return this.jobs.has( id ) ; } ; Queue.prototype.add = Queue.prototype.addJob = function( id , data , dependencies = null ) { // Don't add it twice! if ( this.jobs.has( id ) ) { return false ; } var job = new Job( id , dependencies , data ) ; this.jobs.set( id , job ) ; this.pendingJobs.set( id , job ) ; this.canLoopAgain = true ; if ( this.isQueueRunning && ! this.isLoopRunning ) { this.run() ; } if ( this.drained.isSettled() ) { this.drained = new Promise() ; } return job ; } ; // Add a batch of jobs, with only id (data=id) and no dependencies Queue.prototype.addBatch = Queue.prototype.addJobBatch = function( ids ) { var id , job ; for ( id of ids ) { // Don't add it twice! if ( this.jobs.has( id ) ) { return false ; } job = new Job( id ) ; this.jobs.set( id , job ) ; this.pendingJobs.set( id , job ) ; } this.canLoopAgain = true ; if ( this.isQueueRunning && ! this.isLoopRunning ) { this.run() ; } if ( this.drained.isSettled() ) { this.drained = new Promise() ; } } ; Queue.prototype.run = Queue.prototype.resume = async function() { var job ; this.isQueueRunning = true ; if ( this.isLoopRunning ) { return ; } this.isLoopRunning = true ; if ( ! this.startTime ) { this.startTime = Date.now() ; } do { this.canLoopAgain = false ; for ( job of this.pendingJobs.values() ) { if ( job.dependencies && job.dependencies.some( dependencyId => ! this.jobsDone.has( dependencyId ) ) ) { continue ; } // This should be done synchronously: if ( this.idle.isSettled() ) { this.idle = new Promise() ; } this.canLoopAgain = true ; await this.ready ; // Something has stopped the queue while we were awaiting. // This check MUST be done only after "await", before is potentially synchronous, and things only change concurrently during an "await" if ( ! this.isQueueRunning ) { this.finishRun() ; return ; } this.runJob( job ) ; } } while ( this.canLoopAgain ) ; this.finishRun() ; } ; // Finish current run Queue.prototype.finishRun = function() { this.isLoopRunning = false ; if ( ! this.pendingJobs.size ) { this.drained.resolve() ; } if ( ! this.runningJobs.size ) { this.endTime = Date.now() ; this.idle.resolve() ; } } ; Queue.prototype.runJob = async function( job ) { // Immediately remove it synchronously from the pending queue and add it to the running one this.pendingJobs.delete( job.id ) ; this.runningJobs.set( job.id , job ) ; if ( this.runningJobs.size >= this.concurrency ) { this.ready = new Promise() ; } // Async part try { job.startTime = Date.now() ; await this.jobRunner( job.data ) ; job.endTime = Date.now() ; this.jobsDone.set( job.id , job ) ; this.canLoopAgain = true ; } catch ( error ) { job.endTime = Date.now() ; job.error = error ; this.errorJobs.set( job.id , job ) ; } this.runningJobs.delete( job.id ) ; if ( this.runningJobs.size < this.concurrency ) { this.ready.resolve() ; } // This MUST come last, because it retry the loop: dependencies may have been unlocked! if ( ! this.isLoopRunning ) { if ( this.isQueueRunning && this.pendingJobs.size ) { this.run() ; } else { this.finishRun() ; } } } ; Queue.prototype.getJobTimes = function() { var job , stats = {} ; for ( job of this.jobsDone.values() ) { stats[ job.id ] = job.endTime - job.startTime ; } return stats ; } ; Queue.prototype.getStats = function() { var job , sum = 0 , stats = { pending: this.pendingJobs.size , running: this.runningJobs.size , failed: this.errorJobs.size , done: this.jobsDone.size , averageJobTime: null , queueTime: null } ; if ( this.jobsDone.size ) { for ( job of this.jobsDone.values() ) { sum += job.endTime - job.startTime ; } stats.averageJobTime = sum / this.jobsDone.size ; } if ( this.endTime ) { stats.queueTime = this.endTime - this.startTime ; } return stats ; } ;