		@@ -1,2 +0,1 @@
		// stripped down version of https://github.com/mafintosh/fifo
		"use strict";
		@@ -17,2 +16,3 @@ Object.defineProperty(exports, "__esModule", {
		}
		// stripped down version of https://github.com/mafintosh/fifo
		var Node = /#__PURE__/ function() {
		@@ -19,0 +19,0 @@ "use strict";

+1

-1

dist/cjs/LinkedArray.js.map

		@@ -1,1 +0,1 @@
		{"version":3,"sources":["/Users/kevin/Dev/OpenSource/utils/queue-cb/src/LinkedArray.ts"],"sourcesContent":["// stripped down version of https://github.com/mafintosh/fifo\nclass Node<T> {\n prev: Node<T>;\n next: Node<T>;\n value: T;\n\n constructor(value: T) {\n this.prev = this.next = this;\n this.value = value;\n }\n\n link(next: Node<T>): Node<T> {\n this.next = next;\n next.prev = this;\n return next;\n }\n}\n\nexport default class LinkedArray<T> {\n node: Node<T> \| null;\n length: number;\n\n constructor() {\n this.node = null;\n this.length = 0;\n }\n\n push(value: T): Node<T> {\n const node = new Node<T>(value);\n this.length++;\n if (!this.node) {\n this.node = node;\n return node;\n }\n this.node.prev.link(node);\n node.link(this.node);\n return node;\n }\n\n shift(): T \| null {\n if (!this.node) throw new Error('Cannot shift: array empty');\n const node = this.node;\n this.length--;\n node.prev.link(node.next);\n if (node === this.node) this.node = node.next === node ? null : node.next;\n return node.link(node).value;\n }\n}\n"],"names":["LinkedArray","Node","value","prev","next","link","node","length","push","shift","Error"],"mappings":"AAAA,6DAA6D;;;;;;;;eAkBxCA;;;;;;;;AAjBrB,IAAA,AAAMC,qBAAN;;aAAMA,KAKQC,KAAQ;gCALhBD;QAMF,IAAI,CAACE,IAAI,GAAG,IAAI,CAACC,IAAI,GAAG,IAAI;QAC5B,IAAI,CAACF,KAAK,GAAGA;;iBAPXD;IAUJI,OAAAA,IAIC,GAJDA,SAAAA,KAAKD,IAAa;QAChB,IAAI,CAACA,IAAI,GAAGA;QACZA,KAAKD,IAAI,GAAG,IAAI;QAChB,OAAOC;IACT;WAdIH;;AAiBS,IAAA,AAAMD,4BAAN;;aAAMA;gCAAAA;QAKjB,IAAI,CAACM,IAAI,GAAG;QACZ,IAAI,CAACC,MAAM,GAAG;;iBANGP;IASnBQ,OAAAA,IAUC,GAVDA,SAAAA,KAAKN,KAAQ;QACX,IAAMI,OAAO,IAAIL,KAAQC;QACzB,IAAI,CAACK,MAAM;QACX,IAAI,CAAC,IAAI,CAACD,IAAI,EAAE;YACd,IAAI,CAACA,IAAI,GAAGA;YACZ,OAAOA;QACT;QACA,IAAI,CAACA,IAAI,CAACH,IAAI,CAACE,IAAI,CAACC;QACpBA,KAAKD,IAAI,CAAC,IAAI,CAACC,IAAI;QACnB,OAAOA;IACT;IAEAG,OAAAA,KAOC,GAPDA,SAAAA;QACE,IAAI,CAAC,IAAI,CAACH,IAAI,EAAE,MAAM,IAAII,MAAM;QAChC,IAAMJ,OAAO,IAAI,CAACA,IAAI;QACtB,IAAI,CAACC,MAAM;QACXD,KAAKH,IAAI,CAACE,IAAI,CAACC,KAAKF,IAAI;QACxB,IAAIE,SAAS,IAAI,CAACA,IAAI,EAAE,IAAI,CAACA,IAAI,GAAGA,KAAKF,IAAI,KAAKE,OAAO,OAAOA,KAAKF,IAAI;QACzE,OAAOE,KAAKD,IAAI,CAACC,MAAMJ,KAAK;IAC9B;WA5BmBF"}
		{"version":3,"sources":["/Users/kevin/Dev/OpenSource/utils/queue-cb/src/LinkedArray.ts"],"sourcesContent":["// stripped down version of https://github.com/mafintosh/fifo\nclass Node<T> {\n prev: Node<T>;\n next: Node<T>;\n value: T;\n\n constructor(value: T) {\n this.prev = this.next = this;\n this.value = value;\n }\n\n link(next: Node<T>): Node<T> {\n this.next = next;\n next.prev = this;\n return next;\n }\n}\n\nexport default class LinkedArray<T> {\n node: Node<T> \| null;\n length: number;\n\n constructor() {\n this.node = null;\n this.length = 0;\n }\n\n push(value: T): Node<T> {\n const node = new Node<T>(value);\n this.length++;\n if (!this.node) {\n this.node = node;\n return node;\n }\n this.node.prev.link(node);\n node.link(this.node);\n return node;\n }\n\n shift(): T \| null {\n if (!this.node) throw new Error('Cannot shift: array empty');\n const node = this.node;\n this.length--;\n node.prev.link(node.next);\n if (node === this.node) this.node = node.next === node ? null : node.next;\n return node.link(node).value;\n }\n}\n"],"names":["LinkedArray","Node","value","prev","next","link","node","length","push","shift","Error"],"mappings":";;;;;;;eAkBqBA;;;;;;;;AAlBrB,6DAA6D;AAC7D,IAAA,AAAMC,qBAAN;;aAAMA,KAKQC,KAAQ;gCALhBD;QAMF,IAAI,CAACE,IAAI,GAAG,IAAI,CAACC,IAAI,GAAG,IAAI;QAC5B,IAAI,CAACF,KAAK,GAAGA;;iBAPXD;IAUJI,OAAAA,IAIC,GAJDA,SAAAA,KAAKD,IAAa;QAChB,IAAI,CAACA,IAAI,GAAGA;QACZA,KAAKD,IAAI,GAAG,IAAI;QAChB,OAAOC;IACT;WAdIH;;AAiBS,IAAA,AAAMD,4BAAN;;aAAMA;gCAAAA;QAKjB,IAAI,CAACM,IAAI,GAAG;QACZ,IAAI,CAACC,MAAM,GAAG;;iBANGP;IASnBQ,OAAAA,IAUC,GAVDA,SAAAA,KAAKN,KAAQ;QACX,IAAMI,OAAO,IAAIL,KAAQC;QACzB,IAAI,CAACK,MAAM;QACX,IAAI,CAAC,IAAI,CAACD,IAAI,EAAE;YACd,IAAI,CAACA,IAAI,GAAGA;YACZ,OAAOA;QACT;QACA,IAAI,CAACA,IAAI,CAACH,IAAI,CAACE,IAAI,CAACC;QACpBA,KAAKD,IAAI,CAAC,IAAI,CAACC,IAAI;QACnB,OAAOA;IACT;IAEAG,OAAAA,KAOC,GAPDA,SAAAA;QACE,IAAI,CAAC,IAAI,CAACH,IAAI,EAAE,MAAM,IAAII,MAAM;QAChC,IAAMJ,OAAO,IAAI,CAACA,IAAI;QACtB,IAAI,CAACC,MAAM;QACXD,KAAKH,IAAI,CAACE,IAAI,CAACC,KAAKF,IAAI;QACxB,IAAIE,SAAS,IAAI,CAACA,IAAI,EAAE,IAAI,CAACA,IAAI,GAAGA,KAAKF,IAAI,KAAKE,OAAO,OAAOA,KAAKF,IAAI;QACzE,OAAOE,KAAKD,IAAI,CAACC,MAAMJ,KAAK;IAC9B;WA5BmBF"}

+7

-3

package.json

		{
		"name": "queue-cb",
		"version": "1.5.8",
		"version": "1.5.9",
		"description": "A scalable queue for parallel callbacks",
		@@ -34,3 +34,4 @@ "keywords": [
		"format": "biome check --write --unsafe",
		"test": "mocha --no-timeouts test/*/.test.*",
		"prepublishOnly": "tsds validate",
		"test": "tsds test:node --no-timeouts",
		"test:engines": "nvu engines tsds test:node --no-timeouts",
		@@ -40,6 +41,9 @@ "version": "tsds version"
		"devDependencies": {
		"@biomejs/biome": "*",
		"@types/asap": "*",
		"@types/mocha": "*",
		"@types/node": "*",
		"asap": "*"
		"asap": "*",
		"node-version-use": "*",
		"ts-dev-stack": "*"
		},
		@@ -46,0 +50,0 @@ "engines": {

queue-cb - npm Package Compare versions

Improved metrics

Worsened metrics