queue-typed 2.4.3 → 2.4.4

package/dist/cjs/index.cjs

@@ -653,7 +653,7 @@ var SinglyLinkedList = class extends LinearLinkedBase {
   static {
     __name(this, "SinglyLinkedList");
   }
-  _equals = Object.is;
+  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * Create a SinglyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -757,8 +757,8 @@ var SinglyLinkedList = class extends LinearLinkedBase {
       return value2;
     }
     let current = this.head;
-    while (current.next !== this.tail) current = current.next;
-    const value = this.tail.value;
+    while (current.next && current.next !== this.tail) current = current.next;
+    const value = this.tail?.value;
     current.next = void 0;
     this._tail = current;
     this._length--;
@@ -846,8 +846,8 @@ var SinglyLinkedList = class extends LinearLinkedBase {
   at(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
-    return current.value;
+    for (let i = 0; i < index && current; i++) current = current.next;
+    return current?.value;
   }
   /**
    * Type guard: check whether the input is a SinglyLinkedListNode.
@@ -867,7 +867,7 @@ var SinglyLinkedList = class extends LinearLinkedBase {
   getNodeAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
+    for (let i = 0; i < index && current; i++) current = current.next;
     return current;
   }
   /**
@@ -1712,7 +1712,7 @@ var Deque = class extends LinearBase {
   static {
     __name(this, "Deque");
   }
-  _equals = Object.is;
+  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * Create a Deque and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)