#$@%#$%!

Ngiler SH3LL 360
: / lib / node_modules / npm / node_modules / run-queue /

Information Server
MySQL : OFF Perl : OFF CURL : ON WGET : OFF PKEXEC : OFF

Directive	Local Value
IP Address	162.0.209.101
System	Linux premium169.web-hosting.com 4.18.0-553.50.1.lve.el8.x86_64 #1 SMP Thu Apr 17 19:10:24 UTC 2025 x86_64
User	luxeelil
PHP Version	8.0.30
Software	LiteSpeed
Doc root	Writable

Edit File : queue.js \| Size : 2.68 KB
'use strict' module.exports = RunQueue var validate = require('aproba') function RunQueue (opts) { validate('Z\|O', [opts]) if (!opts) opts = {} this.finished = false this.inflight = 0 this.maxConcurrency = opts.maxConcurrency \|\| 1 this.queued = 0 this.queue = [] this.currentPrio = null this.currentQueue = null this.Promise = opts.Promise \|\| global.Promise this.deferred = {} } RunQueue.prototype = {} RunQueue.prototype.run = function () { if (arguments.length !== 0) throw new Error('RunQueue.run takes no arguments') var self = this var deferred = this.deferred if (!deferred.promise) { deferred.promise = new this.Promise(function (resolve, reject) { deferred.resolve = resolve deferred.reject = reject self._runQueue() }) } return deferred.promise } RunQueue.prototype._runQueue = function () { var self = this while ((this.inflight < this.maxConcurrency) && this.queued) { if (!this.currentQueue \|\| this.currentQueue.length === 0) { // wait till the current priority is entirely processed before // starting a new one if (this.inflight) return var prios = Object.keys(this.queue) for (var ii = 0; ii < prios.length; ++ii) { var prioQueue = this.queue[prios[ii]] if (prioQueue.length) { this.currentQueue = prioQueue this.currentPrio = prios[ii] break } } } --this.queued ++this.inflight var next = this.currentQueue.shift() var args = next.args \|\| [] // we explicitly construct a promise here so that queue items can throw // or immediately return to resolve var queueEntry = new this.Promise(function (resolve) { resolve(next.cmd.apply(null, args)) }) queueEntry.then(function () { --self.inflight if (self.finished) return if (self.queued <= 0 && self.inflight <= 0) { self.finished = true self.deferred.resolve() } self._runQueue() }, function (err) { self.finished = true self.deferred.reject(err) }) } } RunQueue.prototype.add = function (prio, cmd, args) { if (this.finished) throw new Error("Can't add to a finished queue. Create a new queue.") if (Math.abs(Math.floor(prio)) !== prio) throw new Error('Priorities must be a positive integer value.') validate('NFA\|NFZ', [prio, cmd, args]) prio = Number(prio) if (!this.queue[prio]) this.queue[prio] = [] ++this.queued this.queue[prio].push({cmd: cmd, args: args}) // if this priority is higher than the one we're currently processing, // switch back to processing its queue. if (this.currentPrio > prio) { this.currentQueue = this.queue[prio] this.currentPrio = prio } } Back

Edit File : queue.js | Size : 2.68 KB

'use strict'
module.exports = RunQueue

var validate = require('aproba')

function RunQueue (opts) {
  validate('Z|O', [opts])
  if (!opts) opts = {}
  this.finished = false
  this.inflight = 0
  this.maxConcurrency = opts.maxConcurrency || 1
  this.queued = 0
  this.queue = []
  this.currentPrio = null
  this.currentQueue = null
  this.Promise = opts.Promise || global.Promise
  this.deferred = {}
}

RunQueue.prototype = {}

RunQueue.prototype.run = function () {
  if (arguments.length !== 0) throw new Error('RunQueue.run takes no arguments')
  var self = this
  var deferred = this.deferred
  if (!deferred.promise) {
    deferred.promise = new this.Promise(function (resolve, reject) {
      deferred.resolve = resolve
      deferred.reject = reject
      self._runQueue()
    })
  }
  return deferred.promise
}

RunQueue.prototype._runQueue = function () {
  var self = this

while ((this.inflight < this.maxConcurrency) && this.queued) {
    if (!this.currentQueue || this.currentQueue.length === 0) {
      // wait till the current priority is entirely processed before
      // starting a new one
      if (this.inflight) return
      var prios = Object.keys(this.queue)
      for (var ii = 0; ii < prios.length; ++ii) {
        var prioQueue = this.queue[prios[ii]]
        if (prioQueue.length) {
          this.currentQueue = prioQueue
          this.currentPrio = prios[ii]
          break
        }
      }
    }

--this.queued
    ++this.inflight
    var next = this.currentQueue.shift()
    var args = next.args || []

// we explicitly construct a promise here so that queue items can throw
    // or immediately return to resolve
    var queueEntry = new this.Promise(function (resolve) {
      resolve(next.cmd.apply(null, args))
    })

queueEntry.then(function () {
      --self.inflight
      if (self.finished) return
      if (self.queued <= 0 && self.inflight <= 0) {
        self.finished = true
        self.deferred.resolve()
      }
      self._runQueue()
    }, function (err) {
      self.finished = true
      self.deferred.reject(err)
    })
  }
}

RunQueue.prototype.add = function (prio, cmd, args) {
  if (this.finished) throw new Error("Can't add to a finished queue. Create a new queue.")
  if (Math.abs(Math.floor(prio)) !== prio) throw new Error('Priorities must be a positive integer value.')
  validate('NFA|NFZ', [prio, cmd, args])
  prio = Number(prio)
  if (!this.queue[prio]) this.queue[prio] = []
  ++this.queued
  this.queue[prio].push({cmd: cmd, args: args})
  // if this priority is higher than the one we're currently processing,
  // switch back to processing its queue.
  if (this.currentPrio > prio) {
    this.currentQueue = this.queue[prio]
    this.currentPrio = prio
  }
}

Back