cojson 0.12.0 → 0.12.1

package/.turbo/turbo-build.log

@@ -1,4 +1,4 @@
 
-> cojson@0.12.0 build /home/runner/_work/jazz/jazz/packages/cojson
+> cojson@0.12.1 build /home/runner/_work/jazz/jazz/packages/cojson
 > rm -rf ./dist && tsc --sourceMap --outDir dist
 

package/CHANGELOG.md

@@ -1,5 +1,11 @@
 # cojson
 
+## 0.12.1
+
+### Patch Changes
+
+- 5a00fe0: Re-introducing linked lists on PriorityBasedMessageQueue
+
 ## 0.12.0
 
 ### Minor Changes

package/dist/PriorityBasedMessageQueue.d.ts

@@ -6,6 +6,21 @@ export type QueueEntry = {
     resolve: () => void;
     reject: (_: unknown) => void;
 };
+type LinkedListNode<T> = {
+    value: T;
+    next: LinkedListNode<T> | undefined;
+};
+/**
+ * Using a linked list to make the shift operation O(1) instead of O(n)
+ * as our queues can grow very large when the system is under pressure.
+ */
+export declare class LinkedList<T> {
+    head: LinkedListNode<T> | undefined;
+    tail: LinkedListNode<T> | undefined;
+    length: number;
+    push(value: T): void;
+    shift(): T | undefined;
+}
 export declare class PriorityBasedMessageQueue {
     private defaultPriority;
     private queues;
@@ -15,4 +30,5 @@ export declare class PriorityBasedMessageQueue {
     push(msg: SyncMessage): Promise<void>;
     pull(): QueueEntry | undefined;
 }
+export {};
 //# sourceMappingURL=PriorityBasedMessageQueue.d.ts.map

package/dist/PriorityBasedMessageQueue.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"PriorityBasedMessageQueue.d.ts","sourceRoot":"","sources":["../src/PriorityBasedMessageQueue.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AACrD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAkB7C,MAAM,MAAM,UAAU,GAAG;IACvB,GAAG,EAAE,WAAW,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,OAAO,EAAE,MAAM,IAAI,CAAC;IACpB,MAAM,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK,IAAI,CAAC;CAC9B,CAAC;AAYF,qBAAa,yBAAyB;IAcxB,OAAO,CAAC,eAAe;IAbnC,OAAO,CAAC,MAAM,CAAgD;IAC9D,gBAAgB,sFAMX;IAEL,OAAO,CAAC,QAAQ;gBAII,eAAe,EAAE,eAAe;IAE7C,IAAI,CAAC,GAAG,EAAE,WAAW;IAerB,IAAI;CAaZ"}
+{"version":3,"file":"PriorityBasedMessageQueue.d.ts","sourceRoot":"","sources":["../src/PriorityBasedMessageQueue.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AACrD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAkB7C,MAAM,MAAM,UAAU,GAAG;IACvB,GAAG,EAAE,WAAW,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,OAAO,EAAE,MAAM,IAAI,CAAC;IACpB,MAAM,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK,IAAI,CAAC;CAC9B,CAAC;AAaF,KAAK,cAAc,CAAC,CAAC,IAAI;IACvB,KAAK,EAAE,CAAC,CAAC;IACT,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;CACrC,CAAC;AAEF;;;GAGG;AACH,qBAAa,UAAU,CAAC,CAAC;IACvB,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,SAAS,CAAa;IAChD,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,SAAS,CAAa;IAChD,MAAM,SAAK;IAEX,IAAI,CAAC,KAAK,EAAE,CAAC;IAgBb,KAAK;CAkBN;AAED,qBAAa,yBAAyB;IAuBxB,OAAO,CAAC,eAAe;IAtBnC,OAAO,CAAC,MAAM,CASZ;IACF,gBAAgB,sFAMX;IAEL,OAAO,CAAC,QAAQ;gBAII,eAAe,EAAE,eAAe;IAE7C,IAAI,CAAC,GAAG,EAAE,WAAW;IAerB,IAAI;CAaZ"}

package/dist/PriorityBasedMessageQueue.js

@@ -12,13 +12,62 @@ function promiseWithResolvers() {
         reject,
     };
 }
+/**
+ * Using a linked list to make the shift operation O(1) instead of O(n)
+ * as our queues can grow very large when the system is under pressure.
+ */
+export class LinkedList {
+    constructor() {
+        this.head = undefined;
+        this.tail = undefined;
+        this.length = 0;
+    }
+    push(value) {
+        const node = { value, next: undefined };
+        if (this.head === undefined) {
+            this.head = node;
+            this.tail = node;
+        }
+        else if (this.tail) {
+            this.tail.next = node;
+            this.tail = node;
+        }
+        else {
+            throw new Error("LinkedList is corrupted");
+        }
+        this.length++;
+    }
+    shift() {
+        if (!this.head) {
+            return undefined;
+        }
+        const node = this.head;
+        const value = node.value;
+        this.head = node.next;
+        node.next = undefined;
+        if (this.head === undefined) {
+            this.tail = undefined;
+        }
+        this.length--;
+        return value;
+    }
+}
 export class PriorityBasedMessageQueue {
     getQueue(priority) {
         return this.queues[priority];
     }
     constructor(defaultPriority) {
         this.defaultPriority = defaultPriority;
-        this.queues = [[], [], [], [], [], [], [], []];
+        this.queues = [
+            new LinkedList(),
+            new LinkedList(),
+            new LinkedList(),
+            new LinkedList(),
+            new LinkedList(),
+            new LinkedList(),
+            new LinkedList(),
+            new LinkedList(),
+        ];
         this.queueSizeCounter = metrics
             .getMeter("cojson")
             .createUpDownCounter("jazz.messagequeue.size", {

package/dist/PriorityBasedMessageQueue.js.map

@@ -1 +1 @@
-{"version":3,"file":"PriorityBasedMessageQueue.js","sourceRoot":"","sources":["../src/PriorityBasedMessageQueue.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAIxD,SAAS,oBAAoB;IAC3B,IAAI,OAAO,GAAG,CAAC,CAAI,EAAE,EAAE,GAAE,CAAC,CAAC;IAC3B,IAAI,MAAM,GAAG,CAAC,CAAU,EAAE,EAAE,GAAE,CAAC,CAAC;IAEhC,MAAM,OAAO,GAAG,IAAI,OAAO,CAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE;QACnD,OAAO,GAAG,QAAQ,CAAC;QACnB,MAAM,GAAG,OAAO,CAAC;IACnB,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,OAAO;QACP,OAAO;QACP,MAAM;KACP,CAAC;AACJ,CAAC;AAmBD,MAAM,OAAO,yBAAyB;IAU5B,QAAQ,CAAC,QAAyB;QACxC,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC/B,CAAC;IAED,YAAoB,eAAgC;QAAhC,oBAAe,GAAf,eAAe,CAAiB;QAb5C,WAAM,GAAe,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9D,qBAAgB,GAAG,OAAO;aACvB,QAAQ,CAAC,QAAQ,CAAC;aAClB,mBAAmB,CAAC,wBAAwB,EAAE;YAC7C,WAAW,EAAE,2BAA2B;YACxC,SAAS,EAAE,SAAS,CAAC,GAAG;YACxB,IAAI,EAAE,OAAO;SACd,CAAC,CAAC;IAMkD,CAAC;IAEjD,IAAI,CAAC,GAAgB;QAC1B,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,oBAAoB,EAAQ,CAAC;QAClE,MAAM,KAAK,GAAe,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;QAE5D,MAAM,QAAQ,GAAG,UAAU,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC;QAEzE,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEpC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE;YAC3B,QAAQ;SACT,CAAC,CAAC;QAEH,OAAO,OAAO,CAAC;IACjB,CAAC;IAEM,IAAI;QACT,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEpE,IAAI,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;YACpB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YAC5B,QAAQ;SACT,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,CAAC;IACxC,CAAC;CACF"}
+{"version":3,"file":"PriorityBasedMessageQueue.js","sourceRoot":"","sources":["../src/PriorityBasedMessageQueue.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAIxD,SAAS,oBAAoB;IAC3B,IAAI,OAAO,GAAG,CAAC,CAAI,EAAE,EAAE,GAAE,CAAC,CAAC;IAC3B,IAAI,MAAM,GAAG,CAAC,CAAU,EAAE,EAAE,GAAE,CAAC,CAAC;IAEhC,MAAM,OAAO,GAAG,IAAI,OAAO,CAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE;QACnD,OAAO,GAAG,QAAQ,CAAC;QACnB,MAAM,GAAG,OAAO,CAAC;IACnB,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,OAAO;QACP,OAAO;QACP,MAAM;KACP,CAAC;AACJ,CAAC;AAyBD;;;GAGG;AACH,MAAM,OAAO,UAAU;IAAvB;QACE,SAAI,GAAkC,SAAS,CAAC;QAChD,SAAI,GAAkC,SAAS,CAAC;QAChD,WAAM,GAAG,CAAC,CAAC;IAoCb,CAAC;IAlCC,IAAI,CAAC,KAAQ;QACX,MAAM,IAAI,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;QAExC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;QAC7C,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;QAEtB,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;QACxB,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;QAEd,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED,MAAM,OAAO,yBAAyB;IAmB5B,QAAQ,CAAC,QAAyB;QACxC,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC/B,CAAC;IAED,YAAoB,eAAgC;QAAhC,oBAAe,GAAf,eAAe,CAAiB;QAtB5C,WAAM,GAAe;YAC3B,IAAI,UAAU,EAAc;YAC5B,IAAI,UAAU,EAAc;YAC5B,IAAI,UAAU,EAAc;YAC5B,IAAI,UAAU,EAAc;YAC5B,IAAI,UAAU,EAAc;YAC5B,IAAI,UAAU,EAAc;YAC5B,IAAI,UAAU,EAAc;YAC5B,IAAI,UAAU,EAAc;SAC7B,CAAC;QACF,qBAAgB,GAAG,OAAO;aACvB,QAAQ,CAAC,QAAQ,CAAC;aAClB,mBAAmB,CAAC,wBAAwB,EAAE;YAC7C,WAAW,EAAE,2BAA2B;YACxC,SAAS,EAAE,SAAS,CAAC,GAAG;YACxB,IAAI,EAAE,OAAO;SACd,CAAC,CAAC;IAMkD,CAAC;IAEjD,IAAI,CAAC,GAAgB;QAC1B,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,oBAAoB,EAAQ,CAAC;QAClE,MAAM,KAAK,GAAe,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;QAE5D,MAAM,QAAQ,GAAG,UAAU,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC;QAEzE,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEpC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE;YAC3B,QAAQ;SACT,CAAC,CAAC;QAEH,OAAO,OAAO,CAAC;IACjB,CAAC;IAEM,IAAI;QACT,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEpE,IAAI,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;YACpB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YAC5B,QAAQ;SACT,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,CAAC;IACxC,CAAC;CACF"}

package/dist/tests/LinkedList.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=LinkedList.test.d.ts.map

package/dist/tests/LinkedList.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"LinkedList.test.d.ts","sourceRoot":"","sources":["../../src/tests/LinkedList.test.ts"],"names":[],"mappings":""}

package/dist/tests/LinkedList.test.js

@@ -0,0 +1,84 @@
+import { beforeEach, describe, expect, it } from "vitest";
+import { LinkedList } from "../PriorityBasedMessageQueue";
+describe("LinkedList", () => {
+    let list;
+    beforeEach(() => {
+        list = new LinkedList();
+    });
+    describe("initialization", () => {
+        it("should create an empty list", () => {
+            expect(list.length).toBe(0);
+            expect(list.head).toBeUndefined();
+            expect(list.tail).toBeUndefined();
+        });
+    });
+    describe("push", () => {
+        it("should add an element to an empty list", () => {
+            list.push(1);
+            expect(list.length).toBe(1);
+            expect(list.head?.value).toBe(1);
+            expect(list.tail?.value).toBe(1);
+        });
+        it("should add multiple elements in sequence", () => {
+            list.push(1);
+            list.push(2);
+            list.push(3);
+            expect(list.length).toBe(3);
+            expect(list.head?.value).toBe(1);
+            expect(list.tail?.value).toBe(3);
+        });
+    });
+    describe("shift", () => {
+        it("should return undefined for empty list", () => {
+            expect(list.shift()).toBeUndefined();
+            expect(list.length).toBe(0);
+            expect(list.head).toBeUndefined();
+            expect(list.tail).toBeUndefined();
+        });
+        it("should remove and return the first element", () => {
+            list.push(1);
+            list.push(2);
+            const shifted = list.shift();
+            expect(shifted).toBe(1);
+            expect(list.length).toBe(1);
+            expect(list.head?.value).toBe(2);
+            expect(list.tail?.value).toBe(2);
+        });
+        it("should maintain correct order when shifting multiple times", () => {
+            list.push(1);
+            list.push(2);
+            list.push(3);
+            expect(list.shift()).toBe(1);
+            expect(list.shift()).toBe(2);
+            expect(list.shift()).toBe(3);
+            expect(list.length).toBe(0);
+            expect(list.head).toBeUndefined();
+            expect(list.tail).toBeUndefined();
+        });
+        it("should handle shift after last element is removed", () => {
+            list.push(1);
+            list.shift();
+            expect(list.shift()).toBeUndefined();
+            expect(list.length).toBe(0);
+            expect(list.head).toBeUndefined();
+            expect(list.tail).toBeUndefined();
+        });
+    });
+    describe("edge cases", () => {
+        it("should handle push after all elements have been shifted", () => {
+            list.push(1);
+            list.shift();
+            list.push(2);
+            expect(list.length).toBe(1);
+            expect(list.shift()).toBe(2);
+        });
+        it("should handle alternating push and shift operations", () => {
+            list.push(1);
+            expect(list.shift()).toBe(1);
+            list.push(2);
+            expect(list.shift()).toBe(2);
+            expect(list.length).toBe(0);
+        });
+    });
+});
+//# sourceMappingURL=LinkedList.test.js.map

package/dist/tests/LinkedList.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LinkedList.test.js","sourceRoot":"","sources":["../../src/tests/LinkedList.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAC1D,OAAO,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAE1D,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;IAC1B,IAAI,IAAwB,CAAC;IAE7B,UAAU,CAAC,GAAG,EAAE;QACd,IAAI,GAAG,IAAI,UAAU,EAAU,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC9B,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACrC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;QACpC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE;QACpB,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAChD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YAClD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACrB,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAChD,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;YACrC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACpD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAEb,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC7B,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;YACpE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAEb,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAC3D,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;YACrC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;QACpC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC1B,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;YACjE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC7D,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/package.json

@@ -25,7 +25,7 @@
   },
   "type": "module",
   "license": "MIT",
-  "version": "0.12.0",
+  "version": "0.12.1",
   "devDependencies": {
     "@opentelemetry/sdk-metrics": "^2.0.0",
     "typescript": "~5.6.2",

package/src/PriorityBasedMessageQueue.ts

@@ -33,10 +33,70 @@ type Tuple<T, N extends number, A extends unknown[] = []> = A extends {
 }
   ? A
   : Tuple<T, N, [...A, T]>;
-type QueueTuple = Tuple<QueueEntry[], 8>;
+
+type QueueTuple = Tuple<LinkedList<QueueEntry>, 8>;
+
+type LinkedListNode<T> = {
+  value: T;
+  next: LinkedListNode<T> | undefined;
+};
+
+/**
+ * Using a linked list to make the shift operation O(1) instead of O(n)
+ * as our queues can grow very large when the system is under pressure.
+ */
+export class LinkedList<T> {
+  head: LinkedListNode<T> | undefined = undefined;
+  tail: LinkedListNode<T> | undefined = undefined;
+  length = 0;
+
+  push(value: T) {
+    const node = { value, next: undefined };
+
+    if (this.head === undefined) {
+      this.head = node;
+      this.tail = node;
+    } else if (this.tail) {
+      this.tail.next = node;
+      this.tail = node;
+    } else {
+      throw new Error("LinkedList is corrupted");
+    }
+
+    this.length++;
+  }
+
+  shift() {
+    if (!this.head) {
+      return undefined;
+    }
+
+    const node = this.head;
+    const value = node.value;
+    this.head = node.next;
+    node.next = undefined;
+
+    if (this.head === undefined) {
+      this.tail = undefined;
+    }
+
+    this.length--;
+
+    return value;
+  }
+}
 
 export class PriorityBasedMessageQueue {
-  private queues: QueueTuple = [[], [], [], [], [], [], [], []];
+  private queues: QueueTuple = [
+    new LinkedList<QueueEntry>(),
+    new LinkedList<QueueEntry>(),
+    new LinkedList<QueueEntry>(),
+    new LinkedList<QueueEntry>(),
+    new LinkedList<QueueEntry>(),
+    new LinkedList<QueueEntry>(),
+    new LinkedList<QueueEntry>(),
+    new LinkedList<QueueEntry>(),
+  ];
   queueSizeCounter = metrics
     .getMeter("cojson")
     .createUpDownCounter("jazz.messagequeue.size", {

package/src/tests/LinkedList.test.ts

@@ -0,0 +1,96 @@
+import { beforeEach, describe, expect, it } from "vitest";
+import { LinkedList } from "../PriorityBasedMessageQueue";
+
+describe("LinkedList", () => {
+  let list: LinkedList<number>;
+
+  beforeEach(() => {
+    list = new LinkedList<number>();
+  });
+
+  describe("initialization", () => {
+    it("should create an empty list", () => {
+      expect(list.length).toBe(0);
+      expect(list.head).toBeUndefined();
+      expect(list.tail).toBeUndefined();
+    });
+  });
+
+  describe("push", () => {
+    it("should add an element to an empty list", () => {
+      list.push(1);
+      expect(list.length).toBe(1);
+      expect(list.head?.value).toBe(1);
+      expect(list.tail?.value).toBe(1);
+    });
+
+    it("should add multiple elements in sequence", () => {
+      list.push(1);
+      list.push(2);
+      list.push(3);
+      expect(list.length).toBe(3);
+      expect(list.head?.value).toBe(1);
+      expect(list.tail?.value).toBe(3);
+    });
+  });
+
+  describe("shift", () => {
+    it("should return undefined for empty list", () => {
+      expect(list.shift()).toBeUndefined();
+      expect(list.length).toBe(0);
+      expect(list.head).toBeUndefined();
+      expect(list.tail).toBeUndefined();
+    });
+
+    it("should remove and return the first element", () => {
+      list.push(1);
+      list.push(2);
+
+      const shifted = list.shift();
+      expect(shifted).toBe(1);
+      expect(list.length).toBe(1);
+      expect(list.head?.value).toBe(2);
+      expect(list.tail?.value).toBe(2);
+    });
+
+    it("should maintain correct order when shifting multiple times", () => {
+      list.push(1);
+      list.push(2);
+      list.push(3);
+
+      expect(list.shift()).toBe(1);
+      expect(list.shift()).toBe(2);
+      expect(list.shift()).toBe(3);
+      expect(list.length).toBe(0);
+      expect(list.head).toBeUndefined();
+      expect(list.tail).toBeUndefined();
+    });
+
+    it("should handle shift after last element is removed", () => {
+      list.push(1);
+      list.shift();
+      expect(list.shift()).toBeUndefined();
+      expect(list.length).toBe(0);
+      expect(list.head).toBeUndefined();
+      expect(list.tail).toBeUndefined();
+    });
+  });
+
+  describe("edge cases", () => {
+    it("should handle push after all elements have been shifted", () => {
+      list.push(1);
+      list.shift();
+      list.push(2);
+      expect(list.length).toBe(1);
+      expect(list.shift()).toBe(2);
+    });
+
+    it("should handle alternating push and shift operations", () => {
+      list.push(1);
+      expect(list.shift()).toBe(1);
+      list.push(2);
+      expect(list.shift()).toBe(2);
+      expect(list.length).toBe(0);
+    });
+  });
+});